2 * UCW Library -- Universal Sorter
4 * (c) 2001--2007 Martin Mares <mj@ucw.cz>
5 * (c) 2004 Robert Spalek <robert@ucw.cz>
7 * This software may be freely distributed and used according to the terms
8 * of the GNU Lesser General Public License.
12 * This is not a normal header file, but a generator of sorting
13 * routines. Each time you include it with parameters set in the
14 * corresponding preprocessor macros, it generates a file sorter
15 * with the parameters given.
17 * FIXME: explain the basics (keys and data, callbacks etc.)
19 * Basic parameters and callbacks:
21 * SORT_PREFIX(x) add a name prefix (used on all global names
22 * defined by the sorter)
24 * SORT_KEY data type capable of storing a single key.
25 * SORT_KEY_REGULAR data type holding a single key both in memory and on disk;
26 * in this case, bread() and bwrite() is used to read/write keys
27 * and it's also assumed that the keys are not very long.
28 * int PREFIX_compare(SORT_KEY *a, SORT_KEY *b)
29 * compares two keys, result like strcmp(). Mandatory.
30 * int PREFIX_read_key(struct fastbuf *f, SORT_KEY *k)
31 * reads a key from a fastbuf, returns nonzero=ok, 0=EOF.
32 * Mandatory unless SORT_KEY_REGULAR is defined.
33 * void PREFIX_write_key(struct fastbuf *f, SORT_KEY *k)
34 * writes a key to a fastbuf. Mandatory unless SORT_KEY_REGULAR.
36 * SORT_KEY_SIZE(key) returns the real size of a key (a SORT_KEY type in memory
37 * can be truncated to this number of bytes without any harm;
38 * used to save memory when the keys have variable sizes).
39 * Default: always store the whole SORT_KEY.
40 * SORT_DATA_SIZE(key) gets a key and returns the amount of data following it.
41 * Default: records consist of keys only.
45 * SORT_INT(key) We are sorting by an integer value. In this mode, PREFIX_compare
46 * is supplied automatically and the sorting function gets an extra
47 * parameter specifying a range of the integers. The better the range
48 * fits, the faster we sort. Sets up SORT_HASH_xxx automatically.
50 * Hashing (optional, but it can speed sorting up):
52 * SORT_HASH_BITS signals that a monotone hashing function returning a given number of
53 * bits is available. Monotone hash is a function f such that f(x) < f(y)
54 * implies x < y and which is approximately uniformly distributed.
55 * uns PREFIX_hash(SORT_KEY *a, SORT_KEY *b)
59 * SORT_UNIFY merge items with identical keys, needs the following functions:
60 * void PREFIX_write_merged(struct fastbuf *f, SORT_KEY **keys, void **data, uns n, void *buf)
61 * takes n records in memory with keys which compare equal and writes
62 * a single record to the given fastbuf. `buf' points to a buffer which
63 * is guaranteed to hold all given records.
64 * void PREFIX_copy_merged(SORT_KEY **keys, struct fastbuf **data, uns n, struct fastbuf *dest)
65 * takes n records with keys in memory and data in fastbufs and writes
68 * Input (choose one of these):
70 * SORT_INPUT_FILE file of a given name
71 * SORT_INPUT_FB fastbuf stream
72 * SORT_INPUT_PRESORT custom presorter. Calls function
73 * int PREFIX_presort(struct fastbuf *dest, void *buf, size_t bufsize);
74 * to get successive batches of pre-sorted data.
75 * The function is passed a page-aligned presorting buffer.
76 * It returns 1 on success or 0 on EOF.
78 * Output (chose one of these):
80 * SORT_OUTPUT_FILE file of a given name
81 * SORT_OUTPUT_FB temporary fastbuf stream
82 * SORT_OUTPUT_THIS_FB a given fastbuf stream which can already contain a header
86 * SORT_UNIQUE all items have distinct keys (checked in debug mode)
88 * FIXME: Maybe implement these:
89 * ??? SORT_DELETE_INPUT a C expression, if true, the input files are
90 * deleted as soon as possible
93 * The function generated:
95 * <outfb> PREFIX_SORT(<in>, <out> [,<range>]), where:
96 * <in> = input file name/fastbuf or NULL
97 * <out> = output file name/fastbuf or NULL
98 * <range> = maximum integer value for the SORT_INT mode
99 * <outfb> = output fastbuf (in SORT_OUTPUT_FB mode)
101 * After including this file, all parameter macros are automatically
105 #include "lib/sorter/common.h"
106 #include "lib/fastbuf.h"
110 #define P(x) SORT_PREFIX(x)
112 #ifdef SORT_KEY_REGULAR
113 typedef SORT_KEY_REGULAR P(key);
114 static inline int P(read_key) (struct fastbuf *f, P(key) *k)
116 return breadb(f, k, sizeof(P(key)));
118 static inline void P(write_key) (struct fastbuf *f, P(key) *k)
120 bwrite(f, k, sizeof(P(key)));
122 #elif defined(SORT_KEY)
123 typedef SORT_KEY P(key);
125 #error Missing definition of sorting key.
129 static inline int P(compare) (P(key) *x, P(key) *y)
131 if (SORT_INT(*x) < SORT_INT(*y))
133 if (SORT_INT(*x) > SORT_INT(*y))
138 #ifndef SORT_HASH_BITS
139 static inline int P(hash) (P(key) *x)
141 return SORT_INT((*x));
151 #define SWAP(x,y,z) do { z=x; x=y; y=z; } while(0)
153 #if defined(SORT_UNIQUE) && defined(DEBUG_ASSERTS)
154 #define SORT_ASSERT_UNIQUE
160 #define SORT_KEY_SIZE(key) sizeof(key)
163 #ifdef SORT_DATA_SIZE
164 #define SORT_VAR_DATA
166 #define SORT_DATA_SIZE(key) 0
169 static inline void P(copy_data)(P(key) *key, struct fastbuf *in, struct fastbuf *out)
171 P(write_key)(out, key);
173 bbcopy(in, out, SORT_DATA_SIZE(*key));
179 #include "lib/sorter/s-internal.h"
180 #include "lib/sorter/s-twoway.h"
182 static struct fastbuf *P(sort)(
183 #ifdef SORT_INPUT_FILE
188 #ifdef SORT_OUTPUT_FILE
198 struct sort_context ctx;
199 bzero(&ctx, sizeof(ctx));
201 #ifdef SORT_INPUT_FILE
202 ctx.in_fb = bopen(in, O_RDONLY, sorter_stream_bufsize);
203 #elif defined(SORT_INPUT_FB)
205 #elif defined(SORT_INPUT_PRESORT)
207 ctx.custom_presort = P(presort);
209 #error No input given.
212 #ifdef SORT_OUTPUT_FB
214 #elif defined(SORT_OUTPUT_THIS_FB)
216 #elif defined(SORT_OUTPUT_FILE)
217 /* Just assume fastbuf output and rename the fastbuf later */
219 #error No output given.
222 #ifdef SORT_HASH_BITS
223 ctx.hash_bits = SORT_HASH_BITS;
224 #elif defined(SORT_INT)
226 while (ctx.hash_bits < 32 && (int_range >> ctx.hash_bits))
230 ctx.internal_sort = P(internal);
231 ctx.twoway_merge = P(twoway_merge);
235 #ifdef SORT_OUTPUT_FILE
236 if (rename(ctx.out_fb->name, out) < 0)
237 die("Cannot rename %s to %s: %m", ctx.out_fb->name, out);
238 bconfig(ctx.out_fb, BCONFIG_IS_TEMP_FILE, 0);
247 #undef SORT_KEY_REGULAR
249 #undef SORT_DATA_SIZE
253 #undef SORT_HASH_BITS
255 #undef SORT_INPUT_FILE
257 #undef SORT_INPUT_PRESORT
258 #undef SORT_OUTPUT_FILE
259 #undef SORT_OUTPUT_FB
260 #undef SORT_OUTPUT_THIS_FB
262 #undef SORT_ASSERT_UNIQUE
266 /* FIXME: Check that we undef everything we should. */