#endif
} P(mwt);
-static inline void P(update_tree)(P(key) *keys, P(mwt) *tree, uns i)
+static inline void P(update_tree)(P(key) *keys, P(mwt) *tree, uint i)
{
while (i /= 2)
{
asm volatile ("" : : : "memory");
}
-static inline void P(set_tree)(P(key) *keys, P(mwt) *tree, uns i, int val)
+static inline void P(set_tree)(P(key) *keys, P(mwt) *tree, uint i, int val)
{
tree[i].i = val;
P(update_tree)(keys, tree, i);
static void P(multiway_merge)(struct sort_context *ctx UNUSED, struct sort_bucket **ins, struct sort_bucket *out)
{
- uns num_ins = 0;
+ uint num_ins = 0;
while (ins[num_ins])
num_ins++;
- uns n2 = 1;
+ uint n2 = 1;
while (n2 < num_ins)
n2 *= 2;
struct fastbuf *fins[num_ins];
P(key) keys[num_ins];
P(mwt) tree[2*n2];
- for (uns i=1; i<2*n2; i++)
+ for (uint i=1; i<2*n2; i++)
tree[i] = (P(mwt)) { .i = -1 };
- for (uns i=0; i<num_ins; i++)
+ for (uint i=0; i<num_ins; i++)
{
fins[i] = sbuck_read(ins[i]);
if (P(read_key)(fins[i], &keys[i]))
#ifdef SORT_UNIFY
- uns hits[num_ins];
+ uint hits[num_ins];
P(key) *mkeys[num_ins], *key;
struct fastbuf *mfb[num_ins];
continue;
}
- uns m = 0;
+ uint m = 0;
key = &keys[i];
do
{
P(copy_merged)(mkeys, mfb, m, fout);
- for (uns j=0; j<m; j++)
+ for (uint j=0; j<m; j++)
{
i = hits[j];
if (likely(P(read_key)(fins[i], &keys[i])))
/* Simplified version which does not support any unification */
while (likely(tree[1].i >= 0))
{
- uns i = tree[1].i;
+ uint i = tree[1].i;
P(key) UNUSED key = keys[i];
P(copy_data)(&keys[i], fins[i], fout);
if (unlikely(!P(read_key)(fins[i], &keys[i])))