File: GB_p_slice.c

package info (click to toggle)
suitesparse 1%3A7.10.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, 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 (99 lines) | stat: -rw-r--r-- 3,749 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
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
//------------------------------------------------------------------------------
// GB_p_slice: partition Work for a set of tasks
//------------------------------------------------------------------------------

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

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

// Work [0..n] is an array with monotonically increasing entries, of type
// uint32_t, uint64_t, or float.  This function slices Work so that each chunk
// has the same number of total values of its entries.  Work can be A->p for a
// matrix and then n = A->nvec.  Or it can be the work needed for computing n
// tasks, where Work [p] is the work for task p.

// If Work is NULL then the matrix A (not provided here) is full or bitmap,
// which this function handles (Work is implicit).

#include "GB.h"

//------------------------------------------------------------------------------
// GB_p_slice_32 and GB_p_slice_64: for Work as uint32_t or uint64_t
//------------------------------------------------------------------------------

#define GB_ENABLE_PERFECT_BALANCE
#define GB_Work_TYPE           uint32_t
#define GB_p_slice_TYPE        GB_p_slice_32
#define GB_p_slice_worker_TYPE GB_p_slice_worker_32
#define GB_trim_binary_search_TYPE GB_trim_binary_search_32
#include "slice/factory/GB_p_slice_template.c"

#define GB_Work_TYPE           uint64_t
#define GB_p_slice_TYPE        GB_p_slice_64
#define GB_p_slice_worker_TYPE GB_p_slice_worker_64
#define GB_trim_binary_search_TYPE GB_trim_binary_search_64
#include "slice/factory/GB_p_slice_template.c"

//------------------------------------------------------------------------------
// GB_p_slice_float: for Work as float
//------------------------------------------------------------------------------

// no perfect balance when Work is float

#undef  GB_ENABLE_PERFECT_BALANCE
#define GB_Work_TYPE           float
#define GB_p_slice_TYPE        GB_p_slice_float
#define GB_p_slice_worker_TYPE GB_p_slice_worker_float
#include "slice/factory/GB_p_slice_template.c"

//------------------------------------------------------------------------------
// GB_p_slice: partition Work for a set of tasks (uint32_t or uint64_t only)
//------------------------------------------------------------------------------

//  void GB_p_slice                 // slice Work, 32-bit or 64-bit
//  (
//      // output:
//      int64_t *restrict Slice,    // size ntasks+1
//      // input:
//      const void *Work,           // array size n+1 (full/bitmap: NULL)
//      bool Work_is_32,            // if true, Work is uint32_t, else uint64_t
//      const int64_t n,
//      const int ntasks,           // # of tasks
//      const bool perfectly_balanced
//  )

GB_CALLBACK_P_SLICE_PROTO (GB_p_slice)
{

    //--------------------------------------------------------------------------
    // check inputs
    //--------------------------------------------------------------------------

    ASSERT (Slice != NULL) ;

    //--------------------------------------------------------------------------
    // slice the work
    //--------------------------------------------------------------------------

    if (Work == NULL)
    { 
        // A is full or bitmap: slice 0:n equally for all tasks
        GB_e_slice (Slice, n, ntasks) ;
    }
    else
    {
        // A is sparse or hypersparse
        if (Work_is_32)
        { 
            // Work is uint32_t
            GB_p_slice_32 (Slice, Work, n, ntasks, perfectly_balanced) ;
        }
        else
        { 
            // Work is uint64_t
            GB_p_slice_64 (Slice, Work, n, ntasks, perfectly_balanced) ;
        }
    }
}