1999-11-20 09:40:28 +00:00
|
|
|
/* grep.c - main driver file for grep.
|
1999-11-21 01:02:48 +00:00
|
|
|
Copyright (C) 1992, 1997, 1998, 1999 Free Software Foundation, Inc.
|
1999-11-20 09:40:28 +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, 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
|
1999-11-21 01:02:48 +00:00
|
|
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
|
|
|
02111-1307, USA. */
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Written July 1992 by Mike Haertel. */
|
|
|
|
/* Builtin decompression 1997 by Wolfram Schneider <wosch@FreeBSD.org>. */
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* $FreeBSD$ */
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include <config.h>
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
|
|
|
#include <sys/types.h>
|
1999-11-21 01:02:48 +00:00
|
|
|
#include <sys/stat.h>
|
|
|
|
#if defined(HAVE_MMAP)
|
|
|
|
# include <sys/mman.h>
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
1999-11-21 01:02:48 +00:00
|
|
|
#if defined(HAVE_SETRLIMIT)
|
|
|
|
# include <sys/time.h>
|
|
|
|
# include <sys/resource.h>
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
1999-11-21 01:02:48 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include "system.h"
|
|
|
|
#include "getopt.h"
|
1999-11-20 09:40:28 +00:00
|
|
|
#include "getpagesize.h"
|
|
|
|
#include "grep.h"
|
1999-11-21 01:02:48 +00:00
|
|
|
#include "savedir.h"
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
#undef MAX
|
|
|
|
#define MAX(A,B) ((A) > (B) ? (A) : (B))
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
struct stats
|
|
|
|
{
|
|
|
|
struct stats *parent;
|
|
|
|
struct stat stat;
|
|
|
|
};
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* base of chain of stat buffers, used to detect directory loops */
|
|
|
|
static struct stats stats_base;
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* if non-zero, display usage information and exit */
|
|
|
|
static int show_help;
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* If non-zero, print the version on standard output and exit. */
|
|
|
|
static int show_version;
|
1999-11-20 09:40:28 +00:00
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
/* If nonzero, use mmap if possible. */
|
|
|
|
static int mmap_option;
|
|
|
|
|
2000-01-04 10:32:55 +00:00
|
|
|
/* If zero, output nulls after filenames. */
|
|
|
|
static int filename_mask;
|
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
/* Short options. */
|
|
|
|
static char const short_options[] =
|
2000-05-30 10:50:15 +00:00
|
|
|
"0123456789A:B:C::EFGHIRUVX:abcd:e:f:hiLlnqrsuvwxyZz";
|
2000-01-04 03:25:40 +00:00
|
|
|
|
2000-01-18 09:46:39 +00:00
|
|
|
/* Non-boolean long options that have no corresponding short equivalents. */
|
|
|
|
enum
|
|
|
|
{
|
|
|
|
BINARY_FILES_OPTION = CHAR_MAX + 1
|
|
|
|
};
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Long options equivalences. */
|
|
|
|
static struct option long_options[] =
|
|
|
|
{
|
|
|
|
{"after-context", required_argument, NULL, 'A'},
|
|
|
|
{"basic-regexp", no_argument, NULL, 'G'},
|
|
|
|
{"before-context", required_argument, NULL, 'B'},
|
2000-01-18 09:46:39 +00:00
|
|
|
{"binary-files", required_argument, NULL, BINARY_FILES_OPTION},
|
1999-11-21 01:02:48 +00:00
|
|
|
{"byte-offset", no_argument, NULL, 'b'},
|
|
|
|
{"context", optional_argument, NULL, 'C'},
|
|
|
|
{"count", no_argument, NULL, 'c'},
|
|
|
|
{"directories", required_argument, NULL, 'd'},
|
|
|
|
{"extended-regexp", no_argument, NULL, 'E'},
|
|
|
|
{"file", required_argument, NULL, 'f'},
|
|
|
|
{"files-with-matches", no_argument, NULL, 'l'},
|
|
|
|
{"files-without-match", no_argument, NULL, 'L'},
|
|
|
|
{"fixed-regexp", no_argument, NULL, 'F'},
|
|
|
|
{"fixed-strings", no_argument, NULL, 'F'},
|
|
|
|
{"help", no_argument, &show_help, 1},
|
|
|
|
{"ignore-case", no_argument, NULL, 'i'},
|
|
|
|
{"line-number", no_argument, NULL, 'n'},
|
|
|
|
{"line-regexp", no_argument, NULL, 'x'},
|
2000-01-04 03:25:40 +00:00
|
|
|
{"mmap", no_argument, &mmap_option, 1},
|
1999-11-21 01:02:48 +00:00
|
|
|
{"no-filename", no_argument, NULL, 'h'},
|
|
|
|
{"no-messages", no_argument, NULL, 's'},
|
2002-09-16 04:27:29 +00:00
|
|
|
{"bz2decompress", no_argument, NULL, 'J'},
|
2000-01-04 03:25:40 +00:00
|
|
|
#if HAVE_LIBZ > 0
|
2000-01-04 10:32:55 +00:00
|
|
|
{"decompress", no_argument, NULL, 'Z'},
|
|
|
|
{"null", no_argument, &filename_mask, 0},
|
2000-01-04 03:25:40 +00:00
|
|
|
#else
|
|
|
|
{"null", no_argument, NULL, 'Z'},
|
|
|
|
#endif
|
|
|
|
{"null-data", no_argument, NULL, 'z'},
|
1999-11-21 01:02:48 +00:00
|
|
|
{"quiet", no_argument, NULL, 'q'},
|
|
|
|
{"recursive", no_argument, NULL, 'r'},
|
|
|
|
{"regexp", required_argument, NULL, 'e'},
|
2000-01-04 03:25:40 +00:00
|
|
|
{"invert-match", no_argument, NULL, 'v'},
|
1999-11-21 01:02:48 +00:00
|
|
|
{"silent", no_argument, NULL, 'q'},
|
|
|
|
{"text", no_argument, NULL, 'a'},
|
|
|
|
{"binary", no_argument, NULL, 'U'},
|
|
|
|
{"unix-byte-offsets", no_argument, NULL, 'u'},
|
|
|
|
{"version", no_argument, NULL, 'V'},
|
|
|
|
{"with-filename", no_argument, NULL, 'H'},
|
|
|
|
{"word-regexp", no_argument, NULL, 'w'},
|
|
|
|
{0, 0, 0, 0}
|
|
|
|
};
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
/* Define flags declared in grep.h. */
|
1999-11-21 01:02:48 +00:00
|
|
|
char const *matcher;
|
1999-11-20 09:40:28 +00:00
|
|
|
int match_icase;
|
|
|
|
int match_words;
|
|
|
|
int match_lines;
|
2000-01-04 03:25:40 +00:00
|
|
|
unsigned char eolbyte;
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
/* For error messages. */
|
|
|
|
static char *prog;
|
1999-11-21 01:02:48 +00:00
|
|
|
static char const *filename;
|
1999-11-20 09:40:28 +00:00
|
|
|
static int errseen;
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* How to handle directories. */
|
|
|
|
static enum
|
|
|
|
{
|
|
|
|
READ_DIRECTORIES,
|
|
|
|
RECURSE_DIRECTORIES,
|
|
|
|
SKIP_DIRECTORIES
|
|
|
|
} directories;
|
|
|
|
|
|
|
|
static int ck_atoi PARAMS ((char const *, int *));
|
|
|
|
static void usage PARAMS ((int)) __attribute__((noreturn));
|
|
|
|
static void error PARAMS ((const char *, int));
|
2000-01-04 03:25:40 +00:00
|
|
|
static void setmatcher PARAMS ((char const *));
|
|
|
|
static int install_matcher PARAMS ((char const *));
|
|
|
|
static int prepend_args PARAMS ((char const *, char *, char **));
|
|
|
|
static void prepend_default_options PARAMS ((char const *, int *, char ***));
|
1999-11-21 01:02:48 +00:00
|
|
|
static char *page_alloc PARAMS ((size_t, char **));
|
|
|
|
static int reset PARAMS ((int, char const *, struct stats *));
|
|
|
|
static int fillbuf PARAMS ((size_t, struct stats *));
|
|
|
|
static int grepbuf PARAMS ((char *, char *));
|
|
|
|
static void prtext PARAMS ((char *, char *, int *));
|
|
|
|
static void prpending PARAMS ((char *));
|
|
|
|
static void prline PARAMS ((char *, char *, int));
|
|
|
|
static void print_offset_sep PARAMS ((off_t, int));
|
|
|
|
static void nlscan PARAMS ((char *));
|
|
|
|
static int grep PARAMS ((int, char const *, struct stats *));
|
|
|
|
static int grepdir PARAMS ((char const *, struct stats *));
|
|
|
|
static int grepfile PARAMS ((char const *, struct stats *));
|
|
|
|
#if O_BINARY
|
|
|
|
static inline int undossify_input PARAMS ((register char *, size_t));
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Functions we'll use to search. */
|
|
|
|
static void (*compile) PARAMS ((char *, size_t));
|
|
|
|
static char *(*execute) PARAMS ((char *, size_t, char **));
|
|
|
|
|
1999-11-20 09:40:28 +00:00
|
|
|
/* Print a message and possibly an error string. Remember
|
|
|
|
that something awful happened. */
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
error (const char *mesg, int errnum)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
if (errnum)
|
1999-11-21 01:02:48 +00:00
|
|
|
fprintf (stderr, "%s: %s: %s\n", prog, mesg, strerror (errnum));
|
1999-11-20 09:40:28 +00:00
|
|
|
else
|
1999-11-21 01:02:48 +00:00
|
|
|
fprintf (stderr, "%s: %s\n", prog, mesg);
|
1999-11-20 09:40:28 +00:00
|
|
|
errseen = 1;
|
|
|
|
}
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Like error (), but die horribly after printing. */
|
1999-11-20 09:40:28 +00:00
|
|
|
void
|
2000-01-31 13:28:57 +00:00
|
|
|
fatal (const char *mesg, int errnum)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
error (mesg, errnum);
|
|
|
|
exit (2);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Interface to handle errors and fix library lossage. */
|
|
|
|
char *
|
2000-01-31 13:28:57 +00:00
|
|
|
xmalloc (size_t size)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
char *result;
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
result = malloc (size);
|
1999-11-20 09:40:28 +00:00
|
|
|
if (size && !result)
|
1999-11-21 01:02:48 +00:00
|
|
|
fatal (_("memory exhausted"), 0);
|
1999-11-20 09:40:28 +00:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Interface to handle errors and fix some library lossage. */
|
|
|
|
char *
|
2000-01-31 13:28:57 +00:00
|
|
|
xrealloc (char *ptr, size_t size)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
char *result;
|
|
|
|
|
|
|
|
if (ptr)
|
1999-11-21 01:02:48 +00:00
|
|
|
result = realloc (ptr, size);
|
1999-11-20 09:40:28 +00:00
|
|
|
else
|
1999-11-21 01:02:48 +00:00
|
|
|
result = malloc (size);
|
1999-11-20 09:40:28 +00:00
|
|
|
if (size && !result)
|
1999-11-21 01:02:48 +00:00
|
|
|
fatal (_("memory exhausted"), 0);
|
1999-11-20 09:40:28 +00:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Convert STR to a positive integer, storing the result in *OUT.
|
|
|
|
If STR is not a valid integer, return -1 (otherwise 0). */
|
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
ck_atoi (char const *str, int *out)
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
|
|
|
char const *p;
|
|
|
|
for (p = str; *p; p++)
|
|
|
|
if (*p < '0' || *p > '9')
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
*out = atoi (optarg);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
/* Hairy buffering mechanism for grep. The intent is to keep
|
|
|
|
all reads aligned on a page boundary and multiples of the
|
|
|
|
page size. */
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
static char *ubuffer; /* Unaligned base of buffer. */
|
1999-11-20 09:40:28 +00:00
|
|
|
static char *buffer; /* Base of buffer. */
|
|
|
|
static size_t bufsalloc; /* Allocated size of buffer save region. */
|
|
|
|
static size_t bufalloc; /* Total buffer size. */
|
2000-01-04 03:25:40 +00:00
|
|
|
#define PREFERRED_SAVE_FACTOR 5 /* Preferred value of bufalloc / bufsalloc. */
|
1999-11-20 09:40:28 +00:00
|
|
|
static int bufdesc; /* File descriptor. */
|
|
|
|
static char *bufbeg; /* Beginning of user-visible stuff. */
|
|
|
|
static char *buflim; /* Limit of user-visible stuff. */
|
1999-11-21 01:02:48 +00:00
|
|
|
static size_t pagesize; /* alignment of memory pages */
|
2000-01-04 03:25:40 +00:00
|
|
|
static off_t bufoffset; /* Read offset; defined on regular files. */
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
#if defined(HAVE_MMAP)
|
2000-01-04 03:25:40 +00:00
|
|
|
static int bufmapped; /* True if buffer is memory-mapped. */
|
1999-11-21 01:02:48 +00:00
|
|
|
static off_t initial_bufoffset; /* Initial value of bufoffset. */
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
|
|
|
|
2002-09-16 04:27:29 +00:00
|
|
|
#include <bzlib.h>
|
|
|
|
static BZFILE* bzbufdesc; /* libbz2 file handle. */
|
|
|
|
static int BZflag; /* uncompress before searching. */
|
1999-11-20 09:40:28 +00:00
|
|
|
#if HAVE_LIBZ > 0
|
|
|
|
#include <zlib.h>
|
1999-11-21 01:02:48 +00:00
|
|
|
static gzFile gzbufdesc; /* zlib file descriptor. */
|
|
|
|
static int Zflag; /* uncompress before searching. */
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Return VAL aligned to the next multiple of ALIGNMENT. VAL can be
|
|
|
|
an integer or a pointer. Both args must be free of side effects. */
|
|
|
|
#define ALIGN_TO(val, alignment) \
|
|
|
|
((size_t) (val) % (alignment) == 0 \
|
|
|
|
? (val) \
|
|
|
|
: (val) + ((alignment) - (size_t) (val) % (alignment)))
|
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
/* Return the address of a page-aligned buffer of size SIZE,
|
|
|
|
reallocating it from *UP. Set *UP to the newly allocated (but
|
|
|
|
possibly unaligned) buffer used to build the aligned buffer. To
|
|
|
|
free the buffer, free (*UP). */
|
1999-11-21 01:02:48 +00:00
|
|
|
static char *
|
2000-01-31 13:28:57 +00:00
|
|
|
page_alloc (size_t size, char **up)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
size_t asize = size + pagesize - 1;
|
|
|
|
if (size <= asize)
|
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
char *p = *up ? realloc (*up, asize) : malloc (asize);
|
|
|
|
if (p)
|
|
|
|
{
|
|
|
|
*up = p;
|
|
|
|
return ALIGN_TO (p, pagesize);
|
|
|
|
}
|
1999-11-21 01:02:48 +00:00
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Reset the buffer for a new file, returning zero if we should skip it.
|
|
|
|
Initialize on the first time through. */
|
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
reset (int fd, char const *file, struct stats *stats)
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
if (pagesize)
|
|
|
|
bufsalloc = ALIGN_TO (bufalloc / PREFERRED_SAVE_FACTOR, pagesize);
|
|
|
|
else
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
size_t ubufsalloc;
|
|
|
|
pagesize = getpagesize ();
|
|
|
|
if (pagesize == 0)
|
|
|
|
abort ();
|
1999-11-20 09:40:28 +00:00
|
|
|
#ifndef BUFSALLOC
|
1999-11-21 01:02:48 +00:00
|
|
|
ubufsalloc = MAX (8192, pagesize);
|
1999-11-20 09:40:28 +00:00
|
|
|
#else
|
1999-11-21 01:02:48 +00:00
|
|
|
ubufsalloc = BUFSALLOC;
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
1999-11-21 01:02:48 +00:00
|
|
|
bufsalloc = ALIGN_TO (ubufsalloc, pagesize);
|
2000-01-04 03:25:40 +00:00
|
|
|
bufalloc = PREFERRED_SAVE_FACTOR * bufsalloc;
|
1999-11-20 09:40:28 +00:00
|
|
|
/* The 1 byte of overflow is a kludge for dfaexec(), which
|
|
|
|
inserts a sentinel newline at the end of the buffer
|
|
|
|
being searched. There's gotta be a better way... */
|
1999-11-21 01:02:48 +00:00
|
|
|
if (bufsalloc < ubufsalloc
|
2000-01-04 03:25:40 +00:00
|
|
|
|| bufalloc / PREFERRED_SAVE_FACTOR != bufsalloc
|
|
|
|
|| bufalloc + 1 < bufalloc
|
1999-11-21 01:02:48 +00:00
|
|
|
|| ! (buffer = page_alloc (bufalloc + 1, &ubuffer)))
|
|
|
|
fatal (_("memory exhausted"), 0);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
2002-09-16 04:27:29 +00:00
|
|
|
if (BZflag)
|
|
|
|
{
|
|
|
|
bzbufdesc = BZ2_bzdopen(fd, "r");
|
|
|
|
if (bzbufdesc == NULL)
|
|
|
|
fatal(_("memory exhausted"), 0);
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
#if HAVE_LIBZ > 0
|
2000-01-04 03:25:40 +00:00
|
|
|
if (Zflag)
|
|
|
|
{
|
1999-11-20 09:40:28 +00:00
|
|
|
gzbufdesc = gzdopen(fd, "r");
|
1999-11-21 01:02:48 +00:00
|
|
|
if (gzbufdesc == NULL)
|
|
|
|
fatal(_("memory exhausted"), 0);
|
2000-01-04 03:25:40 +00:00
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
2000-01-04 03:25:40 +00:00
|
|
|
|
|
|
|
buflim = buffer;
|
1999-11-21 01:02:48 +00:00
|
|
|
bufdesc = fd;
|
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
if (fstat (fd, &stats->stat) != 0)
|
|
|
|
{
|
|
|
|
error ("fstat", errno);
|
|
|
|
return 0;
|
|
|
|
}
|
1999-11-21 01:02:48 +00:00
|
|
|
if (directories == SKIP_DIRECTORIES && S_ISDIR (stats->stat.st_mode))
|
|
|
|
return 0;
|
1999-11-20 09:40:28 +00:00
|
|
|
if (
|
2002-09-16 04:27:29 +00:00
|
|
|
BZflag ||
|
1999-11-20 09:40:28 +00:00
|
|
|
#if HAVE_LIBZ > 0
|
1999-11-21 01:02:48 +00:00
|
|
|
Zflag ||
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
2000-01-04 03:25:40 +00:00
|
|
|
S_ISREG (stats->stat.st_mode))
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
if (file)
|
|
|
|
bufoffset = 0;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
bufoffset = lseek (fd, 0, SEEK_CUR);
|
|
|
|
if (bufoffset < 0)
|
|
|
|
{
|
|
|
|
error ("lseek", errno);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#ifdef HAVE_MMAP
|
|
|
|
initial_bufoffset = bufoffset;
|
|
|
|
bufmapped = mmap_option && bufoffset % pagesize == 0;
|
|
|
|
#endif
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
2000-01-04 03:25:40 +00:00
|
|
|
else
|
|
|
|
{
|
|
|
|
#ifdef HAVE_MMAP
|
|
|
|
bufmapped = 0;
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
2000-01-04 03:25:40 +00:00
|
|
|
}
|
1999-11-21 01:02:48 +00:00
|
|
|
return 1;
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Read new stuff into the buffer, saving the specified
|
|
|
|
amount of old stuff. When we're done, 'bufbeg' points
|
|
|
|
to the beginning of the buffer contents, and 'buflim'
|
2000-01-04 03:25:40 +00:00
|
|
|
points just after the end. Return zero if there's an error. */
|
1999-11-20 09:40:28 +00:00
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
fillbuf (size_t save, struct stats *stats)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
size_t fillsize = 0;
|
|
|
|
int cc = 1;
|
|
|
|
size_t readsize;
|
1999-11-20 09:40:28 +00:00
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
/* Offset from start of unaligned buffer to start of old stuff
|
|
|
|
that we want to save. */
|
|
|
|
size_t saved_offset = buflim - ubuffer - save;
|
1999-11-21 01:02:48 +00:00
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
if (bufsalloc < save)
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
size_t aligned_save = ALIGN_TO (save, pagesize);
|
|
|
|
size_t maxalloc = (size_t) -1;
|
|
|
|
size_t newalloc;
|
|
|
|
|
|
|
|
if (S_ISREG (stats->stat.st_mode))
|
|
|
|
{
|
|
|
|
/* Calculate an upper bound on how much memory we should allocate.
|
|
|
|
We can't use ALIGN_TO here, since off_t might be longer than
|
|
|
|
size_t. Watch out for arithmetic overflow. */
|
|
|
|
off_t to_be_read = stats->stat.st_size - bufoffset;
|
|
|
|
size_t slop = to_be_read % pagesize;
|
|
|
|
off_t aligned_to_be_read = to_be_read + (slop ? pagesize - slop : 0);
|
|
|
|
off_t maxalloc_off = aligned_save + aligned_to_be_read;
|
|
|
|
if (0 <= maxalloc_off && maxalloc_off == (size_t) maxalloc_off)
|
|
|
|
maxalloc = maxalloc_off;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Grow bufsalloc until it is at least as great as `save'; but
|
|
|
|
if there is an overflow, just grow it to the next page boundary. */
|
|
|
|
while (bufsalloc < save)
|
|
|
|
if (bufsalloc < bufsalloc * 2)
|
|
|
|
bufsalloc *= 2;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
bufsalloc = aligned_save;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Grow the buffer size to be PREFERRED_SAVE_FACTOR times
|
|
|
|
bufsalloc.... */
|
|
|
|
newalloc = PREFERRED_SAVE_FACTOR * bufsalloc;
|
|
|
|
if (maxalloc < newalloc)
|
|
|
|
{
|
|
|
|
/* ... except don't grow it more than a pagesize past the
|
|
|
|
file size, as that might cause unnecessary memory
|
|
|
|
exhaustion if the file is large. */
|
|
|
|
newalloc = maxalloc;
|
|
|
|
bufsalloc = aligned_save;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check that the above calculations made progress, which might
|
|
|
|
not occur if there is arithmetic overflow. If there's no
|
|
|
|
progress, or if the new buffer size is larger than the old
|
|
|
|
and buffer reallocation fails, report memory exhaustion. */
|
|
|
|
if (bufsalloc < save || newalloc < save
|
|
|
|
|| (newalloc == save && newalloc != maxalloc)
|
|
|
|
|| (bufalloc < newalloc
|
|
|
|
&& ! (buffer
|
|
|
|
= page_alloc ((bufalloc = newalloc) + 1, &ubuffer))))
|
|
|
|
fatal (_("memory exhausted"), 0);
|
1999-11-21 01:02:48 +00:00
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
bufbeg = buffer + bufsalloc - save;
|
|
|
|
memmove (bufbeg, ubuffer + saved_offset, save);
|
|
|
|
readsize = bufalloc - bufsalloc;
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
#if defined(HAVE_MMAP)
|
2000-01-04 03:25:40 +00:00
|
|
|
if (bufmapped)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
size_t mmapsize = readsize;
|
|
|
|
|
|
|
|
/* Don't mmap past the end of the file; some hosts don't allow this.
|
|
|
|
Use `read' on the last page. */
|
|
|
|
if (stats->stat.st_size - bufoffset < mmapsize)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
mmapsize = stats->stat.st_size - bufoffset;
|
|
|
|
mmapsize -= mmapsize % pagesize;
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
2000-01-04 03:25:40 +00:00
|
|
|
|
|
|
|
if (mmapsize
|
|
|
|
&& (mmap ((caddr_t) (buffer + bufsalloc), mmapsize,
|
|
|
|
PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_FIXED,
|
|
|
|
bufdesc, bufoffset)
|
|
|
|
!= (caddr_t) -1))
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
/* Do not bother to use madvise with MADV_SEQUENTIAL or
|
|
|
|
MADV_WILLNEED on the mmapped memory. One might think it
|
|
|
|
would help, but it slows us down about 30% on SunOS 4.1. */
|
|
|
|
fillsize = mmapsize;
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
1999-11-21 01:02:48 +00:00
|
|
|
else
|
2000-01-04 03:25:40 +00:00
|
|
|
{
|
|
|
|
/* Stop using mmap on this file. Synchronize the file
|
|
|
|
offset. Do not warn about mmap failures. On some hosts
|
|
|
|
(e.g. Solaris 2.5) mmap can fail merely because some
|
|
|
|
other process has an advisory read lock on the file.
|
|
|
|
There's no point alarming the user about this misfeature. */
|
|
|
|
bufmapped = 0;
|
|
|
|
if (bufoffset != initial_bufoffset
|
|
|
|
&& lseek (bufdesc, bufoffset, SEEK_SET) < 0)
|
|
|
|
{
|
|
|
|
error ("lseek", errno);
|
|
|
|
cc = 0;
|
|
|
|
}
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
2000-01-04 03:25:40 +00:00
|
|
|
#endif /*HAVE_MMAP*/
|
|
|
|
|
|
|
|
if (! fillsize)
|
|
|
|
{
|
|
|
|
ssize_t bytesread;
|
|
|
|
do
|
2002-09-16 04:27:29 +00:00
|
|
|
if (BZflag)
|
|
|
|
{
|
|
|
|
bytesread = BZ2_bzread (bzbufdesc, buffer + bufsalloc, readsize);
|
|
|
|
/* gzread() will return "non-error" when given input that isn't
|
|
|
|
its type of compression. So we need to mimic that behavor
|
|
|
|
for the bzgrep case. */
|
|
|
|
if (bytesread == -1)
|
|
|
|
bytesread = 0;
|
|
|
|
}
|
|
|
|
else
|
1999-11-20 09:40:28 +00:00
|
|
|
#if HAVE_LIBZ > 0
|
2000-01-04 03:25:40 +00:00
|
|
|
if (Zflag)
|
|
|
|
bytesread = gzread (gzbufdesc, buffer + bufsalloc, readsize);
|
|
|
|
else
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
2000-01-04 03:25:40 +00:00
|
|
|
bytesread = read (bufdesc, buffer + bufsalloc, readsize);
|
|
|
|
while (bytesread < 0 && errno == EINTR);
|
|
|
|
if (bytesread < 0)
|
|
|
|
cc = 0;
|
|
|
|
else
|
|
|
|
fillsize = bytesread;
|
|
|
|
}
|
|
|
|
|
|
|
|
bufoffset += fillsize;
|
1999-11-21 01:02:48 +00:00
|
|
|
#if O_BINARY
|
2000-01-04 03:25:40 +00:00
|
|
|
if (fillsize)
|
|
|
|
fillsize = undossify_input (buffer + bufsalloc, fillsize);
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
2000-01-04 03:25:40 +00:00
|
|
|
buflim = buffer + bufsalloc + fillsize;
|
1999-11-20 09:40:28 +00:00
|
|
|
return cc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Flags controlling the style of output. */
|
2000-01-18 09:46:39 +00:00
|
|
|
static enum
|
|
|
|
{
|
|
|
|
BINARY_BINARY_FILES,
|
|
|
|
TEXT_BINARY_FILES,
|
|
|
|
WITHOUT_MATCH_BINARY_FILES
|
|
|
|
} binary_files; /* How to handle binary files. */
|
1999-11-20 09:40:28 +00:00
|
|
|
static int out_quiet; /* Suppress all normal output. */
|
|
|
|
static int out_invert; /* Print nonmatching stuff. */
|
|
|
|
static int out_file; /* Print filenames. */
|
|
|
|
static int out_line; /* Print line numbers. */
|
|
|
|
static int out_byte; /* Print byte offsets. */
|
|
|
|
static int out_before; /* Lines of leading context. */
|
|
|
|
static int out_after; /* Lines of trailing context. */
|
1999-11-21 01:02:48 +00:00
|
|
|
static int count_matches; /* Count matching lines. */
|
|
|
|
static int list_files; /* List matching files. */
|
|
|
|
static int no_filenames; /* Suppress file names. */
|
|
|
|
static int suppress_errors; /* Suppress diagnostics. */
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
/* Internal variables to keep track of byte count, context, etc. */
|
1999-11-21 01:02:48 +00:00
|
|
|
static off_t totalcc; /* Total character count before bufbeg. */
|
1999-11-20 09:40:28 +00:00
|
|
|
static char *lastnl; /* Pointer after last newline counted. */
|
|
|
|
static char *lastout; /* Pointer after last character output;
|
|
|
|
NULL if no character has been output
|
|
|
|
or if it's conceptually before bufbeg. */
|
1999-11-21 01:02:48 +00:00
|
|
|
static off_t totalnl; /* Total newline count before lastnl. */
|
1999-11-20 09:40:28 +00:00
|
|
|
static int pending; /* Pending lines of output. */
|
1999-11-21 01:02:48 +00:00
|
|
|
static int done_on_match; /* Stop scanning file on first match */
|
|
|
|
|
|
|
|
#if O_BINARY
|
|
|
|
# include "dosbuf.c"
|
|
|
|
#endif
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
nlscan (char *lim)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
char *beg;
|
2000-01-04 03:25:40 +00:00
|
|
|
for (beg = lastnl; (beg = memchr (beg, eolbyte, lim - beg)); beg++)
|
|
|
|
totalnl++;
|
|
|
|
lastnl = lim;
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
print_offset_sep (off_t pos, int sep)
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
|
|
|
/* Do not rely on printf to print pos, since off_t may be longer than long,
|
|
|
|
and long long is not portable. */
|
|
|
|
|
|
|
|
char buf[sizeof pos * CHAR_BIT];
|
|
|
|
char *p = buf + sizeof buf - 1;
|
|
|
|
*p = sep;
|
|
|
|
|
|
|
|
do
|
|
|
|
*--p = '0' + pos % 10;
|
|
|
|
while ((pos /= 10) != 0);
|
|
|
|
|
|
|
|
fwrite (p, 1, buf + sizeof buf - p, stdout);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
prline (char *beg, char *lim, int sep)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
if (out_file)
|
2000-01-04 03:25:40 +00:00
|
|
|
printf ("%s%c", filename, sep & filename_mask);
|
1999-11-20 09:40:28 +00:00
|
|
|
if (out_line)
|
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
nlscan (beg);
|
|
|
|
print_offset_sep (++totalnl, sep);
|
1999-11-20 09:40:28 +00:00
|
|
|
lastnl = lim;
|
|
|
|
}
|
|
|
|
if (out_byte)
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
|
|
|
off_t pos = totalcc + (beg - bufbeg);
|
|
|
|
#if O_BINARY
|
|
|
|
pos = dossified_pos (pos);
|
|
|
|
#endif
|
|
|
|
print_offset_sep (pos, sep);
|
|
|
|
}
|
|
|
|
fwrite (beg, 1, lim - beg, stdout);
|
|
|
|
if (ferror (stdout))
|
|
|
|
error (_("writing output"), errno);
|
1999-11-20 09:40:28 +00:00
|
|
|
lastout = lim;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Print pending lines of trailing context prior to LIM. */
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
prpending (char *lim)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
char *nl;
|
|
|
|
|
|
|
|
if (!lastout)
|
|
|
|
lastout = bufbeg;
|
|
|
|
while (pending > 0 && lastout < lim)
|
|
|
|
{
|
|
|
|
--pending;
|
2000-01-04 03:25:40 +00:00
|
|
|
if ((nl = memchr (lastout, eolbyte, lim - lastout)) != 0)
|
1999-11-20 09:40:28 +00:00
|
|
|
++nl;
|
|
|
|
else
|
|
|
|
nl = lim;
|
1999-11-21 01:02:48 +00:00
|
|
|
prline (lastout, nl, '-');
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Print the lines between BEG and LIM. Deal with context crap.
|
|
|
|
If NLINESP is non-null, store a count of lines between BEG and LIM. */
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
prtext (char *beg, char *lim, int *nlinesp)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
static int used; /* avoid printing "--" before any output */
|
|
|
|
char *bp, *p, *nl;
|
2000-01-04 03:25:40 +00:00
|
|
|
char eol = eolbyte;
|
1999-11-20 09:40:28 +00:00
|
|
|
int i, n;
|
|
|
|
|
|
|
|
if (!out_quiet && pending > 0)
|
1999-11-21 01:02:48 +00:00
|
|
|
prpending (beg);
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
p = beg;
|
|
|
|
|
|
|
|
if (!out_quiet)
|
|
|
|
{
|
|
|
|
/* Deal with leading context crap. */
|
|
|
|
|
|
|
|
bp = lastout ? lastout : bufbeg;
|
|
|
|
for (i = 0; i < out_before; ++i)
|
|
|
|
if (p > bp)
|
|
|
|
do
|
|
|
|
--p;
|
2000-01-04 03:25:40 +00:00
|
|
|
while (p > bp && p[-1] != eol);
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
/* We only print the "--" separator if our output is
|
|
|
|
discontiguous from the last output in the file. */
|
|
|
|
if ((out_before || out_after) && used && p != lastout)
|
1999-11-21 01:02:48 +00:00
|
|
|
puts ("--");
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
while (p < beg)
|
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
nl = memchr (p, eol, beg - p);
|
1999-11-21 01:02:48 +00:00
|
|
|
prline (p, nl + 1, '-');
|
1999-11-20 09:40:28 +00:00
|
|
|
p = nl + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nlinesp)
|
|
|
|
{
|
|
|
|
/* Caller wants a line count. */
|
|
|
|
for (n = 0; p < lim; ++n)
|
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
if ((nl = memchr (p, eol, lim - p)) != 0)
|
1999-11-20 09:40:28 +00:00
|
|
|
++nl;
|
|
|
|
else
|
|
|
|
nl = lim;
|
|
|
|
if (!out_quiet)
|
1999-11-21 01:02:48 +00:00
|
|
|
prline (p, nl, ':');
|
1999-11-20 09:40:28 +00:00
|
|
|
p = nl;
|
|
|
|
}
|
|
|
|
*nlinesp = n;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
if (!out_quiet)
|
1999-11-21 01:02:48 +00:00
|
|
|
prline (beg, lim, ':');
|
1999-11-20 09:40:28 +00:00
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
pending = out_quiet ? 0 : out_after;
|
1999-11-20 09:40:28 +00:00
|
|
|
used = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Scan the specified portion of the buffer, matching lines (or
|
|
|
|
between matching lines if OUT_INVERT is true). Return a count of
|
|
|
|
lines printed. */
|
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
grepbuf (char *beg, char *lim)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
int nlines, n;
|
|
|
|
register char *p, *b;
|
|
|
|
char *endp;
|
2000-01-04 03:25:40 +00:00
|
|
|
char eol = eolbyte;
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
nlines = 0;
|
|
|
|
p = beg;
|
|
|
|
while ((b = (*execute)(p, lim - p, &endp)) != 0)
|
|
|
|
{
|
|
|
|
/* Avoid matching the empty line at the end of the buffer. */
|
2000-01-04 03:25:40 +00:00
|
|
|
if (b == lim && ((b > beg && b[-1] == eol) || b == beg))
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
if (!out_invert)
|
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
prtext (b, endp, (int *) 0);
|
1999-11-20 09:40:28 +00:00
|
|
|
nlines += 1;
|
1999-11-21 01:02:48 +00:00
|
|
|
if (done_on_match)
|
|
|
|
return nlines;
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
else if (p < b)
|
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
prtext (p, b, &n);
|
1999-11-20 09:40:28 +00:00
|
|
|
nlines += n;
|
|
|
|
}
|
|
|
|
p = endp;
|
|
|
|
}
|
|
|
|
if (out_invert && p < lim)
|
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
prtext (p, lim, &n);
|
1999-11-20 09:40:28 +00:00
|
|
|
nlines += n;
|
|
|
|
}
|
|
|
|
return nlines;
|
|
|
|
}
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Search a given file. Normally, return a count of lines printed;
|
|
|
|
but if the file is a directory and we search it recursively, then
|
|
|
|
return -2 if there was a match, and -1 otherwise. */
|
1999-11-20 09:40:28 +00:00
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
grep (int fd, char const *file, struct stats *stats)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
int nlines, i;
|
1999-11-21 01:02:48 +00:00
|
|
|
int not_text;
|
1999-11-20 09:40:28 +00:00
|
|
|
size_t residue, save;
|
|
|
|
char *beg, *lim;
|
2000-01-04 03:25:40 +00:00
|
|
|
char eol = eolbyte;
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
if (!reset (fd, file, stats))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (file && directories == RECURSE_DIRECTORIES
|
|
|
|
&& S_ISDIR (stats->stat.st_mode))
|
|
|
|
{
|
|
|
|
/* Close fd now, so that we don't open a lot of file descriptors
|
|
|
|
when we recurse deeply. */
|
2002-09-16 04:27:29 +00:00
|
|
|
if (BZflag)
|
|
|
|
BZ2_bzclose(bzbufdesc);
|
|
|
|
else
|
1999-11-21 01:02:48 +00:00
|
|
|
#if HAVE_LIBZ > 0
|
|
|
|
if (Zflag)
|
|
|
|
gzclose(gzbufdesc);
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
if (close (fd) != 0)
|
|
|
|
error (file, errno);
|
|
|
|
return grepdir (file, stats) - 2;
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
totalcc = 0;
|
|
|
|
lastout = 0;
|
|
|
|
totalnl = 0;
|
|
|
|
pending = 0;
|
|
|
|
|
|
|
|
nlines = 0;
|
|
|
|
residue = 0;
|
|
|
|
save = 0;
|
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
if (! fillbuf (save, stats))
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
if (! (is_EISDIR (errno, file) && suppress_errors))
|
|
|
|
error (filename, errno);
|
2000-01-18 09:46:39 +00:00
|
|
|
return 0;
|
1999-11-21 01:02:48 +00:00
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
|
2000-01-18 09:46:39 +00:00
|
|
|
not_text = (((binary_files == BINARY_BINARY_FILES && !out_quiet)
|
|
|
|
|| binary_files == WITHOUT_MATCH_BINARY_FILES)
|
2000-01-04 03:25:40 +00:00
|
|
|
&& memchr (bufbeg, eol ? '\0' : '\200', buflim - bufbeg));
|
2000-01-18 09:46:39 +00:00
|
|
|
if (not_text && binary_files == WITHOUT_MATCH_BINARY_FILES)
|
|
|
|
return 0;
|
1999-11-21 01:02:48 +00:00
|
|
|
done_on_match += not_text;
|
|
|
|
out_quiet += not_text;
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
for (;;)
|
|
|
|
{
|
1999-11-20 09:40:28 +00:00
|
|
|
lastnl = bufbeg;
|
|
|
|
if (lastout)
|
|
|
|
lastout = bufbeg;
|
|
|
|
if (buflim - bufbeg == save)
|
|
|
|
break;
|
|
|
|
beg = bufbeg + save - residue;
|
2000-01-04 03:25:40 +00:00
|
|
|
for (lim = buflim; lim > beg && lim[-1] != eol; --lim)
|
1999-11-20 09:40:28 +00:00
|
|
|
;
|
|
|
|
residue = buflim - lim;
|
|
|
|
if (beg < lim)
|
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
nlines += grepbuf (beg, lim);
|
1999-11-20 09:40:28 +00:00
|
|
|
if (pending)
|
1999-11-21 01:02:48 +00:00
|
|
|
prpending (lim);
|
|
|
|
if (nlines && done_on_match && !out_invert)
|
|
|
|
goto finish_grep;
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
i = 0;
|
|
|
|
beg = lim;
|
|
|
|
while (i < out_before && beg > bufbeg && beg != lastout)
|
|
|
|
{
|
|
|
|
++i;
|
|
|
|
do
|
|
|
|
--beg;
|
2000-01-04 03:25:40 +00:00
|
|
|
while (beg > bufbeg && beg[-1] != eol);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
if (beg != lastout)
|
|
|
|
lastout = 0;
|
|
|
|
save = residue + lim - beg;
|
|
|
|
totalcc += buflim - bufbeg - save;
|
|
|
|
if (out_line)
|
1999-11-21 01:02:48 +00:00
|
|
|
nlscan (beg);
|
2000-01-04 03:25:40 +00:00
|
|
|
if (! fillbuf (save, stats))
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
|
|
|
if (! (is_EISDIR (errno, file) && suppress_errors))
|
|
|
|
error (filename, errno);
|
|
|
|
goto finish_grep;
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
if (residue)
|
|
|
|
{
|
2000-01-31 13:28:57 +00:00
|
|
|
*buflim++ = eol;
|
1999-11-21 01:02:48 +00:00
|
|
|
nlines += grepbuf (bufbeg + save - residue, buflim);
|
1999-11-20 09:40:28 +00:00
|
|
|
if (pending)
|
1999-11-21 01:02:48 +00:00
|
|
|
prpending (buflim);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
1999-11-21 01:02:48 +00:00
|
|
|
|
|
|
|
finish_grep:
|
|
|
|
done_on_match -= not_text;
|
|
|
|
out_quiet -= not_text;
|
|
|
|
if ((not_text & ~out_quiet) && nlines != 0)
|
|
|
|
printf (_("Binary file %s matches\n"), filename);
|
1999-11-20 09:40:28 +00:00
|
|
|
return nlines;
|
|
|
|
}
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
grepfile (char const *file, struct stats *stats)
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
|
|
|
int desc;
|
|
|
|
int count;
|
|
|
|
int status;
|
|
|
|
|
|
|
|
if (! file)
|
|
|
|
{
|
|
|
|
desc = 0;
|
|
|
|
filename = _("(standard input)");
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
while ((desc = open (file, O_RDONLY)) < 0 && errno == EINTR)
|
|
|
|
continue;
|
1999-11-21 01:02:48 +00:00
|
|
|
|
|
|
|
if (desc < 0)
|
|
|
|
{
|
|
|
|
int e = errno;
|
|
|
|
|
|
|
|
if (is_EISDIR (e, file) && directories == RECURSE_DIRECTORIES)
|
|
|
|
{
|
|
|
|
if (stat (file, &stats->stat) != 0)
|
|
|
|
{
|
|
|
|
error (file, errno);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return grepdir (file, stats);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!suppress_errors)
|
|
|
|
{
|
|
|
|
if (directories == SKIP_DIRECTORIES)
|
|
|
|
switch (e)
|
|
|
|
{
|
|
|
|
#ifdef EISDIR
|
|
|
|
case EISDIR:
|
|
|
|
return 1;
|
|
|
|
#endif
|
|
|
|
case EACCES:
|
|
|
|
/* When skipping directories, don't worry about
|
|
|
|
directories that can't be opened. */
|
|
|
|
if (stat (file, &stats->stat) == 0
|
|
|
|
&& S_ISDIR (stats->stat.st_mode))
|
|
|
|
return 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
error (file, e);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
filename = file;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if O_BINARY
|
|
|
|
/* Set input to binary mode. Pipes are simulated with files
|
|
|
|
on DOS, so this includes the case of "foo | grep bar". */
|
|
|
|
if (!isatty (desc))
|
|
|
|
SET_BINARY (desc);
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
1999-11-21 01:02:48 +00:00
|
|
|
|
|
|
|
count = grep (desc, file, stats);
|
|
|
|
if (count < 0)
|
|
|
|
status = count + 2;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (count_matches)
|
|
|
|
{
|
|
|
|
if (out_file)
|
2000-01-04 03:25:40 +00:00
|
|
|
printf ("%s%c", filename, ':' & filename_mask);
|
1999-11-21 01:02:48 +00:00
|
|
|
printf ("%d\n", count);
|
|
|
|
}
|
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
status = !count;
|
|
|
|
if (list_files == 1 - 2 * status)
|
|
|
|
printf ("%s%c", filename, '\n' & filename_mask);
|
1999-11-21 01:02:48 +00:00
|
|
|
|
2002-09-16 04:27:29 +00:00
|
|
|
if (BZflag)
|
|
|
|
BZ2_bzclose(bzbufdesc);
|
|
|
|
else
|
1999-11-20 09:40:28 +00:00
|
|
|
#if HAVE_LIBZ > 0
|
1999-11-21 01:02:48 +00:00
|
|
|
if (Zflag)
|
|
|
|
gzclose(gzbufdesc);
|
|
|
|
else
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
2000-01-04 03:25:40 +00:00
|
|
|
if (file)
|
|
|
|
while (close (desc) != 0)
|
|
|
|
if (errno != EINTR)
|
|
|
|
{
|
|
|
|
error (file, errno);
|
|
|
|
break;
|
|
|
|
}
|
1999-11-21 01:02:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
grepdir (char const *dir, struct stats *stats)
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
|
|
|
int status = 1;
|
|
|
|
struct stats *ancestor;
|
|
|
|
char *name_space;
|
|
|
|
|
|
|
|
for (ancestor = stats; (ancestor = ancestor->parent) != 0; )
|
2000-01-04 03:25:40 +00:00
|
|
|
if (ancestor->stat.st_ino == stats->stat.st_ino
|
|
|
|
&& ancestor->stat.st_dev == stats->stat.st_dev)
|
1999-11-21 01:02:48 +00:00
|
|
|
{
|
|
|
|
if (!suppress_errors)
|
|
|
|
fprintf (stderr, _("%s: warning: %s: %s\n"), prog, dir,
|
|
|
|
_("recursive directory loop"));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
name_space = savedir (dir, (unsigned) stats->stat.st_size);
|
|
|
|
|
|
|
|
if (! name_space)
|
|
|
|
{
|
|
|
|
if (errno)
|
|
|
|
{
|
|
|
|
if (!suppress_errors)
|
|
|
|
error (dir, errno);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
fatal (_("Memory exhausted"), 0);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
size_t dirlen = strlen (dir);
|
|
|
|
int needs_slash = ! (dirlen == FILESYSTEM_PREFIX_LEN (dir)
|
|
|
|
|| IS_SLASH (dir[dirlen - 1]));
|
|
|
|
char *file = NULL;
|
|
|
|
char *namep = name_space;
|
|
|
|
struct stats child;
|
|
|
|
child.parent = stats;
|
|
|
|
out_file += !no_filenames;
|
|
|
|
while (*namep)
|
|
|
|
{
|
|
|
|
size_t namelen = strlen (namep);
|
|
|
|
file = xrealloc (file, dirlen + 1 + namelen + 1);
|
|
|
|
strcpy (file, dir);
|
|
|
|
file[dirlen] = '/';
|
|
|
|
strcpy (file + dirlen + needs_slash, namep);
|
|
|
|
namep += namelen + 1;
|
|
|
|
status &= grepfile (file, &child);
|
|
|
|
}
|
|
|
|
out_file -= !no_filenames;
|
|
|
|
if (file)
|
|
|
|
free (file);
|
|
|
|
free (name_space);
|
|
|
|
}
|
|
|
|
|
|
|
|
return status;
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
usage (int status)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
if (status != 0)
|
|
|
|
{
|
|
|
|
fprintf (stderr, _("Usage: %s [OPTION]... PATTERN [FILE]...\n"), prog);
|
|
|
|
fprintf (stderr, _("Try `%s --help' for more information.\n"), prog);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
printf (_("Usage: %s [OPTION]... PATTERN [FILE] ...\n"), prog);
|
|
|
|
printf (_("\
|
|
|
|
Search for PATTERN in each FILE or standard input.\n\
|
2000-01-31 13:28:57 +00:00
|
|
|
Example: %s -i 'hello world' menu.h main.c\n\
|
1999-11-21 01:02:48 +00:00
|
|
|
\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
Regexp selection and interpretation:\n"), prog);
|
|
|
|
printf (_("\
|
1999-11-21 01:02:48 +00:00
|
|
|
-E, --extended-regexp PATTERN is an extended regular expression\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
-F, --fixed-strings PATTERN is a set of newline-separated strings\n\
|
|
|
|
-G, --basic-regexp PATTERN is a basic regular expression\n"));
|
|
|
|
printf (_("\
|
1999-11-21 01:02:48 +00:00
|
|
|
-e, --regexp=PATTERN use PATTERN as a regular expression\n\
|
|
|
|
-f, --file=FILE obtain PATTERN from FILE\n\
|
|
|
|
-i, --ignore-case ignore case distinctions\n\
|
|
|
|
-w, --word-regexp force PATTERN to match only whole words\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
-x, --line-regexp force PATTERN to match only whole lines\n\
|
|
|
|
-z, --null-data a data line ends in 0 byte, not newline\n"));
|
1999-11-21 01:02:48 +00:00
|
|
|
printf (_("\
|
|
|
|
\n\
|
|
|
|
Miscellaneous:\n\
|
|
|
|
-s, --no-messages suppress error messages\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
-v, --invert-match select non-matching lines\n\
|
1999-11-21 01:02:48 +00:00
|
|
|
-V, --version print version information and exit\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
--help display this help and exit\n\
|
2002-09-16 04:27:29 +00:00
|
|
|
-J, --bz2decompress decompress bzip2'ed input before searching\n\
|
1999-11-21 01:02:48 +00:00
|
|
|
-Z, --decompress decompress input before searching (HAVE_LIBZ=1)\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
--mmap use memory-mapped input if possible\n"));
|
1999-11-21 01:02:48 +00:00
|
|
|
printf (_("\
|
|
|
|
\n\
|
|
|
|
Output control:\n\
|
|
|
|
-b, --byte-offset print the byte offset with output lines\n\
|
|
|
|
-n, --line-number print line number with output lines\n\
|
|
|
|
-H, --with-filename print the filename for each match\n\
|
|
|
|
-h, --no-filename suppress the prefixing filename on output\n\
|
|
|
|
-q, --quiet, --silent suppress all normal output\n\
|
2000-01-18 09:46:39 +00:00
|
|
|
--binary-files=TYPE assume that binary files are TYPE\n\
|
|
|
|
TYPE is 'binary', 'text', or 'without-match'.\n\
|
2000-01-31 13:28:57 +00:00
|
|
|
-a, --text equivalent to --binary-files=text\n\
|
|
|
|
-I equivalent to --binary-files=without-match\n\
|
1999-11-21 01:02:48 +00:00
|
|
|
-d, --directories=ACTION how to handle directories\n\
|
|
|
|
ACTION is 'read', 'recurse', or 'skip'.\n\
|
|
|
|
-r, --recursive equivalent to --directories=recurse.\n\
|
|
|
|
-L, --files-without-match only print FILE names containing no match\n\
|
|
|
|
-l, --files-with-matches only print FILE names containing matches\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
-c, --count only print a count of matching lines per FILE\n\
|
|
|
|
--null print 0 byte after FILE name\n"));
|
1999-11-21 01:02:48 +00:00
|
|
|
printf (_("\
|
|
|
|
\n\
|
|
|
|
Context control:\n\
|
|
|
|
-B, --before-context=NUM print NUM lines of leading context\n\
|
|
|
|
-A, --after-context=NUM print NUM lines of trailing context\n\
|
|
|
|
-C, --context[=NUM] print NUM (default 2) lines of output context\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
unless overridden by -A or -B\n\
|
1999-11-21 01:02:48 +00:00
|
|
|
-NUM same as --context=NUM\n\
|
|
|
|
-U, --binary do not strip CR characters at EOL (MSDOS)\n\
|
|
|
|
-u, --unix-byte-offsets report offsets as if CRs were not there (MSDOS)\n\
|
|
|
|
\n\
|
2000-01-04 03:25:40 +00:00
|
|
|
`egrep' means `grep -E'. `fgrep' means `grep -F'.\n\
|
|
|
|
With no FILE, or when FILE is -, read standard input. If less than\n\
|
|
|
|
two FILEs given, assume -h. Exit status is 0 if match, 1 if no match,\n\
|
|
|
|
and 2 if trouble.\n"));
|
1999-11-21 01:02:48 +00:00
|
|
|
printf (_("\nReport bugs to <bug-gnu-utils@gnu.org>.\n"));
|
|
|
|
}
|
|
|
|
exit (status);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
/* Set the matcher to M, reporting any conflicts. */
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
setmatcher (char const *m)
|
2000-01-04 03:25:40 +00:00
|
|
|
{
|
|
|
|
if (matcher && strcmp (matcher, m) != 0)
|
|
|
|
fatal (_("conflicting matchers specified"), 0);
|
|
|
|
matcher = m;
|
|
|
|
}
|
|
|
|
|
1999-11-20 09:40:28 +00:00
|
|
|
/* Go through the matchers vector and look for the specified matcher.
|
|
|
|
If we find it, install it in compile and execute, and return 1. */
|
1999-11-21 01:02:48 +00:00
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
install_matcher (char const *name)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
int i;
|
1999-11-21 01:02:48 +00:00
|
|
|
#ifdef HAVE_SETRLIMIT
|
|
|
|
struct rlimit rlim;
|
|
|
|
#endif
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
for (i = 0; matchers[i].name; ++i)
|
1999-11-21 01:02:48 +00:00
|
|
|
if (strcmp (name, matchers[i].name) == 0)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
compile = matchers[i].compile;
|
|
|
|
execute = matchers[i].execute;
|
1999-11-21 01:02:48 +00:00
|
|
|
#if HAVE_SETRLIMIT && defined(RLIMIT_STACK)
|
|
|
|
/* I think every platform needs to do this, so that regex.c
|
|
|
|
doesn't oveflow the stack. The default value of
|
|
|
|
`re_max_failures' is too large for some platforms: it needs
|
|
|
|
more than 3MB-large stack.
|
|
|
|
|
|
|
|
The test for HAVE_SETRLIMIT should go into `configure'. */
|
|
|
|
if (!getrlimit (RLIMIT_STACK, &rlim))
|
|
|
|
{
|
|
|
|
long newlim;
|
|
|
|
extern long int re_max_failures; /* from regex.c */
|
|
|
|
|
|
|
|
/* Approximate the amount regex.c needs, plus some more. */
|
|
|
|
newlim = re_max_failures * 2 * 20 * sizeof (char *);
|
|
|
|
if (newlim > rlim.rlim_max)
|
|
|
|
{
|
|
|
|
newlim = rlim.rlim_max;
|
|
|
|
re_max_failures = newlim / (2 * 20 * sizeof (char *));
|
|
|
|
}
|
|
|
|
if (rlim.rlim_cur < newlim)
|
|
|
|
rlim.rlim_cur = newlim;
|
|
|
|
|
|
|
|
setrlimit (RLIMIT_STACK, &rlim);
|
|
|
|
}
|
|
|
|
#endif
|
1999-11-20 09:40:28 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1999-11-26 03:26:59 +00:00
|
|
|
/* Find the white-space-separated options specified by OPTIONS, and
|
|
|
|
using BUF to store copies of these options, set ARGV[0], ARGV[1],
|
|
|
|
etc. to the option copies. Return the number N of options found.
|
|
|
|
Do not set ARGV[N] to NULL. If ARGV is NULL, do not store ARGV[0]
|
|
|
|
etc. Backslash can be used to escape whitespace (and backslashes). */
|
|
|
|
static int
|
2000-01-31 13:28:57 +00:00
|
|
|
prepend_args (char const *options, char *buf, char **argv)
|
1999-11-26 03:26:59 +00:00
|
|
|
{
|
|
|
|
char const *o = options;
|
|
|
|
char *b = buf;
|
|
|
|
int n = 0;
|
|
|
|
|
|
|
|
for (;;)
|
|
|
|
{
|
|
|
|
while (ISSPACE ((unsigned char) *o))
|
|
|
|
o++;
|
|
|
|
if (!*o)
|
|
|
|
return n;
|
|
|
|
if (argv)
|
|
|
|
argv[n] = b;
|
|
|
|
n++;
|
|
|
|
|
|
|
|
do
|
|
|
|
if ((*b++ = *o++) == '\\' && *o)
|
|
|
|
b[-1] = *o++;
|
|
|
|
while (*o && ! ISSPACE ((unsigned char) *o));
|
|
|
|
|
|
|
|
*b++ = '\0';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Prepend the whitespace-separated options in OPTIONS to the argument
|
|
|
|
vector of a main program with argument count *PARGC and argument
|
|
|
|
vector *PARGV. */
|
|
|
|
static void
|
2000-01-31 13:28:57 +00:00
|
|
|
prepend_default_options (char const *options, int *pargc, char ***pargv)
|
1999-11-26 03:26:59 +00:00
|
|
|
{
|
|
|
|
if (options)
|
|
|
|
{
|
|
|
|
char *buf = xmalloc (strlen (options) + 1);
|
|
|
|
int prepended = prepend_args (options, buf, (char **) NULL);
|
|
|
|
int argc = *pargc;
|
|
|
|
char * const *argv = *pargv;
|
|
|
|
char **pp = (char **) xmalloc ((prepended + argc + 1) * sizeof *pp);
|
|
|
|
*pargc = prepended + argc;
|
|
|
|
*pargv = pp;
|
|
|
|
*pp++ = *argv++;
|
|
|
|
pp += prepend_args (options, buf, pp);
|
|
|
|
while ((*pp++ = *argv++))
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-11-20 09:40:28 +00:00
|
|
|
int
|
2000-01-31 13:28:57 +00:00
|
|
|
main (int argc, char **argv)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
char *keys;
|
|
|
|
size_t keycc, oldcc, keyalloc;
|
1999-11-21 01:02:48 +00:00
|
|
|
int with_filenames;
|
|
|
|
int opt, cc, status;
|
2000-01-31 13:28:57 +00:00
|
|
|
int default_context;
|
|
|
|
unsigned digit_args_val;
|
1999-11-20 09:40:28 +00:00
|
|
|
FILE *fp;
|
|
|
|
extern char *optarg;
|
|
|
|
extern int optind;
|
1999-11-21 01:02:48 +00:00
|
|
|
|
|
|
|
initialize_main (&argc, &argv);
|
|
|
|
prog = argv[0];
|
|
|
|
if (prog && strrchr (prog, '/'))
|
|
|
|
prog = strrchr (prog, '/') + 1;
|
|
|
|
|
|
|
|
#if HAVE_LIBZ > 0
|
|
|
|
if (prog[0] == 'z') {
|
|
|
|
Zflag = 1;
|
|
|
|
++prog;
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
2002-09-16 04:27:29 +00:00
|
|
|
if (prog[0] == 'b') {
|
|
|
|
BZflag = 1;
|
|
|
|
++prog;
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
#if defined(__MSDOS__) || defined(_WIN32)
|
|
|
|
/* DOS and MS-Windows use backslashes as directory separators, and usually
|
|
|
|
have an .exe suffix. They also have case-insensitive filesystems. */
|
|
|
|
if (prog)
|
|
|
|
{
|
|
|
|
char *p = prog;
|
|
|
|
char *bslash = strrchr (argv[0], '\\');
|
|
|
|
|
|
|
|
if (bslash && bslash >= prog) /* for mixed forward/backslash case */
|
|
|
|
prog = bslash + 1;
|
|
|
|
else if (prog == argv[0]
|
|
|
|
&& argv[0][0] && argv[0][1] == ':') /* "c:progname" */
|
|
|
|
prog = argv[0] + 2;
|
|
|
|
|
|
|
|
/* Collapse the letter-case, so `strcmp' could be used hence. */
|
|
|
|
for ( ; *p; p++)
|
|
|
|
if (*p >= 'A' && *p <= 'Z')
|
|
|
|
*p += 'a' - 'A';
|
|
|
|
|
|
|
|
/* Remove the .exe extension, if any. */
|
|
|
|
if ((p = strrchr (prog, '.')) && strcmp (p, ".exe") == 0)
|
|
|
|
*p = '\0';
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
keys = NULL;
|
|
|
|
keycc = 0;
|
1999-11-21 01:02:48 +00:00
|
|
|
with_filenames = 0;
|
2000-01-04 03:25:40 +00:00
|
|
|
eolbyte = '\n';
|
|
|
|
filename_mask = ~0;
|
1999-11-21 01:02:48 +00:00
|
|
|
|
|
|
|
/* The value -1 means to use DEFAULT_CONTEXT. */
|
|
|
|
out_after = out_before = -1;
|
|
|
|
/* Default before/after context: chaged by -C/-NUM options */
|
|
|
|
default_context = 0;
|
|
|
|
/* Accumulated value of individual digits in a -NUM option */
|
|
|
|
digit_args_val = 0;
|
|
|
|
|
|
|
|
|
|
|
|
/* Internationalization. */
|
|
|
|
#if HAVE_SETLOCALE
|
|
|
|
setlocale (LC_ALL, "");
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
1999-11-21 01:02:48 +00:00
|
|
|
#if ENABLE_NLS
|
|
|
|
bindtextdomain (PACKAGE, LOCALEDIR);
|
|
|
|
textdomain (PACKAGE);
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
|
|
|
|
1999-11-26 03:26:59 +00:00
|
|
|
prepend_default_options (getenv ("GREP_OPTIONS"), &argc, &argv);
|
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
while ((opt = getopt_long (argc, argv, short_options, long_options, NULL))
|
|
|
|
!= -1)
|
1999-11-20 09:40:28 +00:00
|
|
|
switch (opt)
|
|
|
|
{
|
|
|
|
case '0':
|
|
|
|
case '1':
|
|
|
|
case '2':
|
|
|
|
case '3':
|
|
|
|
case '4':
|
|
|
|
case '5':
|
|
|
|
case '6':
|
|
|
|
case '7':
|
|
|
|
case '8':
|
|
|
|
case '9':
|
1999-11-21 01:02:48 +00:00
|
|
|
digit_args_val = 10 * digit_args_val + opt - '0';
|
|
|
|
default_context = digit_args_val;
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'A':
|
1999-11-21 01:02:48 +00:00
|
|
|
if (optarg)
|
|
|
|
{
|
|
|
|
if (ck_atoi (optarg, &out_after))
|
|
|
|
fatal (_("invalid context length argument"), 0);
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'B':
|
1999-11-21 01:02:48 +00:00
|
|
|
if (optarg)
|
|
|
|
{
|
|
|
|
if (ck_atoi (optarg, &out_before))
|
|
|
|
fatal (_("invalid context length argument"), 0);
|
|
|
|
}
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'C':
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Set output match context, but let any explicit leading or
|
|
|
|
trailing amount specified with -A or -B stand. */
|
|
|
|
if (optarg)
|
|
|
|
{
|
|
|
|
if (ck_atoi (optarg, &default_context))
|
|
|
|
fatal (_("invalid context length argument"), 0);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
default_context = 2;
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'E':
|
2000-01-04 03:25:40 +00:00
|
|
|
setmatcher ("egrep");
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'F':
|
2000-01-04 03:25:40 +00:00
|
|
|
setmatcher ("fgrep");
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'G':
|
2000-01-04 03:25:40 +00:00
|
|
|
setmatcher ("grep");
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
1999-11-21 01:02:48 +00:00
|
|
|
case 'H':
|
|
|
|
with_filenames = 1;
|
|
|
|
break;
|
2000-01-31 13:28:57 +00:00
|
|
|
case 'I':
|
|
|
|
binary_files = WITHOUT_MATCH_BINARY_FILES;
|
|
|
|
break;
|
2002-09-16 04:27:29 +00:00
|
|
|
case 'J':
|
|
|
|
BZflag = 1;
|
|
|
|
break;
|
1999-11-21 01:02:48 +00:00
|
|
|
case 'U':
|
2000-01-04 03:25:40 +00:00
|
|
|
#if O_BINARY
|
1999-11-21 01:02:48 +00:00
|
|
|
dos_use_file_type = DOS_BINARY;
|
2000-01-04 03:25:40 +00:00
|
|
|
#endif
|
1999-11-21 01:02:48 +00:00
|
|
|
break;
|
|
|
|
case 'u':
|
2000-01-04 03:25:40 +00:00
|
|
|
#if O_BINARY
|
1999-11-21 01:02:48 +00:00
|
|
|
dos_report_unix_offset = 1;
|
|
|
|
#endif
|
2000-01-04 03:25:40 +00:00
|
|
|
break;
|
1999-11-20 09:40:28 +00:00
|
|
|
case 'V':
|
1999-11-21 01:02:48 +00:00
|
|
|
show_version = 1;
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'X':
|
2000-01-04 03:25:40 +00:00
|
|
|
setmatcher (optarg);
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'a':
|
2000-01-18 09:46:39 +00:00
|
|
|
binary_files = TEXT_BINARY_FILES;
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'b':
|
|
|
|
out_byte = 1;
|
|
|
|
break;
|
|
|
|
case 'c':
|
|
|
|
out_quiet = 1;
|
|
|
|
count_matches = 1;
|
|
|
|
break;
|
1999-11-21 01:02:48 +00:00
|
|
|
case 'd':
|
|
|
|
if (strcmp (optarg, "read") == 0)
|
|
|
|
directories = READ_DIRECTORIES;
|
|
|
|
else if (strcmp (optarg, "skip") == 0)
|
|
|
|
directories = SKIP_DIRECTORIES;
|
|
|
|
else if (strcmp (optarg, "recurse") == 0)
|
|
|
|
directories = RECURSE_DIRECTORIES;
|
|
|
|
else
|
|
|
|
fatal (_("unknown directories method"), 0);
|
|
|
|
break;
|
1999-11-20 09:40:28 +00:00
|
|
|
case 'e':
|
1999-11-21 01:02:48 +00:00
|
|
|
cc = strlen (optarg);
|
|
|
|
keys = xrealloc (keys, keycc + cc + 1);
|
|
|
|
strcpy (&keys[keycc], optarg);
|
1999-11-20 09:40:28 +00:00
|
|
|
keycc += cc;
|
1999-11-21 01:02:48 +00:00
|
|
|
keys[keycc++] = '\n';
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'f':
|
1999-11-21 01:02:48 +00:00
|
|
|
fp = strcmp (optarg, "-") != 0 ? fopen (optarg, "r") : stdin;
|
1999-11-20 09:40:28 +00:00
|
|
|
if (!fp)
|
1999-11-21 01:02:48 +00:00
|
|
|
fatal (optarg, errno);
|
|
|
|
for (keyalloc = 1; keyalloc <= keycc + 1; keyalloc *= 2)
|
1999-11-20 09:40:28 +00:00
|
|
|
;
|
1999-11-21 01:02:48 +00:00
|
|
|
keys = xrealloc (keys, keyalloc);
|
1999-11-20 09:40:28 +00:00
|
|
|
oldcc = keycc;
|
1999-11-21 01:02:48 +00:00
|
|
|
while (!feof (fp)
|
|
|
|
&& (cc = fread (keys + keycc, 1, keyalloc - 1 - keycc, fp)) > 0)
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
|
|
|
keycc += cc;
|
1999-11-21 01:02:48 +00:00
|
|
|
if (keycc == keyalloc - 1)
|
|
|
|
keys = xrealloc (keys, keyalloc *= 2);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
if (fp != stdin)
|
|
|
|
fclose(fp);
|
1999-11-21 01:02:48 +00:00
|
|
|
/* Append final newline if file ended in non-newline. */
|
|
|
|
if (oldcc != keycc && keys[keycc - 1] != '\n')
|
|
|
|
keys[keycc++] = '\n';
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'h':
|
|
|
|
no_filenames = 1;
|
|
|
|
break;
|
|
|
|
case 'i':
|
|
|
|
case 'y': /* For old-timers . . . */
|
|
|
|
match_icase = 1;
|
|
|
|
break;
|
|
|
|
case 'L':
|
|
|
|
/* Like -l, except list files that don't contain matches.
|
|
|
|
Inspired by the same option in Hume's gre. */
|
|
|
|
out_quiet = 1;
|
|
|
|
list_files = -1;
|
1999-11-21 01:02:48 +00:00
|
|
|
done_on_match = 1;
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'l':
|
|
|
|
out_quiet = 1;
|
|
|
|
list_files = 1;
|
1999-11-21 01:02:48 +00:00
|
|
|
done_on_match = 1;
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
out_line = 1;
|
|
|
|
break;
|
|
|
|
case 'q':
|
1999-11-21 01:02:48 +00:00
|
|
|
done_on_match = 1;
|
1999-11-20 09:40:28 +00:00
|
|
|
out_quiet = 1;
|
|
|
|
break;
|
1999-11-21 01:09:03 +00:00
|
|
|
case 'R':
|
1999-11-21 01:02:48 +00:00
|
|
|
case 'r':
|
|
|
|
directories = RECURSE_DIRECTORIES;
|
|
|
|
break;
|
1999-11-20 09:40:28 +00:00
|
|
|
case 's':
|
|
|
|
suppress_errors = 1;
|
|
|
|
break;
|
|
|
|
case 'v':
|
|
|
|
out_invert = 1;
|
|
|
|
break;
|
|
|
|
case 'w':
|
|
|
|
match_words = 1;
|
|
|
|
break;
|
|
|
|
case 'x':
|
|
|
|
match_lines = 1;
|
|
|
|
break;
|
2000-01-04 03:25:40 +00:00
|
|
|
case 'Z':
|
|
|
|
#if HAVE_LIBZ > 0
|
|
|
|
Zflag = 1;
|
|
|
|
#else
|
|
|
|
filename_mask = 0;
|
|
|
|
#endif
|
|
|
|
break;
|
|
|
|
case 'z':
|
|
|
|
eolbyte = '\0';
|
|
|
|
break;
|
2000-01-18 09:46:39 +00:00
|
|
|
case BINARY_FILES_OPTION:
|
|
|
|
if (strcmp (optarg, "binary") == 0)
|
|
|
|
binary_files = BINARY_BINARY_FILES;
|
|
|
|
else if (strcmp (optarg, "text") == 0)
|
|
|
|
binary_files = TEXT_BINARY_FILES;
|
|
|
|
else if (strcmp (optarg, "without-match") == 0)
|
|
|
|
binary_files = WITHOUT_MATCH_BINARY_FILES;
|
|
|
|
else
|
|
|
|
fatal (_("unknown binary-files type"), 0);
|
|
|
|
break;
|
1999-11-21 01:02:48 +00:00
|
|
|
case 0:
|
|
|
|
/* long options */
|
|
|
|
break;
|
1999-11-20 09:40:28 +00:00
|
|
|
default:
|
1999-11-21 01:02:48 +00:00
|
|
|
usage (2);
|
1999-11-20 09:40:28 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
if (out_after < 0)
|
|
|
|
out_after = default_context;
|
|
|
|
if (out_before < 0)
|
|
|
|
out_before = default_context;
|
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
if (! matcher)
|
|
|
|
matcher = prog;
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
if (show_version)
|
|
|
|
{
|
2000-01-04 03:25:40 +00:00
|
|
|
printf (_("%s (GNU grep) %s\n"), matcher, VERSION);
|
1999-11-21 01:02:48 +00:00
|
|
|
printf ("\n");
|
|
|
|
printf (_("\
|
|
|
|
Copyright (C) 1988, 1992-1998, 1999 Free Software Foundation, Inc.\n"));
|
|
|
|
printf (_("\
|
|
|
|
This is free software; see the source for copying conditions. There is NO\n\
|
|
|
|
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n"));
|
|
|
|
printf ("\n");
|
|
|
|
exit (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (show_help)
|
|
|
|
usage (0);
|
|
|
|
|
|
|
|
if (keys)
|
|
|
|
{
|
|
|
|
if (keycc == 0)
|
|
|
|
/* No keys were specified (e.g. -f /dev/null). Match nothing. */
|
|
|
|
out_invert ^= 1;
|
|
|
|
else
|
|
|
|
/* Strip trailing newline. */
|
|
|
|
--keycc;
|
|
|
|
}
|
|
|
|
else
|
1999-11-20 09:40:28 +00:00
|
|
|
if (optind < argc)
|
|
|
|
{
|
|
|
|
keys = argv[optind++];
|
1999-11-21 01:02:48 +00:00
|
|
|
keycc = strlen (keys);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
|
|
|
else
|
1999-11-21 01:02:48 +00:00
|
|
|
usage (2);
|
1999-11-20 09:40:28 +00:00
|
|
|
|
2000-01-04 03:25:40 +00:00
|
|
|
if (!install_matcher (matcher) && !install_matcher ("default"))
|
1999-11-21 01:02:48 +00:00
|
|
|
abort ();
|
1999-11-20 09:40:28 +00:00
|
|
|
|
|
|
|
(*compile)(keys, keycc);
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
if ((argc - optind > 1 && !no_filenames) || with_filenames)
|
1999-11-20 09:40:28 +00:00
|
|
|
out_file = 1;
|
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
#if O_BINARY
|
|
|
|
/* Output is set to binary mode because we shouldn't convert
|
|
|
|
NL to CR-LF pairs, especially when grepping binary files. */
|
|
|
|
if (!isatty (1))
|
|
|
|
SET_BINARY (1);
|
1999-11-20 09:40:28 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
if (optind < argc)
|
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
status = 1;
|
|
|
|
do
|
1999-11-20 09:40:28 +00:00
|
|
|
{
|
1999-11-21 01:02:48 +00:00
|
|
|
char *file = argv[optind];
|
|
|
|
status &= grepfile (strcmp (file, "-") == 0 ? (char *) NULL : file,
|
|
|
|
&stats_base);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
1999-11-21 01:02:48 +00:00
|
|
|
while ( ++optind < argc);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|
1999-11-21 01:02:48 +00:00
|
|
|
else
|
|
|
|
status = grepfile ((char *) NULL, &stats_base);
|
|
|
|
|
|
|
|
if (fclose (stdout) == EOF)
|
|
|
|
error (_("writing output"), errno);
|
1999-11-20 09:40:28 +00:00
|
|
|
|
1999-11-21 01:02:48 +00:00
|
|
|
exit (errseen ? 2 : status);
|
1999-11-20 09:40:28 +00:00
|
|
|
}
|