-
Notifications
You must be signed in to change notification settings - Fork 0
/
integer-radix-sort.h.m4
321 lines (290 loc) · 17 KB
/
integer-radix-sort.h.m4
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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
/*
Copyright © 2022 Barry Schwartz
This program is free software: you can redistribute it and/or
modify it under the terms of the GNU General Public License, as
published by the Free Software Foundation, either version 3 of the
License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received copies of the GNU General Public License
along with this program. If not, see
<https://www.gnu.org/licenses/>.
*/
include(`common-macros.m4')dnl
#ifndef INTEGER_RADIX_SORT_H_HEADER_GUARD__
#define INTEGER_RADIX_SORT_H_HEADER_GUARD__
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
#if defined __GNUC__
#define INTEGER_RADIX_SORT__MEMSET __builtin_memset
#define INTEGER_RADIX_SORT__MEMCPY __builtin_memcpy
#else
#define INTEGER_RADIX_SORT__MEMSET memset
#define INTEGER_RADIX_SORT__MEMCPY memcpy
#endif
#define INTEGER_RADIX_SORT__PREFIX _integer_radix_sort__
#define INTEGER_RADIX_SORT__SIZE_THRESHOLD 2048
#define INTEGER_RADIX_SORT__IDENTITY(X) (X)
#define INTEGER_RADIX_SORT__SUBTRACT_MIN_KEY(X) \
((X) - INTEGER_RADIX_SORT__PREFIX##min_key)
#define INTEGER_RADIX_SORT__DEREFERENCE(KEY_T, PTR) \
(*(const KEY_T *)(PTR))
#define INTEGER_RADIX_SORT__BIN_SIZES_TO_INDICES(PFX, BIN_INDICES) \
do \
{ \
size_t PFX##accum = 0; \
for (size_t PFX##i = 0; PFX##i != 256; PFX##i += 1) \
{ \
size_t PFX##elem = (BIN_INDICES)[PFX##i]; \
if (PFX##elem != 0) \
{ \
(BIN_INDICES)[PFX##i] = PFX##accum; \
PFX##accum += PFX##elem; \
} \
} \
} \
while (0)
#define INTEGER_RADIX_SORT__COUNT_ENTRIES(PFX, KEY_T, UKEY_T, \
GET_KEY, MODIFY_KEY, \
ARR, NMEMB, SIZE, \
BIN_INDICES, \
ALL_EXPENDED, SHIFT) \
do \
{ \
ALL_EXPENDED = 1; \
for (size_t PFX##i = 0; PFX##i != (NMEMB); PFX##i += 1) \
{ \
UKEY_T PFX##key = \
(UKEY_T) \
(MODIFY_KEY \
(GET_KEY \
(KEY_T, \
(void *) ((char *) (ARR)) + PFX##i * (SIZE)))); \
unsigned int PFX##key_shifted = (PFX##key >> (SHIFT)); \
unsigned int PFX##digit = (PFX##key_shifted & 255U); \
size_t PFX##count = (BIN_INDICES)[PFX##digit]; \
(BIN_INDICES)[PFX##digit] = PFX##count + 1; \
ALL_EXPENDED = \
((ALL_EXPENDED) & (PFX##key_shifted == 0)); \
} \
} \
while (0)
#define INTEGER_RADIX_SORT__SORT_BY_DIGIT(PFX, KEY_T, UKEY_T, \
GET_KEY, MODIFY_KEY, \
ARR1, ARR2, NMEMB, SIZE, \
ALL_EXPENDED, SHIFT) \
do \
{ \
size_t PFX##bin_indices[256]; \
INTEGER_RADIX_SORT__MEMSET (PFX##bin_indices, 0, \
256 * sizeof (size_t)); \
INTEGER_RADIX_SORT__COUNT_ENTRIES (PFX, KEY_T, UKEY_T, \
GET_KEY, MODIFY_KEY, \
(ARR1), (NMEMB), (SIZE), \
PFX##bin_indices, \
ALL_EXPENDED, (SHIFT)); \
if (!(ALL_EXPENDED)) \
{ \
INTEGER_RADIX_SORT__BIN_SIZES_TO_INDICES \
(PFX, PFX##bin_indices); \
for (size_t PFX##i = 0; PFX##i != (NMEMB); PFX##i += 1) \
{ \
const void *PFX##p_src = \
((const char *) (ARR1)) + (PFX##i * (SIZE)); \
UKEY_T PFX##key = \
(UKEY_T) \
(MODIFY_KEY \
(GET_KEY (KEY_T, (void *) PFX##p_src))); \
unsigned int PFX##key_shifted = \
(PFX##key >> (SHIFT)); \
unsigned int PFX##digit = (PFX##key_shifted & 255U); \
size_t PFX##j = PFX##bin_indices[PFX##digit]; \
void *PFX##p_dst = \
((char *) (ARR2)) + (PFX##j * (SIZE)); \
INTEGER_RADIX_SORT__MEMCPY (PFX##p_dst, PFX##p_src, \
SIZE); \
PFX##bin_indices[PFX##digit] = PFX##j + 1; \
} \
} \
} \
while (0)
#define INTEGER_RADIX_SORT__INTEGER_RADIX_SORT(PFX, KEY_T, UKEY_T, \
GET_KEY, MODIFY_KEY, \
ARR, NMEMB, SIZE) \
do \
{ \
size_t PFX##total_size = (NMEMB) * (SIZE); \
size_t PFX##use_stack = \
PFX##total_size <= (INTEGER_RADIX_SORT__SIZE_THRESHOLD); \
size_t PFX##stack_space; \
if (PFX##use_stack) \
PFX##stack_space = PFX##total_size; \
else \
PFX##stack_space = 1; \
char PFX##stack[PFX##stack_space]; \
char *PFX##arr2; \
if (PFX##use_stack) \
PFX##arr2 = PFX##stack; \
else \
{ \
PFX##arr2 = malloc (PFX##total_size); \
if (PFX##arr2 == NULL) \
{ \
fprintf (stderr, "Memory exhausted"); \
exit (1); \
} \
} \
\
int PFX##from1to2 = 1; \
int PFX##idigit = 0; \
int PFX##done = 0; \
while (!PFX##done) \
{ \
if (PFX##idigit == sizeof (UKEY_T)) \
{ \
if (!PFX##from1to2) \
INTEGER_RADIX_SORT__MEMCPY ((ARR), PFX##arr2, \
PFX##total_size); \
PFX##done = 1; \
} \
else if (PFX##from1to2) \
{ \
INTEGER_RADIX_SORT__SORT_BY_DIGIT \
(PFX, KEY_T, UKEY_T, GET_KEY, MODIFY_KEY, \
(ARR), PFX##arr2, (NMEMB), (SIZE), PFX##done, \
8 * PFX##idigit); \
if (!PFX##done) \
{ \
PFX##from1to2 = 0; \
PFX##idigit += 1; \
} \
} \
else \
{ \
INTEGER_RADIX_SORT__SORT_BY_DIGIT \
(PFX, KEY_T, UKEY_T, GET_KEY, MODIFY_KEY, \
PFX##arr2, (ARR),(NMEMB), (SIZE), PFX##done, \
8 * PFX##idigit); \
if (PFX##done) \
INTEGER_RADIX_SORT__MEMCPY ((ARR), PFX##arr2, \
PFX##total_size); \
else \
{ \
PFX##from1to2 = 1; \
PFX##idigit += 1; \
} \
} \
} \
\
if (!PFX##use_stack) \
free (PFX##arr2); \
} \
while (0)
#define INTEGER_RADIX_SORT__FIND_MINIMUM_KEY(PFX, KEY_T, GET_KEY, \
ARR, NMEMB, SIZE, \
MIN_KEY) \
do \
{ \
const char *PFX##p = (ARR); \
KEY_T PFX##min_key = \
(KEY_T) (GET_KEY (KEY_T, (void *) PFX##p)); \
for (size_t PFX##i = 1; PFX##i != (NMEMB); PFX##i += 1) \
{ \
PFX##p += (SIZE); \
KEY_T PFX##key = \
(KEY_T) (GET_KEY (KEY_T, (void *) PFX##p)); \
if (PFX##key < PFX##min_key) \
PFX##min_key = PFX##key; \
} \
MIN_KEY = PFX##min_key; \
} \
while (0)
#define INTEGER_RADIX_SORT__SIGNED_KEY_SORT(PFX, KEY_T, UKEY_T, \
GET_KEY, \
ARR, NMEMB, SIZE) \
do \
{ \
_Static_assert \
(sizeof (KEY_T) == sizeof (UKEY_T), \
"types KEY_T and UKEY_T must have the same size"); \
if ((NMEMB) != 0) \
{ \
KEY_T PFX##min_key; \
INTEGER_RADIX_SORT__FIND_MINIMUM_KEY \
(PFX, KEY_T, GET_KEY, (ARR), (NMEMB), (SIZE), \
PFX##min_key); \
INTEGER_RADIX_SORT__INTEGER_RADIX_SORT \
(PFX, KEY_T, UKEY_T, GET_KEY, \
INTEGER_RADIX_SORT__SUBTRACT_MIN_KEY, \
(ARR), (NMEMB), (SIZE)); \
} \
} \
while (0)
/* For example:
#define GET_KEY(KEY_T, PTR) get_key (PTR)
UINTTYPE_KEYED_RADIX_SORT (unsigned int, array1, num_elements,
sizeof (record *), GET_KEY);
*/
#define UINTTYPE_KEYED_RADIX_SORT(KEY_T, ARR, NMEMB, SIZE, GET_KEY) \
do \
{ \
void *PFX##arr = (ARR); \
size_t PFX##nmemb = (NMEMB); \
size_t PFX##size = (SIZE); \
INTEGER_RADIX_SORT__INTEGER_RADIX_SORT \
(INTEGER_RADIX_SORT__PREFIX, KEY_T, KEY_T, GET_KEY, \
INTEGER_RADIX_SORT__IDENTITY, \
PFX##arr, PFX##nmemb, PFX##size); \
} \
while (0)
/* For example:
#define GET_KEY(KEY_T, PTR) get_key (PTR)k
INTTYPE_KEYED_RADIX_SORT (short int, unsigned short int,
array1, num_elements,
sizeof (record *), GET_key);
*/
#define INTTYPE_KEYED_RADIX_SORT(KEY_T, UKEY_T, ARR, NMEMB, SIZE, \
GET_KEY) \
do \
{ \
void *PFX##arr = (ARR); \
size_t PFX##nmemb = (NMEMB); \
size_t PFX##size = (SIZE); \
INTEGER_RADIX_SORT__SIGNED_KEY_SORT \
(INTEGER_RADIX_SORT__PREFIX, KEY_T, UKEY_T, GET_KEY, \
PFX##arr, PFX##nmemb, PFX##size); \
} \
while (0)
/* For example:
UINTTYPE_RADIX_SORT (uintmax_t, array1, num_elements);
*/
#define UINTTYPE_RADIX_SORT(KEY_T, ARR, NMEMB) \
UINTTYPE_KEYED_RADIX_SORT (KEY_T, (ARR), (NMEMB), sizeof (KEY_T), \
INTEGER_RADIX_SORT__DEREFERENCE)
/* For example:
INTTYPE_RADIX_SORT (intmax_t, uintmax_t, array1, num_elements);
*/
#define INTTYPE_RADIX_SORT(KEY_T, UKEY_T, ARR, NMEMB) \
INTTYPE_KEYED_RADIX_SORT (KEY_T, UKEY_T, (ARR), (NMEMB), \
sizeof (KEY_T), \
INTEGER_RADIX_SORT__DEREFERENCE)
m4_foreachq(`TYPE',`UINTTYPES,INTTYPES',
`m4_if(TYPE,`int128',`#if defined __SIZEOF_INT128__
')dnl
m4_if(TYPE,`uint128',`#if defined __SIZEOF_INT128__
')dnl
void TYPE`'_keyed_radix_sort (void *base, size_t nmemb, size_t size,
m4_map_typename(TYPE) (*get_key) (const void *));
m4_if(TYPE,`int128',`#endif
')dnl
m4_if(TYPE,`uint128',`#endif
')dnl
')dnl
#endif /* INTEGER_RADIX_SORT_H_HEADER_GUARD__ */
/* local variables: */
/* mode: c */
/* end: */