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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
|
//------------------------------------------------------------------------------
// GB_sort.h: definitions for sorting functions
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// All of the GB_qsort_* functions are single-threaded, by design. The
// GB_msort_* functions are parallel. None of these sorting methods are
// guaranteed to be stable, but they are always used in GraphBLAS with unique
// keys.
#ifndef GB_SORT_H
#define GB_SORT_H
#include "GB.h"
#define GB_BASECASE (64 * 1024)
GB_PUBLIC
void GB_qsort_1b // sort array A of size 2-by-n, using 1 key (A [0][])
(
int64_t *restrict A_0, // size n array
GB_void *restrict A_1, // size n array
const size_t xsize, // size of entries in A_1
const int64_t n
) ;
void GB_qsort_1b_size1 // GB_qsort_1b with A1 with sizeof = 1
(
int64_t *restrict A_0, // size n array
uint8_t *restrict A_1, // size n array
const int64_t n
) ;
void GB_qsort_1b_size2 // GB_qsort_1b with A1 with sizeof = 2
(
int64_t *restrict A_0, // size n array
uint16_t *restrict A_1, // size n array
const int64_t n
) ;
void GB_qsort_1b_size4 // GB_qsort_1b with A1 with sizeof = 4
(
int64_t *restrict A_0, // size n array
uint32_t *restrict A_1, // size n array
const int64_t n
) ;
void GB_qsort_1b_size8 // GB_qsort_1b with A_1 with sizeof = 8
(
int64_t *restrict A_0, // size n array
uint64_t *restrict A_1, // size n array
const int64_t n
) ;
void GB_qsort_1b_size16 // GB_qsort_1b with A_1 with sizeof = 16
(
int64_t *restrict A_0, // size n array
GB_blob16 *restrict A_1, // size n array
const int64_t n
) ;
GB_PUBLIC
void GB_qsort_1 // sort array A of size 1-by-n
(
int64_t *restrict A_0, // size n array
const int64_t n
) ;
GB_PUBLIC
void GB_qsort_2 // sort array A of size 2-by-n, using 2 keys (A [0:1][])
(
int64_t *restrict A_0, // size n array
int64_t *restrict A_1, // size n array
const int64_t n
) ;
GB_PUBLIC
void GB_qsort_3 // sort array A of size 3-by-n, using 3 keys (A [0:2][])
(
int64_t *restrict A_0, // size n array
int64_t *restrict A_1, // size n array
int64_t *restrict A_2, // size n array
const int64_t n
) ;
GB_PUBLIC
GrB_Info GB_msort_1 // sort array A of size 1-by-n
(
int64_t *restrict A_0, // size n array
const int64_t n,
int nthreads // # of threads to use
) ;
GB_PUBLIC
GrB_Info GB_msort_2 // sort array A of size 2-by-n, using 2 keys (A [0:1][])
(
int64_t *restrict A_0, // size n array
int64_t *restrict A_1, // size n array
const int64_t n,
int nthreads // # of threads to use
) ;
GB_PUBLIC
GrB_Info GB_msort_3 // sort array A of size 3-by-n, using 3 keys (A [0:2][])
(
int64_t *restrict A_0, // size n array
int64_t *restrict A_1, // size n array
int64_t *restrict A_2, // size n array
const int64_t n,
int nthreads // # of threads to use
) ;
//------------------------------------------------------------------------------
// GB_lt_1: sorting comparator function, one key
//------------------------------------------------------------------------------
// A [a] and B [b] are keys of one integer.
// GB_lt_1 returns true if A [a] < B [b], for GB_qsort_1b
#define GB_lt_1(A_0, a, B_0, b) (A_0 [a] < B_0 [b])
//------------------------------------------------------------------------------
// GB_lt_2: sorting comparator function, two keys
//------------------------------------------------------------------------------
// A [a] and B [b] are keys of two integers.
// GB_lt_2 returns true if A [a] < B [b], for GB_qsort_2 and GB_msort_2
#define GB_lt_2(A_0, A_1, a, B_0, B_1, b) \
( \
(A_0 [a] < B_0 [b]) ? \
( \
true \
) \
: \
( \
(A_0 [a] == B_0 [b]) ? \
( \
/* primary key is the same; tie-break on the 2nd key */ \
(A_1 [a] < B_1 [b]) \
) \
: \
( \
false \
) \
) \
)
//------------------------------------------------------------------------------
// GB_lt_3: sorting comparator function, three keys
//------------------------------------------------------------------------------
// A [a] and B [b] are keys of three integers.
// GB_lt_3 returns true if A [a] < B [b], for GB_qsort_3 and GB_msort_3
#define GB_lt_3(A_0, A_1, A_2, a, B_0, B_1, B_2, b) \
( \
(A_0 [a] < B_0 [b]) ? \
( \
true \
) \
: \
( \
(A_0 [a] == B_0 [b]) ? \
( \
/* primary key is the same; tie-break on the 2nd and 3rd key */ \
GB_lt_2 (A_1, A_2, a, B_1, B_2, b) \
) \
: \
( \
false \
) \
) \
)
//------------------------------------------------------------------------------
// GB_eq_*: sorting comparator function, one to three keys
//------------------------------------------------------------------------------
// A [a] and B [b] are keys of two or three integers.
// GB_eq_* returns true if A [a] == B [b]
#define GB_eq_3(A_0, A_1, A_2, a, B_0, B_1, B_2, b) \
( \
(A_0 [a] == B_0 [b]) && \
(A_1 [a] == B_1 [b]) && \
(A_2 [a] == B_2 [b]) \
)
#define GB_eq_2(A_0, A_1, a, B_0, B_1, b) \
( \
(A_0 [a] == B_0 [b]) && \
(A_1 [a] == B_1 [b]) \
)
#define GB_eq_1(A_0, a, B_0, b) \
( \
(A_0 [a] == B_0 [b]) \
)
//------------------------------------------------------------------------------
// random number generator for quicksort
//------------------------------------------------------------------------------
// return a random GrB_Index, in range 0 to 2^60
#define GB_RAND_MAX 32767
// return a random number between 0 and GB_RAND_MAX
static inline GrB_Index GB_rand15 (uint64_t *seed)
{
(*seed) = (*seed) * 1103515245 + 12345 ;
return (((*seed) / 65536) % (GB_RAND_MAX + 1)) ;
}
// return a random GrB_Index, in range 0 to 2^60
static inline GrB_Index GB_rand (uint64_t *seed)
{
GrB_Index i = GB_rand15 (seed) ;
i = GB_RAND_MAX * i + GB_rand15 (seed) ;
i = GB_RAND_MAX * i + GB_rand15 (seed) ;
i = GB_RAND_MAX * i + GB_rand15 (seed) ;
return (i) ;
}
//------------------------------------------------------------------------------
// matrix sorting (for GxB_Matrix_sort and GxB_Vector_sort)
//------------------------------------------------------------------------------
GrB_Info GB_sort
(
// output:
GrB_Matrix C, // matrix with sorted vectors on output
GrB_Matrix P, // matrix with permutations on output
// input:
GrB_BinaryOp op, // comparator for the sort
GrB_Matrix A, // matrix to sort
const bool A_transpose, // false: sort each row, true: sort each column
GB_Context Context
) ;
#endif
|
