File: GB_jit_kernel_subref_sparse.c

package info (click to toggle)
suitesparse 1%3A7.12.2%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 258,724 kB
  • sloc: ansic: 1,156,724; cpp: 48,359; makefile: 5,047; fortran: 2,087; java: 1,826; sh: 1,456; ruby: 725; python: 676; asm: 371; sed: 166; awk: 44
file content (63 lines) | stat: -rw-r--r-- 2,309 bytes parent folder | download
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
//------------------------------------------------------------------------------
// GB_jit_kernel_subref_sparse.c: C = A(I,J) where C and A are sparse/hyper
//------------------------------------------------------------------------------

// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0

//------------------------------------------------------------------------------

#include "include/GB_subref_method.h"

// create the qsort kernel:
#define GB_A0_t GB_Ci_TYPE
#define GB_A1_t GB_C_TYPE
#include "include/GB_qsort_1b_kernel.h"

GB_JIT_GLOBAL GB_JIT_KERNEL_SUBREF_SPARSE_PROTO (GB_jit_kernel) ;
GB_JIT_GLOBAL GB_JIT_KERNEL_SUBREF_SPARSE_PROTO (GB_jit_kernel)
{
    GB_GET_CALLBACKS ;

    // get C and A
    GB_Cp_DECLARE   (Cp, const) ; GB_Cp_PTR (Cp, C) ;
    GB_Ci_DECLARE_U (Ci,      ) ; GB_Ci_PTR (Ci, C) ;

    #define GB_COPY_RANGE(pC,pA,len) \
        memcpy (Cx + (pC), Ax + (pA), (len) * sizeof (GB_C_TYPE)) ;
    #define GB_COPY_ENTRY(pC,pA) Cx [pC] = Ax [pA] ;
    const GB_C_TYPE *restrict Ax = (GB_C_TYPE *) A->x ;
          GB_C_TYPE *restrict Cx = (GB_C_TYPE *) C->x ;
    #define GB_QSORT_1B(Ci,Cx,pC,clen) GB_qsort_1b_kernel (Ci+pC, Cx+pC, clen)

    // get Ap_start and Ap_end
    const GB_Ap_TYPE *restrict Ap_start = Ap_start_input ;
    const GB_Ap_TYPE *restrict Ap_end   = Ap_end_input ;

    // get I
    const GB_I_TYPE *restrict I = I_input ;

    // get R for the I inverse data structure
    GB_Rp_DECLARE   (Rp, const) ; GB_Rp_PTR (Rp, R) ;
    GB_Rh_DECLARE   (Rh, const) ; GB_Rh_PTR (Rh, R) ;
    GB_Ri_DECLARE_U (Ri, const) ; GB_Ri_PTR (Ri, R) ;
    GrB_Matrix R_Y = (R == NULL) ? NULL : R->Y ;
    const void *R_Yp = (R_Y == NULL) ? NULL : R_Y->p ;
    const void *R_Yi = (R_Y == NULL) ? NULL : R_Y->i ;
    const void *R_Yx = (R_Y == NULL) ? NULL : R_Y->x ;
    const int64_t R_hash_bits = (R_Y == NULL) ? 0 : (R_Y->vdim - 1) ;
    #define R_is_hyper GB_R_IS_HYPER
    #define Rp_is_32   GB_Rp_IS_32
    #define Rj_is_32   GB_Rj_IS_32
    #define Ri_is_32   GB_Ri_IS_32
    int64_t rnvec = (R == NULL) ? 0 : R->nvec ;

    #ifndef GB_Ai_IS_32
    #define GB_Ai_IS_32 (GB_Ai_BITS == 32)
    #endif

    #define GB_PHASE_2_OF_2
    #include "template/GB_subref_template.c"
    return (GrB_SUCCESS) ;
}