grep.c 53.2 KB
Newer Older
1
#include "cache.h"
2
#include "config.h"
3
#include "grep.h"
4
#include "object-store.h"
5
#include "userdiff.h"
6
#include "xdiff-interface.h"
J
Jeff King 已提交
7 8
#include "diff.h"
#include "diffcore.h"
9
#include "commit.h"
10
#include "quote.h"
11
#include "help.h"
12

13
static int grep_source_load(struct grep_source *gs);
14 15
static int grep_source_is_binary(struct grep_source *gs,
				 struct index_state *istate);
16

17 18
static struct grep_opt grep_defaults;

19 20 21 22 23
static const char *color_grep_slots[] = {
	[GREP_COLOR_CONTEXT]	    = "context",
	[GREP_COLOR_FILENAME]	    = "filename",
	[GREP_COLOR_FUNCTION]	    = "function",
	[GREP_COLOR_LINENO]	    = "lineNumber",
J
Junio C Hamano 已提交
24
	[GREP_COLOR_COLUMNNO]	    = "column",
25 26 27 28 29 30
	[GREP_COLOR_MATCH_CONTEXT]  = "matchContext",
	[GREP_COLOR_MATCH_SELECTED] = "matchSelected",
	[GREP_COLOR_SELECTED]	    = "selected",
	[GREP_COLOR_SEP]	    = "separator",
};

31 32 33 34 35
static void std_output(struct grep_opt *opt, const void *buf, size_t size)
{
	fwrite(buf, size, 1, stdout);
}

36 37 38 39 40
static void color_set(char *dst, const char *color_bytes)
{
	xsnprintf(dst, COLOR_MAXLEN, "%s", color_bytes);
}

41 42 43 44 45
/*
 * Initialize the grep_defaults template with hardcoded defaults.
 * We could let the compiler do this, but without C99 initializers
 * the code gets unwieldy and unreadable, so...
 */
46
void init_grep_defaults(struct repository *repo)
47 48
{
	struct grep_opt *opt = &grep_defaults;
49 50 51 52 53
	static int run_once;

	if (run_once)
		return;
	run_once++;
54 55

	memset(opt, 0, sizeof(*opt));
56
	opt->repo = repo;
57 58 59 60
	opt->relative = 1;
	opt->pathname = 1;
	opt->max_depth = -1;
	opt->pattern_type_option = GREP_PATTERN_TYPE_UNSPECIFIED;
61 62 63 64
	color_set(opt->colors[GREP_COLOR_CONTEXT], "");
	color_set(opt->colors[GREP_COLOR_FILENAME], "");
	color_set(opt->colors[GREP_COLOR_FUNCTION], "");
	color_set(opt->colors[GREP_COLOR_LINENO], "");
J
Junio C Hamano 已提交
65
	color_set(opt->colors[GREP_COLOR_COLUMNNO], "");
66 67 68 69
	color_set(opt->colors[GREP_COLOR_MATCH_CONTEXT], GIT_COLOR_BOLD_RED);
	color_set(opt->colors[GREP_COLOR_MATCH_SELECTED], GIT_COLOR_BOLD_RED);
	color_set(opt->colors[GREP_COLOR_SELECTED], "");
	color_set(opt->colors[GREP_COLOR_SEP], GIT_COLOR_CYAN);
70
	opt->only_matching = 0;
71
	opt->color = -1;
72
	opt->output = std_output;
73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
}

static int parse_pattern_type_arg(const char *opt, const char *arg)
{
	if (!strcmp(arg, "default"))
		return GREP_PATTERN_TYPE_UNSPECIFIED;
	else if (!strcmp(arg, "basic"))
		return GREP_PATTERN_TYPE_BRE;
	else if (!strcmp(arg, "extended"))
		return GREP_PATTERN_TYPE_ERE;
	else if (!strcmp(arg, "fixed"))
		return GREP_PATTERN_TYPE_FIXED;
	else if (!strcmp(arg, "perl"))
		return GREP_PATTERN_TYPE_PCRE;
	die("bad %s argument: %s", opt, arg);
}

90 91
define_list_config_array_extra(color_grep_slots, {"match"});

92 93 94 95 96 97 98
/*
 * Read the configuration file once and store it in
 * the grep_defaults template.
 */
int grep_config(const char *var, const char *value, void *cb)
{
	struct grep_opt *opt = &grep_defaults;
99
	const char *slot;
100 101 102 103 104

	if (userdiff_config(var, value) < 0)
		return -1;

	if (!strcmp(var, "grep.extendedregexp")) {
105
		opt->extended_regexp_option = git_config_bool(var, value);
106 107 108 109 110 111 112 113 114 115 116 117
		return 0;
	}

	if (!strcmp(var, "grep.patterntype")) {
		opt->pattern_type_option = parse_pattern_type_arg(var, value);
		return 0;
	}

	if (!strcmp(var, "grep.linenumber")) {
		opt->linenum = git_config_bool(var, value);
		return 0;
	}
118 119 120 121
	if (!strcmp(var, "grep.column")) {
		opt->columnnum = git_config_bool(var, value);
		return 0;
	}
122

123 124 125 126 127
	if (!strcmp(var, "grep.fullname")) {
		opt->relative = !git_config_bool(var, value);
		return 0;
	}

128 129
	if (!strcmp(var, "color.grep"))
		opt->color = git_config_colorbool(var, value);
130 131 132 133 134 135 136 137 138 139 140 141
	if (!strcmp(var, "color.grep.match")) {
		if (grep_config("color.grep.matchcontext", value, cb) < 0)
			return -1;
		if (grep_config("color.grep.matchselected", value, cb) < 0)
			return -1;
	} else if (skip_prefix(var, "color.grep.", &slot)) {
		int i = LOOKUP_CONFIG(color_grep_slots, slot);
		char *color;

		if (i < 0)
			return -1;
		color = opt->colors[i];
142 143
		if (!value)
			return config_error_nonbool(var);
144
		return color_parse(value, color);
145 146 147 148 149 150 151 152 153
	}
	return 0;
}

/*
 * Initialize one instance of grep_opt and copy the
 * default values from the template we read the configuration
 * information in an earlier call to git_config(grep_config).
 */
154
void grep_init(struct grep_opt *opt, struct repository *repo, const char *prefix)
155 156
{
	struct grep_opt *def = &grep_defaults;
157
	int i;
158 159

	memset(opt, 0, sizeof(*opt));
160
	opt->repo = repo;
161 162 163 164 165
	opt->prefix = prefix;
	opt->prefix_length = (prefix && *prefix) ? strlen(prefix) : 0;
	opt->pattern_tail = &opt->pattern_list;
	opt->header_tail = &opt->header_list;

166
	opt->only_matching = def->only_matching;
167 168 169 170
	opt->color = def->color;
	opt->extended_regexp_option = def->extended_regexp_option;
	opt->pattern_type_option = def->pattern_type_option;
	opt->linenum = def->linenum;
171
	opt->columnnum = def->columnnum;
172 173 174
	opt->max_depth = def->max_depth;
	opt->pathname = def->pathname;
	opt->relative = def->relative;
175
	opt->output = def->output;
176

177 178
	for (i = 0; i < NR_GREP_COLORS; i++)
		color_set(opt->colors[i], def->colors[i]);
179
}
180

181
static void grep_set_pattern_type_option(enum grep_pattern_type pattern_type, struct grep_opt *opt)
182
{
183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200
	/*
	 * When committing to the pattern type by setting the relevant
	 * fields in grep_opt it's generally not necessary to zero out
	 * the fields we're not choosing, since they won't have been
	 * set by anything. The extended_regexp_option field is the
	 * only exception to this.
	 *
	 * This is because in the process of parsing grep.patternType
	 * & grep.extendedRegexp we set opt->pattern_type_option and
	 * opt->extended_regexp_option, respectively. We then
	 * internally use opt->extended_regexp_option to see if we're
	 * compiling an ERE. It must be unset if that's not actually
	 * the case.
	 */
	if (pattern_type != GREP_PATTERN_TYPE_ERE &&
	    opt->extended_regexp_option)
		opt->extended_regexp_option = 0;

201 202 203 204 205 206 207 208
	switch (pattern_type) {
	case GREP_PATTERN_TYPE_UNSPECIFIED:
		/* fall through */

	case GREP_PATTERN_TYPE_BRE:
		break;

	case GREP_PATTERN_TYPE_ERE:
209
		opt->extended_regexp_option = 1;
210 211 212 213 214 215 216
		break;

	case GREP_PATTERN_TYPE_FIXED:
		opt->fixed = 1;
		break;

	case GREP_PATTERN_TYPE_PCRE:
217 218 219 220 221 222 223 224 225
#ifdef USE_LIBPCRE2
		opt->pcre2 = 1;
#else
		/*
		 * It's important that pcre1 always be assigned to
		 * even when there's no USE_LIBPCRE* defined. We still
		 * call the PCRE stub function, it just dies with
		 * "cannot use Perl-compatible regexes[...]".
		 */
226
		opt->pcre1 = 1;
227
#endif
228 229 230 231
		break;
	}
}

232 233 234 235 236 237 238
void grep_commit_pattern_type(enum grep_pattern_type pattern_type, struct grep_opt *opt)
{
	if (pattern_type != GREP_PATTERN_TYPE_UNSPECIFIED)
		grep_set_pattern_type_option(pattern_type, opt);
	else if (opt->pattern_type_option != GREP_PATTERN_TYPE_UNSPECIFIED)
		grep_set_pattern_type_option(opt->pattern_type_option, opt);
	else if (opt->extended_regexp_option)
239 240 241 242 243
		/*
		 * This branch *must* happen after setting from the
		 * opt->pattern_type_option above, we don't want
		 * grep.extendedRegexp to override grep.patternType!
		 */
244 245 246
		grep_set_pattern_type_option(GREP_PATTERN_TYPE_ERE, opt);
}

247 248 249 250
static struct grep_pat *create_grep_pat(const char *pat, size_t patlen,
					const char *origin, int no,
					enum grep_pat_token t,
					enum grep_header_field field)
251 252
{
	struct grep_pat *p = xcalloc(1, sizeof(*p));
253
	p->pattern = xmemdupz(pat, patlen);
254 255 256 257
	p->patternlen = patlen;
	p->origin = origin;
	p->no = no;
	p->token = t;
258
	p->field = field;
259 260 261
	return p;
}

262 263 264 265
static void do_append_grep_pat(struct grep_pat ***tail, struct grep_pat *p)
{
	**tail = p;
	*tail = &p->next;
266
	p->next = NULL;
267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296

	switch (p->token) {
	case GREP_PATTERN: /* atom */
	case GREP_PATTERN_HEAD:
	case GREP_PATTERN_BODY:
		for (;;) {
			struct grep_pat *new_pat;
			size_t len = 0;
			char *cp = p->pattern + p->patternlen, *nl = NULL;
			while (++len <= p->patternlen) {
				if (*(--cp) == '\n') {
					nl = cp;
					break;
				}
			}
			if (!nl)
				break;
			new_pat = create_grep_pat(nl + 1, len - 1, p->origin,
						  p->no, p->token, p->field);
			new_pat->next = p->next;
			if (!p->next)
				*tail = &new_pat->next;
			p->next = new_pat;
			*nl = '\0';
			p->patternlen -= len;
		}
		break;
	default:
		break;
	}
297 298
}

299 300 301 302 303
void append_header_grep_pattern(struct grep_opt *opt,
				enum grep_header_field field, const char *pat)
{
	struct grep_pat *p = create_grep_pat(pat, strlen(pat), "header", 0,
					     GREP_PATTERN_HEAD, field);
304 305
	if (field == GREP_HEADER_REFLOG)
		opt->use_reflog_filter = 1;
306
	do_append_grep_pat(&opt->header_tail, p);
307 308
}

309 310
void append_grep_pattern(struct grep_opt *opt, const char *pat,
			 const char *origin, int no, enum grep_pat_token t)
311 312 313 314 315 316
{
	append_grep_pat(opt, pat, strlen(pat), origin, no, t);
}

void append_grep_pat(struct grep_opt *opt, const char *pat, size_t patlen,
		     const char *origin, int no, enum grep_pat_token t)
317
{
318
	struct grep_pat *p = create_grep_pat(pat, patlen, origin, no, t, 0);
319
	do_append_grep_pat(&opt->pattern_tail, p);
320 321
}

F
Fredrik Kuivinen 已提交
322 323 324 325 326 327 328 329 330 331 332 333 334 335 336
struct grep_opt *grep_opt_dup(const struct grep_opt *opt)
{
	struct grep_pat *pat;
	struct grep_opt *ret = xmalloc(sizeof(struct grep_opt));
	*ret = *opt;

	ret->pattern_list = NULL;
	ret->pattern_tail = &ret->pattern_list;

	for(pat = opt->pattern_list; pat != NULL; pat = pat->next)
	{
		if(pat->token == GREP_PATTERN_HEAD)
			append_header_grep_pattern(ret, pat->field,
						   pat->pattern);
		else
337 338
			append_grep_pat(ret, pat->pattern, pat->patternlen,
					pat->origin, pat->no, pat->token);
F
Fredrik Kuivinen 已提交
339 340 341 342 343
	}

	return ret;
}

344 345 346 347 348 349
static NORETURN void compile_regexp_failed(const struct grep_pat *p,
		const char *error)
{
	char where[1024];

	if (p->no)
350
		xsnprintf(where, sizeof(where), "In '%s' at %d, ", p->origin, p->no);
351
	else if (p->origin)
352
		xsnprintf(where, sizeof(where), "%s, ", p->origin);
353 354 355 356 357 358
	else
		where[0] = 0;

	die("%s'%s': %s", where, p->pattern, error);
}

359 360 361 362 363 364 365 366 367 368 369 370
static int is_fixed(const char *s, size_t len)
{
	size_t i;

	for (i = 0; i < len; i++) {
		if (is_regex_special(s[i]))
			return 0;
	}

	return 1;
}

371 372 373 374 375 376 377 378 379 380 381 382
static int has_null(const char *s, size_t len)
{
	/*
	 * regcomp cannot accept patterns with NULs so when using it
	 * we consider any pattern containing a NUL fixed.
	 */
	if (memchr(s, 0, len))
		return 1;

	return 0;
}

383
#ifdef USE_LIBPCRE1
384
static void compile_pcre1_regexp(struct grep_pat *p, const struct grep_opt *opt)
M
Michał Kiedrowicz 已提交
385 386 387
{
	const char *error;
	int erroffset;
388
	int options = PCRE_MULTILINE;
M
Michał Kiedrowicz 已提交
389

390 391
	if (opt->ignore_case) {
		if (has_non_ascii(p->pattern))
392
			p->pcre1_tables = pcre_maketables();
M
Michał Kiedrowicz 已提交
393
		options |= PCRE_CASELESS;
394
	}
395 396
	if (is_utf8_locale() && has_non_ascii(p->pattern))
		options |= PCRE_UTF8;
M
Michał Kiedrowicz 已提交
397

398 399 400
	p->pcre1_regexp = pcre_compile(p->pattern, options, &error, &erroffset,
				      p->pcre1_tables);
	if (!p->pcre1_regexp)
M
Michał Kiedrowicz 已提交
401 402
		compile_regexp_failed(p, error);

403
	p->pcre1_extra_info = pcre_study(p->pcre1_regexp, GIT_PCRE_STUDY_JIT_COMPILE, &error);
404
	if (!p->pcre1_extra_info && error)
M
Michał Kiedrowicz 已提交
405
		die("%s", error);
406

407
#ifdef GIT_PCRE1_USE_JIT
408 409 410 411 412 413 414
	pcre_config(PCRE_CONFIG_JIT, &p->pcre1_jit_on);
	if (p->pcre1_jit_on == 1) {
		p->pcre1_jit_stack = pcre_jit_stack_alloc(1, 1024 * 1024);
		if (!p->pcre1_jit_stack)
			die("Couldn't allocate PCRE JIT stack");
		pcre_assign_jit_stack(p->pcre1_extra_info, NULL, p->pcre1_jit_stack);
	} else if (p->pcre1_jit_on != 0) {
415
		BUG("The pcre1_jit_on variable should be 0 or 1, not %d",
416 417 418
		    p->pcre1_jit_on);
	}
#endif
M
Michał Kiedrowicz 已提交
419 420
}

421
static int pcre1match(struct grep_pat *p, const char *line, const char *eol,
M
Michał Kiedrowicz 已提交
422 423 424 425 426 427 428
		regmatch_t *match, int eflags)
{
	int ovector[30], ret, flags = 0;

	if (eflags & REG_NOTBOL)
		flags |= PCRE_NOTBOL;

429
#ifdef GIT_PCRE1_USE_JIT
430 431 432 433 434 435 436 437 438 439 440 441
	if (p->pcre1_jit_on) {
		ret = pcre_jit_exec(p->pcre1_regexp, p->pcre1_extra_info, line,
				    eol - line, 0, flags, ovector,
				    ARRAY_SIZE(ovector), p->pcre1_jit_stack);
	} else
#endif
	{
		ret = pcre_exec(p->pcre1_regexp, p->pcre1_extra_info, line,
				eol - line, 0, flags, ovector,
				ARRAY_SIZE(ovector));
	}

M
Michał Kiedrowicz 已提交
442 443 444 445 446 447 448 449 450 451 452
	if (ret < 0 && ret != PCRE_ERROR_NOMATCH)
		die("pcre_exec failed with error code %d", ret);
	if (ret > 0) {
		ret = 0;
		match->rm_so = ovector[0];
		match->rm_eo = ovector[1];
	}

	return ret;
}

453
static void free_pcre1_regexp(struct grep_pat *p)
M
Michał Kiedrowicz 已提交
454
{
455
	pcre_free(p->pcre1_regexp);
456
#ifdef GIT_PCRE1_USE_JIT
457 458 459 460 461 462 463 464
	if (p->pcre1_jit_on) {
		pcre_free_study(p->pcre1_extra_info);
		pcre_jit_stack_free(p->pcre1_jit_stack);
	} else
#endif
	{
		pcre_free(p->pcre1_extra_info);
	}
465
	pcre_free((void *)p->pcre1_tables);
M
Michał Kiedrowicz 已提交
466
}
467
#else /* !USE_LIBPCRE1 */
468
static void compile_pcre1_regexp(struct grep_pat *p, const struct grep_opt *opt)
M
Michał Kiedrowicz 已提交
469 470 471 472
{
	die("cannot use Perl-compatible regexes when not compiled with USE_LIBPCRE");
}

473
static int pcre1match(struct grep_pat *p, const char *line, const char *eol,
M
Michał Kiedrowicz 已提交
474 475 476 477 478
		regmatch_t *match, int eflags)
{
	return 1;
}

479
static void free_pcre1_regexp(struct grep_pat *p)
M
Michał Kiedrowicz 已提交
480 481
{
}
482
#endif /* !USE_LIBPCRE1 */
M
Michał Kiedrowicz 已提交
483

484 485 486 487 488 489 490 491 492
#ifdef USE_LIBPCRE2
static void compile_pcre2_pattern(struct grep_pat *p, const struct grep_opt *opt)
{
	int error;
	PCRE2_UCHAR errbuf[256];
	PCRE2_SIZE erroffset;
	int options = PCRE2_MULTILINE;
	const uint8_t *character_tables = NULL;
	int jitret;
493 494
	int patinforet;
	size_t jitsizearg;
495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528

	assert(opt->pcre2);

	p->pcre2_compile_context = NULL;

	if (opt->ignore_case) {
		if (has_non_ascii(p->pattern)) {
			character_tables = pcre2_maketables(NULL);
			p->pcre2_compile_context = pcre2_compile_context_create(NULL);
			pcre2_set_character_tables(p->pcre2_compile_context, character_tables);
		}
		options |= PCRE2_CASELESS;
	}
	if (is_utf8_locale() && has_non_ascii(p->pattern))
		options |= PCRE2_UTF;

	p->pcre2_pattern = pcre2_compile((PCRE2_SPTR)p->pattern,
					 p->patternlen, options, &error, &erroffset,
					 p->pcre2_compile_context);

	if (p->pcre2_pattern) {
		p->pcre2_match_data = pcre2_match_data_create_from_pattern(p->pcre2_pattern, NULL);
		if (!p->pcre2_match_data)
			die("Couldn't allocate PCRE2 match data");
	} else {
		pcre2_get_error_message(error, errbuf, sizeof(errbuf));
		compile_regexp_failed(p, (const char *)&errbuf);
	}

	pcre2_config(PCRE2_CONFIG_JIT, &p->pcre2_jit_on);
	if (p->pcre2_jit_on == 1) {
		jitret = pcre2_jit_compile(p->pcre2_pattern, PCRE2_JIT_COMPLETE);
		if (jitret)
			die("Couldn't JIT the PCRE2 pattern '%s', got '%d'\n", p->pattern, jitret);
529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552

		/*
		 * The pcre2_config(PCRE2_CONFIG_JIT, ...) call just
		 * tells us whether the library itself supports JIT,
		 * but to see whether we're going to be actually using
		 * JIT we need to extract PCRE2_INFO_JITSIZE from the
		 * pattern *after* we do pcre2_jit_compile() above.
		 *
		 * This is because if the pattern contains the
		 * (*NO_JIT) verb (see pcre2syntax(3))
		 * pcre2_jit_compile() will exit early with 0. If we
		 * then proceed to call pcre2_jit_match() further down
		 * the line instead of pcre2_match() we'll either
		 * segfault (pre PCRE 10.31) or run into a fatal error
		 * (post PCRE2 10.31)
		 */
		patinforet = pcre2_pattern_info(p->pcre2_pattern, PCRE2_INFO_JITSIZE, &jitsizearg);
		if (patinforet)
			BUG("pcre2_pattern_info() failed: %d", patinforet);
		if (jitsizearg == 0) {
			p->pcre2_jit_on = 0;
			return;
		}

553 554 555 556
		p->pcre2_jit_stack = pcre2_jit_stack_create(1, 1024 * 1024, NULL);
		if (!p->pcre2_jit_stack)
			die("Couldn't allocate PCRE2 JIT stack");
		p->pcre2_match_context = pcre2_match_context_create(NULL);
557
		if (!p->pcre2_match_context)
558 559 560
			die("Couldn't allocate PCRE2 match context");
		pcre2_jit_stack_assign(p->pcre2_match_context, NULL, p->pcre2_jit_stack);
	} else if (p->pcre2_jit_on != 0) {
561
		BUG("The pcre2_jit_on variable should be 0 or 1, not %d",
562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630
		    p->pcre1_jit_on);
	}
}

static int pcre2match(struct grep_pat *p, const char *line, const char *eol,
		regmatch_t *match, int eflags)
{
	int ret, flags = 0;
	PCRE2_SIZE *ovector;
	PCRE2_UCHAR errbuf[256];

	if (eflags & REG_NOTBOL)
		flags |= PCRE2_NOTBOL;

	if (p->pcre2_jit_on)
		ret = pcre2_jit_match(p->pcre2_pattern, (unsigned char *)line,
				      eol - line, 0, flags, p->pcre2_match_data,
				      NULL);
	else
		ret = pcre2_match(p->pcre2_pattern, (unsigned char *)line,
				  eol - line, 0, flags, p->pcre2_match_data,
				  NULL);

	if (ret < 0 && ret != PCRE2_ERROR_NOMATCH) {
		pcre2_get_error_message(ret, errbuf, sizeof(errbuf));
		die("%s failed with error code %d: %s",
		    (p->pcre2_jit_on ? "pcre2_jit_match" : "pcre2_match"), ret,
		    errbuf);
	}
	if (ret > 0) {
		ovector = pcre2_get_ovector_pointer(p->pcre2_match_data);
		ret = 0;
		match->rm_so = (int)ovector[0];
		match->rm_eo = (int)ovector[1];
	}

	return ret;
}

static void free_pcre2_pattern(struct grep_pat *p)
{
	pcre2_compile_context_free(p->pcre2_compile_context);
	pcre2_code_free(p->pcre2_pattern);
	pcre2_match_data_free(p->pcre2_match_data);
	pcre2_jit_stack_free(p->pcre2_jit_stack);
	pcre2_match_context_free(p->pcre2_match_context);
}
#else /* !USE_LIBPCRE2 */
static void compile_pcre2_pattern(struct grep_pat *p, const struct grep_opt *opt)
{
	/*
	 * Unreachable until USE_LIBPCRE2 becomes synonymous with
	 * USE_LIBPCRE. See the sibling comment in
	 * grep_set_pattern_type_option().
	 */
	die("cannot use Perl-compatible regexes when not compiled with USE_LIBPCRE");
}

static int pcre2match(struct grep_pat *p, const char *line, const char *eol,
		regmatch_t *match, int eflags)
{
	return 1;
}

static void free_pcre2_pattern(struct grep_pat *p)
{
}
#endif /* !USE_LIBPCRE2 */

631 632 633 634
static void compile_fixed_regexp(struct grep_pat *p, struct grep_opt *opt)
{
	struct strbuf sb = STRBUF_INIT;
	int err;
635
	int regflags = 0;
636 637 638 639 640 641 642 643 644 645 646 647 648 649 650

	basic_regex_quote_buf(&sb, p->pattern);
	if (opt->ignore_case)
		regflags |= REG_ICASE;
	err = regcomp(&p->regexp, sb.buf, regflags);
	if (opt->debug)
		fprintf(stderr, "fixed %s\n", sb.buf);
	strbuf_release(&sb);
	if (err) {
		char errbuf[1024];
		regerror(err, &p->regexp, errbuf, sizeof(errbuf));
		compile_regexp_failed(p, errbuf);
	}
}

651 652
static void compile_regexp(struct grep_pat *p, struct grep_opt *opt)
{
653
	int ascii_only;
654
	int err;
655
	int regflags = REG_NEWLINE;
656

657
	p->word_regexp = opt->word_regexp;
658
	p->ignore_case = opt->ignore_case;
659
	ascii_only     = !has_non_ascii(p->pattern);
660

661 662 663 664 665 666 667 668 669 670 671 672
	/*
	 * Even when -F (fixed) asks us to do a non-regexp search, we
	 * may not be able to correctly case-fold when -i
	 * (ignore-case) is asked (in which case, we'll synthesize a
	 * regexp to match the pattern that matches regexp special
	 * characters literally, while ignoring case differences).  On
	 * the other hand, even without -F, if the pattern does not
	 * have any regexp special characters and there is no need for
	 * case-folding search, we can internally turn it into a
	 * simple string match using kws.  p->fixed tells us if we
	 * want to use kws.
	 */
673 674 675
	if (opt->fixed ||
	    has_null(p->pattern, p->patternlen) ||
	    is_fixed(p->pattern, p->patternlen))
676
		p->fixed = !p->ignore_case || ascii_only;
F
Fredrik Kuivinen 已提交
677 678

	if (p->fixed) {
679
		p->kws = kwsalloc(p->ignore_case ? tolower_trans_tbl : NULL);
F
Fredrik Kuivinen 已提交
680 681
		kwsincr(p->kws, p->pattern, p->patternlen);
		kwsprep(p->kws);
682
		return;
683 684 685 686 687 688 689 690
	} else if (opt->fixed) {
		/*
		 * We come here when the pattern has the non-ascii
		 * characters we cannot case-fold, and asked to
		 * ignore-case.
		 */
		compile_fixed_regexp(p, opt);
		return;
F
Fredrik Kuivinen 已提交
691
	}
692

693 694 695 696 697
	if (opt->pcre2) {
		compile_pcre2_pattern(p, opt);
		return;
	}

698 699
	if (opt->pcre1) {
		compile_pcre1_regexp(p, opt);
M
Michał Kiedrowicz 已提交
700 701 702
		return;
	}

703 704 705 706 707
	if (p->ignore_case)
		regflags |= REG_ICASE;
	if (opt->extended_regexp_option)
		regflags |= REG_EXTENDED;
	err = regcomp(&p->regexp, p->pattern, regflags);
708 709 710
	if (err) {
		char errbuf[1024];
		regerror(err, &p->regexp, errbuf, 1024);
711
		compile_regexp_failed(p, errbuf);
712 713 714
	}
}

J
Junio C Hamano 已提交
715
static struct grep_expr *compile_pattern_or(struct grep_pat **);
716 717 718 719 720 721
static struct grep_expr *compile_pattern_atom(struct grep_pat **list)
{
	struct grep_pat *p;
	struct grep_expr *x;

	p = *list;
722 723
	if (!p)
		return NULL;
724 725
	switch (p->token) {
	case GREP_PATTERN: /* atom */
726 727
	case GREP_PATTERN_HEAD:
	case GREP_PATTERN_BODY:
728 729 730 731 732 733 734
		x = xcalloc(1, sizeof (struct grep_expr));
		x->node = GREP_NODE_ATOM;
		x->u.atom = p;
		*list = p->next;
		return x;
	case GREP_OPEN_PAREN:
		*list = p->next;
J
Junio C Hamano 已提交
735
		x = compile_pattern_or(list);
736 737 738 739 740 741 742 743 744 745 746 747 748 749 750
		if (!*list || (*list)->token != GREP_CLOSE_PAREN)
			die("unmatched parenthesis");
		*list = (*list)->next;
		return x;
	default:
		return NULL;
	}
}

static struct grep_expr *compile_pattern_not(struct grep_pat **list)
{
	struct grep_pat *p;
	struct grep_expr *x;

	p = *list;
751 752
	if (!p)
		return NULL;
753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816
	switch (p->token) {
	case GREP_NOT:
		if (!p->next)
			die("--not not followed by pattern expression");
		*list = p->next;
		x = xcalloc(1, sizeof (struct grep_expr));
		x->node = GREP_NODE_NOT;
		x->u.unary = compile_pattern_not(list);
		if (!x->u.unary)
			die("--not followed by non pattern expression");
		return x;
	default:
		return compile_pattern_atom(list);
	}
}

static struct grep_expr *compile_pattern_and(struct grep_pat **list)
{
	struct grep_pat *p;
	struct grep_expr *x, *y, *z;

	x = compile_pattern_not(list);
	p = *list;
	if (p && p->token == GREP_AND) {
		if (!p->next)
			die("--and not followed by pattern expression");
		*list = p->next;
		y = compile_pattern_and(list);
		if (!y)
			die("--and not followed by pattern expression");
		z = xcalloc(1, sizeof (struct grep_expr));
		z->node = GREP_NODE_AND;
		z->u.binary.left = x;
		z->u.binary.right = y;
		return z;
	}
	return x;
}

static struct grep_expr *compile_pattern_or(struct grep_pat **list)
{
	struct grep_pat *p;
	struct grep_expr *x, *y, *z;

	x = compile_pattern_and(list);
	p = *list;
	if (x && p && p->token != GREP_CLOSE_PAREN) {
		y = compile_pattern_or(list);
		if (!y)
			die("not a pattern expression %s", p->pattern);
		z = xcalloc(1, sizeof (struct grep_expr));
		z->node = GREP_NODE_OR;
		z->u.binary.left = x;
		z->u.binary.right = y;
		return z;
	}
	return x;
}

static struct grep_expr *compile_pattern_expr(struct grep_pat **list)
{
	return compile_pattern_or(list);
}

817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887
static void indent(int in)
{
	while (in-- > 0)
		fputc(' ', stderr);
}

static void dump_grep_pat(struct grep_pat *p)
{
	switch (p->token) {
	case GREP_AND: fprintf(stderr, "*and*"); break;
	case GREP_OPEN_PAREN: fprintf(stderr, "*(*"); break;
	case GREP_CLOSE_PAREN: fprintf(stderr, "*)*"); break;
	case GREP_NOT: fprintf(stderr, "*not*"); break;
	case GREP_OR: fprintf(stderr, "*or*"); break;

	case GREP_PATTERN: fprintf(stderr, "pattern"); break;
	case GREP_PATTERN_HEAD: fprintf(stderr, "pattern_head"); break;
	case GREP_PATTERN_BODY: fprintf(stderr, "pattern_body"); break;
	}

	switch (p->token) {
	default: break;
	case GREP_PATTERN_HEAD:
		fprintf(stderr, "<head %d>", p->field); break;
	case GREP_PATTERN_BODY:
		fprintf(stderr, "<body>"); break;
	}
	switch (p->token) {
	default: break;
	case GREP_PATTERN_HEAD:
	case GREP_PATTERN_BODY:
	case GREP_PATTERN:
		fprintf(stderr, "%.*s", (int)p->patternlen, p->pattern);
		break;
	}
	fputc('\n', stderr);
}

static void dump_grep_expression_1(struct grep_expr *x, int in)
{
	indent(in);
	switch (x->node) {
	case GREP_NODE_TRUE:
		fprintf(stderr, "true\n");
		break;
	case GREP_NODE_ATOM:
		dump_grep_pat(x->u.atom);
		break;
	case GREP_NODE_NOT:
		fprintf(stderr, "(not\n");
		dump_grep_expression_1(x->u.unary, in+1);
		indent(in);
		fprintf(stderr, ")\n");
		break;
	case GREP_NODE_AND:
		fprintf(stderr, "(and\n");
		dump_grep_expression_1(x->u.binary.left, in+1);
		dump_grep_expression_1(x->u.binary.right, in+1);
		indent(in);
		fprintf(stderr, ")\n");
		break;
	case GREP_NODE_OR:
		fprintf(stderr, "(or\n");
		dump_grep_expression_1(x->u.binary.left, in+1);
		dump_grep_expression_1(x->u.binary.right, in+1);
		indent(in);
		fprintf(stderr, ")\n");
		break;
	}
}

888
static void dump_grep_expression(struct grep_opt *opt)
889 890 891 892 893 894 895 896 897
{
	struct grep_expr *x = opt->pattern_expression;

	if (opt->all_match)
		fprintf(stderr, "[all-match]\n");
	dump_grep_expression_1(x, 0);
	fflush(NULL);
}

898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913
static struct grep_expr *grep_true_expr(void)
{
	struct grep_expr *z = xcalloc(1, sizeof(*z));
	z->node = GREP_NODE_TRUE;
	return z;
}

static struct grep_expr *grep_or_expr(struct grep_expr *left, struct grep_expr *right)
{
	struct grep_expr *z = xcalloc(1, sizeof(*z));
	z->node = GREP_NODE_OR;
	z->u.binary.left = left;
	z->u.binary.right = right;
	return z;
}

914
static struct grep_expr *prep_header_patterns(struct grep_opt *opt)
915 916
{
	struct grep_pat *p;
917
	struct grep_expr *header_expr;
918 919
	struct grep_expr *(header_group[GREP_HEADER_FIELD_MAX]);
	enum grep_header_field fld;
920

921 922
	if (!opt->header_list)
		return NULL;
923

924 925
	for (p = opt->header_list; p; p = p->next) {
		if (p->token != GREP_PATTERN_HEAD)
926
			BUG("a non-header pattern in grep header list.");
927 928
		if (p->field < GREP_HEADER_FIELD_MIN ||
		    GREP_HEADER_FIELD_MAX <= p->field)
929
			BUG("unknown header field %d", p->field);
930
		compile_regexp(p, opt);
931
	}
932 933 934 935 936 937 938 939 940 941

	for (fld = 0; fld < GREP_HEADER_FIELD_MAX; fld++)
		header_group[fld] = NULL;

	for (p = opt->header_list; p; p = p->next) {
		struct grep_expr *h;
		struct grep_pat *pp = p;

		h = compile_pattern_atom(&pp);
		if (!h || pp != p->next)
942
			BUG("malformed header expr");
943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958
		if (!header_group[p->field]) {
			header_group[p->field] = h;
			continue;
		}
		header_group[p->field] = grep_or_expr(h, header_group[p->field]);
	}

	header_expr = NULL;

	for (fld = 0; fld < GREP_HEADER_FIELD_MAX; fld++) {
		if (!header_group[fld])
			continue;
		if (!header_expr)
			header_expr = grep_true_expr();
		header_expr = grep_or_expr(header_group[fld], header_expr);
	}
959 960 961
	return header_expr;
}

962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977
static struct grep_expr *grep_splice_or(struct grep_expr *x, struct grep_expr *y)
{
	struct grep_expr *z = x;

	while (x) {
		assert(x->node == GREP_NODE_OR);
		if (x->u.binary.right &&
		    x->u.binary.right->node == GREP_NODE_TRUE) {
			x->u.binary.right = y;
			break;
		}
		x = x->u.binary.right;
	}
	return z;
}

978
static void compile_grep_patterns_real(struct grep_opt *opt)
979 980 981
{
	struct grep_pat *p;
	struct grep_expr *header_expr = prep_header_patterns(opt);
J
Junio C Hamano 已提交
982

983
	for (p = opt->pattern_list; p; p = p->next) {
984 985 986 987
		switch (p->token) {
		case GREP_PATTERN: /* atom */
		case GREP_PATTERN_HEAD:
		case GREP_PATTERN_BODY:
988
			compile_regexp(p, opt);
989 990
			break;
		default:
991
			opt->extended = 1;
992 993
			break;
		}
994 995
	}

996 997
	if (opt->all_match || header_expr)
		opt->extended = 1;
998
	else if (!opt->extended && !opt->debug)
999 1000 1001
		return;

	p = opt->pattern_list;
1002 1003
	if (p)
		opt->pattern_expression = compile_pattern_expr(&p);
1004 1005
	if (p)
		die("incomplete pattern expression: %s", p->pattern);
1006 1007 1008 1009

	if (!header_expr)
		return;

1010
	if (!opt->pattern_expression)
1011
		opt->pattern_expression = header_expr;
1012 1013 1014
	else if (opt->all_match)
		opt->pattern_expression = grep_splice_or(header_expr,
							 opt->pattern_expression);
1015 1016 1017
	else
		opt->pattern_expression = grep_or_expr(opt->pattern_expression,
						       header_expr);
1018
	opt->all_match = 1;
1019 1020
}

1021 1022 1023 1024 1025 1026 1027
void compile_grep_patterns(struct grep_opt *opt)
{
	compile_grep_patterns_real(opt);
	if (opt->debug)
		dump_grep_expression(opt);
}

1028 1029 1030
static void free_pattern_expr(struct grep_expr *x)
{
	switch (x->node) {
1031
	case GREP_NODE_TRUE:
1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055
	case GREP_NODE_ATOM:
		break;
	case GREP_NODE_NOT:
		free_pattern_expr(x->u.unary);
		break;
	case GREP_NODE_AND:
	case GREP_NODE_OR:
		free_pattern_expr(x->u.binary.left);
		free_pattern_expr(x->u.binary.right);
		break;
	}
	free(x);
}

void free_grep_patterns(struct grep_opt *opt)
{
	struct grep_pat *p, *n;

	for (p = opt->pattern_list; p; p = n) {
		n = p->next;
		switch (p->token) {
		case GREP_PATTERN: /* atom */
		case GREP_PATTERN_HEAD:
		case GREP_PATTERN_BODY:
F
Fredrik Kuivinen 已提交
1056 1057
			if (p->kws)
				kwsfree(p->kws);
1058 1059
			else if (p->pcre1_regexp)
				free_pcre1_regexp(p);
1060 1061
			else if (p->pcre2_pattern)
				free_pcre2_pattern(p);
M
Michał Kiedrowicz 已提交
1062 1063
			else
				regfree(&p->regexp);
1064
			free(p->pattern);
1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076
			break;
		default:
			break;
		}
		free(p);
	}

	if (!opt->extended)
		return;
	free_pattern_expr(opt->pattern_expression);
}

1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092
static char *end_of_line(char *cp, unsigned long *left)
{
	unsigned long l = *left;
	while (l && *cp != '\n') {
		l--;
		cp++;
	}
	*left = l;
	return cp;
}

static int word_char(char ch)
{
	return isalnum(ch) || ch == '_';
}

1093 1094 1095
static void output_color(struct grep_opt *opt, const void *data, size_t size,
			 const char *color)
{
1096
	if (want_color(opt->color) && color && color[0]) {
1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108
		opt->output(opt, color, strlen(color));
		opt->output(opt, data, size);
		opt->output(opt, GIT_COLOR_RESET, strlen(GIT_COLOR_RESET));
	} else
		opt->output(opt, data, size);
}

static void output_sep(struct grep_opt *opt, char sign)
{
	if (opt->null_following_name)
		opt->output(opt, "\0", 1);
	else
1109
		output_color(opt, &sign, 1, opt->colors[GREP_COLOR_SEP]);
1110 1111
}

1112 1113
static void show_name(struct grep_opt *opt, const char *name)
{
1114
	output_color(opt, name, strlen(name), opt->colors[GREP_COLOR_FILENAME]);
F
Fredrik Kuivinen 已提交
1115
	opt->output(opt, opt->null_following_name ? "\0" : "\n", 1);
1116 1117
}

1118 1119
static int fixmatch(struct grep_pat *p, char *line, char *eol,
		    regmatch_t *match)
1120
{
F
Fredrik Kuivinen 已提交
1121 1122 1123
	struct kwsmatch kwsm;
	size_t offset = kwsexec(p->kws, line, eol - line, &kwsm);
	if (offset == -1) {
1124 1125
		match->rm_so = match->rm_eo = -1;
		return REG_NOMATCH;
F
Fredrik Kuivinen 已提交
1126 1127 1128
	} else {
		match->rm_so = offset;
		match->rm_eo = match->rm_so + kwsm.size[0];
1129 1130 1131 1132
		return 0;
	}
}

1133 1134 1135 1136 1137 1138 1139
static int patmatch(struct grep_pat *p, char *line, char *eol,
		    regmatch_t *match, int eflags)
{
	int hit;

	if (p->fixed)
		hit = !fixmatch(p, line, eol, match);
1140 1141
	else if (p->pcre1_regexp)
		hit = !pcre1match(p, line, eol, match, eflags);
1142 1143
	else if (p->pcre2_pattern)
		hit = !pcre2match(p, line, eol, match, eflags);
1144
	else
J
Johannes Schindelin 已提交
1145 1146
		hit = !regexec_buf(&p->regexp, line, eol - line, 1, match,
				   eflags);
1147 1148 1149 1150

	return hit;
}

1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172
static int strip_timestamp(char *bol, char **eol_p)
{
	char *eol = *eol_p;
	int ch;

	while (bol < --eol) {
		if (*eol != '>')
			continue;
		*eol_p = ++eol;
		ch = *eol;
		*eol = '\0';
		return ch;
	}
	return 0;
}

static struct {
	const char *field;
	size_t len;
} header_field[] = {
	{ "author ", 7 },
	{ "committer ", 10 },
1173
	{ "reflog ", 7 },
1174 1175
};

1176
static int match_one_pattern(struct grep_pat *p, char *bol, char *eol,
1177 1178
			     enum grep_context ctx,
			     regmatch_t *pmatch, int eflags)
1179 1180
{
	int hit = 0;
1181
	int saved_ch = 0;
R
René Scharfe 已提交
1182
	const char *start = bol;
1183

1184 1185 1186 1187
	if ((p->token != GREP_PATTERN) &&
	    ((p->token == GREP_PATTERN_HEAD) != (ctx == GREP_CONTEXT_HEAD)))
		return 0;

1188 1189 1190 1191 1192 1193 1194 1195 1196
	if (p->token == GREP_PATTERN_HEAD) {
		const char *field;
		size_t len;
		assert(p->field < ARRAY_SIZE(header_field));
		field = header_field[p->field].field;
		len = header_field[p->field].len;
		if (strncmp(bol, field, len))
			return 0;
		bol += len;
1197 1198 1199 1200 1201 1202 1203 1204
		switch (p->field) {
		case GREP_HEADER_AUTHOR:
		case GREP_HEADER_COMMITTER:
			saved_ch = strip_timestamp(bol, &eol);
			break;
		default:
			break;
		}
1205 1206
	}

1207
 again:
1208
	hit = patmatch(p, bol, eol, pmatch, eflags);
1209

1210
	if (hit && p->word_regexp) {
1211
		if ((pmatch[0].rm_so < 0) ||
1212
		    (eol - bol) < pmatch[0].rm_so ||
1213 1214 1215 1216 1217 1218 1219 1220 1221 1222
		    (pmatch[0].rm_eo < 0) ||
		    (eol - bol) < pmatch[0].rm_eo)
			die("regexp returned nonsense");

		/* Match beginning must be either beginning of the
		 * line, or at word boundary (i.e. the last char must
		 * not be a word char).  Similarly, match end must be
		 * either end of the line, or at word boundary
		 * (i.e. the next char must not be a word char).
		 */
1223
		if ( ((pmatch[0].rm_so == 0) ||
1224 1225 1226 1227 1228 1229 1230
		      !word_char(bol[pmatch[0].rm_so-1])) &&
		     ((pmatch[0].rm_eo == (eol-bol)) ||
		      !word_char(bol[pmatch[0].rm_eo])) )
			;
		else
			hit = 0;

1231 1232 1233 1234
		/* Words consist of at least one character. */
		if (pmatch->rm_so == pmatch->rm_eo)
			hit = 0;

1235 1236 1237 1238
		if (!hit && pmatch[0].rm_so + bol + 1 < eol) {
			/* There could be more than one match on the
			 * line, and the first match might not be
			 * strict word match.  But later ones could be!
1239 1240
			 * Forward to the next possible start, i.e. the
			 * next position following a non-word char.
1241 1242
			 */
			bol = pmatch[0].rm_so + bol + 1;
1243 1244
			while (word_char(bol[-1]) && bol < eol)
				bol++;
1245
			eflags |= REG_NOTBOL;
1246 1247
			if (bol < eol)
				goto again;
1248 1249
		}
	}
1250 1251
	if (p->token == GREP_PATTERN_HEAD && saved_ch)
		*eol = saved_ch;
R
René Scharfe 已提交
1252 1253 1254 1255
	if (hit) {
		pmatch[0].rm_so += bol - start;
		pmatch[0].rm_eo += bol - start;
	}
1256 1257 1258
	return hit;
}

1259 1260 1261
static int match_expr_eval(struct grep_opt *opt, struct grep_expr *x, char *bol,
			   char *eol, enum grep_context ctx, ssize_t *col,
			   ssize_t *icol, int collect_hits)
1262
{
J
Junio C Hamano 已提交
1263 1264
	int h = 0;

1265 1266
	if (!x)
		die("Not a valid grep expression");
1267
	switch (x->node) {
1268 1269 1270
	case GREP_NODE_TRUE:
		h = 1;
		break;
1271
	case GREP_NODE_ATOM:
1272 1273 1274 1275 1276 1277 1278
		{
			regmatch_t tmp;
			h = match_one_pattern(x->u.atom, bol, eol, ctx,
					      &tmp, 0);
			if (h && (*col < 0 || tmp.rm_so < *col))
				*col = tmp.rm_so;
		}
1279 1280
		break;
	case GREP_NODE_NOT:
1281 1282 1283 1284 1285
		/*
		 * Upon visiting a GREP_NODE_NOT, col and icol become swapped.
		 */
		h = !match_expr_eval(opt, x->u.unary, bol, eol, ctx, icol, col,
				     0);
J
Junio C Hamano 已提交
1286
		break;
1287
	case GREP_NODE_AND:
1288
		h = match_expr_eval(opt, x->u.binary.left, bol, eol, ctx, col,
1289
				    icol, 0);
1290 1291 1292 1293 1294 1295 1296 1297 1298
		if (h || opt->columnnum) {
			/*
			 * Don't short-circuit AND when given --column, since a
			 * NOT earlier in the tree may turn this into an OR. In
			 * this case, see the below comment.
			 */
			h &= match_expr_eval(opt, x->u.binary.right, bol, eol,
					     ctx, col, icol, 0);
		}
J
Junio C Hamano 已提交
1299
		break;
1300
	case GREP_NODE_OR:
1301 1302 1303 1304 1305 1306
		if (!(collect_hits || opt->columnnum)) {
			/*
			 * Don't short-circuit OR when given --column (or
			 * collecting hits) to ensure we don't skip a later
			 * child that would produce an earlier match.
			 */
1307 1308 1309 1310
			return (match_expr_eval(opt, x->u.binary.left, bol, eol,
						ctx, col, icol, 0) ||
				match_expr_eval(opt, x->u.binary.right, bol,
						eol, ctx, col, icol, 0));
1311
		}
1312 1313
		h = match_expr_eval(opt, x->u.binary.left, bol, eol, ctx, col,
				    icol, 0);
1314 1315
		if (collect_hits)
			x->u.binary.left->hit |= h;
1316
		h |= match_expr_eval(opt, x->u.binary.right, bol, eol, ctx, col,
1317
				     icol, collect_hits);
J
Junio C Hamano 已提交
1318 1319
		break;
	default:
1320
		die("Unexpected node type (internal error) %d", x->node);
1321
	}
J
Junio C Hamano 已提交
1322 1323 1324
	if (collect_hits)
		x->hit |= h;
	return h;
1325 1326
}

1327
static int match_expr(struct grep_opt *opt, char *bol, char *eol,
1328 1329
		      enum grep_context ctx, ssize_t *col,
		      ssize_t *icol, int collect_hits)
1330 1331
{
	struct grep_expr *x = opt->pattern_expression;
1332
	return match_expr_eval(opt, x, bol, eol, ctx, col, icol, collect_hits);
1333 1334
}

1335
static int match_line(struct grep_opt *opt, char *bol, char *eol,
1336
		      ssize_t *col, ssize_t *icol,
J
Junio C Hamano 已提交
1337
		      enum grep_context ctx, int collect_hits)
1338 1339
{
	struct grep_pat *p;
1340
	int hit = 0;
1341

1342
	if (opt->extended)
1343 1344
		return match_expr(opt, bol, eol, ctx, col, icol,
				  collect_hits);
J
Junio C Hamano 已提交
1345 1346

	/* we do not call with collect_hits without being extended */
1347
	for (p = opt->pattern_list; p; p = p->next) {
1348 1349
		regmatch_t tmp;
		if (match_one_pattern(p, bol, eol, ctx, &tmp, 0)) {
1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361
			hit |= 1;
			if (!opt->columnnum) {
				/*
				 * Without --column, any single match on a line
				 * is enough to know that it needs to be
				 * printed. With --column, scan _all_ patterns
				 * to find the earliest.
				 */
				break;
			}
			if (*col < 0 || tmp.rm_so < *col)
				*col = tmp.rm_so;
1362
		}
1363
	}
1364
	return hit;
1365 1366
}

R
René Scharfe 已提交
1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411
static int match_next_pattern(struct grep_pat *p, char *bol, char *eol,
			      enum grep_context ctx,
			      regmatch_t *pmatch, int eflags)
{
	regmatch_t match;

	if (!match_one_pattern(p, bol, eol, ctx, &match, eflags))
		return 0;
	if (match.rm_so < 0 || match.rm_eo < 0)
		return 0;
	if (pmatch->rm_so >= 0 && pmatch->rm_eo >= 0) {
		if (match.rm_so > pmatch->rm_so)
			return 1;
		if (match.rm_so == pmatch->rm_so && match.rm_eo < pmatch->rm_eo)
			return 1;
	}
	pmatch->rm_so = match.rm_so;
	pmatch->rm_eo = match.rm_eo;
	return 1;
}

static int next_match(struct grep_opt *opt, char *bol, char *eol,
		      enum grep_context ctx, regmatch_t *pmatch, int eflags)
{
	struct grep_pat *p;
	int hit = 0;

	pmatch->rm_so = pmatch->rm_eo = -1;
	if (bol < eol) {
		for (p = opt->pattern_list; p; p = p->next) {
			switch (p->token) {
			case GREP_PATTERN: /* atom */
			case GREP_PATTERN_HEAD:
			case GREP_PATTERN_BODY:
				hit |= match_next_pattern(p, bol, eol, ctx,
							  pmatch, eflags);
				break;
			default:
				break;
			}
		}
	}
	return hit;
}

T
Taylor Blau 已提交
1412 1413
static void show_line_header(struct grep_opt *opt, const char *name,
			     unsigned lno, ssize_t cno, char sign)
R
René Scharfe 已提交
1414
{
R
René Scharfe 已提交
1415
	if (opt->heading && opt->last_shown == 0) {
1416
		output_color(opt, name, strlen(name), opt->colors[GREP_COLOR_FILENAME]);
R
René Scharfe 已提交
1417 1418
		opt->output(opt, "\n", 1);
	}
1419 1420
	opt->last_shown = lno;

R
René Scharfe 已提交
1421
	if (!opt->heading && opt->pathname) {
1422
		output_color(opt, name, strlen(name), opt->colors[GREP_COLOR_FILENAME]);
1423
		output_sep(opt, sign);
F
Fredrik Kuivinen 已提交
1424 1425 1426
	}
	if (opt->linenum) {
		char buf[32];
1427
		xsnprintf(buf, sizeof(buf), "%d", lno);
1428
		output_color(opt, buf, strlen(buf), opt->colors[GREP_COLOR_LINENO]);
1429
		output_sep(opt, sign);
F
Fredrik Kuivinen 已提交
1430
	}
1431 1432 1433 1434 1435 1436 1437 1438
	/*
	 * Treat 'cno' as the 1-indexed offset from the start of a non-context
	 * line to its first match. Otherwise, 'cno' is 0 indicating that we are
	 * being called with a context line.
	 */
	if (opt->columnnum && cno) {
		char buf[32];
		xsnprintf(buf, sizeof(buf), "%"PRIuMAX, (uintmax_t)cno);
J
Junio C Hamano 已提交
1439
		output_color(opt, buf, strlen(buf), opt->colors[GREP_COLOR_COLUMNNO]);
1440 1441
		output_sep(opt, sign);
	}
T
Taylor Blau 已提交
1442 1443 1444 1445 1446 1447
}

static void show_line(struct grep_opt *opt, char *bol, char *eol,
		      const char *name, unsigned lno, ssize_t cno, char sign)
{
	int rest = eol - bol;
1448 1449
	const char *match_color = NULL;
	const char *line_color = NULL;
T
Taylor Blau 已提交
1450 1451 1452 1453 1454 1455 1456

	if (opt->file_break && opt->last_shown == 0) {
		if (opt->show_hunk_mark)
			opt->output(opt, "\n", 1);
	} else if (opt->pre_context || opt->post_context || opt->funcbody) {
		if (opt->last_shown == 0) {
			if (opt->show_hunk_mark) {
1457
				output_color(opt, "--", 2, opt->colors[GREP_COLOR_SEP]);
T
Taylor Blau 已提交
1458 1459 1460
				opt->output(opt, "\n", 1);
			}
		} else if (lno > opt->last_shown + 1) {
1461
			output_color(opt, "--", 2, opt->colors[GREP_COLOR_SEP]);
T
Taylor Blau 已提交
1462 1463 1464
			opt->output(opt, "\n", 1);
		}
	}
1465 1466 1467 1468 1469 1470 1471 1472
	if (!opt->only_matching) {
		/*
		 * In case the line we're being called with contains more than
		 * one match, leave printing each header to the loop below.
		 */
		show_line_header(opt, name, lno, cno, sign);
	}
	if (opt->color || opt->only_matching) {
R
René Scharfe 已提交
1473 1474 1475 1476 1477
		regmatch_t match;
		enum grep_context ctx = GREP_CONTEXT_BODY;
		int ch = *eol;
		int eflags = 0;

1478 1479
		if (opt->color) {
			if (sign == ':')
1480
				match_color = opt->colors[GREP_COLOR_MATCH_SELECTED];
1481
			else
1482
				match_color = opt->colors[GREP_COLOR_MATCH_CONTEXT];
1483
			if (sign == ':')
1484
				line_color = opt->colors[GREP_COLOR_SELECTED];
1485
			else if (sign == '-')
1486
				line_color = opt->colors[GREP_COLOR_CONTEXT];
1487
			else if (sign == '=')
1488
				line_color = opt->colors[GREP_COLOR_FUNCTION];
1489
		}
R
René Scharfe 已提交
1490 1491
		*eol = '\0';
		while (next_match(opt, bol, eol, ctx, &match, eflags)) {
1492 1493
			if (match.rm_so == match.rm_eo)
				break;
F
Fredrik Kuivinen 已提交
1494

1495 1496 1497 1498
			if (opt->only_matching)
				show_line_header(opt, name, lno, cno, sign);
			else
				output_color(opt, bol, match.rm_so, line_color);
1499
			output_color(opt, bol + match.rm_so,
1500
				     match.rm_eo - match.rm_so, match_color);
1501 1502
			if (opt->only_matching)
				opt->output(opt, "\n", 1);
R
René Scharfe 已提交
1503
			bol += match.rm_eo;
1504
			cno += match.rm_eo;
R
René Scharfe 已提交
1505 1506 1507 1508 1509
			rest -= match.rm_eo;
			eflags = REG_NOTBOL;
		}
		*eol = ch;
	}
1510 1511 1512 1513
	if (!opt->only_matching) {
		output_color(opt, bol, rest, line_color);
		opt->output(opt, "\n", 1);
	}
R
René Scharfe 已提交
1514 1515
}

J
Jeff King 已提交
1516 1517
int grep_use_locks;

1518 1519 1520 1521 1522 1523
/*
 * This lock protects access to the gitattributes machinery, which is
 * not thread-safe.
 */
pthread_mutex_t grep_attr_mutex;

J
Jeff King 已提交
1524
static inline void grep_attr_lock(void)
1525
{
J
Jeff King 已提交
1526
	if (grep_use_locks)
1527 1528 1529
		pthread_mutex_lock(&grep_attr_mutex);
}

J
Jeff King 已提交
1530
static inline void grep_attr_unlock(void)
1531
{
J
Jeff King 已提交
1532
	if (grep_use_locks)
1533 1534
		pthread_mutex_unlock(&grep_attr_mutex);
}
1535 1536 1537 1538 1539 1540

/*
 * Same as git_attr_mutex, but protecting the thread-unsafe object db access.
 */
pthread_mutex_t grep_read_mutex;

1541
static int match_funcname(struct grep_opt *opt, struct grep_source *gs, char *bol, char *eol)
1542
{
1543
	xdemitconf_t *xecfg = opt->priv;
1544
	if (xecfg && !xecfg->find_func) {
1545
		grep_source_load_driver(gs, opt->repo->index);
1546 1547
		if (gs->driver->funcname.pattern) {
			const struct userdiff_funcname *pe = &gs->driver->funcname;
1548 1549 1550 1551 1552 1553 1554
			xdiff_set_find_func(xecfg, pe->pattern, pe->cflags);
		} else {
			xecfg = opt->priv = NULL;
		}
	}

	if (xecfg) {
1555 1556 1557 1558 1559
		char buf[1];
		return xecfg->find_func(bol, eol - bol, buf, 1,
					xecfg->find_func_priv) >= 0;
	}

1560 1561 1562 1563 1564 1565 1566
	if (bol == eol)
		return 0;
	if (isalpha(*bol) || *bol == '_' || *bol == '$')
		return 1;
	return 0;
}

1567 1568
static void show_funcname_line(struct grep_opt *opt, struct grep_source *gs,
			       char *bol, unsigned lno)
1569
{
1570
	while (bol > gs->buf) {
1571 1572
		char *eol = --bol;

1573
		while (bol > gs->buf && bol[-1] != '\n')
1574 1575 1576 1577 1578 1579
			bol--;
		lno--;

		if (lno <= opt->last_shown)
			break;

1580
		if (match_funcname(opt, gs, bol, eol)) {
1581
			show_line(opt, bol, eol, gs->name, lno, 0, '=');
1582 1583 1584 1585 1586
			break;
		}
	}
}

1587 1588
static int is_empty_line(const char *bol, const char *eol);

1589
static void show_pre_context(struct grep_opt *opt, struct grep_source *gs,
1590
			     char *bol, char *end, unsigned lno)
1591
{
1592
	unsigned cur = lno, from = 1, funcname_lno = 0, orig_from;
1593
	int funcname_needed = !!opt->funcname, comment_needed = 0;
1594

1595 1596 1597 1598
	if (opt->pre_context < lno)
		from = lno - opt->pre_context;
	if (from <= opt->last_shown)
		from = opt->last_shown + 1;
1599
	orig_from = from;
1600 1601 1602 1603 1604
	if (opt->funcbody) {
		if (match_funcname(opt, gs, bol, end))
			comment_needed = 1;
		else
			funcname_needed = 1;
1605 1606
		from = opt->last_shown + 1;
	}
1607 1608

	/* Rewind. */
1609
	while (bol > gs->buf && cur > from) {
1610
		char *next_bol = bol;
1611 1612
		char *eol = --bol;

1613
		while (bol > gs->buf && bol[-1] != '\n')
1614 1615
			bol--;
		cur--;
1616 1617 1618 1619 1620 1621 1622 1623 1624 1625
		if (comment_needed && (is_empty_line(bol, eol) ||
				       match_funcname(opt, gs, bol, eol))) {
			comment_needed = 0;
			from = orig_from;
			if (cur < from) {
				cur++;
				bol = next_bol;
				break;
			}
		}
1626
		if (funcname_needed && match_funcname(opt, gs, bol, eol)) {
1627 1628
			funcname_lno = cur;
			funcname_needed = 0;
1629 1630 1631 1632
			if (opt->funcbody)
				comment_needed = 1;
			else
				from = orig_from;
1633
		}
1634 1635
	}

1636 1637
	/* We need to look even further back to find a function signature. */
	if (opt->funcname && funcname_needed)
1638
		show_funcname_line(opt, gs, bol, cur);
1639

1640 1641
	/* Back forward. */
	while (cur < lno) {
1642
		char *eol = bol, sign = (cur == funcname_lno) ? '=' : '-';
1643 1644 1645

		while (*eol != '\n')
			eol++;
1646
		show_line(opt, bol, eol, gs->name, cur, 0, sign);
1647 1648 1649 1650 1651
		bol = eol + 1;
		cur++;
	}
}

1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681
static int should_lookahead(struct grep_opt *opt)
{
	struct grep_pat *p;

	if (opt->extended)
		return 0; /* punt for too complex stuff */
	if (opt->invert)
		return 0;
	for (p = opt->pattern_list; p; p = p->next) {
		if (p->token != GREP_PATTERN)
			return 0; /* punt for "header only" and stuff */
	}
	return 1;
}

static int look_ahead(struct grep_opt *opt,
		      unsigned long *left_p,
		      unsigned *lno_p,
		      char **bol_p)
{
	unsigned lno = *lno_p;
	char *bol = *bol_p;
	struct grep_pat *p;
	char *sp, *last_bol;
	regoff_t earliest = -1;

	for (p = opt->pattern_list; p; p = p->next) {
		int hit;
		regmatch_t m;

1682
		hit = patmatch(p, bol, bol + *left_p, &m, 0);
1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707
		if (!hit || m.rm_so < 0 || m.rm_eo < 0)
			continue;
		if (earliest < 0 || m.rm_so < earliest)
			earliest = m.rm_so;
	}

	if (earliest < 0) {
		*bol_p = bol + *left_p;
		*left_p = 0;
		return 1;
	}
	for (sp = bol + earliest; bol < sp && sp[-1] != '\n'; sp--)
		; /* find the beginning of the line */
	last_bol = sp;

	for (sp = bol; sp < last_bol; sp++) {
		if (*sp == '\n')
			lno++;
	}
	*left_p -= last_bol - bol;
	*bol_p = last_bol;
	*lno_p = lno;
	return 0;
}

1708 1709
static int fill_textconv_grep(struct repository *r,
			      struct userdiff_driver *driver,
J
Jeff King 已提交
1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725
			      struct grep_source *gs)
{
	struct diff_filespec *df;
	char *buf;
	size_t size;

	if (!driver || !driver->textconv)
		return grep_source_load(gs);

	/*
	 * The textconv interface is intimately tied to diff_filespecs, so we
	 * have to pretend to be one. If we could unify the grep_source
	 * and diff_filespec structs, this mess could just go away.
	 */
	df = alloc_filespec(gs->path);
	switch (gs->type) {
1726
	case GREP_SOURCE_OID:
J
Jeff King 已提交
1727 1728 1729
		fill_filespec(df, gs->identifier, 1, 0100644);
		break;
	case GREP_SOURCE_FILE:
1730
		fill_filespec(df, &null_oid, 0, 0100644);
J
Jeff King 已提交
1731 1732
		break;
	default:
1733
		BUG("attempt to textconv something without a path?");
J
Jeff King 已提交
1734 1735 1736 1737 1738 1739 1740 1741
	}

	/*
	 * fill_textconv is not remotely thread-safe; it may load objects
	 * behind the scenes, and it modifies the global diff tempfile
	 * structure.
	 */
	grep_read_lock();
1742
	size = fill_textconv(r, driver, df, &buf);
J
Jeff King 已提交
1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760
	grep_read_unlock();
	free_filespec(df);

	/*
	 * The normal fill_textconv usage by the diff machinery would just keep
	 * the textconv'd buf separate from the diff_filespec. But much of the
	 * grep code passes around a grep_source and assumes that its "buf"
	 * pointer is the beginning of the thing we are searching. So let's
	 * install our textconv'd version into the grep_source, taking care not
	 * to leak any existing buffer.
	 */
	grep_source_clear_data(gs);
	gs->buf = buf;
	gs->size = size;

	return 0;
}

1761 1762 1763 1764 1765 1766 1767
static int is_empty_line(const char *bol, const char *eol)
{
	while (bol < eol && isspace(*bol))
		bol++;
	return bol == eol;
}

1768
static int grep_source_1(struct grep_opt *opt, struct grep_source *gs, int collect_hits)
1769
{
1770
	char *bol;
1771
	char *peek_bol = NULL;
1772
	unsigned long left;
1773 1774 1775 1776
	unsigned lno = 1;
	unsigned last_hit = 0;
	int binary_match_only = 0;
	unsigned count = 0;
1777
	int try_lookahead = 0;
1778
	int show_function = 0;
J
Jeff King 已提交
1779
	struct userdiff_driver *textconv = NULL;
1780
	enum grep_context ctx = GREP_CONTEXT_HEAD;
1781
	xdemitconf_t xecfg;
1782

F
Fredrik Kuivinen 已提交
1783 1784 1785
	if (!opt->output)
		opt->output = std_output;

1786 1787
	if (opt->pre_context || opt->post_context || opt->file_break ||
	    opt->funcbody) {
1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798
		/* Show hunk marks, except for the first file. */
		if (opt->last_shown)
			opt->show_hunk_mark = 1;
		/*
		 * If we're using threads then we can't easily identify
		 * the first file.  Always put hunk marks in that case
		 * and skip the very first one later in work_done().
		 */
		if (opt->output != std_output)
			opt->show_hunk_mark = 1;
	}
1799 1800
	opt->last_shown = 0;

J
Jeff King 已提交
1801
	if (opt->allow_textconv) {
1802
		grep_source_load_driver(gs, opt->repo->index);
J
Jeff King 已提交
1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818
		/*
		 * We might set up the shared textconv cache data here, which
		 * is not thread-safe.
		 */
		grep_attr_lock();
		textconv = userdiff_get_textconv(gs->driver);
		grep_attr_unlock();
	}

	/*
	 * We know the result of a textconv is text, so we only have to care
	 * about binary handling if we are not using it.
	 */
	if (!textconv) {
		switch (opt->binary) {
		case GREP_BINARY_DEFAULT:
1819
			if (grep_source_is_binary(gs, opt->repo->index))
J
Jeff King 已提交
1820 1821 1822
				binary_match_only = 1;
			break;
		case GREP_BINARY_NOMATCH:
1823
			if (grep_source_is_binary(gs, opt->repo->index))
J
Jeff King 已提交
1824 1825 1826 1827 1828
				return 0; /* Assume unmatch */
			break;
		case GREP_BINARY_TEXT:
			break;
		default:
1829
			BUG("unknown binary handling mode");
J
Jeff King 已提交
1830
		}
1831 1832
	}

1833
	memset(&xecfg, 0, sizeof(xecfg));
1834 1835
	opt->priv = &xecfg;

1836
	try_lookahead = should_lookahead(opt);
1837

1838
	if (fill_textconv_grep(opt->repo, textconv, gs) < 0)
1839 1840
		return 0;

1841 1842
	bol = gs->buf;
	left = gs->size;
1843 1844
	while (left) {
		char *eol, ch;
J
Junio C Hamano 已提交
1845
		int hit;
1846
		ssize_t cno;
1847
		ssize_t col = -1, icol = -1;
1848

1849
		/*
1850
		 * look_ahead() skips quickly to the line that possibly
1851 1852 1853 1854 1855 1856 1857 1858 1859
		 * has the next hit; don't call it if we need to do
		 * something more than just skipping the current line
		 * in response to an unmatch for the current line.  E.g.
		 * inside a post-context window, we will show the current
		 * line as a context around the previous hit when it
		 * doesn't hit.
		 */
		if (try_lookahead
		    && !(last_hit
1860 1861
			 && (show_function ||
			     lno <= last_hit + opt->post_context))
1862 1863
		    && look_ahead(opt, &left, &lno, &bol))
			break;
1864 1865 1866 1867
		eol = end_of_line(bol, &left);
		ch = *eol;
		*eol = 0;

1868 1869 1870
		if ((ctx == GREP_CONTEXT_HEAD) && (eol == bol))
			ctx = GREP_CONTEXT_BODY;

1871
		hit = match_line(opt, bol, eol, &col, &icol, ctx, collect_hits);
1872 1873
		*eol = ch;

J
Junio C Hamano 已提交
1874 1875 1876
		if (collect_hits)
			goto next_line;

1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891
		/* "grep -v -e foo -e bla" should list lines
		 * that do not have either, so inversion should
		 * be done outside.
		 */
		if (opt->invert)
			hit = !hit;
		if (opt->unmatch_name_only) {
			if (hit)
				return 0;
			goto next_line;
		}
		if (hit) {
			count++;
			if (opt->status_only)
				return 1;
R
René Scharfe 已提交
1892
			if (opt->name_only) {
1893
				show_name(opt, gs->name);
R
René Scharfe 已提交
1894 1895
				return 1;
			}
R
René Scharfe 已提交
1896 1897
			if (opt->count)
				goto next_line;
1898
			if (binary_match_only) {
F
Fredrik Kuivinen 已提交
1899
				opt->output(opt, "Binary file ", 12);
1900
				output_color(opt, gs->name, strlen(gs->name),
1901
					     opt->colors[GREP_COLOR_FILENAME]);
F
Fredrik Kuivinen 已提交
1902
				opt->output(opt, " matches\n", 9);
1903 1904 1905 1906 1907
				return 1;
			}
			/* Hit at this line.  If we haven't shown the
			 * pre-context lines, we would need to show them.
			 */
1908
			if (opt->pre_context || opt->funcbody)
1909
				show_pre_context(opt, gs, bol, eol, lno);
1910
			else if (opt->funcname)
1911
				show_funcname_line(opt, gs, bol, lno);
1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923
			cno = opt->invert ? icol : col;
			if (cno < 0) {
				/*
				 * A negative cno indicates that there was no
				 * match on the line. We are thus inverted and
				 * being asked to show all lines that _don't_
				 * match a given expression. Therefore, set cno
				 * to 0 to suggest the whole line matches.
				 */
				cno = 0;
			}
			show_line(opt, bol, eol, gs->name, lno, cno + 1, ':');
1924
			last_hit = lno;
1925 1926 1927
			if (opt->funcbody)
				show_function = 1;
			goto next_line;
1928
		}
1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946
		if (show_function && (!peek_bol || peek_bol < bol)) {
			unsigned long peek_left = left;
			char *peek_eol = eol;

			/*
			 * Trailing empty lines are not interesting.
			 * Peek past them to see if they belong to the
			 * body of the current function.
			 */
			peek_bol = bol;
			while (is_empty_line(peek_bol, peek_eol)) {
				peek_bol = peek_eol + 1;
				peek_eol = end_of_line(peek_bol, &peek_left);
			}

			if (match_funcname(opt, gs, peek_bol, peek_eol))
				show_function = 0;
		}
1947 1948
		if (show_function ||
		    (last_hit && lno <= last_hit + opt->post_context)) {
1949 1950 1951
			/* If the last hit is within the post context,
			 * we need to show this line.
			 */
1952
			show_line(opt, bol, eol, gs->name, lno, col + 1, '-');
1953 1954 1955 1956 1957 1958 1959 1960 1961 1962
		}

	next_line:
		bol = eol + 1;
		if (!left)
			break;
		left--;
		lno++;
	}

J
Junio C Hamano 已提交
1963 1964
	if (collect_hits)
		return 0;
1965

1966
	if (opt->status_only)
1967
		return opt->unmatch_name_only;
1968 1969
	if (opt->unmatch_name_only) {
		/* We did not see any hit, so we want to show this */
1970
		show_name(opt, gs->name);
1971 1972 1973
		return 1;
	}

1974 1975 1976
	xdiff_clear_find_func(&xecfg);
	opt->priv = NULL;

1977 1978 1979 1980 1981
	/* NEEDSWORK:
	 * The real "grep -c foo *.c" gives many "bar.c:0" lines,
	 * which feels mostly useless but sometimes useful.  Maybe
	 * make it another option?  For now suppress them.
	 */
F
Fredrik Kuivinen 已提交
1982 1983
	if (opt->count && count) {
		char buf[32];
1984 1985
		if (opt->pathname) {
			output_color(opt, gs->name, strlen(gs->name),
1986
				     opt->colors[GREP_COLOR_FILENAME]);
1987 1988
			output_sep(opt, ':');
		}
1989
		xsnprintf(buf, sizeof(buf), "%u\n", count);
F
Fredrik Kuivinen 已提交
1990
		opt->output(opt, buf, strlen(buf));
R
René Scharfe 已提交
1991
		return 1;
F
Fredrik Kuivinen 已提交
1992
	}
1993 1994 1995
	return !!last_hit;
}

J
Junio C Hamano 已提交
1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021
static void clr_hit_marker(struct grep_expr *x)
{
	/* All-hit markers are meaningful only at the very top level
	 * OR node.
	 */
	while (1) {
		x->hit = 0;
		if (x->node != GREP_NODE_OR)
			return;
		x->u.binary.left->hit = 0;
		x = x->u.binary.right;
	}
}

static int chk_hit_marker(struct grep_expr *x)
{
	/* Top level nodes have hit markers.  See if they all are hits */
	while (1) {
		if (x->node != GREP_NODE_OR)
			return x->hit;
		if (!x->u.binary.left->hit)
			return 0;
		x = x->u.binary.right;
	}
}

2022
int grep_source(struct grep_opt *opt, struct grep_source *gs)
J
Junio C Hamano 已提交
2023 2024 2025 2026 2027 2028
{
	/*
	 * we do not have to do the two-pass grep when we do not check
	 * buffer-wide "all-match".
	 */
	if (!opt->all_match)
2029
		return grep_source_1(opt, gs, 0);
J
Junio C Hamano 已提交
2030 2031 2032 2033 2034

	/* Otherwise the toplevel "or" terms hit a bit differently.
	 * We first clear hit markers from them.
	 */
	clr_hit_marker(opt->pattern_expression);
2035
	grep_source_1(opt, gs, 1);
J
Junio C Hamano 已提交
2036 2037 2038 2039

	if (!chk_hit_marker(opt->pattern_expression))
		return 0;

2040 2041 2042
	return grep_source_1(opt, gs, 0);
}

2043
int grep_buffer(struct grep_opt *opt, char *buf, unsigned long size)
2044 2045 2046 2047
{
	struct grep_source gs;
	int r;

2048
	grep_source_init(&gs, GREP_SOURCE_BUF, NULL, NULL, NULL);
2049 2050 2051 2052 2053 2054 2055 2056 2057 2058
	gs.buf = buf;
	gs.size = size;

	r = grep_source(opt, &gs);

	grep_source_clear(&gs);
	return r;
}

void grep_source_init(struct grep_source *gs, enum grep_source_type type,
2059 2060
		      const char *name, const char *path,
		      const void *identifier)
2061 2062
{
	gs->type = type;
2063 2064
	gs->name = xstrdup_or_null(name);
	gs->path = xstrdup_or_null(path);
2065 2066
	gs->buf = NULL;
	gs->size = 0;
2067
	gs->driver = NULL;
2068 2069 2070 2071 2072

	switch (type) {
	case GREP_SOURCE_FILE:
		gs->identifier = xstrdup(identifier);
		break;
2073 2074
	case GREP_SOURCE_OID:
		gs->identifier = oiddup(identifier);
2075 2076 2077
		break;
	case GREP_SOURCE_BUF:
		gs->identifier = NULL;
2078
		break;
2079 2080 2081 2082 2083
	}
}

void grep_source_clear(struct grep_source *gs)
{
2084 2085 2086
	FREE_AND_NULL(gs->name);
	FREE_AND_NULL(gs->path);
	FREE_AND_NULL(gs->identifier);
2087 2088 2089 2090 2091 2092 2093
	grep_source_clear_data(gs);
}

void grep_source_clear_data(struct grep_source *gs)
{
	switch (gs->type) {
	case GREP_SOURCE_FILE:
2094
	case GREP_SOURCE_OID:
2095
		FREE_AND_NULL(gs->buf);
2096 2097 2098 2099 2100 2101 2102 2103
		gs->size = 0;
		break;
	case GREP_SOURCE_BUF:
		/* leave user-provided buf intact */
		break;
	}
}

2104
static int grep_source_load_oid(struct grep_source *gs)
2105 2106 2107 2108
{
	enum object_type type;

	grep_read_lock();
2109
	gs->buf = read_object_file(gs->identifier, &type, &gs->size);
2110 2111 2112 2113 2114
	grep_read_unlock();

	if (!gs->buf)
		return error(_("'%s': unable to read %s"),
			     gs->name,
2115
			     oid_to_hex(gs->identifier));
2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129
	return 0;
}

static int grep_source_load_file(struct grep_source *gs)
{
	const char *filename = gs->identifier;
	struct stat st;
	char *data;
	size_t size;
	int i;

	if (lstat(filename, &st) < 0) {
	err_ret:
		if (errno != ENOENT)
2130
			error_errno(_("failed to stat '%s'"), filename);
2131 2132 2133 2134 2135 2136 2137 2138
		return -1;
	}
	if (!S_ISREG(st.st_mode))
		return -1;
	size = xsize_t(st.st_size);
	i = open(filename, O_RDONLY);
	if (i < 0)
		goto err_ret;
2139
	data = xmallocz(size);
2140
	if (st.st_size != read_in_full(i, data, size)) {
2141
		error_errno(_("'%s': short read"), filename);
2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152
		close(i);
		free(data);
		return -1;
	}
	close(i);

	gs->buf = data;
	gs->size = size;
	return 0;
}

2153
static int grep_source_load(struct grep_source *gs)
2154 2155 2156 2157 2158 2159 2160
{
	if (gs->buf)
		return 0;

	switch (gs->type) {
	case GREP_SOURCE_FILE:
		return grep_source_load_file(gs);
2161 2162
	case GREP_SOURCE_OID:
		return grep_source_load_oid(gs);
2163 2164 2165
	case GREP_SOURCE_BUF:
		return gs->buf ? 0 : -1;
	}
2166
	BUG("invalid grep_source type to load");
J
Junio C Hamano 已提交
2167
}
2168

2169 2170
void grep_source_load_driver(struct grep_source *gs,
			     struct index_state *istate)
2171 2172 2173 2174 2175
{
	if (gs->driver)
		return;

	grep_attr_lock();
2176
	if (gs->path)
2177
		gs->driver = userdiff_find_by_path(istate, gs->path);
2178 2179 2180 2181
	if (!gs->driver)
		gs->driver = userdiff_find_by_name("default");
	grep_attr_unlock();
}
2182

2183 2184
static int grep_source_is_binary(struct grep_source *gs,
				 struct index_state *istate)
2185
{
2186
	grep_source_load_driver(gs, istate);
2187 2188 2189 2190 2191 2192 2193 2194
	if (gs->driver->binary != -1)
		return gs->driver->binary;

	if (!grep_source_load(gs))
		return buffer_is_binary(gs->buf, gs->size);

	return 0;
}