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
27 * $FreeBSD: head/usr.bin/sort/sort.c 281182 2015-04-07 01:17:49Z pfg $
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.
216 // o = &(long_options[0]);
220 fprintf(out
, getstr(12), getprogname());
227 * Read input file names from a file (file0-from option).
230 read_fns_from_file0(const char *fn
)
244 while ((linelen
= getdelim(&line
, &linesize
, '\0', f
)) != -1) {
246 if (argc_from_file0
== (size_t) - 1)
249 argv_from_file0
= sort_realloc(argv_from_file0
,
250 argc_from_file0
* sizeof(char *));
251 if (argv_from_file0
== NULL
)
253 argv_from_file0
[argc_from_file0
- 1] = line
;
261 err(2, "%s: getdelim", fn
);
267 * Check how much RAM is available for the sort.
276 #if defined(SORT_THREADS)
280 pages
= sysconf(_SC_PHYS_PAGES
);
282 perror("sysconf pages");
285 psize
= sysconf(_SC_PAGESIZE
);
287 perror("sysconf psize");
290 #if defined(SORT_THREADS)
291 ncpu
= (unsigned int)sysconf(_SC_NPROCESSORS_ONLN
);
300 free_memory
= (unsigned long long) pages
* (unsigned long long) psize
;
301 available_free_memory
= free_memory
/ 2;
303 if (available_free_memory
< 1024)
304 available_free_memory
= 1024;
308 * Convert "plain" symbol to wide symbol, with default value.
311 conv_mbtowc(wchar_t *wc
, const char *c
, const wchar_t def
)
317 res
= mbtowc(wc
, c
, MB_CUR_MAX
);
324 * Set current locale symbols.
332 setlocale(LC_ALL
, "");
337 /* obtain LC_NUMERIC info */
338 /* Convert to wide char form */
339 conv_mbtowc(&symbol_decimal_point
, lc
->decimal_point
,
340 symbol_decimal_point
);
341 conv_mbtowc(&symbol_thousands_sep
, lc
->thousands_sep
,
342 symbol_thousands_sep
);
343 conv_mbtowc(&symbol_positive_sign
, lc
->positive_sign
,
344 symbol_positive_sign
);
345 conv_mbtowc(&symbol_negative_sign
, lc
->negative_sign
,
346 symbol_negative_sign
);
349 if (getenv("GNUSORT_NUMERIC_COMPATIBILITY"))
350 gnusort_numeric_compatibility
= true;
352 locale
= setlocale(LC_COLLATE
, NULL
);
356 const char *cclocale
;
358 tmpl
= sort_strdup(locale
);
359 cclocale
= setlocale(LC_COLLATE
, "C");
360 if (cclocale
&& !strcmp(cclocale
, tmpl
))
363 const char *pclocale
;
365 pclocale
= setlocale(LC_COLLATE
, "POSIX");
366 if (pclocale
&& !strcmp(pclocale
, tmpl
))
369 setlocale(LC_COLLATE
, tmpl
);
375 * Set directory temporary files.
382 td
= getenv("TMPDIR");
384 tmpdir
= sort_strdup(td
);
390 static unsigned long long
391 parse_memory_buffer_value(const char *value
)
395 return (available_free_memory
);
398 unsigned long long membuf
;
402 membuf
= strtoll(value
, &endptr
, 10);
405 warn("%s",getstr(4));
406 membuf
= available_free_memory
;
437 membuf
= (available_free_memory
* membuf
) /
441 warnc(EINVAL
, "%s", optarg
);
442 membuf
= available_free_memory
;
450 * Signal handler that clears the temporary files.
453 sig_handler(int sig __unused
, siginfo_t
*siginfo __unused
,
454 void *context __unused
)
462 * Set signal handler on panic signals.
465 set_signal_handler(void)
469 memset(&sa
, 0, sizeof(sa
));
470 sa
.sa_sigaction
= &sig_handler
;
471 sa
.sa_flags
= SA_SIGINFO
;
473 if (sigaction(SIGTERM
, &sa
, NULL
) < 0) {
477 if (sigaction(SIGHUP
, &sa
, NULL
) < 0) {
481 if (sigaction(SIGINT
, &sa
, NULL
) < 0) {
485 if (sigaction(SIGQUIT
, &sa
, NULL
) < 0) {
489 if (sigaction(SIGABRT
, &sa
, NULL
) < 0) {
493 if (sigaction(SIGBUS
, &sa
, NULL
) < 0) {
497 if (sigaction(SIGSEGV
, &sa
, NULL
) < 0) {
501 if (sigaction(SIGUSR1
, &sa
, NULL
) < 0) {
505 if (sigaction(SIGUSR2
, &sa
, NULL
) < 0) {
512 * Print "unknown" message and exit with status 2.
515 unknown(const char *what
)
518 errx(2, "%s: %s", getstr(3), what
);
522 * Check whether contradictory input options are used.
525 check_mutually_exclusive_flags(char c
, bool *mef_flags
)
528 bool found_others
, found_this
;
530 found_others
= found_this
= false;
533 for (int i
= 0; i
< NUMBER_OF_MUTUALLY_EXCLUSIVE_FLAGS
; i
++) {
534 mec
= mutually_exclusive_flags
[i
];
539 errx(1, "%c:%c: %s", c
, mec
, getstr(1));
545 errx(1, "%c:%c: %s", c
, mutually_exclusive_flags
[fo_index
], getstr(1));
553 * Initialise sort opts data.
559 memset(&default_sort_mods_object
, 0,
560 sizeof(default_sort_mods_object
));
561 memset(&sort_opts_vals
, 0, sizeof(sort_opts_vals
));
562 default_sort_mods_object
.func
=
563 get_sort_func(&default_sort_mods_object
);
567 * Set a sort modifier on a sort modifiers object.
570 set_sort_modifier(struct sort_mods
*sm
, int c
)
603 print_symbols_on_debug
= true;
614 print_symbols_on_debug
= true;
619 sort_opts_vals
.complex_sort
= true;
620 sm
->func
= get_sort_func(sm
);
626 * Parse POS in -k option.
629 parse_pos(const char *s
, struct key_specs
*ks
, bool *mef_flags
, bool second
)
631 regmatch_t pmatch
[4];
634 const char *sregexp
= "^([0-9]+)(\\.[0-9]+)?([bdfirMngRhV]+)?$";
642 if (regcomp(&re
, sregexp
, REG_EXTENDED
) != 0)
645 if (regexec(&re
, s
, nmatch
, pmatch
, 0) != 0)
648 if (pmatch
[0].rm_eo
<= pmatch
[0].rm_so
)
651 if (pmatch
[1].rm_eo
<= pmatch
[1].rm_so
)
654 len
= pmatch
[1].rm_eo
- pmatch
[1].rm_so
;
655 f
= sort_malloc((len
+ 1) * sizeof(char));
657 strncpy(f
, s
+ pmatch
[1].rm_so
, len
);
662 ks
->f2
= (size_t) strtoul(f
, NULL
, 10);
666 warn("%s",getstr(5));
671 ks
->f1
= (size_t) strtoul(f
, NULL
, 10);
675 warn("%s",getstr(5));
680 if (pmatch
[2].rm_eo
> pmatch
[2].rm_so
) {
681 len
= pmatch
[2].rm_eo
- pmatch
[2].rm_so
- 1;
682 c
= sort_malloc((len
+ 1) * sizeof(char));
684 strncpy(c
, s
+ pmatch
[2].rm_so
+ 1, len
);
689 ks
->c2
= (size_t) strtoul(c
, NULL
, 10);
694 ks
->c1
= (size_t) strtoul(c
, NULL
, 10);
698 warn("%s",getstr(6));
709 if (pmatch
[3].rm_eo
> pmatch
[3].rm_so
) {
712 for (i
= pmatch
[3].rm_so
; i
< pmatch
[3].rm_eo
; i
++) {
713 check_mutually_exclusive_flags(s
[i
], mef_flags
);
719 } else if (!set_sort_modifier(&(ks
->sm
), s
[i
]))
738 * Parse -k option value.
741 parse_k(const char *s
, struct key_specs
*ks
)
744 bool mef_flags
[NUMBER_OF_MUTUALLY_EXCLUSIVE_FLAGS
] =
745 { false, false, false, false, false, false };
750 sptr
= strchr(s
, ',');
759 pos1
= sort_malloc((size1
+ 1) * sizeof(char));
761 strncpy(pos1
, s
, size1
);
764 ret
= parse_pos(pos1
, ks
, mef_flags
, false);
770 pos2
= sort_strdup(sptr
+ 1);
771 ret
= parse_pos(pos2
, ks
, mef_flags
, true);
774 ret
= parse_pos(s
, ks
, mef_flags
, false);
781 * Parse POS in +POS -POS option.
784 parse_pos_obs(const char *s
, int *nf
, int *nc
, char* sopts
)
787 regmatch_t pmatch
[4];
789 const char *sregexp
= "^([0-9]+)(\\.[0-9]+)?([A-Za-z]+)?$";
798 if (regcomp(&re
, sregexp
, REG_EXTENDED
) != 0)
801 if (regexec(&re
, s
, nmatch
, pmatch
, 0) != 0)
804 if (pmatch
[0].rm_eo
<= pmatch
[0].rm_so
)
807 if (pmatch
[1].rm_eo
<= pmatch
[1].rm_so
)
810 len
= pmatch
[1].rm_eo
- pmatch
[1].rm_so
;
811 f
= sort_malloc((len
+ 1) * sizeof(char));
813 strncpy(f
, s
+ pmatch
[1].rm_so
, len
);
817 *nf
= (size_t) strtoul(f
, NULL
, 10);
819 errx(2, "%s", getstr(11));
821 if (pmatch
[2].rm_eo
> pmatch
[2].rm_so
) {
822 len
= pmatch
[2].rm_eo
- pmatch
[2].rm_so
- 1;
823 c
= sort_malloc((len
+ 1) * sizeof(char));
825 strncpy(c
, s
+ pmatch
[2].rm_so
+ 1, len
);
829 *nc
= (size_t) strtoul(c
, NULL
, 10);
831 errx(2, "%s", getstr(11));
834 if (pmatch
[3].rm_eo
> pmatch
[3].rm_so
) {
836 len
= pmatch
[3].rm_eo
- pmatch
[3].rm_so
;
838 strncpy(sopts
, s
+ pmatch
[3].rm_so
, len
);
855 * "Translate" obsolete +POS1 -POS2 syntax into new -kPOS1,POS2 syntax
858 fix_obsolete_keys(int *argc
, char **argv
)
862 for (int i
= 1; i
< *argc
; i
++) {
867 if (strlen(arg1
) > 1 && arg1
[0] == '+') {
874 if (parse_pos_obs(arg1
+ 1, &f1
, &c1
, sopts1
) < 0)
880 char *arg2
= argv
[i
+ 1];
882 if (strlen(arg2
) > 1 &&
890 if (parse_pos_obs(arg2
+ 1,
891 &f2
, &c2
, sopts2
) >= 0) {
894 sprintf(sopt
, "-k%d.%d%s,%d.%d%s",
895 f1
, c1
, sopts1
, f2
, c2
, sopts2
);
896 argv
[i
] = sort_strdup(sopt
);
897 for (int j
= i
+ 1; j
+ 1 < *argc
; j
++)
898 argv
[j
] = argv
[j
+ 1];
904 sprintf(sopt
, "-k%d.%d%s", f1
, c1
, sopts1
);
905 argv
[i
] = sort_strdup(sopt
);
915 set_random_seed(void)
919 if (strcmp(random_source
, DEFAULT_RANDOM_SORT_SEED_FILE
) == 0) {
922 char rsd
[MAX_DEFAULT_RANDOM_SEED_DATA_SIZE
];
925 fseed
= openfile(random_source
, "r");
926 while (!feof(fseed
)) {
933 rsd
[sz
++] = (char) cr
;
935 if (sz
>= MAX_DEFAULT_RANDOM_SEED_DATA_SIZE
)
939 closefile(fseed
, random_source
);
942 MD5Update(&ctx
, rsd
, sz
);
944 random_seed
= MD5End(&ctx
, NULL
);
945 random_seed_size
= strlen(random_seed
);
952 b
= MD5File(random_source
, NULL
);
957 random_seed_size
= strlen(b
);
961 if(random_seed_size
>0) {
962 MD5Update(&md5_ctx
, random_seed
, random_seed_size
);
971 main(int argc
, char **argv
)
973 char *outfile
, *real_outfile
;
975 bool mef_flags
[NUMBER_OF_MUTUALLY_EXCLUSIVE_FLAGS
] =
976 { false, false, false, false, false, false };
979 outfile
= sort_strdup("-");
982 struct sort_mods
*sm
= &default_sort_mods_object
;
986 set_signal_handler();
993 fix_obsolete_keys(&argc
, argv
);
995 while (((c
= getopt_long(argc
, argv
, OPTIONS
, long_options
, NULL
))
998 check_mutually_exclusive_flags(c
, mef_flags
);
1000 if (!set_sort_modifier(sm
, c
)) {
1004 sort_opts_vals
.cflag
= true;
1006 if (!strcmp(optarg
, "diagnose-first"))
1008 else if (!strcmp(optarg
, "silent") ||
1009 !strcmp(optarg
, "quiet"))
1010 sort_opts_vals
.csilentflag
= true;
1016 sort_opts_vals
.cflag
= true;
1017 sort_opts_vals
.csilentflag
= true;
1021 sort_opts_vals
.complex_sort
= true;
1022 sort_opts_vals
.kflag
= true;
1025 keys
= sort_realloc(keys
, keys_num
*
1026 sizeof(struct key_specs
));
1027 memset(&(keys
[keys_num
- 1]), 0,
1028 sizeof(struct key_specs
));
1030 if (parse_k(optarg
, &(keys
[keys_num
- 1]))
1032 errc(2, EINVAL
, "-k %s", optarg
);
1038 sort_opts_vals
.mflag
= true;
1041 outfile
= sort_realloc(outfile
, (strlen(optarg
) + 1));
1042 strcpy(outfile
, optarg
);
1045 sort_opts_vals
.sflag
= true;
1048 available_free_memory
=
1049 parse_memory_buffer_value(optarg
);
1052 tmpdir
= sort_strdup(optarg
);
1055 while (strlen(optarg
) > 1) {
1056 if (optarg
[0] != '\\') {
1057 errc(2, EINVAL
, "%s", optarg
);
1060 if (*optarg
== '0') {
1065 sort_opts_vals
.tflag
= true;
1066 sort_opts_vals
.field_sep
= btowc(optarg
[0]);
1067 if (sort_opts_vals
.field_sep
== WEOF
) {
1071 if (!gnusort_numeric_compatibility
) {
1072 if (symbol_decimal_point
== sort_opts_vals
.field_sep
)
1073 symbol_decimal_point
= WEOF
;
1074 if (symbol_thousands_sep
== sort_opts_vals
.field_sep
)
1075 symbol_thousands_sep
= WEOF
;
1076 if (symbol_negative_sign
== sort_opts_vals
.field_sep
)
1077 symbol_negative_sign
= WEOF
;
1078 if (symbol_positive_sign
== sort_opts_vals
.field_sep
)
1079 symbol_positive_sign
= WEOF
;
1083 sort_opts_vals
.uflag
= true;
1084 /* stable sort for the correct unique val */
1085 sort_opts_vals
.sflag
= true;
1088 sort_opts_vals
.zflag
= true;
1092 if (!strcmp(optarg
, "general-numeric"))
1093 set_sort_modifier(sm
, 'g');
1094 else if (!strcmp(optarg
, "human-numeric"))
1095 set_sort_modifier(sm
, 'h');
1096 else if (!strcmp(optarg
, "numeric"))
1097 set_sort_modifier(sm
, 'n');
1098 else if (!strcmp(optarg
, "month"))
1099 set_sort_modifier(sm
, 'M');
1100 else if (!strcmp(optarg
, "random"))
1101 set_sort_modifier(sm
, 'R');
1106 #if defined(SORT_THREADS)
1108 nthreads
= (size_t)(atoi(optarg
));
1111 if (nthreads
> 1024)
1116 sort_opts_vals
.sort_method
= SORT_QSORT
;
1119 sort_opts_vals
.sort_method
= SORT_MERGESORT
;
1125 sort_opts_vals
.sort_method
= SORT_HEAPSORT
;
1128 sort_opts_vals
.sort_method
= SORT_RADIXSORT
;
1130 case RANDOMSOURCE_OPT
:
1131 random_source
= strdup(optarg
);
1133 case COMPRESSPROGRAM_OPT
:
1134 compress_program
= strdup(optarg
);
1137 read_fns_from_file0(optarg
);
1142 long mof
= strtol(optarg
, NULL
, 10);
1144 err(2, "--batch-size");
1146 max_open_files
= (size_t) mof
+ 1;
1150 printf("%s\n", VERSION
);
1172 catalog
= catopen("sort", NL_CAT_LOCALE
);
1175 if (sort_opts_vals
.cflag
&& sort_opts_vals
.mflag
)
1176 errx(1, "%c:%c: %s", 'm', 'c', getstr(1));
1182 if (keys_num
== 0) {
1184 keys
= sort_realloc(keys
, sizeof(struct key_specs
));
1185 memset(&(keys
[0]), 0, sizeof(struct key_specs
));
1187 keys
[0].pos1b
= default_sort_mods
->bflag
;
1188 keys
[0].pos2b
= default_sort_mods
->bflag
;
1189 memcpy(&(keys
[0].sm
), default_sort_mods
,
1190 sizeof(struct sort_mods
));
1193 for (size_t i
= 0; i
< keys_num
; i
++) {
1194 struct key_specs
*ks
;
1198 if (sort_modifier_empty(&(ks
->sm
)) && !(ks
->pos1b
) &&
1200 ks
->pos1b
= sm
->bflag
;
1201 ks
->pos2b
= sm
->bflag
;
1202 memcpy(&(ks
->sm
), sm
, sizeof(struct sort_mods
));
1205 ks
->sm
.func
= get_sort_func(&(ks
->sm
));
1208 if (argv_from_file0
) {
1209 argc
= argc_from_file0
;
1210 argv
= argv_from_file0
;
1214 printf("Memory to be used for sorting: %llu\n",available_free_memory
);
1215 #if defined(SORT_THREADS)
1216 printf("Number of CPUs: %d\n",(int)ncpu
);
1219 printf("Using collate rules of %s locale\n",
1220 setlocale(LC_COLLATE
, NULL
));
1222 printf("Byte sort is used\n");
1223 if (print_symbols_on_debug
) {
1224 printf("Decimal Point: <%lc>\n", symbol_decimal_point
);
1225 if (symbol_thousands_sep
)
1226 printf("Thousands separator: <%lc>\n",
1227 symbol_thousands_sep
);
1228 printf("Positive sign: <%lc>\n", symbol_positive_sign
);
1229 printf("Negative sign: <%lc>\n", symbol_negative_sign
);
1235 /* Case when the outfile equals one of the input files: */
1236 if (strcmp(outfile
, "-")) {
1238 for(int i
= 0; i
< argc
; ++i
) {
1239 if (strcmp(argv
[i
], outfile
) == 0) {
1240 real_outfile
= sort_strdup(outfile
);
1242 char* tmp
= sort_malloc(strlen(outfile
) +
1243 strlen(".tmp") + 1);
1245 strcpy(tmp
, outfile
);
1246 strcpy(tmp
+ strlen(tmp
), ".tmp");
1249 if (access(outfile
, F_OK
) < 0)
1252 tmp_file_atexit(outfile
);
1257 #if defined(SORT_THREADS)
1258 if ((argc
< 1) || (strcmp(outfile
, "-") == 0) || (*outfile
== 0))
1262 if (!sort_opts_vals
.cflag
&& !sort_opts_vals
.mflag
) {
1263 struct file_list fl
;
1264 struct sort_list list
;
1266 sort_list_init(&list
);
1267 file_list_init(&fl
, true);
1270 procfile("-", &list
, &fl
);
1273 procfile(*argv
, &list
, &fl
);
1280 sort_list_to_file(&list
, outfile
);
1282 if (list
.count
> 0) {
1283 char *flast
= new_tmp_file_name();
1285 sort_list_to_file(&list
, flast
);
1286 file_list_add(&fl
, flast
, false);
1288 merge_files(&fl
, outfile
);
1291 file_list_clean(&fl
);
1294 * We are about to exit the program, so we can ignore
1295 * the clean-up for speed
1297 * sort_list_clean(&list);
1300 } else if (sort_opts_vals
.cflag
) {
1301 result
= (argc
== 0) ? (check("-")) : (check(*argv
));
1302 } else if (sort_opts_vals
.mflag
) {
1303 struct file_list fl
;
1305 file_list_init(&fl
, false);
1306 file_list_populate(&fl
, argc
, argv
, true);
1307 merge_files(&fl
, outfile
);
1308 file_list_clean(&fl
);
1312 unlink(real_outfile
);
1313 if (rename(outfile
, real_outfile
) < 0)
1315 sort_free(real_outfile
);