149744acbdf0cd7cac754c77d0976b8f45a8171a
1 // See LICENSE for license details.
7 #define USE_N_SQUARED_SORT
9 #define FAKE_MALLOC_INIT(words, name) \
10 uint32_t heap_##name[words]; \
11 const size_t max_alloc_##name = (words) * sizeof(uint32_t); \
12 size_t cur_pos_##name; \
13 void* fake_malloc_##name( size_t size ) \
15 static bool init = false; \
20 if(cur_pos_##name < (words)) { \
21 void *ptr = (void*) &heap_##name[cur_pos_##name]; \
22 cur_pos_##name += size & ~((uint32_t)3) + 1; \
36 n_squared_sort (float * value
, int * index
, int len
);
39 radix_sort_tuples (int * value
, int * index
, int len
, int radix_bits
);
42 insertion_sort (float * value
, int * index
, int len
);
45 quicksort (float * array
, int * index
, int len
);
47 /* This defines the length at quicksort switches to insertion sort */
53 #define RADIX_BITS (8)
57 #endif /* _TAV_SORT_H_ */