hush/findutils/grep.c

135 lines
2.7 KiB
C
Raw Normal View History

1999-10-05 16:24:54 +00:00
/*
* Mini grep implementation for busybox
1999-10-05 16:24:54 +00:00
*
1999-10-20 22:08:37 +00:00
*
* Copyright (C) 1999 by Lineo, inc.
* Written by Erik Andersen <andersen@lineo.com>, <andersee@debian.org>
*
* 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
1999-10-05 16:24:54 +00:00
*
*/
#include "internal.h"
1999-10-22 04:30:20 +00:00
#include "regexp.h"
1999-10-05 16:24:54 +00:00
#include <stdio.h>
#include <dirent.h>
#include <errno.h>
#include <fcntl.h>
#include <signal.h>
#include <time.h>
#include <ctype.h>
static const char grep_usage[] =
"grep [-ihn]... PATTERN [FILE]...\n"
"Search for PATTERN in each FILE or standard input.\n\n"
"\t-h\tsuppress the prefixing filename on output\n"
"\t-i\tignore case distinctions\n"
"\t-n\tprint line number with output lines\n\n"
1999-10-22 04:30:20 +00:00
#if defined BB_REGEXP
"This version of grep matches full regexps.\n";
#else
"This version of grep matches strings (not full regexps).\n";
1999-10-22 04:30:20 +00:00
#endif
1999-10-05 16:24:54 +00:00
1999-10-07 08:30:23 +00:00
extern int grep_main (int argc, char **argv)
1999-10-05 16:24:54 +00:00
{
1999-10-07 08:30:23 +00:00
FILE *fp;
const char *needle;
1999-10-07 08:30:23 +00:00
const char *name;
const char *cp;
int tellName=TRUE;
int ignoreCase=FALSE;
int tellLine=FALSE;
1999-10-07 08:30:23 +00:00
long line;
1999-10-22 04:30:20 +00:00
char haystack[BUF_SIZE];
1999-10-07 08:30:23 +00:00
ignoreCase = FALSE;
tellLine = FALSE;
argc--;
argv++;
if (argc < 1) {
usage(grep_usage);
1999-10-07 08:30:23 +00:00
}
if (**argv == '-') {
1999-10-05 16:24:54 +00:00
argc--;
1999-10-07 08:30:23 +00:00
cp = *argv++;
1999-10-05 16:24:54 +00:00
1999-10-07 08:30:23 +00:00
while (*++cp)
switch (*cp) {
case 'i':
ignoreCase = TRUE;
break;
1999-10-05 16:24:54 +00:00
case 'h':
tellName = FALSE;
break;
1999-10-07 08:30:23 +00:00
case 'n':
tellLine = TRUE;
break;
1999-10-05 16:24:54 +00:00
1999-10-07 08:30:23 +00:00
default:
usage(grep_usage);
1999-10-07 08:30:23 +00:00
}
}
1999-10-05 16:24:54 +00:00
needle = *argv++;
1999-10-07 08:30:23 +00:00
argc--;
1999-10-05 16:24:54 +00:00
1999-10-07 08:30:23 +00:00
while (argc-- > 0) {
name = *argv++;
1999-10-05 16:24:54 +00:00
1999-10-07 08:30:23 +00:00
fp = fopen (name, "r");
if (fp == NULL) {
perror (name);
continue;
}
1999-10-05 16:24:54 +00:00
1999-10-07 08:30:23 +00:00
line = 0;
1999-10-05 16:24:54 +00:00
1999-10-22 04:30:20 +00:00
while (fgets (haystack, sizeof (haystack), fp)) {
1999-10-07 08:30:23 +00:00
line++;
1999-10-22 04:30:20 +00:00
cp = &haystack[strlen (haystack) - 1];
1999-10-05 16:24:54 +00:00
1999-10-07 08:30:23 +00:00
if (*cp != '\n')
fprintf (stderr, "%s: Line too long\n", name);
1999-10-05 16:24:54 +00:00
1999-10-22 04:30:20 +00:00
if (find_match(haystack, needle, ignoreCase) == TRUE) {
if (tellName==TRUE)
1999-10-07 08:30:23 +00:00
printf ("%s: ", name);
1999-10-05 16:24:54 +00:00
if (tellLine==TRUE)
1999-10-07 08:30:23 +00:00
printf ("%ld: ", line);
1999-10-05 16:24:54 +00:00
1999-10-22 04:30:20 +00:00
fputs (haystack, stdout);
1999-10-07 08:30:23 +00:00
}
1999-10-05 16:24:54 +00:00
}
1999-10-07 08:30:23 +00:00
if (ferror (fp))
perror (name);
fclose (fp);
}
exit( TRUE);
1999-10-05 16:24:54 +00:00
}
1999-10-12 22:26:06 +00:00
/* END CODE */
1999-10-07 08:30:23 +00:00
1999-10-05 16:24:54 +00:00