![[tokkee]](http://tokkee.org/images/avatar.png){kind=avatar}
1 /*
2 * apply.c
3 *
4 * Copyright (C) Linus Torvalds, 2005
5 *
6 * This applies patches on top of some (arbitrary) version of the SCM.
7 *
8 */
9 #include "cache.h"
10 #include "cache-tree.h"
11 #include "quote.h"
12 #include "blob.h"
13 #include "delta.h"
14 #include "builtin.h"
15 #include "string-list.h"
16 #include "dir.h"
17 #include "parse-options.h"
19 /*
20 * --check turns on checking that the working tree matches the
21 * files that are being modified, but doesn't apply the patch
22 * --stat does just a diffstat, and doesn't actually apply
23 * --numstat does numeric diffstat, and doesn't actually apply
24 * --index-info shows the old and new index info for paths if available.
25 * --index updates the cache as well.
26 * --cached updates only the cache without ever touching the working tree.
27 */
28 static const char *prefix;
29 static int prefix_length = -1;
30 static int newfd = -1;
32 static int unidiff_zero;
33 static int p_value = 1;
34 static int p_value_known;
35 static int check_index;
36 static int update_index;
37 static int cached;
38 static int diffstat;
39 static int numstat;
40 static int summary;
41 static int check;
42 static int apply = 1;
43 static int apply_in_reverse;
44 static int apply_with_reject;
45 static int apply_verbosely;
46 static int no_add;
47 static const char *fake_ancestor;
48 static int line_termination = '\n';
49 static unsigned int p_context = UINT_MAX;
50 static const char * const apply_usage[] = {
51 "git apply [options] [<patch>...]",
52 NULL
53 };
55 static enum ws_error_action {
56 nowarn_ws_error,
57 warn_on_ws_error,
58 die_on_ws_error,
59 correct_ws_error,
60 } ws_error_action = warn_on_ws_error;
61 static int whitespace_error;
62 static int squelch_whitespace_errors = 5;
63 static int applied_after_fixing_ws;
65 static enum ws_ignore {
66 ignore_ws_none,
67 ignore_ws_change,
68 } ws_ignore_action = ignore_ws_none;
71 static const char *patch_input_file;
72 static const char *root;
73 static int root_len;
74 static int read_stdin = 1;
75 static int options;
77 static void parse_whitespace_option(const char *option)
78 {
79 if (!option) {
80 ws_error_action = warn_on_ws_error;
81 return;
82 }
83 if (!strcmp(option, "warn")) {
84 ws_error_action = warn_on_ws_error;
85 return;
86 }
87 if (!strcmp(option, "nowarn")) {
88 ws_error_action = nowarn_ws_error;
89 return;
90 }
91 if (!strcmp(option, "error")) {
92 ws_error_action = die_on_ws_error;
93 return;
94 }
95 if (!strcmp(option, "error-all")) {
96 ws_error_action = die_on_ws_error;
97 squelch_whitespace_errors = 0;
98 return;
99 }
100 if (!strcmp(option, "strip") || !strcmp(option, "fix")) {
101 ws_error_action = correct_ws_error;
102 return;
103 }
104 die("unrecognized whitespace option '%s'", option);
105 }
107 static void parse_ignorewhitespace_option(const char *option)
108 {
109 if (!option || !strcmp(option, "no") ||
110 !strcmp(option, "false") || !strcmp(option, "never") ||
111 !strcmp(option, "none")) {
112 ws_ignore_action = ignore_ws_none;
113 return;
114 }
115 if (!strcmp(option, "change")) {
116 ws_ignore_action = ignore_ws_change;
117 return;
118 }
119 die("unrecognized whitespace ignore option '%s'", option);
120 }
122 static void set_default_whitespace_mode(const char *whitespace_option)
123 {
124 if (!whitespace_option && !apply_default_whitespace)
125 ws_error_action = (apply ? warn_on_ws_error : nowarn_ws_error);
126 }
128 /*
129 * For "diff-stat" like behaviour, we keep track of the biggest change
130 * we've seen, and the longest filename. That allows us to do simple
131 * scaling.
132 */
133 static int max_change, max_len;
135 /*
136 * Various "current state", notably line numbers and what
137 * file (and how) we're patching right now.. The "is_xxxx"
138 * things are flags, where -1 means "don't know yet".
139 */
140 static int linenr = 1;
142 /*
143 * This represents one "hunk" from a patch, starting with
144 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The
145 * patch text is pointed at by patch, and its byte length
146 * is stored in size. leading and trailing are the number
147 * of context lines.
148 */
149 struct fragment {
150 unsigned long leading, trailing;
151 unsigned long oldpos, oldlines;
152 unsigned long newpos, newlines;
153 const char *patch;
154 int size;
155 int rejected;
156 int linenr;
157 struct fragment *next;
158 };
160 /*
161 * When dealing with a binary patch, we reuse "leading" field
162 * to store the type of the binary hunk, either deflated "delta"
163 * or deflated "literal".
164 */
165 #define binary_patch_method leading
166 #define BINARY_DELTA_DEFLATED 1
167 #define BINARY_LITERAL_DEFLATED 2
169 /*
170 * This represents a "patch" to a file, both metainfo changes
171 * such as creation/deletion, filemode and content changes represented
172 * as a series of fragments.
173 */
174 struct patch {
175 char *new_name, *old_name, *def_name;
176 unsigned int old_mode, new_mode;
177 int is_new, is_delete; /* -1 = unknown, 0 = false, 1 = true */
178 int rejected;
179 unsigned ws_rule;
180 unsigned long deflate_origlen;
181 int lines_added, lines_deleted;
182 int score;
183 unsigned int is_toplevel_relative:1;
184 unsigned int inaccurate_eof:1;
185 unsigned int is_binary:1;
186 unsigned int is_copy:1;
187 unsigned int is_rename:1;
188 unsigned int recount:1;
189 struct fragment *fragments;
190 char *result;
191 size_t resultsize;
192 char old_sha1_prefix[41];
193 char new_sha1_prefix[41];
194 struct patch *next;
195 };
197 /*
198 * A line in a file, len-bytes long (includes the terminating LF,
199 * except for an incomplete line at the end if the file ends with
200 * one), and its contents hashes to 'hash'.
201 */
202 struct line {
203 size_t len;
204 unsigned hash : 24;
205 unsigned flag : 8;
206 #define LINE_COMMON 1
207 };
209 /*
210 * This represents a "file", which is an array of "lines".
211 */
212 struct image {
213 char *buf;
214 size_t len;
215 size_t nr;
216 size_t alloc;
217 struct line *line_allocated;
218 struct line *line;
219 };
221 /*
222 * Records filenames that have been touched, in order to handle
223 * the case where more than one patches touch the same file.
224 */
226 static struct string_list fn_table;
228 static uint32_t hash_line(const char *cp, size_t len)
229 {
230 size_t i;
231 uint32_t h;
232 for (i = 0, h = 0; i < len; i++) {
233 if (!isspace(cp[i])) {
234 h = h * 3 + (cp[i] & 0xff);
235 }
236 }
237 return h;
238 }
240 /*
241 * Compare lines s1 of length n1 and s2 of length n2, ignoring
242 * whitespace difference. Returns 1 if they match, 0 otherwise
243 */
244 static int fuzzy_matchlines(const char *s1, size_t n1,
245 const char *s2, size_t n2)
246 {
247 const char *last1 = s1 + n1 - 1;
248 const char *last2 = s2 + n2 - 1;
249 int result = 0;
251 if (n1 < 0 || n2 < 0)
252 return 0;
254 /* ignore line endings */
255 while ((*last1 == '\r') || (*last1 == '\n'))
256 last1--;
257 while ((*last2 == '\r') || (*last2 == '\n'))
258 last2--;
260 /* skip leading whitespace */
261 while (isspace(*s1) && (s1 <= last1))
262 s1++;
263 while (isspace(*s2) && (s2 <= last2))
264 s2++;
265 /* early return if both lines are empty */
266 if ((s1 > last1) && (s2 > last2))
267 return 1;
268 while (!result) {
269 result = *s1++ - *s2++;
270 /*
271 * Skip whitespace inside. We check for whitespace on
272 * both buffers because we don't want "a b" to match
273 * "ab"
274 */
275 if (isspace(*s1) && isspace(*s2)) {
276 while (isspace(*s1) && s1 <= last1)
277 s1++;
278 while (isspace(*s2) && s2 <= last2)
279 s2++;
280 }
281 /*
282 * If we reached the end on one side only,
283 * lines don't match
284 */
285 if (
286 ((s2 > last2) && (s1 <= last1)) ||
287 ((s1 > last1) && (s2 <= last2)))
288 return 0;
289 if ((s1 > last1) && (s2 > last2))
290 break;
291 }
293 return !result;
294 }
296 static void add_line_info(struct image *img, const char *bol, size_t len, unsigned flag)
297 {
298 ALLOC_GROW(img->line_allocated, img->nr + 1, img->alloc);
299 img->line_allocated[img->nr].len = len;
300 img->line_allocated[img->nr].hash = hash_line(bol, len);
301 img->line_allocated[img->nr].flag = flag;
302 img->nr++;
303 }
305 static void prepare_image(struct image *image, char *buf, size_t len,
306 int prepare_linetable)
307 {
308 const char *cp, *ep;
310 memset(image, 0, sizeof(*image));
311 image->buf = buf;
312 image->len = len;
314 if (!prepare_linetable)
315 return;
317 ep = image->buf + image->len;
318 cp = image->buf;
319 while (cp < ep) {
320 const char *next;
321 for (next = cp; next < ep && *next != '\n'; next++)
322 ;
323 if (next < ep)
324 next++;
325 add_line_info(image, cp, next - cp, 0);
326 cp = next;
327 }
328 image->line = image->line_allocated;
329 }
331 static void clear_image(struct image *image)
332 {
333 free(image->buf);
334 image->buf = NULL;
335 image->len = 0;
336 }
338 static void say_patch_name(FILE *output, const char *pre,
339 struct patch *patch, const char *post)
340 {
341 fputs(pre, output);
342 if (patch->old_name && patch->new_name &&
343 strcmp(patch->old_name, patch->new_name)) {
344 quote_c_style(patch->old_name, NULL, output, 0);
345 fputs(" => ", output);
346 quote_c_style(patch->new_name, NULL, output, 0);
347 } else {
348 const char *n = patch->new_name;
349 if (!n)
350 n = patch->old_name;
351 quote_c_style(n, NULL, output, 0);
352 }
353 fputs(post, output);
354 }
356 #define CHUNKSIZE (8192)
357 #define SLOP (16)
359 static void read_patch_file(struct strbuf *sb, int fd)
360 {
361 if (strbuf_read(sb, fd, 0) < 0)
362 die_errno("git apply: failed to read");
364 /*
365 * Make sure that we have some slop in the buffer
366 * so that we can do speculative "memcmp" etc, and
367 * see to it that it is NUL-filled.
368 */
369 strbuf_grow(sb, SLOP);
370 memset(sb->buf + sb->len, 0, SLOP);
371 }
373 static unsigned long linelen(const char *buffer, unsigned long size)
374 {
375 unsigned long len = 0;
376 while (size--) {
377 len++;
378 if (*buffer++ == '\n')
379 break;
380 }
381 return len;
382 }
384 static int is_dev_null(const char *str)
385 {
386 return !memcmp("/dev/null", str, 9) && isspace(str[9]);
387 }
389 #define TERM_SPACE 1
390 #define TERM_TAB 2
392 static int name_terminate(const char *name, int namelen, int c, int terminate)
393 {
394 if (c == ' ' && !(terminate & TERM_SPACE))
395 return 0;
396 if (c == '\t' && !(terminate & TERM_TAB))
397 return 0;
399 return 1;
400 }
402 /* remove double slashes to make --index work with such filenames */
403 static char *squash_slash(char *name)
404 {
405 int i = 0, j = 0;
407 if (!name)
408 return NULL;
410 while (name[i]) {
411 if ((name[j++] = name[i++]) == '/')
412 while (name[i] == '/')
413 i++;
414 }
415 name[j] = '\0';
416 return name;
417 }
419 static char *find_name(const char *line, char *def, int p_value, int terminate)
420 {
421 int len;
422 const char *start = NULL;
424 if (p_value == 0)
425 start = line;
427 if (*line == '"') {
428 struct strbuf name = STRBUF_INIT;
430 /*
431 * Proposed "new-style" GNU patch/diff format; see
432 * http://marc.theaimsgroup.com/?l=git&m=112927316408690&w=2
433 */
434 if (!unquote_c_style(&name, line, NULL)) {
435 char *cp;
437 for (cp = name.buf; p_value; p_value--) {
438 cp = strchr(cp, '/');
439 if (!cp)
440 break;
441 cp++;
442 }
443 if (cp) {
444 /* name can later be freed, so we need
445 * to memmove, not just return cp
446 */
447 strbuf_remove(&name, 0, cp - name.buf);
448 free(def);
449 if (root)
450 strbuf_insert(&name, 0, root, root_len);
451 return squash_slash(strbuf_detach(&name, NULL));
452 }
453 }
454 strbuf_release(&name);
455 }
457 for (;;) {
458 char c = *line;
460 if (isspace(c)) {
461 if (c == '\n')
462 break;
463 if (name_terminate(start, line-start, c, terminate))
464 break;
465 }
466 line++;
467 if (c == '/' && !--p_value)
468 start = line;
469 }
470 if (!start)
471 return squash_slash(def);
472 len = line - start;
473 if (!len)
474 return squash_slash(def);
476 /*
477 * Generally we prefer the shorter name, especially
478 * if the other one is just a variation of that with
479 * something else tacked on to the end (ie "file.orig"
480 * or "file~").
481 */
482 if (def) {
483 int deflen = strlen(def);
484 if (deflen < len && !strncmp(start, def, deflen))
485 return squash_slash(def);
486 free(def);
487 }
489 if (root) {
490 char *ret = xmalloc(root_len + len + 1);
491 strcpy(ret, root);
492 memcpy(ret + root_len, start, len);
493 ret[root_len + len] = '\0';
494 return squash_slash(ret);
495 }
497 return squash_slash(xmemdupz(start, len));
498 }
500 static int count_slashes(const char *cp)
501 {
502 int cnt = 0;
503 char ch;
505 while ((ch = *cp++))
506 if (ch == '/')
507 cnt++;
508 return cnt;
509 }
511 /*
512 * Given the string after "--- " or "+++ ", guess the appropriate
513 * p_value for the given patch.
514 */
515 static int guess_p_value(const char *nameline)
516 {
517 char *name, *cp;
518 int val = -1;
520 if (is_dev_null(nameline))
521 return -1;
522 name = find_name(nameline, NULL, 0, TERM_SPACE | TERM_TAB);
523 if (!name)
524 return -1;
525 cp = strchr(name, '/');
526 if (!cp)
527 val = 0;
528 else if (prefix) {
529 /*
530 * Does it begin with "a/$our-prefix" and such? Then this is
531 * very likely to apply to our directory.
532 */
533 if (!strncmp(name, prefix, prefix_length))
534 val = count_slashes(prefix);
535 else {
536 cp++;
537 if (!strncmp(cp, prefix, prefix_length))
538 val = count_slashes(prefix) + 1;
539 }
540 }
541 free(name);
542 return val;
543 }
545 /*
546 * Does the ---/+++ line has the POSIX timestamp after the last HT?
547 * GNU diff puts epoch there to signal a creation/deletion event. Is
548 * this such a timestamp?
549 */
550 static int has_epoch_timestamp(const char *nameline)
551 {
552 /*
553 * We are only interested in epoch timestamp; any non-zero
554 * fraction cannot be one, hence "(\.0+)?" in the regexp below.
555 * For the same reason, the date must be either 1969-12-31 or
556 * 1970-01-01, and the seconds part must be "00".
557 */
558 const char stamp_regexp[] =
559 "^(1969-12-31|1970-01-01)"
560 " "
561 "[0-2][0-9]:[0-5][0-9]:00(\\.0+)?"
562 " "
563 "([-+][0-2][0-9][0-5][0-9])\n";
564 const char *timestamp = NULL, *cp;
565 static regex_t *stamp;
566 regmatch_t m[10];
567 int zoneoffset;
568 int hourminute;
569 int status;
571 for (cp = nameline; *cp != '\n'; cp++) {
572 if (*cp == '\t')
573 timestamp = cp + 1;
574 }
575 if (!timestamp)
576 return 0;
577 if (!stamp) {
578 stamp = xmalloc(sizeof(*stamp));
579 if (regcomp(stamp, stamp_regexp, REG_EXTENDED)) {
580 warning("Cannot prepare timestamp regexp %s",
581 stamp_regexp);
582 return 0;
583 }
584 }
586 status = regexec(stamp, timestamp, ARRAY_SIZE(m), m, 0);
587 if (status) {
588 if (status != REG_NOMATCH)
589 warning("regexec returned %d for input: %s",
590 status, timestamp);
591 return 0;
592 }
594 zoneoffset = strtol(timestamp + m[3].rm_so + 1, NULL, 10);
595 zoneoffset = (zoneoffset / 100) * 60 + (zoneoffset % 100);
596 if (timestamp[m[3].rm_so] == '-')
597 zoneoffset = -zoneoffset;
599 /*
600 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31
601 * (west of GMT) or 1970-01-01 (east of GMT)
602 */
603 if ((zoneoffset < 0 && memcmp(timestamp, "1969-12-31", 10)) ||
604 (0 <= zoneoffset && memcmp(timestamp, "1970-01-01", 10)))
605 return 0;
607 hourminute = (strtol(timestamp + 11, NULL, 10) * 60 +
608 strtol(timestamp + 14, NULL, 10) -
609 zoneoffset);
611 return ((zoneoffset < 0 && hourminute == 1440) ||
612 (0 <= zoneoffset && !hourminute));
613 }
615 /*
616 * Get the name etc info from the ---/+++ lines of a traditional patch header
617 *
618 * FIXME! The end-of-filename heuristics are kind of screwy. For existing
619 * files, we can happily check the index for a match, but for creating a
620 * new file we should try to match whatever "patch" does. I have no idea.
621 */
622 static void parse_traditional_patch(const char *first, const char *second, struct patch *patch)
623 {
624 char *name;
626 first += 4; /* skip "--- " */
627 second += 4; /* skip "+++ " */
628 if (!p_value_known) {
629 int p, q;
630 p = guess_p_value(first);
631 q = guess_p_value(second);
632 if (p < 0) p = q;
633 if (0 <= p && p == q) {
634 p_value = p;
635 p_value_known = 1;
636 }
637 }
638 if (is_dev_null(first)) {
639 patch->is_new = 1;
640 patch->is_delete = 0;
641 name = find_name(second, NULL, p_value, TERM_SPACE | TERM_TAB);
642 patch->new_name = name;
643 } else if (is_dev_null(second)) {
644 patch->is_new = 0;
645 patch->is_delete = 1;
646 name = find_name(first, NULL, p_value, TERM_SPACE | TERM_TAB);
647 patch->old_name = name;
648 } else {
649 name = find_name(first, NULL, p_value, TERM_SPACE | TERM_TAB);
650 name = find_name(second, name, p_value, TERM_SPACE | TERM_TAB);
651 if (has_epoch_timestamp(first)) {
652 patch->is_new = 1;
653 patch->is_delete = 0;
654 patch->new_name = name;
655 } else if (has_epoch_timestamp(second)) {
656 patch->is_new = 0;
657 patch->is_delete = 1;
658 patch->old_name = name;
659 } else {
660 patch->old_name = patch->new_name = name;
661 }
662 }
663 if (!name)
664 die("unable to find filename in patch at line %d", linenr);
665 }
667 static int gitdiff_hdrend(const char *line, struct patch *patch)
668 {
669 return -1;
670 }
672 /*
673 * We're anal about diff header consistency, to make
674 * sure that we don't end up having strange ambiguous
675 * patches floating around.
676 *
677 * As a result, gitdiff_{old|new}name() will check
678 * their names against any previous information, just
679 * to make sure..
680 */
681 static char *gitdiff_verify_name(const char *line, int isnull, char *orig_name, const char *oldnew)
682 {
683 if (!orig_name && !isnull)
684 return find_name(line, NULL, p_value, TERM_TAB);
686 if (orig_name) {
687 int len;
688 const char *name;
689 char *another;
690 name = orig_name;
691 len = strlen(name);
692 if (isnull)
693 die("git apply: bad git-diff - expected /dev/null, got %s on line %d", name, linenr);
694 another = find_name(line, NULL, p_value, TERM_TAB);
695 if (!another || memcmp(another, name, len + 1))
696 die("git apply: bad git-diff - inconsistent %s filename on line %d", oldnew, linenr);
697 free(another);
698 return orig_name;
699 }
700 else {
701 /* expect "/dev/null" */
702 if (memcmp("/dev/null", line, 9) || line[9] != '\n')
703 die("git apply: bad git-diff - expected /dev/null on line %d", linenr);
704 return NULL;
705 }
706 }
708 static int gitdiff_oldname(const char *line, struct patch *patch)
709 {
710 patch->old_name = gitdiff_verify_name(line, patch->is_new, patch->old_name, "old");
711 return 0;
712 }
714 static int gitdiff_newname(const char *line, struct patch *patch)
715 {
716 patch->new_name = gitdiff_verify_name(line, patch->is_delete, patch->new_name, "new");
717 return 0;
718 }
720 static int gitdiff_oldmode(const char *line, struct patch *patch)
721 {
722 patch->old_mode = strtoul(line, NULL, 8);
723 return 0;
724 }
726 static int gitdiff_newmode(const char *line, struct patch *patch)
727 {
728 patch->new_mode = strtoul(line, NULL, 8);
729 return 0;
730 }
732 static int gitdiff_delete(const char *line, struct patch *patch)
733 {
734 patch->is_delete = 1;
735 patch->old_name = patch->def_name;
736 return gitdiff_oldmode(line, patch);
737 }
739 static int gitdiff_newfile(const char *line, struct patch *patch)
740 {
741 patch->is_new = 1;
742 patch->new_name = patch->def_name;
743 return gitdiff_newmode(line, patch);
744 }
746 static int gitdiff_copysrc(const char *line, struct patch *patch)
747 {
748 patch->is_copy = 1;
749 patch->old_name = find_name(line, NULL, 0, 0);
750 return 0;
751 }
753 static int gitdiff_copydst(const char *line, struct patch *patch)
754 {
755 patch->is_copy = 1;
756 patch->new_name = find_name(line, NULL, 0, 0);
757 return 0;
758 }
760 static int gitdiff_renamesrc(const char *line, struct patch *patch)
761 {
762 patch->is_rename = 1;
763 patch->old_name = find_name(line, NULL, 0, 0);
764 return 0;
765 }
767 static int gitdiff_renamedst(const char *line, struct patch *patch)
768 {
769 patch->is_rename = 1;
770 patch->new_name = find_name(line, NULL, 0, 0);
771 return 0;
772 }
774 static int gitdiff_similarity(const char *line, struct patch *patch)
775 {
776 if ((patch->score = strtoul(line, NULL, 10)) == ULONG_MAX)
777 patch->score = 0;
778 return 0;
779 }
781 static int gitdiff_dissimilarity(const char *line, struct patch *patch)
782 {
783 if ((patch->score = strtoul(line, NULL, 10)) == ULONG_MAX)
784 patch->score = 0;
785 return 0;
786 }
788 static int gitdiff_index(const char *line, struct patch *patch)
789 {
790 /*
791 * index line is N hexadecimal, "..", N hexadecimal,
792 * and optional space with octal mode.
793 */
794 const char *ptr, *eol;
795 int len;
797 ptr = strchr(line, '.');
798 if (!ptr || ptr[1] != '.' || 40 < ptr - line)
799 return 0;
800 len = ptr - line;
801 memcpy(patch->old_sha1_prefix, line, len);
802 patch->old_sha1_prefix[len] = 0;
804 line = ptr + 2;
805 ptr = strchr(line, ' ');
806 eol = strchr(line, '\n');
808 if (!ptr || eol < ptr)
809 ptr = eol;
810 len = ptr - line;
812 if (40 < len)
813 return 0;
814 memcpy(patch->new_sha1_prefix, line, len);
815 patch->new_sha1_prefix[len] = 0;
816 if (*ptr == ' ')
817 patch->old_mode = strtoul(ptr+1, NULL, 8);
818 return 0;
819 }
821 /*
822 * This is normal for a diff that doesn't change anything: we'll fall through
823 * into the next diff. Tell the parser to break out.
824 */
825 static int gitdiff_unrecognized(const char *line, struct patch *patch)
826 {
827 return -1;
828 }
830 static const char *stop_at_slash(const char *line, int llen)
831 {
832 int nslash = p_value;
833 int i;
835 for (i = 0; i < llen; i++) {
836 int ch = line[i];
837 if (ch == '/' && --nslash <= 0)
838 return &line[i];
839 }
840 return NULL;
841 }
843 /*
844 * This is to extract the same name that appears on "diff --git"
845 * line. We do not find and return anything if it is a rename
846 * patch, and it is OK because we will find the name elsewhere.
847 * We need to reliably find name only when it is mode-change only,
848 * creation or deletion of an empty file. In any of these cases,
849 * both sides are the same name under a/ and b/ respectively.
850 */
851 static char *git_header_name(char *line, int llen)
852 {
853 const char *name;
854 const char *second = NULL;
855 size_t len;
857 line += strlen("diff --git ");
858 llen -= strlen("diff --git ");
860 if (*line == '"') {
861 const char *cp;
862 struct strbuf first = STRBUF_INIT;
863 struct strbuf sp = STRBUF_INIT;
865 if (unquote_c_style(&first, line, &second))
866 goto free_and_fail1;
868 /* advance to the first slash */
869 cp = stop_at_slash(first.buf, first.len);
870 /* we do not accept absolute paths */
871 if (!cp || cp == first.buf)
872 goto free_and_fail1;
873 strbuf_remove(&first, 0, cp + 1 - first.buf);
875 /*
876 * second points at one past closing dq of name.
877 * find the second name.
878 */
879 while ((second < line + llen) && isspace(*second))
880 second++;
882 if (line + llen <= second)
883 goto free_and_fail1;
884 if (*second == '"') {
885 if (unquote_c_style(&sp, second, NULL))
886 goto free_and_fail1;
887 cp = stop_at_slash(sp.buf, sp.len);
888 if (!cp || cp == sp.buf)
889 goto free_and_fail1;
890 /* They must match, otherwise ignore */
891 if (strcmp(cp + 1, first.buf))
892 goto free_and_fail1;
893 strbuf_release(&sp);
894 return strbuf_detach(&first, NULL);
895 }
897 /* unquoted second */
898 cp = stop_at_slash(second, line + llen - second);
899 if (!cp || cp == second)
900 goto free_and_fail1;
901 cp++;
902 if (line + llen - cp != first.len + 1 ||
903 memcmp(first.buf, cp, first.len))
904 goto free_and_fail1;
905 return strbuf_detach(&first, NULL);
907 free_and_fail1:
908 strbuf_release(&first);
909 strbuf_release(&sp);
910 return NULL;
911 }
913 /* unquoted first name */
914 name = stop_at_slash(line, llen);
915 if (!name || name == line)
916 return NULL;
917 name++;
919 /*
920 * since the first name is unquoted, a dq if exists must be
921 * the beginning of the second name.
922 */
923 for (second = name; second < line + llen; second++) {
924 if (*second == '"') {
925 struct strbuf sp = STRBUF_INIT;
926 const char *np;
928 if (unquote_c_style(&sp, second, NULL))
929 goto free_and_fail2;
931 np = stop_at_slash(sp.buf, sp.len);
932 if (!np || np == sp.buf)
933 goto free_and_fail2;
934 np++;
936 len = sp.buf + sp.len - np;
937 if (len < second - name &&
938 !strncmp(np, name, len) &&
939 isspace(name[len])) {
940 /* Good */
941 strbuf_remove(&sp, 0, np - sp.buf);
942 return strbuf_detach(&sp, NULL);
943 }
945 free_and_fail2:
946 strbuf_release(&sp);
947 return NULL;
948 }
949 }
951 /*
952 * Accept a name only if it shows up twice, exactly the same
953 * form.
954 */
955 for (len = 0 ; ; len++) {
956 switch (name[len]) {
957 default:
958 continue;
959 case '\n':
960 return NULL;
961 case '\t': case ' ':
962 second = name+len;
963 for (;;) {
964 char c = *second++;
965 if (c == '\n')
966 return NULL;
967 if (c == '/')
968 break;
969 }
970 if (second[len] == '\n' && !memcmp(name, second, len)) {
971 return xmemdupz(name, len);
972 }
973 }
974 }
975 }
977 /* Verify that we recognize the lines following a git header */
978 static int parse_git_header(char *line, int len, unsigned int size, struct patch *patch)
979 {
980 unsigned long offset;
982 /* A git diff has explicit new/delete information, so we don't guess */
983 patch->is_new = 0;
984 patch->is_delete = 0;
986 /*
987 * Some things may not have the old name in the
988 * rest of the headers anywhere (pure mode changes,
989 * or removing or adding empty files), so we get
990 * the default name from the header.
991 */
992 patch->def_name = git_header_name(line, len);
993 if (patch->def_name && root) {
994 char *s = xmalloc(root_len + strlen(patch->def_name) + 1);
995 strcpy(s, root);
996 strcpy(s + root_len, patch->def_name);
997 free(patch->def_name);
998 patch->def_name = s;
999 }
1001 line += len;
1002 size -= len;
1003 linenr++;
1004 for (offset = len ; size > 0 ; offset += len, size -= len, line += len, linenr++) {
1005 static const struct opentry {
1006 const char *str;
1007 int (*fn)(const char *, struct patch *);
1008 } optable[] = {
1009 { "@@ -", gitdiff_hdrend },
1010 { "--- ", gitdiff_oldname },
1011 { "+++ ", gitdiff_newname },
1012 { "old mode ", gitdiff_oldmode },
1013 { "new mode ", gitdiff_newmode },
1014 { "deleted file mode ", gitdiff_delete },
1015 { "new file mode ", gitdiff_newfile },
1016 { "copy from ", gitdiff_copysrc },
1017 { "copy to ", gitdiff_copydst },
1018 { "rename old ", gitdiff_renamesrc },
1019 { "rename new ", gitdiff_renamedst },
1020 { "rename from ", gitdiff_renamesrc },
1021 { "rename to ", gitdiff_renamedst },
1022 { "similarity index ", gitdiff_similarity },
1023 { "dissimilarity index ", gitdiff_dissimilarity },
1024 { "index ", gitdiff_index },
1025 { "", gitdiff_unrecognized },
1026 };
1027 int i;
1029 len = linelen(line, size);
1030 if (!len || line[len-1] != '\n')
1031 break;
1032 for (i = 0; i < ARRAY_SIZE(optable); i++) {
1033 const struct opentry *p = optable + i;
1034 int oplen = strlen(p->str);
1035 if (len < oplen || memcmp(p->str, line, oplen))
1036 continue;
1037 if (p->fn(line + oplen, patch) < 0)
1038 return offset;
1039 break;
1040 }
1041 }
1043 return offset;
1044 }
1046 static int parse_num(const char *line, unsigned long *p)
1047 {
1048 char *ptr;
1050 if (!isdigit(*line))
1051 return 0;
1052 *p = strtoul(line, &ptr, 10);
1053 return ptr - line;
1054 }
1056 static int parse_range(const char *line, int len, int offset, const char *expect,
1057 unsigned long *p1, unsigned long *p2)
1058 {
1059 int digits, ex;
1061 if (offset < 0 || offset >= len)
1062 return -1;
1063 line += offset;
1064 len -= offset;
1066 digits = parse_num(line, p1);
1067 if (!digits)
1068 return -1;
1070 offset += digits;
1071 line += digits;
1072 len -= digits;
1074 *p2 = 1;
1075 if (*line == ',') {
1076 digits = parse_num(line+1, p2);
1077 if (!digits)
1078 return -1;
1080 offset += digits+1;
1081 line += digits+1;
1082 len -= digits+1;
1083 }
1085 ex = strlen(expect);
1086 if (ex > len)
1087 return -1;
1088 if (memcmp(line, expect, ex))
1089 return -1;
1091 return offset + ex;
1092 }
1094 static void recount_diff(char *line, int size, struct fragment *fragment)
1095 {
1096 int oldlines = 0, newlines = 0, ret = 0;
1098 if (size < 1) {
1099 warning("recount: ignore empty hunk");
1100 return;
1101 }
1103 for (;;) {
1104 int len = linelen(line, size);
1105 size -= len;
1106 line += len;
1108 if (size < 1)
1109 break;
1111 switch (*line) {
1112 case ' ': case '\n':
1113 newlines++;
1114 /* fall through */
1115 case '-':
1116 oldlines++;
1117 continue;
1118 case '+':
1119 newlines++;
1120 continue;
1121 case '\\':
1122 continue;
1123 case '@':
1124 ret = size < 3 || prefixcmp(line, "@@ ");
1125 break;
1126 case 'd':
1127 ret = size < 5 || prefixcmp(line, "diff ");
1128 break;
1129 default:
1130 ret = -1;
1131 break;
1132 }
1133 if (ret) {
1134 warning("recount: unexpected line: %.*s",
1135 (int)linelen(line, size), line);
1136 return;
1137 }
1138 break;
1139 }
1140 fragment->oldlines = oldlines;
1141 fragment->newlines = newlines;
1142 }
1144 /*
1145 * Parse a unified diff fragment header of the
1146 * form "@@ -a,b +c,d @@"
1147 */
1148 static int parse_fragment_header(char *line, int len, struct fragment *fragment)
1149 {
1150 int offset;
1152 if (!len || line[len-1] != '\n')
1153 return -1;
1155 /* Figure out the number of lines in a fragment */
1156 offset = parse_range(line, len, 4, " +", &fragment->oldpos, &fragment->oldlines);
1157 offset = parse_range(line, len, offset, " @@", &fragment->newpos, &fragment->newlines);
1159 return offset;
1160 }
1162 static int find_header(char *line, unsigned long size, int *hdrsize, struct patch *patch)
1163 {
1164 unsigned long offset, len;
1166 patch->is_toplevel_relative = 0;
1167 patch->is_rename = patch->is_copy = 0;
1168 patch->is_new = patch->is_delete = -1;
1169 patch->old_mode = patch->new_mode = 0;
1170 patch->old_name = patch->new_name = NULL;
1171 for (offset = 0; size > 0; offset += len, size -= len, line += len, linenr++) {
1172 unsigned long nextlen;
1174 len = linelen(line, size);
1175 if (!len)
1176 break;
1178 /* Testing this early allows us to take a few shortcuts.. */
1179 if (len < 6)
1180 continue;
1182 /*
1183 * Make sure we don't find any unconnected patch fragments.
1184 * That's a sign that we didn't find a header, and that a
1185 * patch has become corrupted/broken up.
1186 */
1187 if (!memcmp("@@ -", line, 4)) {
1188 struct fragment dummy;
1189 if (parse_fragment_header(line, len, &dummy) < 0)
1190 continue;
1191 die("patch fragment without header at line %d: %.*s",
1192 linenr, (int)len-1, line);
1193 }
1195 if (size < len + 6)
1196 break;
1198 /*
1199 * Git patch? It might not have a real patch, just a rename
1200 * or mode change, so we handle that specially
1201 */
1202 if (!memcmp("diff --git ", line, 11)) {
1203 int git_hdr_len = parse_git_header(line, len, size, patch);
1204 if (git_hdr_len <= len)
1205 continue;
1206 if (!patch->old_name && !patch->new_name) {
1207 if (!patch->def_name)
1208 die("git diff header lacks filename information when removing "
1209 "%d leading pathname components (line %d)" , p_value, linenr);
1210 patch->old_name = patch->new_name = patch->def_name;
1211 }
1212 patch->is_toplevel_relative = 1;
1213 *hdrsize = git_hdr_len;
1214 return offset;
1215 }
1217 /* --- followed by +++ ? */
1218 if (memcmp("--- ", line, 4) || memcmp("+++ ", line + len, 4))
1219 continue;
1221 /*
1222 * We only accept unified patches, so we want it to
1223 * at least have "@@ -a,b +c,d @@\n", which is 14 chars
1224 * minimum ("@@ -0,0 +1 @@\n" is the shortest).
1225 */
1226 nextlen = linelen(line + len, size - len);
1227 if (size < nextlen + 14 || memcmp("@@ -", line + len + nextlen, 4))
1228 continue;
1230 /* Ok, we'll consider it a patch */
1231 parse_traditional_patch(line, line+len, patch);
1232 *hdrsize = len + nextlen;
1233 linenr += 2;
1234 return offset;
1235 }
1236 return -1;
1237 }
1239 static void record_ws_error(unsigned result, const char *line, int len, int linenr)
1240 {
1241 char *err;
1243 if (!result)
1244 return;
1246 whitespace_error++;
1247 if (squelch_whitespace_errors &&
1248 squelch_whitespace_errors < whitespace_error)
1249 return;
1251 err = whitespace_error_string(result);
1252 fprintf(stderr, "%s:%d: %s.\n%.*s\n",
1253 patch_input_file, linenr, err, len, line);
1254 free(err);
1255 }
1257 static void check_whitespace(const char *line, int len, unsigned ws_rule)
1258 {
1259 unsigned result = ws_check(line + 1, len - 1, ws_rule);
1261 record_ws_error(result, line + 1, len - 2, linenr);
1262 }
1264 /*
1265 * Parse a unified diff. Note that this really needs to parse each
1266 * fragment separately, since the only way to know the difference
1267 * between a "---" that is part of a patch, and a "---" that starts
1268 * the next patch is to look at the line counts..
1269 */
1270 static int parse_fragment(char *line, unsigned long size,
1271 struct patch *patch, struct fragment *fragment)
1272 {
1273 int added, deleted;
1274 int len = linelen(line, size), offset;
1275 unsigned long oldlines, newlines;
1276 unsigned long leading, trailing;
1278 offset = parse_fragment_header(line, len, fragment);
1279 if (offset < 0)
1280 return -1;
1281 if (offset > 0 && patch->recount)
1282 recount_diff(line + offset, size - offset, fragment);
1283 oldlines = fragment->oldlines;
1284 newlines = fragment->newlines;
1285 leading = 0;
1286 trailing = 0;
1288 /* Parse the thing.. */
1289 line += len;
1290 size -= len;
1291 linenr++;
1292 added = deleted = 0;
1293 for (offset = len;
1294 0 < size;
1295 offset += len, size -= len, line += len, linenr++) {
1296 if (!oldlines && !newlines)
1297 break;
1298 len = linelen(line, size);
1299 if (!len || line[len-1] != '\n')
1300 return -1;
1301 switch (*line) {
1302 default:
1303 return -1;
1304 case '\n': /* newer GNU diff, an empty context line */
1305 case ' ':
1306 oldlines--;
1307 newlines--;
1308 if (!deleted && !added)
1309 leading++;
1310 trailing++;
1311 break;
1312 case '-':
1313 if (apply_in_reverse &&
1314 ws_error_action != nowarn_ws_error)
1315 check_whitespace(line, len, patch->ws_rule);
1316 deleted++;
1317 oldlines--;
1318 trailing = 0;
1319 break;
1320 case '+':
1321 if (!apply_in_reverse &&
1322 ws_error_action != nowarn_ws_error)
1323 check_whitespace(line, len, patch->ws_rule);
1324 added++;
1325 newlines--;
1326 trailing = 0;
1327 break;
1329 /*
1330 * We allow "\ No newline at end of file". Depending
1331 * on locale settings when the patch was produced we
1332 * don't know what this line looks like. The only
1333 * thing we do know is that it begins with "\ ".
1334 * Checking for 12 is just for sanity check -- any
1335 * l10n of "\ No newline..." is at least that long.
1336 */
1337 case '\\':
1338 if (len < 12 || memcmp(line, "\\ ", 2))
1339 return -1;
1340 break;
1341 }
1342 }
1343 if (oldlines || newlines)
1344 return -1;
1345 fragment->leading = leading;
1346 fragment->trailing = trailing;
1348 /*
1349 * If a fragment ends with an incomplete line, we failed to include
1350 * it in the above loop because we hit oldlines == newlines == 0
1351 * before seeing it.
1352 */
1353 if (12 < size && !memcmp(line, "\\ ", 2))
1354 offset += linelen(line, size);
1356 patch->lines_added += added;
1357 patch->lines_deleted += deleted;
1359 if (0 < patch->is_new && oldlines)
1360 return error("new file depends on old contents");
1361 if (0 < patch->is_delete && newlines)
1362 return error("deleted file still has contents");
1363 return offset;
1364 }
1366 static int parse_single_patch(char *line, unsigned long size, struct patch *patch)
1367 {
1368 unsigned long offset = 0;
1369 unsigned long oldlines = 0, newlines = 0, context = 0;
1370 struct fragment **fragp = &patch->fragments;
1372 while (size > 4 && !memcmp(line, "@@ -", 4)) {
1373 struct fragment *fragment;
1374 int len;
1376 fragment = xcalloc(1, sizeof(*fragment));
1377 fragment->linenr = linenr;
1378 len = parse_fragment(line, size, patch, fragment);
1379 if (len <= 0)
1380 die("corrupt patch at line %d", linenr);
1381 fragment->patch = line;
1382 fragment->size = len;
1383 oldlines += fragment->oldlines;
1384 newlines += fragment->newlines;
1385 context += fragment->leading + fragment->trailing;
1387 *fragp = fragment;
1388 fragp = &fragment->next;
1390 offset += len;
1391 line += len;
1392 size -= len;
1393 }
1395 /*
1396 * If something was removed (i.e. we have old-lines) it cannot
1397 * be creation, and if something was added it cannot be
1398 * deletion. However, the reverse is not true; --unified=0
1399 * patches that only add are not necessarily creation even
1400 * though they do not have any old lines, and ones that only
1401 * delete are not necessarily deletion.
1402 *
1403 * Unfortunately, a real creation/deletion patch do _not_ have
1404 * any context line by definition, so we cannot safely tell it
1405 * apart with --unified=0 insanity. At least if the patch has
1406 * more than one hunk it is not creation or deletion.
1407 */
1408 if (patch->is_new < 0 &&
1409 (oldlines || (patch->fragments && patch->fragments->next)))
1410 patch->is_new = 0;
1411 if (patch->is_delete < 0 &&
1412 (newlines || (patch->fragments && patch->fragments->next)))
1413 patch->is_delete = 0;
1415 if (0 < patch->is_new && oldlines)
1416 die("new file %s depends on old contents", patch->new_name);
1417 if (0 < patch->is_delete && newlines)
1418 die("deleted file %s still has contents", patch->old_name);
1419 if (!patch->is_delete && !newlines && context)
1420 fprintf(stderr, "** warning: file %s becomes empty but "
1421 "is not deleted\n", patch->new_name);
1423 return offset;
1424 }
1426 static inline int metadata_changes(struct patch *patch)
1427 {
1428 return patch->is_rename > 0 ||
1429 patch->is_copy > 0 ||
1430 patch->is_new > 0 ||
1431 patch->is_delete ||
1432 (patch->old_mode && patch->new_mode &&
1433 patch->old_mode != patch->new_mode);
1434 }
1436 static char *inflate_it(const void *data, unsigned long size,
1437 unsigned long inflated_size)
1438 {
1439 z_stream stream;
1440 void *out;
1441 int st;
1443 memset(&stream, 0, sizeof(stream));
1445 stream.next_in = (unsigned char *)data;
1446 stream.avail_in = size;
1447 stream.next_out = out = xmalloc(inflated_size);
1448 stream.avail_out = inflated_size;
1449 git_inflate_init(&stream);
1450 st = git_inflate(&stream, Z_FINISH);
1451 git_inflate_end(&stream);
1452 if ((st != Z_STREAM_END) || stream.total_out != inflated_size) {
1453 free(out);
1454 return NULL;
1455 }
1456 return out;
1457 }
1459 static struct fragment *parse_binary_hunk(char **buf_p,
1460 unsigned long *sz_p,
1461 int *status_p,
1462 int *used_p)
1463 {
1464 /*
1465 * Expect a line that begins with binary patch method ("literal"
1466 * or "delta"), followed by the length of data before deflating.
1467 * a sequence of 'length-byte' followed by base-85 encoded data
1468 * should follow, terminated by a newline.
1469 *
1470 * Each 5-byte sequence of base-85 encodes up to 4 bytes,
1471 * and we would limit the patch line to 66 characters,
1472 * so one line can fit up to 13 groups that would decode
1473 * to 52 bytes max. The length byte 'A'-'Z' corresponds
1474 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.
1475 */
1476 int llen, used;
1477 unsigned long size = *sz_p;
1478 char *buffer = *buf_p;
1479 int patch_method;
1480 unsigned long origlen;
1481 char *data = NULL;
1482 int hunk_size = 0;
1483 struct fragment *frag;
1485 llen = linelen(buffer, size);
1486 used = llen;
1488 *status_p = 0;
1490 if (!prefixcmp(buffer, "delta ")) {
1491 patch_method = BINARY_DELTA_DEFLATED;
1492 origlen = strtoul(buffer + 6, NULL, 10);
1493 }
1494 else if (!prefixcmp(buffer, "literal ")) {
1495 patch_method = BINARY_LITERAL_DEFLATED;
1496 origlen = strtoul(buffer + 8, NULL, 10);
1497 }
1498 else
1499 return NULL;
1501 linenr++;
1502 buffer += llen;
1503 while (1) {
1504 int byte_length, max_byte_length, newsize;
1505 llen = linelen(buffer, size);
1506 used += llen;
1507 linenr++;
1508 if (llen == 1) {
1509 /* consume the blank line */
1510 buffer++;
1511 size--;
1512 break;
1513 }
1514 /*
1515 * Minimum line is "A00000\n" which is 7-byte long,
1516 * and the line length must be multiple of 5 plus 2.
1517 */
1518 if ((llen < 7) || (llen-2) % 5)
1519 goto corrupt;
1520 max_byte_length = (llen - 2) / 5 * 4;
1521 byte_length = *buffer;
1522 if ('A' <= byte_length && byte_length <= 'Z')
1523 byte_length = byte_length - 'A' + 1;
1524 else if ('a' <= byte_length && byte_length <= 'z')
1525 byte_length = byte_length - 'a' + 27;
1526 else
1527 goto corrupt;
1528 /* if the input length was not multiple of 4, we would
1529 * have filler at the end but the filler should never
1530 * exceed 3 bytes
1531 */
1532 if (max_byte_length < byte_length ||
1533 byte_length <= max_byte_length - 4)
1534 goto corrupt;
1535 newsize = hunk_size + byte_length;
1536 data = xrealloc(data, newsize);
1537 if (decode_85(data + hunk_size, buffer + 1, byte_length))
1538 goto corrupt;
1539 hunk_size = newsize;
1540 buffer += llen;
1541 size -= llen;
1542 }
1544 frag = xcalloc(1, sizeof(*frag));
1545 frag->patch = inflate_it(data, hunk_size, origlen);
1546 if (!frag->patch)
1547 goto corrupt;
1548 free(data);
1549 frag->size = origlen;
1550 *buf_p = buffer;
1551 *sz_p = size;
1552 *used_p = used;
1553 frag->binary_patch_method = patch_method;
1554 return frag;
1556 corrupt:
1557 free(data);
1558 *status_p = -1;
1559 error("corrupt binary patch at line %d: %.*s",
1560 linenr-1, llen-1, buffer);
1561 return NULL;
1562 }
1564 static int parse_binary(char *buffer, unsigned long size, struct patch *patch)
1565 {
1566 /*
1567 * We have read "GIT binary patch\n"; what follows is a line
1568 * that says the patch method (currently, either "literal" or
1569 * "delta") and the length of data before deflating; a
1570 * sequence of 'length-byte' followed by base-85 encoded data
1571 * follows.
1572 *
1573 * When a binary patch is reversible, there is another binary
1574 * hunk in the same format, starting with patch method (either
1575 * "literal" or "delta") with the length of data, and a sequence
1576 * of length-byte + base-85 encoded data, terminated with another
1577 * empty line. This data, when applied to the postimage, produces
1578 * the preimage.
1579 */
1580 struct fragment *forward;
1581 struct fragment *reverse;
1582 int status;
1583 int used, used_1;
1585 forward = parse_binary_hunk(&buffer, &size, &status, &used);
1586 if (!forward && !status)
1587 /* there has to be one hunk (forward hunk) */
1588 return error("unrecognized binary patch at line %d", linenr-1);
1589 if (status)
1590 /* otherwise we already gave an error message */
1591 return status;
1593 reverse = parse_binary_hunk(&buffer, &size, &status, &used_1);
1594 if (reverse)
1595 used += used_1;
1596 else if (status) {
1597 /*
1598 * Not having reverse hunk is not an error, but having
1599 * a corrupt reverse hunk is.
1600 */
1601 free((void*) forward->patch);
1602 free(forward);
1603 return status;
1604 }
1605 forward->next = reverse;
1606 patch->fragments = forward;
1607 patch->is_binary = 1;
1608 return used;
1609 }
1611 static int parse_chunk(char *buffer, unsigned long size, struct patch *patch)
1612 {
1613 int hdrsize, patchsize;
1614 int offset = find_header(buffer, size, &hdrsize, patch);
1616 if (offset < 0)
1617 return offset;
1619 patch->ws_rule = whitespace_rule(patch->new_name
1620 ? patch->new_name
1621 : patch->old_name);
1623 patchsize = parse_single_patch(buffer + offset + hdrsize,
1624 size - offset - hdrsize, patch);
1626 if (!patchsize) {
1627 static const char *binhdr[] = {
1628 "Binary files ",
1629 "Files ",
1630 NULL,
1631 };
1632 static const char git_binary[] = "GIT binary patch\n";
1633 int i;
1634 int hd = hdrsize + offset;
1635 unsigned long llen = linelen(buffer + hd, size - hd);
1637 if (llen == sizeof(git_binary) - 1 &&
1638 !memcmp(git_binary, buffer + hd, llen)) {
1639 int used;
1640 linenr++;
1641 used = parse_binary(buffer + hd + llen,
1642 size - hd - llen, patch);
1643 if (used)
1644 patchsize = used + llen;
1645 else
1646 patchsize = 0;
1647 }
1648 else if (!memcmp(" differ\n", buffer + hd + llen - 8, 8)) {
1649 for (i = 0; binhdr[i]; i++) {
1650 int len = strlen(binhdr[i]);
1651 if (len < size - hd &&
1652 !memcmp(binhdr[i], buffer + hd, len)) {
1653 linenr++;
1654 patch->is_binary = 1;
1655 patchsize = llen;
1656 break;
1657 }
1658 }
1659 }
1661 /* Empty patch cannot be applied if it is a text patch
1662 * without metadata change. A binary patch appears
1663 * empty to us here.
1664 */
1665 if ((apply || check) &&
1666 (!patch->is_binary && !metadata_changes(patch)))
1667 die("patch with only garbage at line %d", linenr);
1668 }
1670 return offset + hdrsize + patchsize;
1671 }
1673 #define swap(a,b) myswap((a),(b),sizeof(a))
1675 #define myswap(a, b, size) do { \
1676 unsigned char mytmp[size]; \
1677 memcpy(mytmp, &a, size); \
1678 memcpy(&a, &b, size); \
1679 memcpy(&b, mytmp, size); \
1680 } while (0)
1682 static void reverse_patches(struct patch *p)
1683 {
1684 for (; p; p = p->next) {
1685 struct fragment *frag = p->fragments;
1687 swap(p->new_name, p->old_name);
1688 swap(p->new_mode, p->old_mode);
1689 swap(p->is_new, p->is_delete);
1690 swap(p->lines_added, p->lines_deleted);
1691 swap(p->old_sha1_prefix, p->new_sha1_prefix);
1693 for (; frag; frag = frag->next) {
1694 swap(frag->newpos, frag->oldpos);
1695 swap(frag->newlines, frag->oldlines);
1696 }
1697 }
1698 }
1700 static const char pluses[] =
1701 "++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";
1702 static const char minuses[]=
1703 "----------------------------------------------------------------------";
1705 static void show_stats(struct patch *patch)
1706 {
1707 struct strbuf qname = STRBUF_INIT;
1708 char *cp = patch->new_name ? patch->new_name : patch->old_name;
1709 int max, add, del;
1711 quote_c_style(cp, &qname, NULL, 0);
1713 /*
1714 * "scale" the filename
1715 */
1716 max = max_len;
1717 if (max > 50)
1718 max = 50;
1720 if (qname.len > max) {
1721 cp = strchr(qname.buf + qname.len + 3 - max, '/');
1722 if (!cp)
1723 cp = qname.buf + qname.len + 3 - max;
1724 strbuf_splice(&qname, 0, cp - qname.buf, "...", 3);
1725 }
1727 if (patch->is_binary) {
1728 printf(" %-*s | Bin\n", max, qname.buf);
1729 strbuf_release(&qname);
1730 return;
1731 }
1733 printf(" %-*s |", max, qname.buf);
1734 strbuf_release(&qname);
1736 /*
1737 * scale the add/delete
1738 */
1739 max = max + max_change > 70 ? 70 - max : max_change;
1740 add = patch->lines_added;
1741 del = patch->lines_deleted;
1743 if (max_change > 0) {
1744 int total = ((add + del) * max + max_change / 2) / max_change;
1745 add = (add * max + max_change / 2) / max_change;
1746 del = total - add;
1747 }
1748 printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,
1749 add, pluses, del, minuses);
1750 }
1752 static int read_old_data(struct stat *st, const char *path, struct strbuf *buf)
1753 {
1754 switch (st->st_mode & S_IFMT) {
1755 case S_IFLNK:
1756 if (strbuf_readlink(buf, path, st->st_size) < 0)
1757 return error("unable to read symlink %s", path);
1758 return 0;
1759 case S_IFREG:
1760 if (strbuf_read_file(buf, path, st->st_size) != st->st_size)
1761 return error("unable to open or read %s", path);
1762 convert_to_git(path, buf->buf, buf->len, buf, 0);
1763 return 0;
1764 default:
1765 return -1;
1766 }
1767 }
1769 /*
1770 * Update the preimage, and the common lines in postimage,
1771 * from buffer buf of length len. If postlen is 0 the postimage
1772 * is updated in place, otherwise it's updated on a new buffer
1773 * of length postlen
1774 */
1776 static void update_pre_post_images(struct image *preimage,
1777 struct image *postimage,
1778 char *buf,
1779 size_t len, size_t postlen)
1780 {
1781 int i, ctx;
1782 char *new, *old, *fixed;
1783 struct image fixed_preimage;
1785 /*
1786 * Update the preimage with whitespace fixes. Note that we
1787 * are not losing preimage->buf -- apply_one_fragment() will
1788 * free "oldlines".
1789 */
1790 prepare_image(&fixed_preimage, buf, len, 1);
1791 assert(fixed_preimage.nr == preimage->nr);
1792 for (i = 0; i < preimage->nr; i++)
1793 fixed_preimage.line[i].flag = preimage->line[i].flag;
1794 free(preimage->line_allocated);
1795 *preimage = fixed_preimage;
1797 /*
1798 * Adjust the common context lines in postimage. This can be
1799 * done in-place when we are just doing whitespace fixing,
1800 * which does not make the string grow, but needs a new buffer
1801 * when ignoring whitespace causes the update, since in this case
1802 * we could have e.g. tabs converted to multiple spaces.
1803 * We trust the caller to tell us if the update can be done
1804 * in place (postlen==0) or not.
1805 */
1806 old = postimage->buf;
1807 if (postlen)
1808 new = postimage->buf = xmalloc(postlen);
1809 else
1810 new = old;
1811 fixed = preimage->buf;
1812 for (i = ctx = 0; i < postimage->nr; i++) {
1813 size_t len = postimage->line[i].len;
1814 if (!(postimage->line[i].flag & LINE_COMMON)) {
1815 /* an added line -- no counterparts in preimage */
1816 memmove(new, old, len);
1817 old += len;
1818 new += len;
1819 continue;
1820 }
1822 /* a common context -- skip it in the original postimage */
1823 old += len;
1825 /* and find the corresponding one in the fixed preimage */
1826 while (ctx < preimage->nr &&
1827 !(preimage->line[ctx].flag & LINE_COMMON)) {
1828 fixed += preimage->line[ctx].len;
1829 ctx++;
1830 }
1831 if (preimage->nr <= ctx)
1832 die("oops");
1834 /* and copy it in, while fixing the line length */
1835 len = preimage->line[ctx].len;
1836 memcpy(new, fixed, len);
1837 new += len;
1838 fixed += len;
1839 postimage->line[i].len = len;
1840 ctx++;
1841 }
1843 /* Fix the length of the whole thing */
1844 postimage->len = new - postimage->buf;
1845 }
1847 static int match_fragment(struct image *img,
1848 struct image *preimage,
1849 struct image *postimage,
1850 unsigned long try,
1851 int try_lno,
1852 unsigned ws_rule,
1853 int match_beginning, int match_end)
1854 {
1855 int i;
1856 char *fixed_buf, *buf, *orig, *target;
1858 if (preimage->nr + try_lno > img->nr)
1859 return 0;
1861 if (match_beginning && try_lno)
1862 return 0;
1864 if (match_end && preimage->nr + try_lno != img->nr)
1865 return 0;
1867 /* Quick hash check */
1868 for (i = 0; i < preimage->nr; i++)
1869 if (preimage->line[i].hash != img->line[try_lno + i].hash)
1870 return 0;
1872 /*
1873 * Do we have an exact match? If we were told to match
1874 * at the end, size must be exactly at try+fragsize,
1875 * otherwise try+fragsize must be still within the preimage,
1876 * and either case, the old piece should match the preimage
1877 * exactly.
1878 */
1879 if ((match_end
1880 ? (try + preimage->len == img->len)
1881 : (try + preimage->len <= img->len)) &&
1882 !memcmp(img->buf + try, preimage->buf, preimage->len))
1883 return 1;
1885 /*
1886 * No exact match. If we are ignoring whitespace, run a line-by-line
1887 * fuzzy matching. We collect all the line length information because
1888 * we need it to adjust whitespace if we match.
1889 */
1890 if (ws_ignore_action == ignore_ws_change) {
1891 size_t imgoff = 0;
1892 size_t preoff = 0;
1893 size_t postlen = postimage->len;
1894 for (i = 0; i < preimage->nr; i++) {
1895 size_t prelen = preimage->line[i].len;
1896 size_t imglen = img->line[try_lno+i].len;
1898 if (!fuzzy_matchlines(img->buf + try + imgoff, imglen,
1899 preimage->buf + preoff, prelen))
1900 return 0;
1901 if (preimage->line[i].flag & LINE_COMMON)
1902 postlen += imglen - prelen;
1903 imgoff += imglen;
1904 preoff += prelen;
1905 }
1907 /*
1908 * Ok, the preimage matches with whitespace fuzz.
1909 *
1910 * imgoff now holds the true length of the target that
1911 * matches the preimage. Update the preimage and
1912 * the common postimage context lines to use the same
1913 * whitespace as the target.
1914 */
1915 fixed_buf = xmalloc(imgoff);
1916 memcpy(fixed_buf, img->buf + try, imgoff);
1917 update_pre_post_images(preimage, postimage,
1918 fixed_buf, imgoff, postlen);
1919 return 1;
1920 }
1922 if (ws_error_action != correct_ws_error)
1923 return 0;
1925 /*
1926 * The hunk does not apply byte-by-byte, but the hash says
1927 * it might with whitespace fuzz. We haven't been asked to
1928 * ignore whitespace, we were asked to correct whitespace
1929 * errors, so let's try matching after whitespace correction.
1930 */
1931 fixed_buf = xmalloc(preimage->len + 1);
1932 buf = fixed_buf;
1933 orig = preimage->buf;
1934 target = img->buf + try;
1935 for (i = 0; i < preimage->nr; i++) {
1936 size_t fixlen; /* length after fixing the preimage */
1937 size_t oldlen = preimage->line[i].len;
1938 size_t tgtlen = img->line[try_lno + i].len;
1939 size_t tgtfixlen; /* length after fixing the target line */
1940 char tgtfixbuf[1024], *tgtfix;
1941 int match;
1943 /* Try fixing the line in the preimage */
1944 fixlen = ws_fix_copy(buf, orig, oldlen, ws_rule, NULL);
1946 /* Try fixing the line in the target */
1947 if (sizeof(tgtfixbuf) > tgtlen)
1948 tgtfix = tgtfixbuf;
1949 else
1950 tgtfix = xmalloc(tgtlen);
1951 tgtfixlen = ws_fix_copy(tgtfix, target, tgtlen, ws_rule, NULL);
1953 /*
1954 * If they match, either the preimage was based on
1955 * a version before our tree fixed whitespace breakage,
1956 * or we are lacking a whitespace-fix patch the tree
1957 * the preimage was based on already had (i.e. target
1958 * has whitespace breakage, the preimage doesn't).
1959 * In either case, we are fixing the whitespace breakages
1960 * so we might as well take the fix together with their
1961 * real change.
1962 */
1963 match = (tgtfixlen == fixlen && !memcmp(tgtfix, buf, fixlen));
1965 if (tgtfix != tgtfixbuf)
1966 free(tgtfix);
1967 if (!match)
1968 goto unmatch_exit;
1970 orig += oldlen;
1971 buf += fixlen;
1972 target += tgtlen;
1973 }
1975 /*
1976 * Yes, the preimage is based on an older version that still
1977 * has whitespace breakages unfixed, and fixing them makes the
1978 * hunk match. Update the context lines in the postimage.
1979 */
1980 update_pre_post_images(preimage, postimage,
1981 fixed_buf, buf - fixed_buf, 0);
1982 return 1;
1984 unmatch_exit:
1985 free(fixed_buf);
1986 return 0;
1987 }
1989 static int find_pos(struct image *img,
1990 struct image *preimage,
1991 struct image *postimage,
1992 int line,
1993 unsigned ws_rule,
1994 int match_beginning, int match_end)
1995 {
1996 int i;
1997 unsigned long backwards, forwards, try;
1998 int backwards_lno, forwards_lno, try_lno;
2000 /*
2001 * If match_beginning or match_end is specified, there is no
2002 * point starting from a wrong line that will never match and
2003 * wander around and wait for a match at the specified end.
2004 */
2005 if (match_beginning)
2006 line = 0;
2007 else if (match_end)
2008 line = img->nr - preimage->nr;
2010 /*
2011 * Because the comparison is unsigned, the following test
2012 * will also take care of a negative line number that can
2013 * result when match_end and preimage is larger than the target.
2014 */
2015 if ((size_t) line > img->nr)
2016 line = img->nr;
2018 try = 0;
2019 for (i = 0; i < line; i++)
2020 try += img->line[i].len;
2022 /*
2023 * There's probably some smart way to do this, but I'll leave
2024 * that to the smart and beautiful people. I'm simple and stupid.
2025 */
2026 backwards = try;
2027 backwards_lno = line;
2028 forwards = try;
2029 forwards_lno = line;
2030 try_lno = line;
2032 for (i = 0; ; i++) {
2033 if (match_fragment(img, preimage, postimage,
2034 try, try_lno, ws_rule,
2035 match_beginning, match_end))
2036 return try_lno;
2038 again:
2039 if (backwards_lno == 0 && forwards_lno == img->nr)
2040 break;
2042 if (i & 1) {
2043 if (backwards_lno == 0) {
2044 i++;
2045 goto again;
2046 }
2047 backwards_lno--;
2048 backwards -= img->line[backwards_lno].len;
2049 try = backwards;
2050 try_lno = backwards_lno;
2051 } else {
2052 if (forwards_lno == img->nr) {
2053 i++;
2054 goto again;
2055 }
2056 forwards += img->line[forwards_lno].len;
2057 forwards_lno++;
2058 try = forwards;
2059 try_lno = forwards_lno;
2060 }
2062 }
2063 return -1;
2064 }
2066 static void remove_first_line(struct image *img)
2067 {
2068 img->buf += img->line[0].len;
2069 img->len -= img->line[0].len;
2070 img->line++;
2071 img->nr--;
2072 }
2074 static void remove_last_line(struct image *img)
2075 {
2076 img->len -= img->line[--img->nr].len;
2077 }
2079 static void update_image(struct image *img,
2080 int applied_pos,
2081 struct image *preimage,
2082 struct image *postimage)
2083 {
2084 /*
2085 * remove the copy of preimage at offset in img
2086 * and replace it with postimage
2087 */
2088 int i, nr;
2089 size_t remove_count, insert_count, applied_at = 0;
2090 char *result;
2092 for (i = 0; i < applied_pos; i++)
2093 applied_at += img->line[i].len;
2095 remove_count = 0;
2096 for (i = 0; i < preimage->nr; i++)
2097 remove_count += img->line[applied_pos + i].len;
2098 insert_count = postimage->len;
2100 /* Adjust the contents */
2101 result = xmalloc(img->len + insert_count - remove_count + 1);
2102 memcpy(result, img->buf, applied_at);
2103 memcpy(result + applied_at, postimage->buf, postimage->len);
2104 memcpy(result + applied_at + postimage->len,
2105 img->buf + (applied_at + remove_count),
2106 img->len - (applied_at + remove_count));
2107 free(img->buf);
2108 img->buf = result;
2109 img->len += insert_count - remove_count;
2110 result[img->len] = '\0';
2112 /* Adjust the line table */
2113 nr = img->nr + postimage->nr - preimage->nr;
2114 if (preimage->nr < postimage->nr) {
2115 /*
2116 * NOTE: this knows that we never call remove_first_line()
2117 * on anything other than pre/post image.
2118 */
2119 img->line = xrealloc(img->line, nr * sizeof(*img->line));
2120 img->line_allocated = img->line;
2121 }
2122 if (preimage->nr != postimage->nr)
2123 memmove(img->line + applied_pos + postimage->nr,
2124 img->line + applied_pos + preimage->nr,
2125 (img->nr - (applied_pos + preimage->nr)) *
2126 sizeof(*img->line));
2127 memcpy(img->line + applied_pos,
2128 postimage->line,
2129 postimage->nr * sizeof(*img->line));
2130 img->nr = nr;
2131 }
2133 static int apply_one_fragment(struct image *img, struct fragment *frag,
2134 int inaccurate_eof, unsigned ws_rule)
2135 {
2136 int match_beginning, match_end;
2137 const char *patch = frag->patch;
2138 int size = frag->size;
2139 char *old, *new, *oldlines, *newlines;
2140 int new_blank_lines_at_end = 0;
2141 unsigned long leading, trailing;
2142 int pos, applied_pos;
2143 struct image preimage;
2144 struct image postimage;
2146 memset(&preimage, 0, sizeof(preimage));
2147 memset(&postimage, 0, sizeof(postimage));
2148 oldlines = xmalloc(size);
2149 newlines = xmalloc(size);
2151 old = oldlines;
2152 new = newlines;
2153 while (size > 0) {
2154 char first;
2155 int len = linelen(patch, size);
2156 int plen, added;
2157 int added_blank_line = 0;
2158 int is_blank_context = 0;
2160 if (!len)
2161 break;
2163 /*
2164 * "plen" is how much of the line we should use for
2165 * the actual patch data. Normally we just remove the
2166 * first character on the line, but if the line is
2167 * followed by "\ No newline", then we also remove the
2168 * last one (which is the newline, of course).
2169 */
2170 plen = len - 1;
2171 if (len < size && patch[len] == '\\')
2172 plen--;
2173 first = *patch;
2174 if (apply_in_reverse) {
2175 if (first == '-')
2176 first = '+';
2177 else if (first == '+')
2178 first = '-';
2179 }
2181 switch (first) {
2182 case '\n':
2183 /* Newer GNU diff, empty context line */
2184 if (plen < 0)
2185 /* ... followed by '\No newline'; nothing */
2186 break;
2187 *old++ = '\n';
2188 *new++ = '\n';
2189 add_line_info(&preimage, "\n", 1, LINE_COMMON);
2190 add_line_info(&postimage, "\n", 1, LINE_COMMON);
2191 is_blank_context = 1;
2192 break;
2193 case ' ':
2194 if (plen && (ws_rule & WS_BLANK_AT_EOF) &&
2195 ws_blank_line(patch + 1, plen, ws_rule))
2196 is_blank_context = 1;
2197 case '-':
2198 memcpy(old, patch + 1, plen);
2199 add_line_info(&preimage, old, plen,
2200 (first == ' ' ? LINE_COMMON : 0));
2201 old += plen;
2202 if (first == '-')
2203 break;
2204 /* Fall-through for ' ' */
2205 case '+':
2206 /* --no-add does not add new lines */
2207 if (first == '+' && no_add)
2208 break;
2210 if (first != '+' ||
2211 !whitespace_error ||
2212 ws_error_action != correct_ws_error) {
2213 memcpy(new, patch + 1, plen);
2214 added = plen;
2215 }
2216 else {
2217 added = ws_fix_copy(new, patch + 1, plen, ws_rule, &applied_after_fixing_ws);
2218 }
2219 add_line_info(&postimage, new, added,
2220 (first == '+' ? 0 : LINE_COMMON));
2221 new += added;
2222 if (first == '+' &&
2223 (ws_rule & WS_BLANK_AT_EOF) &&
2224 ws_blank_line(patch + 1, plen, ws_rule))
2225 added_blank_line = 1;
2226 break;
2227 case '@': case '\\':
2228 /* Ignore it, we already handled it */
2229 break;
2230 default:
2231 if (apply_verbosely)
2232 error("invalid start of line: '%c'", first);
2233 return -1;
2234 }
2235 if (added_blank_line)
2236 new_blank_lines_at_end++;
2237 else if (is_blank_context)
2238 ;
2239 else
2240 new_blank_lines_at_end = 0;
2241 patch += len;
2242 size -= len;
2243 }
2244 if (inaccurate_eof &&
2245 old > oldlines && old[-1] == '\n' &&
2246 new > newlines && new[-1] == '\n') {
2247 old--;
2248 new--;
2249 }
2251 leading = frag->leading;
2252 trailing = frag->trailing;
2254 /*
2255 * A hunk to change lines at the beginning would begin with
2256 * @@ -1,L +N,M @@
2257 * but we need to be careful. -U0 that inserts before the second
2258 * line also has this pattern.
2259 *
2260 * And a hunk to add to an empty file would begin with
2261 * @@ -0,0 +N,M @@
2262 *
2263 * In other words, a hunk that is (frag->oldpos <= 1) with or
2264 * without leading context must match at the beginning.
2265 */
2266 match_beginning = (!frag->oldpos ||
2267 (frag->oldpos == 1 && !unidiff_zero));
2269 /*
2270 * A hunk without trailing lines must match at the end.
2271 * However, we simply cannot tell if a hunk must match end
2272 * from the lack of trailing lines if the patch was generated
2273 * with unidiff without any context.
2274 */
2275 match_end = !unidiff_zero && !trailing;
2277 pos = frag->newpos ? (frag->newpos - 1) : 0;
2278 preimage.buf = oldlines;
2279 preimage.len = old - oldlines;
2280 postimage.buf = newlines;
2281 postimage.len = new - newlines;
2282 preimage.line = preimage.line_allocated;
2283 postimage.line = postimage.line_allocated;
2285 for (;;) {
2287 applied_pos = find_pos(img, &preimage, &postimage, pos,
2288 ws_rule, match_beginning, match_end);
2290 if (applied_pos >= 0)
2291 break;
2293 /* Am I at my context limits? */
2294 if ((leading <= p_context) && (trailing <= p_context))
2295 break;
2296 if (match_beginning || match_end) {
2297 match_beginning = match_end = 0;
2298 continue;
2299 }
2301 /*
2302 * Reduce the number of context lines; reduce both
2303 * leading and trailing if they are equal otherwise
2304 * just reduce the larger context.
2305 */
2306 if (leading >= trailing) {
2307 remove_first_line(&preimage);
2308 remove_first_line(&postimage);
2309 pos--;
2310 leading--;
2311 }
2312 if (trailing > leading) {
2313 remove_last_line(&preimage);
2314 remove_last_line(&postimage);
2315 trailing--;
2316 }
2317 }
2319 if (applied_pos >= 0) {
2320 if (new_blank_lines_at_end &&
2321 preimage.nr + applied_pos == img->nr &&
2322 (ws_rule & WS_BLANK_AT_EOF) &&
2323 ws_error_action != nowarn_ws_error) {
2324 record_ws_error(WS_BLANK_AT_EOF, "+", 1, frag->linenr);
2325 if (ws_error_action == correct_ws_error) {
2326 while (new_blank_lines_at_end--)
2327 remove_last_line(&postimage);
2328 }
2329 /*
2330 * We would want to prevent write_out_results()
2331 * from taking place in apply_patch() that follows
2332 * the callchain led us here, which is:
2333 * apply_patch->check_patch_list->check_patch->
2334 * apply_data->apply_fragments->apply_one_fragment
2335 */
2336 if (ws_error_action == die_on_ws_error)
2337 apply = 0;
2338 }
2340 /*
2341 * Warn if it was necessary to reduce the number
2342 * of context lines.
2343 */
2344 if ((leading != frag->leading) ||
2345 (trailing != frag->trailing))
2346 fprintf(stderr, "Context reduced to (%ld/%ld)"
2347 " to apply fragment at %d\n",
2348 leading, trailing, applied_pos+1);
2349 update_image(img, applied_pos, &preimage, &postimage);
2350 } else {
2351 if (apply_verbosely)
2352 error("while searching for:\n%.*s",
2353 (int)(old - oldlines), oldlines);
2354 }
2356 free(oldlines);
2357 free(newlines);
2358 free(preimage.line_allocated);
2359 free(postimage.line_allocated);
2361 return (applied_pos < 0);
2362 }
2364 static int apply_binary_fragment(struct image *img, struct patch *patch)
2365 {
2366 struct fragment *fragment = patch->fragments;
2367 unsigned long len;
2368 void *dst;
2370 /* Binary patch is irreversible without the optional second hunk */
2371 if (apply_in_reverse) {
2372 if (!fragment->next)
2373 return error("cannot reverse-apply a binary patch "
2374 "without the reverse hunk to '%s'",
2375 patch->new_name
2376 ? patch->new_name : patch->old_name);
2377 fragment = fragment->next;
2378 }
2379 switch (fragment->binary_patch_method) {
2380 case BINARY_DELTA_DEFLATED:
2381 dst = patch_delta(img->buf, img->len, fragment->patch,
2382 fragment->size, &len);
2383 if (!dst)
2384 return -1;
2385 clear_image(img);
2386 img->buf = dst;
2387 img->len = len;
2388 return 0;
2389 case BINARY_LITERAL_DEFLATED:
2390 clear_image(img);
2391 img->len = fragment->size;
2392 img->buf = xmalloc(img->len+1);
2393 memcpy(img->buf, fragment->patch, img->len);
2394 img->buf[img->len] = '\0';
2395 return 0;
2396 }
2397 return -1;
2398 }
2400 static int apply_binary(struct image *img, struct patch *patch)
2401 {
2402 const char *name = patch->old_name ? patch->old_name : patch->new_name;
2403 unsigned char sha1[20];
2405 /*
2406 * For safety, we require patch index line to contain
2407 * full 40-byte textual SHA1 for old and new, at least for now.
2408 */
2409 if (strlen(patch->old_sha1_prefix) != 40 ||
2410 strlen(patch->new_sha1_prefix) != 40 ||
2411 get_sha1_hex(patch->old_sha1_prefix, sha1) ||
2412 get_sha1_hex(patch->new_sha1_prefix, sha1))
2413 return error("cannot apply binary patch to '%s' "
2414 "without full index line", name);
2416 if (patch->old_name) {
2417 /*
2418 * See if the old one matches what the patch
2419 * applies to.
2420 */
2421 hash_sha1_file(img->buf, img->len, blob_type, sha1);
2422 if (strcmp(sha1_to_hex(sha1), patch->old_sha1_prefix))
2423 return error("the patch applies to '%s' (%s), "
2424 "which does not match the "
2425 "current contents.",
2426 name, sha1_to_hex(sha1));
2427 }
2428 else {
2429 /* Otherwise, the old one must be empty. */
2430 if (img->len)
2431 return error("the patch applies to an empty "
2432 "'%s' but it is not empty", name);
2433 }
2435 get_sha1_hex(patch->new_sha1_prefix, sha1);
2436 if (is_null_sha1(sha1)) {
2437 clear_image(img);
2438 return 0; /* deletion patch */
2439 }
2441 if (has_sha1_file(sha1)) {
2442 /* We already have the postimage */
2443 enum object_type type;
2444 unsigned long size;
2445 char *result;
2447 result = read_sha1_file(sha1, &type, &size);
2448 if (!result)
2449 return error("the necessary postimage %s for "
2450 "'%s' cannot be read",
2451 patch->new_sha1_prefix, name);
2452 clear_image(img);
2453 img->buf = result;
2454 img->len = size;
2455 } else {
2456 /*
2457 * We have verified buf matches the preimage;
2458 * apply the patch data to it, which is stored
2459 * in the patch->fragments->{patch,size}.
2460 */
2461 if (apply_binary_fragment(img, patch))
2462 return error("binary patch does not apply to '%s'",
2463 name);
2465 /* verify that the result matches */
2466 hash_sha1_file(img->buf, img->len, blob_type, sha1);
2467 if (strcmp(sha1_to_hex(sha1), patch->new_sha1_prefix))
2468 return error("binary patch to '%s' creates incorrect result (expecting %s, got %s)",
2469 name, patch->new_sha1_prefix, sha1_to_hex(sha1));
2470 }
2472 return 0;
2473 }
2475 static int apply_fragments(struct image *img, struct patch *patch)
2476 {
2477 struct fragment *frag = patch->fragments;
2478 const char *name = patch->old_name ? patch->old_name : patch->new_name;
2479 unsigned ws_rule = patch->ws_rule;
2480 unsigned inaccurate_eof = patch->inaccurate_eof;
2482 if (patch->is_binary)
2483 return apply_binary(img, patch);
2485 while (frag) {
2486 if (apply_one_fragment(img, frag, inaccurate_eof, ws_rule)) {
2487 error("patch failed: %s:%ld", name, frag->oldpos);
2488 if (!apply_with_reject)
2489 return -1;
2490 frag->rejected = 1;
2491 }
2492 frag = frag->next;
2493 }
2494 return 0;
2495 }
2497 static int read_file_or_gitlink(struct cache_entry *ce, struct strbuf *buf)
2498 {
2499 if (!ce)
2500 return 0;
2502 if (S_ISGITLINK(ce->ce_mode)) {
2503 strbuf_grow(buf, 100);
2504 strbuf_addf(buf, "Subproject commit %s\n", sha1_to_hex(ce->sha1));
2505 } else {
2506 enum object_type type;
2507 unsigned long sz;
2508 char *result;
2510 result = read_sha1_file(ce->sha1, &type, &sz);
2511 if (!result)
2512 return -1;
2513 /* XXX read_sha1_file NUL-terminates */
2514 strbuf_attach(buf, result, sz, sz + 1);
2515 }
2516 return 0;
2517 }
2519 static struct patch *in_fn_table(const char *name)
2520 {
2521 struct string_list_item *item;
2523 if (name == NULL)
2524 return NULL;
2526 item = string_list_lookup(name, &fn_table);
2527 if (item != NULL)
2528 return (struct patch *)item->util;
2530 return NULL;
2531 }
2533 /*
2534 * item->util in the filename table records the status of the path.
2535 * Usually it points at a patch (whose result records the contents
2536 * of it after applying it), but it could be PATH_WAS_DELETED for a
2537 * path that a previously applied patch has already removed.
2538 */
2539 #define PATH_TO_BE_DELETED ((struct patch *) -2)
2540 #define PATH_WAS_DELETED ((struct patch *) -1)
2542 static int to_be_deleted(struct patch *patch)
2543 {
2544 return patch == PATH_TO_BE_DELETED;
2545 }
2547 static int was_deleted(struct patch *patch)
2548 {
2549 return patch == PATH_WAS_DELETED;
2550 }
2552 static void add_to_fn_table(struct patch *patch)
2553 {
2554 struct string_list_item *item;
2556 /*
2557 * Always add new_name unless patch is a deletion
2558 * This should cover the cases for normal diffs,
2559 * file creations and copies
2560 */
2561 if (patch->new_name != NULL) {
2562 item = string_list_insert(patch->new_name, &fn_table);
2563 item->util = patch;
2564 }
2566 /*
2567 * store a failure on rename/deletion cases because
2568 * later chunks shouldn't patch old names
2569 */
2570 if ((patch->new_name == NULL) || (patch->is_rename)) {
2571 item = string_list_insert(patch->old_name, &fn_table);
2572 item->util = PATH_WAS_DELETED;
2573 }
2574 }
2576 static void prepare_fn_table(struct patch *patch)
2577 {
2578 /*
2579 * store information about incoming file deletion
2580 */
2581 while (patch) {
2582 if ((patch->new_name == NULL) || (patch->is_rename)) {
2583 struct string_list_item *item;
2584 item = string_list_insert(patch->old_name, &fn_table);
2585 item->util = PATH_TO_BE_DELETED;
2586 }
2587 patch = patch->next;
2588 }
2589 }
2591 static int apply_data(struct patch *patch, struct stat *st, struct cache_entry *ce)
2592 {
2593 struct strbuf buf = STRBUF_INIT;
2594 struct image image;
2595 size_t len;
2596 char *img;
2597 struct patch *tpatch;
2599 if (!(patch->is_copy || patch->is_rename) &&
2600 (tpatch = in_fn_table(patch->old_name)) != NULL && !to_be_deleted(tpatch)) {
2601 if (was_deleted(tpatch)) {
2602 return error("patch %s has been renamed/deleted",
2603 patch->old_name);
2604 }
2605 /* We have a patched copy in memory use that */
2606 strbuf_add(&buf, tpatch->result, tpatch->resultsize);
2607 } else if (cached) {
2608 if (read_file_or_gitlink(ce, &buf))
2609 return error("read of %s failed", patch->old_name);
2610 } else if (patch->old_name) {
2611 if (S_ISGITLINK(patch->old_mode)) {
2612 if (ce) {
2613 read_file_or_gitlink(ce, &buf);
2614 } else {
2615 /*
2616 * There is no way to apply subproject
2617 * patch without looking at the index.
2618 */
2619 patch->fragments = NULL;
2620 }
2621 } else {
2622 if (read_old_data(st, patch->old_name, &buf))
2623 return error("read of %s failed", patch->old_name);
2624 }
2625 }
2627 img = strbuf_detach(&buf, &len);
2628 prepare_image(&image, img, len, !patch->is_binary);
2630 if (apply_fragments(&image, patch) < 0)
2631 return -1; /* note with --reject this succeeds. */
2632 patch->result = image.buf;
2633 patch->resultsize = image.len;
2634 add_to_fn_table(patch);
2635 free(image.line_allocated);
2637 if (0 < patch->is_delete && patch->resultsize)
2638 return error("removal patch leaves file contents");
2640 return 0;
2641 }
2643 static int check_to_create_blob(const char *new_name, int ok_if_exists)
2644 {
2645 struct stat nst;
2646 if (!lstat(new_name, &nst)) {
2647 if (S_ISDIR(nst.st_mode) || ok_if_exists)
2648 return 0;
2649 /*
2650 * A leading component of new_name might be a symlink
2651 * that is going to be removed with this patch, but
2652 * still pointing at somewhere that has the path.
2653 * In such a case, path "new_name" does not exist as
2654 * far as git is concerned.
2655 */
2656 if (has_symlink_leading_path(new_name, strlen(new_name)))
2657 return 0;
2659 return error("%s: already exists in working directory", new_name);
2660 }
2661 else if ((errno != ENOENT) && (errno != ENOTDIR))
2662 return error("%s: %s", new_name, strerror(errno));
2663 return 0;
2664 }
2666 static int verify_index_match(struct cache_entry *ce, struct stat *st)
2667 {
2668 if (S_ISGITLINK(ce->ce_mode)) {
2669 if (!S_ISDIR(st->st_mode))
2670 return -1;
2671 return 0;
2672 }
2673 return ce_match_stat(ce, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);
2674 }
2676 static int check_preimage(struct patch *patch, struct cache_entry **ce, struct stat *st)
2677 {
2678 const char *old_name = patch->old_name;
2679 struct patch *tpatch = NULL;
2680 int stat_ret = 0;
2681 unsigned st_mode = 0;
2683 /*
2684 * Make sure that we do not have local modifications from the
2685 * index when we are looking at the index. Also make sure
2686 * we have the preimage file to be patched in the work tree,
2687 * unless --cached, which tells git to apply only in the index.
2688 */
2689 if (!old_name)
2690 return 0;
2692 assert(patch->is_new <= 0);
2694 if (!(patch->is_copy || patch->is_rename) &&
2695 (tpatch = in_fn_table(old_name)) != NULL && !to_be_deleted(tpatch)) {
2696 if (was_deleted(tpatch))
2697 return error("%s: has been deleted/renamed", old_name);
2698 st_mode = tpatch->new_mode;
2699 } else if (!cached) {
2700 stat_ret = lstat(old_name, st);
2701 if (stat_ret && errno != ENOENT)
2702 return error("%s: %s", old_name, strerror(errno));
2703 }
2705 if (to_be_deleted(tpatch))
2706 tpatch = NULL;
2708 if (check_index && !tpatch) {
2709 int pos = cache_name_pos(old_name, strlen(old_name));
2710 if (pos < 0) {
2711 if (patch->is_new < 0)
2712 goto is_new;
2713 return error("%s: does not exist in index", old_name);
2714 }
2715 *ce = active_cache[pos];
2716 if (stat_ret < 0) {
2717 struct checkout costate;
2718 /* checkout */
2719 costate.base_dir = "";
2720 costate.base_dir_len = 0;
2721 costate.force = 0;
2722 costate.quiet = 0;
2723 costate.not_new = 0;
2724 costate.refresh_cache = 1;
2725 if (checkout_entry(*ce, &costate, NULL) ||
2726 lstat(old_name, st))
2727 return -1;
2728 }
2729 if (!cached && verify_index_match(*ce, st))
2730 return error("%s: does not match index", old_name);
2731 if (cached)
2732 st_mode = (*ce)->ce_mode;
2733 } else if (stat_ret < 0) {
2734 if (patch->is_new < 0)
2735 goto is_new;
2736 return error("%s: %s", old_name, strerror(errno));
2737 }
2739 if (!cached && !tpatch)
2740 st_mode = ce_mode_from_stat(*ce, st->st_mode);
2742 if (patch->is_new < 0)
2743 patch->is_new = 0;
2744 if (!patch->old_mode)
2745 patch->old_mode = st_mode;
2746 if ((st_mode ^ patch->old_mode) & S_IFMT)
2747 return error("%s: wrong type", old_name);
2748 if (st_mode != patch->old_mode)
2749 warning("%s has type %o, expected %o",
2750 old_name, st_mode, patch->old_mode);
2751 if (!patch->new_mode && !patch->is_delete)
2752 patch->new_mode = st_mode;
2753 return 0;
2755 is_new:
2756 patch->is_new = 1;
2757 patch->is_delete = 0;
2758 patch->old_name = NULL;
2759 return 0;
2760 }
2762 static int check_patch(struct patch *patch)
2763 {
2764 struct stat st;
2765 const char *old_name = patch->old_name;
2766 const char *new_name = patch->new_name;
2767 const char *name = old_name ? old_name : new_name;
2768 struct cache_entry *ce = NULL;
2769 struct patch *tpatch;
2770 int ok_if_exists;
2771 int status;
2773 patch->rejected = 1; /* we will drop this after we succeed */
2775 status = check_preimage(patch, &ce, &st);
2776 if (status)
2777 return status;
2778 old_name = patch->old_name;
2780 if ((tpatch = in_fn_table(new_name)) &&
2781 (was_deleted(tpatch) || to_be_deleted(tpatch)))
2782 /*
2783 * A type-change diff is always split into a patch to
2784 * delete old, immediately followed by a patch to
2785 * create new (see diff.c::run_diff()); in such a case
2786 * it is Ok that the entry to be deleted by the
2787 * previous patch is still in the working tree and in
2788 * the index.
2789 */
2790 ok_if_exists = 1;
2791 else
2792 ok_if_exists = 0;
2794 if (new_name &&
2795 ((0 < patch->is_new) | (0 < patch->is_rename) | patch->is_copy)) {
2796 if (check_index &&
2797 cache_name_pos(new_name, strlen(new_name)) >= 0 &&
2798 !ok_if_exists)
2799 return error("%s: already exists in index", new_name);
2800 if (!cached) {
2801 int err = check_to_create_blob(new_name, ok_if_exists);
2802 if (err)
2803 return err;
2804 }
2805 if (!patch->new_mode) {
2806 if (0 < patch->is_new)
2807 patch->new_mode = S_IFREG | 0644;
2808 else
2809 patch->new_mode = patch->old_mode;
2810 }
2811 }
2813 if (new_name && old_name) {
2814 int same = !strcmp(old_name, new_name);
2815 if (!patch->new_mode)
2816 patch->new_mode = patch->old_mode;
2817 if ((patch->old_mode ^ patch->new_mode) & S_IFMT)
2818 return error("new mode (%o) of %s does not match old mode (%o)%s%s",
2819 patch->new_mode, new_name, patch->old_mode,
2820 same ? "" : " of ", same ? "" : old_name);
2821 }
2823 if (apply_data(patch, &st, ce) < 0)
2824 return error("%s: patch does not apply", name);
2825 patch->rejected = 0;
2826 return 0;
2827 }
2829 static int check_patch_list(struct patch *patch)
2830 {
2831 int err = 0;
2833 prepare_fn_table(patch);
2834 while (patch) {
2835 if (apply_verbosely)
2836 say_patch_name(stderr,
2837 "Checking patch ", patch, "...\n");
2838 err |= check_patch(patch);
2839 patch = patch->next;
2840 }
2841 return err;
2842 }
2844 /* This function tries to read the sha1 from the current index */
2845 static int get_current_sha1(const char *path, unsigned char *sha1)
2846 {
2847 int pos;
2849 if (read_cache() < 0)
2850 return -1;
2851 pos = cache_name_pos(path, strlen(path));
2852 if (pos < 0)
2853 return -1;
2854 hashcpy(sha1, active_cache[pos]->sha1);
2855 return 0;
2856 }
2858 /* Build an index that contains the just the files needed for a 3way merge */
2859 static void build_fake_ancestor(struct patch *list, const char *filename)
2860 {
2861 struct patch *patch;
2862 struct index_state result = { NULL };
2863 int fd;
2865 /* Once we start supporting the reverse patch, it may be
2866 * worth showing the new sha1 prefix, but until then...
2867 */
2868 for (patch = list; patch; patch = patch->next) {
2869 const unsigned char *sha1_ptr;
2870 unsigned char sha1[20];
2871 struct cache_entry *ce;
2872 const char *name;
2874 name = patch->old_name ? patch->old_name : patch->new_name;
2875 if (0 < patch->is_new)
2876 continue;
2877 else if (get_sha1(patch->old_sha1_prefix, sha1))
2878 /* git diff has no index line for mode/type changes */
2879 if (!patch->lines_added && !patch->lines_deleted) {
2880 if (get_current_sha1(patch->new_name, sha1) ||
2881 get_current_sha1(patch->old_name, sha1))
2882 die("mode change for %s, which is not "
2883 "in current HEAD", name);
2884 sha1_ptr = sha1;
2885 } else
2886 die("sha1 information is lacking or useless "
2887 "(%s).", name);
2888 else
2889 sha1_ptr = sha1;
2891 ce = make_cache_entry(patch->old_mode, sha1_ptr, name, 0, 0);
2892 if (!ce)
2893 die("make_cache_entry failed for path '%s'", name);
2894 if (add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD))
2895 die ("Could not add %s to temporary index", name);
2896 }
2898 fd = open(filename, O_WRONLY | O_CREAT, 0666);
2899 if (fd < 0 || write_index(&result, fd) || close(fd))
2900 die ("Could not write temporary index to %s", filename);
2902 discard_index(&result);
2903 }
2905 static void stat_patch_list(struct patch *patch)
2906 {
2907 int files, adds, dels;
2909 for (files = adds = dels = 0 ; patch ; patch = patch->next) {
2910 files++;
2911 adds += patch->lines_added;
2912 dels += patch->lines_deleted;
2913 show_stats(patch);
2914 }
2916 printf(" %d files changed, %d insertions(+), %d deletions(-)\n", files, adds, dels);
2917 }
2919 static void numstat_patch_list(struct patch *patch)
2920 {
2921 for ( ; patch; patch = patch->next) {
2922 const char *name;
2923 name = patch->new_name ? patch->new_name : patch->old_name;
2924 if (patch->is_binary)
2925 printf("-\t-\t");
2926 else
2927 printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);
2928 write_name_quoted(name, stdout, line_termination);
2929 }
2930 }
2932 static void show_file_mode_name(const char *newdelete, unsigned int mode, const char *name)
2933 {
2934 if (mode)
2935 printf(" %s mode %06o %s\n", newdelete, mode, name);
2936 else
2937 printf(" %s %s\n", newdelete, name);
2938 }
2940 static void show_mode_change(struct patch *p, int show_name)
2941 {
2942 if (p->old_mode && p->new_mode && p->old_mode != p->new_mode) {
2943 if (show_name)
2944 printf(" mode change %06o => %06o %s\n",
2945 p->old_mode, p->new_mode, p->new_name);
2946 else
2947 printf(" mode change %06o => %06o\n",
2948 p->old_mode, p->new_mode);
2949 }
2950 }
2952 static void show_rename_copy(struct patch *p)
2953 {
2954 const char *renamecopy = p->is_rename ? "rename" : "copy";
2955 const char *old, *new;
2957 /* Find common prefix */
2958 old = p->old_name;
2959 new = p->new_name;
2960 while (1) {
2961 const char *slash_old, *slash_new;
2962 slash_old = strchr(old, '/');
2963 slash_new = strchr(new, '/');
2964 if (!slash_old ||
2965 !slash_new ||
2966 slash_old - old != slash_new - new ||
2967 memcmp(old, new, slash_new - new))
2968 break;
2969 old = slash_old + 1;
2970 new = slash_new + 1;
2971 }
2972 /* p->old_name thru old is the common prefix, and old and new
2973 * through the end of names are renames
2974 */
2975 if (old != p->old_name)
2976 printf(" %s %.*s{%s => %s} (%d%%)\n", renamecopy,
2977 (int)(old - p->old_name), p->old_name,
2978 old, new, p->score);
2979 else
2980 printf(" %s %s => %s (%d%%)\n", renamecopy,
2981 p->old_name, p->new_name, p->score);
2982 show_mode_change(p, 0);
2983 }
2985 static void summary_patch_list(struct patch *patch)
2986 {
2987 struct patch *p;
2989 for (p = patch; p; p = p->next) {
2990 if (p->is_new)
2991 show_file_mode_name("create", p->new_mode, p->new_name);
2992 else if (p->is_delete)
2993 show_file_mode_name("delete", p->old_mode, p->old_name);
2994 else {
2995 if (p->is_rename || p->is_copy)
2996 show_rename_copy(p);
2997 else {
2998 if (p->score) {
2999 printf(" rewrite %s (%d%%)\n",
3000 p->new_name, p->score);
3001 show_mode_change(p, 0);
3002 }
3003 else
3004 show_mode_change(p, 1);
3005 }
3006 }
3007 }
3008 }
3010 static void patch_stats(struct patch *patch)
3011 {
3012 int lines = patch->lines_added + patch->lines_deleted;
3014 if (lines > max_change)
3015 max_change = lines;
3016 if (patch->old_name) {
3017 int len = quote_c_style(patch->old_name, NULL, NULL, 0);
3018 if (!len)
3019 len = strlen(patch->old_name);
3020 if (len > max_len)
3021 max_len = len;
3022 }
3023 if (patch->new_name) {
3024 int len = quote_c_style(patch->new_name, NULL, NULL, 0);
3025 if (!len)
3026 len = strlen(patch->new_name);
3027 if (len > max_len)
3028 max_len = len;
3029 }
3030 }
3032 static void remove_file(struct patch *patch, int rmdir_empty)
3033 {
3034 if (update_index) {
3035 if (remove_file_from_cache(patch->old_name) < 0)
3036 die("unable to remove %s from index", patch->old_name);
3037 }
3038 if (!cached) {
3039 if (S_ISGITLINK(patch->old_mode)) {
3040 if (rmdir(patch->old_name))
3041 warning("unable to remove submodule %s",
3042 patch->old_name);
3043 } else if (!unlink_or_warn(patch->old_name) && rmdir_empty) {
3044 remove_path(patch->old_name);
3045 }
3046 }
3047 }
3049 static void add_index_file(const char *path, unsigned mode, void *buf, unsigned long size)
3050 {
3051 struct stat st;
3052 struct cache_entry *ce;
3053 int namelen = strlen(path);
3054 unsigned ce_size = cache_entry_size(namelen);
3056 if (!update_index)
3057 return;
3059 ce = xcalloc(1, ce_size);
3060 memcpy(ce->name, path, namelen);
3061 ce->ce_mode = create_ce_mode(mode);
3062 ce->ce_flags = namelen;
3063 if (S_ISGITLINK(mode)) {
3064 const char *s = buf;
3066 if (get_sha1_hex(s + strlen("Subproject commit "), ce->sha1))
3067 die("corrupt patch for subproject %s", path);
3068 } else {
3069 if (!cached) {
3070 if (lstat(path, &st) < 0)
3071 die_errno("unable to stat newly created file '%s'",
3072 path);
3073 fill_stat_cache_info(ce, &st);
3074 }
3075 if (write_sha1_file(buf, size, blob_type, ce->sha1) < 0)
3076 die("unable to create backing store for newly created file %s", path);
3077 }
3078 if (add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) < 0)
3079 die("unable to add cache entry for %s", path);
3080 }
3082 static int try_create_file(const char *path, unsigned int mode, const char *buf, unsigned long size)
3083 {
3084 int fd;
3085 struct strbuf nbuf = STRBUF_INIT;
3087 if (S_ISGITLINK(mode)) {
3088 struct stat st;
3089 if (!lstat(path, &st) && S_ISDIR(st.st_mode))
3090 return 0;
3091 return mkdir(path, 0777);
3092 }
3094 if (has_symlinks && S_ISLNK(mode))
3095 /* Although buf:size is counted string, it also is NUL
3096 * terminated.
3097 */
3098 return symlink(buf, path);
3100 fd = open(path, O_CREAT | O_EXCL | O_WRONLY, (mode & 0100) ? 0777 : 0666);
3101 if (fd < 0)
3102 return -1;
3104 if (convert_to_working_tree(path, buf, size, &nbuf)) {
3105 size = nbuf.len;
3106 buf = nbuf.buf;
3107 }
3108 write_or_die(fd, buf, size);
3109 strbuf_release(&nbuf);
3111 if (close(fd) < 0)
3112 die_errno("closing file '%s'", path);
3113 return 0;
3114 }
3116 /*
3117 * We optimistically assume that the directories exist,
3118 * which is true 99% of the time anyway. If they don't,
3119 * we create them and try again.
3120 */
3121 static void create_one_file(char *path, unsigned mode, const char *buf, unsigned long size)
3122 {
3123 if (cached)
3124 return;
3125 if (!try_create_file(path, mode, buf, size))
3126 return;
3128 if (errno == ENOENT) {
3129 if (safe_create_leading_directories(path))
3130 return;
3131 if (!try_create_file(path, mode, buf, size))
3132 return;
3133 }
3135 if (errno == EEXIST || errno == EACCES) {
3136 /* We may be trying to create a file where a directory
3137 * used to be.
3138 */
3139 struct stat st;
3140 if (!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))
3141 errno = EEXIST;
3142 }
3144 if (errno == EEXIST) {
3145 unsigned int nr = getpid();
3147 for (;;) {
3148 char newpath[PATH_MAX];
3149 mksnpath(newpath, sizeof(newpath), "%s~%u", path, nr);
3150 if (!try_create_file(newpath, mode, buf, size)) {
3151 if (!rename(newpath, path))
3152 return;
3153 unlink_or_warn(newpath);
3154 break;
3155 }
3156 if (errno != EEXIST)
3157 break;
3158 ++nr;
3159 }
3160 }
3161 die_errno("unable to write file '%s' mode %o", path, mode);
3162 }
3164 static void create_file(struct patch *patch)
3165 {
3166 char *path = patch->new_name;
3167 unsigned mode = patch->new_mode;
3168 unsigned long size = patch->resultsize;
3169 char *buf = patch->result;
3171 if (!mode)
3172 mode = S_IFREG | 0644;
3173 create_one_file(path, mode, buf, size);
3174 add_index_file(path, mode, buf, size);
3175 }
3177 /* phase zero is to remove, phase one is to create */
3178 static void write_out_one_result(struct patch *patch, int phase)
3179 {
3180 if (patch->is_delete > 0) {
3181 if (phase == 0)
3182 remove_file(patch, 1);
3183 return;
3184 }
3185 if (patch->is_new > 0 || patch->is_copy) {
3186 if (phase == 1)
3187 create_file(patch);
3188 return;
3189 }
3190 /*
3191 * Rename or modification boils down to the same
3192 * thing: remove the old, write the new
3193 */
3194 if (phase == 0)
3195 remove_file(patch, patch->is_rename);
3196 if (phase == 1)
3197 create_file(patch);
3198 }
3200 static int write_out_one_reject(struct patch *patch)
3201 {
3202 FILE *rej;
3203 char namebuf[PATH_MAX];
3204 struct fragment *frag;
3205 int cnt = 0;
3207 for (cnt = 0, frag = patch->fragments; frag; frag = frag->next) {
3208 if (!frag->rejected)
3209 continue;
3210 cnt++;
3211 }
3213 if (!cnt) {
3214 if (apply_verbosely)
3215 say_patch_name(stderr,
3216 "Applied patch ", patch, " cleanly.\n");
3217 return 0;
3218 }
3220 /* This should not happen, because a removal patch that leaves
3221 * contents are marked "rejected" at the patch level.
3222 */
3223 if (!patch->new_name)
3224 die("internal error");
3226 /* Say this even without --verbose */
3227 say_patch_name(stderr, "Applying patch ", patch, " with");
3228 fprintf(stderr, " %d rejects...\n", cnt);
3230 cnt = strlen(patch->new_name);
3231 if (ARRAY_SIZE(namebuf) <= cnt + 5) {
3232 cnt = ARRAY_SIZE(namebuf) - 5;
3233 warning("truncating .rej filename to %.*s.rej",
3234 cnt - 1, patch->new_name);
3235 }
3236 memcpy(namebuf, patch->new_name, cnt);
3237 memcpy(namebuf + cnt, ".rej", 5);
3239 rej = fopen(namebuf, "w");
3240 if (!rej)
3241 return error("cannot open %s: %s", namebuf, strerror(errno));
3243 /* Normal git tools never deal with .rej, so do not pretend
3244 * this is a git patch by saying --git nor give extended
3245 * headers. While at it, maybe please "kompare" that wants
3246 * the trailing TAB and some garbage at the end of line ;-).
3247 */
3248 fprintf(rej, "diff a/%s b/%s\t(rejected hunks)\n",
3249 patch->new_name, patch->new_name);
3250 for (cnt = 1, frag = patch->fragments;
3251 frag;
3252 cnt++, frag = frag->next) {
3253 if (!frag->rejected) {
3254 fprintf(stderr, "Hunk #%d applied cleanly.\n", cnt);
3255 continue;
3256 }
3257 fprintf(stderr, "Rejected hunk #%d.\n", cnt);
3258 fprintf(rej, "%.*s", frag->size, frag->patch);
3259 if (frag->patch[frag->size-1] != '\n')
3260 fputc('\n', rej);
3261 }
3262 fclose(rej);
3263 return -1;
3264 }
3266 static int write_out_results(struct patch *list, int skipped_patch)
3267 {
3268 int phase;
3269 int errs = 0;
3270 struct patch *l;
3272 if (!list && !skipped_patch)
3273 return error("No changes");
3275 for (phase = 0; phase < 2; phase++) {
3276 l = list;
3277 while (l) {
3278 if (l->rejected)
3279 errs = 1;
3280 else {
3281 write_out_one_result(l, phase);
3282 if (phase == 1 && write_out_one_reject(l))
3283 errs = 1;
3284 }
3285 l = l->next;
3286 }
3287 }
3288 return errs;
3289 }
3291 static struct lock_file lock_file;
3293 static struct string_list limit_by_name;
3294 static int has_include;
3295 static void add_name_limit(const char *name, int exclude)
3296 {
3297 struct string_list_item *it;
3299 it = string_list_append(name, &limit_by_name);
3300 it->util = exclude ? NULL : (void *) 1;
3301 }
3303 static int use_patch(struct patch *p)
3304 {
3305 const char *pathname = p->new_name ? p->new_name : p->old_name;
3306 int i;
3308 /* Paths outside are not touched regardless of "--include" */
3309 if (0 < prefix_length) {
3310 int pathlen = strlen(pathname);
3311 if (pathlen <= prefix_length ||
3312 memcmp(prefix, pathname, prefix_length))
3313 return 0;
3314 }
3316 /* See if it matches any of exclude/include rule */
3317 for (i = 0; i < limit_by_name.nr; i++) {
3318 struct string_list_item *it = &limit_by_name.items[i];
3319 if (!fnmatch(it->string, pathname, 0))
3320 return (it->util != NULL);
3321 }
3323 /*
3324 * If we had any include, a path that does not match any rule is
3325 * not used. Otherwise, we saw bunch of exclude rules (or none)
3326 * and such a path is used.
3327 */
3328 return !has_include;
3329 }
3332 static void prefix_one(char **name)
3333 {
3334 char *old_name = *name;
3335 if (!old_name)
3336 return;
3337 *name = xstrdup(prefix_filename(prefix, prefix_length, *name));
3338 free(old_name);
3339 }
3341 static void prefix_patches(struct patch *p)
3342 {
3343 if (!prefix || p->is_toplevel_relative)
3344 return;
3345 for ( ; p; p = p->next) {
3346 if (p->new_name == p->old_name) {
3347 char *prefixed = p->new_name;
3348 prefix_one(&prefixed);
3349 p->new_name = p->old_name = prefixed;
3350 }
3351 else {
3352 prefix_one(&p->new_name);
3353 prefix_one(&p->old_name);
3354 }
3355 }
3356 }
3358 #define INACCURATE_EOF (1<<0)
3359 #define RECOUNT (1<<1)
3361 static int apply_patch(int fd, const char *filename, int options)
3362 {
3363 size_t offset;
3364 struct strbuf buf = STRBUF_INIT;
3365 struct patch *list = NULL, **listp = &list;
3366 int skipped_patch = 0;
3368 /* FIXME - memory leak when using multiple patch files as inputs */
3369 memset(&fn_table, 0, sizeof(struct string_list));
3370 patch_input_file = filename;
3371 read_patch_file(&buf, fd);
3372 offset = 0;
3373 while (offset < buf.len) {
3374 struct patch *patch;
3375 int nr;
3377 patch = xcalloc(1, sizeof(*patch));
3378 patch->inaccurate_eof = !!(options & INACCURATE_EOF);
3379 patch->recount = !!(options & RECOUNT);
3380 nr = parse_chunk(buf.buf + offset, buf.len - offset, patch);
3381 if (nr < 0)
3382 break;
3383 if (apply_in_reverse)
3384 reverse_patches(patch);
3385 if (prefix)
3386 prefix_patches(patch);
3387 if (use_patch(patch)) {
3388 patch_stats(patch);
3389 *listp = patch;
3390 listp = &patch->next;
3391 }
3392 else {
3393 /* perhaps free it a bit better? */
3394 free(patch);
3395 skipped_patch++;
3396 }
3397 offset += nr;
3398 }
3400 if (whitespace_error && (ws_error_action == die_on_ws_error))
3401 apply = 0;
3403 update_index = check_index && apply;
3404 if (update_index && newfd < 0)
3405 newfd = hold_locked_index(&lock_file, 1);
3407 if (check_index) {
3408 if (read_cache() < 0)
3409 die("unable to read index file");
3410 }
3412 if ((check || apply) &&
3413 check_patch_list(list) < 0 &&
3414 !apply_with_reject)
3415 exit(1);
3417 if (apply && write_out_results(list, skipped_patch))
3418 exit(1);
3420 if (fake_ancestor)
3421 build_fake_ancestor(list, fake_ancestor);
3423 if (diffstat)
3424 stat_patch_list(list);
3426 if (numstat)
3427 numstat_patch_list(list);
3429 if (summary)
3430 summary_patch_list(list);
3432 strbuf_release(&buf);
3433 return 0;
3434 }
3436 static int git_apply_config(const char *var, const char *value, void *cb)
3437 {
3438 if (!strcmp(var, "apply.whitespace"))
3439 return git_config_string(&apply_default_whitespace, var, value);
3440 else if (!strcmp(var, "apply.ignorewhitespace"))
3441 return git_config_string(&apply_default_ignorewhitespace, var, value);
3442 return git_default_config(var, value, cb);
3443 }
3445 static int option_parse_exclude(const struct option *opt,
3446 const char *arg, int unset)
3447 {
3448 add_name_limit(arg, 1);
3449 return 0;
3450 }
3452 static int option_parse_include(const struct option *opt,
3453 const char *arg, int unset)
3454 {
3455 add_name_limit(arg, 0);
3456 has_include = 1;
3457 return 0;
3458 }
3460 static int option_parse_p(const struct option *opt,
3461 const char *arg, int unset)
3462 {
3463 p_value = atoi(arg);
3464 p_value_known = 1;
3465 return 0;
3466 }
3468 static int option_parse_z(const struct option *opt,
3469 const char *arg, int unset)
3470 {
3471 if (unset)
3472 line_termination = '\n';
3473 else
3474 line_termination = 0;
3475 return 0;
3476 }
3478 static int option_parse_space_change(const struct option *opt,
3479 const char *arg, int unset)
3480 {
3481 if (unset)
3482 ws_ignore_action = ignore_ws_none;
3483 else
3484 ws_ignore_action = ignore_ws_change;
3485 return 0;
3486 }
3488 static int option_parse_whitespace(const struct option *opt,
3489 const char *arg, int unset)
3490 {
3491 const char **whitespace_option = opt->value;
3493 *whitespace_option = arg;
3494 parse_whitespace_option(arg);
3495 return 0;
3496 }
3498 static int option_parse_directory(const struct option *opt,
3499 const char *arg, int unset)
3500 {
3501 root_len = strlen(arg);
3502 if (root_len && arg[root_len - 1] != '/') {
3503 char *new_root;
3504 root = new_root = xmalloc(root_len + 2);
3505 strcpy(new_root, arg);
3506 strcpy(new_root + root_len++, "/");
3507 } else
3508 root = arg;
3509 return 0;
3510 }
3512 int cmd_apply(int argc, const char **argv, const char *unused_prefix)
3513 {
3514 int i;
3515 int errs = 0;
3516 int is_not_gitdir;
3517 int binary;
3518 int force_apply = 0;
3520 const char *whitespace_option = NULL;
3522 struct option builtin_apply_options[] = {
3523 { OPTION_CALLBACK, 0, "exclude", NULL, "path",
3524 "don't apply changes matching the given path",
3525 0, option_parse_exclude },
3526 { OPTION_CALLBACK, 0, "include", NULL, "path",
3527 "apply changes matching the given path",
3528 0, option_parse_include },
3529 { OPTION_CALLBACK, 'p', NULL, NULL, "num",
3530 "remove <num> leading slashes from traditional diff paths",
3531 0, option_parse_p },
3532 OPT_BOOLEAN(0, "no-add", &no_add,
3533 "ignore additions made by the patch"),
3534 OPT_BOOLEAN(0, "stat", &diffstat,
3535 "instead of applying the patch, output diffstat for the input"),
3536 { OPTION_BOOLEAN, 0, "allow-binary-replacement", &binary,
3537 NULL, "old option, now no-op",
3538 PARSE_OPT_HIDDEN | PARSE_OPT_NOARG },
3539 { OPTION_BOOLEAN, 0, "binary", &binary,
3540 NULL, "old option, now no-op",
3541 PARSE_OPT_HIDDEN | PARSE_OPT_NOARG },
3542 OPT_BOOLEAN(0, "numstat", &numstat,
3543 "shows number of added and deleted lines in decimal notation"),
3544 OPT_BOOLEAN(0, "summary", &summary,
3545 "instead of applying the patch, output a summary for the input"),
3546 OPT_BOOLEAN(0, "check", &check,
3547 "instead of applying the patch, see if the patch is applicable"),
3548 OPT_BOOLEAN(0, "index", &check_index,
3549 "make sure the patch is applicable to the current index"),
3550 OPT_BOOLEAN(0, "cached", &cached,
3551 "apply a patch without touching the working tree"),
3552 OPT_BOOLEAN(0, "apply", &force_apply,
3553 "also apply the patch (use with --stat/--summary/--check)"),
3554 OPT_FILENAME(0, "build-fake-ancestor", &fake_ancestor,
3555 "build a temporary index based on embedded index information"),
3556 { OPTION_CALLBACK, 'z', NULL, NULL, NULL,
3557 "paths are separated with NUL character",
3558 PARSE_OPT_NOARG, option_parse_z },
3559 OPT_INTEGER('C', NULL, &p_context,
3560 "ensure at least <n> lines of context match"),
3561 { OPTION_CALLBACK, 0, "whitespace", &whitespace_option, "action",
3562 "detect new or modified lines that have whitespace errors",
3563 0, option_parse_whitespace },
3564 { OPTION_CALLBACK, 0, "ignore-space-change", NULL, NULL,
3565 "ignore changes in whitespace when finding context",
3566 PARSE_OPT_NOARG, option_parse_space_change },
3567 { OPTION_CALLBACK, 0, "ignore-whitespace", NULL, NULL,
3568 "ignore changes in whitespace when finding context",
3569 PARSE_OPT_NOARG, option_parse_space_change },
3570 OPT_BOOLEAN('R', "reverse", &apply_in_reverse,
3571 "apply the patch in reverse"),
3572 OPT_BOOLEAN(0, "unidiff-zero", &unidiff_zero,
3573 "don't expect at least one line of context"),
3574 OPT_BOOLEAN(0, "reject", &apply_with_reject,
3575 "leave the rejected hunks in corresponding *.rej files"),
3576 OPT__VERBOSE(&apply_verbosely),
3577 OPT_BIT(0, "inaccurate-eof", &options,
3578 "tolerate incorrectly detected missing new-line at the end of file",
3579 INACCURATE_EOF),
3580 OPT_BIT(0, "recount", &options,
3581 "do not trust the line counts in the hunk headers",
3582 RECOUNT),
3583 { OPTION_CALLBACK, 0, "directory", NULL, "root",
3584 "prepend <root> to all filenames",
3585 0, option_parse_directory },
3586 OPT_END()
3587 };
3589 prefix = setup_git_directory_gently(&is_not_gitdir);
3590 prefix_length = prefix ? strlen(prefix) : 0;
3591 git_config(git_apply_config, NULL);
3592 if (apply_default_whitespace)
3593 parse_whitespace_option(apply_default_whitespace);
3594 if (apply_default_ignorewhitespace)
3595 parse_ignorewhitespace_option(apply_default_ignorewhitespace);
3597 argc = parse_options(argc, argv, prefix, builtin_apply_options,
3598 apply_usage, 0);
3600 if (apply_with_reject)
3601 apply = apply_verbosely = 1;
3602 if (!force_apply && (diffstat || numstat || summary || check || fake_ancestor))
3603 apply = 0;
3604 if (check_index && is_not_gitdir)
3605 die("--index outside a repository");
3606 if (cached) {
3607 if (is_not_gitdir)
3608 die("--cached outside a repository");
3609 check_index = 1;
3610 }
3611 for (i = 0; i < argc; i++) {
3612 const char *arg = argv[i];
3613 int fd;
3615 if (!strcmp(arg, "-")) {
3616 errs |= apply_patch(0, "<stdin>", options);
3617 read_stdin = 0;
3618 continue;
3619 } else if (0 < prefix_length)
3620 arg = prefix_filename(prefix, prefix_length, arg);
3622 fd = open(arg, O_RDONLY);
3623 if (fd < 0)
3624 die_errno("can't open patch '%s'", arg);
3625 read_stdin = 0;
3626 set_default_whitespace_mode(whitespace_option);
3627 errs |= apply_patch(fd, arg, options);
3628 close(fd);
3629 }
3630 set_default_whitespace_mode(whitespace_option);
3631 if (read_stdin)
3632 errs |= apply_patch(0, "<stdin>", options);
3633 if (whitespace_error) {
3634 if (squelch_whitespace_errors &&
3635 squelch_whitespace_errors < whitespace_error) {
3636 int squelched =
3637 whitespace_error - squelch_whitespace_errors;
3638 warning("squelched %d "
3639 "whitespace error%s",
3640 squelched,
3641 squelched == 1 ? "" : "s");
3642 }
3643 if (ws_error_action == die_on_ws_error)
3644 die("%d line%s add%s whitespace errors.",
3645 whitespace_error,
3646 whitespace_error == 1 ? "" : "s",
3647 whitespace_error == 1 ? "s" : "");
3648 if (applied_after_fixing_ws && apply)
3649 warning("%d line%s applied after"
3650 " fixing whitespace errors.",
3651 applied_after_fixing_ws,
3652 applied_after_fixing_ws == 1 ? "" : "s");
3653 else if (whitespace_error)
3654 warning("%d line%s add%s whitespace errors.",
3655 whitespace_error,
3656 whitespace_error == 1 ? "" : "s",
3657 whitespace_error == 1 ? "s" : "");
3658 }
3660 if (update_index) {
3661 if (write_cache(newfd, active_cache, active_nr) ||
3662 commit_locked_index(&lock_file))
3663 die("Unable to write new index file");
3664 }
3666 return !!errs;
3667 }