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$");
32 #include <sys/sysctl.h>
33 #include <sys/types.h>
60 #define OPTIONS "bcCdfghik:Mmno:RrsS:t:T:uVz"
62 #define DEFAULT_RANDOM_SORT_SEED_FILE ("/dev/random")
63 #define MAX_DEFAULT_RANDOM_SEED_DATA_SIZE (1024)
65 static bool need_random;
66 static const char *random_source = DEFAULT_RANDOM_SORT_SEED_FILE;
67 static const void *random_seed;
68 static size_t random_seed_size;
73 * Default messages to use when NLS is disabled or no catalogue
76 const char *nlsstr[] = { "",
77 /* 1*/"mutually exclusive flags",
78 /* 2*/"extra argument not allowed with -c",
79 /* 3*/"Unknown feature",
80 /* 4*/"Wrong memory buffer specification",
81 /* 5*/"0 field in key specs",
82 /* 6*/"0 column in key specs",
83 /* 7*/"Wrong file mode",
84 /* 8*/"Cannot open file for reading",
85 /* 9*/"Radix sort cannot be used with these sort options",
86 /*10*/"The chosen sort method cannot be used with stable and/or unique sort",
87 /*11*/"Invalid key position",
88 /*12*/"Usage: %s [-bcCdfigMmnrsuz] [-kPOS1[,POS2] ... ] "
89 "[+POS1 [-POS2]] [-S memsize] [-T tmpdir] [-t separator] "
90 "[-o outfile] [--batch-size size] [--files0-from file] "
91 "[--heapsort] [--mergesort] [--radixsort] [--qsort] "
93 #if defined(SORT_THREADS)
94 "[--parallel thread_no] "
96 "[--human-numeric-sort] "
97 "[--version-sort] [--random-sort [--random-source file]] "
98 "[--compress-program program] [file ...]\n" };
100 struct sort_opts sort_opts_vals;
105 #if defined(SORT_THREADS)
106 unsigned int ncpu = 1;
110 static bool gnusort_numeric_compatibility;
112 static struct sort_mods default_sort_mods_object;
113 struct sort_mods * const default_sort_mods = &default_sort_mods_object;
115 static bool print_symbols_on_debug;
118 * Arguments from file (when file0-from option is used:
120 static size_t argc_from_file0 = (size_t)-1;
121 static char **argv_from_file0;
124 * Placeholder symbols for options which have no single-character equivalent
128 SORT_OPT = CHAR_MAX + 1,
134 #if defined(SORT_THREADS)
146 #define NUMBER_OF_MUTUALLY_EXCLUSIVE_FLAGS 6
147 static const char mutually_exclusive_flags[NUMBER_OF_MUTUALLY_EXCLUSIVE_FLAGS] = { 'M', 'n', 'g', 'R', 'h', 'V' };
149 static struct option long_options[] = {
150 { "batch-size", required_argument, NULL, BS_OPT },
151 { "buffer-size", required_argument, NULL, 'S' },
152 { "check", optional_argument, NULL, 'c' },
153 { "check=silent|quiet", optional_argument, NULL, 'C' },
154 { "compress-program", required_argument, NULL, COMPRESSPROGRAM_OPT },
155 { "debug", no_argument, NULL, DEBUG_OPT },
156 { "dictionary-order", no_argument, NULL, 'd' },
157 { "field-separator", required_argument, NULL, 't' },
158 { "files0-from", required_argument, NULL, FF_OPT },
159 { "general-numeric-sort", no_argument, NULL, 'g' },
160 { "heapsort", no_argument, NULL, HEAPSORT_OPT },
161 { "help",no_argument, NULL, HELP_OPT },
162 { "human-numeric-sort", no_argument, NULL, 'h' },
163 { "ignore-leading-blanks", no_argument, NULL, 'b' },
164 { "ignore-case", no_argument, NULL, 'f' },
165 { "ignore-nonprinting", no_argument, NULL, 'i' },
166 { "key", required_argument, NULL, 'k' },
167 { "merge", no_argument, NULL, 'm' },
168 { "mergesort", no_argument, NULL, MERGESORT_OPT },
169 { "mmap", no_argument, NULL, MMAP_OPT },
170 { "month-sort", no_argument, NULL, 'M' },
171 { "numeric-sort", no_argument, NULL, 'n' },
172 { "output", required_argument, NULL, 'o' },
173 #if defined(SORT_THREADS)
174 { "parallel", required_argument, NULL, PARALLEL_OPT },
176 { "qsort", no_argument, NULL, QSORT_OPT },
177 { "radixsort", no_argument, NULL, RADIXSORT_OPT },
178 { "random-sort", no_argument, NULL, 'R' },
179 { "random-source", required_argument, NULL, RANDOMSOURCE_OPT },
180 { "reverse", no_argument, NULL, 'r' },
181 { "sort", required_argument, NULL, SORT_OPT },
182 { "stable", no_argument, NULL, 's' },
183 { "temporary-directory",required_argument, NULL, 'T' },
184 { "unique", no_argument, NULL, 'u' },
185 { "version", no_argument, NULL, VERSION_OPT },
186 { "version-sort",no_argument, NULL, 'V' },
187 { "zero-terminated", no_argument, NULL, 'z' },
188 { NULL, no_argument, NULL, 0 }
191 void fix_obsolete_keys(int *argc, char **argv);
194 * Check where sort modifier is present
197 sort_modifier_empty(struct sort_mods *sm)
202 return (!(sm->Mflag || sm->Vflag || sm->nflag || sm->gflag ||
203 sm->rflag || sm->Rflag || sm->hflag || sm->dflag || sm->fflag));
207 * Print out usage text.
214 out = opt_err ? stderr : stdout;
216 fprintf(out, getstr(12), getprogname());
223 * Read input file names from a file (file0-from option).
226 read_fns_from_file0(const char *fn)
240 while ((linelen = getdelim(&line, &linesize, '\0', f)) != -1) {
242 if (argc_from_file0 == (size_t) - 1)
245 argv_from_file0 = sort_realloc(argv_from_file0,
246 argc_from_file0 * sizeof(char *));
247 if (argv_from_file0 == NULL)
249 argv_from_file0[argc_from_file0 - 1] = line;
257 err(2, "%s: getdelim", fn);
263 * Check how much RAM is available for the sort.
270 #if defined(SORT_THREADS)
274 pages = sysconf(_SC_PHYS_PAGES);
276 perror("sysconf pages");
279 psize = sysconf(_SC_PAGESIZE);
281 perror("sysconf psize");
284 #if defined(SORT_THREADS)
285 ncpu = (unsigned int)sysconf(_SC_NPROCESSORS_ONLN);
294 free_memory = (unsigned long long) pages * (unsigned long long) psize;
295 available_free_memory = free_memory / 2;
297 if (available_free_memory < 1024)
298 available_free_memory = 1024;
302 * Convert "plain" symbol to wide symbol, with default value.
305 conv_mbtowc(wchar_t *wc, const char *c, const wchar_t def)
311 res = mbtowc(wc, c, MB_CUR_MAX);
318 * Set current locale symbols.
326 setlocale(LC_ALL, "");
331 /* obtain LC_NUMERIC info */
332 /* Convert to wide char form */
333 conv_mbtowc(&symbol_decimal_point, lc->decimal_point,
334 symbol_decimal_point);
335 conv_mbtowc(&symbol_thousands_sep, lc->thousands_sep,
336 symbol_thousands_sep);
337 conv_mbtowc(&symbol_positive_sign, lc->positive_sign,
338 symbol_positive_sign);
339 conv_mbtowc(&symbol_negative_sign, lc->negative_sign,
340 symbol_negative_sign);
343 if (getenv("GNUSORT_NUMERIC_COMPATIBILITY"))
344 gnusort_numeric_compatibility = true;
346 locale = setlocale(LC_COLLATE, NULL);
350 const char *cclocale;
352 tmpl = sort_strdup(locale);
353 cclocale = setlocale(LC_COLLATE, "C");
354 if (cclocale && !strcmp(cclocale, tmpl))
357 const char *pclocale;
359 pclocale = setlocale(LC_COLLATE, "POSIX");
360 if (pclocale && !strcmp(pclocale, tmpl))
363 setlocale(LC_COLLATE, tmpl);
369 * Set directory temporary files.
376 td = getenv("TMPDIR");
378 tmpdir = sort_strdup(td);
384 static unsigned long long
385 parse_memory_buffer_value(const char *value)
389 return (available_free_memory);
392 unsigned long long membuf;
396 membuf = strtoll(value, &endptr, 10);
399 warn("%s",getstr(4));
400 membuf = available_free_memory;
431 membuf = (available_free_memory * membuf) /
435 warnc(EINVAL, "%s", optarg);
436 membuf = available_free_memory;
444 * Signal handler that clears the temporary files.
447 sig_handler(int sig __unused, siginfo_t *siginfo __unused,
448 void *context __unused)
456 * Set signal handler on panic signals.
459 set_signal_handler(void)
463 memset(&sa, 0, sizeof(sa));
464 sa.sa_sigaction = &sig_handler;
465 sa.sa_flags = SA_SIGINFO;
467 if (sigaction(SIGTERM, &sa, NULL) < 0) {
471 if (sigaction(SIGHUP, &sa, NULL) < 0) {
475 if (sigaction(SIGINT, &sa, NULL) < 0) {
479 if (sigaction(SIGQUIT, &sa, NULL) < 0) {
483 if (sigaction(SIGABRT, &sa, NULL) < 0) {
487 if (sigaction(SIGBUS, &sa, NULL) < 0) {
491 if (sigaction(SIGSEGV, &sa, NULL) < 0) {
495 if (sigaction(SIGUSR1, &sa, NULL) < 0) {
499 if (sigaction(SIGUSR2, &sa, NULL) < 0) {
506 * Print "unknown" message and exit with status 2.
509 unknown(const char *what)
512 errx(2, "%s: %s", getstr(3), what);
516 * Check whether contradictory input options are used.
519 check_mutually_exclusive_flags(char c, bool *mef_flags)
522 bool found_others, found_this;
524 found_others = found_this =false;
527 for (int i = 0; i < NUMBER_OF_MUTUALLY_EXCLUSIVE_FLAGS; i++) {
528 mec = mutually_exclusive_flags[i];
533 errx(1, "%c:%c: %s", c, mec, getstr(1));
539 errx(1, "%c:%c: %s", c, mutually_exclusive_flags[fo_index], getstr(1));
547 * Initialise sort opts data.
553 memset(&default_sort_mods_object, 0,
554 sizeof(default_sort_mods_object));
555 memset(&sort_opts_vals, 0, sizeof(sort_opts_vals));
556 default_sort_mods_object.func =
557 get_sort_func(&default_sort_mods_object);
561 * Set a sort modifier on a sort modifiers object.
564 set_sort_modifier(struct sort_mods *sm, int c)
597 print_symbols_on_debug = true;
608 print_symbols_on_debug = true;
613 sort_opts_vals.complex_sort = true;
614 sm->func = get_sort_func(sm);
620 * Parse POS in -k option.
623 parse_pos(const char *s, struct key_specs *ks, bool *mef_flags, bool second)
625 regmatch_t pmatch[4];
628 const char *sregexp = "^([0-9]+)(\\.[0-9]+)?([bdfirMngRhV]+)?$";
636 if (regcomp(&re, sregexp, REG_EXTENDED) != 0)
639 if (regexec(&re, s, nmatch, pmatch, 0) != 0)
642 if (pmatch[0].rm_eo <= pmatch[0].rm_so)
645 if (pmatch[1].rm_eo <= pmatch[1].rm_so)
648 len = pmatch[1].rm_eo - pmatch[1].rm_so;
649 f = sort_malloc((len + 1) * sizeof(char));
651 strncpy(f, s + pmatch[1].rm_so, len);
656 ks->f2 = (size_t) strtoul(f, NULL, 10);
660 warn("%s",getstr(5));
665 ks->f1 = (size_t) strtoul(f, NULL, 10);
669 warn("%s",getstr(5));
674 if (pmatch[2].rm_eo > pmatch[2].rm_so) {
675 len = pmatch[2].rm_eo - pmatch[2].rm_so - 1;
676 c = sort_malloc((len + 1) * sizeof(char));
678 strncpy(c, s + pmatch[2].rm_so + 1, len);
683 ks->c2 = (size_t) strtoul(c, NULL, 10);
688 ks->c1 = (size_t) strtoul(c, NULL, 10);
692 warn("%s",getstr(6));
703 if (pmatch[3].rm_eo > pmatch[3].rm_so) {
706 for (i = pmatch[3].rm_so; i < pmatch[3].rm_eo; i++) {
707 check_mutually_exclusive_flags(s[i], mef_flags);
713 } else if (!set_sort_modifier(&(ks->sm), s[i]))
732 * Parse -k option value.
735 parse_k(const char *s, struct key_specs *ks)
738 bool mef_flags[NUMBER_OF_MUTUALLY_EXCLUSIVE_FLAGS] =
739 { false, false, false, false, false, false };
744 sptr = strchr(s, ',');
753 pos1 = sort_malloc((size1 + 1) * sizeof(char));
755 strncpy(pos1, s, size1);
758 ret = parse_pos(pos1, ks, mef_flags, false);
764 pos2 = sort_strdup(sptr + 1);
765 ret = parse_pos(pos2, ks, mef_flags, true);
768 ret = parse_pos(s, ks, mef_flags, false);
775 * Parse POS in +POS -POS option.
778 parse_pos_obs(const char *s, int *nf, int *nc, char* sopts)
781 regmatch_t pmatch[4];
783 const char *sregexp = "^([0-9]+)(\\.[0-9]+)?([A-Za-z]+)?$";
792 if (regcomp(&re, sregexp, REG_EXTENDED) != 0)
795 if (regexec(&re, s, nmatch, pmatch, 0) != 0)
798 if (pmatch[0].rm_eo <= pmatch[0].rm_so)
801 if (pmatch[1].rm_eo <= pmatch[1].rm_so)
804 len = pmatch[1].rm_eo - pmatch[1].rm_so;
805 f = sort_malloc((len + 1) * sizeof(char));
807 strncpy(f, s + pmatch[1].rm_so, len);
811 *nf = (size_t) strtoul(f, NULL, 10);
813 errx(2, "%s", getstr(11));
815 if (pmatch[2].rm_eo > pmatch[2].rm_so) {
816 len = pmatch[2].rm_eo - pmatch[2].rm_so - 1;
817 c = sort_malloc((len + 1) * sizeof(char));
819 strncpy(c, s + pmatch[2].rm_so + 1, len);
823 *nc = (size_t) strtoul(c, NULL, 10);
825 errx(2, "%s", getstr(11));
828 if (pmatch[3].rm_eo > pmatch[3].rm_so) {
830 len = pmatch[3].rm_eo - pmatch[3].rm_so;
832 strncpy(sopts, s + pmatch[3].rm_so, len);
849 * "Translate" obsolete +POS1 -POS2 syntax into new -kPOS1,POS2 syntax
852 fix_obsolete_keys(int *argc, char **argv)
856 for (int i = 1; i < *argc; i++) {
861 if (strlen(arg1) > 1 && arg1[0] == '+') {
868 if (parse_pos_obs(arg1 + 1, &f1, &c1, sopts1) < 0)
874 char *arg2 = argv[i + 1];
876 if (strlen(arg2) > 1 &&
884 if (parse_pos_obs(arg2 + 1,
885 &f2, &c2, sopts2) >= 0) {
888 sprintf(sopt, "-k%d.%d%s,%d.%d%s",
889 f1, c1, sopts1, f2, c2, sopts2);
890 argv[i] = sort_strdup(sopt);
891 for (int j = i + 1; j + 1 < *argc; j++)
892 argv[j] = argv[j + 1];
898 sprintf(sopt, "-k%d.%d%s", f1, c1, sopts1);
899 argv[i] = sort_strdup(sopt);
909 set_random_seed(void)
913 if (strcmp(random_source, DEFAULT_RANDOM_SORT_SEED_FILE) == 0) {
916 char rsd[MAX_DEFAULT_RANDOM_SEED_DATA_SIZE];
919 fseed = openfile(random_source, "r");
920 while (!feof(fseed)) {
927 rsd[sz++] = (char) cr;
929 if (sz >= MAX_DEFAULT_RANDOM_SEED_DATA_SIZE)
933 closefile(fseed, random_source);
936 MD5Update(&ctx, rsd, sz);
938 random_seed = MD5End(&ctx, NULL);
939 random_seed_size = strlen(random_seed);
946 b = MD5File(random_source, NULL);
951 random_seed_size = strlen(b);
955 if(random_seed_size>0) {
956 MD5Update(&md5_ctx, random_seed, random_seed_size);
965 main(int argc, char **argv)
967 char *outfile, *real_outfile;
969 bool mef_flags[NUMBER_OF_MUTUALLY_EXCLUSIVE_FLAGS] =
970 { false, false, false, false, false, false };
973 outfile = sort_strdup("-");
976 struct sort_mods *sm = &default_sort_mods_object;
980 set_signal_handler();
987 fix_obsolete_keys(&argc, argv);
989 while (((c = getopt_long(argc, argv, OPTIONS, long_options, NULL))
992 check_mutually_exclusive_flags(c, mef_flags);
994 if (!set_sort_modifier(sm, c)) {
998 sort_opts_vals.cflag = true;
1000 if (!strcmp(optarg, "diagnose-first"))
1002 else if (!strcmp(optarg, "silent") ||
1003 !strcmp(optarg, "quiet"))
1004 sort_opts_vals.csilentflag = true;
1010 sort_opts_vals.cflag = true;
1011 sort_opts_vals.csilentflag = true;
1015 sort_opts_vals.complex_sort = true;
1016 sort_opts_vals.kflag = true;
1019 keys = sort_realloc(keys, keys_num *
1020 sizeof(struct key_specs));
1021 memset(&(keys[keys_num - 1]), 0,
1022 sizeof(struct key_specs));
1024 if (parse_k(optarg, &(keys[keys_num - 1]))
1026 errc(2, EINVAL, "-k %s", optarg);
1032 sort_opts_vals.mflag = true;
1035 outfile = sort_realloc(outfile, (strlen(optarg) + 1));
1036 strcpy(outfile, optarg);
1039 sort_opts_vals.sflag = true;
1042 available_free_memory =
1043 parse_memory_buffer_value(optarg);
1046 tmpdir = sort_strdup(optarg);
1049 while (strlen(optarg) > 1) {
1050 if (optarg[0] != '\\') {
1051 errc(2, EINVAL, "%s", optarg);
1054 if (*optarg == '0') {
1059 sort_opts_vals.tflag = true;
1060 sort_opts_vals.field_sep = btowc(optarg[0]);
1061 if (sort_opts_vals.field_sep == WEOF) {
1065 if (!gnusort_numeric_compatibility) {
1066 if (symbol_decimal_point == sort_opts_vals.field_sep)
1067 symbol_decimal_point = WEOF;
1068 if (symbol_thousands_sep == sort_opts_vals.field_sep)
1069 symbol_thousands_sep = WEOF;
1070 if (symbol_negative_sign == sort_opts_vals.field_sep)
1071 symbol_negative_sign = WEOF;
1072 if (symbol_positive_sign == sort_opts_vals.field_sep)
1073 symbol_positive_sign = WEOF;
1077 sort_opts_vals.uflag = true;
1078 /* stable sort for the correct unique val */
1079 sort_opts_vals.sflag = true;
1082 sort_opts_vals.zflag = true;
1086 if (!strcmp(optarg, "general-numeric"))
1087 set_sort_modifier(sm, 'g');
1088 else if (!strcmp(optarg, "human-numeric"))
1089 set_sort_modifier(sm, 'h');
1090 else if (!strcmp(optarg, "numeric"))
1091 set_sort_modifier(sm, 'n');
1092 else if (!strcmp(optarg, "month"))
1093 set_sort_modifier(sm, 'M');
1094 else if (!strcmp(optarg, "random"))
1095 set_sort_modifier(sm, 'R');
1100 #if defined(SORT_THREADS)
1102 nthreads = (size_t)(atoi(optarg));
1105 if (nthreads > 1024)
1110 sort_opts_vals.sort_method = SORT_QSORT;
1113 sort_opts_vals.sort_method = SORT_MERGESORT;
1119 sort_opts_vals.sort_method = SORT_HEAPSORT;
1122 sort_opts_vals.sort_method = SORT_RADIXSORT;
1124 case RANDOMSOURCE_OPT:
1125 random_source = strdup(optarg);
1127 case COMPRESSPROGRAM_OPT:
1128 compress_program = strdup(optarg);
1131 read_fns_from_file0(optarg);
1136 long mof = strtol(optarg, NULL, 10);
1138 err(2, "--batch-size");
1140 max_open_files = (size_t) mof + 1;
1144 printf("%s\n", VERSION);
1166 catalog = catopen("sort", NL_CAT_LOCALE);
1169 if (sort_opts_vals.cflag && sort_opts_vals.mflag)
1170 errx(1, "%c:%c: %s", 'm', 'c', getstr(1));
1176 if (keys_num == 0) {
1178 keys = sort_realloc(keys, sizeof(struct key_specs));
1179 memset(&(keys[0]), 0, sizeof(struct key_specs));
1181 keys[0].pos1b = default_sort_mods->bflag;
1182 keys[0].pos2b = default_sort_mods->bflag;
1183 memcpy(&(keys[0].sm), default_sort_mods,
1184 sizeof(struct sort_mods));
1187 for (size_t i = 0; i < keys_num; i++) {
1188 struct key_specs *ks;
1192 if (sort_modifier_empty(&(ks->sm)) && !(ks->pos1b) &&
1194 ks->pos1b = sm->bflag;
1195 ks->pos2b = sm->bflag;
1196 memcpy(&(ks->sm), sm, sizeof(struct sort_mods));
1199 ks->sm.func = get_sort_func(&(ks->sm));
1202 if (argv_from_file0) {
1203 argc = argc_from_file0;
1204 argv = argv_from_file0;
1208 printf("Memory to be used for sorting: %llu\n",available_free_memory);
1209 #if defined(SORT_THREADS)
1210 printf("Number of CPUs: %d\n",(int)ncpu);
1213 printf("Using collate rules of %s locale\n",
1214 setlocale(LC_COLLATE, NULL));
1216 printf("Byte sort is used\n");
1217 if (print_symbols_on_debug) {
1218 printf("Decimal Point: <%lc>\n", symbol_decimal_point);
1219 if (symbol_thousands_sep)
1220 printf("Thousands separator: <%lc>\n",
1221 symbol_thousands_sep);
1222 printf("Positive sign: <%lc>\n", symbol_positive_sign);
1223 printf("Negative sign: <%lc>\n", symbol_negative_sign);
1229 /* Case when the outfile equals one of the input files: */
1230 if (strcmp(outfile, "-")) {
1232 for(int i = 0; i < argc; ++i) {
1233 if (strcmp(argv[i], outfile) == 0) {
1234 real_outfile = sort_strdup(outfile);
1236 char* tmp = sort_malloc(strlen(outfile) +
1237 strlen(".tmp") + 1);
1239 strcpy(tmp, outfile);
1240 strcpy(tmp + strlen(tmp), ".tmp");
1243 if (access(outfile, F_OK) < 0)
1246 tmp_file_atexit(outfile);
1251 #if defined(SORT_THREADS)
1252 if ((argc < 1) || (strcmp(outfile, "-") == 0) || (*outfile == 0))
1256 if (!sort_opts_vals.cflag && !sort_opts_vals.mflag) {
1257 struct file_list fl;
1258 struct sort_list list;
1260 sort_list_init(&list);
1261 file_list_init(&fl, true);
1264 procfile("-", &list, &fl);
1267 procfile(*argv, &list, &fl);
1274 sort_list_to_file(&list, outfile);
1276 if (list.count > 0) {
1277 char *flast = new_tmp_file_name();
1279 sort_list_to_file(&list, flast);
1280 file_list_add(&fl, flast, false);
1282 merge_files(&fl, outfile);
1285 file_list_clean(&fl);
1288 * We are about to exit the program, so we can ignore
1289 * the clean-up for speed
1291 * sort_list_clean(&list);
1294 } else if (sort_opts_vals.cflag) {
1295 result = (argc == 0) ? (check("-")) : (check(*argv));
1296 } else if (sort_opts_vals.mflag) {
1297 struct file_list fl;
1299 file_list_init(&fl, false);
1300 file_list_populate(&fl, argc, argv, true);
1301 merge_files(&fl, outfile);
1302 file_list_clean(&fl);
1306 unlink(real_outfile);
1307 if (rename(outfile, real_outfile) < 0)
1309 sort_free(real_outfile);