2000-02-08 19:58:47 +00:00
|
|
|
/* vi: set sw=4 ts=4: */
|
2000-01-06 00:48:21 +00:00
|
|
|
/*
|
2000-01-06 01:14:56 +00:00
|
|
|
* Mini uniq implementation for busybox
|
2000-01-06 00:48:21 +00:00
|
|
|
*
|
|
|
|
*
|
2001-01-27 09:33:39 +00:00
|
|
|
* Copyright (C) 1999,2000,2001 by Lineo, inc.
|
2000-01-06 00:48:21 +00:00
|
|
|
* Written by John Beppu <beppu@lineo.com>
|
2000-09-27 02:29:39 +00:00
|
|
|
* Rewritten by Matt Kraai <kraai@alumni.carnegiemellon.edu>
|
2000-01-06 00:48:21 +00:00
|
|
|
*
|
|
|
|
* 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 <stdio.h>
|
2000-01-06 23:49:21 +00:00
|
|
|
#include <string.h>
|
2001-01-27 08:24:39 +00:00
|
|
|
#include <getopt.h>
|
2000-01-06 23:49:21 +00:00
|
|
|
#include <errno.h>
|
2001-01-27 08:24:39 +00:00
|
|
|
#include <stdlib.h>
|
2001-02-20 06:14:08 +00:00
|
|
|
#include "busybox.h"
|
2000-01-06 00:48:21 +00:00
|
|
|
|
2000-12-09 16:37:53 +00:00
|
|
|
static int print_count;
|
|
|
|
static int print_uniq = 1;
|
|
|
|
static int print_duplicates = 1;
|
|
|
|
|
|
|
|
static void print_line(char *line, int count, FILE *fp)
|
|
|
|
{
|
|
|
|
if ((print_duplicates && count > 1) || (print_uniq && count == 1)) {
|
|
|
|
if (print_count)
|
|
|
|
fprintf(fp, "%7d\t%s", count, line);
|
|
|
|
else
|
|
|
|
fputs(line, fp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-02-08 19:58:47 +00:00
|
|
|
int uniq_main(int argc, char **argv)
|
2000-01-06 00:48:21 +00:00
|
|
|
{
|
2000-09-27 02:29:39 +00:00
|
|
|
FILE *in = stdin, *out = stdout;
|
|
|
|
char *lastline = NULL, *input;
|
2000-12-09 16:37:53 +00:00
|
|
|
int opt, count = 0;
|
2000-02-08 19:58:47 +00:00
|
|
|
|
|
|
|
/* parse argv[] */
|
2000-12-09 16:37:53 +00:00
|
|
|
while ((opt = getopt(argc, argv, "cdu")) > 0) {
|
|
|
|
switch (opt) {
|
|
|
|
case 'c':
|
|
|
|
print_count = 1;
|
|
|
|
break;
|
|
|
|
case 'd':
|
|
|
|
print_duplicates = 1;
|
|
|
|
print_uniq = 0;
|
|
|
|
break;
|
|
|
|
case 'u':
|
|
|
|
print_duplicates = 0;
|
|
|
|
print_uniq = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2000-01-06 00:48:21 +00:00
|
|
|
|
2000-12-09 16:37:53 +00:00
|
|
|
if (argv[optind] != NULL) {
|
|
|
|
in = xfopen(argv[optind], "r");
|
|
|
|
if (argv[optind+1] != NULL)
|
|
|
|
out = xfopen(argv[optind+1], "w");
|
2000-02-08 19:58:47 +00:00
|
|
|
}
|
2000-01-06 23:49:21 +00:00
|
|
|
|
2000-09-27 02:29:39 +00:00
|
|
|
while ((input = get_line_from_file(in)) != NULL) {
|
|
|
|
if (lastline == NULL || strcmp(input, lastline) != 0) {
|
2000-12-09 16:37:53 +00:00
|
|
|
print_line(lastline, count, out);
|
2000-09-27 02:29:39 +00:00
|
|
|
free(lastline);
|
|
|
|
lastline = input;
|
2000-12-09 16:37:53 +00:00
|
|
|
count = 0;
|
2000-09-27 02:29:39 +00:00
|
|
|
}
|
2000-12-09 16:37:53 +00:00
|
|
|
count++;
|
2000-02-08 19:58:47 +00:00
|
|
|
}
|
2000-12-09 16:37:53 +00:00
|
|
|
print_line(lastline, count, out);
|
2000-09-27 02:29:39 +00:00
|
|
|
free(lastline);
|
2000-01-06 23:49:21 +00:00
|
|
|
|
2000-09-27 02:29:39 +00:00
|
|
|
return EXIT_SUCCESS;
|
2000-01-06 00:48:21 +00:00
|
|
|
}
|