1999-12-22 01:30:35 +05:30
|
|
|
/*
|
1999-12-23 04:32:12 +05:30
|
|
|
* Mini sort implementation for busybox
|
1999-12-22 01:30:35 +05:30
|
|
|
*
|
|
|
|
*
|
|
|
|
* Copyright (C) 1999 by Lineo, inc.
|
|
|
|
* Written by John Beppu <beppu@lineo.com>
|
|
|
|
*
|
|
|
|
* 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
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "internal.h"
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <dirent.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
|
|
|
static const char sort_usage[] =
|
|
|
|
"Usage: sort [OPTION]... [FILE]...\n\n"
|
|
|
|
;
|
|
|
|
|
1999-12-23 03:54:52 +05:30
|
|
|
/* typedefs _______________________________________________________________ */
|
1999-12-22 01:30:35 +05:30
|
|
|
|
|
|
|
/* line node */
|
1999-12-23 03:54:52 +05:30
|
|
|
typedef struct Line {
|
|
|
|
char *data; /* line data */
|
|
|
|
struct Line *next; /* pointer to next line node */
|
1999-12-22 01:30:35 +05:30
|
|
|
} Line;
|
|
|
|
|
|
|
|
/* singly-linked list of lines */
|
|
|
|
typedef struct {
|
1999-12-23 03:54:52 +05:30
|
|
|
int len; /* number of Lines */
|
|
|
|
Line **sorted; /* array fed to qsort */
|
1999-12-22 06:00:29 +05:30
|
|
|
|
1999-12-23 03:54:52 +05:30
|
|
|
Line *head; /* head of List */
|
|
|
|
Line *current; /* current Line */
|
1999-12-22 01:30:35 +05:30
|
|
|
} List;
|
|
|
|
|
1999-12-23 03:54:52 +05:30
|
|
|
/* comparison function */
|
|
|
|
typedef int (Compare)(const void *, const void *);
|
|
|
|
|
1999-12-22 01:30:35 +05:30
|
|
|
|
1999-12-22 06:00:29 +05:30
|
|
|
/* methods ________________________________________________________________ */
|
1999-12-22 01:30:35 +05:30
|
|
|
|
|
|
|
static const int max = 1024;
|
|
|
|
|
1999-12-22 06:00:29 +05:30
|
|
|
/* mallocate Line */
|
1999-12-22 01:30:35 +05:30
|
|
|
static Line *
|
1999-12-22 06:00:29 +05:30
|
|
|
line_alloc()
|
1999-12-22 01:30:35 +05:30
|
|
|
{
|
1999-12-22 06:00:29 +05:30
|
|
|
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; }
|
|
|
|
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; }
|
|
|
|
line_init(self, buffer);
|
|
|
|
return self;
|
|
|
|
}
|
|
|
|
return NULL;
|
1999-12-22 01:30:35 +05:30
|
|
|
}
|
|
|
|
|
1999-12-22 23:27:31 +05:30
|
|
|
/* Line destructor */
|
|
|
|
static Line *
|
|
|
|
line_release(Line *self)
|
|
|
|
{
|
|
|
|
if (self->data) {
|
|
|
|
free(self->data);
|
|
|
|
free(self);
|
|
|
|
}
|
|
|
|
return self;
|
|
|
|
}
|
|
|
|
|
1999-12-22 01:30:35 +05:30
|
|
|
|
|
|
|
/* Comparison */
|
|
|
|
|
1999-12-23 04:32:12 +05:30
|
|
|
/* ascii order */
|
1999-12-22 01:30:35 +05:30
|
|
|
static int
|
1999-12-23 03:54:52 +05:30
|
|
|
compare_ascii(const void *a, const void *b)
|
|
|
|
{
|
1999-12-23 04:32:12 +05:30
|
|
|
Line **doh;
|
|
|
|
Line *x, *y;
|
|
|
|
|
|
|
|
doh = (Line **) a;
|
1999-12-23 05:32:49 +05:30
|
|
|
x = *doh;
|
1999-12-23 04:32:12 +05:30
|
|
|
doh = (Line **) b;
|
1999-12-23 05:32:49 +05:30
|
|
|
y = *doh;
|
1999-12-23 04:32:12 +05:30
|
|
|
|
|
|
|
// fprintf(stdout, "> %p: %s< %p: %s", x, x->data, y, y->data);
|
|
|
|
return strcmp(x->data, y->data);
|
1999-12-23 03:54:52 +05:30
|
|
|
}
|
1999-12-22 01:30:35 +05:30
|
|
|
|
1999-12-23 04:32:12 +05:30
|
|
|
/* numeric order */
|
1999-12-22 01:30:35 +05:30
|
|
|
static int
|
1999-12-23 03:54:52 +05:30
|
|
|
compare_numeric(const void *a, const void *b)
|
|
|
|
{
|
1999-12-23 05:32:49 +05:30
|
|
|
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);
|
1999-12-23 03:54:52 +05:30
|
|
|
}
|
1999-12-22 01:30:35 +05:30
|
|
|
|
|
|
|
|
|
|
|
/* List */
|
|
|
|
|
1999-12-22 06:00:29 +05:30
|
|
|
/* */
|
|
|
|
static List *
|
|
|
|
list_init(List *self)
|
|
|
|
{
|
|
|
|
self->len = 0;
|
|
|
|
self->sorted = NULL;
|
|
|
|
self->head = NULL;
|
|
|
|
self->current = NULL;
|
|
|
|
return self;
|
|
|
|
}
|
1999-12-22 01:30:35 +05:30
|
|
|
|
1999-12-22 06:00:29 +05:30
|
|
|
/* for simplicity, the List gains ownership of the line */
|
1999-12-23 03:54:52 +05:30
|
|
|
static List *
|
1999-12-22 06:00:29 +05:30
|
|
|
list_insert(List *self, Line *line)
|
|
|
|
{
|
|
|
|
if (line == NULL) { return NULL; }
|
1999-12-22 01:30:35 +05:30
|
|
|
|
1999-12-22 06:00:29 +05:30
|
|
|
/* first insertion */
|
|
|
|
if (self->head == NULL) {
|
|
|
|
self->head = line;
|
|
|
|
self->current = line;
|
|
|
|
|
|
|
|
/* all subsequent insertions */
|
|
|
|
} else {
|
1999-12-23 03:54:52 +05:30
|
|
|
self->current->next = line;
|
1999-12-22 06:00:29 +05:30
|
|
|
self->current = line;
|
|
|
|
}
|
|
|
|
self->len++;
|
|
|
|
return self;
|
|
|
|
}
|
1999-12-22 01:30:35 +05:30
|
|
|
|
1999-12-23 03:54:52 +05:30
|
|
|
/* order the list according to compare() */
|
1999-12-22 06:00:29 +05:30
|
|
|
static List *
|
1999-12-23 03:54:52 +05:30
|
|
|
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 */
|
1999-12-23 04:32:12 +05:30
|
|
|
qsort(self->sorted, self->len, sizeof(Line*), compare);
|
1999-12-23 03:54:52 +05:30
|
|
|
return self;
|
|
|
|
}
|
1999-12-22 06:00:29 +05:30
|
|
|
|
|
|
|
/* precondition: list must be sorted */
|
|
|
|
static List *
|
|
|
|
list_writeToFile(List *self, FILE* dst)
|
|
|
|
{
|
1999-12-23 03:54:52 +05:30
|
|
|
int i;
|
|
|
|
Line **line = self->sorted;
|
|
|
|
|
1999-12-22 06:00:29 +05:30
|
|
|
if (self->sorted == NULL) { return NULL; }
|
1999-12-23 03:54:52 +05:30
|
|
|
for (i = 0; i < self->len; i++) {
|
|
|
|
fprintf(dst, "%s", line[i]->data);
|
|
|
|
}
|
|
|
|
return self;
|
1999-12-22 06:00:29 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
/* deallocate */
|
1999-12-23 03:54:52 +05:30
|
|
|
static void
|
1999-12-22 06:00:29 +05:30
|
|
|
list_release(List *self)
|
|
|
|
{
|
1999-12-22 23:27:31 +05:30
|
|
|
Line *i;
|
|
|
|
Line *die;
|
|
|
|
|
|
|
|
i = self->head;
|
|
|
|
while (i) {
|
|
|
|
die = i;
|
|
|
|
i = die->next;
|
1999-12-23 03:54:52 +05:30
|
|
|
line_release(die);
|
1999-12-22 23:27:31 +05:30
|
|
|
}
|
1999-12-22 06:00:29 +05:30
|
|
|
}
|
1999-12-22 01:30:35 +05:30
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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)
|
|
|
|
{
|
1999-12-23 03:54:52 +05:30
|
|
|
int i;
|
|
|
|
char opt;
|
|
|
|
List list;
|
|
|
|
Line *l;
|
1999-12-23 05:32:49 +05:30
|
|
|
Compare *compare;
|
1999-12-22 01:30:35 +05:30
|
|
|
|
1999-12-23 05:32:49 +05:30
|
|
|
/* init */
|
|
|
|
compare = compare_ascii;
|
|
|
|
list_init(&list);
|
1999-12-22 01:30:35 +05:30
|
|
|
|
|
|
|
/* parse argv[] */
|
|
|
|
for (i = 1; i < argc; i++) {
|
|
|
|
if (argv[i][0] == '-') {
|
|
|
|
opt = argv[i][1];
|
|
|
|
switch (opt) {
|
1999-12-23 05:32:49 +05:30
|
|
|
case 'g':
|
|
|
|
compare = compare_numeric;
|
|
|
|
break;
|
1999-12-22 01:30:35 +05:30
|
|
|
case 'h':
|
|
|
|
usage(sort_usage);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
fprintf(stderr, "sort: invalid option -- %c\n", opt);
|
|
|
|
usage(sort_usage);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* go through remaining args (if any) */
|
|
|
|
if (i >= argc) {
|
1999-12-23 03:54:52 +05:30
|
|
|
while ( (l = line_newFromFile(stdin))) {
|
|
|
|
list_insert(&list, l);
|
|
|
|
}
|
1999-12-23 05:32:49 +05:30
|
|
|
list_sort(&list, compare);
|
1999-12-23 03:54:52 +05:30
|
|
|
list_writeToFile(&list, stdout);
|
|
|
|
list_release(&list);
|
1999-12-22 01:30:35 +05:30
|
|
|
} else {
|
|
|
|
for ( ; i < argc; i++) {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
|
1999-12-23 05:32:49 +05:30
|
|
|
/* $Id: sort.c,v 1.7 1999/12/23 00:02:49 beppu Exp $ */
|
1999-12-23 03:57:01 +05:30
|
|
|
/*
|
|
|
|
* $Log: sort.c,v $
|
1999-12-23 05:32:49 +05:30
|
|
|
* Revision 1.7 1999/12/23 00:02:49 beppu
|
|
|
|
* implemented numeric sort (sort -g)
|
|
|
|
*
|
1999-12-23 04:32:12 +05:30
|
|
|
* Revision 1.6 1999/12/22 23:02:12 beppu
|
|
|
|
* oops.. qsort(2) misunderstanding on my part.
|
|
|
|
* it's ok, now.
|
|
|
|
*
|
1999-12-23 03:57:01 +05:30
|
|
|
* Revision 1.5 1999/12/22 22:27:01 beppu
|
1999-12-23 04:32:12 +05:30
|
|
|
* playing w/ $Log: sort.c,v $
|
1999-12-23 05:32:49 +05:30
|
|
|
* playing w/ Revision 1.7 1999/12/23 00:02:49 beppu
|
|
|
|
* playing w/ implemented numeric sort (sort -g)
|
|
|
|
* playing w/
|
1999-12-23 04:32:12 +05:30
|
|
|
* playing w/ Revision 1.6 1999/12/22 23:02:12 beppu
|
|
|
|
* playing w/ oops.. qsort(2) misunderstanding on my part.
|
|
|
|
* playing w/ it's ok, now.
|
|
|
|
* playing w/
|
1999-12-23 03:57:01 +05:30
|
|
|
*
|
|
|
|
*/
|