apply.c 34.0 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
/*
 * apply.c
 *
 * Copyright (C) Linus Torvalds, 2005
 *
 * This applies patches on top of some (arbitrary) version of the SCM.
 *
 * NOTE! It does all its work in the index file, and only cares about
 * the files in the working directory if you tell it to "merge" the
 * patch apply.
 *
 * Even when merging it always takes the source from the index, and
 * uses the working tree as a "branch" for a 3-way merge.
 */
#include <ctype.h>
16
#include <fnmatch.h>
L
Linus Torvalds 已提交
17 18 19
#include "cache.h"

// We default to the merge behaviour, since that's what most people would
20 21 22 23 24 25 26
// expect.
//
//  --check turns on checking that the working tree matches the
//    files that are being modified, but doesn't apply the patch
//  --stat does just a diffstat, and doesn't actually apply
//  --show-files shows the directory changes
//
L
Linus Torvalds 已提交
27
static int merge_patch = 1;
28
static int check_index = 0;
29
static int write_index = 0;
30
static int diffstat = 0;
31
static int summary = 0;
32 33 34
static int check = 0;
static int apply = 1;
static int show_files = 0;
35 36
static const char apply_usage[] =
"git-apply [--no-merge] [--stat] [--summary] [--check] [--index] [--apply] [--show-files] <patch>...";
L
Linus Torvalds 已提交
37

38 39 40 41 42 43 44
/*
 * For "diff-stat" like behaviour, we keep track of the biggest change
 * we've seen, and the longest filename. That allows us to do simple
 * scaling.
 */
static int max_change, max_len;

45 46 47 48 49
/*
 * Various "current state", notably line numbers and what
 * file (and how) we're patching right now.. The "is_xxxx"
 * things are flags, where -1 means "don't know yet".
 */
50
static int linenr = 1;
51 52 53 54 55 56 57 58 59 60

struct fragment {
	unsigned long oldpos, oldlines;
	unsigned long newpos, newlines;
	const char *patch;
	int size;
	struct fragment *next;
};

struct patch {
61
	char *new_name, *old_name, *def_name;
62 63
	unsigned int old_mode, new_mode;
	int is_rename, is_copy, is_new, is_delete;
64
	int lines_added, lines_deleted;
65
	int score;
66
	struct fragment *fragments;
67
	char *result;
68
	unsigned long resultsize;
69 70
	struct patch *next;
};
71

L
Linus Torvalds 已提交
72
#define CHUNKSIZE (8192)
73
#define SLOP (16)
L
Linus Torvalds 已提交
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97

static void *read_patch_file(int fd, unsigned long *sizep)
{
	unsigned long size = 0, alloc = CHUNKSIZE;
	void *buffer = xmalloc(alloc);

	for (;;) {
		int nr = alloc - size;
		if (nr < 1024) {
			alloc += CHUNKSIZE;
			buffer = xrealloc(buffer, alloc);
			nr = alloc - size;
		}
		nr = read(fd, buffer + size, nr);
		if (!nr)
			break;
		if (nr < 0) {
			if (errno == EAGAIN)
				continue;
			die("git-apply: read returned %s", strerror(errno));
		}
		size += nr;
	}
	*sizep = size;
98 99 100 101 102 103 104 105 106

	/*
	 * Make sure that we have some slop in the buffer
	 * so that we can do speculative "memcmp" etc, and
	 * see to it that it is NUL-filled.
	 */
	if (alloc < size + SLOP)
		buffer = xrealloc(buffer, size + SLOP);
	memset(buffer + size, 0, SLOP);
L
Linus Torvalds 已提交
107 108 109
	return buffer;
}

110
static unsigned long linelen(const char *buffer, unsigned long size)
L
Linus Torvalds 已提交
111 112 113 114 115 116 117 118 119 120
{
	unsigned long len = 0;
	while (size--) {
		len++;
		if (*buffer++ == '\n')
			break;
	}
	return len;
}

121 122 123 124 125
static int is_dev_null(const char *str)
{
	return !memcmp("/dev/null", str, 9) && isspace(str[9]);
}

126 127
#define TERM_SPACE	1
#define TERM_TAB	2
128 129 130 131 132 133 134 135 136 137 138 139

static int name_terminate(const char *name, int namelen, int c, int terminate)
{
	if (c == ' ' && !(terminate & TERM_SPACE))
		return 0;
	if (c == '\t' && !(terminate & TERM_TAB))
		return 0;

	return 1;
}

static char * find_name(const char *line, char *def, int p_value, int terminate)
L
Linus Torvalds 已提交
140
{
141 142 143 144
	int len;
	const char *start = line;
	char *name;

L
Linus Torvalds 已提交
145
	for (;;) {
146
		char c = *line;
147 148 149 150 151 152 153

		if (isspace(c)) {
			if (c == '\n')
				break;
			if (name_terminate(start, line-start, c, terminate))
				break;
		}
154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173
		line++;
		if (c == '/' && !--p_value)
			start = line;
	}
	if (!start)
		return def;
	len = line - start;
	if (!len)
		return def;

	/*
	 * Generally we prefer the shorter name, especially
	 * if the other one is just a variation of that with
	 * something else tacked on to the end (ie "file.orig"
	 * or "file~").
	 */
	if (def) {
		int deflen = strlen(def);
		if (deflen < len && !strncmp(start, def, deflen))
			return def;
L
Linus Torvalds 已提交
174
	}
175 176 177 178 179 180 181 182 183 184 185 186

	name = xmalloc(len + 1);
	memcpy(name, start, len);
	name[len] = 0;
	free(def);
	return name;
}

/*
 * Get the name etc info from the --/+++ lines of a traditional patch header
 *
 * NOTE! This hardcodes "-p1" behaviour in filename detection.
187 188 189 190
 *
 * FIXME! The end-of-filename heuristics are kind of screwy. For existing
 * files, we can happily check the index for a match, but for creating a
 * new file we should try to match whatever "patch" does. I have no idea.
191
 */
192
static void parse_traditional_patch(const char *first, const char *second, struct patch *patch)
193 194 195 196 197 198 199
{
	int p_value = 1;
	char *name;

	first += 4;	// skip "--- "
	second += 4;	// skip "+++ "
	if (is_dev_null(first)) {
200 201
		patch->is_new = 1;
		patch->is_delete = 0;
202
		name = find_name(second, NULL, p_value, TERM_SPACE | TERM_TAB);
203
		patch->new_name = name;
204
	} else if (is_dev_null(second)) {
205 206
		patch->is_new = 0;
		patch->is_delete = 1;
207
		name = find_name(first, NULL, p_value, TERM_SPACE | TERM_TAB);
208
		patch->old_name = name;
209
	} else {
210 211
		name = find_name(first, NULL, p_value, TERM_SPACE | TERM_TAB);
		name = find_name(second, name, p_value, TERM_SPACE | TERM_TAB);
212
		patch->old_name = patch->new_name = name;
213 214 215 216 217
	}
	if (!name)
		die("unable to find filename in patch at line %d", linenr);
}

218
static int gitdiff_hdrend(const char *line, struct patch *patch)
219 220 221 222
{
	return -1;
}

223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
/*
 * We're anal about diff header consistency, to make
 * sure that we don't end up having strange ambiguous
 * patches floating around.
 *
 * As a result, gitdiff_{old|new}name() will check
 * their names against any previous information, just
 * to make sure..
 */
static char *gitdiff_verify_name(const char *line, int isnull, char *orig_name, const char *oldnew)
{
	int len;
	const char *name;

	if (!orig_name && !isnull)
		return find_name(line, NULL, 1, 0);

	name = "/dev/null";
	len = 9;
	if (orig_name) {
		name = orig_name;
		len = strlen(name);
		if (isnull)
			die("git-apply: bad git-diff - expected /dev/null, got %s on line %d", name, linenr);
	}

	if (*name == '/')
		goto absolute_path;

	for (;;) {
		char c = *line++;
		if (c == '\n')
			break;
		if (c != '/')
			continue;
absolute_path:
		if (memcmp(line, name, len) || line[len] != '\n')
			break;
		return orig_name;
	}
	die("git-apply: bad git-diff - inconsistent %s filename on line %d", oldnew, linenr);
	return NULL;
}

267
static int gitdiff_oldname(const char *line, struct patch *patch)
268
{
269
	patch->old_name = gitdiff_verify_name(line, patch->is_new, patch->old_name, "old");
270 271 272
	return 0;
}

273
static int gitdiff_newname(const char *line, struct patch *patch)
274
{
275
	patch->new_name = gitdiff_verify_name(line, patch->is_delete, patch->new_name, "new");
276 277 278
	return 0;
}

279
static int gitdiff_oldmode(const char *line, struct patch *patch)
280
{
281
	patch->old_mode = strtoul(line, NULL, 8);
282 283 284
	return 0;
}

285
static int gitdiff_newmode(const char *line, struct patch *patch)
286
{
287
	patch->new_mode = strtoul(line, NULL, 8);
288 289 290
	return 0;
}

291
static int gitdiff_delete(const char *line, struct patch *patch)
292
{
293
	patch->is_delete = 1;
294
	patch->old_name = patch->def_name;
295
	return gitdiff_oldmode(line, patch);
296 297
}

298
static int gitdiff_newfile(const char *line, struct patch *patch)
299
{
300
	patch->is_new = 1;
301
	patch->new_name = patch->def_name;
302
	return gitdiff_newmode(line, patch);
303 304
}

305
static int gitdiff_copysrc(const char *line, struct patch *patch)
306
{
307 308
	patch->is_copy = 1;
	patch->old_name = find_name(line, NULL, 0, 0);
309 310 311
	return 0;
}

312
static int gitdiff_copydst(const char *line, struct patch *patch)
313
{
314 315
	patch->is_copy = 1;
	patch->new_name = find_name(line, NULL, 0, 0);
316 317 318
	return 0;
}

319
static int gitdiff_renamesrc(const char *line, struct patch *patch)
320
{
321 322
	patch->is_rename = 1;
	patch->old_name = find_name(line, NULL, 0, 0);
323 324 325
	return 0;
}

326
static int gitdiff_renamedst(const char *line, struct patch *patch)
327
{
328 329
	patch->is_rename = 1;
	patch->new_name = find_name(line, NULL, 0, 0);
330 331 332
	return 0;
}

333
static int gitdiff_similarity(const char *line, struct patch *patch)
334
{
335 336
	if ((patch->score = strtoul(line, NULL, 10)) == ULONG_MAX)
		patch->score = 0;
337
	return 0;
L
Linus Torvalds 已提交
338 339
}

340 341
static int gitdiff_dissimilarity(const char *line, struct patch *patch)
{
342 343
	if ((patch->score = strtoul(line, NULL, 10)) == ULONG_MAX)
		patch->score = 0;
344 345 346
	return 0;
}

347 348 349 350
/*
 * This is normal for a diff that doesn't change anything: we'll fall through
 * into the next diff. Tell the parser to break out.
 */
351
static int gitdiff_unrecognized(const char *line, struct patch *patch)
352 353 354 355
{
	return -1;
}

356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399
static char *git_header_name(char *line)
{
	int len;
	char *name, *second;

	/*
	 * Find the first '/'
	 */
	name = line;
	for (;;) {
		char c = *name++;
		if (c == '\n')
			return NULL;
		if (c == '/')
			break;
	}

	/*
	 * We don't accept absolute paths (/dev/null) as possibly valid
	 */
	if (name == line+1)
		return NULL;

	/*
	 * Accept a name only if it shows up twice, exactly the same
	 * form.
	 */
	for (len = 0 ; ; len++) {
		char c = name[len];

		switch (c) {
		default:
			continue;
		case '\n':
			break;
		case '\t': case ' ':
			second = name+len;
			for (;;) {
				char c = *second++;
				if (c == '\n')
					return NULL;
				if (c == '/')
					break;
			}
400
			if (second[len] == '\n' && !memcmp(name, second, len)) {
401 402 403 404 405 406 407 408 409 410
				char *ret = xmalloc(len + 1);
				memcpy(ret, name, len);
				ret[len] = 0;
				return ret;
			}
		}
	}
	return NULL;
}

L
Linus Torvalds 已提交
411
/* Verify that we recognize the lines following a git header */
412
static int parse_git_header(char *line, int len, unsigned int size, struct patch *patch)
L
Linus Torvalds 已提交
413
{
414 415 416
	unsigned long offset;

	/* A git diff has explicit new/delete information, so we don't guess */
417 418
	patch->is_new = 0;
	patch->is_delete = 0;
419

420 421 422 423 424 425 426 427
	/*
	 * Some things may not have the old name in the
	 * rest of the headers anywhere (pure mode changes,
	 * or removing or adding empty files), so we get
	 * the default name from the header.
	 */
	patch->def_name = git_header_name(line + strlen("diff --git "));

428 429 430 431 432 433
	line += len;
	size -= len;
	linenr++;
	for (offset = len ; size > 0 ; offset += len, size -= len, line += len, linenr++) {
		static const struct opentry {
			const char *str;
434
			int (*fn)(const char *, struct patch *);
435 436 437 438 439 440 441 442 443 444
		} optable[] = {
			{ "@@ -", gitdiff_hdrend },
			{ "--- ", gitdiff_oldname },
			{ "+++ ", gitdiff_newname },
			{ "old mode ", gitdiff_oldmode },
			{ "new mode ", gitdiff_newmode },
			{ "deleted file mode ", gitdiff_delete },
			{ "new file mode ", gitdiff_newfile },
			{ "copy from ", gitdiff_copysrc },
			{ "copy to ", gitdiff_copydst },
445 446
			{ "rename old ", gitdiff_renamesrc },
			{ "rename new ", gitdiff_renamedst },
L
Linus Torvalds 已提交
447 448
			{ "rename from ", gitdiff_renamesrc },
			{ "rename to ", gitdiff_renamedst },
449
			{ "similarity index ", gitdiff_similarity },
450
			{ "dissimilarity index ", gitdiff_dissimilarity },
451
			{ "", gitdiff_unrecognized },
452 453
		};
		int i;
L
Linus Torvalds 已提交
454 455

		len = linelen(line, size);
456
		if (!len || line[len-1] != '\n')
L
Linus Torvalds 已提交
457
			break;
458 459 460 461 462
		for (i = 0; i < sizeof(optable) / sizeof(optable[0]); i++) {
			const struct opentry *p = optable + i;
			int oplen = strlen(p->str);
			if (len < oplen || memcmp(p->str, line, oplen))
				continue;
463
			if (p->fn(line + oplen, patch) < 0)
464
				return offset;
465
			break;
466
		}
L
Linus Torvalds 已提交
467 468
	}

469
	return offset;
L
Linus Torvalds 已提交
470 471
}

472
static int parse_num(const char *line, unsigned long *p)
473 474
{
	char *ptr;
475 476 477 478 479 480 481 482 483 484

	if (!isdigit(*line))
		return 0;
	*p = strtoul(line, &ptr, 10);
	return ptr - line;
}

static int parse_range(const char *line, int len, int offset, const char *expect,
			unsigned long *p1, unsigned long *p2)
{
485 486 487 488 489 490 491
	int digits, ex;

	if (offset < 0 || offset >= len)
		return -1;
	line += offset;
	len -= offset;

492 493
	digits = parse_num(line, p1);
	if (!digits)
494 495 496 497 498 499
		return -1;

	offset += digits;
	line += digits;
	len -= digits;

500 501 502 503 504 505 506 507 508 509 510
	*p2 = *p1;
	if (*line == ',') {
		digits = parse_num(line+1, p2);
		if (!digits)
			return -1;

		offset += digits+1;
		line += digits+1;
		len -= digits+1;
	}

511 512 513 514 515 516 517 518 519 520 521 522 523
	ex = strlen(expect);
	if (ex > len)
		return -1;
	if (memcmp(line, expect, ex))
		return -1;

	return offset + ex;
}

/*
 * Parse a unified diff fragment header of the
 * form "@@ -a,b +c,d @@"
 */
524
static int parse_fragment_header(char *line, int len, struct fragment *fragment)
525 526 527 528 529 530 531
{
	int offset;

	if (!len || line[len-1] != '\n')
		return -1;

	/* Figure out the number of lines in a fragment */
532 533
	offset = parse_range(line, len, 4, " +", &fragment->oldpos, &fragment->oldlines);
	offset = parse_range(line, len, offset, " @@", &fragment->newpos, &fragment->newlines);
534 535 536 537

	return offset;
}

538
static int find_header(char *line, unsigned long size, int *hdrsize, struct patch *patch)
L
Linus Torvalds 已提交
539 540 541
{
	unsigned long offset, len;

542 543 544 545
	patch->is_rename = patch->is_copy = 0;
	patch->is_new = patch->is_delete = -1;
	patch->old_mode = patch->new_mode = 0;
	patch->old_name = patch->new_name = NULL;
546
	for (offset = 0; size > 0; offset += len, size -= len, line += len, linenr++) {
L
Linus Torvalds 已提交
547 548 549 550 551 552 553 554 555
		unsigned long nextlen;

		len = linelen(line, size);
		if (!len)
			break;

		/* Testing this early allows us to take a few shortcuts.. */
		if (len < 6)
			continue;
556 557 558 559 560 561 562

		/*
		 * Make sure we don't find any unconnected patch fragmants.
		 * That's a sign that we didn't find a header, and that a
		 * patch has become corrupted/broken up.
		 */
		if (!memcmp("@@ -", line, 4)) {
563 564
			struct fragment dummy;
			if (parse_fragment_header(line, len, &dummy) < 0)
565 566 567 568
				continue;
			error("patch fragment without header at line %d: %.*s", linenr, len-1, line);
		}

L
Linus Torvalds 已提交
569 570 571 572 573 574 575 576
		if (size < len + 6)
			break;

		/*
		 * Git patch? It might not have a real patch, just a rename
		 * or mode change, so we handle that specially
		 */
		if (!memcmp("diff --git ", line, 11)) {
577
			int git_hdr_len = parse_git_header(line, len, size, patch);
578
			if (git_hdr_len <= len)
L
Linus Torvalds 已提交
579
				continue;
580 581 582 583 584
			if (!patch->old_name && !patch->new_name) {
				if (!patch->def_name)
					die("git diff header lacks filename information (line %d)", linenr);
				patch->old_name = patch->new_name = patch->def_name;
			}
585
			*hdrsize = git_hdr_len;
L
Linus Torvalds 已提交
586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602
			return offset;
		}

		/** --- followed by +++ ? */
		if (memcmp("--- ", line,  4) || memcmp("+++ ", line + len, 4))
			continue;

		/*
		 * We only accept unified patches, so we want it to
		 * at least have "@@ -a,b +c,d @@\n", which is 14 chars
		 * minimum
		 */
		nextlen = linelen(line + len, size - len);
		if (size < nextlen + 14 || memcmp("@@ -", line + len + nextlen, 4))
			continue;

		/* Ok, we'll consider it a patch */
603
		parse_traditional_patch(line, line+len, patch);
L
Linus Torvalds 已提交
604
		*hdrsize = len + nextlen;
605
		linenr += 2;
L
Linus Torvalds 已提交
606 607 608 609 610 611 612 613 614 615 616 617
		return offset;
	}
	return -1;
}

/*
 * Parse a unified diff. Note that this really needs
 * to parse each fragment separately, since the only
 * way to know the difference between a "---" that is
 * part of a patch, and a "---" that starts the next
 * patch is to look at the line counts..
 */
618
static int parse_fragment(char *line, unsigned long size, struct patch *patch, struct fragment *fragment)
L
Linus Torvalds 已提交
619
{
620
	int added, deleted;
L
Linus Torvalds 已提交
621
	int len = linelen(line, size), offset;
622
	unsigned long oldlines, newlines;
L
Linus Torvalds 已提交
623

624
	offset = parse_fragment_header(line, len, fragment);
L
Linus Torvalds 已提交
625 626
	if (offset < 0)
		return -1;
627 628
	oldlines = fragment->oldlines;
	newlines = fragment->newlines;
L
Linus Torvalds 已提交
629

630 631 632 633 634 635 636 637 638 639 640 641 642
	if (patch->is_new < 0) {
		patch->is_new =  !oldlines;
		if (!oldlines)
			patch->old_name = NULL;
	}
	if (patch->is_delete < 0) {
		patch->is_delete = !newlines;
		if (!newlines)
			patch->new_name = NULL;
	}

	if (patch->is_new != !oldlines)
		return error("new file depends on old contents");
643 644 645 646 647
	if (patch->is_delete != !newlines) {
		if (newlines)
			return error("deleted file still has contents");
		fprintf(stderr, "** warning: file %s becomes empty but is not deleted\n", patch->new_name);
	}
648

L
Linus Torvalds 已提交
649 650 651
	/* Parse the thing.. */
	line += len;
	size -= len;
652
	linenr++;
653
	added = deleted = 0;
654
	for (offset = len; size > 0; offset += len, size -= len, line += len, linenr++) {
L
Linus Torvalds 已提交
655 656 657 658 659 660 661 662 663 664 665 666 667
		if (!oldlines && !newlines)
			break;
		len = linelen(line, size);
		if (!len || line[len-1] != '\n')
			return -1;
		switch (*line) {
		default:
			return -1;
		case ' ':
			oldlines--;
			newlines--;
			break;
		case '-':
668
			deleted++;
L
Linus Torvalds 已提交
669 670 671
			oldlines--;
			break;
		case '+':
672
			added++;
L
Linus Torvalds 已提交
673 674
			newlines--;
			break;
675 676
		/* We allow "\ No newline at end of file" */
		case '\\':
677 678
			if (len < 12 || memcmp(line, "\\ No newline", 12))
				return -1;
679
			break;
L
Linus Torvalds 已提交
680 681
		}
	}
682 683 684 685 686 687 688
	/* If a fragment ends with an incomplete line, we failed to include
	 * it in the above loop because we hit oldlines == newlines == 0
	 * before seeing it.
	 */
	if (12 < size && !memcmp(line, "\\ No newline", 12))
		offset += linelen(line, size);

689 690
	patch->lines_added += added;
	patch->lines_deleted += deleted;
L
Linus Torvalds 已提交
691 692 693
	return offset;
}

694
static int parse_single_patch(char *line, unsigned long size, struct patch *patch)
L
Linus Torvalds 已提交
695 696
{
	unsigned long offset = 0;
697
	struct fragment **fragp = &patch->fragments;
L
Linus Torvalds 已提交
698 699

	while (size > 4 && !memcmp(line, "@@ -", 4)) {
700 701 702 703 704 705
		struct fragment *fragment;
		int len;

		fragment = xmalloc(sizeof(*fragment));
		memset(fragment, 0, sizeof(*fragment));
		len = parse_fragment(line, size, patch, fragment);
L
Linus Torvalds 已提交
706
		if (len <= 0)
707
			die("corrupt patch at line %d", linenr);
L
Linus Torvalds 已提交
708

709 710 711 712 713
		fragment->patch = line;
		fragment->size = len;

		*fragp = fragment;
		fragp = &fragment->next;
L
Linus Torvalds 已提交
714 715 716 717 718 719 720 721

		offset += len;
		line += len;
		size -= len;
	}
	return offset;
}

722
static int parse_chunk(char *buffer, unsigned long size, struct patch *patch)
L
Linus Torvalds 已提交
723 724
{
	int hdrsize, patchsize;
725
	int offset = find_header(buffer, size, &hdrsize, patch);
L
Linus Torvalds 已提交
726 727 728 729

	if (offset < 0)
		return offset;

730
	patchsize = parse_single_patch(buffer + offset + hdrsize, size - offset - hdrsize, patch);
L
Linus Torvalds 已提交
731 732 733 734

	return offset + hdrsize + patchsize;
}

L
Linus Torvalds 已提交
735 736
static const char pluses[] = "++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";
static const char minuses[]= "----------------------------------------------------------------------";
737 738 739

static void show_stats(struct patch *patch)
{
740
	const char *prefix = "";
741
	char *name = patch->new_name;
742
	int len, max, add, del, total;
743

744
	if (!name)
745
		name = patch->old_name;
746 747 748 749 750 751 752 753

	/*
	 * "scale" the filename
	 */
	len = strlen(name);
	max = max_len;
	if (max > 50)
		max = 50;
754 755 756 757
	if (len > max) {
		char *slash;
		prefix = "...";
		max -= 3;
758
		name += len - max;
759 760 761 762
		slash = strchr(name, '/');
		if (slash)
			name = slash;
	}
763 764 765 766 767 768 769 770
	len = max;

	/*
	 * scale the add/delete
	 */
	max = max_change;
	if (max + len > 70)
		max = 70 - len;
771 772 773 774 775

	add = patch->lines_added;
	del = patch->lines_deleted;
	total = add + del;

776 777 778 779 780
	if (max_change > 0) {
		total = (total * max + max_change / 2) / max_change;
		add = (add * max + max_change / 2) / max_change;
		del = total - add;
	}
781
	printf(" %s%-*s |%5d %.*s%.*s\n", prefix,
782 783 784 785
		len, name, patch->lines_added + patch->lines_deleted,
		add, pluses, del, minuses);
}

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 817 818 819
static int read_old_data(struct stat *st, const char *path, void *buf, unsigned long size)
{
	int fd;
	unsigned long got;

	switch (st->st_mode & S_IFMT) {
	case S_IFLNK:
		return readlink(path, buf, size);
	case S_IFREG:
		fd = open(path, O_RDONLY);
		if (fd < 0)
			return error("unable to open %s", path);
		got = 0;
		for (;;) {
			int ret = read(fd, buf + got, size - got);
			if (ret < 0) {
				if (errno == EAGAIN)
					continue;
				break;
			}
			if (!ret)
				break;
			got += ret;
		}
		close(fd);
		return got;

	default:
		return -1;
	}
}

static int find_offset(const char *buf, unsigned long size, const char *fragment, unsigned long fragsize, int line)
{
820 821
	int i;
	unsigned long start, backwards, forwards;
822 823 824 825 826 827 828

	if (fragsize > size)
		return -1;

	start = 0;
	if (line > 1) {
		unsigned long offset = 0;
829 830
		i = line-1;
		while (offset + fragsize <= size) {
831 832
			if (buf[offset++] == '\n') {
				start = offset;
833
				if (!--i)
834 835 836 837 838 839 840 841 842
					break;
			}
		}
	}

	/* Exact line number? */
	if (!memcmp(buf + start, fragment, fragsize))
		return start;

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
	/*
	 * There's probably some smart way to do this, but I'll leave
	 * that to the smart and beautiful people. I'm simple and stupid.
	 */
	backwards = start;
	forwards = start;
	for (i = 0; ; i++) {
		unsigned long try;
		int n;

		/* "backward" */
		if (i & 1) {
			if (!backwards) {
				if (forwards + fragsize > size)
					break;
				continue;
			}
			do {
				--backwards;
			} while (backwards && buf[backwards-1] != '\n');
			try = backwards;
		} else {
			while (forwards + fragsize <= size) {
				if (buf[forwards++] == '\n')
					break;
			}
			try = forwards;
		}

		if (try + fragsize > size)
			continue;
		if (memcmp(buf + try, fragment, fragsize))
			continue;
		n = (i >> 1)+1;
		if (i & 1)
			n = -n;
		return try;
	}

882 883 884 885 886 887
	/*
	 * We should start searching forward and backward.
	 */
	return -1;
}

888 889 890 891 892 893 894
struct buffer_desc {
	char *buffer;
	unsigned long size;
	unsigned long alloc;
};

static int apply_one_fragment(struct buffer_desc *desc, struct fragment *frag)
895
{
896
	char *buf = desc->buffer;
897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917
	const char *patch = frag->patch;
	int offset, size = frag->size;
	char *old = xmalloc(size);
	char *new = xmalloc(size);
	int oldsize = 0, newsize = 0;

	while (size > 0) {
		int len = linelen(patch, size);
		int plen;

		if (!len)
			break;

		/*
		 * "plen" is how much of the line we should use for
		 * the actual patch data. Normally we just remove the
		 * first character on the line, but if the line is
		 * followed by "\ No newline", then we also remove the
		 * last one (which is the newline, of course).
		 */
		plen = len-1;
918
		if (len < size && patch[len] == '\\')
919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941
			plen--;
		switch (*patch) {
		case ' ':
		case '-':
			memcpy(old + oldsize, patch + 1, plen);
			oldsize += plen;
			if (*patch == '-')
				break;
		/* Fall-through for ' ' */
		case '+':
			memcpy(new + newsize, patch + 1, plen);
			newsize += plen;
			break;
		case '@': case '\\':
			/* Ignore it, we already handled it */
			break;
		default:
			return -1;
		}
		patch += len;
		size -= len;
	}

942
	offset = find_offset(buf, desc->size, old, oldsize, frag->newpos);
943
	if (offset >= 0) {
944 945 946 947 948 949 950 951 952 953 954 955 956
		int diff = newsize - oldsize;
		unsigned long size = desc->size + diff;
		unsigned long alloc = desc->alloc;

		if (size > alloc) {
			alloc = size + 8192;
			desc->alloc = alloc;
			buf = xrealloc(buf, alloc);
			desc->buffer = buf;
		}
		desc->size = size;
		memmove(buf + offset + newsize, buf + offset + oldsize, size - offset - newsize);
		memcpy(buf + offset, new, newsize);
957 958 959 960 961 962 963 964
		offset = 0;
	}

	free(old);
	free(new);
	return offset;
}

965
static int apply_fragments(struct buffer_desc *desc, struct patch *patch)
966 967 968 969
{
	struct fragment *frag = patch->fragments;

	while (frag) {
970
		if (apply_one_fragment(desc, frag) < 0)
971 972 973
			return error("patch failed: %s:%d", patch->old_name, frag->oldpos);
		frag = frag->next;
	}
974
	return 0;
975 976 977 978
}

static int apply_data(struct patch *patch, struct stat *st)
{
979 980 981
	char *buf;
	unsigned long size, alloc;
	struct buffer_desc desc;
982

983 984 985 986 987 988 989 990 991 992
	size = 0;
	alloc = 0;
	buf = NULL;
	if (patch->old_name) {
		size = st->st_size;
		alloc = size + 8192;
		buf = xmalloc(alloc);
		if (read_old_data(st, patch->old_name, buf, alloc) != size)
			return error("read of %s failed", patch->old_name);
	}
993 994 995 996 997

	desc.size = size;
	desc.alloc = alloc;
	desc.buffer = buf;
	if (apply_fragments(&desc, patch) < 0)
998
		return -1;
999 1000
	patch->result = desc.buffer;
	patch->resultsize = desc.size;
1001 1002 1003 1004

	if (patch->is_delete && patch->resultsize)
		return error("removal patch leaves file contents");

1005 1006 1007
	return 0;
}

1008
static int check_patch(struct patch *patch)
1009
{
1010
	struct stat st;
1011 1012 1013 1014
	const char *old_name = patch->old_name;
	const char *new_name = patch->new_name;

	if (old_name) {
1015 1016 1017
		int changed;

		if (lstat(old_name, &st) < 0)
1018
			return error("%s: %s", old_name, strerror(errno));
1019 1020 1021 1022 1023 1024 1025 1026 1027 1028
		if (check_index) {
			int pos = cache_name_pos(old_name, strlen(old_name));
			if (pos < 0)
				return error("%s: does not exist in index", old_name);
			changed = ce_match_stat(active_cache[pos], &st);
			if (changed)
				return error("%s: does not match index", old_name);
		}
		if (patch->is_new < 0)
			patch->is_new = 0;
1029
		st.st_mode = ntohl(create_ce_mode(st.st_mode));
1030 1031
		if (!patch->old_mode)
			patch->old_mode = st.st_mode;
1032 1033 1034 1035 1036
		if ((st.st_mode ^ patch->old_mode) & S_IFMT)
			return error("%s: wrong type", old_name);
		if (st.st_mode != patch->old_mode)
			fprintf(stderr, "warning: %s has type %o, expected %o\n",
				old_name, st.st_mode, patch->old_mode);
1037
	}
1038

1039
	if (new_name && (patch->is_new | patch->is_rename | patch->is_copy)) {
1040
		if (check_index && cache_name_pos(new_name, strlen(new_name)) >= 0)
1041 1042 1043 1044 1045
			return error("%s: already exists in index", new_name);
		if (!lstat(new_name, &st))
			return error("%s: already exists in working directory", new_name);
		if (errno != ENOENT)
			return error("%s: %s", new_name, strerror(errno));
1046 1047
		if (!patch->new_mode)
			patch->new_mode = S_IFREG | 0644;
1048
	}
1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061

	if (new_name && old_name) {
		int same = !strcmp(old_name, new_name);
		if (!patch->new_mode)
			patch->new_mode = patch->old_mode;
		if ((patch->old_mode ^ patch->new_mode) & S_IFMT)
			return error("new mode (%o) of %s does not match old mode (%o)%s%s",
				patch->new_mode, new_name, patch->old_mode,
				same ? "" : " of ", same ? "" : old_name);
	}	

	if (apply_data(patch, &st) < 0)
		return error("%s: patch does not apply", old_name);
1062
	return 0;
1063 1064
}

1065
static int check_patch_list(struct patch *patch)
1066
{
1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077
	int error = 0;

	for (;patch ; patch = patch->next)
		error |= check_patch(patch);
	return error;
}

static void show_file(int c, unsigned int mode, const char *name)
{
	printf("%c %o %s\n", c, mode, name);
}
1078

1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097
static void show_file_list(struct patch *patch)
{
	for (;patch ; patch = patch->next) {
		if (patch->is_rename) {
			show_file('-', patch->old_mode, patch->old_name);
			show_file('+', patch->new_mode, patch->new_name);
			continue;
		}
		if (patch->is_copy || patch->is_new) {
			show_file('+', patch->new_mode, patch->new_name);
			continue;
		}
		if (patch->is_delete) {
			show_file('-', patch->old_mode, patch->old_name);
			continue;
		}
		if (patch->old_mode && patch->new_mode && patch->old_mode != patch->new_mode) {
			printf("M %o:%o %s\n", patch->old_mode, patch->new_mode, patch->old_name);
			continue;
1098
		}
1099 1100 1101
		printf("M %o %s\n", patch->old_mode, patch->old_name);
	}
}
1102

1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114
static void stat_patch_list(struct patch *patch)
{
	int files, adds, dels;

	for (files = adds = dels = 0 ; patch ; patch = patch->next) {
		files++;
		adds += patch->lines_added;
		dels += patch->lines_deleted;
		show_stats(patch);
	}

	printf(" %d files changed, %d insertions(+), %d deletions(-)\n", files, adds, dels);
1115 1116
}

1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161
static void show_file_mode_name(const char *newdelete, unsigned int mode, const char *name)
{
	if (mode)
		printf(" %s mode %06o %s\n", newdelete, mode, name);
	else
		printf(" %s %s\n", newdelete, name);
}

static void show_mode_change(struct patch *p, int show_name)
{
	if (p->old_mode && p->new_mode && p->old_mode != p->new_mode) {
		if (show_name)
			printf(" mode change %06o => %06o %s\n",
			       p->old_mode, p->new_mode, p->new_name);
		else
			printf(" mode change %06o => %06o\n",
			       p->old_mode, p->new_mode);
	}
}

static void show_rename_copy(struct patch *p)
{
	const char *renamecopy = p->is_rename ? "rename" : "copy";
	const char *old, *new;

	/* Find common prefix */
	old = p->old_name;
	new = p->new_name;
	while (1) {
		const char *slash_old, *slash_new;
		slash_old = strchr(old, '/');
		slash_new = strchr(new, '/');
		if (!slash_old ||
		    !slash_new ||
		    slash_old - old != slash_new - new ||
		    memcmp(old, new, slash_new - new))
			break;
		old = slash_old + 1;
		new = slash_new + 1;
	}
	/* p->old_name thru old is the common prefix, and old and new
	 * through the end of names are renames
	 */
	if (old != p->old_name)
		printf(" %s %.*s{%s => %s} (%d%%)\n", renamecopy,
1162
		       (int)(old - p->old_name), p->old_name,
1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194
		       old, new, p->score);
	else
		printf(" %s %s => %s (%d%%)\n", renamecopy,
		       p->old_name, p->new_name, p->score);
	show_mode_change(p, 0);
}

static void summary_patch_list(struct patch *patch)
{
	struct patch *p;

	for (p = patch; p; p = p->next) {
		if (p->is_new)
			show_file_mode_name("create", p->new_mode, p->new_name);
		else if (p->is_delete)
			show_file_mode_name("delete", p->old_mode, p->old_name);
		else {
			if (p->is_rename || p->is_copy)
				show_rename_copy(p);
			else {
				if (p->score) {
					printf(" rewrite %s (%d%%)\n",
					       p->new_name, p->score);
					show_mode_change(p, 0);
				}
				else
					show_mode_change(p, 1);
			}
		}
	}
}

1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210
static void patch_stats(struct patch *patch)
{
	int lines = patch->lines_added + patch->lines_deleted;

	if (lines > max_change)
		max_change = lines;
	if (patch->old_name) {
		int len = strlen(patch->old_name);
		if (len > max_len)
			max_len = len;
	}
	if (patch->new_name) {
		int len = strlen(patch->new_name);
		if (len > max_len)
			max_len = len;
	}
1211 1212
}

1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245
static void remove_file(struct patch *patch)
{
	if (write_index) {
		if (remove_file_from_cache(patch->old_name) < 0)
			die("unable to remove %s from index", patch->old_name);
	}
	unlink(patch->old_name);
}

static void add_index_file(const char *path, unsigned mode, void *buf, unsigned long size)
{
	struct stat st;
	struct cache_entry *ce;
	int namelen = strlen(path);
	unsigned ce_size = cache_entry_size(namelen);

	if (!write_index)
		return;

	ce = xmalloc(ce_size);
	memset(ce, 0, ce_size);
	memcpy(ce->name, path, namelen);
	ce->ce_mode = create_ce_mode(mode);
	ce->ce_flags = htons(namelen);
	if (lstat(path, &st) < 0)
		die("unable to stat newly created file %s", path);
	fill_stat_cache_info(ce, &st);
	if (write_sha1_file(buf, size, "blob", ce->sha1) < 0)
		die("unable to create backing store for newly created file %s", path);
	if (add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) < 0)
		die("unable to add cache entry for %s", path);
}

1246 1247 1248 1249 1250 1251 1252 1253 1254 1255
static void create_subdirectories(const char *path)
{
	int len = strlen(path);
	char *buf = xmalloc(len + 1);
	const char *slash = path;

	while ((slash = strchr(slash+1, '/')) != NULL) {
		len = slash - path;
		memcpy(buf, path, len);
		buf[len] = 0;
1256
		if (mkdir(buf, 0777) < 0) {
1257 1258 1259 1260 1261 1262 1263
			if (errno != EEXIST)
				break;
		}
	}
	free(buf);
}

1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289
static int try_create_file(const char *path, unsigned int mode, const char *buf, unsigned long size)
{
	int fd;

	if (S_ISLNK(mode))
		return symlink(buf, path);
	fd = open(path, O_CREAT | O_EXCL | O_WRONLY | O_TRUNC, (mode & 0100) ? 0777 : 0666);
	if (fd < 0)
		return -1;
	while (size) {
		int written = write(fd, buf, size);
		if (written < 0) {
			if (errno == EINTR || errno == EAGAIN)
				continue;
			die("writing file %s: %s", path, strerror(errno));
		}
		if (!written)
			die("out of space writing file %s", path);
		buf += written;
		size -= written;
	}
	if (close(fd) < 0)
		die("closing file %s: %s", path, strerror(errno));
	return 0;
}

1290 1291 1292 1293 1294
/*
 * We optimistically assume that the directories exist,
 * which is true 99% of the time anyway. If they don't,
 * we create them and try again.
 */
1295
static void create_one_file(const char *path, unsigned mode, const char *buf, unsigned long size)
1296
{
1297 1298
	if (!try_create_file(path, mode, buf, size))
		return;
1299

1300
	if (errno == ENOENT) {
1301
		create_subdirectories(path);
1302 1303
		if (!try_create_file(path, mode, buf, size))
			return;
1304 1305
	}

1306 1307
	if (errno == EEXIST) {
		unsigned int nr = getpid();
1308

1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320
		for (;;) {
			const char *newpath;
			newpath = mkpath("%s~%u", path, nr);
			if (!try_create_file(newpath, mode, buf, size)) {
				if (!rename(newpath, path))
					return;
				unlink(newpath);
				break;
			}
			if (errno != EEXIST)
				break;
		}			
1321
	}
1322
	die("unable to write file %s mode %o", path, mode);
1323 1324
}

1325 1326 1327 1328 1329 1330 1331 1332 1333
static void create_file(struct patch *patch)
{
	const char *path = patch->new_name;
	unsigned mode = patch->new_mode;
	unsigned long size = patch->resultsize;
	char *buf = patch->result;

	if (!mode)
		mode = S_IFREG | 0644;
1334 1335
	create_one_file(path, mode, buf, size);	
	add_index_file(path, mode, buf, size);
1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355
}

static void write_out_one_result(struct patch *patch)
{
	if (patch->is_delete > 0) {
		remove_file(patch);
		return;
	}
	if (patch->is_new > 0 || patch->is_copy) {
		create_file(patch);
		return;
	}
	/*
	 * Rename or modification boils down to the same
	 * thing: remove the old, write the new
	 */
	remove_file(patch);
	create_file(patch);
}

1356
static void write_out_results(struct patch *list, int skipped_patch)
1357
{
1358
	if (!list && !skipped_patch)
1359 1360
		die("No changes");

1361 1362 1363 1364 1365 1366 1367 1368
	while (list) {
		write_out_one_result(list);
		list = list->next;
	}
}

static struct cache_file cache_file;

1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385
static struct excludes {
	struct excludes *next;
	const char *path;
} *excludes;

static int use_patch(struct patch *p)
{
	const char *pathname = p->new_name ? : p->old_name;
	struct excludes *x = excludes;
	while (x) {
		if (fnmatch(x->path, pathname, 0) == 0)
			return 0;
		x = x->next;
	}
	return 1;
}

L
Linus Torvalds 已提交
1386 1387
static int apply_patch(int fd)
{
1388
	int newfd;
L
Linus Torvalds 已提交
1389 1390
	unsigned long offset, size;
	char *buffer = read_patch_file(fd, &size);
1391
	struct patch *list = NULL, **listp = &list;
1392
	int skipped_patch = 0;
L
Linus Torvalds 已提交
1393 1394 1395 1396 1397

	if (!buffer)
		return -1;
	offset = 0;
	while (size > 0) {
1398 1399 1400 1401 1402 1403
		struct patch *patch;
		int nr;

		patch = xmalloc(sizeof(*patch));
		memset(patch, 0, sizeof(*patch));
		nr = parse_chunk(buffer + offset, size, patch);
L
Linus Torvalds 已提交
1404 1405
		if (nr < 0)
			break;
1406 1407 1408 1409 1410 1411 1412 1413 1414
		if (use_patch(patch)) {
			patch_stats(patch);
			*listp = patch;
			listp = &patch->next;
		} else {
			/* perhaps free it a bit better? */
			free(patch);
			skipped_patch++;
		}
L
Linus Torvalds 已提交
1415 1416 1417
		offset += nr;
		size -= nr;
	}
1418

1419 1420 1421 1422 1423 1424 1425 1426 1427
	newfd = -1;
	write_index = check_index && apply;
	if (write_index)
		newfd = hold_index_file_for_update(&cache_file, get_index_file());
	if (check_index) {
		if (read_cache() < 0)
			die("unable to read index file");
	}

1428 1429 1430
	if ((check || apply) && check_patch_list(list) < 0)
		exit(1);

1431
	if (apply)
1432
		write_out_results(list, skipped_patch);
1433 1434 1435 1436 1437 1438 1439

	if (write_index) {
		if (write_cache(newfd, active_cache, active_nr) ||
		    commit_index_file(&cache_file))
			die("Unable to write new cachefile");
	}

1440 1441 1442 1443 1444
	if (show_files)
		show_file_list(list);

	if (diffstat)
		stat_patch_list(list);
1445

1446 1447 1448
	if (summary)
		summary_patch_list(list);

L
Linus Torvalds 已提交
1449 1450 1451 1452 1453 1454 1455
	free(buffer);
	return 0;
}

int main(int argc, char **argv)
{
	int i;
1456
	int read_stdin = 1;
L
Linus Torvalds 已提交
1457 1458 1459 1460 1461 1462 1463

	for (i = 1; i < argc; i++) {
		const char *arg = argv[i];
		int fd;

		if (!strcmp(arg, "-")) {
			apply_patch(0);
1464
			read_stdin = 0;
L
Linus Torvalds 已提交
1465 1466
			continue;
		}
1467 1468 1469 1470 1471 1472 1473
		if (!strncmp(arg, "--exclude=", 10)) {
			struct excludes *x = xmalloc(sizeof(*x));
			x->path = arg + 10;
			x->next = excludes;
			excludes = x;
			continue;
		}
1474
		/* NEEDSWORK: this does not do anything at this moment. */
L
Linus Torvalds 已提交
1475 1476 1477 1478
		if (!strcmp(arg, "--no-merge")) {
			merge_patch = 0;
			continue;
		}
1479
		if (!strcmp(arg, "--stat")) {
1480
			apply = 0;
1481 1482 1483
			diffstat = 1;
			continue;
		}
1484 1485 1486 1487 1488
		if (!strcmp(arg, "--summary")) {
			apply = 0;
			summary = 1;
			continue;
		}
1489 1490 1491 1492 1493
		if (!strcmp(arg, "--check")) {
			apply = 0;
			check = 1;
			continue;
		}
1494 1495 1496 1497
		if (!strcmp(arg, "--index")) {
			check_index = 1;
			continue;
		}
1498 1499 1500 1501
		if (!strcmp(arg, "--apply")) {
			apply = 1;
			continue;
		}
1502 1503 1504 1505
		if (!strcmp(arg, "--show-files")) {
			show_files = 1;
			continue;
		}
L
Linus Torvalds 已提交
1506 1507 1508
		fd = open(arg, O_RDONLY);
		if (fd < 0)
			usage(apply_usage);
1509
		read_stdin = 0;
L
Linus Torvalds 已提交
1510 1511 1512
		apply_patch(fd);
		close(fd);
	}
1513 1514
	if (read_stdin)
		apply_patch(0);
L
Linus Torvalds 已提交
1515 1516
	return 0;
}