2 * UCW Library -- Testing the Sorter
4 * (c) 2007 Martin Mares <mj@ucw.cz>
6 * This software may be freely distributed and used according to the terms
7 * of the GNU Lesser General Public License.
11 #include "lib/getopt.h"
13 #include "lib/fastbuf.h"
14 #include "lib/ff-binary.h"
15 #include "lib/hashfunc.h"
17 #include "lib/string.h"
25 /*** A hack for overriding radix-sorter configuration ***/
27 #ifdef FORCE_RADIX_BITS
28 #undef CONFIG_UCW_RADIX_SORTER_BITS
29 #define CONFIG_UCW_RADIX_SORTER_BITS FORCE_RADIX_BITS
32 /*** Time measurement ***/
34 static timestamp_t timer;
48 msg(L_INFO, "Test %d took %.3fs", test_id, get_timer(&timer) / 1000.);
51 /*** Simple 4-byte integer keys ***/
57 #define SORT_KEY_REGULAR struct key1
58 #define SORT_PREFIX(x) s1_##x
60 #define SORT_OUTPUT_FB
62 #define SORT_INT(k) (k).x
63 #define SORT_DELETE_INPUT 0
65 #include "lib/sorter/sorter.h"
68 test_int(int mode, u64 size)
70 uns N = size ? nextprime(MIN(size/4, 0xffff0000)) : 0;
72 msg(L_INFO, ">>> Integers (%s, N=%u)", ((char *[]) { "increasing", "decreasing", "random" })[mode], N);
74 struct fastbuf *f = bopen_tmp(65536);
75 for (uns i=0; i<N; i++)
76 bputl(f, (mode==0) ? i : (mode==1) ? N-1-i : ((u64)i * K + 17) % N);
80 f = s1_sort(f, NULL, N-1);
83 SORT_XTRACE(2, "Verifying");
84 for (uns i=0; i<N; i++)
88 die("Discrepancy: %u instead of %u", j, i);
93 /*** Integers with merging, but no data ***/
100 static inline void s2_write_merged(struct fastbuf *f, struct key2 **k, void **d UNUSED, uns n, void *buf UNUSED)
102 for (uns i=1; i<n; i++)
103 k[0]->cnt += k[i]->cnt;
104 bwrite(f, k[0], sizeof(struct key2));
107 #define SORT_KEY_REGULAR struct key2
108 #define SORT_PREFIX(x) s2_##x
109 #define SORT_INPUT_FB
110 #define SORT_OUTPUT_FB
112 #define SORT_INT(k) (k).x
114 #include "lib/sorter/sorter.h"
117 test_counted(int mode, u64 size)
119 u64 items = size / sizeof(struct key2);
121 while (items/(2*mult) > 0xffff0000)
123 uns N = items ? nextprime(items/(2*mult)) : 0;
125 msg(L_INFO, ">>> Counted integers (%s, N=%u, mult=%u)", ((char *[]) { "increasing", "decreasing", "random" })[mode], N, mult);
127 struct fastbuf *f = bopen_tmp(65536);
128 for (uns m=0; m<mult; m++)
129 for (uns i=0; i<N; i++)
130 for (uns j=0; j<2; j++)
132 bputl(f, (mode==0) ? (i%N) : (mode==1) ? N-1-(i%N) : ((u64)i * K + 17) % N);
138 f = s2_sort(f, NULL, N-1);
141 SORT_XTRACE(2, "Verifying");
142 for (uns i=0; i<N; i++)
146 die("Discrepancy: %u instead of %u", j, i);
149 die("Discrepancy: %u has count %u instead of %u", j, k, 2*mult);
154 /*** Longer records with hashes (similar to Shepherd's index records) ***/
162 static inline int s3_compare(struct key3 *x, struct key3 *y)
164 COMPARE(x->hash[0], y->hash[0]);
165 COMPARE(x->hash[1], y->hash[1]);
166 COMPARE(x->hash[2], y->hash[2]);
167 COMPARE(x->hash[3], y->hash[3]);
171 static inline uns s3_hash(struct key3 *x)
176 #define SORT_KEY_REGULAR struct key3
177 #define SORT_PREFIX(x) s3_##x
178 #define SORT_INPUT_FB
179 #define SORT_OUTPUT_FB
180 #define SORT_HASH_BITS 32
182 #include "lib/sorter/sorter.h"
185 gen_hash_key(int mode, struct key3 *k, uns i)
188 k->payload[0] = 7*i + 13;
189 k->payload[1] = 13*i + 19;
190 k->payload[2] = 19*i + 7;
195 k->hash[1] = k->payload[0];
196 k->hash[2] = k->payload[1];
197 k->hash[3] = k->payload[2];
201 k->hash[1] = k->payload[0];
202 k->hash[2] = k->payload[1];
203 k->hash[3] = k->payload[2];
206 md5_hash_buffer((byte *) &k->hash, (byte *) &k->i, 4);
212 test_hashes(int mode, u64 size)
214 uns N = MIN(size / sizeof(struct key3), 0xffffffff);
215 msg(L_INFO, ">>> Hashes (%s, N=%u)", ((char *[]) { "increasing", "decreasing", "random" })[mode], N);
216 struct key3 k, lastk;
218 struct fastbuf *f = bopen_tmp(65536);
220 for (uns i=0; i<N; i++)
222 gen_hash_key(mode, &k, i);
223 hash_sum += k.hash[3];
224 bwrite(f, &k, sizeof(k));
229 f = s3_sort(f, NULL);
232 SORT_XTRACE(2, "Verifying");
233 for (uns i=0; i<N; i++)
235 int ok = breadb(f, &k, sizeof(k));
237 if (i && s3_compare(&k, &lastk) <= 0)
239 gen_hash_key(mode, &lastk, k.i);
240 if (memcmp(&k, &lastk, sizeof(k)))
242 hash_sum -= k.hash[3];
248 /*** Variable-length records (strings) with and without var-length data ***/
257 static inline int s4_compare(struct key4 *x, struct key4 *y)
259 uns l = MIN(x->len, y->len);
260 int c = memcmp(x->s, y->s, l);
263 COMPARE(x->len, y->len);
267 static inline int s4_read_key(struct fastbuf *f, struct key4 *x)
270 if (x->len == 0xffffffff)
272 ASSERT(x->len < KEY4_MAX);
273 breadb(f, x->s, x->len);
277 static inline void s4_write_key(struct fastbuf *f, struct key4 *x)
279 ASSERT(x->len < KEY4_MAX);
281 bwrite(f, x->s, x->len);
284 #define SORT_KEY struct key4
285 #define SORT_PREFIX(x) s4_##x
286 #define SORT_KEY_SIZE(x) (sizeof(struct key4) - KEY4_MAX + (x).len)
287 #define SORT_INPUT_FB
288 #define SORT_OUTPUT_FB
290 #include "lib/sorter/sorter.h"
292 #define s4b_compare s4_compare
293 #define s4b_read_key s4_read_key
294 #define s4b_write_key s4_write_key
296 static inline uns s4_data_size(struct key4 *x)
298 return x->len ? (x->s[0] ^ 0xad) : 0;
301 #define SORT_KEY struct key4
302 #define SORT_PREFIX(x) s4b_##x
303 #define SORT_KEY_SIZE(x) (sizeof(struct key4) - KEY4_MAX + (x).len)
304 #define SORT_DATA_SIZE(x) s4_data_size(&(x))
305 #define SORT_INPUT_FB
306 #define SORT_OUTPUT_FB
308 #include "lib/sorter/sorter.h"
311 gen_key4(struct key4 *k)
313 k->len = random_max(KEY4_MAX);
314 for (uns i=0; i<k->len; i++)
319 gen_data4(byte *buf, uns len, uns h)
329 test_strings(uns mode, u64 size)
331 uns avg_item_size = KEY4_MAX/2 + 4 + (mode ? 128 : 0);
332 uns N = MIN(size / avg_item_size, 0xffffffff);
333 msg(L_INFO, ">>> Strings %s(N=%u)", (mode ? "with data " : ""), N);
336 struct key4 k, lastk;
337 byte buf[256], buf2[256];
340 struct fastbuf *f = bopen_tmp(65536);
341 for (uns i=0; i<N; i++)
345 uns h = hash_block(k.s, k.len);
349 gen_data4(buf, s4_data_size(&k), h);
350 bwrite(f, buf, s4_data_size(&k));
356 f = (mode ? s4b_sort : s4_sort)(f, NULL);
359 SORT_XTRACE(2, "Verifying");
360 for (uns i=0; i<N; i++)
362 int ok = s4_read_key(f, &k);
364 uns h = hash_block(k.s, k.len);
365 if (mode && s4_data_size(&k))
367 ok = breadb(f, buf, s4_data_size(&k));
369 gen_data4(buf2, s4_data_size(&k), h);
370 ASSERT(!memcmp(buf, buf2, s4_data_size(&k)));
372 if (i && s4_compare(&k, &lastk) < 0)
381 /*** Graph-like structure with custom presorting ***/
388 static uns s5_N, s5_K, s5_L, s5_i, s5_j;
394 static int s5_gen(struct s5_pair *p)
398 if (!s5_N || s5_i >= s5_N-1)
403 p->x = ((u64)s5_j * s5_K) % s5_N;
404 p->y = ((u64)(s5_i + s5_j) * s5_L) % s5_N;
409 #define ASORT_PREFIX(x) s5m_##x
410 #define ASORT_KEY_TYPE u32
411 #define ASORT_ELT(i) ary[i]
412 #define ASORT_EXTRA_ARGS , u32 *ary
413 #include "lib/arraysort.h"
415 static void s5_write_merged(struct fastbuf *f, struct key5 **keys, void **data, uns n, void *buf)
419 for (uns i=0; i<n; i++)
421 memcpy(&a[m], data[i], 4*keys[i]->cnt);
426 bwrite(f, keys[0], sizeof(struct key5));
430 static void s5_copy_merged(struct key5 **keys, struct fastbuf **data, uns n, struct fastbuf *dest)
434 for (uns i=0; i<n; i++)
436 k[i] = bgetl(data[i]);
439 struct key5 key = { .x = keys[0]->x, .cnt = m };
440 bwrite(dest, &key, sizeof(key));
444 for (uns i=1; i<n; i++)
449 k[b] = bgetl(data[b]);
455 static inline int s5p_lt(struct s5_pair x, struct s5_pair y)
457 COMPARE_LT(x.x, y.x);
458 COMPARE_LT(x.y, y.y);
462 #define ASORT_PREFIX(x) s5p_##x
463 #define ASORT_KEY_TYPE struct s5_pair
464 #define ASORT_LT(x,y) s5p_lt(x,y)
465 #include "lib/sorter/array.h"
467 static int s5_presort(struct fastbuf *dest, void *buf, size_t bufsize)
469 uns max = MIN(bufsize/sizeof(struct s5_pair), 0xffffffff);
470 struct s5_pair *a = buf;
472 while (n<max && s5_gen(&a[n]))
481 while (i < n && a[i].x == a[j].x)
483 struct key5 k = { .x = a[j].x, .cnt = i-j };
484 bwrite(dest, &k, sizeof(k));
486 bputl(dest, a[j++].y);
491 #define SORT_KEY_REGULAR struct key5
492 #define SORT_PREFIX(x) s5_##x
493 #define SORT_DATA_SIZE(k) (4*(k).cnt)
495 #define SORT_UNIFY_WORKSPACE(k) SORT_DATA_SIZE(k)
496 #define SORT_INPUT_PRESORT
497 #define SORT_OUTPUT_THIS_FB
498 #define SORT_INT(k) (k).x
500 #include "lib/sorter/sorter.h"
502 #define SORT_KEY_REGULAR struct key5
503 #define SORT_PREFIX(x) s5b_##x
504 #define SORT_DATA_SIZE(k) (4*(k).cnt)
506 #define SORT_UNIFY_WORKSPACE(k) SORT_DATA_SIZE(k)
507 #define SORT_INPUT_FB
508 #define SORT_OUTPUT_THIS_FB
509 #define SORT_INT(k) (k).x
510 #define s5b_write_merged s5_write_merged
511 #define s5b_copy_merged s5_copy_merged
513 #include "lib/sorter/sorter.h"
516 test_graph(uns mode, u64 size)
519 while ((u64)N*(N+2)*4 < size)
523 msg(L_INFO, ">>> Graph%s (N=%u)", (mode ? "" : " with custom presorting"), N);
529 struct fastbuf *in = NULL;
533 in = bopen_tmp(65536);
536 struct key5 k = { .x = p.x, .cnt = 1 };
537 bwrite(in, &k, sizeof(k));
544 struct fastbuf *f = bopen_tmp(65536);
545 bputl(f, 0xfeedcafe);
546 struct fastbuf *g = (mode ? s5b_sort(in, f, s5_N-1) : s5_sort(NULL, f, s5_N-1));
550 SORT_XTRACE(2, "Verifying");
552 ASSERT(c == 0xfeedcafe);
553 for (uns i=0; i<N; i++)
556 int ok = breadb(f, &k, sizeof(k));
560 for (uns j=0; j<N; j++)
569 /*** Simple 8-byte integer keys ***/
575 #define SORT_KEY_REGULAR struct key6
576 #define SORT_PREFIX(x) s6_##x
577 #define SORT_INPUT_FB
578 #define SORT_OUTPUT_FB
580 #define SORT_INT64(k) (k).x
582 #include "lib/sorter/sorter.h"
585 test_int64(int mode, u64 size)
587 u64 N = size ? nextprime(MIN(size/8, 0xffff0000)) : 0;
589 msg(L_INFO, ">>> 64-bit integers (%s, N=%llu)", ((char *[]) { "increasing", "decreasing", "random" })[mode], (long long)N);
591 struct fastbuf *f = bopen_tmp(65536);
592 for (u64 i=0; i<N; i++)
593 bputq(f, 777777*((mode==0) ? i : (mode==1) ? N-1-i : ((u64)i * K + 17) % N));
597 f = s6_sort(f, NULL, 777777*(N-1));
600 SORT_XTRACE(2, "Verifying");
601 for (u64 i=0; i<N; i++)
605 die("Discrepancy: %llu instead of %llu", (long long)j, 777777*(long long)i);
613 run_test(uns i, u64 size)
619 test_int(0, size); break;
621 test_int(1, size); break;
623 test_int(2, size); break;
625 test_counted(0, size); break;
627 test_counted(1, size); break;
629 test_counted(2, size); break;
631 test_hashes(0, size); break;
633 test_hashes(1, size); break;
635 test_hashes(2, size); break;
637 test_strings(0, size); break;
639 test_strings(1, size); break;
641 test_graph(0, size); break;
643 test_graph(1, size); break;
645 test_int64(0, size); break;
647 test_int64(1, size); break;
649 test_int64(2, size); break;
655 main(int argc, char **argv)
662 while ((c = cf_getopt(argc, argv, CF_SHORT_OPTS "d:s:t:v", CF_NO_LONG_OPTS, NULL)) >= 0)
666 sorter_debug = atol(optarg);
669 if (cf_parse_u64(optarg, &size))
675 int f = str_sepsplit(optarg, ',', w, ARRAY_SIZE(w));
679 for (int i=0; i<f; i++)
693 fputs("Usage: sort-test [-v] [-d <debug>] [-s <size>] [-t <test>]\n", stderr);
699 for (uns i=0; i<TMAX; i++)