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
|
//------------------------------------------------------------------------------
// GB_bitmap_assign_3_template: C bitmap, M sparse/hyper, with accum
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// C<M>(I,J) += A assign
// C(I,J)<M> += A subassign
// C<M,repl>(I,J) += A assign
// C(I,J)<M,repl> += A subassign
//------------------------------------------------------------------------------
// C: bitmap
// M: present, hypersparse or sparse (not bitmap or full)
// Mask_comp: false
// Mask_struct: true or false
// C_replace: true or false
// accum: present
// A: matrix (hyper, sparse, bitmap, or full), or scalar
// kind: assign, row assign, col assign, or subassign
// If C were full: entries can be deleted only if C_replace is true.
#undef GB_FREE_ALL
#define GB_FREE_ALL GB_FREE_ALL_FOR_BITMAP
{
//--------------------------------------------------------------------------
// get C, M, A, and accum
//--------------------------------------------------------------------------
GB_GET_C_A_SCALAR_FOR_BITMAP
GB_SLICE_M_FOR_BITMAP
GB_GET_ACCUM_FOR_BITMAP
// if C FULL: if C_replace false, no deletion occurs
// if C_replace is true: convert C to bitmap first
//--------------------------------------------------------------------------
// do the assignment
//--------------------------------------------------------------------------
if (GB_SCALAR_ASSIGN && GB_ASSIGN_KIND == GB_SUBASSIGN)
{
//----------------------------------------------------------------------
// scalar subassignment: C(I,J)<M> += scalar
//----------------------------------------------------------------------
ASSERT (GB_ASSIGN_KIND == GB_SUBASSIGN) ;
int64_t keep = C_replace ? 3 : 1 ;
// for all entries in the mask M:
#undef GB_MASK_WORK
#define GB_MASK_WORK(pC) \
{ \
int8_t cb = Cb [pC] ; \
/* keep this entry */ \
Cb [pC] = keep ; \
if (cb == 0) \
{ \
/* Cx [pC] = scalar */ \
GB_COPY_cwork_to_C (Cx, pC, cwork, C_iso) ; \
task_cnvals++ ; \
} \
else /* (cb == 1) */ \
{ \
/* Cx [pC] += scalar */ \
GB_ACCUMULATE_scalar (Cx, pC, ywork, C_iso) ; \
} \
}
#include "template/GB_bitmap_assign_M_sub_template.c"
if (C_replace)
{
// for all entries in IxJ
#undef GB_IXJ_WORK
#define GB_IXJ_WORK(pC,ignore) \
{ \
int8_t cb = Cb [pC] ; \
Cb [pC] = (cb == 3) ; \
task_cnvals -= (cb == 1) ; \
}
#include "template/GB_bitmap_assign_IxJ_template.c"
}
}
else
{
//----------------------------------------------------------------------
// scatter M into C
//----------------------------------------------------------------------
// Cb [pC] += 2 for each entry M(i,j) in the mask
#undef GB_MASK_WORK
#define GB_MASK_WORK(pC) Cb [pC] += 2
#define GB_NO_CNVALS
#include "template/GB_bitmap_assign_M_template.c"
#undef GB_NO_CNVALS
// the bitmap of C now contains:
// Cb (i,j) = 0: cij not present, mij zero, do not modify
// Cb (i,j) = 1: cij present, mij zero, do not modify
// Cb (i,j) = 2: cij not present, mij 1, can be modified
// Cb (i,j) = 3: cij present, mij 1, can be modified
if (GB_SCALAR_ASSIGN)
{
//------------------------------------------------------------------
// scalar assignment: C<M>(I,J) += scalar
//------------------------------------------------------------------
ASSERT (GB_ASSIGN_KIND == GB_ASSIGN) ;
// for all entries in IxJ
#undef GB_IXJ_WORK
#define GB_IXJ_WORK(pC,ignore) \
{ \
int8_t cb = Cb [pC] ; \
if (cb == 2) \
{ \
/* Cx [pC] = scalar */ \
GB_COPY_cwork_to_C (Cx, pC, cwork, C_iso) ; \
Cb [pC] = 3 ; \
task_cnvals++ ; \
} \
else if (cb == 3) \
{ \
/* Cx [pC] += scalar */ \
GB_ACCUMULATE_scalar (Cx, pC, ywork, C_iso) ; \
} \
}
#include "template/GB_bitmap_assign_IxJ_template.c"
}
else
{
//------------------------------------------------------------------
// matrix assignment: C<M>(I,J) += A or C(I,J)<M> += A
//------------------------------------------------------------------
// for all entries aij in A (A hyper, sparse, bitmap, or full)
// if Cb(p) == 0 // do nothing
// if Cb(p) == 1 // do nothing
// if Cb(p) == 2:
// Cx(p) = aij
// Cb(p) = 3 // C(iC,jC) is now present, insert
// task_cnvals++
// if Cb(p) == 3:
// Cx(p) += aij // C(iC,jC) still present, updated
// Cb(p) still 3
#define GB_AIJ_WORK(pC,pA) \
{ \
int8_t cb = Cb [pC] ; \
if (cb == 2) \
{ \
/* Cx [pC] = Ax [pA] */ \
GB_COPY_aij_to_C (Cx, pC, Ax, pA, A_iso, cwork, C_iso) ; \
Cb [pC] = 3 ; \
task_cnvals++ ; \
} \
else if (cb == 3) \
{ \
/* Cx [pC] += Ax [pA] */ \
GB_ACCUMULATE_aij (Cx, pC, Ax, pA, A_iso, ywork, C_iso) ;\
} \
}
#include "template/GB_bitmap_assign_A_template.c"
}
//----------------------------------------------------------------------
// final pass: clear M from C or handle C_replace
//----------------------------------------------------------------------
if (C_replace)
{
// scan all of C for the C_replace phase
// for row assign: for all entries in C(i,:)
// for col assign: for all entries in C(:,j)
// for assign: for all entries in C(:,:)
// for subassign: for all entries in C(I,J)
// 0 -> 0
// 1 -> 0 delete this entry
// 2 -> 0
// 3 -> 1: keep this entry. already counted above
#define GB_CIJ_WORK(pC) \
{ \
int8_t cb = Cb [pC] ; \
Cb [pC] = (cb == 3) ; \
task_cnvals -= (cb == 1) ; \
}
#include "template/GB_bitmap_assign_C_template.c"
}
else
{
// clear M from C
// Cb [pC] -= 2 for each entry M(i,j) in the mask
#undef GB_MASK_WORK
#define GB_MASK_WORK(pC) Cb [pC] -= 2
#define GB_NO_CNVALS
#include "template/GB_bitmap_assign_M_template.c"
#undef GB_NO_CNVALS
}
}
//--------------------------------------------------------------------------
// free workspace and return result
//--------------------------------------------------------------------------
C->nvals = cnvals ;
GB_FREE_ALL ;
ASSERT_MATRIX_OK (C, "final C for bitmap assign, M, accum", GB0) ;
return (GrB_SUCCESS) ;
}
|
