/*
- * An experiment with sorting algorithms
+ * Experiments with various sorting algorithms
+ *
+ * (c) 2007 Martin Mares <mj@ucw.cz>
*/
#include "sherlock/sherlock.h"
struct elt *ptrs[256], *x, *lim;
ASSERT(sizeof(struct elt) == 16);
- ASSERT(!((addr_int_t)alt & 15));
- ASSERT(!((addr_int_t)ary & 15));
+ ASSERT(!((uintptr_t)alt & 15));
+ ASSERT(!((uintptr_t)ary & 15));
x = ary; lim = ary + n;
bzero(cnt, sizeof(cnt));
array0[i] = array1[i] = (struct elt) { 0 };
mk_ary();
- init_timer();
+ timestamp_t timer;
+ init_timer(&timer);
for (uns i=0; i<5; i++)
{
#if 1
ary[j] = alt[j];
#endif
}
- log(L_DEBUG, "memcpy: %d", get_timer()/10);
+ log(L_DEBUG, "memcpy: %d", get_timer(&timer)/10);
-#define BENCH(type, name, func) mk_##type(); init_timer(); func; log(L_DEBUG, name ": %d", get_timer()); chk_##type()
+#define BENCH(type, name, func) mk_##type(); init_timer(&timer); func; log(L_DEBUG, name ": %d", get_timer(&timer)); chk_##type()
//BENCH(ary, "qsort", qsort(ary, n, sizeof(struct elt), comp));
//BENCH(ary, "arraysort", as_sort(n, ary));