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
|
//------------------------------------------------------------------------------
// GB_bitmap_assign_M_template: traverse over M for bitmap assignment into C
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// This template traverses over all the entries of the mask matrix M, and
// operates on C(i,j) if the mask M(i,j) == 1, via the GB_MASK_WORK macro,
// where C(i,j) is at Cx [pC] and Cb [pC]. M is hypersparse or sparse.
// M has alreadly been sliced for parallel work. The tasks are held in
// pstart_Mslice, kfirst_Mslice, klast_Mslice, M_ntasks, and the work is done
// by M_nthreads threads.
// The work done by this kernel is independent of Mask_comp; both M and !M
// do the same work by scattering their entries into the C bitmap.
// C is bitmap/full. M is sparse/hyper, and can be jumbled.
{
ASSERT (GB_IS_BITMAP (C) || GB_IS_FULL (C)) ;
ASSERT (GB_IS_HYPERSPARSE (M) || GB_IS_SPARSE (M)) ;
ASSERT (GB_JUMBLED_OK (M)) ;
switch (assign_kind)
{
case GB_ROW_ASSIGN :
// row assignment: C<M>(iC,J), where M is a row vector
#include "template/GB_bitmap_assign_M_row_template.c"
break ;
case GB_COL_ASSIGN :
// column assignment: C<M>(I,jC), where M is a column vector
#include "template/GB_bitmap_assign_M_col_template.c"
break ;
#ifndef GB_NO_ASSIGN_CASE
case GB_ASSIGN :
// GrB_assign: C<M>(I,J), where M is the same size as C
#include "template/GB_bitmap_assign_M_all_template.c"
break ;
#endif
#ifndef GB_NO_SUBASSIGN_CASE
case GB_SUBASSIGN :
// GxB_subassign: C(I,J)<M>, where M is same size as C(I,J) and A
#include "template/GB_bitmap_assign_M_sub_template.c"
break ;
#endif
default: ;
}
}
|
