34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz/***********************************************************************
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* This software is part of the ast package *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* Copyright (c) 1995-2009 AT&T Knowledge Ventures *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* and is licensed under the *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* Common Public License, Version 1.0 *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* by AT&T Knowledge Ventures *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* A copy of the License is available at *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* http://www.opensource.org/licenses/cpl1.0.txt *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* Information and Software Systems Research *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* AT&T Research *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* Florham Park NJ *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz* Glenn Fowler <gsf@research.att.com> *
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz***********************************************************************/
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[-?\n@(#)$Id: grep (AT&T Research) 2006-06-14 $\n]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[+NAME?grep - search lines in files for matching patterns]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[+DESCRIPTION?The \bgrep\b commands search the named input files"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" for lines containing a match for the given \apatterns\a."
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" Matching lines are printed by default. The standard input is searched"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" if no files are given or when the file \b-\b is specified.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[+?There are six variants of \bgrep\b, each one using a different form of"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" \apattern\a, controlled either by option or the command path"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" base name. Details of each variant may be found in \bregex\b(3).]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" [+grep?The default basic regular expressions (no alternations.)]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" [+egrep?Extended regular expressions (alternations, one or more.)]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" [+pgrep?\bperl\b(1) regular expressions (lenient extended.)]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" [+xgrep?Augmented regular expressions (conjunction, negation.)]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" [+fgrep?Fixed string expressions.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" [+agrep?Approximate regular expressions (not implemented.)]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[G:basic-regexp?\bgrep\b mode (default): basic regular expression \apatterns\a.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[E:extended-regexp?\begrep\b mode: extended regular expression \apatterns\a.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[X:augmented-regexp?\bxgrep\b mode: augmented regular expression \apatterns\a.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[P:perl-regexp?\bpgrep\b mode: \bperl\b(1) regular expression \apatterns\a.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[F:fixed-string?\bfgrep\b mode: fixed string \apatterns\a.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[A:approximate-regexp?\bagrep\b mode: approximate regular expression \apatterns\a (not implemented.)]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[C:context?Set the matched line context \abefore\a and \aafter\a count."
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" By default only matched lines are printed.]:?"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" [before[,after]]:=2,2]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[c:count?Only print a matching line count for each file.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[e:expression|pattern|regexp?Specify a matching \apattern\a. More than one"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" \apattern\a implies alternation. If this option is specified"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" then the command line \apattern\a must be omitted.]:"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[f:file?Each line in \apattern-file\a is a \apattern\a, placed into a single"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" alternating expression.]:"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" [pattern-file]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[H:filename|with-filename?Prefix each matched line with the containing file name.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[h:no-filename?Suppress containing file name prefix for each matched line.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[i:ignore-case?Ignore case when matching.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[l:files-with-matches?Only print file names with at least one match.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[L:files-without-matches?Only print file names with no matches.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[b:highlight?Highlight matches using the ansi terminal bold sequence.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[v:invert-match|revert-match?Invert the \apattern\a match sense.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[m:label?All patterns must be of the form \alabel\a:\apattern\a. Match and"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" count output will be prefixed by the corresponding \alabel\a:.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[O:lenient?Enable lenient \apattern\a interpretation. This is the default.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[x:line-match|line-regexp?Force \apatterns\a to match complete lines.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[n:number|line-number?Prefix each matched line with its line number.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[N:name?Set the standard input file name prefix to"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" \aname\a.]:[name:=empty]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[q:quiet|silent?Do not print matching lines.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[S:strict?Enable strict \apattern\a interpretation with diagnostics.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[s:suppress|no-messages?Suppress error and warning messages.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[t:total?Only print a single matching line count for all files.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[T:test?Enable implementation specific tests.]:"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[w:word-match|word-regexp?Force \apatterns\a to match complete words.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[a?Ignored for GNU compatibility.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"\n[ pattern ] [ file ... ]\n"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[+DIAGNOSTICS?Exit status 0 if matches were found, 1 if no matches were found,"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" where \b-v\b invertes the exit status. Exit status 2 for other"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" errors that are accompanied by a message on the standard error.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[+SEE ALSO?\bed\b(1), \bsed\b(1), \bperl\b(1), \bregex\b(3)]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[+CAVEATS?Some expressions of necessity require exponential space"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz"[+BUGS?Some expressions may use sub-optimal algorithms. For example,"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz" don't use this implementation to compute primes.]"
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * snarfed from Doug McElroy's C++ version
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * this grep is based on the Posix re package.
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * unfortunately it has to have a nonstandard interface.
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * 1. fgrep does not have usual operators. REG_LITERAL
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * caters for this.
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * 2. grep allows null expressions, hence REG_NULL.
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * 3. it may be possible to combine the multiple
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * patterns of grep into single patterns. important
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * special cases are handled by regcomb().
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * 4. anchoring by -x has to be done separately from
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * compilation (remember that fgrep has no ^ or $ operator),
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * hence REG_LEFT|REG_RIGHT. (An honest, but slow alternative:
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * run regexec with REG_NOSUB off and nmatch=1 and check
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz * whether the match is full length)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainztypedef struct Item_s /* list item - sue me for waste */
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz regmatch_t posvec[1]; /* match position vector */
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz Sfulong_t hits; /* total matched pattern count */
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz unsigned char byline; /* multiple pattern line by line*/
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz unsigned char count; /* count number of hits */
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz unsigned char label; /* all patterns labeled */
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz unsigned char query; /* return status but no output */
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz unsigned char suppress; /* no unopenable file messages */
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(ERROR_SYSTEM|3, "out of space (pattern `%s')", b);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(ERROR_SYSTEM|3, "out of space (word pattern `%s')", s);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (!(s = sfstruse(t)))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (c = regcomp(&x->re, s, state->options|REG_MULTIPLE))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz else if (state->label || regcomb(&p->tail->re, &x->re))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (!state->byline && (state->number || !state->label || !regrecord(&x->re)))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(ERROR_SYSTEM|3, "out of space (string `%s')", s);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz while (s = (char*)sfreserve(f, SF_UNBOUND, SF_LOCKR))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (!(n = sfvalue(f)))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz for (t = s + n; t > s && *--t != '\n'; t--);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz n = t - s + 1;
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz s[n - 1] = 0;
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz while ((s = sfgetr(f, '\n', 1)) || (s = sfgetr(f, '\n', -1)))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainzhighlight(Sfio_t* sp, const char* s, int n, int so, int eo)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz static const char bold[] = {CC_esc,'[','1','m'};
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz static const char normal[] = {CC_esc,'[','0','m'};
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainztypedef struct
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz highlight(sfstdout, s, len + 1, state->pos[0].rm_so, state->pos[0].rm_eo);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainzexecute(State_s *state, Sfio_t* input, char* name)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz register char* s;
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz sfsetbuf(input, state->buffer.base, state->buffer.size);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (!(result = regnexec(&x->re, s, len, state->posnum, state->pos, 0)))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz highlight(sfstdout, s, len + 1, state->pos[0].rm_so, state->pos[0].rm_eo);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz } while (x = x->next);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz highlight(sfstdout, s, len + 1, state->pos[0].rm_so, state->pos[0].rm_eo);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz register char* e;
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz register char* t;
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(ERROR_SYSTEM|3, "%s: line longer than %lu characters", name, len + e - s);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (!(s = sfreserve(input, SF_UNBOUND, 0)) || (len = sfvalue(input)) <= 0)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if ((sfvalue(input) || sferror(input)) && errno != EISDIR)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(ERROR_SYSTEM|3, "%s: line longer than %lu characters", name, len + e - s);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if ((result = regrexec(&x->re, span, t - span, state->posnum, state->pos, state->options, '\n', (void*)&r_x, record)) < 0)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz } while (x = x->next);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if ((sfvalue(input) || sferror(input)) && errno != EISDIR)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz while (t > s)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (*--t == '\n')
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if ((result = regrexec(&x->re, s, t - s, state->posnum, state->pos, state->options, '\n', (void*)&r_x, record)) < 0)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz } while (x = x->next);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz sfprintf(sfstdout, "%I*u\n", sizeof(hits), hits);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz sfprintf(sfstdout, "%I*u\n", sizeof(x->hits), x->hits);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz sfprintf(sfstdout, "%s:%s\n", name, x->string);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz } while (x = x->next);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainzint grep_main(int argc, char** argv, void *context)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (strcmp(astconf("CONFORMANCE", NiL, NiL), "standard"))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz s = "egrep";
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz s = "fgrep";
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz s = "pgrep";
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz s = "xgrep";
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz state.options &= ~(REG_AUGMENTED|REG_EXTENDED);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (c == 'b' && !(state.buffer.base = newof(0, char, state.buffer.size, 0)))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(ERROR_SYSTEM|3, "out of space [test buffer]");
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(3, "%s: invalid characters after test", s);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz addstring(&state, &state.pattern, opt_info.arg);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(3, "%s: not implemented", opt_info.name);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if ((state.options & REG_LITERAL) && (state.options & (REG_AUGMENTED|REG_EXTENDED)))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(3, "-F and -A or -P or -X are incompatible");
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if ((state.options & REG_LITERAL) && state.words)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz error(ERROR_SYSTEM|3, "-F and -w are incompatible");
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if (state.count || state.list || state.query || (state.options & REG_INVERT))
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz while (s = *argv++)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz if ((state.count & 2) && !state.query && !state.list)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz sfprintf(sfstdout, "%s:%I*u\n", x->string, sizeof(x->total), x->total);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz } while (x = x->next);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz sfprintf(sfstdout, "%I*u\n", sizeof(state.hits), state.hits);
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainz return (state.notfound && !state.query) ? 2 : !state.any;
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainzint b_egrep(int argc, char** argv, void *context)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainzint b_grep(int argc, char** argv, void *context)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainzint b_fgrep(int argc, char** argv, void *context)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainzint b_pgrep(int argc, char** argv, void *context)
34f9b3eef6fdadbda0a846aa4d68691ac40eace5Roland Mainzint b_xgrep(int argc, char** argv, void *context)