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>
52 #include "fastmatch.h"
55 static int linesqueued;
56 static int procline(struct str *l, int);
59 file_matching(const char *fname)
61 char *fname_base, *fname_buf;
64 ret = finclude ? false : true;
65 fname_buf = strdup(fname);
66 if (fname_buf == NULL)
68 fname_base = basename(fname_buf);
70 for (unsigned int i = 0; i < fpatterns; ++i) {
71 if (fnmatch(fpattern[i].pat, fname, 0) == 0 ||
72 fnmatch(fpattern[i].pat, fname_base, 0) == 0) {
73 if (fpattern[i].mode == EXCL_PAT) {
85 dir_matching(const char *dname)
89 ret = dinclude ? false : true;
91 for (unsigned int i = 0; i < dpatterns; ++i) {
93 fnmatch(dpattern[i].pat, dname, 0) == 0) {
94 if (dpattern[i].mode == EXCL_PAT)
104 * Processes a directory when a recursive search is performed with
105 * the -R option. Each appropriate file is passed to procfile().
108 grep_tree(char **argv)
119 fts_flags = FTS_COMFOLLOW;
122 fts_flags = FTS_PHYSICAL;
125 fts_flags = FTS_LOGICAL;
129 fts_flags |= FTS_NOSTAT | FTS_NOCHDIR;
131 if (!(fts = fts_open(argv, fts_flags, NULL)))
133 while ((p = fts_read(fts)) != NULL) {
134 switch (p->fts_info) {
140 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
145 if (dexclude || dinclude)
146 if (!dir_matching(p->fts_name) ||
147 !dir_matching(p->fts_path))
148 fts_set(fts, p, FTS_SKIP);
151 /* Print a warning for recursive directory loop */
152 warnx("warning: %s: recursive directory loop",
156 /* Check for file exclusion/inclusion */
158 if (fexclude || finclude)
159 ok &= file_matching(p->fts_path);
162 c += procfile(p->fts_path);
172 * Opens a file and processes it. Each file is processed line-by-line
173 * passing the lines to procline().
176 procfile(const char *fn)
186 if (strcmp(fn, "-") == 0) {
187 fn = label != NULL ? label : getstr(1);
190 if (!stat(fn, &sb)) {
191 /* Check if we need to process the file */
192 s = sb.st_mode & S_IFMT;
193 if (s == S_IFDIR && dirbehave == DIR_SKIP)
195 if ((s == S_IFIFO || s == S_IFCHR || s == S_IFBLK
196 || s == S_IFSOCK) && devbehave == DEV_SKIP)
208 ln.file = grep_malloc(strlen(fn) + 1);
216 for (c = 0; c == 0 || !(lflag || qflag); ) {
217 ln.off += ln.len + 1;
218 if ((ln.dat = grep_fgetln(f, &ln.len)) == NULL || ln.len == 0) {
219 if (ln.line_no == 0 && matchall)
224 if (ln.len > 0 && ln.dat[ln.len - 1] == '\n')
228 /* Return if we need to skip a binary file */
229 if (f->binary && binbehave == BINFILE_SKIP) {
235 /* Process the file line-by-line */
236 if ((t = procline(&ln, f->binary)) == 0 && Bflag > 0) {
241 if (mflag && mcount <= 0)
250 printf("%s:", ln.file);
253 if (lflag && !qflag && c != 0)
254 printf("%s%c", fn, nullflag ? 0 : '\n');
255 if (Lflag && !qflag && c == 0)
256 printf("%s%c", fn, nullflag ? 0 : '\n');
257 if (c && !cflag && !lflag && !Lflag &&
258 binbehave == BINFILE_BIN && f->binary && !qflag)
259 printf(getstr(8), fn);
266 #define iswword(x) (iswalnum((x)) || (x) == L'_')
269 * Processes a line comparing it with the specified patterns. Each pattern
270 * is looped to be compared along with the full string, saving each and every
271 * match, which is necessary to colorize the output and to count the
272 * matches. The matching lines are passed to printline() to display the
273 * appropriate output.
276 procline(struct str *l, int nottext)
278 regmatch_t matches[MAX_LINE_MATCHES];
282 int c = 0, m = 0, r = 0;
284 /* Loop to process the whole line */
285 while (st <= l->len) {
287 pmatch.rm_eo = l->len;
289 /* Loop to compare with all the patterns */
290 for (i = 0; i < patterns; i++) {
291 if (fg_pattern[i].pattern)
292 r = fastexec(&fg_pattern[i],
293 l->dat, 1, &pmatch, eflags);
295 r = regexec(&r_pattern[i], l->dat, 1,
297 r = (r == 0) ? 0 : REG_NOMATCH;
298 st = (cflags & REG_NOSUB)
300 : (size_t)pmatch.rm_eo;
301 if (r == REG_NOMATCH)
303 /* Check for full match */
305 if (pmatch.rm_so != 0 ||
306 (size_t)pmatch.rm_eo != l->len)
308 /* Check for whole word match */
309 if (r == 0 && (wflag || fg_pattern[i].word)) {
310 wchar_t wbegin, wend;
312 wbegin = wend = L' ';
313 if (pmatch.rm_so != 0 &&
314 sscanf(&l->dat[pmatch.rm_so - 1],
315 "%lc", &wbegin) != 1)
317 else if ((size_t)pmatch.rm_eo !=
319 sscanf(&l->dat[pmatch.rm_eo],
322 else if (iswword(wbegin) ||
329 if (m < MAX_LINE_MATCHES)
330 matches[m++] = pmatch;
331 /* matches - skip further patterns */
332 if ((color == NULL && !oflag) ||
343 /* One pass if we are not recording matches */
344 if (!wflag && ((color == NULL && !oflag) || qflag || lflag || Lflag))
347 if (st == (size_t)pmatch.rm_so)
348 break; /* No matches */
352 /* Count the matches if we have a match limit */
356 if (c && binbehave == BINFILE_BIN && nottext)
357 return (c); /* Binary file */
359 /* Dealing with the context */
360 if ((tail || c) && !cflag && !qflag && !lflag && !Lflag) {
362 if (!first && !prev && !tail && Aflag)
371 printline(l, ':', matches, m);
373 printline(l, '-', matches, m);
388 * Safe malloc() for internal use.
391 grep_malloc(size_t size)
395 if ((ptr = malloc(size)) == NULL)
401 * Safe calloc() for internal use.
404 grep_calloc(size_t nmemb, size_t size)
408 if ((ptr = calloc(nmemb, size)) == NULL)
414 * Safe realloc() for internal use.
417 grep_realloc(void *ptr, size_t size)
420 if ((ptr = realloc(ptr, size)) == NULL)
426 * Safe strdup() for internal use.
429 grep_strdup(const char *str)
433 if ((ret = strdup(str)) == NULL)
439 * Prints a matching line according to the command line options.
442 printline(struct str *line, int sep, regmatch_t *matches, int m)
449 fputs(line->file, stdout);
452 printf("%s", line->file);
459 printf("%d", line->line_no);
465 printf("%lld", (long long)line->off);
471 if ((oflag || color) && m > 0) {
472 for (i = 0; i < m; i++) {
474 fwrite(line->dat + a, matches[i].rm_so - a, 1,
477 fprintf(stdout, "\33[%sm\33[K", color);
479 fwrite(line->dat + matches[i].rm_so,
480 matches[i].rm_eo - matches[i].rm_so, 1,
483 fprintf(stdout, "\33[m\33[K");
484 a = matches[i].rm_eo;
489 if (line->len - a > 0)
490 fwrite(line->dat + a, line->len - a, 1, stdout);
494 fwrite(line->dat, line->len, 1, stdout);