1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
//------------------------------------------------------------------------------
// GB_memoryUsage: # of bytes used for a matrix
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
#include "GB.h"
void GB_memoryUsage // count # allocated blocks and their sizes
(
int64_t *nallocs, // # of allocated memory blocks
size_t *mem_deep, // # of bytes in blocks owned by this matrix
size_t *mem_shallow, // # of bytes in blocks owned by another matrix
const GrB_Matrix A // matrix to query
)
{
//--------------------------------------------------------------------------
// check inputs
//--------------------------------------------------------------------------
ASSERT (nallocs != NULL) ;
ASSERT (mem_deep != NULL) ;
ASSERT (mem_shallow != NULL) ;
//--------------------------------------------------------------------------
// count the allocated blocks and their sizes
//--------------------------------------------------------------------------
// a matrix contains 0 to 10 dynamically malloc'd blocks, not including
// A->Y
(*nallocs) = 0 ;
(*mem_deep) = 0 ;
(*mem_shallow) = 0 ;
if (A == NULL)
{
#pragma omp flush
return ;
}
GB_Pending Pending = A->Pending ;
if (!A->static_header)
{
(*nallocs)++ ;
(*mem_deep) += A->header_size ;
}
if (A->p != NULL)
{
if (A->p_shallow)
{
(*mem_shallow) += A->p_size ;
}
else
{
(*nallocs)++ ;
(*mem_deep) += A->p_size ;
}
}
if (A->h != NULL)
{
if (A->h_shallow)
{
(*mem_shallow) += A->h_size ;
}
else
{
(*nallocs)++ ;
(*mem_deep) += A->h_size ;
}
}
if (A->b != NULL)
{
if (A->b_shallow)
{
(*mem_shallow) += A->b_size ;
}
else
{
(*nallocs)++ ;
(*mem_deep) += A->b_size ;
}
}
if (A->i != NULL)
{
if (A->i_shallow)
{
(*mem_shallow) += A->i_size ;
}
else
{
(*nallocs)++ ;
(*mem_deep) += A->i_size ;
}
}
if (A->x != NULL)
{
if (A->x_shallow)
{
(*mem_shallow) += A->x_size ;
}
else
{
(*nallocs)++ ;
(*mem_deep) += A->x_size ;
}
}
if (Pending != NULL)
{
(*nallocs)++ ;
(*mem_deep) += Pending->header_size ;
}
if (Pending != NULL && Pending->i != NULL)
{
(*nallocs)++ ;
(*mem_deep) += Pending->i_size ;
}
if (Pending != NULL && Pending->j != NULL)
{
(*nallocs)++ ;
(*mem_deep) += Pending->j_size ;
}
if (Pending != NULL && Pending->x != NULL)
{
(*nallocs)++ ;
(*mem_deep) += Pending->x_size ;
}
if (A->Y != NULL)
{
int64_t Y_nallocs = 0 ;
size_t Y_mem_deep = 0 ;
size_t Y_mem_shallow = 0 ;
GB_memoryUsage (&Y_nallocs, &Y_mem_deep, &Y_mem_shallow, A->Y) ;
if (A->Y_shallow)
{
// all of A->Y is shallow
(*mem_shallow) += Y_mem_shallow + Y_mem_deep ;
}
else
{
// A->Y itself is not shallow, but may contain shallow content
(*nallocs) += Y_nallocs ;
(*mem_deep) += Y_mem_deep ;
(*mem_shallow) += Y_mem_shallow ;
}
}
#pragma omp flush
return ;
}
|
