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 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
|
//------------------------------------------------------------------------------
// GB_masker_phase2: phase2 for R = masker (C,M,Z)
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// GB_masker_phase2 computes R = masker (C,M,Z). It is preceded first by
// GB_add_phase0, which computes the list of vectors of R to compute (Rh) and
// their location in C and Z (R_to_[CZ]). Next, GB_masker_phase1 counts the
// entries in each vector R(:,j) and computes Rp.
// GB_masker_phase2 computes the pattern and values of each vector of R(:,j),
// entirely in parallel.
// R, M, C, and Z can have any sparsity format (except R cannot be full), as
// determined by GB_add_phase0 and GB_masker_sparsity. All cases of the mask M
// are handled: present and not complemented, and present and complemented.
// The mask is always present.
// This function either frees Rp and Rh, or transplants then into R, as R->p
// and R->h. Either way, the caller must not free them.
// R is iso if both C and Z are iso and zij == cij.
#include "mask/GB_mask.h"
#include "jitifyer/GB_stringify.h"
#include "include/GB_masker_shared_definitions.h"
#undef GB_FREE_WORKSPACE
#define GB_FREE_WORKSPACE \
{ \
GB_WERK_POP (M_ek_slicing, int64_t) ; \
GB_WERK_POP (C_ek_slicing, int64_t) ; \
}
#undef GB_FREE_ALL
#define GB_FREE_ALL \
{ \
GB_FREE_WORKSPACE ; \
GB_phybix_free (R) ; \
}
GrB_Info GB_masker_phase2 // phase2 for R = masker (C,M,Z)
(
GrB_Matrix R, // output matrix, static header
const bool R_is_csc, // format of output matrix R
// from phase1:
void **Rp_handle, // vector pointers for R
size_t Rp_size,
const int64_t Rnvec_nonempty, // # of non-empty vectors in R
// tasks from phase1a:
const GB_task_struct *restrict TaskList, // array of structs
const int R_ntasks, // # of tasks
const int R_nthreads, // # of threads to use
// analysis from phase0:
const int64_t Rnvec,
void **Rh_handle, // R->h hyperlist
size_t Rh_size,
const int64_t *restrict R_to_M,
const int64_t *restrict R_to_C,
const int64_t *restrict R_to_Z,
const bool Rp_is_32,
const bool Rj_is_32,
const bool Ri_is_32,
const int R_sparsity,
// original input:
const GrB_Matrix M, // required mask
const bool Mask_comp, // if true, then M is complemented
const bool Mask_struct, // if true, use the only structure of M
const GrB_Matrix C,
const GrB_Matrix Z,
GB_Werk Werk
)
{
//--------------------------------------------------------------------------
// check inputs
//--------------------------------------------------------------------------
GB_WERK_DECLARE (C_ek_slicing, int64_t) ;
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
int C_nthreads = 0, C_ntasks = 0 ;
int M_nthreads = 0, M_ntasks = 0 ;
ASSERT_MATRIX_OK (M, "M for mask phase2", GB0) ;
ASSERT (!GB_ZOMBIES (M)) ;
ASSERT (!GB_JUMBLED (M)) ;
ASSERT (!GB_PENDING (M)) ;
ASSERT_MATRIX_OK (C, "C for mask phase2", GB0) ;
ASSERT (!GB_ZOMBIES (C)) ;
ASSERT (!GB_JUMBLED (C)) ;
ASSERT (!GB_PENDING (C)) ;
ASSERT_MATRIX_OK (Z, "Z for mask phase2", GB0) ;
ASSERT (!GB_ZOMBIES (Z)) ;
ASSERT (!GB_JUMBLED (Z)) ;
ASSERT (!GB_PENDING (Z)) ;
ASSERT (!GB_IS_BITMAP (C)) ; // not used if C is bitmap
ASSERT (C->vdim == Z->vdim && C->vlen == Z->vlen) ;
ASSERT (C->vdim == M->vdim && C->vlen == M->vlen) ;
ASSERT (C->type == Z->type) ;
ASSERT (R != NULL && (R->header_size == 0 || GBNSTATIC)) ;
ASSERT (Rp_handle != NULL) ;
ASSERT (Rh_handle != NULL) ;
GB_MDECL (Rp, , u) ;
Rp = (*Rp_handle) ;
GB_IPTR (Rp, Rp_is_32) ;
void *Rh = (*Rh_handle) ;
//--------------------------------------------------------------------------
// allocate the output matrix R
//--------------------------------------------------------------------------
bool R_is_hyper = (R_sparsity == GxB_HYPERSPARSE) ;
bool R_is_sparse_or_hyper = (R_sparsity == GxB_SPARSE) || R_is_hyper ;
ASSERT (R_is_sparse_or_hyper == (Rp != NULL)) ;
ASSERT (R_is_hyper == (Rh != NULL)) ;
int64_t rnz = (R_is_sparse_or_hyper) ?
GB_IGET (Rp, Rnvec) : (C->vlen * C->vdim) ;
size_t czsize = Z->type->size ;
bool R_iso ;
int64_t cnz = GB_nnz (C) ;
int64_t znz = GB_nnz (Z) ;
if (cnz == 0)
{
// C is empty: R is iso if Z is iso
R_iso = Z->iso ;
}
else if (znz == 0)
{
// Z is empty: R is iso if C is iso
R_iso = C->iso ;
}
else
{
// C and Z are both non-empty: R is iso if both C and Z are
// iso, and have the same iso value.
R_iso = (C->iso && Z->iso && (memcmp (C->x, Z->x, czsize) == 0)) ;
}
// allocate the result R (but do not allocate R->p or R->h)
GrB_Info info = GB_new_bix (&R, // any sparsity, existing header
C->type, C->vlen, C->vdim, GB_ph_null, R_is_csc,
R_sparsity, true, C->hyper_switch, Rnvec, rnz, true, R_iso,
Rp_is_32, Rj_is_32, Ri_is_32) ;
if (info != GrB_SUCCESS)
{
// out of memory; caller must free R_to_M, R_to_C, R_to_Z
GB_FREE_MEMORY (Rp_handle, Rp_size) ;
GB_FREE_MEMORY (Rh_handle, Rh_size) ;
return (info) ;
}
ASSERT (R->p_is_32 == Rp_is_32) ;
ASSERT (R->j_is_32 == Rj_is_32) ;
ASSERT (R->i_is_32 == Ri_is_32) ;
// add Rp as the vector pointers for R, from GB_masker_phase1
if (R_is_sparse_or_hyper)
{
// R->nvec_nonempty = Rnvec_nonempty ;
GB_nvec_nonempty_set (R, Rnvec_nonempty) ;
R->p = Rp ; R->p_size = Rp_size ;
R->nvals = rnz ;
(*Rp_handle) = NULL ;
}
// add Rh as the hypersparse list for R, from GB_add_phase0
if (R_is_hyper)
{
R->h = Rh ; R->h_size = Rh_size ;
R->nvec = Rnvec ;
(*Rh_handle) = NULL ;
}
// now Rp and Rh have been transplanted into R, so they must not be freed.
ASSERT ((*Rp_handle) == NULL) ;
ASSERT ((*Rh_handle) == NULL) ;
R->magic = GB_MAGIC ;
//--------------------------------------------------------------------------
// slice C and M, if needed
//--------------------------------------------------------------------------
if (R_sparsity == GxB_BITMAP)
{
int nthreads_max = GB_Context_nthreads_max ( ) ;
double chunk = GB_Context_chunk ( ) ;
int64_t C_nnz_held = GB_nnz_held (C) ;
GB_SLICE_MATRIX_WORK2 (C, 8, C_nnz_held + C->nvec, C_nnz_held) ;
if (GB_IS_SPARSE (M) || GB_IS_HYPERSPARSE (M))
{
int64_t M_nnz_held = GB_nnz_held (M) ;
GB_SLICE_MATRIX_WORK2 (M, 8, M_nnz_held + M->nvec, M_nnz_held) ;
}
}
//--------------------------------------------------------------------------
// masker phase2 worker
//--------------------------------------------------------------------------
#define GB_PHASE_2_OF_2
if (R_iso)
{
//----------------------------------------------------------------------
// R iso case
//----------------------------------------------------------------------
// R can be iso only if C and/or Z are iso
GBURBLE ("(iso mask) ") ;
#define GB_ISO_MASKER
if (cnz == 0)
{
// Z must be iso; copy its iso value into R
memcpy (R->x, Z->x, czsize) ;
}
else
{
// C must be iso; copy its iso value into R
memcpy (R->x, C->x, czsize) ;
}
#include "mask/template/GB_masker_template.c"
info = GrB_SUCCESS ;
}
else
{
//----------------------------------------------------------------------
// via the JIT kernel
//----------------------------------------------------------------------
info = GB_masker_phase2_jit (R, TaskList, R_ntasks, R_nthreads,
R_to_M, R_to_C, R_to_Z, M, Mask_comp, Mask_struct, C, Z,
C_ek_slicing, C_ntasks, C_nthreads,
M_ek_slicing, M_ntasks, M_nthreads) ;
//----------------------------------------------------------------------
// via the generic kernel
//----------------------------------------------------------------------
if (info == GrB_NO_VALUE)
{
GBURBLE ("(generic masker) ") ;
#include "mask/template/GB_masker_template.c"
info = GrB_SUCCESS ;
}
}
GB_OK (info) ;
//--------------------------------------------------------------------------
// prune empty vectors from Rh
//--------------------------------------------------------------------------
GB_OK (GB_hyper_prune (R, Werk)) ;
//--------------------------------------------------------------------------
// free workspace and return result
//--------------------------------------------------------------------------
// caller must free R_to_M, R_to_C, and R_to_Z, but not Rp or Rh
GB_FREE_WORKSPACE ;
ASSERT_MATRIX_OK (R, "R output for mask phase2", GB0) ;
ASSERT (!GB_ZOMBIES (R)) ;
ASSERT (!GB_JUMBLED (R)) ;
ASSERT (!GB_PENDING (R)) ;
return (GrB_SUCCESS) ;
}
|