36512d8a17abccb67654b5bcfcd74a441b3e4586
1/*
2 * Builtin "git grep"
3 *
4 * Copyright (c) 2006 Junio C Hamano
5 */
6#include "cache.h"
7#include "blob.h"
8#include "tree.h"
9#include "commit.h"
10#include "tag.h"
11#include "tree-walk.h"
12#include "builtin.h"
13#include <regex.h>
14#include <fnmatch.h>
15#include <sys/wait.h>
16/*
18 * git grep pathspecs are somewhat different from diff-tree pathspecs;
19 * pathname wildcards are allowed.
20 */
21static int pathspec_matches(const char **paths, const char *name)
22{
23 int namelen, i;
24 if (!paths || !*paths)
25 return 1;
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;
31 if ((matchlen <= namelen) &&
33 !strncmp(name, match, matchlen) &&
34 (match[matchlen-1] == '/' ||
35 name[matchlen] == '\0' || name[matchlen] == '/'))
36 return 1;
37 if (!fnmatch(match, name, 0))
38 return 1;
39 if (name[namelen-1] != '/')
40 continue;
41 /* We are being asked if the directory ("name") is worth
43 * descending into.
44 *
45 * Find the longest leading directory name that does
46 * not have metacharacter in the pathspec; the name
47 * we are looking at must overlap with that directory.
48 */
49 for (cp = match, meta = NULL; cp - match < matchlen; cp++) {
50 char ch = *cp;
51 if (ch == '*' || ch == '[' || ch == '?') {
52 meta = cp;
53 break;
54 }
55 }
56 if (!meta)
57 meta = cp; /* fully literal */
58 if (namelen <= meta - match) {
60 /* Looking at "Documentation/" and
61 * the pattern says "Documentation/howto/", or
62 * "Documentation/diff*.txt". The name we
63 * have should match prefix.
64 */
65 if (!memcmp(match, name, namelen))
66 return 1;
67 continue;
68 }
69 if (meta - match < namelen) {
71 /* Looking at "Documentation/howto/" and
72 * the pattern says "Documentation/h*";
73 * match up to "Do.../h"; this avoids descending
74 * into "Documentation/technical/".
75 */
76 if (!memcmp(match, name, meta - match))
77 return 1;
78 continue;
79 }
80 }
81 return 0;
82}
83struct grep_pat {
85 struct grep_pat *next;
86 const char *origin;
87 int no;
88 const char *pattern;
89 regex_t regexp;
90};
91struct grep_opt {
93 struct grep_pat *pattern_list;
94 struct grep_pat **pattern_tail;
95 regex_t regexp;
96 unsigned linenum:1;
97 unsigned invert:1;
98 unsigned name_only:1;
99 unsigned unmatch_name_only:1;
100 unsigned count:1;
101 unsigned word_regexp:1;
102 unsigned fixed:1;
103#define GREP_BINARY_DEFAULT 0
104#define GREP_BINARY_NOMATCH 1
105#define GREP_BINARY_TEXT 2
106 unsigned binary:2;
107 int regflags;
108 unsigned pre_context;
109 unsigned post_context;
110};
111static void add_pattern(struct grep_opt *opt, const char *pat,
113 const char *origin, int no)
114{
115 struct grep_pat *p = xcalloc(1, sizeof(*p));
116 p->pattern = pat;
117 p->origin = origin;
118 p->no = no;
119 *opt->pattern_tail = p;
120 opt->pattern_tail = &p->next;
121 p->next = NULL;
122}
123static void compile_patterns(struct grep_opt *opt)
125{
126 struct grep_pat *p;
127 for (p = opt->pattern_list; p; p = p->next) {
128 int err = regcomp(&p->regexp, p->pattern, opt->regflags);
129 if (err) {
130 char errbuf[1024];
131 char where[1024];
132 if (p->no)
133 sprintf(where, "In '%s' at %d, ",
134 p->origin, p->no);
135 else if (p->origin)
136 sprintf(where, "%s, ", p->origin);
137 else
138 where[0] = 0;
139 regerror(err, &p->regexp, errbuf, 1024);
140 regfree(&p->regexp);
141 die("%s'%s': %s", where, p->pattern, errbuf);
142 }
143 }
144}
145static char *end_of_line(char *cp, unsigned long *left)
147{
148 unsigned long l = *left;
149 while (l && *cp != '\n') {
150 l--;
151 cp++;
152 }
153 *left = l;
154 return cp;
155}
156static int word_char(char ch)
158{
159 return isalnum(ch) || ch == '_';
160}
161static void show_line(struct grep_opt *opt, const char *bol, const char *eol,
163 const char *name, unsigned lno, char sign)
164{
165 printf("%s%c", name, sign);
166 if (opt->linenum)
167 printf("%d%c", lno, sign);
168 printf("%.*s\n", (int)(eol-bol), bol);
169}
170/*
172 * NEEDSWORK: share code with diff.c
173 */
174#define FIRST_FEW_BYTES 8000
175static int buffer_is_binary(const char *ptr, unsigned long size)
176{
177 if (FIRST_FEW_BYTES < size)
178 size = FIRST_FEW_BYTES;
179 if (memchr(ptr, 0, size))
180 return 1;
181 return 0;
182}
183static int fixmatch(const char *pattern, char *line, regmatch_t *match)
185{
186 char *hit = strstr(line, pattern);
187 if (!hit) {
188 match->rm_so = match->rm_eo = -1;
189 return REG_NOMATCH;
190 }
191 else {
192 match->rm_so = hit - line;
193 match->rm_eo = match->rm_so + strlen(pattern);
194 return 0;
195 }
196}
197static int grep_buffer(struct grep_opt *opt, const char *name,
199 char *buf, unsigned long size)
200{
201 char *bol = buf;
202 unsigned long left = size;
203 unsigned lno = 1;
204 struct pre_context_line {
205 char *bol;
206 char *eol;
207 } *prev = NULL, *pcl;
208 unsigned last_hit = 0;
209 unsigned last_shown = 0;
210 int binary_match_only = 0;
211 const char *hunk_mark = "";
212 unsigned count = 0;
213 if (buffer_is_binary(buf, size)) {
215 switch (opt->binary) {
216 case GREP_BINARY_DEFAULT:
217 binary_match_only = 1;
218 break;
219 case GREP_BINARY_NOMATCH:
220 return 0; /* Assume unmatch */
221 break;
222 default:
223 break;
224 }
225 }
226 if (opt->pre_context)
228 prev = xcalloc(opt->pre_context, sizeof(*prev));
229 if (opt->pre_context || opt->post_context)
230 hunk_mark = "--\n";
231 while (left) {
233 regmatch_t pmatch[10];
234 char *eol, ch;
235 int hit = 0;
236 struct grep_pat *p;
237 eol = end_of_line(bol, &left);
239 ch = *eol;
240 *eol = 0;
241 for (p = opt->pattern_list; p; p = p->next) {
243 if (!opt->fixed) {
244 regex_t *exp = &p->regexp;
245 hit = !regexec(exp, bol, ARRAY_SIZE(pmatch),
246 pmatch, 0);
247 }
248 else {
249 hit = !fixmatch(p->pattern, bol, pmatch);
250 }
251 if (hit && opt->word_regexp) {
253 /* Match beginning must be either
254 * beginning of the line, or at word
255 * boundary (i.e. the last char must
256 * not be alnum or underscore).
257 */
258 if ((pmatch[0].rm_so < 0) ||
259 (eol - bol) <= pmatch[0].rm_so ||
260 (pmatch[0].rm_eo < 0) ||
261 (eol - bol) < pmatch[0].rm_eo)
262 die("regexp returned nonsense");
263 if (pmatch[0].rm_so != 0 &&
264 word_char(bol[pmatch[0].rm_so-1]))
265 hit = 0;
266 if (pmatch[0].rm_eo != (eol-bol) &&
267 word_char(bol[pmatch[0].rm_eo]))
268 hit = 0;
269 }
270 if (hit)
271 break;
272 }
273 /* "grep -v -e foo -e bla" should list lines
274 * that do not have either, so inversion should
275 * be done outside.
276 */
277 if (opt->invert)
278 hit = !hit;
279 if (opt->unmatch_name_only) {
280 if (hit)
281 return 0;
282 goto next_line;
283 }
284 if (hit) {
285 count++;
286 if (binary_match_only) {
287 printf("Binary file %s matches\n", name);
288 return 1;
289 }
290 if (opt->name_only) {
291 printf("%s\n", name);
292 return 1;
293 }
294 /* Hit at this line. If we haven't shown the
295 * pre-context lines, we would need to show them.
296 * When asked to do "count", this still show
297 * the context which is nonsense, but the user
298 * deserves to get that ;-).
299 */
300 if (opt->pre_context) {
301 unsigned from;
302 if (opt->pre_context < lno)
303 from = lno - opt->pre_context;
304 else
305 from = 1;
306 if (from <= last_shown)
307 from = last_shown + 1;
308 if (last_shown && from != last_shown + 1)
309 printf(hunk_mark);
310 while (from < lno) {
311 pcl = &prev[lno-from-1];
312 show_line(opt, pcl->bol, pcl->eol,
313 name, from, '-');
314 from++;
315 }
316 last_shown = lno-1;
317 }
318 if (last_shown && lno != last_shown + 1)
319 printf(hunk_mark);
320 if (!opt->count)
321 show_line(opt, bol, eol, name, lno, ':');
322 last_shown = last_hit = lno;
323 }
324 else if (last_hit &&
325 lno <= last_hit + opt->post_context) {
326 /* If the last hit is within the post context,
327 * we need to show this line.
328 */
329 if (last_shown && lno != last_shown + 1)
330 printf(hunk_mark);
331 show_line(opt, bol, eol, name, lno, '-');
332 last_shown = lno;
333 }
334 if (opt->pre_context) {
335 memmove(prev+1, prev,
336 (opt->pre_context-1) * sizeof(*prev));
337 prev->bol = bol;
338 prev->eol = eol;
339 }
340 next_line:
342 *eol = ch;
343 bol = eol + 1;
344 if (!left)
345 break;
346 left--;
347 lno++;
348 }
349 if (opt->unmatch_name_only) {
351 /* We did not see any hit, so we want to show this */
352 printf("%s\n", name);
353 return 1;
354 }
355 /* NEEDSWORK:
357 * The real "grep -c foo *.c" gives many "bar.c:0" lines,
358 * which feels mostly useless but sometimes useful. Maybe
359 * make it another option? For now suppress them.
360 */
361 if (opt->count && count)
362 printf("%s:%u\n", name, count);
363 return !!last_hit;
364}
365static int grep_sha1(struct grep_opt *opt, const unsigned char *sha1, const char *name)
367{
368 unsigned long size;
369 char *data;
370 char type[20];
371 int hit;
372 data = read_sha1_file(sha1, type, &size);
373 if (!data) {
374 error("'%s': unable to read %s", name, sha1_to_hex(sha1));
375 return 0;
376 }
377 hit = grep_buffer(opt, name, data, size);
378 free(data);
379 return hit;
380}
381static int grep_file(struct grep_opt *opt, const char *filename)
383{
384 struct stat st;
385 int i;
386 char *data;
387 if (lstat(filename, &st) < 0) {
388 err_ret:
389 if (errno != ENOENT)
390 error("'%s': %s", filename, strerror(errno));
391 return 0;
392 }
393 if (!st.st_size)
394 return 0; /* empty file -- no grep hit */
395 if (!S_ISREG(st.st_mode))
396 return 0;
397 i = open(filename, O_RDONLY);
398 if (i < 0)
399 goto err_ret;
400 data = xmalloc(st.st_size + 1);
401 if (st.st_size != xread(i, data, st.st_size)) {
402 error("'%s': short read %s", filename, strerror(errno));
403 close(i);
404 free(data);
405 return 0;
406 }
407 close(i);
408 i = grep_buffer(opt, filename, data, st.st_size);
409 free(data);
410 return i;
411}
412static int exec_grep(int argc, const char **argv)
414{
415 pid_t pid;
416 int status;
417 argv[argc] = NULL;
419 pid = fork();
420 if (pid < 0)
421 return pid;
422 if (!pid) {
423 execvp("grep", (char **) argv);
424 exit(255);
425 }
426 while (waitpid(pid, &status, 0) < 0) {
427 if (errno == EINTR)
428 continue;
429 return -1;
430 }
431 if (WIFEXITED(status)) {
432 if (!WEXITSTATUS(status))
433 return 1;
434 return 0;
435 }
436 return -1;
437}
438#define MAXARGS 1000
440#define ARGBUF 4096
441#define push_arg(a) do { \
442 if (nr < MAXARGS) argv[nr++] = (a); \
443 else die("maximum number of args exceeded"); \
444 } while (0)
445static int external_grep(struct grep_opt *opt, const char **paths, int cached)
447{
448 int i, nr, argc, hit, len;
449 const char *argv[MAXARGS+1];
450 char randarg[ARGBUF];
451 char *argptr = randarg;
452 struct grep_pat *p;
453 len = nr = 0;
455 push_arg("grep");
456 if (opt->fixed)
457 push_arg("-F");
458 if (opt->linenum)
459 push_arg("-n");
460 if (opt->regflags & REG_EXTENDED)
461 push_arg("-E");
462 if (opt->word_regexp)
463 push_arg("-w");
464 if (opt->name_only)
465 push_arg("-l");
466 if (opt->unmatch_name_only)
467 push_arg("-L");
468 if (opt->count)
469 push_arg("-c");
470 if (opt->post_context || opt->pre_context) {
471 if (opt->post_context != opt->pre_context) {
472 if (opt->pre_context) {
473 push_arg("-B");
474 len += snprintf(argptr, sizeof(randarg)-len,
475 "%u", opt->pre_context);
476 if (sizeof(randarg) <= len)
477 die("maximum length of args exceeded");
478 push_arg(argptr);
479 argptr += len;
480 }
481 if (opt->post_context) {
482 push_arg("-A");
483 len += snprintf(argptr, sizeof(randarg)-len,
484 "%u", opt->post_context);
485 if (sizeof(randarg) <= len)
486 die("maximum length of args exceeded");
487 push_arg(argptr);
488 argptr += len;
489 }
490 }
491 else {
492 push_arg("-C");
493 len += snprintf(argptr, sizeof(randarg)-len,
494 "%u", opt->post_context);
495 if (sizeof(randarg) <= len)
496 die("maximum length of args exceeded");
497 push_arg(argptr);
498 argptr += len;
499 }
500 }
501 for (p = opt->pattern_list; p; p = p->next) {
502 push_arg("-e");
503 push_arg(p->pattern);
504 }
505 if (NO_H_OPTION_IN_GREP)
507 push_arg("/dev/null");
508 else {
509 push_arg("-H");
510 push_arg("--");
511 }
512 hit = 0;
514 argc = nr;
515 for (i = 0; i < active_nr; i++) {
516 struct cache_entry *ce = active_cache[i];
517 if (ce_stage(ce) || !S_ISREG(ntohl(ce->ce_mode)))
518 continue;
519 if (!pathspec_matches(paths, ce->name))
520 continue;
521 argv[argc++] = ce->name;
522 if (argc < MAXARGS)
523 continue;
524 hit += exec_grep(argc, argv);
525 argc = nr;
526 }
527 if (argc > nr)
528 hit += exec_grep(argc, argv);
529 return 0;
530}
531static int grep_cache(struct grep_opt *opt, const char **paths, int cached)
533{
534 int hit = 0;
535 int nr;
536 read_cache();
537#ifdef __unix__
539 /*
540 * Use the external "grep" command for the case where
541 * we grep through the checked-out files. It tends to
542 * be a lot more optimized
543 *
544 * Some grep implementations do not understand -H nor --
545 * but /dev/null can be used as a substitution in most
546 * cases.
547 *
548 * However -L and -c would slightly misbehave (-L would
549 * list /dev/null as a hit, and -c would report 0 hits
550 * from /dev/null); so do not use the external one on
551 * such platforms.
552 */
553 if (!cached &&
554 (!NO_H_OPTION_IN_GREP ||
555 (!opt->count && !opt->unmatch_name_only))) {
556 hit = external_grep(opt, paths, cached);
557 if (hit >= 0)
558 return hit;
559 }
560#endif
561 for (nr = 0; nr < active_nr; nr++) {
563 struct cache_entry *ce = active_cache[nr];
564 if (ce_stage(ce) || !S_ISREG(ntohl(ce->ce_mode)))
565 continue;
566 if (!pathspec_matches(paths, ce->name))
567 continue;
568 if (cached)
569 hit |= grep_sha1(opt, ce->sha1, ce->name);
570 else
571 hit |= grep_file(opt, ce->name);
572 }
573 return hit;
574}
575static int grep_tree(struct grep_opt *opt, const char **paths,
577 struct tree_desc *tree,
578 const char *tree_name, const char *base)
579{
580 unsigned mode;
581 int len;
582 int hit = 0;
583 const char *path;
584 const unsigned char *sha1;
585 char *down;
586 char *path_buf = xmalloc(PATH_MAX + strlen(tree_name) + 100);
587 if (tree_name[0]) {
589 int offset = sprintf(path_buf, "%s:", tree_name);
590 down = path_buf + offset;
591 strcat(down, base);
592 }
593 else {
594 down = path_buf;
595 strcpy(down, base);
596 }
597 len = strlen(path_buf);
598 while (tree->size) {
600 int pathlen;
601 sha1 = tree_entry_extract(tree, &path, &mode);
602 pathlen = strlen(path);
603 strcpy(path_buf + len, path);
604 if (S_ISDIR(mode))
606 /* Match "abc/" against pathspec to
607 * decide if we want to descend into "abc"
608 * directory.
609 */
610 strcpy(path_buf + len + pathlen, "/");
611 if (!pathspec_matches(paths, down))
613 ;
614 else if (S_ISREG(mode))
615 hit |= grep_sha1(opt, sha1, path_buf);
616 else if (S_ISDIR(mode)) {
617 char type[20];
618 struct tree_desc sub;
619 void *data;
620 data = read_sha1_file(sha1, type, &sub.size);
621 if (!data)
622 die("unable to read tree (%s)",
623 sha1_to_hex(sha1));
624 sub.buf = data;
625 hit |= grep_tree(opt, paths, &sub, tree_name, down);
626 free(data);
627 }
628 update_tree_entry(tree);
629 }
630 return hit;
631}
632static int grep_object(struct grep_opt *opt, const char **paths,
634 struct object *obj, const char *name)
635{
636 if (!strcmp(obj->type, blob_type))
637 return grep_sha1(opt, obj->sha1, name);
638 if (!strcmp(obj->type, commit_type) ||
639 !strcmp(obj->type, tree_type)) {
640 struct tree_desc tree;
641 void *data;
642 int hit;
643 data = read_object_with_reference(obj->sha1, tree_type,
644 &tree.size, NULL);
645 if (!data)
646 die("unable to read tree (%s)", sha1_to_hex(obj->sha1));
647 tree.buf = data;
648 hit = grep_tree(opt, paths, &tree, name, "");
649 free(data);
650 return hit;
651 }
652 die("unable to grep from object of type %s", obj->type);
653}
654static const char builtin_grep_usage[] =
656"git-grep <option>* <rev>* [-e] <pattern> [<path>...]";
657int cmd_grep(int argc, const char **argv, char **envp)
659{
660 int hit = 0;
661 int cached = 0;
662 int seen_dashdash = 0;
663 struct grep_opt opt;
664 struct object_list *list, **tail, *object_list = NULL;
665 const char *prefix = setup_git_directory();
666 const char **paths = NULL;
667 int i;
668 memset(&opt, 0, sizeof(opt));
670 opt.pattern_tail = &opt.pattern_list;
671 opt.regflags = REG_NEWLINE;
672 /*
674 * If there is no -- then the paths must exist in the working
675 * tree. If there is no explicit pattern specified with -e or
676 * -f, we take the first unrecognized non option to be the
677 * pattern, but then what follows it must be zero or more
678 * valid refs up to the -- (if exists), and then existing
679 * paths. If there is an explicit pattern, then the first
680 * unrecocnized non option is the beginning of the refs list
681 * that continues up to the -- (if exists), and then paths.
682 */
683 tail = &object_list;
685 while (1 < argc) {
686 const char *arg = argv[1];
687 argc--; argv++;
688 if (!strcmp("--cached", arg)) {
689 cached = 1;
690 continue;
691 }
692 if (!strcmp("-a", arg) ||
693 !strcmp("--text", arg)) {
694 opt.binary = GREP_BINARY_TEXT;
695 continue;
696 }
697 if (!strcmp("-i", arg) ||
698 !strcmp("--ignore-case", arg)) {
699 opt.regflags |= REG_ICASE;
700 continue;
701 }
702 if (!strcmp("-I", arg)) {
703 opt.binary = GREP_BINARY_NOMATCH;
704 continue;
705 }
706 if (!strcmp("-v", arg) ||
707 !strcmp("--invert-match", arg)) {
708 opt.invert = 1;
709 continue;
710 }
711 if (!strcmp("-E", arg) ||
712 !strcmp("--extended-regexp", arg)) {
713 opt.regflags |= REG_EXTENDED;
714 continue;
715 }
716 if (!strcmp("-F", arg) ||
717 !strcmp("--fixed-strings", arg)) {
718 opt.fixed = 1;
719 continue;
720 }
721 if (!strcmp("-G", arg) ||
722 !strcmp("--basic-regexp", arg)) {
723 opt.regflags &= ~REG_EXTENDED;
724 continue;
725 }
726 if (!strcmp("-n", arg)) {
727 opt.linenum = 1;
728 continue;
729 }
730 if (!strcmp("-H", arg)) {
731 /* We always show the pathname, so this
732 * is a noop.
733 */
734 continue;
735 }
736 if (!strcmp("-l", arg) ||
737 !strcmp("--files-with-matches", arg)) {
738 opt.name_only = 1;
739 continue;
740 }
741 if (!strcmp("-L", arg) ||
742 !strcmp("--files-without-match", arg)) {
743 opt.unmatch_name_only = 1;
744 continue;
745 }
746 if (!strcmp("-c", arg) ||
747 !strcmp("--count", arg)) {
748 opt.count = 1;
749 continue;
750 }
751 if (!strcmp("-w", arg) ||
752 !strcmp("--word-regexp", arg)) {
753 opt.word_regexp = 1;
754 continue;
755 }
756 if (!strncmp("-A", arg, 2) ||
757 !strncmp("-B", arg, 2) ||
758 !strncmp("-C", arg, 2) ||
759 (arg[0] == '-' && '1' <= arg[1] && arg[1] <= '9')) {
760 unsigned num;
761 const char *scan;
762 switch (arg[1]) {
763 case 'A': case 'B': case 'C':
764 if (!arg[2]) {
765 if (argc <= 1)
766 usage(builtin_grep_usage);
767 scan = *++argv;
768 argc--;
769 }
770 else
771 scan = arg + 2;
772 break;
773 default:
774 scan = arg + 1;
775 break;
776 }
777 if (sscanf(scan, "%u", &num) != 1)
778 usage(builtin_grep_usage);
779 switch (arg[1]) {
780 case 'A':
781 opt.post_context = num;
782 break;
783 default:
784 case 'C':
785 opt.post_context = num;
786 case 'B':
787 opt.pre_context = num;
788 break;
789 }
790 continue;
791 }
792 if (!strcmp("-f", arg)) {
793 FILE *patterns;
794 int lno = 0;
795 char buf[1024];
796 if (argc <= 1)
797 usage(builtin_grep_usage);
798 patterns = fopen(argv[1], "r");
799 if (!patterns)
800 die("'%s': %s", argv[1], strerror(errno));
801 while (fgets(buf, sizeof(buf), patterns)) {
802 int len = strlen(buf);
803 if (buf[len-1] == '\n')
804 buf[len-1] = 0;
805 /* ignore empty line like grep does */
806 if (!buf[0])
807 continue;
808 add_pattern(&opt, strdup(buf), argv[1], ++lno);
809 }
810 fclose(patterns);
811 argv++;
812 argc--;
813 continue;
814 }
815 if (!strcmp("-e", arg)) {
816 if (1 < argc) {
817 add_pattern(&opt, argv[1], "-e option", 0);
818 argv++;
819 argc--;
820 continue;
821 }
822 usage(builtin_grep_usage);
823 }
824 if (!strcmp("--", arg))
825 break;
826 if (*arg == '-')
827 usage(builtin_grep_usage);
828 /* First unrecognized non-option token */
830 if (!opt.pattern_list) {
831 add_pattern(&opt, arg, "command line", 0);
832 break;
833 }
834 else {
835 /* We are looking at the first path or rev;
836 * it is found at argv[1] after leaving the
837 * loop.
838 */
839 argc++; argv--;
840 break;
841 }
842 }
843 if (!opt.pattern_list)
845 die("no pattern given.");
846 if ((opt.regflags != REG_NEWLINE) && opt.fixed)
847 die("cannot mix --fixed-strings and regexp");
848 if (!opt.fixed)
849 compile_patterns(&opt);
850 /* Check revs and then paths */
852 for (i = 1; i < argc; i++) {
853 const char *arg = argv[i];
854 unsigned char sha1[20];
855 /* Is it a rev? */
856 if (!get_sha1(arg, sha1)) {
857 struct object *object = parse_object(sha1);
858 struct object_list *elem;
859 if (!object)
860 die("bad object %s", arg);
861 elem = object_list_insert(object, tail);
862 elem->name = arg;
863 tail = &elem->next;
864 continue;
865 }
866 if (!strcmp(arg, "--")) {
867 i++;
868 seen_dashdash = 1;
869 }
870 break;
871 }
872 /* The rest are paths */
874 if (!seen_dashdash) {
875 int j;
876 for (j = i; j < argc; j++)
877 verify_filename(prefix, argv[j]);
878 }
879 if (i < argc)
881 paths = get_pathspec(prefix, argv + i);
882 else if (prefix) {
883 paths = xcalloc(2, sizeof(const char *));
884 paths[0] = prefix;
885 paths[1] = NULL;
886 }
887 if (!object_list)
889 return !grep_cache(&opt, paths, cached);
890 if (cached)
892 die("both --cached and trees are given.");
893 for (list = object_list; list; list = list->next) {
895 struct object *real_obj;
896 real_obj = deref_tag(list->item, NULL, 0);
897 if (grep_object(&opt, paths, real_obj, list->name))
898 hit = 1;
899 }
900 return !hit;
901}