X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;ds=inline;f=lib%2Fsorter%2Fcommon.h;h=1b405a081af0320447b42fca03dfb48800695ab4;hb=dcbe7f152cd2baecd878d8df740d3007357e5d26;hp=60c6db98ceb8c63185df0922b25faacbedede4fd;hpb=c460be258f74353287bb852c37c7782a0322a3c0;p=libucw.git diff --git a/lib/sorter/common.h b/lib/sorter/common.h index 60c6db98..1b405a08 100644 --- a/lib/sorter/common.h +++ b/lib/sorter/common.h @@ -13,19 +13,25 @@ #include "lib/clists.h" /* Configuration, some of the variables are used by the old sorter, too. */ -extern uns sorter_trace, sorter_presort_bufsize, sorter_stream_bufsize; -extern uns sorter_debug, sorter_min_radix_bits, sorter_max_radix_bits; -extern u64 sorter_bufsize; -extern struct fb_params sorter_fb_params; +extern uns sorter_trace, sorter_trace_array, sorter_stream_bufsize; +extern uns sorter_debug, sorter_min_radix_bits, sorter_max_radix_bits, sorter_add_radix_bits; +extern uns sorter_min_multiway_bits, sorter_max_multiway_bits; +extern uns sorter_threads, sorter_thread_threshold, sorter_thread_chunk; +extern uns sorter_radix_threshold; +extern u64 sorter_bufsize, sorter_small_input; +extern struct fb_params sorter_fb_params, sorter_small_fb_params; -#define SORT_TRACE(x...) do { if (sorter_trace) log(L_DEBUG, x); } while(0) -#define SORT_XTRACE(level, x...) do { if (sorter_trace >= level) log(L_DEBUG, x); } while(0) +#define SORT_TRACE(x...) do { if (sorter_trace) msg(L_DEBUG, x); } while(0) +#define SORT_XTRACE(level, x...) do { if (sorter_trace >= level) msg(L_DEBUG, x); } while(0) enum sort_debug { SORT_DEBUG_NO_PRESORT = 1, SORT_DEBUG_NO_JOIN = 2, SORT_DEBUG_KEEP_BUCKETS = 4, SORT_DEBUG_NO_RADIX = 8, + SORT_DEBUG_NO_MULTIWAY = 16, + SORT_DEBUG_ASORT_NO_RADIX = 32, + SORT_DEBUG_ASORT_NO_THREADS = 64 }; struct sort_bucket; @@ -35,6 +41,7 @@ struct sort_context { struct fastbuf *out_fb; uns hash_bits; u64 in_size; + struct fb_params *fb_params; struct mempool *pool; clist bucket_list; @@ -54,6 +61,9 @@ struct sort_context { // Bucket arrays are NULL-terminated. void (*twoway_merge)(struct sort_context *ctx, struct sort_bucket **ins, struct sort_bucket **outs); + // Multi-way merge: merge an arbitrary number of source buckets to a single destination bucket. + void (*multiway_merge)(struct sort_context *ctx, struct sort_bucket **ins, struct sort_bucket *out); + // Radix split according to hash function void (*radix_split)(struct sort_context *ctx, struct sort_bucket *in, struct sort_bucket **outs, uns bitpos, uns numbits); @@ -108,6 +118,29 @@ sh_off_t sbuck_size(struct sort_bucket *b); struct fastbuf *sbuck_read(struct sort_bucket *b); struct fastbuf *sbuck_write(struct sort_bucket *b); void sbuck_swap_out(struct sort_bucket *b); -void format_size(byte *buf, u64 x); + +/* Contexts and helper functions for the array sorter */ + +struct asort_context { + void *array; // Array to sort + void *buffer; // Auxiliary buffer (required when radix-sorting) + uns num_elts; // Number of elements in the array + uns elt_size; // Bytes per element + uns hash_bits; // Remaining bits of the hash function + uns radix_bits; // How many bits to process in a single radix-sort pass + void (*quicksort)(void *array_ptr, uns num_elts); + void (*quicksplit)(void *array_ptr, uns num_elts, int *leftp, int *rightp); + void (*radix_count)(void *src_ptr, uns num_elts, uns *cnt, uns shift); + void (*radix_split)(void *src_ptr, void *dest_ptr, uns num_elts, uns *ptrs, uns shift); + + // Used internally by array.c + struct rs_work **rs_works; + struct work_queue *rs_work_queue; + struct eltpool *eltpool; +}; + +void asort_run(struct asort_context *ctx); +void asort_start_threads(uns run); +void asort_stop_threads(void); #endif