4 #include "xdiff-interface.h"
6 void append_header_grep_pattern(struct grep_opt *opt, enum grep_header_field field, const char *pat)
8 struct grep_pat *p = xcalloc(1, sizeof(*p));
12 p->token = GREP_PATTERN_HEAD;
14 *opt->header_tail = p;
15 opt->header_tail = &p->next;
19 void append_grep_pattern(struct grep_opt *opt, const char *pat,
20 const char *origin, int no, enum grep_pat_token t)
22 struct grep_pat *p = xcalloc(1, sizeof(*p));
27 *opt->pattern_tail = p;
28 opt->pattern_tail = &p->next;
32 struct grep_opt *grep_opt_dup(const struct grep_opt *opt)
35 struct grep_opt *ret = xmalloc(sizeof(struct grep_opt));
38 ret->pattern_list = NULL;
39 ret->pattern_tail = &ret->pattern_list;
41 for(pat = opt->pattern_list; pat != NULL; pat = pat->next)
43 if(pat->token == GREP_PATTERN_HEAD)
44 append_header_grep_pattern(ret, pat->field,
47 append_grep_pattern(ret, pat->pattern, pat->origin,
54 static void compile_regexp(struct grep_pat *p, struct grep_opt *opt)
58 p->word_regexp = opt->word_regexp;
59 p->ignore_case = opt->ignore_case;
60 p->fixed = opt->fixed;
65 err = regcomp(&p->regexp, p->pattern, opt->regflags);
70 sprintf(where, "In '%s' at %d, ",
73 sprintf(where, "%s, ", p->origin);
76 regerror(err, &p->regexp, errbuf, 1024);
78 die("%s'%s': %s", where, p->pattern, errbuf);
82 static struct grep_expr *compile_pattern_or(struct grep_pat **);
83 static struct grep_expr *compile_pattern_atom(struct grep_pat **list)
92 case GREP_PATTERN: /* atom */
93 case GREP_PATTERN_HEAD:
94 case GREP_PATTERN_BODY:
95 x = xcalloc(1, sizeof (struct grep_expr));
96 x->node = GREP_NODE_ATOM;
100 case GREP_OPEN_PAREN:
102 x = compile_pattern_or(list);
103 if (!*list || (*list)->token != GREP_CLOSE_PAREN)
104 die("unmatched parenthesis");
105 *list = (*list)->next;
112 static struct grep_expr *compile_pattern_not(struct grep_pat **list)
123 die("--not not followed by pattern expression");
125 x = xcalloc(1, sizeof (struct grep_expr));
126 x->node = GREP_NODE_NOT;
127 x->u.unary = compile_pattern_not(list);
129 die("--not followed by non pattern expression");
132 return compile_pattern_atom(list);
136 static struct grep_expr *compile_pattern_and(struct grep_pat **list)
139 struct grep_expr *x, *y, *z;
141 x = compile_pattern_not(list);
143 if (p && p->token == GREP_AND) {
145 die("--and not followed by pattern expression");
147 y = compile_pattern_and(list);
149 die("--and not followed by pattern expression");
150 z = xcalloc(1, sizeof (struct grep_expr));
151 z->node = GREP_NODE_AND;
152 z->u.binary.left = x;
153 z->u.binary.right = y;
159 static struct grep_expr *compile_pattern_or(struct grep_pat **list)
162 struct grep_expr *x, *y, *z;
164 x = compile_pattern_and(list);
166 if (x && p && p->token != GREP_CLOSE_PAREN) {
167 y = compile_pattern_or(list);
169 die("not a pattern expression %s", p->pattern);
170 z = xcalloc(1, sizeof (struct grep_expr));
171 z->node = GREP_NODE_OR;
172 z->u.binary.left = x;
173 z->u.binary.right = y;
179 static struct grep_expr *compile_pattern_expr(struct grep_pat **list)
181 return compile_pattern_or(list);
184 void compile_grep_patterns(struct grep_opt *opt)
187 struct grep_expr *header_expr = NULL;
189 if (opt->header_list) {
190 p = opt->header_list;
191 header_expr = compile_pattern_expr(&p);
193 die("incomplete pattern expression: %s", p->pattern);
194 for (p = opt->header_list; p; p = p->next) {
196 case GREP_PATTERN: /* atom */
197 case GREP_PATTERN_HEAD:
198 case GREP_PATTERN_BODY:
199 compile_regexp(p, opt);
208 for (p = opt->pattern_list; p; p = p->next) {
210 case GREP_PATTERN: /* atom */
211 case GREP_PATTERN_HEAD:
212 case GREP_PATTERN_BODY:
213 compile_regexp(p, opt);
221 if (opt->all_match || header_expr)
223 else if (!opt->extended)
226 /* Then bundle them up in an expression.
227 * A classic recursive descent parser would do.
229 p = opt->pattern_list;
231 opt->pattern_expression = compile_pattern_expr(&p);
233 die("incomplete pattern expression: %s", p->pattern);
238 if (opt->pattern_expression) {
240 z = xcalloc(1, sizeof(*z));
241 z->node = GREP_NODE_OR;
242 z->u.binary.left = opt->pattern_expression;
243 z->u.binary.right = header_expr;
244 opt->pattern_expression = z;
246 opt->pattern_expression = header_expr;
251 static void free_pattern_expr(struct grep_expr *x)
257 free_pattern_expr(x->u.unary);
261 free_pattern_expr(x->u.binary.left);
262 free_pattern_expr(x->u.binary.right);
268 void free_grep_patterns(struct grep_opt *opt)
270 struct grep_pat *p, *n;
272 for (p = opt->pattern_list; p; p = n) {
275 case GREP_PATTERN: /* atom */
276 case GREP_PATTERN_HEAD:
277 case GREP_PATTERN_BODY:
288 free_pattern_expr(opt->pattern_expression);
291 static char *end_of_line(char *cp, unsigned long *left)
293 unsigned long l = *left;
294 while (l && *cp != '\n') {
302 static int word_char(char ch)
304 return isalnum(ch) || ch == '_';
307 static void output_color(struct grep_opt *opt, const void *data, size_t size,
310 if (opt->color && color && color[0]) {
311 opt->output(opt, color, strlen(color));
312 opt->output(opt, data, size);
313 opt->output(opt, GIT_COLOR_RESET, strlen(GIT_COLOR_RESET));
315 opt->output(opt, data, size);
318 static void output_sep(struct grep_opt *opt, char sign)
320 if (opt->null_following_name)
321 opt->output(opt, "\0", 1);
323 output_color(opt, &sign, 1, opt->color_sep);
326 static void show_name(struct grep_opt *opt, const char *name)
328 output_color(opt, name, strlen(name), opt->color_filename);
329 opt->output(opt, opt->null_following_name ? "\0" : "\n", 1);
333 static int fixmatch(const char *pattern, char *line, int ignore_case, regmatch_t *match)
337 hit = strcasestr(line, pattern);
339 hit = strstr(line, pattern);
342 match->rm_so = match->rm_eo = -1;
346 match->rm_so = hit - line;
347 match->rm_eo = match->rm_so + strlen(pattern);
352 static int strip_timestamp(char *bol, char **eol_p)
357 while (bol < --eol) {
373 { "committer ", 10 },
376 static int match_one_pattern(struct grep_pat *p, char *bol, char *eol,
377 enum grep_context ctx,
378 regmatch_t *pmatch, int eflags)
382 const char *start = bol;
384 if ((p->token != GREP_PATTERN) &&
385 ((p->token == GREP_PATTERN_HEAD) != (ctx == GREP_CONTEXT_HEAD)))
388 if (p->token == GREP_PATTERN_HEAD) {
391 assert(p->field < ARRAY_SIZE(header_field));
392 field = header_field[p->field].field;
393 len = header_field[p->field].len;
394 if (strncmp(bol, field, len))
397 saved_ch = strip_timestamp(bol, &eol);
402 hit = !fixmatch(p->pattern, bol, p->ignore_case, pmatch);
404 hit = !regexec(&p->regexp, bol, 1, pmatch, eflags);
406 if (hit && p->word_regexp) {
407 if ((pmatch[0].rm_so < 0) ||
408 (eol - bol) < pmatch[0].rm_so ||
409 (pmatch[0].rm_eo < 0) ||
410 (eol - bol) < pmatch[0].rm_eo)
411 die("regexp returned nonsense");
413 /* Match beginning must be either beginning of the
414 * line, or at word boundary (i.e. the last char must
415 * not be a word char). Similarly, match end must be
416 * either end of the line, or at word boundary
417 * (i.e. the next char must not be a word char).
419 if ( ((pmatch[0].rm_so == 0) ||
420 !word_char(bol[pmatch[0].rm_so-1])) &&
421 ((pmatch[0].rm_eo == (eol-bol)) ||
422 !word_char(bol[pmatch[0].rm_eo])) )
427 /* Words consist of at least one character. */
428 if (pmatch->rm_so == pmatch->rm_eo)
431 if (!hit && pmatch[0].rm_so + bol + 1 < eol) {
432 /* There could be more than one match on the
433 * line, and the first match might not be
434 * strict word match. But later ones could be!
435 * Forward to the next possible start, i.e. the
436 * next position following a non-word char.
438 bol = pmatch[0].rm_so + bol + 1;
439 while (word_char(bol[-1]) && bol < eol)
441 eflags |= REG_NOTBOL;
446 if (p->token == GREP_PATTERN_HEAD && saved_ch)
449 pmatch[0].rm_so += bol - start;
450 pmatch[0].rm_eo += bol - start;
455 static int match_expr_eval(struct grep_expr *x, char *bol, char *eol,
456 enum grep_context ctx, int collect_hits)
462 die("Not a valid grep expression");
465 h = match_one_pattern(x->u.atom, bol, eol, ctx, &match, 0);
468 h = !match_expr_eval(x->u.unary, bol, eol, ctx, 0);
471 if (!match_expr_eval(x->u.binary.left, bol, eol, ctx, 0))
473 h = match_expr_eval(x->u.binary.right, bol, eol, ctx, 0);
477 return (match_expr_eval(x->u.binary.left,
479 match_expr_eval(x->u.binary.right,
481 h = match_expr_eval(x->u.binary.left, bol, eol, ctx, 0);
482 x->u.binary.left->hit |= h;
483 h |= match_expr_eval(x->u.binary.right, bol, eol, ctx, 1);
486 die("Unexpected node type (internal error) %d", x->node);
493 static int match_expr(struct grep_opt *opt, char *bol, char *eol,
494 enum grep_context ctx, int collect_hits)
496 struct grep_expr *x = opt->pattern_expression;
497 return match_expr_eval(x, bol, eol, ctx, collect_hits);
500 static int match_line(struct grep_opt *opt, char *bol, char *eol,
501 enum grep_context ctx, int collect_hits)
507 return match_expr(opt, bol, eol, ctx, collect_hits);
509 /* we do not call with collect_hits without being extended */
510 for (p = opt->pattern_list; p; p = p->next) {
511 if (match_one_pattern(p, bol, eol, ctx, &match, 0))
517 static int match_next_pattern(struct grep_pat *p, char *bol, char *eol,
518 enum grep_context ctx,
519 regmatch_t *pmatch, int eflags)
523 if (!match_one_pattern(p, bol, eol, ctx, &match, eflags))
525 if (match.rm_so < 0 || match.rm_eo < 0)
527 if (pmatch->rm_so >= 0 && pmatch->rm_eo >= 0) {
528 if (match.rm_so > pmatch->rm_so)
530 if (match.rm_so == pmatch->rm_so && match.rm_eo < pmatch->rm_eo)
533 pmatch->rm_so = match.rm_so;
534 pmatch->rm_eo = match.rm_eo;
538 static int next_match(struct grep_opt *opt, char *bol, char *eol,
539 enum grep_context ctx, regmatch_t *pmatch, int eflags)
544 pmatch->rm_so = pmatch->rm_eo = -1;
546 for (p = opt->pattern_list; p; p = p->next) {
548 case GREP_PATTERN: /* atom */
549 case GREP_PATTERN_HEAD:
550 case GREP_PATTERN_BODY:
551 hit |= match_next_pattern(p, bol, eol, ctx,
562 static void show_line(struct grep_opt *opt, char *bol, char *eol,
563 const char *name, unsigned lno, char sign)
565 int rest = eol - bol;
566 char *line_color = NULL;
568 if (opt->pre_context || opt->post_context) {
569 if (opt->last_shown == 0) {
570 if (opt->show_hunk_mark) {
571 output_color(opt, "--", 2, opt->color_sep);
572 opt->output(opt, "\n", 1);
574 } else if (lno > opt->last_shown + 1) {
575 output_color(opt, "--", 2, opt->color_sep);
576 opt->output(opt, "\n", 1);
579 opt->last_shown = lno;
582 output_color(opt, name, strlen(name), opt->color_filename);
583 output_sep(opt, sign);
587 snprintf(buf, sizeof(buf), "%d", lno);
588 output_color(opt, buf, strlen(buf), opt->color_lineno);
589 output_sep(opt, sign);
593 enum grep_context ctx = GREP_CONTEXT_BODY;
598 line_color = opt->color_selected;
599 else if (sign == '-')
600 line_color = opt->color_context;
601 else if (sign == '=')
602 line_color = opt->color_function;
604 while (next_match(opt, bol, eol, ctx, &match, eflags)) {
605 if (match.rm_so == match.rm_eo)
608 output_color(opt, bol, match.rm_so, line_color);
609 output_color(opt, bol + match.rm_so,
610 match.rm_eo - match.rm_so,
618 output_color(opt, bol, rest, line_color);
619 opt->output(opt, "\n", 1);
622 static int match_funcname(struct grep_opt *opt, char *bol, char *eol)
624 xdemitconf_t *xecfg = opt->priv;
625 if (xecfg && xecfg->find_func) {
627 return xecfg->find_func(bol, eol - bol, buf, 1,
628 xecfg->find_func_priv) >= 0;
633 if (isalpha(*bol) || *bol == '_' || *bol == '$')
638 static void show_funcname_line(struct grep_opt *opt, const char *name,
639 char *buf, char *bol, unsigned lno)
644 while (bol > buf && bol[-1] != '\n')
648 if (lno <= opt->last_shown)
651 if (match_funcname(opt, bol, eol)) {
652 show_line(opt, bol, eol, name, lno, '=');
658 static void show_pre_context(struct grep_opt *opt, const char *name, char *buf,
659 char *bol, unsigned lno)
661 unsigned cur = lno, from = 1, funcname_lno = 0;
662 int funcname_needed = opt->funcname;
664 if (opt->pre_context < lno)
665 from = lno - opt->pre_context;
666 if (from <= opt->last_shown)
667 from = opt->last_shown + 1;
670 while (bol > buf && cur > from) {
673 while (bol > buf && bol[-1] != '\n')
676 if (funcname_needed && match_funcname(opt, bol, eol)) {
682 /* We need to look even further back to find a function signature. */
683 if (opt->funcname && funcname_needed)
684 show_funcname_line(opt, name, buf, bol, cur);
688 char *eol = bol, sign = (cur == funcname_lno) ? '=' : '-';
692 show_line(opt, bol, eol, name, cur, sign);
698 static int should_lookahead(struct grep_opt *opt)
703 return 0; /* punt for too complex stuff */
706 for (p = opt->pattern_list; p; p = p->next) {
707 if (p->token != GREP_PATTERN)
708 return 0; /* punt for "header only" and stuff */
713 static int look_ahead(struct grep_opt *opt,
714 unsigned long *left_p,
718 unsigned lno = *lno_p;
722 regoff_t earliest = -1;
724 for (p = opt->pattern_list; p; p = p->next) {
729 hit = !fixmatch(p->pattern, bol, p->ignore_case, &m);
734 hit = !regexec(&p->regexp, bol, 1, &m, REG_STARTEND);
736 hit = !regexec(&p->regexp, bol, 1, &m, 0);
739 if (!hit || m.rm_so < 0 || m.rm_eo < 0)
741 if (earliest < 0 || m.rm_so < earliest)
746 *bol_p = bol + *left_p;
750 for (sp = bol + earliest; bol < sp && sp[-1] != '\n'; sp--)
751 ; /* find the beginning of the line */
754 for (sp = bol; sp < last_bol; sp++) {
758 *left_p -= last_bol - bol;
764 int grep_threads_ok(const struct grep_opt *opt)
766 /* If this condition is true, then we may use the attribute
767 * machinery in grep_buffer_1. The attribute code is not
768 * thread safe, so we disable the use of threads.
770 if (opt->funcname && !opt->unmatch_name_only && !opt->status_only &&
777 static void std_output(struct grep_opt *opt, const void *buf, size_t size)
779 fwrite(buf, size, 1, stdout);
782 static int grep_buffer_1(struct grep_opt *opt, const char *name,
783 char *buf, unsigned long size, int collect_hits)
786 unsigned long left = size;
788 unsigned last_hit = 0;
789 int binary_match_only = 0;
791 int try_lookahead = 0;
792 enum grep_context ctx = GREP_CONTEXT_HEAD;
796 opt->output = std_output;
798 if (opt->last_shown && (opt->pre_context || opt->post_context) &&
799 opt->output == std_output)
800 opt->show_hunk_mark = 1;
803 if (buffer_is_binary(buf, size)) {
804 switch (opt->binary) {
805 case GREP_BINARY_DEFAULT:
806 binary_match_only = 1;
808 case GREP_BINARY_NOMATCH:
809 return 0; /* Assume unmatch */
816 memset(&xecfg, 0, sizeof(xecfg));
817 if (opt->funcname && !opt->unmatch_name_only && !opt->status_only &&
818 !opt->name_only && !binary_match_only && !collect_hits) {
819 struct userdiff_driver *drv = userdiff_find_by_path(name);
820 if (drv && drv->funcname.pattern) {
821 const struct userdiff_funcname *pe = &drv->funcname;
822 xdiff_set_find_func(&xecfg, pe->pattern, pe->cflags);
826 try_lookahead = should_lookahead(opt);
833 * look_ahead() skips quicly to the line that possibly
834 * has the next hit; don't call it if we need to do
835 * something more than just skipping the current line
836 * in response to an unmatch for the current line. E.g.
837 * inside a post-context window, we will show the current
838 * line as a context around the previous hit when it
843 && lno <= last_hit + opt->post_context)
844 && look_ahead(opt, &left, &lno, &bol))
846 eol = end_of_line(bol, &left);
850 if ((ctx == GREP_CONTEXT_HEAD) && (eol == bol))
851 ctx = GREP_CONTEXT_BODY;
853 hit = match_line(opt, bol, eol, ctx, collect_hits);
859 /* "grep -v -e foo -e bla" should list lines
860 * that do not have either, so inversion should
865 if (opt->unmatch_name_only) {
872 if (opt->status_only)
874 if (binary_match_only) {
875 opt->output(opt, "Binary file ", 12);
876 output_color(opt, name, strlen(name),
877 opt->color_filename);
878 opt->output(opt, " matches\n", 9);
881 if (opt->name_only) {
882 show_name(opt, name);
885 /* Hit at this line. If we haven't shown the
886 * pre-context lines, we would need to show them.
887 * When asked to do "count", this still show
888 * the context which is nonsense, but the user
889 * deserves to get that ;-).
891 if (opt->pre_context)
892 show_pre_context(opt, name, buf, bol, lno);
893 else if (opt->funcname)
894 show_funcname_line(opt, name, buf, bol, lno);
896 show_line(opt, bol, eol, name, lno, ':');
900 lno <= last_hit + opt->post_context) {
901 /* If the last hit is within the post context,
902 * we need to show this line.
904 show_line(opt, bol, eol, name, lno, '-');
918 if (opt->status_only)
920 if (opt->unmatch_name_only) {
921 /* We did not see any hit, so we want to show this */
922 show_name(opt, name);
926 xdiff_clear_find_func(&xecfg);
930 * The real "grep -c foo *.c" gives many "bar.c:0" lines,
931 * which feels mostly useless but sometimes useful. Maybe
932 * make it another option? For now suppress them.
934 if (opt->count && count) {
936 output_color(opt, name, strlen(name), opt->color_filename);
937 output_sep(opt, ':');
938 snprintf(buf, sizeof(buf), "%u\n", count);
939 opt->output(opt, buf, strlen(buf));
944 static void clr_hit_marker(struct grep_expr *x)
946 /* All-hit markers are meaningful only at the very top level
951 if (x->node != GREP_NODE_OR)
953 x->u.binary.left->hit = 0;
954 x = x->u.binary.right;
958 static int chk_hit_marker(struct grep_expr *x)
960 /* Top level nodes have hit markers. See if they all are hits */
962 if (x->node != GREP_NODE_OR)
964 if (!x->u.binary.left->hit)
966 x = x->u.binary.right;
970 int grep_buffer(struct grep_opt *opt, const char *name, char *buf, unsigned long size)
973 * we do not have to do the two-pass grep when we do not check
974 * buffer-wide "all-match".
977 return grep_buffer_1(opt, name, buf, size, 0);
979 /* Otherwise the toplevel "or" terms hit a bit differently.
980 * We first clear hit markers from them.
982 clr_hit_marker(opt->pattern_expression);
983 grep_buffer_1(opt, name, buf, size, 1);
985 if (!chk_hit_marker(opt->pattern_expression))
988 return grep_buffer_1(opt, name, buf, size, 0);