3 #include "xdiff-interface.h"
5 void append_header_grep_pattern(struct grep_opt
*opt
, enum grep_header_field field
, const char *pat
)
7 struct grep_pat
*p
= xcalloc(1, sizeof(*p
));
11 p
->token
= GREP_PATTERN_HEAD
;
13 *opt
->pattern_tail
= p
;
14 opt
->pattern_tail
= &p
->next
;
18 void append_grep_pattern(struct grep_opt
*opt
, const char *pat
,
19 const char *origin
, int no
, enum grep_pat_token t
)
21 struct grep_pat
*p
= xcalloc(1, sizeof(*p
));
26 *opt
->pattern_tail
= p
;
27 opt
->pattern_tail
= &p
->next
;
31 static int is_fixed(const char *s
)
33 while (*s
&& !is_regex_special(*s
))
38 static void compile_regexp(struct grep_pat
*p
, struct grep_opt
*opt
)
42 p
->word_regexp
= opt
->word_regexp
;
44 if (opt
->fixed
|| is_fixed(p
->pattern
))
46 if (opt
->regflags
& REG_ICASE
)
51 err
= regcomp(&p
->regexp
, p
->pattern
, opt
->regflags
);
56 sprintf(where
, "In '%s' at %d, ",
59 sprintf(where
, "%s, ", p
->origin
);
62 regerror(err
, &p
->regexp
, errbuf
, 1024);
64 die("%s'%s': %s", where
, p
->pattern
, errbuf
);
68 static struct grep_expr
*compile_pattern_or(struct grep_pat
**);
69 static struct grep_expr
*compile_pattern_atom(struct grep_pat
**list
)
78 case GREP_PATTERN
: /* atom */
79 case GREP_PATTERN_HEAD
:
80 case GREP_PATTERN_BODY
:
81 x
= xcalloc(1, sizeof (struct grep_expr
));
82 x
->node
= GREP_NODE_ATOM
;
88 x
= compile_pattern_or(list
);
89 if (!*list
|| (*list
)->token
!= GREP_CLOSE_PAREN
)
90 die("unmatched parenthesis");
91 *list
= (*list
)->next
;
98 static struct grep_expr
*compile_pattern_not(struct grep_pat
**list
)
109 die("--not not followed by pattern expression");
111 x
= xcalloc(1, sizeof (struct grep_expr
));
112 x
->node
= GREP_NODE_NOT
;
113 x
->u
.unary
= compile_pattern_not(list
);
115 die("--not followed by non pattern expression");
118 return compile_pattern_atom(list
);
122 static struct grep_expr
*compile_pattern_and(struct grep_pat
**list
)
125 struct grep_expr
*x
, *y
, *z
;
127 x
= compile_pattern_not(list
);
129 if (p
&& p
->token
== GREP_AND
) {
131 die("--and not followed by pattern expression");
133 y
= compile_pattern_and(list
);
135 die("--and not followed by pattern expression");
136 z
= xcalloc(1, sizeof (struct grep_expr
));
137 z
->node
= GREP_NODE_AND
;
138 z
->u
.binary
.left
= x
;
139 z
->u
.binary
.right
= y
;
145 static struct grep_expr
*compile_pattern_or(struct grep_pat
**list
)
148 struct grep_expr
*x
, *y
, *z
;
150 x
= compile_pattern_and(list
);
152 if (x
&& p
&& p
->token
!= GREP_CLOSE_PAREN
) {
153 y
= compile_pattern_or(list
);
155 die("not a pattern expression %s", p
->pattern
);
156 z
= xcalloc(1, sizeof (struct grep_expr
));
157 z
->node
= GREP_NODE_OR
;
158 z
->u
.binary
.left
= x
;
159 z
->u
.binary
.right
= y
;
165 static struct grep_expr
*compile_pattern_expr(struct grep_pat
**list
)
167 return compile_pattern_or(list
);
170 void compile_grep_patterns(struct grep_opt
*opt
)
177 for (p
= opt
->pattern_list
; p
; p
= p
->next
) {
179 case GREP_PATTERN
: /* atom */
180 case GREP_PATTERN_HEAD
:
181 case GREP_PATTERN_BODY
:
182 compile_regexp(p
, opt
);
193 /* Then bundle them up in an expression.
194 * A classic recursive descent parser would do.
196 p
= opt
->pattern_list
;
198 opt
->pattern_expression
= compile_pattern_expr(&p
);
200 die("incomplete pattern expression: %s", p
->pattern
);
203 static void free_pattern_expr(struct grep_expr
*x
)
209 free_pattern_expr(x
->u
.unary
);
213 free_pattern_expr(x
->u
.binary
.left
);
214 free_pattern_expr(x
->u
.binary
.right
);
220 void free_grep_patterns(struct grep_opt
*opt
)
222 struct grep_pat
*p
, *n
;
224 for (p
= opt
->pattern_list
; p
; p
= n
) {
227 case GREP_PATTERN
: /* atom */
228 case GREP_PATTERN_HEAD
:
229 case GREP_PATTERN_BODY
:
240 free_pattern_expr(opt
->pattern_expression
);
243 static char *end_of_line(char *cp
, unsigned long *left
)
245 unsigned long l
= *left
;
246 while (l
&& *cp
!= '\n') {
254 static int word_char(char ch
)
256 return isalnum(ch
) || ch
== '_';
259 static void show_name(struct grep_opt
*opt
, const char *name
)
261 printf("%s%c", name
, opt
->null_following_name
? '\0' : '\n');
264 static int fixmatch(const char *pattern
, char *line
, regmatch_t
*match
)
266 char *hit
= strstr(line
, pattern
);
268 match
->rm_so
= match
->rm_eo
= -1;
272 match
->rm_so
= hit
- line
;
273 match
->rm_eo
= match
->rm_so
+ strlen(pattern
);
278 static int strip_timestamp(char *bol
, char **eol_p
)
283 while (bol
< --eol
) {
299 { "committer ", 10 },
302 static int match_one_pattern(struct grep_pat
*p
, char *bol
, char *eol
,
303 enum grep_context ctx
,
304 regmatch_t
*pmatch
, int eflags
)
309 if ((p
->token
!= GREP_PATTERN
) &&
310 ((p
->token
== GREP_PATTERN_HEAD
) != (ctx
== GREP_CONTEXT_HEAD
)))
313 if (p
->token
== GREP_PATTERN_HEAD
) {
316 assert(p
->field
< ARRAY_SIZE(header_field
));
317 field
= header_field
[p
->field
].field
;
318 len
= header_field
[p
->field
].len
;
319 if (strncmp(bol
, field
, len
))
322 saved_ch
= strip_timestamp(bol
, &eol
);
327 hit
= !fixmatch(p
->pattern
, bol
, pmatch
);
329 hit
= !regexec(&p
->regexp
, bol
, 1, pmatch
, eflags
);
331 if (hit
&& p
->word_regexp
) {
332 if ((pmatch
[0].rm_so
< 0) ||
333 (eol
- bol
) <= pmatch
[0].rm_so
||
334 (pmatch
[0].rm_eo
< 0) ||
335 (eol
- bol
) < pmatch
[0].rm_eo
)
336 die("regexp returned nonsense");
338 /* Match beginning must be either beginning of the
339 * line, or at word boundary (i.e. the last char must
340 * not be a word char). Similarly, match end must be
341 * either end of the line, or at word boundary
342 * (i.e. the next char must not be a word char).
344 if ( ((pmatch
[0].rm_so
== 0) ||
345 !word_char(bol
[pmatch
[0].rm_so
-1])) &&
346 ((pmatch
[0].rm_eo
== (eol
-bol
)) ||
347 !word_char(bol
[pmatch
[0].rm_eo
])) )
352 if (!hit
&& pmatch
[0].rm_so
+ bol
+ 1 < eol
) {
353 /* There could be more than one match on the
354 * line, and the first match might not be
355 * strict word match. But later ones could be!
356 * Forward to the next possible start, i.e. the
357 * next position following a non-word char.
359 bol
= pmatch
[0].rm_so
+ bol
+ 1;
360 while (word_char(bol
[-1]) && bol
< eol
)
366 if (p
->token
== GREP_PATTERN_HEAD
&& saved_ch
)
371 static int match_expr_eval(struct grep_expr
*x
, char *bol
, char *eol
,
372 enum grep_context ctx
, int collect_hits
)
378 die("Not a valid grep expression");
381 h
= match_one_pattern(x
->u
.atom
, bol
, eol
, ctx
, &match
, 0);
384 h
= !match_expr_eval(x
->u
.unary
, bol
, eol
, ctx
, 0);
387 if (!match_expr_eval(x
->u
.binary
.left
, bol
, eol
, ctx
, 0))
389 h
= match_expr_eval(x
->u
.binary
.right
, bol
, eol
, ctx
, 0);
393 return (match_expr_eval(x
->u
.binary
.left
,
395 match_expr_eval(x
->u
.binary
.right
,
397 h
= match_expr_eval(x
->u
.binary
.left
, bol
, eol
, ctx
, 0);
398 x
->u
.binary
.left
->hit
|= h
;
399 h
|= match_expr_eval(x
->u
.binary
.right
, bol
, eol
, ctx
, 1);
402 die("Unexpected node type (internal error) %d", x
->node
);
409 static int match_expr(struct grep_opt
*opt
, char *bol
, char *eol
,
410 enum grep_context ctx
, int collect_hits
)
412 struct grep_expr
*x
= opt
->pattern_expression
;
413 return match_expr_eval(x
, bol
, eol
, ctx
, collect_hits
);
416 static int match_line(struct grep_opt
*opt
, char *bol
, char *eol
,
417 enum grep_context ctx
, int collect_hits
)
423 return match_expr(opt
, bol
, eol
, ctx
, collect_hits
);
425 /* we do not call with collect_hits without being extended */
426 for (p
= opt
->pattern_list
; p
; p
= p
->next
) {
427 if (match_one_pattern(p
, bol
, eol
, ctx
, &match
, 0))
433 static int match_next_pattern(struct grep_pat
*p
, char *bol
, char *eol
,
434 enum grep_context ctx
,
435 regmatch_t
*pmatch
, int eflags
)
439 if (!match_one_pattern(p
, bol
, eol
, ctx
, &match
, eflags
))
441 if (match
.rm_so
< 0 || match
.rm_eo
< 0)
443 if (pmatch
->rm_so
>= 0 && pmatch
->rm_eo
>= 0) {
444 if (match
.rm_so
> pmatch
->rm_so
)
446 if (match
.rm_so
== pmatch
->rm_so
&& match
.rm_eo
< pmatch
->rm_eo
)
449 pmatch
->rm_so
= match
.rm_so
;
450 pmatch
->rm_eo
= match
.rm_eo
;
454 static int next_match(struct grep_opt
*opt
, char *bol
, char *eol
,
455 enum grep_context ctx
, regmatch_t
*pmatch
, int eflags
)
460 pmatch
->rm_so
= pmatch
->rm_eo
= -1;
462 for (p
= opt
->pattern_list
; p
; p
= p
->next
) {
464 case GREP_PATTERN
: /* atom */
465 case GREP_PATTERN_HEAD
:
466 case GREP_PATTERN_BODY
:
467 hit
|= match_next_pattern(p
, bol
, eol
, ctx
,
478 static void show_line(struct grep_opt
*opt
, char *bol
, char *eol
,
479 const char *name
, unsigned lno
, char sign
)
481 int rest
= eol
- bol
;
483 if (opt
->null_following_name
)
486 printf("%s%c", name
, sign
);
488 printf("%d%c", lno
, sign
);
491 enum grep_context ctx
= GREP_CONTEXT_BODY
;
496 while (next_match(opt
, bol
, eol
, ctx
, &match
, eflags
)) {
497 printf("%.*s%s%.*s%s",
498 (int)match
.rm_so
, bol
,
500 (int)(match
.rm_eo
- match
.rm_so
), bol
+ match
.rm_so
,
508 printf("%.*s\n", rest
, bol
);
511 static int grep_buffer_1(struct grep_opt
*opt
, const char *name
,
512 char *buf
, unsigned long size
, int collect_hits
)
515 unsigned long left
= size
;
517 struct pre_context_line
{
520 } *prev
= NULL
, *pcl
;
521 unsigned last_hit
= 0;
522 unsigned last_shown
= 0;
523 int binary_match_only
= 0;
524 const char *hunk_mark
= "";
526 enum grep_context ctx
= GREP_CONTEXT_HEAD
;
528 if (buffer_is_binary(buf
, size
)) {
529 switch (opt
->binary
) {
530 case GREP_BINARY_DEFAULT
:
531 binary_match_only
= 1;
533 case GREP_BINARY_NOMATCH
:
534 return 0; /* Assume unmatch */
541 if (opt
->pre_context
)
542 prev
= xcalloc(opt
->pre_context
, sizeof(*prev
));
543 if (opt
->pre_context
|| opt
->post_context
)
550 eol
= end_of_line(bol
, &left
);
554 if ((ctx
== GREP_CONTEXT_HEAD
) && (eol
== bol
))
555 ctx
= GREP_CONTEXT_BODY
;
557 hit
= match_line(opt
, bol
, eol
, ctx
, collect_hits
);
563 /* "grep -v -e foo -e bla" should list lines
564 * that do not have either, so inversion should
569 if (opt
->unmatch_name_only
) {
576 if (opt
->status_only
)
578 if (binary_match_only
) {
579 printf("Binary file %s matches\n", name
);
582 if (opt
->name_only
) {
583 show_name(opt
, name
);
586 /* Hit at this line. If we haven't shown the
587 * pre-context lines, we would need to show them.
588 * When asked to do "count", this still show
589 * the context which is nonsense, but the user
590 * deserves to get that ;-).
592 if (opt
->pre_context
) {
594 if (opt
->pre_context
< lno
)
595 from
= lno
- opt
->pre_context
;
598 if (from
<= last_shown
)
599 from
= last_shown
+ 1;
600 if (last_shown
&& from
!= last_shown
+ 1)
601 fputs(hunk_mark
, stdout
);
603 pcl
= &prev
[lno
-from
-1];
604 show_line(opt
, pcl
->bol
, pcl
->eol
,
610 if (last_shown
&& lno
!= last_shown
+ 1)
611 fputs(hunk_mark
, stdout
);
613 show_line(opt
, bol
, eol
, name
, lno
, ':');
614 last_shown
= last_hit
= lno
;
617 lno
<= last_hit
+ opt
->post_context
) {
618 /* If the last hit is within the post context,
619 * we need to show this line.
621 if (last_shown
&& lno
!= last_shown
+ 1)
622 fputs(hunk_mark
, stdout
);
623 show_line(opt
, bol
, eol
, name
, lno
, '-');
626 if (opt
->pre_context
) {
627 memmove(prev
+1, prev
,
628 (opt
->pre_context
-1) * sizeof(*prev
));
645 if (opt
->status_only
)
647 if (opt
->unmatch_name_only
) {
648 /* We did not see any hit, so we want to show this */
649 show_name(opt
, name
);
654 * The real "grep -c foo *.c" gives many "bar.c:0" lines,
655 * which feels mostly useless but sometimes useful. Maybe
656 * make it another option? For now suppress them.
658 if (opt
->count
&& count
)
659 printf("%s%c%u\n", name
,
660 opt
->null_following_name
? '\0' : ':', count
);
664 static void clr_hit_marker(struct grep_expr
*x
)
666 /* All-hit markers are meaningful only at the very top level
671 if (x
->node
!= GREP_NODE_OR
)
673 x
->u
.binary
.left
->hit
= 0;
674 x
= x
->u
.binary
.right
;
678 static int chk_hit_marker(struct grep_expr
*x
)
680 /* Top level nodes have hit markers. See if they all are hits */
682 if (x
->node
!= GREP_NODE_OR
)
684 if (!x
->u
.binary
.left
->hit
)
686 x
= x
->u
.binary
.right
;
690 int grep_buffer(struct grep_opt
*opt
, const char *name
, char *buf
, unsigned long size
)
693 * we do not have to do the two-pass grep when we do not check
694 * buffer-wide "all-match".
697 return grep_buffer_1(opt
, name
, buf
, size
, 0);
699 /* Otherwise the toplevel "or" terms hit a bit differently.
700 * We first clear hit markers from them.
702 clr_hit_marker(opt
->pattern_expression
);
703 grep_buffer_1(opt
, name
, buf
, size
, 1);
705 if (!chk_hit_marker(opt
->pattern_expression
))
708 return grep_buffer_1(opt
, name
, buf
, size
, 0);