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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
|
//------------------------------------------------------------------------------
// GraphBLAS/Demo/Program/grow_demo.c: grow a matrix row-by-row
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// Reads in a matrix A, then does C = A one row at a time.
#include "graphblas_demos.h"
#include "usercomplex.h"
#include "usercomplex.c"
#include "wathen.c"
#include "random_matrix.c"
#include "read_matrix.c"
#include "get_matrix.c"
// macro used by OK(...) to free workspace if an error occurs
#undef FREE_ALL
#define FREE_ALL \
GrB_Matrix_free (&A) ; \
GrB_Matrix_free (&C) ; \
GrB_Matrix_free (&T) ; \
GrB_Matrix_free (&W) ; \
GrB_Vector_free (&w) ; \
GrB_Info check_result (GrB_Matrix A1, GrB_Matrix C1, GrB_BinaryOp eq) ;
GrB_Info check_result (GrB_Matrix A1, GrB_Matrix C1, GrB_BinaryOp eq)
{
double t = WALLCLOCK ;
GrB_Info info ;
GrB_Matrix A = NULL, C = NULL, T = NULL, W = NULL ;
GrB_Vector w = NULL ;
GrB_Index anvals, cnvals, tnvals, anrows, ancols ;
OK (GrB_Matrix_nrows (&anrows, A1)) ;
OK (GrB_Matrix_ncols (&ancols, A1)) ;
OK (GrB_Matrix_nvals (&anvals, A1)) ;
OK (GrB_Matrix_nvals (&cnvals, C1)) ;
CHECK (anvals == cnvals, GrB_PANIC) ;
OK (GrB_Matrix_new (&T, GrB_BOOL, anrows, ancols)) ;
OK (GrB_Matrix_eWiseMult_BinaryOp (T, NULL, NULL, eq, A1, C1, NULL)) ;
// OK (GxB_print (T, 2)) ;
OK (GrB_Matrix_nvals (&tnvals, T)) ;
CHECK (anvals == tnvals, GrB_PANIC) ;
bool ok = true ;
OK (GrB_Matrix_reduce_BOOL (&ok, NULL, GrB_LAND_MONOID_BOOL, T, NULL)) ;
CHECK (ok, GrB_PANIC) ;
t = (WALLCLOCK - t) ;
FREE_ALL ;
printf ("A and C match, time %g\n", t) ;
return (GrB_SUCCESS) ;
}
int main (int argc, char **argv)
{
//--------------------------------------------------------------------------
// check inputs
//--------------------------------------------------------------------------
GrB_Matrix A = NULL, C = NULL, T = NULL, W = NULL ;
GrB_Vector w = NULL ;
GrB_Info info ;
OK (GrB_init (GrB_NONBLOCKING)) ;
// OK (GrB_Global_set_INT32 (GrB_GLOBAL, true, GxB_BURBLE)) ;
int32_t nthreads ;
OK (GrB_Global_get_INT32 (GrB_GLOBAL, &nthreads, GxB_NTHREADS)) ;
fprintf (stderr, "grow demo: nthreads %d\n", nthreads) ;
//--------------------------------------------------------------------------
// get A matrix
//--------------------------------------------------------------------------
uint64_t state = 1 ;
OK (get_matrix (&A, argc, argv, false, false, false, &state)) ;
GrB_Index anrows, ancols ;
OK (GrB_Matrix_nrows (&anrows, A)) ;
OK (GrB_Matrix_ncols (&ancols, A)) ;
int32_t type_code ;
OK (GrB_Matrix_get_INT32 (A, &type_code, GrB_EL_TYPE_CODE)) ;
GrB_Type atype = NULL ;
GrB_BinaryOp eq = NULL ;
switch (type_code)
{
case GrB_BOOL_CODE : atype = GrB_BOOL ; eq = GrB_EQ_BOOL ; break ;
case GrB_INT8_CODE : atype = GrB_INT8 ; eq = GrB_EQ_INT8 ; break ;
case GrB_UINT8_CODE : atype = GrB_UINT8 ; eq = GrB_EQ_UINT8 ; break ;
case GrB_INT16_CODE : atype = GrB_INT16 ; eq = GrB_EQ_INT16 ; break ;
case GrB_UINT16_CODE : atype = GrB_UINT16 ; eq = GrB_EQ_UINT16 ; break ;
case GrB_INT32_CODE : atype = GrB_INT32 ; eq = GrB_EQ_INT32 ; break ;
case GrB_UINT32_CODE : atype = GrB_UINT32 ; eq = GrB_EQ_UINT32 ; break ;
case GrB_INT64_CODE : atype = GrB_INT64 ; eq = GrB_EQ_INT64 ; break ;
case GrB_UINT64_CODE : atype = GrB_UINT64 ; eq = GrB_EQ_UINT64 ; break ;
case GrB_FP32_CODE : atype = GrB_FP32 ; eq = GrB_EQ_FP32 ; break ;
case GrB_FP64_CODE : atype = GrB_FP64 ; eq = GrB_EQ_FP64 ; break ;
case GxB_FC32_CODE : atype = GxB_FC32 ; eq = GxB_EQ_FC32 ; break ;
case GxB_FC64_CODE : atype = GxB_FC64 ; eq = GxB_EQ_FC64 ; break ;
default : ;
}
CHECK (atype != NULL, GrB_INVALID_VALUE) ;
OK (GxB_Matrix_fprint (A, "A", 1, stdout)) ;
//--------------------------------------------------------------------------
// C = A, one row at a time
//--------------------------------------------------------------------------
OK (GrB_Matrix_new (&C, atype, anrows, ancols)) ;
OK (GrB_Vector_new (&w, atype, ancols)) ;
OK (GrB_Matrix_set_INT32 (C, (int32_t) false, GxB_HYPER_HASH)) ;
OK (GrB_Matrix_set_INT32 (C, GxB_HYPERSPARSE, GxB_SPARSITY_CONTROL)) ;
OK (GrB_Vector_set_INT32 (w, GxB_SPARSE, GxB_SPARSITY_CONTROL)) ;
double t, tt [4] = {0, 0, 0, 0}, t2 [4] = {0, 0, 0, 0} ;
tt [0] = WALLCLOCK ;
for (int64_t i = 0 ; i < anrows ; i++)
{
// w = A (i,:), using A' via the descriptor
t = WALLCLOCK ;
OK (GrB_Col_extract (w, NULL, NULL, A, GrB_ALL, ancols, i,
GrB_DESC_T0)) ;
tt [1] += (WALLCLOCK - t) ;
// C (i,:) = w
t = WALLCLOCK ;
OK (GrB_Row_assign (C, NULL, NULL, w, i, GrB_ALL, ancols, NULL)) ;
tt [2] += (WALLCLOCK - t) ;
// ensure C is finished
t = WALLCLOCK ;
OK (GrB_Matrix_wait (C, GrB_MATERIALIZE)) ;
tt [3] += (WALLCLOCK - t) ;
}
OK (GrB_Global_set_INT32 (GrB_GLOBAL, false, GxB_BURBLE)) ;
tt [0] = WALLCLOCK - tt [0] ;
printf ("one row at a time:\n") ;
printf ("total time: %g\n", tt [0]) ;
printf ("extract: %g\n", tt [1]) ;
printf ("assign: %g\n", tt [2]) ;
printf ("wait: %g\n", tt [3]) ;
// check to see if A and C are equal
OK (check_result (A, C, eq)) ;
//--------------------------------------------------------------------------
// C = A, multiple rows at a time
//--------------------------------------------------------------------------
GrB_Matrix_free (&C) ;
OK (GrB_Matrix_new (&C, atype, anrows, ancols)) ;
OK (GrB_Matrix_set_INT32 (C, GxB_HYPERSPARSE, GxB_SPARSITY_CONTROL)) ;
t2 [0] = WALLCLOCK ;
int64_t i1 = 0 ;
int64_t ilast = anrows - 1 ;
while (i1 <= ilast)
{
// determine the rows i1:i2 of A to append
int64_t irows = (ilast - i1) / 2 ;
if (irows == 0) irows = 1 ;
int64_t i2 = i1 + irows - 1 ;
if (i2 > ilast) i2 = ilast ;
irows = i2 - i1 + 1 ;
// W = A (i1:i2,:)
t = WALLCLOCK ;
OK (GrB_Matrix_new (&W, atype, irows, ancols)) ;
OK (GrB_Matrix_set_INT32 (W, GxB_SPARSE, GxB_SPARSITY_CONTROL)) ;
GrB_Index Icolon [3] ;
Icolon [GxB_BEGIN] = i1 ;
Icolon [GxB_INC ] = 1 ;
Icolon [GxB_END ] = i2 ;
info = GrB_Matrix_extract (W, NULL, NULL, A, Icolon, GxB_RANGE,
GrB_ALL, ancols, NULL) ;
OK (info) ;
t2 [1] += (WALLCLOCK - t) ;
// C (i1:i2,:) = W
t = WALLCLOCK ;
OK (GrB_Matrix_assign (C, NULL, NULL, W,
Icolon, GxB_RANGE, GrB_ALL, ancols, NULL)) ;
t2 [2] += (WALLCLOCK - t) ;
// ensure C is finished
t = WALLCLOCK ;
OK (GrB_Matrix_wait (C, GrB_MATERIALIZE)) ;
t2 [3] += (WALLCLOCK - t) ;
GrB_Matrix_free (&W) ;
i1 += irows ;
}
OK (GrB_Global_set_INT32 (GrB_GLOBAL, false, GxB_BURBLE)) ;
t2 [0] = WALLCLOCK - t2 [0] ;
printf ("\nmany rows at a time:\n") ;
printf ("total time: %g\n", t2 [0]) ;
printf ("extract: %g\n", t2 [1]) ;
printf ("assign: %g\n", t2 [2]) ;
printf ("wait: %g\n", t2 [3]) ;
// check to see if A and C are equal
OK (check_result (A, C, eq)) ;
//--------------------------------------------------------------------------
// C = A, using dup (1 threads and all threads)
//--------------------------------------------------------------------------
printf ("\nsingle call to dup:\n") ;
for (int trial = 1 ; trial <= 2 ; trial++)
{
int32_t threads ;
GrB_Global_get_INT32 (GrB_GLOBAL, &threads, GxB_GLOBAL_NTHREADS) ;
GrB_Matrix_free (&T) ;
t = WALLCLOCK ;
OK (GrB_Matrix_dup (&T, A)) ;
t = (WALLCLOCK - t) ;
printf ("dup: %g (%d threads)\n", t, threads) ;
GrB_Global_set_INT32 (GrB_GLOBAL, (int) 1, GxB_GLOBAL_NTHREADS) ;
}
//--------------------------------------------------------------------------
// try different integer sizes
//--------------------------------------------------------------------------
#if 0
// OK (GrB_Global_set_INT32 (GrB_GLOBAL, 1, GxB_BURBLE)) ;
for (int p_hint = 0 ; p_hint <= 64 ; p_hint += 32)
{
for (int i_hint = 0 ; i_hint <= 64 ; i_hint += 32)
{
int p_size, i_size, p_hint2, i_hint2 ;
printf ("\np_hint: %d i_hint: %d\n", p_hint, i_hint) ;
OK (GrB_Matrix_set_INT32 (A, p_hint, GxB_OFFSET_INTEGER_HINT)) ;
OK (GrB_Matrix_set_INT32 (A, i_hint, GxB_INDEX_INTEGER_HINT)) ;
OK (GrB_Matrix_get_INT32 (A, &p_size, GxB_OFFSET_INTEGER_BITS)) ;
OK (GrB_Matrix_get_INT32 (A, &i_size, GxB_INDEX_INTEGER_BITS)) ;
OK (GrB_Matrix_get_INT32 (A, &p_hint2, GxB_OFFSET_INTEGER_HINT)) ;
OK (GrB_Matrix_get_INT32 (A, &i_hint2, GxB_INDEX_INTEGER_HINT)) ;
printf ("p_size %d i_size %d\n", p_size, i_size) ;
CHECK (p_hint == p_hint2, GrB_PANIC) ;
CHECK (i_hint == i_hint2, GrB_PANIC) ;
OK (GxB_print (A, GxB_SUMMARY)) ;
}
}
GrB_Matrix_free (&A) ;
for (int p_hint = 32 ; p_hint <= 64 ; p_hint += 32)
{
for (int i_hint = 32 ; i_hint <= 64 ; i_hint += 32)
{
int p_size, i_size ;
printf ("\nglobal p_hint: %d i_hint: %d\n", p_hint, i_hint) ;
OK (GrB_Global_set_INT32 (GrB_GLOBAL, p_hint,
GxB_OFFSET_INTEGER_HINT)) ;
OK (GrB_Global_set_INT32 (GrB_GLOBAL, i_hint,
GxB_INDEX_INTEGER_HINT)) ;
OK (GrB_Matrix_new (&A, GrB_FP32, 10, 10)) ;
OK (GrB_Matrix_get_INT32 (A, &p_size, GxB_OFFSET_INTEGER_BITS)) ;
OK (GrB_Matrix_get_INT32 (A, &i_size, GxB_INDEX_INTEGER_BITS)) ;
printf ("p_size %d i_size %d\n", p_size, i_size) ;
OK (GxB_print (A, GxB_SUMMARY)) ;
GrB_Matrix_free (&A) ;
}
}
#endif
printf ("grow_demo: all tests passed\n") ;
FREE_ALL ;
GrB_finalize ( ) ;
return (0) ;
}
|
