blob: efff6b65387c922f4df8d0339489edcb4e6462b4 [file] [log] [blame]
Erik Andersene49d5ec2000-02-08 19:58:47 +00001/* vi: set sw=4 ts=4: */
John Beppuc0ca4731999-12-21 20:00:35 +00002/*
John Beppu568cb7b1999-12-22 23:02:12 +00003 * Mini sort implementation for busybox
John Beppuc0ca4731999-12-21 20:00:35 +00004 *
5 *
Matt Kraai5e8c0ff2000-12-20 20:49:56 +00006 * Copyright (C) 2000 by Matt Kraai <kraai@alumni.carnegiemellon.edu>
John Beppuc0ca4731999-12-21 20:00:35 +00007 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 *
22 */
23
Eric Andersen3570a342000-09-25 21:45:58 +000024#include "busybox.h"
John Beppuc0ca4731999-12-21 20:00:35 +000025
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000026int compare_ascii(const void *x, const void *y)
John Beppuc0ca4731999-12-21 20:00:35 +000027{
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000028 return strcmp(*(char **)x, *(char **)y);
John Beppu38efa791999-12-22 00:30:29 +000029}
30
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000031int compare_numeric(const void *x, const void *y)
John Beppu38efa791999-12-22 00:30:29 +000032{
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000033 return atoi(*(char **)x) - atoi(*(char **)y);
John Beppuc0ca4731999-12-21 20:00:35 +000034}
35
Erik Andersene49d5ec2000-02-08 19:58:47 +000036int sort_main(int argc, char **argv)
John Beppuc0ca4731999-12-21 20:00:35 +000037{
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000038 FILE *fp;
39 char *line, **lines = NULL;
40 int i, opt, nlines = 0;
41 int (*compare)(const void *, const void *) = compare_ascii;
42#ifdef BB_FEATURE_SORT_REVERSE
43 int reverse = FALSE;
44#endif
John Beppuc0ca4731999-12-21 20:00:35 +000045
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000046 while ((opt = getopt(argc, argv, "nr")) != -1) {
47 switch (opt) {
Erik Andersene49d5ec2000-02-08 19:58:47 +000048 case 'n':
Erik Andersene49d5ec2000-02-08 19:58:47 +000049 compare = compare_numeric;
50 break;
Erik Andersen029011b2000-03-04 21:19:32 +000051#ifdef BB_FEATURE_SORT_REVERSE
Erik Andersene49d5ec2000-02-08 19:58:47 +000052 case 'r':
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000053 reverse = TRUE;
Erik Andersene49d5ec2000-02-08 19:58:47 +000054 break;
Erik Andersen029011b2000-03-04 21:19:32 +000055#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +000056 default:
Erik Andersene49d5ec2000-02-08 19:58:47 +000057 usage(sort_usage);
Erik Andersene49d5ec2000-02-08 19:58:47 +000058 }
59 }
60
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000061 /* read the input */
62 for (i = optind; i == optind || i < argc; i++) {
63 if (argv[i] == NULL)
64 fp = stdin;
65 else
66 fp = xfopen(argv[i], "r");
John Beppu8d369e92000-09-28 17:49:59 +000067
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000068 while ((line = get_line_from_file(fp)) != NULL) {
69 lines = xrealloc(lines, sizeof(char *) * (nlines + 1));
70 lines[nlines++] = line;
Erik Andersene49d5ec2000-02-08 19:58:47 +000071 }
John Beppuc0ca4731999-12-21 20:00:35 +000072 }
John Beppuc0ca4731999-12-21 20:00:35 +000073
Matt Kraai5e8c0ff2000-12-20 20:49:56 +000074 /* sort it */
75 qsort(lines, nlines, sizeof(char *), compare);
76
77 /* print it */
78#ifdef BB_FEATURE_SORT_REVERSE
79 if (reverse)
80 for (i = nlines - 1; 0 <= i; i--)
81 fputs(lines[i], stdout);
82 else
83#endif
84 for (i = 0; i < nlines; i++)
85 fputs(lines[i], stdout);
86 return EXIT_SUCCESS;
John Beppuc0ca4731999-12-21 20:00:35 +000087}