/* vi: set sw=4 ts=4: */
/*
- * Mini sort implementation for busybox
+ * SuS3 compliant sort implementation for busybox
*
+ * Copyright (C) 2004 by Rob Landley <rob@landley.net>
*
- * Copyright (C) 1999 by Lineo, inc.
- * Written by John Beppu <beppu@lineo.com>
+ * MAINTAINER: Rob Landley <rob@landley.net>
*
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Licensed under GPLv2 or later, see file LICENSE in this source tree.
*
+ * See SuS3 sort standard at:
+ * http://www.opengroup.org/onlinepubs/007904975/utilities/sort.html
*/
+//config:config SORT
+//config: bool "sort (7.4 kb)"
+//config: default y
+//config: help
+//config: sort is used to sort lines of text in specified files.
+//config:
+//config:config FEATURE_SORT_BIG
+//config: bool "Full SuSv3 compliant sort (support -ktcbdfiogM)"
+//config: default y
+//config: depends on SORT
+//config: help
+//config: Without this, sort only supports -rusz, and an integer version
+//config: of -n. Selecting this adds sort keys, floating point support, and
+//config: more. This adds a little over 3k to a nonstatic build on x86.
+//config:
+//config: The SuSv3 sort standard is available at:
+//config: http://www.opengroup.org/onlinepubs/007904975/utilities/sort.html
+//config:
+//config:config FEATURE_SORT_OPTIMIZE_MEMORY
+//config: bool "Use less memory (but might be slower)"
+//config: default n # defaults to N since we are size-paranoid tribe
+//config: depends on SORT
+//config: help
+//config: Attempt to use less memory (by storing only one copy
+//config: of duplicated lines, and such). Useful if you work on huge files.
+
+//applet:IF_SORT(APPLET_NOEXEC(sort, sort, BB_DIR_USR_BIN, BB_SUID_DROP, sort))
+
+//kbuild:lib-$(CONFIG_SORT) += sort.o
+
+//usage:#define sort_trivial_usage
+//usage: "[-nru"
+//usage: IF_FEATURE_SORT_BIG("gMcszbdfiokt] [-o FILE] [-k start[.offset][opts][,end[.offset][opts]] [-t CHAR")
+//usage: "] [FILE]..."
+//usage:#define sort_full_usage "\n\n"
+//usage: "Sort lines of text\n"
+//usage: IF_FEATURE_SORT_BIG(
+//usage: "\n -o FILE Output to FILE"
+//usage: "\n -c Check whether input is sorted"
+//usage: "\n -b Ignore leading blanks"
+//usage: "\n -f Ignore case"
+//usage: "\n -i Ignore unprintable characters"
+//usage: "\n -d Dictionary order (blank or alphanumeric only)"
+//usage: )
+//-h, --human-numeric-sort: compare human readable numbers (e.g., 2K 1G)
+//usage: "\n -n Sort numbers"
+//usage: IF_FEATURE_SORT_BIG(
+//usage: "\n -g General numerical sort"
+//usage: "\n -M Sort month"
+//usage: "\n -V Sort version"
+//usage: "\n -t CHAR Field separator"
+//usage: "\n -k N[,M] Sort by Nth field"
+//usage: )
+//usage: "\n -r Reverse sort order"
+//usage: "\n -s Stable (don't sort ties alphabetically)"
+//usage: "\n -u Suppress duplicate lines"
+//usage: "\n -z Lines are terminated by NUL, not newline"
+///////: "\n -m Ignored for GNU compatibility"
+///////: "\n -S BUFSZ Ignored for GNU compatibility"
+///////: "\n -T TMPDIR Ignored for GNU compatibility"
+//usage:
+//usage:#define sort_example_usage
+//usage: "$ echo -e \"e\\nf\\nb\\nd\\nc\\na\" | sort\n"
+//usage: "a\n"
+//usage: "b\n"
+//usage: "c\n"
+//usage: "d\n"
+//usage: "e\n"
+//usage: "f\n"
+//usage: IF_FEATURE_SORT_BIG(
+//usage: "$ echo -e \"c 3\\nb 2\\nd 2\" | $SORT -k 2,2n -k 1,1r\n"
+//usage: "d 2\n"
+//usage: "b 2\n"
+//usage: "c 3\n"
+//usage: )
+//usage: ""
+
+#include "libbb.h"
+
+/* These are sort types */
+enum {
+ FLAG_n = 1 << 0, /* Numeric sort */
+ FLAG_g = 1 << 1, /* Sort using strtod() */
+ FLAG_M = 1 << 2, /* Sort date */
+ FLAG_V = 1 << 3, /* Sort version */
+/* ucsz apply to root level only, not keys. b at root level implies bb */
+ FLAG_u = 1 << 4, /* Unique */
+ FLAG_c = 1 << 5, /* Check: no output, exit(!ordered) */
+ FLAG_s = 1 << 6, /* Stable sort, no ascii fallback at end */
+ FLAG_z = 1 << 7, /* Input and output is NUL terminated, not \n */
+/* These can be applied to search keys, the previous four can't */
+ FLAG_b = 1 << 8, /* Ignore leading blanks */
+ FLAG_r = 1 << 9, /* Reverse */
+ FLAG_d = 1 << 10, /* Ignore !(isalnum()|isspace()) */
+ FLAG_f = 1 << 11, /* Force uppercase */
+ FLAG_i = 1 << 12, /* Ignore !isprint() */
+ FLAG_m = 1 << 13, /* ignored: merge already sorted files; do not sort */
+ FLAG_S = 1 << 14, /* ignored: -S, --buffer-size=SIZE */
+ FLAG_T = 1 << 15, /* ignored: -T, --temporary-directory=DIR */
+ FLAG_o = 1 << 16,
+ FLAG_k = 1 << 17,
+ FLAG_t = 1 << 18,
+ FLAG_bb = 0x80000000, /* Ignore trailing blanks */
+ FLAG_no_tie_break = 0x40000000,
+};
+
+static const char sort_opt_str[] ALIGN1 = "^"
+ "ngMVucszbrdfimS:T:o:k:*t:"
+ "\0" "o--o:t--t"/*-t, -o: at most one of each*/;
+/*
+ * OPT_STR must not be string literal, needs to have stable address:
+ * code uses "strchr(OPT_STR,c) - OPT_STR" idiom.
+ */
+#define OPT_STR (sort_opt_str + 1)
-#include "internal.h"
-#include <sys/types.h>
-#include <fcntl.h>
-#include <dirent.h>
-#include <stdio.h>
-#include <errno.h>
-
-static const char sort_usage[] = "sort [OPTION]... [FILE]...\n\n";
-
-/* typedefs _______________________________________________________________ */
-
-/* line node */
-typedef struct Line {
- char *data; /* line data */
- struct Line *next; /* pointer to next line node */
-} Line;
-
-/* singly-linked list of lines */
-typedef struct {
- int len; /* number of Lines */
- Line **sorted; /* array fed to qsort */
-
- Line *head; /* head of List */
- Line *current; /* current Line */
-} List;
+#if ENABLE_FEATURE_SORT_BIG
+static char key_separator;
-/* comparison function */
-typedef int (Compare) (const void *, const void *);
+static struct sort_key {
+ struct sort_key *next_key; /* linked list */
+ unsigned range[4]; /* start word, start char, end word, end char */
+ unsigned flags;
+} *key_list;
-/* methods ________________________________________________________________ */
+/* This is a NOEXEC applet. Be very careful! */
-static const int max = 1024;
-/* mallocate Line */
-static Line *line_alloc()
+static char *get_key(char *str, struct sort_key *key, int flags)
{
- Line *self;
-
- self = malloc(1 * sizeof(Line));
- return self;
-}
-
-/* Initialize Line with string */
-static Line *line_init(Line * self, const char *string)
-{
- self->data = malloc((strlen(string) + 1) * sizeof(char));
-
- if (self->data == NULL) {
- return NULL;
+ int start = start; /* for compiler */
+ int end;
+ int len, j;
+ unsigned i;
+
+ /* Special case whole string, so we don't have to make a copy */
+ if (key->range[0] == 1 && !key->range[1] && !key->range[2] && !key->range[3]
+ && !(flags & (FLAG_b | FLAG_d | FLAG_f | FLAG_i | FLAG_bb))
+ ) {
+ return str;
}
- strcpy(self->data, string);
- self->next = NULL;
- return self;
-}
-/* Construct Line from FILE* */
-static Line *line_newFromFile(FILE * src)
-{
- char buffer[max];
- Line *self;
-
- if (fgets(buffer, max, src)) {
- self = line_alloc();
- if (self == NULL) {
- return NULL;
+ /* Find start of key on first pass, end on second pass */
+ len = strlen(str);
+ for (j = 0; j < 2; j++) {
+ if (!key->range[2*j])
+ end = len;
+ /* Loop through fields */
+ else {
+ unsigned char ch = 0;
+
+ end = 0;
+ for (i = 1; i < key->range[2*j] + j; i++) {
+ if (key_separator) {
+ /* Skip body of key and separator */
+ while ((ch = str[end]) != '\0') {
+ end++;
+ if (ch == key_separator)
+ break;
+ }
+ } else {
+ /* Skip leading blanks */
+ while (isspace(str[end]))
+ end++;
+ /* Skip body of key */
+ while (str[end] != '\0') {
+ if (isspace(str[end]))
+ break;
+ end++;
+ }
+ }
+ }
+ /* Remove last delim: "abc:def:" => "abc:def" */
+ if (j && ch) {
+ //if (str[end-1] != key_separator)
+ // bb_error_msg(_and_die("BUG! "
+ // "str[start:%d,end:%d]:'%.*s'",
+ // start, end, (int)(end-start), &str[start]);
+ end--;
+ }
}
- line_init(self, buffer);
- return self;
+ if (!j) start = end;
}
- return NULL;
-}
-
-/* Line destructor */
-static Line *line_release(Line * self)
-{
- if (self->data) {
- free(self->data);
- free(self);
+ /* Strip leading whitespace if necessary */
+ if (flags & FLAG_b)
+ /* not using skip_whitespace() for speed */
+ while (isspace(str[start])) start++;
+ /* Strip trailing whitespace if necessary */
+ if (flags & FLAG_bb)
+ while (end > start && isspace(str[end-1])) end--;
+ /* -kSTART,N.ENDCHAR: honor ENDCHAR (1-based) */
+ if (key->range[3]) {
+ end = key->range[3];
+ if (end > len) end = len;
}
- return self;
-}
-
-
-/* Comparison */
-
-/* ascii order */
-static int compare_ascii(const void *a, const void *b)
-{
- Line **doh;
- Line *x, *y;
-
- doh = (Line **) a;
- x = *doh;
- doh = (Line **) b;
- y = *doh;
+ /* -kN.STARTCHAR[,...]: honor STARTCHAR (1-based) */
+ if (key->range[1]) {
+ start += key->range[1] - 1;
+ if (start > len) start = len;
+ }
+ /* Make the copy */
+ if (end < start)
+ end = start;
+ str = xstrndup(str+start, end-start);
+ /* Handle -d */
+ if (flags & FLAG_d) {
+ for (start = end = 0; str[end]; end++)
+ if (isspace(str[end]) || isalnum(str[end]))
+ str[start++] = str[end];
+ str[start] = '\0';
+ }
+ /* Handle -i */
+ if (flags & FLAG_i) {
+ for (start = end = 0; str[end]; end++)
+ if (isprint_asciionly(str[end]))
+ str[start++] = str[end];
+ str[start] = '\0';
+ }
+ /* Handle -f */
+ if (flags & FLAG_f)
+ for (i = 0; str[i]; i++)
+ str[i] = toupper(str[i]);
- // fprintf(stdout, "> %p: %s< %p: %s", x, x->data, y, y->data);
- return strcmp(x->data, y->data);
+ return str;
}
-/* numeric order */
-static int compare_numeric(const void *a, const void *b)
+static struct sort_key *add_key(void)
{
- Line **doh;
- Line *x, *y;
- int xint, yint;
-
- doh = (Line **) a;
- x = *doh;
- doh = (Line **) b;
- y = *doh;
-
- xint = strtoul(x->data, NULL, 10);
- yint = strtoul(y->data, NULL, 10);
-
- return (xint - yint);
+ struct sort_key **pkey = &key_list;
+ while (*pkey)
+ pkey = &((*pkey)->next_key);
+ return *pkey = xzalloc(sizeof(struct sort_key));
}
+#define GET_LINE(fp) \
+ ((option_mask32 & FLAG_z) \
+ ? bb_get_chunk_from_file(fp, NULL) \
+ : xmalloc_fgetline(fp))
+#else
+#define GET_LINE(fp) xmalloc_fgetline(fp)
+#endif
-/* List */
-
-/* */
-static List *list_init(List * self)
-{
- self->len = 0;
- self->sorted = NULL;
- self->head = NULL;
- self->current = NULL;
- return self;
-}
-
-/* for simplicity, the List gains ownership of the line */
-static List *list_insert(List * self, Line * line)
+/* Iterate through keys list and perform comparisons */
+static int compare_keys(const void *xarg, const void *yarg)
{
- if (line == NULL) {
- return NULL;
+ int flags = option_mask32, retval = 0;
+ char *x, *y;
+
+#if ENABLE_FEATURE_SORT_BIG
+ struct sort_key *key;
+
+ for (key = key_list; !retval && key; key = key->next_key) {
+ flags = key->flags ? key->flags : option_mask32;
+ /* Chop out and modify key chunks, handling -dfib */
+ x = get_key(*(char **)xarg, key, flags);
+ y = get_key(*(char **)yarg, key, flags);
+#else
+ /* This curly bracket serves no purpose but to match the nesting
+ * level of the for () loop we're not using */
+ {
+ x = *(char **)xarg;
+ y = *(char **)yarg;
+#endif
+ /* Perform actual comparison */
+ switch (flags & (FLAG_n | FLAG_g | FLAG_M | FLAG_V)) {
+ default:
+ bb_error_msg_and_die("unknown sort type");
+ break;
+#if defined(HAVE_STRVERSCMP) && HAVE_STRVERSCMP == 1
+ case FLAG_V:
+ retval = strverscmp(x, y);
+ break;
+#endif
+ /* Ascii sort */
+ case 0:
+#if ENABLE_LOCALE_SUPPORT
+ retval = strcoll(x, y);
+#else
+ retval = strcmp(x, y);
+#endif
+ break;
+#if ENABLE_FEATURE_SORT_BIG
+ case FLAG_g: {
+ char *xx, *yy;
+ double dx = strtod(x, &xx);
+ double dy = strtod(y, &yy);
+ /* not numbers < NaN < -infinity < numbers < +infinity) */
+ if (x == xx)
+ retval = (y == yy ? 0 : -1);
+ else if (y == yy)
+ retval = 1;
+ /* Check for isnan */
+ else if (dx != dx)
+ retval = (dy != dy) ? 0 : -1;
+ else if (dy != dy)
+ retval = 1;
+ /* Check for infinity. Could underflow, but it avoids libm. */
+ else if (1.0 / dx == 0.0) {
+ if (dx < 0)
+ retval = (1.0 / dy == 0.0 && dy < 0) ? 0 : -1;
+ else
+ retval = (1.0 / dy == 0.0 && dy > 0) ? 0 : 1;
+ } else if (1.0 / dy == 0.0)
+ retval = (dy < 0) ? 1 : -1;
+ else
+ retval = (dx > dy) ? 1 : ((dx < dy) ? -1 : 0);
+ break;
+ }
+ case FLAG_M: {
+ struct tm thyme;
+ int dx;
+ char *xx, *yy;
+
+ xx = strptime(x, "%b", &thyme);
+ dx = thyme.tm_mon;
+ yy = strptime(y, "%b", &thyme);
+ if (!xx)
+ retval = (!yy) ? 0 : -1;
+ else if (!yy)
+ retval = 1;
+ else
+ retval = dx - thyme.tm_mon;
+ break;
+ }
+ /* Full floating point version of -n */
+ case FLAG_n: {
+ double dx = atof(x);
+ double dy = atof(y);
+ retval = (dx > dy) ? 1 : ((dx < dy) ? -1 : 0);
+ break;
+ }
+ } /* switch */
+ /* Free key copies. */
+ if (x != *(char **)xarg) free(x);
+ if (y != *(char **)yarg) free(y);
+ /* if (retval) break; - done by for () anyway */
+#else
+ /* Integer version of -n for tiny systems */
+ case FLAG_n:
+ retval = atoi(x) - atoi(y);
+ break;
+ } /* switch */
+#endif
+ } /* for */
+
+ if (retval == 0) {
+ /* So far lines are "the same" */
+
+ if (option_mask32 & FLAG_s) {
+ /* "Stable sort": later line is "greater than",
+ * IOW: do not allow qsort() to swap equal lines.
+ */
+ uint32_t *p32;
+ uint32_t x32, y32;
+ char *line;
+ unsigned len;
+
+ line = *(char**)xarg;
+ len = (strlen(line) + 4) & (~3u);
+ p32 = (void*)(line + len);
+ x32 = *p32;
+ line = *(char**)yarg;
+ len = (strlen(line) + 4) & (~3u);
+ p32 = (void*)(line + len);
+ y32 = *p32;
+
+ /* If x > y, 1, else -1 */
+ retval = (x32 > y32) * 2 - 1;
+ } else
+ if (!(option_mask32 & FLAG_no_tie_break)) {
+ /* fallback sort */
+ flags = option_mask32;
+ retval = strcmp(*(char **)xarg, *(char **)yarg);
+ }
}
- /* first insertion */
- if (self->head == NULL) {
- self->head = line;
- self->current = line;
+ if (flags & FLAG_r)
+ return -retval;
- /* all subsequent insertions */
- } else {
- self->current->next = line;
- self->current = line;
- }
- self->len++;
- return self;
+ return retval;
}
-/* order the list according to compare() */
-static List *list_sort(List * self, Compare * compare)
+#if ENABLE_FEATURE_SORT_BIG
+static unsigned str2u(char **str)
{
- int i;
- Line *line;
-
- /* mallocate array of Line*s */
- self->sorted = (Line **) malloc(self->len * sizeof(Line *));
- if (self->sorted == NULL) {
- return NULL;
- }
-
- /* fill array w/ List's contents */
- i = 0;
- line = self->head;
- while (line) {
- self->sorted[i++] = line;
- line = line->next;
- }
-
- /* apply qsort */
- qsort(self->sorted, self->len, sizeof(Line *), compare);
- return self;
+ unsigned long lu;
+ if (!isdigit((*str)[0]))
+ bb_error_msg_and_die("bad field specification");
+ lu = strtoul(*str, str, 10);
+ if ((sizeof(long) > sizeof(int) && lu > INT_MAX) || !lu)
+ bb_error_msg_and_die("bad field specification");
+ return lu;
}
+#endif
-/* precondition: list must be sorted */
-static List *list_writeToFile(List * self, FILE * dst)
+int sort_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
+int sort_main(int argc UNUSED_PARAM, char **argv)
{
+ char **lines;
+ char *str_ignored, *str_o, *str_t;
+ llist_t *lst_k = NULL;
int i;
- Line **line = self->sorted;
-
- if (self->sorted == NULL) {
- return NULL;
- }
- for (i = 0; i < self->len; i++) {
- fprintf(dst, "%s", line[i]->data);
+ int linecount;
+ unsigned opts;
+#if ENABLE_FEATURE_SORT_OPTIMIZE_MEMORY
+ bool can_drop_dups;
+ size_t prev_len = 0;
+ char *prev_line = (char*) "";
+ /* Postpone optimizing if the input is small, < 16k lines:
+ * even just free()ing duplicate lines takes time.
+ */
+ size_t count_to_optimize_dups = 0x3fff;
+#endif
+
+ xfunc_error_retval = 2;
+
+ /* Parse command line options */
+ opts = getopt32(argv,
+ sort_opt_str,
+ &str_ignored, &str_ignored, &str_o, &lst_k, &str_t
+ );
+#if ENABLE_FEATURE_SORT_OPTIMIZE_MEMORY
+ /* Can drop dups only if -u but no "complicating" options,
+ * IOW: if we do a full line compares. Safe options:
+ * -o FILE Output to FILE
+ * -z Lines are terminated by NUL, not newline
+ * -r Reverse sort order
+ * -s Stable (don't sort ties alphabetically)
+ * Not sure about these:
+ * -b Ignore leading blanks
+ * -f Ignore case
+ * -i Ignore unprintable characters
+ * -d Dictionary order (blank or alphanumeric only)
+ * -n Sort numbers
+ * -g General numerical sort
+ * -M Sort month
+ */
+ can_drop_dups = ((opts & ~(FLAG_o|FLAG_z|FLAG_r|FLAG_s)) == FLAG_u);
+ /* Stable sort needs every line to be uniquely allocated,
+ * disable optimization to reuse strings:
+ */
+ if (opts & FLAG_s)
+ count_to_optimize_dups = (size_t)-1L;
+#endif
+ /* global b strips leading and trailing spaces */
+ if (opts & FLAG_b)
+ option_mask32 |= FLAG_bb;
+#if ENABLE_FEATURE_SORT_BIG
+ if (opts & FLAG_t) {
+ if (!str_t[0] || str_t[1])
+ bb_error_msg_and_die("bad -t parameter");
+ key_separator = str_t[0];
}
- return self;
-}
-
-/* deallocate */
-static void list_release(List * self)
-{
- Line *i;
- Line *die;
-
- i = self->head;
- while (i) {
- die = i;
- i = die->next;
- line_release(die);
+ /* note: below this point we use option_mask32, not opts,
+ * since that reduces register pressure and makes code smaller */
+
+ /* Parse sort key */
+ while (lst_k) {
+ enum {
+ FLAG_allowed_for_k =
+ FLAG_n | /* Numeric sort */
+ FLAG_g | /* Sort using strtod() */
+ FLAG_M | /* Sort date */
+ FLAG_b | /* Ignore leading blanks */
+ FLAG_r | /* Reverse */
+ FLAG_d | /* Ignore !(isalnum()|isspace()) */
+ FLAG_f | /* Force uppercase */
+ FLAG_i | /* Ignore !isprint() */
+ 0
+ };
+ struct sort_key *key = add_key();
+ char *str_k = llist_pop(&lst_k);
+
+ i = 0; /* i==0 before comma, 1 after (-k3,6) */
+ while (*str_k) {
+ /* Start of range */
+ /* Cannot use bb_strtou - suffix can be a letter */
+ key->range[2*i] = str2u(&str_k);
+ if (*str_k == '.') {
+ str_k++;
+ key->range[2*i+1] = str2u(&str_k);
+ }
+ while (*str_k) {
+ int flag;
+ const char *idx;
+
+ if (*str_k == ',' && !i++) {
+ str_k++;
+ break;
+ } /* no else needed: fall through to syntax error
+ because comma isn't in OPT_STR */
+ idx = strchr(OPT_STR, *str_k);
+ if (!idx)
+ bb_error_msg_and_die("unknown key option");
+ flag = 1 << (idx - OPT_STR);
+ if (flag & ~FLAG_allowed_for_k)
+ bb_error_msg_and_die("unknown sort type");
+ /* b after ',' means strip _trailing_ space */
+ if (i && flag == FLAG_b)
+ flag = FLAG_bb;
+ key->flags |= flag;
+ str_k++;
+ }
+ }
}
-}
-
-
-/*
- * I need a list
- * to insert lines into
- * then I need to sort this list
- * and finally print it
- */
-
-int sort_main(int argc, char **argv)
-{
- int i;
- char opt;
- List list;
- Line *l;
- Compare *compare;
-
- /* init */
- compare = compare_ascii;
- list_init(&list);
-
- /* parse argv[] */
- for (i = 1; i < argc; i++) {
- if (argv[i][0] == '-') {
- opt = argv[i][1];
- switch (opt) {
- case 'g':
- /* what's the diff between -g && -n? */
- compare = compare_numeric;
- break;
- case 'h':
- usage(sort_usage);
+#endif
+
+ /* Open input files and read data */
+ argv += optind;
+ if (!*argv)
+ *--argv = (char*)"-";
+ linecount = 0;
+ lines = NULL;
+ do {
+ /* coreutils 6.9 compat: abort on first open error,
+ * do not continue to next file: */
+ FILE *fp = xfopen_stdin(*argv);
+ for (;;) {
+ char *line = GET_LINE(fp);
+ if (!line)
break;
- case 'n':
- /* what's the diff between -g && -n? */
- compare = compare_numeric;
- break;
- case 'r':
- /* reverse */
- break;
- default:
- fprintf(stderr, "sort: invalid option -- %c\n", opt);
- usage(sort_usage);
+
+#if ENABLE_FEATURE_SORT_OPTIMIZE_MEMORY
+ if (count_to_optimize_dups != 0)
+ count_to_optimize_dups--;
+ if (count_to_optimize_dups == 0) {
+ size_t len;
+ char *new_line;
+
+ /* On kernel/linux/arch/ *.[ch] files,
+ * this reduces memory usage by 6%.
+ * yes | head -99999999 | sort
+ * goes down from 1900Mb to 380 Mb.
+ */
+ len = strlen(line);
+ if (len <= prev_len) {
+ new_line = prev_line + (prev_len - len);
+ if (strcmp(line, new_line) == 0) {
+ /* it's a tail of the prev line */
+ if (can_drop_dups && prev_len == len) {
+ /* it's identical to prev line */
+ free(line);
+ continue;
+ }
+ free(line);
+ line = new_line;
+ /* continue using longer prev_line
+ * for future tail tests.
+ */
+ goto skip;
+ }
+ }
+ prev_len = len;
+ prev_line = line;
+ skip: ;
+ }
+#else
+//TODO: lighter version which only drops total dups if can_drop_dups == true
+#endif
+ lines = xrealloc_vector(lines, 6, linecount);
+ lines[linecount++] = line;
+ }
+ fclose_if_not_stdin(fp);
+ } while (*++argv);
+
+#if ENABLE_FEATURE_SORT_BIG
+ /* If no key, perform alphabetic sort */
+ if (!key_list)
+ add_key()->range[0] = 1;
+ /* Handle -c */
+ if (option_mask32 & FLAG_c) {
+ int j = (option_mask32 & FLAG_u) ? -1 : 0;
+ for (i = 1; i < linecount; i++) {
+ if (compare_keys(&lines[i-1], &lines[i]) > j) {
+ fprintf(stderr, "Check line %u\n", i);
+ return EXIT_FAILURE;
}
- } else {
- break;
}
+ return EXIT_SUCCESS;
}
-
- /* this could be factored better */
-
- /* work w/ stdin */
- if (i >= argc) {
- while ((l = line_newFromFile(stdin))) {
- list_insert(&list, l);
+#endif
+
+ /* For stable sort, store original line position beyond terminating NUL */
+ if (option_mask32 & FLAG_s) {
+ for (i = 0; i < linecount; i++) {
+ uint32_t *p32;
+ char *line;
+ unsigned len;
+
+ line = lines[i];
+ len = (strlen(line) + 4) & (~3u);
+ lines[i] = line = xrealloc(line, len + 4);
+ p32 = (void*)(line + len);
+ *p32 = i;
}
- list_sort(&list, compare);
- list_writeToFile(&list, stdout);
- list_release(&list);
-
- /* work w/ what's left in argv[] */
- } else {
- FILE *src;
+ /*option_mask32 |= FLAG_no_tie_break;*/
+ /* ^^^redundant: if FLAG_s, compare_keys() does no tie break */
+ }
- for (; i < argc; i++) {
- src = fopen(argv[i], "r");
- if (src == NULL) {
- break;
- }
- while ((l = line_newFromFile(src))) {
- list_insert(&list, l);
- }
- fclose(src);
+ /* Perform the actual sort */
+ qsort(lines, linecount, sizeof(lines[0]), compare_keys);
+
+ /* Handle -u */
+ if (option_mask32 & FLAG_u) {
+ int j = 0;
+ /* coreutils 6.3 drop lines for which only key is the same
+ * -- disabling last-resort compare, or else compare_keys()
+ * will be the same only for completely identical lines.
+ */
+ option_mask32 |= FLAG_no_tie_break;
+ for (i = 1; i < linecount; i++) {
+ if (compare_keys(&lines[j], &lines[i]) == 0)
+ free(lines[i]);
+ else
+ lines[++j] = lines[i];
}
- list_sort(&list, compare);
- list_writeToFile(&list, stdout);
- list_release(&list);
+ if (linecount)
+ linecount = j+1;
}
- exit(0);
-}
+ /* Print it */
+#if ENABLE_FEATURE_SORT_BIG
+ /* Open output file _after_ we read all input ones */
+ if (option_mask32 & FLAG_o)
+ xmove_fd(xopen(str_o, O_WRONLY|O_CREAT|O_TRUNC), STDOUT_FILENO);
+#endif
+ {
+ int ch = (option_mask32 & FLAG_z) ? '\0' : '\n';
+ for (i = 0; i < linecount; i++)
+ printf("%s%c", lines[i], ch);
+ }
-/* $Id: sort.c,v 1.11 2000/02/08 19:58:47 erik Exp $ */
+ fflush_stdout_and_exit(EXIT_SUCCESS);
+}
projects / oweals / busybox.git / blobdiff