1 /* $NetBSD: util.c,v 1.9 2011/02/27 17:33:37 joerg Exp $ */
3 /* $OpenBSD: util.c,v 1.39 2010/07/02 22:18:03 tedu Exp $ */
6 * Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
7 * Copyright (C) 2008-2010 Gabor Kovesdan <gabor@FreeBSD.org>
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
36 #include <sys/types.h>
54 static int linesqueued;
55 static int procline(struct str *l, int);
58 file_matching(const char *fname)
63 ret = finclude ? false : true;
64 fname_base = basename(fname);
66 for (unsigned int i = 0; i < fpatterns; ++i) {
67 if (fnmatch(fpattern[i].pat, fname, 0) == 0 ||
68 fnmatch(fpattern[i].pat, fname_base, 0) == 0) {
69 if (fpattern[i].mode == EXCL_PAT)
79 dir_matching(const char *dname)
83 ret = dinclude ? false : true;
85 for (unsigned int i = 0; i < dpatterns; ++i) {
87 fnmatch(dname, dpattern[i].pat, 0) == 0) {
88 if (dpattern[i].mode == EXCL_PAT)
98 * Processes a directory when a recursive search is performed with
99 * the -R option. Each appropriate file is passed to procfile().
102 grep_tree(char **argv)
106 char *d, *dir = NULL;
114 fts_flags = FTS_COMFOLLOW;
117 fts_flags = FTS_PHYSICAL;
120 fts_flags = FTS_LOGICAL;
124 fts_flags |= FTS_NOSTAT | FTS_NOCHDIR;
126 if (!(fts = fts_open(argv, fts_flags, NULL)))
128 while ((p = fts_read(fts)) != NULL) {
129 switch (p->fts_info) {
133 errx(2, "%s: %s", p->fts_path, strerror(p->fts_errno));
140 /* Print a warning for recursive directory loop */
141 warnx("warning: %s: recursive directory loop",
145 /* Check for file exclusion/inclusion */
147 if (dexclude || dinclude) {
148 if ((d = strrchr(p->fts_path, '/')) != NULL) {
149 dir = grep_malloc(sizeof(char) *
150 (d - p->fts_path + 1));
151 memcpy(dir, p->fts_path,
153 dir[d - p->fts_path] = '\0';
155 ok = dir_matching(dir);
159 if (fexclude || finclude)
160 ok &= file_matching(p->fts_path);
163 c += procfile(p->fts_path);
173 * Opens a file and processes it. Each file is processed line-by-line
174 * passing the lines to procline().
177 procfile(const char *fn)
185 if (mflag && (mcount <= 0))
188 if (strcmp(fn, "-") == 0) {
189 fn = label != NULL ? label : getstr(1);
192 if (!stat(fn, &sb)) {
193 /* Check if we need to process the file */
194 s = sb.st_mode & S_IFMT;
195 if (s == S_IFDIR && dirbehave == DIR_SKIP)
197 if ((s == S_IFIFO || s == S_IFCHR || s == S_IFBLK
198 || s == S_IFSOCK) && devbehave == DEV_SKIP)
211 ln.file = grep_malloc(strlen(fn) + 1);
219 for (c = 0; c == 0 || !(lflag || qflag); ) {
220 ln.off += ln.len + 1;
221 if ((ln.dat = grep_fgetln(f, &ln.len)) == NULL || ln.len == 0) {
222 if (ln.line_no == 0 && matchall)
227 if (ln.len > 0 && ln.dat[ln.len - 1] == '\n')
231 /* Return if we need to skip a binary file */
232 if (f->binary && binbehave == BINFILE_SKIP) {
238 /* Process the file line-by-line */
239 if ((t = procline(&ln, f->binary)) == 0 && Bflag > 0) {
245 /* Count the matches if we have a match limit */
258 printf("%s:", ln.file);
261 if (lflag && !qflag && c != 0)
263 if (Lflag && !qflag && c == 0)
265 if (c && !cflag && !lflag && !Lflag &&
266 binbehave == BINFILE_BIN && f->binary && !qflag)
267 printf(getstr(8), fn);
274 #define iswword(x) (iswalnum((x)) || (x) == L'_')
277 * Processes a line comparing it with the specified patterns. Each pattern
278 * is looped to be compared along with the full string, saving each and every
279 * match, which is necessary to colorize the output and to count the
280 * matches. The matching lines are passed to printline() to display the
281 * appropriate output.
284 procline(struct str *l, int nottext)
286 regmatch_t matches[MAX_LINE_MATCHES];
290 int c = 0, m = 0, r = 0;
293 /* Loop to process the whole line */
294 while (st <= l->len) {
296 pmatch.rm_eo = l->len;
298 /* Loop to compare with all the patterns */
299 for (i = 0; i < patterns; i++) {
301 * XXX: grep_search() is a workaround for speed up and should be
302 * removed in the future. See fastgrep.c.
304 if (fg_pattern[i].pattern)
305 r = grep_search(&fg_pattern[i],
306 (unsigned char *)l->dat,
309 r = regexec(&r_pattern[i], l->dat, 1,
311 r = (r == 0) ? 0 : REG_NOMATCH;
313 if (r == REG_NOMATCH)
315 /* Check for full match */
317 if (pmatch.rm_so != 0 ||
318 (size_t)pmatch.rm_eo != l->len)
320 /* Check for whole word match */
321 if (r == 0 && (wflag || fg_pattern[i].word)) {
324 wbegin = wend = L' ';
325 if (pmatch.rm_so != 0 &&
326 sscanf(&l->dat[pmatch.rm_so - 1],
327 "%lc", &wbegin) != 1)
329 else if ((size_t)pmatch.rm_eo !=
331 sscanf(&l->dat[pmatch.rm_eo],
334 else if (iswword(wbegin) ||
341 if (m < MAX_LINE_MATCHES)
342 matches[m++] = pmatch;
343 /* matches - skip further patterns */
344 if ((color == NULL && !oflag) ||
354 /* One pass if we are not recording matches */
355 if ((color == NULL && !oflag) || qflag || lflag)
358 if (st == (size_t)pmatch.rm_so)
359 break; /* No matches */
364 if (c && binbehave == BINFILE_BIN && nottext)
365 return (c); /* Binary file */
367 /* Dealing with the context */
368 if ((tail || c) && !cflag && !qflag && !lflag && !Lflag) {
370 if (!first && !prev && !tail && Aflag)
379 printline(l, ':', matches, m);
381 printline(l, '-', matches, m);
396 * Safe malloc() for internal use.
399 grep_malloc(size_t size)
403 if ((ptr = malloc(size)) == NULL)
409 * Safe calloc() for internal use.
412 grep_calloc(size_t nmemb, size_t size)
416 if ((ptr = calloc(nmemb, size)) == NULL)
422 * Safe realloc() for internal use.
425 grep_realloc(void *ptr, size_t size)
428 if ((ptr = realloc(ptr, size)) == NULL)
434 * Safe strdup() for internal use.
437 grep_strdup(const char *str)
441 if ((ret = strdup(str)) == NULL)
447 * Prints a matching line according to the command line options.
450 printline(struct str *line, int sep, regmatch_t *matches, int m)
457 fputs(line->file, stdout);
459 printf("%s", line->file);
467 printf("%d", line->line_no);
473 printf("%lld", (long long)line->off);
479 if ((oflag || color) && m > 0) {
480 for (i = 0; i < m; i++) {
482 fwrite(line->dat + a, matches[i].rm_so - a, 1,
485 fprintf(stdout, "\33[%sm\33[K", color);
487 fwrite(line->dat + matches[i].rm_so,
488 matches[i].rm_eo - matches[i].rm_so, 1,
491 fprintf(stdout, "\33[m\33[K");
492 a = matches[i].rm_eo;
497 if (line->len - a > 0)
498 fwrite(line->dat + a, line->len - a, 1, stdout);
502 fwrite(line->dat, line->len, 1, stdout);