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
|
//------------------------------------------------------------------------------
// GB_add_bitmap_M_sparse_24: C<!M>=A+B, C bitmap, M sparse/hyper; A,B bit/full
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// C is bitmap.
// M is sparse/hyper and complemented.
// A and B are both bitmap/full.
{
//--------------------------------------------------------------------------
// Method24(!M,sparse): C is bitmap, both A and B are bitmap or full
//--------------------------------------------------------------------------
int tid ;
#pragma omp parallel for num_threads(C_nthreads) schedule(static) \
reduction(+:cnvals)
for (tid = 0 ; tid < C_nthreads ; tid++)
{
int64_t pstart, pend, task_cnvals = 0 ;
GB_PARTITION (pstart, pend, cnz, tid, C_nthreads) ;
for (int64_t p = pstart ; p < pend ; p++)
{
int8_t c = Cb [p] ;
if (c == 0)
{
// M(i,j) is zero, so C(i,j) can be computed
int8_t a = GBb_A (Ab, p) ;
int8_t b = GBb_B (Bb, p) ;
#ifdef GB_ISO_ADD
c = a || b ;
#else
if (a && b)
{
// C (i,j) = A (i,j) + B (i,j)
GB_LOAD_A (aij, Ax, p, A_iso) ;
GB_LOAD_B (bij, Bx, p, B_iso) ;
GB_EWISEOP (Cx, p, aij, bij, p % vlen, p / vlen) ;
c = 1 ;
}
else if (b)
{
#if GB_IS_EWISEUNION
{
// C (i,j) = alpha + B(i,j)
GB_LOAD_B (bij, Bx, p, B_iso) ;
GB_EWISEOP (Cx, p, alpha_scalar, bij,
p % vlen, p / vlen) ;
}
#else
{
// C (i,j) = B (i,j)
GB_COPY_B_to_C (Cx, p, Bx, p, B_iso) ;
}
#endif
c = 1 ;
}
else if (a)
{
#if GB_IS_EWISEUNION
{
// C (i,j) = A(i,j) + beta
GB_LOAD_A (aij, Ax, p, A_iso) ;
GB_EWISEOP (Cx, p, aij, beta_scalar,
p % vlen, p / vlen) ;
}
#else
{
// C (i,j) = A (i,j)
GB_COPY_A_to_C (Cx, p, Ax, p, A_iso) ;
}
#endif
c = 1 ;
}
#endif
Cb [p] = c ;
task_cnvals += c ;
}
else
{
// M(i,j) == 1, so C(i,j) is not computed
Cb [p] = 0 ;
}
}
cnvals += task_cnvals ;
}
}
|
