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
|
//------------------------------------------------------------------------------
// GB_concat_full: concatenate an array of matrices into a full matrix
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
#define GB_FREE_WORKSPACE \
GB_Matrix_free (&T) ;
#define GB_FREE_ALL \
GB_FREE_WORKSPACE ; \
GB_phybix_free (C) ;
#include "concat/GB_concat.h"
#include "jitifyer/GB_stringify.h"
#include "apply/GB_apply.h"
GrB_Info GB_concat_full // concatenate into a full matrix
(
GrB_Matrix C, // input/output matrix for results
const bool C_iso, // if true, construct C as iso
const GB_void *cscalar, // iso value of C, if C is iso
const GrB_Matrix *Tiles, // 2D row-major array of size m-by-n,
const uint64_t m,
const uint64_t n,
const int64_t *restrict Tile_rows, // size m+1
const int64_t *restrict Tile_cols, // size n+1
GB_Werk Werk
)
{
//--------------------------------------------------------------------------
// allocate C as a full matrix
//--------------------------------------------------------------------------
GrB_Info info ;
GrB_Matrix A = NULL ;
struct GB_Matrix_opaque T_header ;
GrB_Matrix T = NULL ;
GrB_Type ctype = C->type ;
int64_t cvlen = C->vlen ;
int64_t cvdim = C->vdim ;
bool csc = C->is_csc ;
size_t csize = ctype->size ;
GB_Type_code ccode = ctype->code ;
if (!GB_IS_FULL (C))
{
GB_phybix_free (C) ;
C->p_is_32 = false ; // OK: full always has p_is_32 = false
C->j_is_32 = false ; // OK: full always has j_is_32 = false
C->i_is_32 = false ; // OK: full always has i_is_32 = false
GB_OK (GB_bix_alloc (C, GB_nnz_full (C), GxB_FULL, false, true, C_iso));
C->plen = -1 ;
C->nvec = cvdim ;
// C->nvec_nonempty = (cvlen > 0) ? cvdim : 0 ;
GB_nvec_nonempty_set (C, (cvlen > 0) ? cvdim : 0) ;
}
ASSERT (GB_IS_FULL (C)) ;
int nthreads_max = GB_Context_nthreads_max ( ) ;
double chunk = GB_Context_chunk ( ) ;
int64_t nouter = csc ? n : m ;
int64_t ninner = csc ? m : n ;
if (C_iso)
{
// copy in the scalar as the iso value; no more work to do
memcpy (C->x, cscalar, csize) ;
C->magic = GB_MAGIC ;
ASSERT_MATRIX_OK (C, "C output for concat iso full", GB0) ;
return (GrB_SUCCESS) ;
}
//--------------------------------------------------------------------------
// concatenate all matrices into C
//--------------------------------------------------------------------------
for (int64_t outer = 0 ; outer < nouter ; outer++)
{
for (int64_t inner = 0 ; inner < ninner ; inner++)
{
//------------------------------------------------------------------
// get the tile A; transpose and typecast, if needed
//------------------------------------------------------------------
A = csc ? GB_TILE (Tiles, inner, outer)
: GB_TILE (Tiles, outer, inner) ;
ASSERT (GB_IS_FULL (A)) ;
if (csc != A->is_csc)
{
// T = (ctype) A', not in-place
GB_CLEAR_MATRIX_HEADER (T, &T_header) ;
GB_OK (GB_transpose_cast (T, ctype, csc, A, false, Werk)) ;
A = T ;
GB_MATRIX_WAIT (A) ;
}
ASSERT (C->is_csc == A->is_csc) ;
ASSERT (GB_IS_FULL (A)) ;
ASSERT (!GB_ANY_PENDING_WORK (A)) ;
GB_Type_code acode = A->type->code ;
//------------------------------------------------------------------
// determine where to place the tile in C
//------------------------------------------------------------------
// The tile A appears in vectors cvstart:cvend-1 of C, and indices
// cistart:ciend-1.
int64_t cvstart, cvend, cistart, ciend ;
if (csc)
{
// C and A are held by column
// Tiles is row-major and accessed in column order
cvstart = Tile_cols [outer] ;
cvend = Tile_cols [outer+1] ;
cistart = Tile_rows [inner] ;
ciend = Tile_rows [inner+1] ;
}
else
{
// C and A are held by row
// Tiles is row-major and accessed in row order
cvstart = Tile_rows [outer] ;
cvend = Tile_rows [outer+1] ;
cistart = Tile_cols [inner] ;
ciend = Tile_cols [inner+1] ;
}
int64_t avdim = cvend - cvstart ;
int64_t avlen = ciend - cistart ;
ASSERT (avdim == A->vdim) ;
ASSERT (avlen == A->vlen) ;
int64_t anz = avdim * avlen ;
int A_nthreads = GB_nthreads (anz, chunk, nthreads_max) ;
//------------------------------------------------------------------
// copy the tile A into C
//------------------------------------------------------------------
info = GrB_NO_VALUE ;
//------------------------------------------------------------------
// via the factory kernel (inline; not in FactoryKernels folder)
//------------------------------------------------------------------
#ifndef GBCOMPACT
GB_IF_FACTORY_KERNELS_ENABLED
{
if (ccode == acode)
{
// no typecasting needed
switch (csize)
{
#define GB_COPY(pC,pA,A_iso) \
Cx [pC] = Ax [A_iso ? 0 : pA] ;
case GB_1BYTE : // uint8, int8, bool, or 1-byte user
#define GB_C_TYPE uint8_t
#define GB_A_TYPE uint8_t
#include "concat/template/GB_concat_full_template.c"
info = GrB_SUCCESS ;
break ;
case GB_2BYTE : // uint16, int16, or 2-byte user
#define GB_C_TYPE uint16_t
#define GB_A_TYPE uint16_t
#include "concat/template/GB_concat_full_template.c"
info = GrB_SUCCESS ;
break ;
case GB_4BYTE : // uint32, int32, float, or 4-byte user
#define GB_C_TYPE uint32_t
#define GB_A_TYPE uint32_t
#include "concat/template/GB_concat_full_template.c"
info = GrB_SUCCESS ;
break ;
case GB_8BYTE : // uint64, int64, double, float complex,
// or 8-byte user defined
#define GB_C_TYPE uint64_t
#define GB_A_TYPE uint64_t
#include "concat/template/GB_concat_full_template.c"
info = GrB_SUCCESS ;
break ;
case GB_16BYTE : // double complex or 16-byte user
#define GB_C_TYPE GB_blob16
#define GB_A_TYPE GB_blob16
#include "concat/template/GB_concat_full_template.c"
info = GrB_SUCCESS ;
break ;
default:;
}
}
}
#endif
//------------------------------------------------------------------
// via the JIT or PreJIT kernel
//------------------------------------------------------------------
if (info == GrB_NO_VALUE)
{
struct GB_UnaryOp_opaque op_header ;
GB_Operator op = GB_unop_identity (ctype, &op_header) ;
ASSERT_OP_OK (op, "identity op for concat full", GB0) ;
info = GB_concat_full_jit (C, cistart, cvstart, op, A,
A_nthreads) ;
}
//------------------------------------------------------------------
// via the generic kernel
//------------------------------------------------------------------
if (info == GrB_NO_VALUE)
{
// with typecasting or user-defined types
GBURBLE ("(generic concat) ") ;
GB_cast_function cast_A_to_C = GB_cast_factory (ccode, acode) ;
size_t asize = A->type->size ;
#define GB_C_TYPE GB_void
#define GB_A_TYPE GB_void
#undef GB_COPY
#define GB_COPY(pC,pA,A_iso) \
cast_A_to_C (Cx + (pC)*csize, \
Ax + (A_iso ? 0:(pA)*asize), asize) ;
#include "concat/template/GB_concat_full_template.c"
info = GrB_SUCCESS ;
}
GB_FREE_WORKSPACE ;
if (info != GrB_SUCCESS)
{
// out of memory, or other error
GB_FREE_ALL ;
return (info) ;
}
}
}
C->magic = GB_MAGIC ;
ASSERT_MATRIX_OK (C, "C output for concat full", GB0) ;
return (GrB_SUCCESS) ;
}
|
