* is supplied automatically and the sorting function gets an extra
* parameter specifying a range of the integers. The better the range
* fits, the faster we sort. Sets up SORT_HASH_xxx automatically.
+ * SORT_INT64(key) the same for 64-bit integers.
*
* Hashing (optional, but it can speed sorting up):
*
#error Missing definition of sorting key.
#endif
+#ifdef SORT_INT64
+typedef u64 P(hash_t);
+#define SORT_INT SORT_INT64
+#else
+typedef uns P(hash_t);
+#endif
+
#ifdef SORT_INT
static inline int P(compare) (P(key) *x, P(key) *y)
{
}
#ifndef SORT_HASH_BITS
-static inline int P(hash) (P(key) *x)
+static inline P(hash_t) P(hash) (P(key) *x)
{
return SORT_INT((*x));
}
#include "lib/sorter/s-twoway.h"
+#ifndef SORT_UNIFY
+#include "lib/sorter/s-multiway.h"
+#endif
+
#if defined(SORT_HASH_BITS) || defined(SORT_INT)
#include "lib/sorter/s-radix.h"
#endif
struct fastbuf *out
#endif
#ifdef SORT_INT
- , uns int_range
+ , u64 int_range
#endif
)
{
bzero(&ctx, sizeof(ctx));
#ifdef SORT_INPUT_FILE
- ctx.in_fb = bopen(in, O_RDONLY, sorter_stream_bufsize);
+ ctx.in_fb = bopen_file(in, O_RDONLY, &sorter_fb_params);
ctx.in_size = bfilesize(ctx.in_fb);
#elif defined(SORT_INPUT_FB)
ctx.in_fb = in;
ctx.radix_split = P(radix_split);
#elif defined(SORT_INT)
ctx.hash_bits = 0;
- while (ctx.hash_bits < 32 && (int_range >> ctx.hash_bits))
+ while (ctx.hash_bits < 64 && (int_range >> ctx.hash_bits))
ctx.hash_bits++;
ctx.radix_split = P(radix_split);
#endif
ctx.internal_estimate = P(internal_estimate);
ctx.twoway_merge = P(twoway_merge);
+#ifndef SORT_UNIFY
+ ctx.multiway_merge = P(multiway_merge);
+#endif
+
sorter_run(&ctx);
#ifdef SORT_OUTPUT_FILE
- if (rename(ctx.out_fb->name, out) < 0)
- die("Cannot rename %s to %s: %m", ctx.out_fb->name, out);
- bconfig(ctx.out_fb, BCONFIG_IS_TEMP_FILE, 0);
- bclose(ctx.out_fb);
+ bfix_tmp_file(ctx.out_fb, out);
ctx.out_fb = NULL;
#endif
return ctx.out_fb;
#undef SORT_VAR_KEY
#undef SORT_VAR_DATA
#undef SORT_INT
+#undef SORT_INT64
#undef SORT_HASH_BITS
#undef SORT_UNIFY
#undef SORT_UNIFY_WORKSPACE