4 * Copyright (c) 2006 Junio C Hamano
11 #include "tree-walk.h"
18 * git grep pathspecs are somewhat different from diff-tree pathspecs;
19 * pathname wildcards are allowed.
21 static int pathspec_matches(const char **paths
, const char *name
)
24 if (!paths
|| !*paths
)
26 namelen
= strlen(name
);
27 for (i
= 0; paths
[i
]; i
++) {
28 const char *match
= paths
[i
];
29 int matchlen
= strlen(match
);
30 const char *cp
, *meta
;
33 ((matchlen
<= namelen
) &&
34 !strncmp(name
, match
, matchlen
) &&
35 (match
[matchlen
-1] == '/' ||
36 name
[matchlen
] == '\0' || name
[matchlen
] == '/')))
38 if (!fnmatch(match
, name
, 0))
40 if (name
[namelen
-1] != '/')
43 /* We are being asked if the directory ("name") is worth
46 * Find the longest leading directory name that does
47 * not have metacharacter in the pathspec; the name
48 * we are looking at must overlap with that directory.
50 for (cp
= match
, meta
= NULL
; cp
- match
< matchlen
; cp
++) {
52 if (ch
== '*' || ch
== '[' || ch
== '?') {
58 meta
= cp
; /* fully literal */
60 if (namelen
<= meta
- match
) {
61 /* Looking at "Documentation/" and
62 * the pattern says "Documentation/howto/", or
63 * "Documentation/diff*.txt". The name we
64 * have should match prefix.
66 if (!memcmp(match
, name
, namelen
))
71 if (meta
- match
< namelen
) {
72 /* Looking at "Documentation/howto/" and
73 * the pattern says "Documentation/h*";
74 * match up to "Do.../h"; this avoids descending
75 * into "Documentation/technical/".
77 if (!memcmp(match
, name
, meta
- match
))
95 struct grep_pat
*next
;
98 enum grep_pat_token token
;
103 enum grep_expr_node
{
111 enum grep_expr_node node
;
113 struct grep_pat
*atom
;
114 struct grep_expr
*unary
;
116 struct grep_expr
*left
;
117 struct grep_expr
*right
;
123 struct grep_pat
*pattern_list
;
124 struct grep_pat
**pattern_tail
;
125 struct grep_expr
*pattern_expression
;
130 unsigned name_only
:1;
131 unsigned unmatch_name_only
:1;
133 unsigned word_regexp
:1;
135 #define GREP_BINARY_DEFAULT 0
136 #define GREP_BINARY_NOMATCH 1
137 #define GREP_BINARY_TEXT 2
142 unsigned pre_context
;
143 unsigned post_context
;
146 static void add_pattern(struct grep_opt
*opt
, const char *pat
,
147 const char *origin
, int no
, enum grep_pat_token t
)
149 struct grep_pat
*p
= xcalloc(1, sizeof(*p
));
154 *opt
->pattern_tail
= p
;
155 opt
->pattern_tail
= &p
->next
;
159 static void compile_regexp(struct grep_pat
*p
, struct grep_opt
*opt
)
161 int err
= regcomp(&p
->regexp
, p
->pattern
, opt
->regflags
);
166 sprintf(where
, "In '%s' at %d, ",
169 sprintf(where
, "%s, ", p
->origin
);
172 regerror(err
, &p
->regexp
, errbuf
, 1024);
174 die("%s'%s': %s", where
, p
->pattern
, errbuf
);
179 static inline void indent(int in
)
182 for (i
= 0; i
< in
; i
++) putchar(' ');
185 static void dump_pattern_exp(struct grep_expr
*x
, int in
)
190 puts(x
->u
.atom
->pattern
);
195 dump_pattern_exp(x
->u
.unary
, in
+1);
198 dump_pattern_exp(x
->u
.binary
.left
, in
+1);
201 dump_pattern_exp(x
->u
.binary
.right
, in
+1);
204 dump_pattern_exp(x
->u
.binary
.left
, in
+1);
207 dump_pattern_exp(x
->u
.binary
.right
, in
+1);
212 static void looking_at(const char *msg
, struct grep_pat
**list
)
214 struct grep_pat
*p
= *list
;
215 fprintf(stderr
, "%s: looking at ", msg
);
217 fprintf(stderr
, "empty\n");
219 fprintf(stderr
, "<%s>\n", p
->pattern
);
222 #define looking_at(a,b) do {} while(0)
225 static struct grep_expr
*compile_pattern_expr(struct grep_pat
**);
226 static struct grep_expr
*compile_pattern_atom(struct grep_pat
**list
)
231 looking_at("atom", list
);
235 case GREP_PATTERN
: /* atom */
236 x
= xcalloc(1, sizeof (struct grep_expr
));
237 x
->node
= GREP_NODE_ATOM
;
241 case GREP_OPEN_PAREN
:
243 x
= compile_pattern_expr(list
);
246 if (!*list
|| (*list
)->token
!= GREP_CLOSE_PAREN
)
247 die("unmatched parenthesis");
248 *list
= (*list
)->next
;
255 static struct grep_expr
*compile_pattern_not(struct grep_pat
**list
)
260 looking_at("not", list
);
266 die("--not not followed by pattern expression");
268 x
= xcalloc(1, sizeof (struct grep_expr
));
269 x
->node
= GREP_NODE_NOT
;
270 x
->u
.unary
= compile_pattern_not(list
);
272 die("--not followed by non pattern expression");
275 return compile_pattern_atom(list
);
279 static struct grep_expr
*compile_pattern_and(struct grep_pat
**list
)
282 struct grep_expr
*x
, *y
, *z
;
284 looking_at("and", list
);
286 x
= compile_pattern_not(list
);
288 if (p
&& p
->token
== GREP_AND
) {
290 die("--and not followed by pattern expression");
292 y
= compile_pattern_and(list
);
294 die("--and not followed by pattern expression");
295 z
= xcalloc(1, sizeof (struct grep_expr
));
296 z
->node
= GREP_NODE_AND
;
297 z
->u
.binary
.left
= x
;
298 z
->u
.binary
.right
= y
;
304 static struct grep_expr
*compile_pattern_or(struct grep_pat
**list
)
307 struct grep_expr
*x
, *y
, *z
;
309 looking_at("or", list
);
311 x
= compile_pattern_and(list
);
313 if (x
&& p
&& p
->token
!= GREP_CLOSE_PAREN
) {
314 y
= compile_pattern_or(list
);
316 die("not a pattern expression %s", p
->pattern
);
317 z
= xcalloc(1, sizeof (struct grep_expr
));
318 z
->node
= GREP_NODE_OR
;
319 z
->u
.binary
.left
= x
;
320 z
->u
.binary
.right
= y
;
326 static struct grep_expr
*compile_pattern_expr(struct grep_pat
**list
)
328 looking_at("expr", list
);
330 return compile_pattern_or(list
);
333 static void compile_patterns(struct grep_opt
*opt
)
337 /* First compile regexps */
338 for (p
= opt
->pattern_list
; p
; p
= p
->next
) {
339 if (p
->token
== GREP_PATTERN
)
340 compile_regexp(p
, opt
);
348 /* Then bundle them up in an expression.
349 * A classic recursive descent parser would do.
351 p
= opt
->pattern_list
;
352 opt
->pattern_expression
= compile_pattern_expr(&p
);
354 dump_pattern_exp(opt
->pattern_expression
, 0);
357 die("incomplete pattern expression: %s", p
->pattern
);
360 static char *end_of_line(char *cp
, unsigned long *left
)
362 unsigned long l
= *left
;
363 while (l
&& *cp
!= '\n') {
371 static int word_char(char ch
)
373 return isalnum(ch
) || ch
== '_';
376 static void show_line(struct grep_opt
*opt
, const char *bol
, const char *eol
,
377 const char *name
, unsigned lno
, char sign
)
379 printf("%s%c", name
, sign
);
381 printf("%d%c", lno
, sign
);
382 printf("%.*s\n", (int)(eol
-bol
), bol
);
386 * NEEDSWORK: share code with diff.c
388 #define FIRST_FEW_BYTES 8000
389 static int buffer_is_binary(const char *ptr
, unsigned long size
)
391 if (FIRST_FEW_BYTES
< size
)
392 size
= FIRST_FEW_BYTES
;
393 return !!memchr(ptr
, 0, size
);
396 static int fixmatch(const char *pattern
, char *line
, regmatch_t
*match
)
398 char *hit
= strstr(line
, pattern
);
400 match
->rm_so
= match
->rm_eo
= -1;
404 match
->rm_so
= hit
- line
;
405 match
->rm_eo
= match
->rm_so
+ strlen(pattern
);
410 static int match_one_pattern(struct grep_opt
*opt
, struct grep_pat
*p
, char *bol
, char *eol
)
414 regmatch_t pmatch
[10];
418 regex_t
*exp
= &p
->regexp
;
419 hit
= !regexec(exp
, bol
, ARRAY_SIZE(pmatch
),
423 hit
= !fixmatch(p
->pattern
, bol
, pmatch
);
426 if (hit
&& opt
->word_regexp
) {
427 if ((pmatch
[0].rm_so
< 0) ||
428 (eol
- bol
) <= pmatch
[0].rm_so
||
429 (pmatch
[0].rm_eo
< 0) ||
430 (eol
- bol
) < pmatch
[0].rm_eo
)
431 die("regexp returned nonsense");
433 /* Match beginning must be either beginning of the
434 * line, or at word boundary (i.e. the last char must
435 * not be a word char). Similarly, match end must be
436 * either end of the line, or at word boundary
437 * (i.e. the next char must not be a word char).
439 if ( ((pmatch
[0].rm_so
== 0 && at_true_bol
) ||
440 !word_char(bol
[pmatch
[0].rm_so
-1])) &&
441 ((pmatch
[0].rm_eo
== (eol
-bol
)) ||
442 !word_char(bol
[pmatch
[0].rm_eo
])) )
447 if (!hit
&& pmatch
[0].rm_so
+ bol
+ 1 < eol
) {
448 /* There could be more than one match on the
449 * line, and the first match might not be
450 * strict word match. But later ones could be!
452 bol
= pmatch
[0].rm_so
+ bol
+ 1;
460 static int match_expr_eval(struct grep_opt
*opt
,
462 char *bol
, char *eol
)
466 return match_one_pattern(opt
, x
->u
.atom
, bol
, eol
);
469 return !match_expr_eval(opt
, x
->u
.unary
, bol
, eol
);
471 return (match_expr_eval(opt
, x
->u
.binary
.left
, bol
, eol
) &&
472 match_expr_eval(opt
, x
->u
.binary
.right
, bol
, eol
));
474 return (match_expr_eval(opt
, x
->u
.binary
.left
, bol
, eol
) ||
475 match_expr_eval(opt
, x
->u
.binary
.right
, bol
, eol
));
477 die("Unexpected node type (internal error) %d\n", x
->node
);
480 static int match_expr(struct grep_opt
*opt
, char *bol
, char *eol
)
482 struct grep_expr
*x
= opt
->pattern_expression
;
483 return match_expr_eval(opt
, x
, bol
, eol
);
486 static int match_line(struct grep_opt
*opt
, char *bol
, char *eol
)
490 return match_expr(opt
, bol
, eol
);
491 for (p
= opt
->pattern_list
; p
; p
= p
->next
) {
492 if (match_one_pattern(opt
, p
, bol
, eol
))
498 static int grep_buffer(struct grep_opt
*opt
, const char *name
,
499 char *buf
, unsigned long size
)
502 unsigned long left
= size
;
504 struct pre_context_line
{
507 } *prev
= NULL
, *pcl
;
508 unsigned last_hit
= 0;
509 unsigned last_shown
= 0;
510 int binary_match_only
= 0;
511 const char *hunk_mark
= "";
514 if (buffer_is_binary(buf
, size
)) {
515 switch (opt
->binary
) {
516 case GREP_BINARY_DEFAULT
:
517 binary_match_only
= 1;
519 case GREP_BINARY_NOMATCH
:
520 return 0; /* Assume unmatch */
527 if (opt
->pre_context
)
528 prev
= xcalloc(opt
->pre_context
, sizeof(*prev
));
529 if (opt
->pre_context
|| opt
->post_context
)
536 eol
= end_of_line(bol
, &left
);
540 hit
= match_line(opt
, bol
, eol
);
542 /* "grep -v -e foo -e bla" should list lines
543 * that do not have either, so inversion should
548 if (opt
->unmatch_name_only
) {
555 if (binary_match_only
) {
556 printf("Binary file %s matches\n", name
);
559 if (opt
->name_only
) {
560 printf("%s\n", name
);
563 /* Hit at this line. If we haven't shown the
564 * pre-context lines, we would need to show them.
565 * When asked to do "count", this still show
566 * the context which is nonsense, but the user
567 * deserves to get that ;-).
569 if (opt
->pre_context
) {
571 if (opt
->pre_context
< lno
)
572 from
= lno
- opt
->pre_context
;
575 if (from
<= last_shown
)
576 from
= last_shown
+ 1;
577 if (last_shown
&& from
!= last_shown
+ 1)
580 pcl
= &prev
[lno
-from
-1];
581 show_line(opt
, pcl
->bol
, pcl
->eol
,
587 if (last_shown
&& lno
!= last_shown
+ 1)
590 show_line(opt
, bol
, eol
, name
, lno
, ':');
591 last_shown
= last_hit
= lno
;
594 lno
<= last_hit
+ opt
->post_context
) {
595 /* If the last hit is within the post context,
596 * we need to show this line.
598 if (last_shown
&& lno
!= last_shown
+ 1)
600 show_line(opt
, bol
, eol
, name
, lno
, '-');
603 if (opt
->pre_context
) {
604 memmove(prev
+1, prev
,
605 (opt
->pre_context
-1) * sizeof(*prev
));
619 if (opt
->unmatch_name_only
) {
620 /* We did not see any hit, so we want to show this */
621 printf("%s\n", name
);
626 * The real "grep -c foo *.c" gives many "bar.c:0" lines,
627 * which feels mostly useless but sometimes useful. Maybe
628 * make it another option? For now suppress them.
630 if (opt
->count
&& count
)
631 printf("%s:%u\n", name
, count
);
635 static int grep_sha1(struct grep_opt
*opt
, const unsigned char *sha1
, const char *name
, int tree_name_len
)
640 char *to_free
= NULL
;
643 data
= read_sha1_file(sha1
, type
, &size
);
645 error("'%s': unable to read %s", name
, sha1_to_hex(sha1
));
648 if (opt
->relative
&& opt
->prefix_length
) {
649 static char name_buf
[PATH_MAX
];
651 int name_len
= strlen(name
) - opt
->prefix_length
+ 1;
654 name
+= opt
->prefix_length
;
656 if (ARRAY_SIZE(name_buf
) <= name_len
)
657 cp
= to_free
= xmalloc(name_len
);
660 memcpy(cp
, name
, tree_name_len
);
661 strcpy(cp
+ tree_name_len
,
662 name
+ tree_name_len
+ opt
->prefix_length
);
666 hit
= grep_buffer(opt
, name
, data
, size
);
672 static int grep_file(struct grep_opt
*opt
, const char *filename
)
677 if (lstat(filename
, &st
) < 0) {
680 error("'%s': %s", filename
, strerror(errno
));
684 return 0; /* empty file -- no grep hit */
685 if (!S_ISREG(st
.st_mode
))
687 i
= open(filename
, O_RDONLY
);
690 data
= xmalloc(st
.st_size
+ 1);
691 if (st
.st_size
!= xread(i
, data
, st
.st_size
)) {
692 error("'%s': short read %s", filename
, strerror(errno
));
698 if (opt
->relative
&& opt
->prefix_length
)
699 filename
+= opt
->prefix_length
;
700 i
= grep_buffer(opt
, filename
, data
, st
.st_size
);
705 static int exec_grep(int argc
, const char **argv
)
715 execvp("grep", (char **) argv
);
718 while (waitpid(pid
, &status
, 0) < 0) {
723 if (WIFEXITED(status
)) {
724 if (!WEXITSTATUS(status
))
733 #define push_arg(a) do { \
734 if (nr < MAXARGS) argv[nr++] = (a); \
735 else die("maximum number of args exceeded"); \
738 static int external_grep(struct grep_opt
*opt
, const char **paths
, int cached
)
740 int i
, nr
, argc
, hit
, len
, status
;
741 const char *argv
[MAXARGS
+1];
742 char randarg
[ARGBUF
];
743 char *argptr
= randarg
;
746 if (opt
->extended
|| (opt
->relative
&& opt
->prefix_length
))
754 if (opt
->regflags
& REG_EXTENDED
)
756 if (opt
->regflags
& REG_ICASE
)
758 if (opt
->word_regexp
)
762 if (opt
->unmatch_name_only
)
766 if (opt
->post_context
|| opt
->pre_context
) {
767 if (opt
->post_context
!= opt
->pre_context
) {
768 if (opt
->pre_context
) {
770 len
+= snprintf(argptr
, sizeof(randarg
)-len
,
771 "%u", opt
->pre_context
);
772 if (sizeof(randarg
) <= len
)
773 die("maximum length of args exceeded");
777 if (opt
->post_context
) {
779 len
+= snprintf(argptr
, sizeof(randarg
)-len
,
780 "%u", opt
->post_context
);
781 if (sizeof(randarg
) <= len
)
782 die("maximum length of args exceeded");
789 len
+= snprintf(argptr
, sizeof(randarg
)-len
,
790 "%u", opt
->post_context
);
791 if (sizeof(randarg
) <= len
)
792 die("maximum length of args exceeded");
797 for (p
= opt
->pattern_list
; p
; p
= p
->next
) {
799 push_arg(p
->pattern
);
803 * To make sure we get the header printed out when we want it,
804 * add /dev/null to the paths to grep. This is unnecessary
805 * (and wrong) with "-l" or "-L", which always print out the
808 * GNU grep has "-H", but this is portable.
810 if (!opt
->name_only
&& !opt
->unmatch_name_only
)
811 push_arg("/dev/null");
815 for (i
= 0; i
< active_nr
; i
++) {
816 struct cache_entry
*ce
= active_cache
[i
];
818 if (ce_stage(ce
) || !S_ISREG(ntohl(ce
->ce_mode
)))
820 if (!pathspec_matches(paths
, ce
->name
))
823 if (name
[0] == '-') {
824 int len
= ce_namelen(ce
);
825 name
= xmalloc(len
+ 3);
826 memcpy(name
, "./", 2);
827 memcpy(name
+ 2, ce
->name
, len
+ 1);
832 status
= exec_grep(argc
, argv
);
838 status
= exec_grep(argc
, argv
);
845 static int grep_cache(struct grep_opt
*opt
, const char **paths
, int cached
)
853 * Use the external "grep" command for the case where
854 * we grep through the checked-out files. It tends to
855 * be a lot more optimized
858 hit
= external_grep(opt
, paths
, cached
);
864 for (nr
= 0; nr
< active_nr
; nr
++) {
865 struct cache_entry
*ce
= active_cache
[nr
];
866 if (ce_stage(ce
) || !S_ISREG(ntohl(ce
->ce_mode
)))
868 if (!pathspec_matches(paths
, ce
->name
))
871 hit
|= grep_sha1(opt
, ce
->sha1
, ce
->name
, 0);
873 hit
|= grep_file(opt
, ce
->name
);
878 static int grep_tree(struct grep_opt
*opt
, const char **paths
,
879 struct tree_desc
*tree
,
880 const char *tree_name
, const char *base
)
884 struct name_entry entry
;
886 int tn_len
= strlen(tree_name
);
887 char *path_buf
= xmalloc(PATH_MAX
+ tn_len
+ 100);
890 tn_len
= sprintf(path_buf
, "%s:", tree_name
);
891 down
= path_buf
+ tn_len
;
898 len
= strlen(path_buf
);
900 while (tree_entry(tree
, &entry
)) {
901 strcpy(path_buf
+ len
, entry
.path
);
903 if (S_ISDIR(entry
.mode
))
904 /* Match "abc/" against pathspec to
905 * decide if we want to descend into "abc"
908 strcpy(path_buf
+ len
+ entry
.pathlen
, "/");
910 if (!pathspec_matches(paths
, down
))
912 else if (S_ISREG(entry
.mode
))
913 hit
|= grep_sha1(opt
, entry
.sha1
, path_buf
, tn_len
);
914 else if (S_ISDIR(entry
.mode
)) {
916 struct tree_desc sub
;
918 data
= read_sha1_file(entry
.sha1
, type
, &sub
.size
);
920 die("unable to read tree (%s)",
921 sha1_to_hex(entry
.sha1
));
923 hit
|= grep_tree(opt
, paths
, &sub
, tree_name
, down
);
930 static int grep_object(struct grep_opt
*opt
, const char **paths
,
931 struct object
*obj
, const char *name
)
933 if (obj
->type
== OBJ_BLOB
)
934 return grep_sha1(opt
, obj
->sha1
, name
, 0);
935 if (obj
->type
== OBJ_COMMIT
|| obj
->type
== OBJ_TREE
) {
936 struct tree_desc tree
;
939 data
= read_object_with_reference(obj
->sha1
, tree_type
,
942 die("unable to read tree (%s)", sha1_to_hex(obj
->sha1
));
944 hit
= grep_tree(opt
, paths
, &tree
, name
, "");
948 die("unable to grep from object of type %s", typename(obj
->type
));
951 static const char builtin_grep_usage
[] =
952 "git-grep <option>* <rev>* [-e] <pattern> [<path>...]";
954 static const char emsg_invalid_context_len
[] =
955 "%s: invalid context length argument";
956 static const char emsg_missing_context_len
[] =
957 "missing context length argument";
958 static const char emsg_missing_argument
[] =
959 "option requires an argument -%s";
961 int cmd_grep(int argc
, const char **argv
, const char *prefix
)
965 int seen_dashdash
= 0;
967 struct object_array list
= { 0, 0, NULL
};
968 const char **paths
= NULL
;
971 memset(&opt
, 0, sizeof(opt
));
972 opt
.prefix_length
= (prefix
&& *prefix
) ? strlen(prefix
) : 0;
974 opt
.pattern_tail
= &opt
.pattern_list
;
975 opt
.regflags
= REG_NEWLINE
;
978 * If there is no -- then the paths must exist in the working
979 * tree. If there is no explicit pattern specified with -e or
980 * -f, we take the first unrecognized non option to be the
981 * pattern, but then what follows it must be zero or more
982 * valid refs up to the -- (if exists), and then existing
983 * paths. If there is an explicit pattern, then the first
984 * unrecognized non option is the beginning of the refs list
985 * that continues up to the -- (if exists), and then paths.
989 const char *arg
= argv
[1];
991 if (!strcmp("--cached", arg
)) {
995 if (!strcmp("-a", arg
) ||
996 !strcmp("--text", arg
)) {
997 opt
.binary
= GREP_BINARY_TEXT
;
1000 if (!strcmp("-i", arg
) ||
1001 !strcmp("--ignore-case", arg
)) {
1002 opt
.regflags
|= REG_ICASE
;
1005 if (!strcmp("-I", arg
)) {
1006 opt
.binary
= GREP_BINARY_NOMATCH
;
1009 if (!strcmp("-v", arg
) ||
1010 !strcmp("--invert-match", arg
)) {
1014 if (!strcmp("-E", arg
) ||
1015 !strcmp("--extended-regexp", arg
)) {
1016 opt
.regflags
|= REG_EXTENDED
;
1019 if (!strcmp("-F", arg
) ||
1020 !strcmp("--fixed-strings", arg
)) {
1024 if (!strcmp("-G", arg
) ||
1025 !strcmp("--basic-regexp", arg
)) {
1026 opt
.regflags
&= ~REG_EXTENDED
;
1029 if (!strcmp("-n", arg
)) {
1033 if (!strcmp("-H", arg
)) {
1034 /* We always show the pathname, so this
1039 if (!strcmp("-l", arg
) ||
1040 !strcmp("--files-with-matches", arg
)) {
1044 if (!strcmp("-L", arg
) ||
1045 !strcmp("--files-without-match", arg
)) {
1046 opt
.unmatch_name_only
= 1;
1049 if (!strcmp("-c", arg
) ||
1050 !strcmp("--count", arg
)) {
1054 if (!strcmp("-w", arg
) ||
1055 !strcmp("--word-regexp", arg
)) {
1056 opt
.word_regexp
= 1;
1059 if (!strncmp("-A", arg
, 2) ||
1060 !strncmp("-B", arg
, 2) ||
1061 !strncmp("-C", arg
, 2) ||
1062 (arg
[0] == '-' && '1' <= arg
[1] && arg
[1] <= '9')) {
1066 case 'A': case 'B': case 'C':
1069 die(emsg_missing_context_len
);
1080 if (sscanf(scan
, "%u", &num
) != 1)
1081 die(emsg_invalid_context_len
, scan
);
1084 opt
.post_context
= num
;
1088 opt
.post_context
= num
;
1090 opt
.pre_context
= num
;
1095 if (!strcmp("-f", arg
)) {
1100 die(emsg_missing_argument
, arg
);
1101 patterns
= fopen(argv
[1], "r");
1103 die("'%s': %s", argv
[1], strerror(errno
));
1104 while (fgets(buf
, sizeof(buf
), patterns
)) {
1105 int len
= strlen(buf
);
1106 if (buf
[len
-1] == '\n')
1108 /* ignore empty line like grep does */
1111 add_pattern(&opt
, strdup(buf
), argv
[1], ++lno
,
1119 if (!strcmp("--not", arg
)) {
1120 add_pattern(&opt
, arg
, "command line", 0, GREP_NOT
);
1123 if (!strcmp("--and", arg
)) {
1124 add_pattern(&opt
, arg
, "command line", 0, GREP_AND
);
1127 if (!strcmp("--or", arg
))
1128 continue; /* no-op */
1129 if (!strcmp("(", arg
)) {
1130 add_pattern(&opt
, arg
, "command line", 0, GREP_OPEN_PAREN
);
1133 if (!strcmp(")", arg
)) {
1134 add_pattern(&opt
, arg
, "command line", 0, GREP_CLOSE_PAREN
);
1137 if (!strcmp("-e", arg
)) {
1139 add_pattern(&opt
, argv
[1], "-e option", 0,
1145 die(emsg_missing_argument
, arg
);
1147 if (!strcmp("--full-name", arg
)) {
1151 if (!strcmp("--", arg
)) {
1152 /* later processing wants to have this at argv[1] */
1158 usage(builtin_grep_usage
);
1160 /* First unrecognized non-option token */
1161 if (!opt
.pattern_list
) {
1162 add_pattern(&opt
, arg
, "command line", 0,
1167 /* We are looking at the first path or rev;
1168 * it is found at argv[1] after leaving the
1176 if (!opt
.pattern_list
)
1177 die("no pattern given.");
1178 if ((opt
.regflags
!= REG_NEWLINE
) && opt
.fixed
)
1179 die("cannot mix --fixed-strings and regexp");
1181 compile_patterns(&opt
);
1183 /* Check revs and then paths */
1184 for (i
= 1; i
< argc
; i
++) {
1185 const char *arg
= argv
[i
];
1186 unsigned char sha1
[20];
1188 if (!get_sha1(arg
, sha1
)) {
1189 struct object
*object
= parse_object(sha1
);
1191 die("bad object %s", arg
);
1192 add_object_array(object
, arg
, &list
);
1195 if (!strcmp(arg
, "--")) {
1202 /* The rest are paths */
1203 if (!seen_dashdash
) {
1205 for (j
= i
; j
< argc
; j
++)
1206 verify_filename(prefix
, argv
[j
]);
1210 paths
= get_pathspec(prefix
, argv
+ i
);
1211 if (opt
.prefix_length
&& opt
.relative
) {
1212 /* Make sure we do not get outside of paths */
1213 for (i
= 0; paths
[i
]; i
++)
1214 if (strncmp(prefix
, paths
[i
], opt
.prefix_length
))
1215 die("git-grep: cannot generate relative filenames containing '..'");
1219 paths
= xcalloc(2, sizeof(const char *));
1225 return !grep_cache(&opt
, paths
, cached
);
1228 die("both --cached and trees are given.");
1230 for (i
= 0; i
< list
.nr
; i
++) {
1231 struct object
*real_obj
;
1232 real_obj
= deref_tag(list
.objects
[i
].item
, NULL
, 0);
1233 if (grep_object(&opt
, paths
, real_obj
, list
.objects
[i
].name
))