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 if (memchr(ptr, 0, size))
398 static int fixmatch(const char *pattern, char *line, regmatch_t *match)
400 char *hit = strstr(line, pattern);
402 match->rm_so = match->rm_eo = -1;
406 match->rm_so = hit - line;
407 match->rm_eo = match->rm_so + strlen(pattern);
412 static int match_one_pattern(struct grep_opt *opt, struct grep_pat *p, char *bol, char *eol)
416 regmatch_t pmatch[10];
420 regex_t *exp = &p->regexp;
421 hit = !regexec(exp, bol, ARRAY_SIZE(pmatch),
425 hit = !fixmatch(p->pattern, bol, pmatch);
428 if (hit && opt->word_regexp) {
429 if ((pmatch[0].rm_so < 0) ||
430 (eol - bol) <= pmatch[0].rm_so ||
431 (pmatch[0].rm_eo < 0) ||
432 (eol - bol) < pmatch[0].rm_eo)
433 die("regexp returned nonsense");
435 /* Match beginning must be either beginning of the
436 * line, or at word boundary (i.e. the last char must
437 * not be a word char). Similarly, match end must be
438 * either end of the line, or at word boundary
439 * (i.e. the next char must not be a word char).
441 if ( ((pmatch[0].rm_so == 0 && at_true_bol) ||
442 !word_char(bol[pmatch[0].rm_so-1])) &&
443 ((pmatch[0].rm_eo == (eol-bol)) ||
444 !word_char(bol[pmatch[0].rm_eo])) )
449 if (!hit && pmatch[0].rm_so + bol + 1 < eol) {
450 /* There could be more than one match on the
451 * line, and the first match might not be
452 * strict word match. But later ones could be!
454 bol = pmatch[0].rm_so + bol + 1;
462 static int match_expr_eval(struct grep_opt *opt,
464 char *bol, char *eol)
468 return match_one_pattern(opt, x->u.atom, bol, eol);
471 return !match_expr_eval(opt, x->u.unary, bol, eol);
473 return (match_expr_eval(opt, x->u.binary.left, bol, eol) &&
474 match_expr_eval(opt, x->u.binary.right, bol, eol));
476 return (match_expr_eval(opt, x->u.binary.left, bol, eol) ||
477 match_expr_eval(opt, x->u.binary.right, bol, eol));
479 die("Unexpected node type (internal error) %d\n", x->node);
482 static int match_expr(struct grep_opt *opt, char *bol, char *eol)
484 struct grep_expr *x = opt->pattern_expression;
485 return match_expr_eval(opt, x, bol, eol);
488 static int match_line(struct grep_opt *opt, char *bol, char *eol)
492 return match_expr(opt, bol, eol);
493 for (p = opt->pattern_list; p; p = p->next) {
494 if (match_one_pattern(opt, p, bol, eol))
500 static int grep_buffer(struct grep_opt *opt, const char *name,
501 char *buf, unsigned long size)
504 unsigned long left = size;
506 struct pre_context_line {
509 } *prev = NULL, *pcl;
510 unsigned last_hit = 0;
511 unsigned last_shown = 0;
512 int binary_match_only = 0;
513 const char *hunk_mark = "";
516 if (buffer_is_binary(buf, size)) {
517 switch (opt->binary) {
518 case GREP_BINARY_DEFAULT:
519 binary_match_only = 1;
521 case GREP_BINARY_NOMATCH:
522 return 0; /* Assume unmatch */
529 if (opt->pre_context)
530 prev = xcalloc(opt->pre_context, sizeof(*prev));
531 if (opt->pre_context || opt->post_context)
538 eol = end_of_line(bol, &left);
542 hit = match_line(opt, bol, eol);
544 /* "grep -v -e foo -e bla" should list lines
545 * that do not have either, so inversion should
550 if (opt->unmatch_name_only) {
557 if (binary_match_only) {
558 printf("Binary file %s matches\n", name);
561 if (opt->name_only) {
562 printf("%s\n", name);
565 /* Hit at this line. If we haven't shown the
566 * pre-context lines, we would need to show them.
567 * When asked to do "count", this still show
568 * the context which is nonsense, but the user
569 * deserves to get that ;-).
571 if (opt->pre_context) {
573 if (opt->pre_context < lno)
574 from = lno - opt->pre_context;
577 if (from <= last_shown)
578 from = last_shown + 1;
579 if (last_shown && from != last_shown + 1)
582 pcl = &prev[lno-from-1];
583 show_line(opt, pcl->bol, pcl->eol,
589 if (last_shown && lno != last_shown + 1)
592 show_line(opt, bol, eol, name, lno, ':');
593 last_shown = last_hit = lno;
596 lno <= last_hit + opt->post_context) {
597 /* If the last hit is within the post context,
598 * we need to show this line.
600 if (last_shown && lno != last_shown + 1)
602 show_line(opt, bol, eol, name, lno, '-');
605 if (opt->pre_context) {
606 memmove(prev+1, prev,
607 (opt->pre_context-1) * sizeof(*prev));
621 if (opt->unmatch_name_only) {
622 /* We did not see any hit, so we want to show this */
623 printf("%s\n", name);
628 * The real "grep -c foo *.c" gives many "bar.c:0" lines,
629 * which feels mostly useless but sometimes useful. Maybe
630 * make it another option? For now suppress them.
632 if (opt->count && count)
633 printf("%s:%u\n", name, count);
637 static int grep_sha1(struct grep_opt *opt, const unsigned char *sha1, const char *name, int tree_name_len)
642 char *to_free = NULL;
645 data = read_sha1_file(sha1, type, &size);
647 error("'%s': unable to read %s", name, sha1_to_hex(sha1));
650 if (opt->relative && opt->prefix_length) {
651 static char name_buf[PATH_MAX];
653 int name_len = strlen(name) - opt->prefix_length + 1;
656 name += opt->prefix_length;
658 if (ARRAY_SIZE(name_buf) <= name_len)
659 cp = to_free = xmalloc(name_len);
662 memcpy(cp, name, tree_name_len);
663 strcpy(cp + tree_name_len,
664 name + tree_name_len + opt->prefix_length);
668 hit = grep_buffer(opt, name, data, size);
674 static int grep_file(struct grep_opt *opt, const char *filename)
679 if (lstat(filename, &st) < 0) {
682 error("'%s': %s", filename, strerror(errno));
686 return 0; /* empty file -- no grep hit */
687 if (!S_ISREG(st.st_mode))
689 i = open(filename, O_RDONLY);
692 data = xmalloc(st.st_size + 1);
693 if (st.st_size != xread(i, data, st.st_size)) {
694 error("'%s': short read %s", filename, strerror(errno));
700 if (opt->relative && opt->prefix_length)
701 filename += opt->prefix_length;
702 i = grep_buffer(opt, filename, data, st.st_size);
707 static int exec_grep(int argc, const char **argv)
717 execvp("grep", (char **) argv);
720 while (waitpid(pid, &status, 0) < 0) {
725 if (WIFEXITED(status)) {
726 if (!WEXITSTATUS(status))
735 #define push_arg(a) do { \
736 if (nr < MAXARGS) argv[nr++] = (a); \
737 else die("maximum number of args exceeded"); \
740 static int external_grep(struct grep_opt *opt, const char **paths, int cached)
742 int i, nr, argc, hit, len, status;
743 const char *argv[MAXARGS+1];
744 char randarg[ARGBUF];
745 char *argptr = randarg;
748 if (opt->extended || (opt->relative && opt->prefix_length))
756 if (opt->regflags & REG_EXTENDED)
758 if (opt->regflags & REG_ICASE)
760 if (opt->word_regexp)
764 if (opt->unmatch_name_only)
768 if (opt->post_context || opt->pre_context) {
769 if (opt->post_context != opt->pre_context) {
770 if (opt->pre_context) {
772 len += snprintf(argptr, sizeof(randarg)-len,
773 "%u", opt->pre_context);
774 if (sizeof(randarg) <= len)
775 die("maximum length of args exceeded");
779 if (opt->post_context) {
781 len += snprintf(argptr, sizeof(randarg)-len,
782 "%u", opt->post_context);
783 if (sizeof(randarg) <= len)
784 die("maximum length of args exceeded");
791 len += snprintf(argptr, sizeof(randarg)-len,
792 "%u", opt->post_context);
793 if (sizeof(randarg) <= len)
794 die("maximum length of args exceeded");
799 for (p = opt->pattern_list; p; p = p->next) {
801 push_arg(p->pattern);
805 * To make sure we get the header printed out when we want it,
806 * add /dev/null to the paths to grep. This is unnecessary
807 * (and wrong) with "-l" or "-L", which always print out the
810 * GNU grep has "-H", but this is portable.
812 if (!opt->name_only && !opt->unmatch_name_only)
813 push_arg("/dev/null");
817 for (i = 0; i < active_nr; i++) {
818 struct cache_entry *ce = active_cache[i];
820 if (ce_stage(ce) || !S_ISREG(ntohl(ce->ce_mode)))
822 if (!pathspec_matches(paths, ce->name))
825 if (name[0] == '-') {
826 int len = ce_namelen(ce);
827 name = xmalloc(len + 3);
828 memcpy(name, "./", 2);
829 memcpy(name + 2, ce->name, len + 1);
834 status = exec_grep(argc, argv);
840 status = exec_grep(argc, argv);
847 static int grep_cache(struct grep_opt *opt, const char **paths, int cached)
855 * Use the external "grep" command for the case where
856 * we grep through the checked-out files. It tends to
857 * be a lot more optimized
860 hit = external_grep(opt, paths, cached);
866 for (nr = 0; nr < active_nr; nr++) {
867 struct cache_entry *ce = active_cache[nr];
868 if (ce_stage(ce) || !S_ISREG(ntohl(ce->ce_mode)))
870 if (!pathspec_matches(paths, ce->name))
873 hit |= grep_sha1(opt, ce->sha1, ce->name, 0);
875 hit |= grep_file(opt, ce->name);
880 static int grep_tree(struct grep_opt *opt, const char **paths,
881 struct tree_desc *tree,
882 const char *tree_name, const char *base)
886 struct name_entry entry;
888 int tn_len = strlen(tree_name);
889 char *path_buf = xmalloc(PATH_MAX + tn_len + 100);
892 tn_len = sprintf(path_buf, "%s:", tree_name);
893 down = path_buf + tn_len;
900 len = strlen(path_buf);
902 while (tree_entry(tree, &entry)) {
903 strcpy(path_buf + len, entry.path);
905 if (S_ISDIR(entry.mode))
906 /* Match "abc/" against pathspec to
907 * decide if we want to descend into "abc"
910 strcpy(path_buf + len + entry.pathlen, "/");
912 if (!pathspec_matches(paths, down))
914 else if (S_ISREG(entry.mode))
915 hit |= grep_sha1(opt, entry.sha1, path_buf, tn_len);
916 else if (S_ISDIR(entry.mode)) {
918 struct tree_desc sub;
920 data = read_sha1_file(entry.sha1, type, &sub.size);
922 die("unable to read tree (%s)",
923 sha1_to_hex(entry.sha1));
925 hit |= grep_tree(opt, paths, &sub, tree_name, down);
932 static int grep_object(struct grep_opt *opt, const char **paths,
933 struct object *obj, const char *name)
935 if (obj->type == OBJ_BLOB)
936 return grep_sha1(opt, obj->sha1, name, 0);
937 if (obj->type == OBJ_COMMIT || obj->type == OBJ_TREE) {
938 struct tree_desc tree;
941 data = read_object_with_reference(obj->sha1, tree_type,
944 die("unable to read tree (%s)", sha1_to_hex(obj->sha1));
946 hit = grep_tree(opt, paths, &tree, name, "");
950 die("unable to grep from object of type %s", typename(obj->type));
953 static const char builtin_grep_usage[] =
954 "git-grep <option>* <rev>* [-e] <pattern> [<path>...]";
956 static const char emsg_invalid_context_len[] =
957 "%s: invalid context length argument";
958 static const char emsg_missing_context_len[] =
959 "missing context length argument";
960 static const char emsg_missing_argument[] =
961 "option requires an argument -%s";
963 int cmd_grep(int argc, const char **argv, const char *prefix)
967 int seen_dashdash = 0;
969 struct object_array list = { 0, 0, NULL };
970 const char **paths = NULL;
973 memset(&opt, 0, sizeof(opt));
974 opt.prefix_length = (prefix && *prefix) ? strlen(prefix) : 0;
976 opt.pattern_tail = &opt.pattern_list;
977 opt.regflags = REG_NEWLINE;
980 * If there is no -- then the paths must exist in the working
981 * tree. If there is no explicit pattern specified with -e or
982 * -f, we take the first unrecognized non option to be the
983 * pattern, but then what follows it must be zero or more
984 * valid refs up to the -- (if exists), and then existing
985 * paths. If there is an explicit pattern, then the first
986 * unrecognized non option is the beginning of the refs list
987 * that continues up to the -- (if exists), and then paths.
991 const char *arg = argv[1];
993 if (!strcmp("--cached", arg)) {
997 if (!strcmp("-a", arg) ||
998 !strcmp("--text", arg)) {
999 opt.binary = GREP_BINARY_TEXT;
1002 if (!strcmp("-i", arg) ||
1003 !strcmp("--ignore-case", arg)) {
1004 opt.regflags |= REG_ICASE;
1007 if (!strcmp("-I", arg)) {
1008 opt.binary = GREP_BINARY_NOMATCH;
1011 if (!strcmp("-v", arg) ||
1012 !strcmp("--invert-match", arg)) {
1016 if (!strcmp("-E", arg) ||
1017 !strcmp("--extended-regexp", arg)) {
1018 opt.regflags |= REG_EXTENDED;
1021 if (!strcmp("-F", arg) ||
1022 !strcmp("--fixed-strings", arg)) {
1026 if (!strcmp("-G", arg) ||
1027 !strcmp("--basic-regexp", arg)) {
1028 opt.regflags &= ~REG_EXTENDED;
1031 if (!strcmp("-n", arg)) {
1035 if (!strcmp("-H", arg)) {
1036 /* We always show the pathname, so this
1041 if (!strcmp("-l", arg) ||
1042 !strcmp("--files-with-matches", arg)) {
1046 if (!strcmp("-L", arg) ||
1047 !strcmp("--files-without-match", arg)) {
1048 opt.unmatch_name_only = 1;
1051 if (!strcmp("-c", arg) ||
1052 !strcmp("--count", arg)) {
1056 if (!strcmp("-w", arg) ||
1057 !strcmp("--word-regexp", arg)) {
1058 opt.word_regexp = 1;
1061 if (!strncmp("-A", arg, 2) ||
1062 !strncmp("-B", arg, 2) ||
1063 !strncmp("-C", arg, 2) ||
1064 (arg[0] == '-' && '1' <= arg[1] && arg[1] <= '9')) {
1068 case 'A': case 'B': case 'C':
1071 die(emsg_missing_context_len);
1082 if (sscanf(scan, "%u", &num) != 1)
1083 die(emsg_invalid_context_len, scan);
1086 opt.post_context = num;
1090 opt.post_context = num;
1092 opt.pre_context = num;
1097 if (!strcmp("-f", arg)) {
1102 die(emsg_missing_argument, arg);
1103 patterns = fopen(argv[1], "r");
1105 die("'%s': %s", argv[1], strerror(errno));
1106 while (fgets(buf, sizeof(buf), patterns)) {
1107 int len = strlen(buf);
1108 if (buf[len-1] == '\n')
1110 /* ignore empty line like grep does */
1113 add_pattern(&opt, strdup(buf), argv[1], ++lno,
1121 if (!strcmp("--not", arg)) {
1122 add_pattern(&opt, arg, "command line", 0, GREP_NOT);
1125 if (!strcmp("--and", arg)) {
1126 add_pattern(&opt, arg, "command line", 0, GREP_AND);
1129 if (!strcmp("--or", arg))
1130 continue; /* no-op */
1131 if (!strcmp("(", arg)) {
1132 add_pattern(&opt, arg, "command line", 0, GREP_OPEN_PAREN);
1135 if (!strcmp(")", arg)) {
1136 add_pattern(&opt, arg, "command line", 0, GREP_CLOSE_PAREN);
1139 if (!strcmp("-e", arg)) {
1141 add_pattern(&opt, argv[1], "-e option", 0,
1147 die(emsg_missing_argument, arg);
1149 if (!strcmp("--full-name", arg)) {
1153 if (!strcmp("--", arg)) {
1154 /* later processing wants to have this at argv[1] */
1160 usage(builtin_grep_usage);
1162 /* First unrecognized non-option token */
1163 if (!opt.pattern_list) {
1164 add_pattern(&opt, arg, "command line", 0,
1169 /* We are looking at the first path or rev;
1170 * it is found at argv[1] after leaving the
1178 if (!opt.pattern_list)
1179 die("no pattern given.");
1180 if ((opt.regflags != REG_NEWLINE) && opt.fixed)
1181 die("cannot mix --fixed-strings and regexp");
1183 compile_patterns(&opt);
1185 /* Check revs and then paths */
1186 for (i = 1; i < argc; i++) {
1187 const char *arg = argv[i];
1188 unsigned char sha1[20];
1190 if (!get_sha1(arg, sha1)) {
1191 struct object *object = parse_object(sha1);
1193 die("bad object %s", arg);
1194 add_object_array(object, arg, &list);
1197 if (!strcmp(arg, "--")) {
1204 /* The rest are paths */
1205 if (!seen_dashdash) {
1207 for (j = i; j < argc; j++)
1208 verify_filename(prefix, argv[j]);
1212 paths = get_pathspec(prefix, argv + i);
1213 if (opt.prefix_length && opt.relative) {
1214 /* Make sure we do not get outside of paths */
1215 for (i = 0; paths[i]; i++)
1216 if (strncmp(prefix, paths[i], opt.prefix_length))
1217 die("git-grep: cannot generate relative filenames containing '..'");
1221 paths = xcalloc(2, sizeof(const char *));
1227 return !grep_cache(&opt, paths, cached);
1230 die("both --cached and trees are given.");
1232 for (i = 0; i < list.nr; i++) {
1233 struct object *real_obj;
1234 real_obj = deref_tag(list.objects[i].item, NULL, 0);
1235 if (grep_object(&opt, paths, real_obj, list.objects[i].name))