2 * UCW Library -- Universal Sorter: Governing Routines
4 * (c) 2007 Martin Mares <mj@ucw.cz>
6 * This software may be freely distributed and used according to the terms
7 * of the GNU Lesser General Public License.
11 #include "lib/fastbuf.h"
12 #include "lib/mempool.h"
13 #include "lib/stkstring.h"
14 #include "lib/sorter/common.h"
20 #define F_BSIZE(b) stk_fsize(sbuck_size(b))
26 gettimeofday(&tv, NULL);
27 return (u64)tv.tv_sec * 1000 + tv.tv_usec / 1000;
31 sorter_start_timer(struct sort_context *ctx)
33 ctx->start_time = sorter_clock();
37 sorter_speed(struct sort_context *ctx, u64 size)
39 u64 stop_time = sorter_clock();
42 if (stop_time <= ctx->start_time)
44 return (uns)((double)size / (1<<20) * 1000 / (stop_time-ctx->start_time));
48 sorter_presort(struct sort_context *ctx, struct sort_bucket *in, struct sort_bucket *out, struct sort_bucket *out_only)
50 sorter_alloc_buf(ctx);
51 if (in->flags & SBF_CUSTOM_PRESORT)
53 struct fastbuf *f = sbuck_write(out);
55 return ctx->custom_presort(f, ctx->big_buf, ctx->big_buf_size); // FIXME: out_only optimization?
57 return ctx->internal_sort(ctx, in, out, out_only);
60 static inline struct sort_bucket *
61 sbuck_join_to(struct sort_bucket *b)
63 if (sorter_debug & SORT_DEBUG_NO_JOIN)
66 struct sort_bucket *out = (struct sort_bucket *) b->n.prev; // Such bucket is guaranteed to exist
67 return (out->flags & SBF_FINAL) ? out : NULL;
71 sorter_join(struct sort_bucket *b)
73 struct sort_bucket *join = (struct sort_bucket *) b->n.prev;
74 ASSERT(join->flags & SBF_FINAL);
77 if (!sbuck_has_file(join))
79 // The final bucket doesn't have any file associated yet, so replace
80 // it with the new bucket.
81 SORT_XTRACE(2, "Replaced final bucket");
82 b->flags |= SBF_FINAL;
87 SORT_TRACE("Copying to output file: %s", F_BSIZE(b));
88 struct fastbuf *src = sbuck_read(b);
89 struct fastbuf *dest = sbuck_write(join);
90 bbcopy(src, dest, ~0U);
96 sorter_twoway(struct sort_context *ctx, struct sort_bucket *b)
98 struct sort_bucket *ins[3] = { NULL }, *outs[3] = { NULL };
99 cnode *list_pos = b->n.prev;
100 struct sort_bucket *join = sbuck_join_to(b);
102 if (!(sorter_debug & SORT_DEBUG_NO_PRESORT) || (b->flags & SBF_CUSTOM_PRESORT))
104 SORT_XTRACE(3, "%s", ((b->flags & SBF_CUSTOM_PRESORT) ? "Custom presorting" : "Presorting"));
105 sorter_start_timer(ctx);
106 ins[0] = sbuck_new(ctx);
107 if (!sorter_presort(ctx, b, ins[0], join ? : ins[0]))
109 SORT_XTRACE(((b->flags & SBF_SOURCE) ? 1 : 2), "Sorted in memory");
113 clist_insert_after(&ins[0]->n, list_pos);
118 ins[1] = sbuck_new(ctx);
120 while (sorter_presort(ctx, b, ins[i], ins[i]))
123 SORT_TRACE("Presorting pass (%d+%d runs, %s+%s, %dMB/s)",
124 ins[0]->runs, ins[1]->runs,
125 F_BSIZE(ins[0]), F_BSIZE(ins[1]),
126 sorter_speed(ctx, sbuck_size(ins[0]) + sbuck_size(ins[1])));
130 SORT_XTRACE(2, "Presorting disabled");
134 SORT_XTRACE(3, "Main sorting");
138 sorter_start_timer(ctx);
139 if (ins[0]->runs == 1 && ins[1]->runs == 1 && join)
141 // This is guaranteed to produce a single run, so join if possible
142 sh_off_t join_size = sbuck_size(join);
145 ctx->twoway_merge(ctx, ins, outs);
146 ASSERT(join->runs == 2);
148 join_size = sbuck_size(join) - join_size;
149 SORT_TRACE("Mergesort pass %d (final run, %s, %dMB/s)", pass, stk_fsize(join_size), sorter_speed(ctx, join_size));
154 outs[0] = sbuck_new(ctx);
155 outs[1] = sbuck_new(ctx);
157 ctx->twoway_merge(ctx, ins, outs);
158 SORT_TRACE("Mergesort pass %d (%d+%d runs, %s+%s, %dMB/s)", pass,
159 outs[0]->runs, outs[1]->runs,
160 F_BSIZE(outs[0]), F_BSIZE(outs[1]),
161 sorter_speed(ctx, sbuck_size(outs[0]) + sbuck_size(outs[1])));
164 memcpy(ins, outs, 3*sizeof(struct sort_bucket *));
165 } while (sbuck_have(ins[1]));
168 clist_insert_after(&ins[0]->n, list_pos);
172 sorter_radix_p(struct sort_context *ctx, struct sort_bucket *b)
174 return b->hash_bits && ctx->radix_split &&
175 !(sorter_debug & SORT_DEBUG_NO_RADIX) &&
176 sbuck_size(b) > (sh_off_t)sorter_bufsize;
180 sorter_radix(struct sort_context *ctx, struct sort_bucket *b)
182 uns bits = MIN(b->hash_bits, 4); /* FIXME */
183 uns nbuck = 1 << bits;
184 SORT_XTRACE(2, "Running radix sort on %s with %d bits of %d", F_BSIZE(b), bits, b->hash_bits);
185 sorter_start_timer(ctx);
187 struct sort_bucket **outs = alloca(nbuck * sizeof(struct sort_bucket *));
188 for (uns i=nbuck; i--; )
190 outs[i] = sbuck_new(ctx);
191 outs[i]->hash_bits = b->hash_bits - bits;
192 clist_insert_after(&outs[i]->n, &b->n);
195 ctx->radix_split(ctx, b, outs, b->hash_bits - bits, bits);
197 u64 min = ~(u64)0, max = 0, sum = 0;
198 for (uns i=0; i<nbuck; i++)
200 u64 s = sbuck_size(outs[i]);
206 SORT_TRACE("Radix split (%d buckets, %s min, %s max, %s avg, %dMB/s)", nbuck,
207 stk_fsize(min), stk_fsize(max), stk_fsize(sum / nbuck), sorter_speed(ctx, sum));
212 sorter_run(struct sort_context *ctx)
214 ctx->pool = mp_new(4096);
215 clist_init(&ctx->bucket_list);
217 /* FIXME: Remember to test sorting of empty files */
219 // Create bucket containing the source
220 struct sort_bucket *bin = sbuck_new(ctx);
221 bin->flags = SBF_SOURCE | SBF_OPEN_READ;
222 if (ctx->custom_presort)
223 bin->flags |= SBF_CUSTOM_PRESORT;
225 bin->fb = ctx->in_fb;
227 bin->size = ctx->in_size; /* FIXME: Sizes should be either sh_off_t or u64, not both; beware of ~0U */
228 bin->hash_bits = ctx->hash_bits;
229 clist_add_tail(&ctx->bucket_list, &bin->n);
230 SORT_XTRACE(2, "Input size: %s", F_BSIZE(bin));
232 // Create bucket for the output
233 struct sort_bucket *bout = sbuck_new(ctx);
234 bout->flags = SBF_FINAL;
235 if (bout->fb = ctx->out_fb)
236 bout->flags |= SBF_OPEN_WRITE;
239 clist_add_head(&ctx->bucket_list, &bout->n);
241 struct sort_bucket *b;
242 while (bout = clist_head(&ctx->bucket_list), b = clist_next(&ctx->bucket_list, &bout->n))
244 SORT_XTRACE(2, "Next block: %s, %d hash bits", F_BSIZE(b), b->hash_bits);
247 else if (b->runs == 1)
249 else if (sorter_radix_p(ctx, b))
250 sorter_radix(ctx, b);
252 sorter_twoway(ctx, b);
255 sorter_free_buf(ctx);
256 sbuck_write(bout); // Force empty bucket to a file
257 SORT_XTRACE(2, "Final size: %s", F_BSIZE(bout));
258 ctx->out_fb = sbuck_read(bout);