File: GB_jit_kernel_unjumble.c

package info (click to toggle)
suitesparse 1%3A7.10.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, trixie
  • size: 254,920 kB
  • sloc: ansic: 1,134,743; cpp: 46,133; makefile: 4,875; fortran: 2,087; java: 1,826; sh: 996; ruby: 725; python: 495; asm: 371; sed: 166; awk: 44
file content (32 lines) | stat: -rw-r--r-- 1,084 bytes parent folder | download | duplicates (2)
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
//------------------------------------------------------------------------------
// GB_jit_kernel_unjumble.c: sort the vectors of a sparse/hyper matrix
//------------------------------------------------------------------------------

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

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

// create the qsort kernel:
#if GB_Ai_IS_32
#define GB_A0_t uint32_t
#else
#define GB_A0_t uint64_t
#endif
#define GB_A1_t GB_A_TYPE
#include "include/GB_qsort_1b_kernel.h"

GB_JIT_GLOBAL GB_JIT_KERNEL_UNJUMBLE_PROTO (GB_jit_kernel) ;
GB_JIT_GLOBAL GB_JIT_KERNEL_UNJUMBLE_PROTO (GB_jit_kernel)
{
    GB_GET_CALLBACKS ;
    // get A
    GB_Ap_DECLARE   (Ap, const) ; GB_Ap_PTR (Ap, A) ;
    GB_Ai_DECLARE_U (Ai,      ) ; GB_Ai_PTR (Ai, A) ;
    GB_A_TYPE *restrict Ax = (GB_A_TYPE *) A->x ;
    // sort its vectors
    #define GB_QSORT GB_qsort_1b_kernel (Ai+p, Ax+p, n)
    #include "template/GB_unjumbled_template.c"
    return (GrB_SUCCESS) ;
}