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 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
8 * Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
9 * Copyright (C) 2008-2010 Gabor Kovesdan <gabor@FreeBSD.org>
10 * Copyright (C) 2017 Kyle Evans <kevans@FreeBSD.org>
11 * All rights reserved.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
39 #include <sys/types.h>
57 static bool first_match = true;
60 * Match printing context
63 long long tail; /* Number of trailing lines to record */
64 int last_outed; /* Number of lines since last output */
65 bool doctx; /* Printing context? */
66 bool printmatch; /* Printing matches? */
67 bool same_file; /* Same file as previously printed? */
70 static void procmatch_match(struct mprintc *mc, struct parsec *pc);
71 static void procmatch_nomatch(struct mprintc *mc, struct parsec *pc);
72 static bool procmatches(struct mprintc *mc, struct parsec *pc, bool matched);
73 #ifdef WITH_INTERNAL_NOSPEC
74 static int litexec(const struct pat *pat, const char *string,
75 size_t nmatch, regmatch_t pmatch[]);
77 static bool procline(struct parsec *pc);
78 static void printline(struct parsec *pc, int sep);
79 static void printline_metadata(struct str *line, int sep);
82 file_matching(const char *fname)
84 char *fname_base, *fname_buf;
87 ret = finclude ? false : true;
88 fname_buf = strdup(fname);
89 if (fname_buf == NULL)
91 fname_base = basename(fname_buf);
93 for (unsigned int i = 0; i < fpatterns; ++i) {
94 if (fnmatch(fpattern[i].pat, fname, 0) == 0 ||
95 fnmatch(fpattern[i].pat, fname_base, 0) == 0)
97 * The last pattern matched wins exclusion/inclusion
98 * rights, so we can't reasonably bail out early here.
100 ret = (fpattern[i].mode != EXCL_PAT);
107 dir_matching(const char *dname)
111 ret = dinclude ? false : true;
113 for (unsigned int i = 0; i < dpatterns; ++i) {
114 if (dname != NULL && fnmatch(dpattern[i].pat, dname, 0) == 0)
116 * The last pattern matched wins exclusion/inclusion
117 * rights, so we can't reasonably bail out early here.
119 ret = (dpattern[i].mode != EXCL_PAT);
125 * Processes a directory when a recursive search is performed with
126 * the -R option. Each appropriate file is passed to procfile().
129 grep_tree(char **argv)
135 const char *wd[] = { ".", NULL };
139 /* This switch effectively initializes 'fts_flags' */
142 fts_flags = FTS_COMFOLLOW;
145 fts_flags = FTS_PHYSICAL;
148 fts_flags = FTS_LOGICAL;
151 fts_flags |= FTS_NOSTAT | FTS_NOCHDIR;
153 fts = fts_open((argv[0] == NULL) ?
154 __DECONST(char * const *, wd) : argv, fts_flags, NULL);
157 while ((p = fts_read(fts)) != NULL) {
158 switch (p->fts_info) {
164 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
169 if (dexclude || dinclude)
170 if (!dir_matching(p->fts_name) ||
171 !dir_matching(p->fts_path))
172 fts_set(fts, p, FTS_SKIP);
175 /* Print a warning for recursive directory loop */
176 warnx("warning: %s: recursive directory loop",
180 /* Check for file exclusion/inclusion */
182 if (fexclude || finclude)
183 ok &= file_matching(p->fts_path);
185 if (ok && procfile(p->fts_path))
196 procmatch_match(struct mprintc *mc, struct parsec *pc)
200 if (!first_match && (!mc->same_file || mc->last_outed > 0))
207 /* Print the matching line, but only if not quiet/binary */
208 if (mc->printmatch) {
210 while (pc->matchidx >= MAX_MATCHES) {
211 /* Reset matchidx and try again */
213 if (procline(pc) == !vflag)
219 mc->same_file = true;
225 procmatch_nomatch(struct mprintc *mc, struct parsec *pc)
228 /* Deal with any -A context as needed */
230 grep_printline(&pc->ln, '-');
234 } else if (Bflag == 0 || (Bflag > 0 && enqueue(&pc->ln)))
236 * Enqueue non-matching lines for -B context. If we're not
237 * actually doing -B context or if the enqueue resulted in a
238 * line being rotated out, then go ahead and increment
239 * last_outed to signify a gap between context/match.
245 * Process any matches in the current parsing context, return a boolean
246 * indicating whether we should halt any further processing or not. 'true' to
247 * continue processing, 'false' to halt.
250 procmatches(struct mprintc *mc, struct parsec *pc, bool matched)
253 if (mflag && mcount <= 0) {
255 * We already hit our match count, but we need to keep dumping
256 * lines until we've lost our tail.
258 grep_printline(&pc->ln, '-');
260 return (mc->tail != 0);
264 * XXX TODO: This should loop over pc->matches and handle things on a
265 * line-by-line basis, setting up a `struct str` as needed.
267 /* Deal with any -B context or context separators */
269 procmatch_match(mc, pc);
271 /* Count the matches if we have a match limit */
273 /* XXX TODO: Decrement by number of matched lines */
276 return (mc->tail != 0);
278 } else if (mc->doctx)
279 procmatch_nomatch(mc, pc);
285 * Opens a file and processes it. Each file is processed line-by-line
286 * passing the lines to procline().
289 procfile(const char *fn)
299 if (strcmp(fn, "-") == 0) {
300 fn = label != NULL ? label : errstr[1];
303 if (stat(fn, &sb) == 0) {
304 /* Check if we need to process the file */
305 s = sb.st_mode & S_IFMT;
306 if (dirbehave == DIR_SKIP && s == S_IFDIR)
308 if (devbehave == DEV_SKIP && (s == S_IFIFO ||
309 s == S_IFCHR || s == S_IFBLK || s == S_IFSOCK))
321 pc.ln.file = grep_strdup(fn);
326 pc.binary = f->binary;
328 memset(&mc, 0, sizeof(mc));
329 mc.printmatch = true;
330 if ((pc.binary && binbehave == BINFILE_BIN) || cflag || qflag ||
332 mc.printmatch = false;
333 if (mc.printmatch && (Aflag != 0 || Bflag != 0))
335 if (mc.printmatch && (Aflag != 0 || Bflag != 0 || mflag || nflag))
339 for (lines = 0; lines == 0 || !(lflag || qflag); ) {
341 * XXX TODO: We need to revisit this in a chunking world. We're
342 * not going to be doing per-line statistics because of the
343 * overhead involved. procmatches can figure that stuff out as
345 /* Reset per-line statistics */
350 pc.ln.off += pc.ln.len + 1;
351 /* XXX TODO: Grab a chunk */
352 if ((pc.ln.dat = grep_fgetln(f, &pc)) == NULL ||
356 if (pc.ln.len > 0 && pc.ln.dat[pc.ln.len - 1] == fileeol)
360 /* Return if we need to skip a binary file */
361 if (pc.binary && binbehave == BINFILE_SKIP) {
368 if (mflag && mcount <= 0) {
370 * Short-circuit, already hit match count and now we're
371 * just picking up any remaining pieces.
373 if (!procmatches(&mc, &pc, false))
377 line_matched = procline(&pc) == !vflag;
381 /* Halt processing if we hit our match limit */
382 if (!procmatches(&mc, &pc, line_matched))
391 printf("%s:", pc.ln.file);
392 printf("%u\n", lines);
394 if (lflag && !qflag && lines != 0)
395 printf("%s%c", fn, nullflag ? 0 : '\n');
396 if (Lflag && !qflag && lines == 0)
397 printf("%s%c", fn, nullflag ? 0 : '\n');
398 if (lines != 0 && !cflag && !lflag && !Lflag &&
399 binbehave == BINFILE_BIN && f->binary && !qflag)
400 printf(errstr[7], fn);
407 #ifdef WITH_INTERNAL_NOSPEC
409 * Internal implementation of literal string search within a string, modeled
410 * after regexec(3), for use when the regex(3) implementation doesn't offer
411 * either REG_NOSPEC or REG_LITERAL. This does not apply in the default FreeBSD
412 * config, but in other scenarios such as building against libgnuregex or on
413 * some non-FreeBSD OSes.
416 litexec(const struct pat *pat, const char *string, size_t nmatch,
419 char *(*strstr_fn)(const char *, const char *);
422 size_t idx, n, ofs, stringlen;
424 if (cflags & REG_ICASE)
425 strstr_fn = strcasestr;
429 ofs = pmatch[0].rm_so;
430 stringlen = pmatch[0].rm_eo;
431 if (ofs >= stringlen)
432 return (REG_NOMATCH);
433 subject = strndup(string, stringlen);
436 for (n = 0; ofs < stringlen;) {
437 search = (subject + ofs);
438 if ((unsigned long)pat->len > strlen(search))
440 sub = strstr_fn(search, pat->pat);
442 * Ignoring the empty string possibility due to context: grep optimizes
443 * for empty patterns and will never reach this point.
448 /* Fill in pmatch if necessary */
450 pmatch[idx].rm_so = ofs + (sub - search);
451 pmatch[idx].rm_eo = pmatch[idx].rm_so + pat->len;
454 ofs = pmatch[idx].rm_so + 1;
456 /* We only needed to know if we match or not */
460 if (n > 0 && nmatch > 0)
461 for (n = idx; n < nmatch; ++n)
462 pmatch[n].rm_so = pmatch[n].rm_eo = -1;
464 return (n > 0 ? 0 : REG_NOMATCH);
466 #endif /* WITH_INTERNAL_NOSPEC */
468 #define iswword(x) (iswalnum((x)) || (x) == L'_')
471 * Processes a line comparing it with the specified patterns. Each pattern
472 * is looped to be compared along with the full string, saving each and every
473 * match, which is necessary to colorize the output and to count the
474 * matches. The matching lines are passed to printline() to display the
475 * appropriate output.
478 procline(struct parsec *pc)
480 regmatch_t pmatch, lastmatch, chkmatch;
481 wchar_t wbegin, wend;
484 int r = 0, leflags = eflags;
485 size_t startm = 0, matchidx;
487 bool lastmatched, matched;
489 matchidx = pc->matchidx;
491 /* Null pattern shortcuts. */
493 if (xflag && pc->ln.len == 0) {
494 /* Matches empty lines (-x). */
496 } else if (!wflag && !xflag) {
497 /* Matches every line (no -w or -x). */
502 * If we only have the NULL pattern, whether we match or not
503 * depends on if we got here with -w or -x. If either is set,
504 * the answer is no. If we have other patterns, we'll defer
508 return (!(wflag || xflag));
510 } else if (patterns == 0) {
511 /* Pattern file with no patterns. */
518 /* Initialize to avoid a false positive warning from GCC. */
519 lastmatch.rm_so = lastmatch.rm_eo = 0;
521 /* Loop to process the whole line */
522 while (st <= pc->ln.len) {
526 if (st > 0 && pc->ln.dat[st - 1] != fileeol)
527 leflags |= REG_NOTBOL;
528 /* Loop to compare with all the patterns */
529 for (i = 0; i < patterns; i++) {
531 pmatch.rm_eo = pc->ln.len;
532 #ifdef WITH_INTERNAL_NOSPEC
533 if (grepbehave == GREP_FIXED)
534 r = litexec(&pattern[i], pc->ln.dat, 1, &pmatch);
537 r = regexec(&r_pattern[i], pc->ln.dat, 1, &pmatch,
541 /* Check for full match */
542 if (xflag && (pmatch.rm_so != 0 ||
543 (size_t)pmatch.rm_eo != pc->ln.len))
545 /* Check for whole word match */
547 wbegin = wend = L' ';
548 if (pmatch.rm_so != 0 &&
549 sscanf(&pc->ln.dat[pmatch.rm_so - 1],
550 "%lc", &wbegin) != 1)
552 else if ((size_t)pmatch.rm_eo !=
554 sscanf(&pc->ln.dat[pmatch.rm_eo],
557 else if (iswword(wbegin) ||
561 * If we're doing whole word matching and we
562 * matched once, then we should try the pattern
563 * again after advancing just past the start of
564 * the earliest match. This allows the pattern
565 * to match later on in the line and possibly
566 * still match a whole word.
568 if (r == REG_NOMATCH &&
569 (retry == pc->lnstart ||
570 (unsigned int)pmatch.rm_so + 1 < retry))
571 retry = pmatch.rm_so + 1;
572 if (r == REG_NOMATCH)
582 * Replace previous match if the new one is earlier
583 * and/or longer. This will lead to some amount of
584 * extra work if -o/--color are specified, but it's
585 * worth it from a correctness point of view.
587 if (matchidx > startm) {
588 chkmatch = pc->matches[matchidx - 1];
589 if (pmatch.rm_so < chkmatch.rm_so ||
590 (pmatch.rm_so == chkmatch.rm_so &&
591 (pmatch.rm_eo - pmatch.rm_so) >
592 (chkmatch.rm_eo - chkmatch.rm_so))) {
593 pc->matches[matchidx - 1] = pmatch;
597 /* Advance as normal if not */
598 pc->matches[matchidx++] = pmatch;
601 /* avoid excessive matching - skip further patterns */
602 if ((color == NULL && !oflag) || qflag || lflag ||
603 matchidx >= MAX_MATCHES) {
611 * Advance to just past the start of the earliest match, try
612 * again just in case we still have a chance to match later in
615 if (!lastmatched && retry > pc->lnstart) {
620 /* XXX TODO: We will need to keep going, since we're chunky */
621 /* One pass if we are not recording matches */
622 if (!wflag && ((color == NULL && !oflag) || qflag || lflag || Lflag))
625 /* If we didn't have any matches or REG_NOSUB set */
626 if (!lastmatched || (cflags & REG_NOSUB))
632 else if (st == nst && lastmatch.rm_so == lastmatch.rm_eo)
633 /* Zero-length match -- advance one more so we don't get stuck */
636 /* Advance st based on previous matches */
641 /* Reflect the new matchidx in the context */
642 pc->matchidx = matchidx;
647 * Safe malloc() for internal use.
650 grep_malloc(size_t size)
654 if ((ptr = malloc(size)) == NULL)
660 * Safe calloc() for internal use.
663 grep_calloc(size_t nmemb, size_t size)
667 if ((ptr = calloc(nmemb, size)) == NULL)
673 * Safe realloc() for internal use.
676 grep_realloc(void *ptr, size_t size)
679 if ((ptr = realloc(ptr, size)) == NULL)
685 * Safe strdup() for internal use.
688 grep_strdup(const char *str)
692 if ((ret = strdup(str)) == NULL)
698 * Print an entire line as-is, there are no inline matches to consider. This is
699 * used for printing context.
701 void grep_printline(struct str *line, int sep) {
702 printline_metadata(line, sep);
703 fwrite(line->dat, line->len, 1, stdout);
708 printline_metadata(struct str *line, int sep)
715 fputs(line->file, stdout);
718 printf("%s", line->file);
725 printf("%d", line->line_no);
731 printf("%lld", (long long)(line->off + line->boff));
739 * Prints a matching line according to the command line options.
742 printline(struct parsec *pc, int sep)
748 /* If matchall, everything matches but don't actually print for -o */
749 if (oflag && matchall)
752 matchidx = pc->matchidx;
755 if ((oflag || color) && matchidx > 0) {
756 /* Only print metadata once per line if --color */
757 if (!oflag && pc->printed == 0)
758 printline_metadata(&pc->ln, sep);
759 for (i = 0; i < matchidx; i++) {
760 match = pc->matches[i];
761 /* Don't output zero length matches */
762 if (match.rm_so == match.rm_eo)
765 * Metadata is printed on a per-line basis, so every
766 * match gets file metadata with the -o flag.
769 pc->ln.boff = match.rm_so;
770 printline_metadata(&pc->ln, sep);
772 fwrite(pc->ln.dat + a, match.rm_so - a, 1,
775 fprintf(stdout, "\33[%sm\33[K", color);
776 fwrite(pc->ln.dat + match.rm_so,
777 match.rm_eo - match.rm_so, 1, stdout);
779 fprintf(stdout, "\33[m\33[K");
785 if (pc->ln.len - a > 0)
786 fwrite(pc->ln.dat + a, pc->ln.len - a, 1,
791 grep_printline(&pc->ln, sep);