coreutils/src/sort.c

9    This program is distributed in the hope that it will be useful,
21    ��rn E. Hansen added NLS support in 1997.  */
111        can be small.  Each retry doubles in duration.  */
116        number should be big.  Each retry doubles in duration.  */
120 /* The representation of the decimal point in the current locale.  */
134 /* The kind of blanks for '-b' to skip in various options. */
140 /* Lines are held in core as counted strings. */
156                                    - an array of lines, in reverse order.  */
158   size_t nlines;		/* Number of lines in the line array.  */
170   size_t echar;			/* Additional characters in field. */
180                                    Handle numbers in exponential notation. */
255 /* Array of directory names in which any temporary files are to be created. */
261 /* Number of allocated slots in temp_dirs.  */
268    comparison of lines, and instead leaves lines in the same order
293 /* Maximum number of files to merge in one go.  If more than this
374                             NUL-terminated names in file F;\n\
402 in the field; both are origin 1.  If neither -t nor -b is in effect, characters\n\
403 in a field are counted from the beginning of the preceding whitespace.  OPTS is\n\
558    processes in a timely manner so as not to exhaust system resources,
567 /* A proctab entry.  The COUNT field is there in case we fork a new
569    that is still in the table (because the process to decompress the
663    process until we look in the table.  If there's an ALIVE entry for
679    If it has a ZOMBIE entry in the table then it's already dead and has
735       /* Clean up any remaining temporary files in a critical section so
772   /* Create the temporary file in a critical section, to avoid races.  */
787         error (SORT_FAILURE, errno, _("cannot create temporary file in %s"),
1082   /* Unlink the temporary file in a critical section to avoid races.  */
1125   /* If we're not in the "C" locale, read different names for months.  */
1281      bother to check for values like RLIM_INFINITY since in practice
1413    by KEY in LINE. */
1422   /* The leading field separator itself is included in a field when -t
1455    in LINE specified by KEY. */
1500      [...]I believe I've found another bug in `sort'.
1502      $ cat /tmp/sort.in
1505      $ textutils-1.15/src/sort -k1.7,1.7 </tmp/sort.in
1508      $ /bin/sort -k1.7,1.7 </tmp/sort.in
1513      in column 7.  GNU sort produced different results, because it disagrees
1615           /* Find and record each line in the just-read input.  */
1662         /* The current input line is too long to fit in the buffer.
1742      Numbers ending in decimals or separators are thus considered
1743      to be lacking in units.
1767 /* Compare numbers ending in units with SI xor IEC prefixes
1808   /* Sort numbers in the usual way, where -0 == +0.  Put NaNs after
1819 /* Return an integer in 1..12 of the month name MONTH with length LEN.
1820    Return 0 if the name in S is not recognized.  */
2004 /* Compare two lines A and B trying every key in sequence until there
2053       /* Sorting like this may become slow, so in a simple locale the user
2225 /* Check that the lines read from FILE_NAME come in order.  Return
2226    true if they are in order.  If CHECKONLY == 'c', also print a
2228    they are not in order.  */
2275       /* Compare each line in the buffer with its successor.  */
2356                                 /* Current line in each line table. */
2491       /* The new line just read in may be larger than other lines
2492          already in main memory; push it back in the queue until we
2518       /* Free up some resources every once in a while.  */
2544    less than NFILES if we ran low on file descriptors, but in this
2561    respective arrays, and the arrays are in reverse order.  NLO and
2597    The input and output arrays are in reverse order, and LINES and
2600    Use a recursive divide-and-conquer algorithm, in the style
2638    rather than sorting in place.  */
2647          in the IBM xlc 6.0.0.0 compiler in 64-bit mode.  */
2670    some other files) into a temporary file so that it can in turn be
2682    Catching these obscure cases would slow down performance in
2748    NFILES is the total number of files.  Put the output in
2758       size_t in;
2773       for (out = in = 0; nmerge <= nfiles - in; out++)
2778           size_t num_merged = mergefiles (&files[in], MIN (ntemps, nmerge),
2783           in += num_merged;
2786       remainder = nfiles - in;
2798           size_t num_merged = mergefiles (&files[in], MIN (ntemps, nshortmerge),
2803           in += num_merged;
2807          window, so they will be merged in the next pass.  */
2808       memmove(&files[out], &files[in], (nfiles - in) * sizeof *files);
2810       nfiles -= in - out;
2906                  Concatenate the next input file; this is faster in
2941           /* Free up some resources every once in a while.  */
3044 /* Parse the leading integer in STRING and store the resulting value
3093 /* Set the ordering options for KEY specified in S.
3094    Return the address of the first character in S that
3337                                       N_("stray character in field spec"));
3438             badfieldspec (optarg, N_("stray character in field spec"));
3512              and which in general ignores the argument after "-y" if it