multibuild.pl saves us again. unix2dos requires that dos2unix

[oweals/busybox.git] / sort.c

diff --git a/sort.c b/sort.c
index 4ab673b4d397a86c71a25339aef6ce3197e574f2..4f4979cc57facff7f476548e43fba6f8b9d2b01c 100644 (file)
--- a/sort.c
+++ b/sort.c
@@ -1,9 +1,9 @@
+/* vi: set sw=4 ts=4: */
 /*
- * Mini find implementation for busybox
+ * Mini sort implementation for busybox
  *
  *
- * Copyright (C) 1999 by Lineo, inc.
- * Written by John Beppu <beppu@lineo.com>
+ * Copyright (C) 2000 by Matt Kraai <kraai@alumni.carnegiemellon.edu>
  *
  * 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
@@ -21,107 +21,86 @@
  *
  */
 
-#include "internal.h"
-#include <sys/types.h>
-#include <fcntl.h>
-#include <dirent.h>
-#include <stdio.h>
-#include <errno.h>
+#include <getopt.h>
+#include <string.h>
+#include <stdlib.h>
+#include "busybox.h"
 
-static const char sort_usage[] =
-"Usage: sort [OPTION]... [FILE]...\n\n"
-;
-
-
-/* line node */
-typedef struct {
-    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       *line;      /* array fed to qsort */
-    Line       *head;      /* head of List */
-} List;
-
-
-/* Line methods */
-
-static const int max = 1024;
-
-static Line *
-line_new()
+static int compare_ascii(const void *x, const void *y)
 {
-    char buffer[max];
+       return strcmp(*(char **)x, *(char **)y);
 }
 
-
-/* Comparison */
-
-static int
-compare_ascii(const void *, const void *);
-
-static int
-compare_numeric(const void *, const void *);
-
-
-/* List */
-
-static void
-list_insert();
-
-static void
-list_sort();
-
-static void
-list_print();
-
-
-
-/*
- * 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)
+static int compare_numeric(const void *x, const void *y)
 {
-    int i;
-    char opt;
-
-    /* default behaviour */
+       int z = atoi(*(char **)x) - atoi(*(char **)y);
+       return z ? z : strcmp(*(char **)x, *(char **)y);
+}
 
-    /* parse argv[] */
-    for (i = 1; i < argc; i++) {
-       if (argv[i][0] == '-') {
-           opt = argv[i][1];
-           switch (opt) {
-               case 'h':
-                   usage(sort_usage);
-                   break;
-               default:
-                   fprintf(stderr, "sort: invalid option -- %c\n", opt);
-                   usage(sort_usage);
-           }
-       } else {
-           break;
+int sort_main(int argc, char **argv)
+{
+       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
+
+       while ((opt = getopt(argc, argv, "nru")) != -1) {
+               switch (opt) {
+                       case 'n':
+                               compare = compare_numeric;
+                               break;
+#ifdef BB_FEATURE_SORT_REVERSE
+                       case 'r':
+                               reverse = TRUE;
+                               break;
+#endif
+#ifdef BB_FEATURE_SORT_UNIQUE
+                       case 'u':
+                               unique = TRUE;
+                               break;
+#endif
+                       default:
+                               show_usage();
+               }
        }
-    }
-
-    /* go through remaining args (if any) */
-    if (i >= argc) {
 
-    } else {
-       for ( ; i < argc; i++) {
+       /* 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;
+               }
        }
-    }
 
-    exit(0);
+       /* sort it */
+       qsort(lines, nlines, sizeof(char *), compare);
+
+       /* 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;
 }
-
-/* $Date: 1999/12/21 20:00:35 $ */
-/* $Id: sort.c,v 1.1 1999/12/21 20:00:35 beppu Exp $ */