X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=coreutils%2Fsort.c;h=4f4979cc57facff7f476548e43fba6f8b9d2b01c;hb=ce98c19dfe7bcfb3174c0898f3c001c38c6d44c6;hp=1edc7d1caa4f3dcc510abb628601388e7a799099;hpb=7ab9c7ee52db8759d457819f5480378fa3aa97cc;p=oweals%2Fbusybox.git diff --git a/coreutils/sort.c b/coreutils/sort.c index 1edc7d1ca..4f4979cc5 100644 --- a/coreutils/sort.c +++ b/coreutils/sort.c @@ -3,8 +3,7 @@ * Mini sort implementation for busybox * * - * Copyright (C) 1999,2000 by Lineo, inc. - * Written by John Beppu + * Copyright (C) 2000 by Matt Kraai * * 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 @@ -22,286 +21,86 @@ * */ -#include "internal.h" -#include -#include -#include -#include -#include +#include +#include +#include +#include "busybox.h" -static const char sort_usage[] = "sort [-n]" -#ifdef BB_FEATURE_SORT_REVERSE -" [-r]" -#endif -" [FILE]...\n" -#ifndef BB_FEATURE_TRIVIAL_HELP -"\nSorts lines of text in the specified files\n" -#endif -; - -#ifdef BB_FEATURE_SORT_REVERSE -#define APPLY_REVERSE(x) (reverse ? -(x) : (x)) -static int reverse = 0; -#else -#define APPLY_REVERSE(x) (x) -#endif - -/* 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; - -/* comparison function */ -typedef int (Compare) (const void *, const void *); - - -/* methods ________________________________________________________________ */ - -static const int max = 1024; - -/* mallocate Line */ -static Line *line_alloc() +static int compare_ascii(const void *x, const void *y) { - Line *self; - self = malloc(1 * sizeof(Line)); - return self; + return strcmp(*(char **)x, *(char **)y); } -/* Construct Line from FILE* */ -static Line *line_newFromFile(FILE * src) +static int compare_numeric(const void *x, const void *y) { - Line *self; - char *cstring = NULL; - - if ((cstring = cstring_lineFromFile(src))) { - self = line_alloc(); - if (self == NULL) { - return NULL; - } - self->data = cstring; - self->next = NULL; - return self; - } - return NULL; + int z = atoi(*(char **)x) - atoi(*(char **)y); + return z ? z : strcmp(*(char **)x, *(char **)y); } -/* Line destructor */ -static Line *line_release(Line * self) -{ - if (self->data) { - free(self->data); - free(self); - } - 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; - - // fprintf(stdout, "> %p: %s< %p: %s", x, x->data, y, y->data); - return APPLY_REVERSE(strcmp(x->data, y->data)); -} - -/* numeric order */ -static int compare_numeric(const void *a, const void *b) -{ - 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 APPLY_REVERSE(xint - yint); -} - - -/* 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) -{ - if (line == NULL) { - return NULL; - } - - /* first insertion */ - if (self->head == NULL) { - self->head = line; - self->current = line; - - /* all subsequent insertions */ - } else { - self->current->next = line; - self->current = line; - } - self->len++; - return self; -} - -/* order the list according to compare() */ -static List *list_sort(List * self, Compare * compare) -{ - 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; -} - -/* precondition: list must be sorted */ -static List *list_writeToFile(List * self, FILE * dst) -{ - 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); - } - 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); - } -} - - - int sort_main(int argc, char **argv) { - int i; - char opt; - List list; - Line *l; - Compare *compare; - - /* init */ - compare = compare_ascii; - list_init(&list); + FILE *fp; + char *line, **lines = NULL; + int i, opt, nlines = 0; + int (*compare)(const void *, const void *) = compare_ascii; +#ifdef BB_FEATURE_SORT_REVERSE + int reverse = FALSE; +#endif +#ifdef BB_FEATURE_SORT_UNIQUE + int unique = FALSE; +#endif - /* parse argv[] */ - for (i = 1; i < argc; i++) { - if (argv[i][0] == '-') { - opt = argv[i][1]; - switch (opt) { - case 'h': - usage(sort_usage); - break; + while ((opt = getopt(argc, argv, "nru")) != -1) { + switch (opt) { case 'n': - /* numeric comparison */ compare = compare_numeric; break; #ifdef BB_FEATURE_SORT_REVERSE case 'r': - /* reverse */ - reverse = 1; + reverse = TRUE; + break; +#endif +#ifdef BB_FEATURE_SORT_UNIQUE + case 'u': + unique = TRUE; break; #endif default: - fprintf(stderr, "sort: invalid option -- %c\n", opt); - usage(sort_usage); - } - } else { - break; + show_usage(); } } - /* this could be factored better */ - - /* work w/ stdin */ - if (i >= argc) { - while ((l = line_newFromFile(stdin))) { - list_insert(&list, l); + /* read the input */ + for (i = optind; i == optind || i < argc; i++) { + if (argv[i] == NULL) + fp = stdin; + else + fp = xfopen(argv[i], "r"); + + while ((line = get_line_from_file(fp)) != NULL) { + lines = xrealloc(lines, sizeof(char *) * (nlines + 1)); + chomp(line); + lines[nlines++] = line; } - list_sort(&list, compare); - list_writeToFile(&list, stdout); - list_release(&list); - - /* work w/ what's left in argv[] */ - } else { - FILE *src; - - for (; i < argc; i++) { - src = fopen(argv[i], "r"); - if (src == NULL) { - break; - } - while ((l = line_newFromFile(src))) { - list_insert(&list, l); - } - fclose(src); - } - list_sort(&list, compare); - list_writeToFile(&list, stdout); - list_release(&list); } - exit(0); -} + /* sort it */ + qsort(lines, nlines, sizeof(char *), compare); -/* $Id: sort.c,v 1.16 2000/05/12 19:41:47 erik Exp $ */ + /* print it */ +#ifdef BB_FEATURE_SORT_REVERSE + if (reverse) { + for (i = --nlines; 0 <= i; i--) +#ifdef BB_FEATURE_SORT_UNIQUE + if((!unique) || (i == nlines) || (strcmp(lines[i + 1], lines[i]))) +#endif + puts(lines[i]); + } else +#endif + for (i = 0; i < nlines; i++) +#ifdef BB_FEATURE_SORT_UNIQUE + if((!unique) || (!i) || (strcmp(lines[i - 1], lines[i]))) +#endif + puts(lines[i]); + return EXIT_SUCCESS; +}