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
|
//------------------------------------------------------------------------------
// GB_encodify_apply: encode an apply problem, including types and op
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
#include "GB.h"
#include "jitifyer/GB_stringify.h"
uint64_t GB_encodify_apply // encode an apply problem
(
// output:
GB_jit_encoding *encoding, // unique encoding of the entire problem,
// except for the suffix
char **suffix, // suffix for user-defined kernel
// input:
const GB_jit_kcode kcode, // kernel to encode
// C matrix:
const int C_sparsity,
const bool C_is_matrix, // true for C=op(A), false for Cx=op(A)
const GrB_Type ctype,
const bool Cp_is_32, // if true, Cp is uint32_t, else uint64_t
const bool Ci_is_32, // if true, Ci is uint32_t, else uint64_t
const bool Cj_is_32, // if true, Cj is uint32_t, else uint64_t
// operator:
const GB_Operator op, // not JIT'd if NULL
const bool flipij,
// A matrix:
const int A_sparsity,
const bool A_is_matrix,
const GrB_Type atype,
const bool Ap_is_32, // if true, Ap is uint32_t, else uint64_t
const bool Aj_is_32, // if true, Ah is uint32_t, else uint64_t
const bool Ai_is_32, // if true, Ai is uint32_t, else uint64_t
const bool A_iso,
const int64_t A_nzombies
)
{
//--------------------------------------------------------------------------
// check if the op is JIT'able
//--------------------------------------------------------------------------
if (op != NULL && op->hash == UINT64_MAX)
{
// cannot JIT this op
memset (encoding, 0, sizeof (GB_jit_encoding)) ;
(*suffix) = NULL ;
return (UINT64_MAX) ;
}
//--------------------------------------------------------------------------
// primary encoding of the problem
//--------------------------------------------------------------------------
encoding->kcode = kcode ;
GB_enumify_apply (&encoding->code, C_sparsity, C_is_matrix, ctype,
Cp_is_32, Ci_is_32, Cj_is_32, op, flipij, A_sparsity, A_is_matrix,
atype, Ap_is_32, Aj_is_32, Ai_is_32, A_iso, A_nzombies) ;
//--------------------------------------------------------------------------
// determine the suffix and its length
//--------------------------------------------------------------------------
// if hash is zero, it denotes a builtin operator
uint64_t hash = op->hash ;
encoding->suffix_len = (hash == 0) ? 0 : op->name_len ;
(*suffix) = (hash == 0) ? NULL : op->name ;
//--------------------------------------------------------------------------
// compute the hash of the entire problem
//--------------------------------------------------------------------------
hash = hash ^ GB_jitifyer_hash_encoding (encoding) ;
return ((hash == 0 || hash == UINT64_MAX) ? GB_MAGIC : hash) ;
}
|
