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
|
//------------------------------------------------------------------------------
// GB_enumify_sort: enumerate a GxB_sort problem
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// C is sparse or hypersparse, but the algorithm doesn't access C->h, and works
// identically for both cases. So the JIT kernel can treat C as if sparse.
#include "GB.h"
#include "jitifyer/GB_stringify.h"
void GB_enumify_sort // enumerate a GxB_sort problem
(
// output:
uint64_t *method_code, // unique encoding of the entire operation
// input:
GrB_Matrix C, // matrix to sort
// comparator op:
GrB_BinaryOp binaryop // the binary operator for the comparator
)
{
//--------------------------------------------------------------------------
// get the type of C
//--------------------------------------------------------------------------
GrB_Type ctype = C->type ;
int ccode = ctype->code ; // 1 to 14
int cp_is_32 = (C->p_is_32) ? 1 : 0 ;
int cj_is_32 = (C->j_is_32) ? 1 : 0 ;
int ci_is_32 = (C->i_is_32) ? 1 : 0 ;
//--------------------------------------------------------------------------
// get the type of X and the opcode
//--------------------------------------------------------------------------
ASSERT (binaryop != NULL) ;
GB_Opcode opcode = binaryop->opcode ;
GB_Type_code xcode = binaryop->xtype->code ;
// the comparator op, z=f(x,y) must have a ztype of boolean,
// and the x and y types must match
ASSERT (binaryop->xtype == binaryop->ytype) ;
ASSERT (binaryop->ztype == GrB_BOOL) ;
if (xcode == GB_BOOL_code) // && (ycode == GB_BOOL_code)
{
// rename the operator
opcode = GB_boolean_rename (opcode) ;
}
//--------------------------------------------------------------------------
// enumify the binary operator
//--------------------------------------------------------------------------
int binop_code = (opcode - GB_USER_binop_code) & 0x3F ;
//--------------------------------------------------------------------------
// construct the sort method_code
//--------------------------------------------------------------------------
// total method_code bits: 17 (5 hex digits)
(*method_code) =
// range bits
// binaryop, z = f(x,y), and integers of C (4 hex digits)
GB_LSHIFT (cp_is_32 , 16) | // 0 to 1 1
GB_LSHIFT (cj_is_32 , 15) | // 0 to 1 1
GB_LSHIFT (ci_is_32 , 14) | // 0 to 1 1
GB_LSHIFT (binop_code , 8) | // 0 to 52 6
GB_LSHIFT (xcode , 4) | // 1 to 14 4
// type of C (1 hex digit)
GB_LSHIFT (ccode , 0) ; // 1 to 14 4
}
|
