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
|
//------------------------------------------------------------------------------
// GB_bitmap_assign_M_all_template: traverse M for GB_ASSIGN
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// M is sparse or hypersparse, not bitmap or full. C<M>(I,J) = ... is being
// computed (or !M), and all entries in M are traversed. For a given entry
// M (iM,jM) in the mask, the entry C(iM,jM) is accessed at location pC.
// 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)) ;
const int64_t *restrict kfirst_Mslice = M_ek_slicing ;
const int64_t *restrict klast_Mslice = M_ek_slicing + M_ntasks ;
const int64_t *restrict pstart_Mslice = M_ek_slicing + M_ntasks * 2 ;
int tid ;
#pragma omp parallel for num_threads(M_nthreads) schedule(dynamic,1) \
reduction(+:cnvals)
for (tid = 0 ; tid < M_ntasks ; tid++)
{
int64_t kfirst = kfirst_Mslice [tid] ;
int64_t klast = klast_Mslice [tid] ;
int64_t task_cnvals = 0 ;
//----------------------------------------------------------------------
// traverse over M (:,kfirst:klast)
//----------------------------------------------------------------------
for (int64_t k = kfirst ; k <= klast ; k++)
{
//------------------------------------------------------------------
// find the part of M(:,k) for this task
//------------------------------------------------------------------
int64_t jM = GBh_M (Mh, k) ;
GB_GET_PA (pM_start, pM_end, tid, k, kfirst, klast, pstart_Mslice,
GB_IGET (Mp, k), GB_IGET (Mp, k+1)) ;
//------------------------------------------------------------------
// traverse over M(:,jM), the kth vector of M
//------------------------------------------------------------------
// for assign: M is a matrix the same size as C
int64_t jC = jM ;
for (int64_t pM = pM_start ; pM < pM_end ; pM++)
{
bool mij = GB_MCAST (Mx, pM, msize) ;
if (mij)
{
int64_t iC = GB_IGET (Mi, pM) ;
int64_t pC = iC + jC * Cvlen ;
GB_MASK_WORK (pC) ;
}
}
}
#ifndef GB_NO_CNVALS
cnvals += task_cnvals ;
#endif
}
}
|
