2 * Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
3 * Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 #include <sys/cdefs.h>
29 __FBSDID("$FreeBSD$");
33 #include <sys/types.h>
34 #include <sys/queue.h>
38 #if defined(SORT_THREADS)
41 #include <semaphore.h>
51 #include "radixsort.h"
53 unsigned long long free_memory = 1000000;
54 unsigned long long available_free_memory = 1000000;
58 const char *tmpdir = "/var/tmp";
59 const char *compress_program;
61 size_t max_open_files = 16;
64 * How much space we read from file at once
66 #define READ_CHUNK (4096)
69 * File reader structure
73 struct reader_buffer rb;
76 unsigned char *buffer;
77 unsigned char *mmapaddr;
78 unsigned char *mmapptr;
88 * Structure to be used in file merge process.
92 struct file_reader *fr;
93 struct sort_list_item *si; /* current top line */
98 * List elements of "cleanable" files list.
100 struct CLEANABLE_FILE
103 LIST_ENTRY(CLEANABLE_FILE) files;
107 * List header of "cleanable" files list.
109 static LIST_HEAD(CLEANABLE_FILES,CLEANABLE_FILE) tmp_files;
112 * Semaphore to protect the tmp file list.
113 * We use semaphore here because it is signal-safe, according to POSIX.
114 * And semaphore does not require pthread library.
116 static sem_t tmp_files_sem;
118 static void mt_sort(struct sort_list *list,
119 int (*sort_func)(void *, size_t, size_t,
120 int (*)(const void *, const void *)), const char* fn);
123 * Init tmp files list
129 LIST_INIT(&tmp_files);
130 sem_init(&tmp_files_sem, 0, 1);
134 * Save name of a tmp file for signal cleanup
137 tmp_file_atexit(const char *tmp_file)
141 sem_wait(&tmp_files_sem);
142 struct CLEANABLE_FILE *item =
143 sort_malloc(sizeof(struct CLEANABLE_FILE));
144 item->fn = sort_strdup(tmp_file);
145 LIST_INSERT_HEAD(&tmp_files, item, files);
146 sem_post(&tmp_files_sem);
154 clear_tmp_files(void)
156 struct CLEANABLE_FILE *item;
158 sem_wait(&tmp_files_sem);
159 LIST_FOREACH(item,&tmp_files,files) {
160 if ((item) && (item->fn))
163 sem_post(&tmp_files_sem);
167 * Check whether a file is a temporary file
170 file_is_tmp(const char* fn)
172 struct CLEANABLE_FILE *item;
176 sem_wait(&tmp_files_sem);
177 LIST_FOREACH(item,&tmp_files,files) {
178 if ((item) && (item->fn))
179 if (strcmp(item->fn, fn) == 0) {
184 sem_post(&tmp_files_sem);
191 * Generate new temporary file name
194 new_tmp_file_name(void)
196 static size_t tfcounter = 0;
197 static const char *fn = ".bsdsort.";
201 sz = strlen(tmpdir) + 1 + strlen(fn) + 32 + 1;
202 ret = sort_malloc(sz);
204 sprintf(ret, "%s/%s%d.%lu", tmpdir, fn, (int) getpid(), (unsigned long)(tfcounter++));
205 tmp_file_atexit(ret);
210 * Initialize file list
213 file_list_init(struct file_list *fl, bool tmp)
225 * Add a file name to the list
228 file_list_add(struct file_list *fl, char *fn, bool allocate)
232 if (fl->count >= fl->sz || (fl->fns == NULL)) {
233 fl->sz = (fl->sz) * 2 + 1;
234 fl->fns = sort_realloc(fl->fns, fl->sz *
237 fl->fns[fl->count] = allocate ? sort_strdup(fn) : fn;
243 * Populate file list from array of file names
246 file_list_populate(struct file_list *fl, int argc, char **argv, bool allocate)
252 for (i = 0; i < argc; i++)
253 file_list_add(fl, argv[i], allocate);
258 * Clean file list data and delete the files,
259 * if this is a list of temporary files
262 file_list_clean(struct file_list *fl)
269 for (i = 0; i < fl->count; i++) {
273 sort_free(fl->fns[i]);
290 sort_list_init(struct sort_list *l)
296 l->memsize = sizeof(struct sort_list);
302 * Add string to sort list
305 sort_list_add(struct sort_list *l, struct bwstring *str)
309 size_t indx = l->count;
311 if ((l->list == NULL) || (indx >= l->size)) {
312 size_t newsize = (l->size + 1) + 1024;
314 l->list = sort_realloc(l->list,
315 sizeof(struct sort_list_item*) * newsize);
316 l->memsize += (newsize - l->size) *
317 sizeof(struct sort_list_item*);
320 l->list[indx] = sort_list_item_alloc();
321 sort_list_item_set(l->list[indx], str);
322 l->memsize += sort_list_item_size(l->list[indx]);
328 * Clean sort list data
331 sort_list_clean(struct sort_list *l)
338 for (i = 0; i < l->count; i++) {
339 struct sort_list_item *item;
344 sort_list_item_clean(item);
354 l->memsize = sizeof(struct sort_list);
359 * Write sort list to file
362 sort_list_dump(struct sort_list *l, const char *fn)
368 f = openfile(fn, "w");
374 if (!(sort_opts_vals.uflag)) {
375 for (i = 0; i < l->count; ++i)
376 bwsfwrite(l->list[i]->str, f,
377 sort_opts_vals.zflag);
379 struct sort_list_item *last_printed_item = NULL;
380 struct sort_list_item *item;
381 for (i = 0; i < l->count; ++i) {
383 if ((last_printed_item == NULL) ||
384 list_coll(&last_printed_item, &item)) {
385 bwsfwrite(item->str, f, sort_opts_vals.zflag);
386 last_printed_item = item;
397 * Checks if the given file is sorted. Stops at the first disorder,
398 * prints the disordered line and returns 1.
401 check(const char *fn)
403 struct bwstring *s1, *s2, *s1disorder, *s2disorder;
404 struct file_reader *fr;
405 struct keys_array *ka1, *ka2;
407 size_t pos, posdisorder;
409 s1 = s2 = s1disorder = s2disorder = NULL;
412 fr = file_reader_init(fn);
423 s1 = file_reader_readline(fr);
427 ka1 = keys_array_alloc();
430 s2 = file_reader_readline(fr);
434 ka2 = keys_array_alloc();
440 bwsprintf(stdout, s2, "s1=<", ">");
441 bwsprintf(stdout, s1, "s2=<", ">");
443 int cmp = key_coll(ka2, ka1, 0);
445 printf("; cmp1=%d", cmp);
447 if (!cmp && sort_opts_vals.complex_sort &&
448 !(sort_opts_vals.uflag) && !(sort_opts_vals.sflag)) {
449 cmp = top_level_str_coll(s2, s1);
451 printf("; cmp2=%d", cmp);
456 if ((sort_opts_vals.uflag && (cmp <= 0)) || (cmp < 0)) {
457 if (!(sort_opts_vals.csilentflag)) {
458 s2disorder = bwsdup(s2);
461 s1disorder = bwsdup(s1);
469 clean_keys_array(s1, ka1);
477 s2 = file_reader_readline(fr);
481 ka2 = keys_array_alloc();
487 clean_keys_array(s1, ka1);
495 clean_keys_array(s2, ka2);
502 if ((fn == NULL) || (*fn == 0) || (strcmp(fn, "-") == 0)) {
504 s2 = file_reader_readline(fr);
511 file_reader_free(fr);
514 bws_disorder_warnx(s2disorder, fn, posdisorder);
516 bws_disorder_warnx(s1disorder, fn, posdisorder);
517 if (s1disorder != s2disorder)
532 * Opens a file. If the given filename is "-", stdout will be
536 openfile(const char *fn, const char *mode)
540 if (strcmp(fn, "-") == 0) {
541 return ((mode && mode[0] == 'r') ? stdin : stdout);
543 mode_t orig_file_mask = 0;
544 int is_tmp = file_is_tmp(fn);
546 if (is_tmp && (mode[0] == 'w'))
547 orig_file_mask = umask(S_IWGRP | S_IWOTH |
550 if (is_tmp && (compress_program != NULL)) {
554 cmdsz = strlen(fn) + 128;
555 cmd = sort_malloc(cmdsz);
560 snprintf(cmd, cmdsz - 1, "cat %s | %s -d",
561 fn, compress_program);
562 else if (mode[0] == 'w')
563 snprintf(cmd, cmdsz - 1, "%s > %s",
564 compress_program, fn);
566 err(2, "%s", getstr(7));
568 if ((file = popen(cmd, mode)) == NULL)
574 if ((file = fopen(fn, mode)) == NULL)
577 if (is_tmp && (mode[0] == 'w'))
578 umask(orig_file_mask);
588 closefile(FILE *f, const char *fn)
592 } else if (f == stdin) {
594 } else if (f == stdout) {
597 if (file_is_tmp(fn) && compress_program != NULL) {
606 * Reads a file into the internal buffer.
609 file_reader_init(const char *fsrc)
611 struct file_reader *ret;
616 ret = sort_malloc(sizeof(struct file_reader));
617 memset(ret, 0, sizeof(struct file_reader));
620 if (sort_opts_vals.zflag)
623 ret->fname = sort_strdup(fsrc);
625 if (strcmp(fsrc, "-") && (compress_program == NULL) && use_mmap) {
628 struct stat stat_buf;
633 flags = MAP_NOCORE | MAP_NOSYNC;
636 fd = open(fsrc, O_RDONLY);
640 if (fstat(fd, &stat_buf) < 0) {
645 sz = stat_buf.st_size;
647 #if defined(MAP_PREFAULT_READ)
648 flags |= MAP_PREFAULT_READ;
651 addr = mmap(NULL, sz, PROT_READ, flags, fd, 0);
652 if (addr == MAP_FAILED) {
658 ret->mmapaddr = addr;
660 ret->mmapptr = ret->mmapaddr;
665 if (ret->mmapaddr == NULL) {
666 ret->file = openfile(fsrc, "r");
667 if (ret->file == NULL)
670 if (strcmp(fsrc, "-")) {
671 ret->cbsz = READ_CHUNK;
672 ret->buffer = sort_malloc(ret->cbsz);
676 ret->bsz = fread(ret->buffer, 1, ret->cbsz, ret->file);
678 if (ferror(ret->file))
688 file_reader_readline(struct file_reader *fr)
690 struct bwstring *ret = NULL;
693 unsigned char *mmapend;
695 mmapend = fr->mmapaddr + fr->mmapsize;
696 if (fr->mmapptr >= mmapend)
699 unsigned char *strend;
702 sz = mmapend - fr->mmapptr;
703 strend = memchr(fr->mmapptr, fr->elsymb, sz);
705 if (strend == NULL) {
706 ret = bwscsbdup(fr->mmapptr, sz);
707 fr->mmapptr = mmapend;
709 ret = bwscsbdup(fr->mmapptr, strend -
711 fr->mmapptr = strend + 1;
715 } else if (fr->file != stdin) {
716 unsigned char *strend;
717 size_t bsz1, remsz, search_start;
723 if (fr->bsz > fr->strbeg)
724 remsz = fr->bsz - fr->strbeg;
726 /* line read cycle */
728 if (remsz > search_start)
729 strend = memchr(fr->buffer + fr->strbeg +
730 search_start, fr->elsymb, remsz -
740 if (fr->bsz != fr->cbsz)
742 err(2, "File read software error 1");
744 if (remsz > (READ_CHUNK >> 1)) {
745 search_start = fr->cbsz - fr->strbeg;
746 fr->cbsz += READ_CHUNK;
747 fr->buffer = sort_realloc(fr->buffer,
749 bsz1 = fread(fr->buffer + fr->bsz, 1,
750 READ_CHUNK, fr->file);
752 if (ferror(fr->file))
759 if (remsz > 0 && fr->strbeg>0)
760 bcopy(fr->buffer + fr->strbeg,
764 search_start = remsz;
765 bsz1 = fread(fr->buffer + remsz, 1,
766 fr->cbsz - remsz, fr->file);
768 if (ferror(fr->file))
772 fr->bsz = remsz + bsz1;
778 strend = fr->buffer + fr->bsz;
780 if ((fr->buffer + fr->strbeg <= strend) &&
781 (fr->strbeg < fr->bsz) && (remsz>0))
782 ret = bwscsbdup(fr->buffer + fr->strbeg, strend -
783 fr->buffer - fr->strbeg);
785 fr->strbeg = (strend - fr->buffer) + 1;
790 ret = bwsfgetln(fr->file, &len, sort_opts_vals.zflag,
798 file_reader_clean(struct file_reader *fr)
803 munmap(fr->mmapaddr, fr->mmapsize);
809 sort_free(fr->buffer);
812 if (fr->file != stdin)
813 closefile(fr->file, fr->fname);
816 sort_free(fr->fname);
818 memset(fr, 0, sizeof(struct file_reader));
823 file_reader_free(struct file_reader *fr)
827 file_reader_clean(fr);
833 procfile(const char *fsrc, struct sort_list *list, struct file_list *fl)
835 struct file_reader *fr;
837 fr = file_reader_init(fsrc);
841 /* file browse cycle */
843 struct bwstring *bws;
845 bws = file_reader_readline(fr);
850 sort_list_add(list, bws);
852 if (list->memsize >= available_free_memory) {
855 fn = new_tmp_file_name();
856 sort_list_to_file(list, fn);
857 file_list_add(fl, fn, false);
858 sort_list_clean(list);
862 file_reader_free(fr);
868 * Compare file headers. Files with EOF always go to the end of the list.
871 file_header_cmp(struct file_header *f1, struct file_header *f2)
877 if (f1->fr == NULL) {
878 return ((f2->fr == NULL) ? 0 : +1);
879 } else if (f2->fr == NULL)
884 ret = list_coll(&(f1->si), &(f2->si));
886 return ((f1->file_pos < f2->file_pos) ? -1 : +1);
893 * Allocate and init file header structure
896 file_header_init(struct file_header **fh, const char *fn, size_t file_pos)
900 struct bwstring *line;
902 *fh = sort_malloc(sizeof(struct file_header));
903 (*fh)->file_pos = file_pos;
904 (*fh)->fr = file_reader_init(fn);
905 if ((*fh)->fr == NULL) {
907 err(2, "%s", getstr(8));
909 line = file_reader_readline((*fh)->fr);
911 file_reader_free((*fh)->fr);
915 (*fh)->si = sort_list_item_alloc();
916 sort_list_item_set((*fh)->si, line);
925 file_header_close(struct file_header **fh)
930 file_reader_free((*fh)->fr);
934 sort_list_item_clean((*fh)->si);
935 sort_free((*fh)->si);
944 * Swap two array elements
947 file_header_swap(struct file_header **fh, size_t i1, size_t i2)
949 struct file_header *tmp;
956 /* heap algorithm ==>> */
959 * See heap sort algorithm
960 * "Raises" last element to its right place
963 file_header_heap_swim(struct file_header **fh, size_t indx)
969 parent_index = (indx - 1) >> 1;
971 if (file_header_cmp(fh[indx], fh[parent_index]) < 0) {
972 /* swap child and parent and continue */
973 file_header_swap(fh, indx, parent_index);
974 file_header_heap_swim(fh, parent_index);
980 * Sink the top element to its correct position
983 file_header_heap_sink(struct file_header **fh, size_t indx, size_t size)
985 size_t left_child_index;
986 size_t right_child_index;
988 left_child_index = indx + indx + 1;
989 right_child_index = left_child_index + 1;
991 if (left_child_index < size) {
992 size_t min_child_index;
994 min_child_index = left_child_index;
996 if ((right_child_index < size) &&
997 (file_header_cmp(fh[left_child_index],
998 fh[right_child_index]) > 0))
999 min_child_index = right_child_index;
1000 if (file_header_cmp(fh[indx], fh[min_child_index]) > 0) {
1001 file_header_swap(fh, indx, min_child_index);
1002 file_header_heap_sink(fh, min_child_index, size);
1007 /* <<== heap algorithm */
1010 * Adds element to the "left" end
1013 file_header_list_rearrange_from_header(struct file_header **fh, size_t size)
1016 file_header_heap_sink(fh, 0, size);
1020 * Adds element to the "right" end
1023 file_header_list_push(struct file_header *f, struct file_header **fh, size_t size)
1027 file_header_heap_swim(fh, size - 1);
1032 struct bwstring *str;
1036 * Prints the current line of the file
1039 file_header_print(struct file_header *fh, FILE *f_out, struct last_printed *lp)
1042 if (fh && fh->fr && f_out && fh->si && fh->si->str) {
1043 if (sort_opts_vals.uflag) {
1044 if ((lp->str == NULL) || (str_list_coll(lp->str, &(fh->si)))) {
1045 bwsfwrite(fh->si->str, f_out, sort_opts_vals.zflag);
1048 lp->str = bwsdup(fh->si->str);
1051 bwsfwrite(fh->si->str, f_out, sort_opts_vals.zflag);
1059 file_header_read_next(struct file_header *fh)
1063 struct bwstring *tmp;
1065 tmp = file_reader_readline(fh->fr);
1067 file_reader_free(fh->fr);
1070 sort_list_item_clean(fh->si);
1076 fh->si = sort_list_item_alloc();
1077 sort_list_item_set(fh->si, tmp);
1083 * Merge array of "files headers"
1086 file_headers_merge(size_t fnum, struct file_header **fh, FILE *f_out)
1088 struct last_printed lp;
1091 memset(&lp, 0, sizeof(lp));
1094 * construct the initial sort structure
1096 for (i = 0; i < fnum; i++)
1097 file_header_list_push(fh[i], fh, i);
1099 while (fh[0]->fr) { /* unfinished files are always in front */
1100 /* output the smallest line: */
1101 file_header_print(fh[0], f_out, &lp);
1102 /* read a new line, if possible: */
1103 file_header_read_next(fh[0]);
1104 /* re-arrange the list: */
1105 file_header_list_rearrange_from_header(fh, fnum);
1113 * Merges the given files into the output file, which can be
1117 merge_files_array(size_t argc, char **argv, const char *fn_out)
1120 if (argv && fn_out) {
1121 struct file_header **fh;
1125 f_out = openfile(fn_out, "w");
1130 fh = sort_malloc((argc + 1) * sizeof(struct file_header *));
1132 for (i = 0; i < argc; i++)
1133 file_header_init(fh + i, argv[i], (size_t) i);
1135 file_headers_merge(argc, fh, f_out);
1137 for (i = 0; i < argc; i++)
1138 file_header_close(fh + i);
1142 closefile(f_out, fn_out);
1147 * Shrinks the file list until its size smaller than max number of opened files
1150 shrink_file_list(struct file_list *fl)
1153 if ((fl == NULL) || (size_t) (fl->count) < max_open_files)
1156 struct file_list new_fl;
1159 file_list_init(&new_fl, true);
1160 while (indx < fl->count) {
1164 num = fl->count - indx;
1165 fnew = new_tmp_file_name();
1167 if ((size_t) num >= max_open_files)
1168 num = max_open_files - 1;
1169 merge_files_array(num, fl->fns + indx, fnew);
1173 for (i = 0; i < num; i++)
1174 unlink(fl->fns[indx + i]);
1176 file_list_add(&new_fl, fnew, false);
1179 fl->tmp = false; /* already taken care of */
1180 file_list_clean(fl);
1182 fl->count = new_fl.count;
1183 fl->fns = new_fl.fns;
1185 fl->tmp = new_fl.tmp;
1192 * Merge list of files
1195 merge_files(struct file_list *fl, const char *fn_out)
1199 while (shrink_file_list(fl));
1201 merge_files_array(fl->count, fl->fns, fn_out);
1206 get_sort_method_name(int sm)
1209 if (sm == SORT_MERGESORT)
1211 else if (sort_opts_vals.sort_method == SORT_RADIXSORT)
1213 else if (sort_opts_vals.sort_method == SORT_HEAPSORT)
1222 static int sort_qsort(void *list, size_t count, size_t elem_size,
1223 int (*cmp_func)(const void *, const void *))
1226 qsort(list, count, elem_size, cmp_func);
1231 * Sort list of lines and writes it to the file
1234 sort_list_to_file(struct sort_list *list, const char *outfile)
1236 struct sort_mods *sm = &(keys[0].sm);
1238 if (!(sm->Mflag) && !(sm->Rflag) && !(sm->Vflag) && !(sm->Vflag) &&
1239 !(sm->gflag) && !(sm->hflag) && !(sm->nflag)) {
1240 if ((sort_opts_vals.sort_method == SORT_DEFAULT) && byte_sort)
1241 sort_opts_vals.sort_method = SORT_RADIXSORT;
1243 } else if (sort_opts_vals.sort_method == SORT_RADIXSORT)
1244 err(2, "%s", getstr(9));
1247 * to handle stable sort and the unique cases in the
1248 * right order, we need stable basic algorithm
1250 if (sort_opts_vals.sflag) {
1251 switch (sort_opts_vals.sort_method){
1252 case SORT_MERGESORT:
1254 case SORT_RADIXSORT:
1257 sort_opts_vals.sort_method = SORT_MERGESORT;
1260 errx(2, "%s", getstr(10));
1264 if (sort_opts_vals.sort_method == SORT_DEFAULT)
1265 sort_opts_vals.sort_method = DEFAULT_SORT_ALGORITHM;
1268 printf("sort_method=%s\n",
1269 get_sort_method_name(sort_opts_vals.sort_method));
1271 switch (sort_opts_vals.sort_method){
1272 case SORT_RADIXSORT:
1273 rxsort(list->list, list->count);
1274 sort_list_dump(list, outfile);
1276 case SORT_MERGESORT:
1277 mt_sort(list, mergesort, outfile);
1280 mt_sort(list, heapsort, outfile);
1283 mt_sort(list, sort_qsort, outfile);
1286 mt_sort(list, DEFAULT_SORT_FUNC, outfile);
1291 /******************* MT SORT ************************/
1293 #if defined(SORT_THREADS)
1294 /* semaphore to count threads */
1297 /* current system sort function */
1298 static int (*g_sort_func)(void *, size_t, size_t,
1299 int(*)(const void *, const void *));
1302 * Sort cycle thread (in multi-threaded mode)
1305 mt_sort_thread(void* arg)
1307 struct sort_list *list = arg;
1309 g_sort_func(list->list, list->count, sizeof(struct sort_list_item *),
1310 (int(*)(const void *, const void *)) list_coll);
1318 * Compare sub-lists. Empty sub-lists always go to the end of the list.
1321 sub_list_cmp(struct sort_list *l1, struct sort_list *l2)
1327 if (l1->count == 0) {
1328 return ((l2->count == 0) ? 0 : +1);
1329 } else if (l2->count == 0) {
1334 ret = list_coll(&(l1->list[0]), &(l2->list[0]));
1336 return ((l1->sub_list_pos < l2->sub_list_pos) ?
1344 * Swap two array elements
1347 sub_list_swap(struct sort_list **sl, size_t i1, size_t i2)
1349 struct sort_list *tmp;
1356 /* heap algorithm ==>> */
1359 * See heap sort algorithm
1360 * "Raises" last element to its right place
1363 sub_list_swim(struct sort_list **sl, size_t indx)
1367 size_t parent_index;
1369 parent_index = (indx - 1) >> 1;
1371 if (sub_list_cmp(sl[indx], sl[parent_index]) < 0) {
1372 /* swap child and parent and continue */
1373 sub_list_swap(sl, indx, parent_index);
1374 sub_list_swim(sl, parent_index);
1380 * Sink the top element to its correct position
1383 sub_list_sink(struct sort_list **sl, size_t indx, size_t size)
1385 size_t left_child_index;
1386 size_t right_child_index;
1388 left_child_index = indx + indx + 1;
1389 right_child_index = left_child_index + 1;
1391 if (left_child_index < size) {
1392 size_t min_child_index;
1394 min_child_index = left_child_index;
1396 if ((right_child_index < size) &&
1397 (sub_list_cmp(sl[left_child_index],
1398 sl[right_child_index]) > 0))
1399 min_child_index = right_child_index;
1400 if (sub_list_cmp(sl[indx], sl[min_child_index]) > 0) {
1401 sub_list_swap(sl, indx, min_child_index);
1402 sub_list_sink(sl, min_child_index, size);
1407 /* <<== heap algorithm */
1410 * Adds element to the "right" end
1413 sub_list_push(struct sort_list *s, struct sort_list **sl, size_t size)
1417 sub_list_swim(sl, size - 1);
1420 struct last_printed_item
1422 struct sort_list_item *item;
1426 * Prints the current line of the file
1429 sub_list_header_print(struct sort_list *sl, FILE *f_out,
1430 struct last_printed_item *lp)
1433 if (sl && sl->count && f_out && sl->list[0]->str) {
1434 if (sort_opts_vals.uflag) {
1435 if ((lp->item == NULL) || (list_coll(&(lp->item),
1437 bwsfwrite(sl->list[0]->str, f_out,
1438 sort_opts_vals.zflag);
1439 lp->item = sl->list[0];
1442 bwsfwrite(sl->list[0]->str, f_out,
1443 sort_opts_vals.zflag);
1451 sub_list_next(struct sort_list *sl)
1454 if (sl && sl->count) {
1461 * Merge sub-lists to a file
1464 merge_sub_lists(struct sort_list **sl, size_t n, FILE* f_out)
1466 struct last_printed_item lp;
1469 memset(&lp,0,sizeof(lp));
1471 /* construct the initial list: */
1472 for (i = 0; i < n; i++)
1473 sub_list_push(sl[i], sl, i);
1475 while (sl[0]->count) { /* unfinished lists are always in front */
1476 /* output the smallest line: */
1477 sub_list_header_print(sl[0], f_out, &lp);
1478 /* move to a new line, if possible: */
1479 sub_list_next(sl[0]);
1480 /* re-arrange the list: */
1481 sub_list_sink(sl, 0, n);
1486 * Merge sub-lists to a file
1489 merge_list_parts(struct sort_list **parts, size_t n, const char *fn)
1493 f_out = openfile(fn,"w");
1495 merge_sub_lists(parts, n, f_out);
1497 closefile(f_out, fn);
1500 #endif /* defined(SORT_THREADS) */
1502 * Multi-threaded sort algorithm "driver"
1505 mt_sort(struct sort_list *list,
1506 int(*sort_func)(void *, size_t, size_t, int(*)(const void *, const void *)),
1509 #if defined(SORT_THREADS)
1510 if (nthreads < 2 || list->count < MT_SORT_THRESHOLD) {
1511 size_t nthreads_save = nthreads;
1514 /* if single thread or small data, do simple sort */
1515 sort_func(list->list, list->count,
1516 sizeof(struct sort_list_item *),
1517 (int(*)(const void *, const void *)) list_coll);
1518 sort_list_dump(list, fn);
1519 #if defined(SORT_THREADS)
1520 nthreads = nthreads_save;
1522 /* multi-threaded sort */
1523 struct sort_list **parts;
1524 size_t avgsize, cstart, i;
1526 /* array of sub-lists */
1527 parts = sort_malloc(sizeof(struct sort_list*) * nthreads);
1529 avgsize = list->count / nthreads;
1531 /* set global system sort function */
1532 g_sort_func = sort_func;
1535 for (i = 0; i < nthreads; ++i) {
1538 parts[i] = sort_malloc(sizeof(struct sort_list));
1539 parts[i]->list = list->list + cstart;
1540 parts[i]->memsize = 0;
1541 parts[i]->sub_list_pos = i;
1543 sz = (i == nthreads - 1) ? list->count - cstart :
1546 parts[i]->count = sz;
1548 parts[i]->size = parts[i]->count;
1553 /* init threads counting semaphore */
1554 sem_init(&mtsem, 0, 0);
1557 for (i = 0; i < nthreads; ++i) {
1559 pthread_attr_t attr;
1561 pthread_attr_init(&attr);
1562 pthread_attr_setdetachstate(&attr, PTHREAD_DETACHED);
1565 int res = pthread_create(&pth, &attr,
1566 mt_sort_thread, parts[i]);
1570 if (errno == EAGAIN) {
1577 pthread_attr_destroy(&attr);
1580 /* wait for threads completion */
1581 for (i = 0; i < nthreads; ++i) {
1584 /* destroy the semaphore - we do not need it anymore */
1585 sem_destroy(&mtsem);
1587 /* merge sorted sub-lists to the file */
1588 merge_list_parts(parts, nthreads, fn);
1590 /* free sub-lists data */
1591 for (i = 0; i < nthreads; ++i) {
1592 sort_free(parts[i]);
1596 #endif /* defined(SORT_THREADS) */