]> git.ipfire.org Git - thirdparty/git.git/blob - apply.c
Merge branch 'pw/apply-too-large'
[thirdparty/git.git] / apply.c
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
10 #include "git-compat-util.h"
11 #include "abspath.h"
12 #include "alloc.h"
13 #include "base85.h"
14 #include "config.h"
15 #include "object-store-ll.h"
16 #include "blob.h"
17 #include "delta.h"
18 #include "diff.h"
19 #include "dir.h"
20 #include "environment.h"
21 #include "gettext.h"
22 #include "hex.h"
23 #include "xdiff-interface.h"
24 #include "merge-ll.h"
25 #include "lockfile.h"
26 #include "name-hash.h"
27 #include "object-name.h"
28 #include "object-file.h"
29 #include "parse-options.h"
30 #include "path.h"
31 #include "quote.h"
32 #include "read-cache.h"
33 #include "rerere.h"
34 #include "apply.h"
35 #include "entry.h"
36 #include "setup.h"
37 #include "symlinks.h"
38 #include "wildmatch.h"
39 #include "ws.h"
40 #include "wrapper.h"
41
42 struct gitdiff_data {
43 struct strbuf *root;
44 int linenr;
45 int p_value;
46 };
47
48 static void git_apply_config(void)
49 {
50 git_config_get_string("apply.whitespace", &apply_default_whitespace);
51 git_config_get_string("apply.ignorewhitespace", &apply_default_ignorewhitespace);
52 git_config(git_xmerge_config, NULL);
53 }
54
55 static int parse_whitespace_option(struct apply_state *state, const char *option)
56 {
57 if (!option) {
58 state->ws_error_action = warn_on_ws_error;
59 return 0;
60 }
61 if (!strcmp(option, "warn")) {
62 state->ws_error_action = warn_on_ws_error;
63 return 0;
64 }
65 if (!strcmp(option, "nowarn")) {
66 state->ws_error_action = nowarn_ws_error;
67 return 0;
68 }
69 if (!strcmp(option, "error")) {
70 state->ws_error_action = die_on_ws_error;
71 return 0;
72 }
73 if (!strcmp(option, "error-all")) {
74 state->ws_error_action = die_on_ws_error;
75 state->squelch_whitespace_errors = 0;
76 return 0;
77 }
78 if (!strcmp(option, "strip") || !strcmp(option, "fix")) {
79 state->ws_error_action = correct_ws_error;
80 return 0;
81 }
82 /*
83 * Please update $__git_whitespacelist in git-completion.bash
84 * when you add new options.
85 */
86 return error(_("unrecognized whitespace option '%s'"), option);
87 }
88
89 static int parse_ignorewhitespace_option(struct apply_state *state,
90 const char *option)
91 {
92 if (!option || !strcmp(option, "no") ||
93 !strcmp(option, "false") || !strcmp(option, "never") ||
94 !strcmp(option, "none")) {
95 state->ws_ignore_action = ignore_ws_none;
96 return 0;
97 }
98 if (!strcmp(option, "change")) {
99 state->ws_ignore_action = ignore_ws_change;
100 return 0;
101 }
102 return error(_("unrecognized whitespace ignore option '%s'"), option);
103 }
104
105 int init_apply_state(struct apply_state *state,
106 struct repository *repo,
107 const char *prefix)
108 {
109 memset(state, 0, sizeof(*state));
110 state->prefix = prefix;
111 state->repo = repo;
112 state->apply = 1;
113 state->line_termination = '\n';
114 state->p_value = 1;
115 state->p_context = UINT_MAX;
116 state->squelch_whitespace_errors = 5;
117 state->ws_error_action = warn_on_ws_error;
118 state->ws_ignore_action = ignore_ws_none;
119 state->linenr = 1;
120 string_list_init_nodup(&state->fn_table);
121 string_list_init_nodup(&state->limit_by_name);
122 strset_init(&state->removed_symlinks);
123 strset_init(&state->kept_symlinks);
124 strbuf_init(&state->root, 0);
125
126 git_apply_config();
127 if (apply_default_whitespace && parse_whitespace_option(state, apply_default_whitespace))
128 return -1;
129 if (apply_default_ignorewhitespace && parse_ignorewhitespace_option(state, apply_default_ignorewhitespace))
130 return -1;
131 return 0;
132 }
133
134 void clear_apply_state(struct apply_state *state)
135 {
136 string_list_clear(&state->limit_by_name, 0);
137 strset_clear(&state->removed_symlinks);
138 strset_clear(&state->kept_symlinks);
139 strbuf_release(&state->root);
140
141 /* &state->fn_table is cleared at the end of apply_patch() */
142 }
143
144 static void mute_routine(const char *msg UNUSED, va_list params UNUSED)
145 {
146 /* do nothing */
147 }
148
149 int check_apply_state(struct apply_state *state, int force_apply)
150 {
151 int is_not_gitdir = !startup_info->have_repository;
152
153 if (state->apply_with_reject && state->threeway)
154 return error(_("options '%s' and '%s' cannot be used together"), "--reject", "--3way");
155 if (state->threeway) {
156 if (is_not_gitdir)
157 return error(_("'%s' outside a repository"), "--3way");
158 state->check_index = 1;
159 }
160 if (state->apply_with_reject) {
161 state->apply = 1;
162 if (state->apply_verbosity == verbosity_normal)
163 state->apply_verbosity = verbosity_verbose;
164 }
165 if (!force_apply && (state->diffstat || state->numstat || state->summary || state->check || state->fake_ancestor))
166 state->apply = 0;
167 if (state->check_index && is_not_gitdir)
168 return error(_("'%s' outside a repository"), "--index");
169 if (state->cached) {
170 if (is_not_gitdir)
171 return error(_("'%s' outside a repository"), "--cached");
172 state->check_index = 1;
173 }
174 if (state->ita_only && (state->check_index || is_not_gitdir))
175 state->ita_only = 0;
176 if (state->check_index)
177 state->unsafe_paths = 0;
178
179 if (state->apply_verbosity <= verbosity_silent) {
180 state->saved_error_routine = get_error_routine();
181 state->saved_warn_routine = get_warn_routine();
182 set_error_routine(mute_routine);
183 set_warn_routine(mute_routine);
184 }
185
186 return 0;
187 }
188
189 static void set_default_whitespace_mode(struct apply_state *state)
190 {
191 if (!state->whitespace_option && !apply_default_whitespace)
192 state->ws_error_action = (state->apply ? warn_on_ws_error : nowarn_ws_error);
193 }
194
195 /*
196 * This represents one "hunk" from a patch, starting with
197 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The
198 * patch text is pointed at by patch, and its byte length
199 * is stored in size. leading and trailing are the number
200 * of context lines.
201 */
202 struct fragment {
203 unsigned long leading, trailing;
204 unsigned long oldpos, oldlines;
205 unsigned long newpos, newlines;
206 /*
207 * 'patch' is usually borrowed from buf in apply_patch(),
208 * but some codepaths store an allocated buffer.
209 */
210 const char *patch;
211 unsigned free_patch:1,
212 rejected:1;
213 int size;
214 int linenr;
215 struct fragment *next;
216 };
217
218 /*
219 * When dealing with a binary patch, we reuse "leading" field
220 * to store the type of the binary hunk, either deflated "delta"
221 * or deflated "literal".
222 */
223 #define binary_patch_method leading
224 #define BINARY_DELTA_DEFLATED 1
225 #define BINARY_LITERAL_DEFLATED 2
226
227 static void free_fragment_list(struct fragment *list)
228 {
229 while (list) {
230 struct fragment *next = list->next;
231 if (list->free_patch)
232 free((char *)list->patch);
233 free(list);
234 list = next;
235 }
236 }
237
238 void release_patch(struct patch *patch)
239 {
240 free_fragment_list(patch->fragments);
241 free(patch->def_name);
242 free(patch->old_name);
243 free(patch->new_name);
244 free(patch->result);
245 }
246
247 static void free_patch(struct patch *patch)
248 {
249 release_patch(patch);
250 free(patch);
251 }
252
253 static void free_patch_list(struct patch *list)
254 {
255 while (list) {
256 struct patch *next = list->next;
257 free_patch(list);
258 list = next;
259 }
260 }
261
262 /*
263 * A line in a file, len-bytes long (includes the terminating LF,
264 * except for an incomplete line at the end if the file ends with
265 * one), and its contents hashes to 'hash'.
266 */
267 struct line {
268 size_t len;
269 unsigned hash : 24;
270 unsigned flag : 8;
271 #define LINE_COMMON 1
272 #define LINE_PATCHED 2
273 };
274
275 /*
276 * This represents a "file", which is an array of "lines".
277 */
278 struct image {
279 char *buf;
280 size_t len;
281 size_t nr;
282 size_t alloc;
283 struct line *line_allocated;
284 struct line *line;
285 };
286
287 static uint32_t hash_line(const char *cp, size_t len)
288 {
289 size_t i;
290 uint32_t h;
291 for (i = 0, h = 0; i < len; i++) {
292 if (!isspace(cp[i])) {
293 h = h * 3 + (cp[i] & 0xff);
294 }
295 }
296 return h;
297 }
298
299 /*
300 * Compare lines s1 of length n1 and s2 of length n2, ignoring
301 * whitespace difference. Returns 1 if they match, 0 otherwise
302 */
303 static int fuzzy_matchlines(const char *s1, size_t n1,
304 const char *s2, size_t n2)
305 {
306 const char *end1 = s1 + n1;
307 const char *end2 = s2 + n2;
308
309 /* ignore line endings */
310 while (s1 < end1 && (end1[-1] == '\r' || end1[-1] == '\n'))
311 end1--;
312 while (s2 < end2 && (end2[-1] == '\r' || end2[-1] == '\n'))
313 end2--;
314
315 while (s1 < end1 && s2 < end2) {
316 if (isspace(*s1)) {
317 /*
318 * Skip whitespace. We check on both buffers
319 * because we don't want "a b" to match "ab".
320 */
321 if (!isspace(*s2))
322 return 0;
323 while (s1 < end1 && isspace(*s1))
324 s1++;
325 while (s2 < end2 && isspace(*s2))
326 s2++;
327 } else if (*s1++ != *s2++)
328 return 0;
329 }
330
331 /* If we reached the end on one side only, lines don't match. */
332 return s1 == end1 && s2 == end2;
333 }
334
335 static void add_line_info(struct image *img, const char *bol, size_t len, unsigned flag)
336 {
337 ALLOC_GROW(img->line_allocated, img->nr + 1, img->alloc);
338 img->line_allocated[img->nr].len = len;
339 img->line_allocated[img->nr].hash = hash_line(bol, len);
340 img->line_allocated[img->nr].flag = flag;
341 img->nr++;
342 }
343
344 /*
345 * "buf" has the file contents to be patched (read from various sources).
346 * attach it to "image" and add line-based index to it.
347 * "image" now owns the "buf".
348 */
349 static void prepare_image(struct image *image, char *buf, size_t len,
350 int prepare_linetable)
351 {
352 const char *cp, *ep;
353
354 memset(image, 0, sizeof(*image));
355 image->buf = buf;
356 image->len = len;
357
358 if (!prepare_linetable)
359 return;
360
361 ep = image->buf + image->len;
362 cp = image->buf;
363 while (cp < ep) {
364 const char *next;
365 for (next = cp; next < ep && *next != '\n'; next++)
366 ;
367 if (next < ep)
368 next++;
369 add_line_info(image, cp, next - cp, 0);
370 cp = next;
371 }
372 image->line = image->line_allocated;
373 }
374
375 static void clear_image(struct image *image)
376 {
377 free(image->buf);
378 free(image->line_allocated);
379 memset(image, 0, sizeof(*image));
380 }
381
382 /* fmt must contain _one_ %s and no other substitution */
383 static void say_patch_name(FILE *output, const char *fmt, struct patch *patch)
384 {
385 struct strbuf sb = STRBUF_INIT;
386
387 if (patch->old_name && patch->new_name &&
388 strcmp(patch->old_name, patch->new_name)) {
389 quote_c_style(patch->old_name, &sb, NULL, 0);
390 strbuf_addstr(&sb, " => ");
391 quote_c_style(patch->new_name, &sb, NULL, 0);
392 } else {
393 const char *n = patch->new_name;
394 if (!n)
395 n = patch->old_name;
396 quote_c_style(n, &sb, NULL, 0);
397 }
398 fprintf(output, fmt, sb.buf);
399 fputc('\n', output);
400 strbuf_release(&sb);
401 }
402
403 #define SLOP (16)
404
405 /*
406 * apply.c isn't equipped to handle arbitrarily large patches, because
407 * it intermingles `unsigned long` with `int` for the type used to store
408 * buffer lengths.
409 *
410 * Only process patches that are just shy of 1 GiB large in order to
411 * avoid any truncation or overflow issues.
412 */
413 #define MAX_APPLY_SIZE (1024UL * 1024 * 1023)
414
415 static int read_patch_file(struct strbuf *sb, int fd)
416 {
417 if (strbuf_read(sb, fd, 0) < 0)
418 return error_errno(_("failed to read patch"));
419 else if (sb->len >= MAX_APPLY_SIZE)
420 return error(_("patch too large"));
421 /*
422 * Make sure that we have some slop in the buffer
423 * so that we can do speculative "memcmp" etc, and
424 * see to it that it is NUL-filled.
425 */
426 strbuf_grow(sb, SLOP);
427 memset(sb->buf + sb->len, 0, SLOP);
428 return 0;
429 }
430
431 static unsigned long linelen(const char *buffer, unsigned long size)
432 {
433 unsigned long len = 0;
434 while (size--) {
435 len++;
436 if (*buffer++ == '\n')
437 break;
438 }
439 return len;
440 }
441
442 static int is_dev_null(const char *str)
443 {
444 return skip_prefix(str, "/dev/null", &str) && isspace(*str);
445 }
446
447 #define TERM_SPACE 1
448 #define TERM_TAB 2
449
450 static int name_terminate(int c, int terminate)
451 {
452 if (c == ' ' && !(terminate & TERM_SPACE))
453 return 0;
454 if (c == '\t' && !(terminate & TERM_TAB))
455 return 0;
456
457 return 1;
458 }
459
460 /* remove double slashes to make --index work with such filenames */
461 static char *squash_slash(char *name)
462 {
463 int i = 0, j = 0;
464
465 if (!name)
466 return NULL;
467
468 while (name[i]) {
469 if ((name[j++] = name[i++]) == '/')
470 while (name[i] == '/')
471 i++;
472 }
473 name[j] = '\0';
474 return name;
475 }
476
477 static char *find_name_gnu(struct strbuf *root,
478 const char *line,
479 int p_value)
480 {
481 struct strbuf name = STRBUF_INIT;
482 char *cp;
483
484 /*
485 * Proposed "new-style" GNU patch/diff format; see
486 * https://lore.kernel.org/git/7vll0wvb2a.fsf@assigned-by-dhcp.cox.net/
487 */
488 if (unquote_c_style(&name, line, NULL)) {
489 strbuf_release(&name);
490 return NULL;
491 }
492
493 for (cp = name.buf; p_value; p_value--) {
494 cp = strchr(cp, '/');
495 if (!cp) {
496 strbuf_release(&name);
497 return NULL;
498 }
499 cp++;
500 }
501
502 strbuf_remove(&name, 0, cp - name.buf);
503 if (root->len)
504 strbuf_insert(&name, 0, root->buf, root->len);
505 return squash_slash(strbuf_detach(&name, NULL));
506 }
507
508 static size_t sane_tz_len(const char *line, size_t len)
509 {
510 const char *tz, *p;
511
512 if (len < strlen(" +0500") || line[len-strlen(" +0500")] != ' ')
513 return 0;
514 tz = line + len - strlen(" +0500");
515
516 if (tz[1] != '+' && tz[1] != '-')
517 return 0;
518
519 for (p = tz + 2; p != line + len; p++)
520 if (!isdigit(*p))
521 return 0;
522
523 return line + len - tz;
524 }
525
526 static size_t tz_with_colon_len(const char *line, size_t len)
527 {
528 const char *tz, *p;
529
530 if (len < strlen(" +08:00") || line[len - strlen(":00")] != ':')
531 return 0;
532 tz = line + len - strlen(" +08:00");
533
534 if (tz[0] != ' ' || (tz[1] != '+' && tz[1] != '-'))
535 return 0;
536 p = tz + 2;
537 if (!isdigit(*p++) || !isdigit(*p++) || *p++ != ':' ||
538 !isdigit(*p++) || !isdigit(*p++))
539 return 0;
540
541 return line + len - tz;
542 }
543
544 static size_t date_len(const char *line, size_t len)
545 {
546 const char *date, *p;
547
548 if (len < strlen("72-02-05") || line[len-strlen("-05")] != '-')
549 return 0;
550 p = date = line + len - strlen("72-02-05");
551
552 if (!isdigit(*p++) || !isdigit(*p++) || *p++ != '-' ||
553 !isdigit(*p++) || !isdigit(*p++) || *p++ != '-' ||
554 !isdigit(*p++) || !isdigit(*p++)) /* Not a date. */
555 return 0;
556
557 if (date - line >= strlen("19") &&
558 isdigit(date[-1]) && isdigit(date[-2])) /* 4-digit year */
559 date -= strlen("19");
560
561 return line + len - date;
562 }
563
564 static size_t short_time_len(const char *line, size_t len)
565 {
566 const char *time, *p;
567
568 if (len < strlen(" 07:01:32") || line[len-strlen(":32")] != ':')
569 return 0;
570 p = time = line + len - strlen(" 07:01:32");
571
572 /* Permit 1-digit hours? */
573 if (*p++ != ' ' ||
574 !isdigit(*p++) || !isdigit(*p++) || *p++ != ':' ||
575 !isdigit(*p++) || !isdigit(*p++) || *p++ != ':' ||
576 !isdigit(*p++) || !isdigit(*p++)) /* Not a time. */
577 return 0;
578
579 return line + len - time;
580 }
581
582 static size_t fractional_time_len(const char *line, size_t len)
583 {
584 const char *p;
585 size_t n;
586
587 /* Expected format: 19:41:17.620000023 */
588 if (!len || !isdigit(line[len - 1]))
589 return 0;
590 p = line + len - 1;
591
592 /* Fractional seconds. */
593 while (p > line && isdigit(*p))
594 p--;
595 if (*p != '.')
596 return 0;
597
598 /* Hours, minutes, and whole seconds. */
599 n = short_time_len(line, p - line);
600 if (!n)
601 return 0;
602
603 return line + len - p + n;
604 }
605
606 static size_t trailing_spaces_len(const char *line, size_t len)
607 {
608 const char *p;
609
610 /* Expected format: ' ' x (1 or more) */
611 if (!len || line[len - 1] != ' ')
612 return 0;
613
614 p = line + len;
615 while (p != line) {
616 p--;
617 if (*p != ' ')
618 return line + len - (p + 1);
619 }
620
621 /* All spaces! */
622 return len;
623 }
624
625 static size_t diff_timestamp_len(const char *line, size_t len)
626 {
627 const char *end = line + len;
628 size_t n;
629
630 /*
631 * Posix: 2010-07-05 19:41:17
632 * GNU: 2010-07-05 19:41:17.620000023 -0500
633 */
634
635 if (!isdigit(end[-1]))
636 return 0;
637
638 n = sane_tz_len(line, end - line);
639 if (!n)
640 n = tz_with_colon_len(line, end - line);
641 end -= n;
642
643 n = short_time_len(line, end - line);
644 if (!n)
645 n = fractional_time_len(line, end - line);
646 end -= n;
647
648 n = date_len(line, end - line);
649 if (!n) /* No date. Too bad. */
650 return 0;
651 end -= n;
652
653 if (end == line) /* No space before date. */
654 return 0;
655 if (end[-1] == '\t') { /* Success! */
656 end--;
657 return line + len - end;
658 }
659 if (end[-1] != ' ') /* No space before date. */
660 return 0;
661
662 /* Whitespace damage. */
663 end -= trailing_spaces_len(line, end - line);
664 return line + len - end;
665 }
666
667 static char *find_name_common(struct strbuf *root,
668 const char *line,
669 const char *def,
670 int p_value,
671 const char *end,
672 int terminate)
673 {
674 int len;
675 const char *start = NULL;
676
677 if (p_value == 0)
678 start = line;
679 while (line != end) {
680 char c = *line;
681
682 if (!end && isspace(c)) {
683 if (c == '\n')
684 break;
685 if (name_terminate(c, terminate))
686 break;
687 }
688 line++;
689 if (c == '/' && !--p_value)
690 start = line;
691 }
692 if (!start)
693 return squash_slash(xstrdup_or_null(def));
694 len = line - start;
695 if (!len)
696 return squash_slash(xstrdup_or_null(def));
697
698 /*
699 * Generally we prefer the shorter name, especially
700 * if the other one is just a variation of that with
701 * something else tacked on to the end (ie "file.orig"
702 * or "file~").
703 */
704 if (def) {
705 int deflen = strlen(def);
706 if (deflen < len && !strncmp(start, def, deflen))
707 return squash_slash(xstrdup(def));
708 }
709
710 if (root->len) {
711 char *ret = xstrfmt("%s%.*s", root->buf, len, start);
712 return squash_slash(ret);
713 }
714
715 return squash_slash(xmemdupz(start, len));
716 }
717
718 static char *find_name(struct strbuf *root,
719 const char *line,
720 char *def,
721 int p_value,
722 int terminate)
723 {
724 if (*line == '"') {
725 char *name = find_name_gnu(root, line, p_value);
726 if (name)
727 return name;
728 }
729
730 return find_name_common(root, line, def, p_value, NULL, terminate);
731 }
732
733 static char *find_name_traditional(struct strbuf *root,
734 const char *line,
735 char *def,
736 int p_value)
737 {
738 size_t len;
739 size_t date_len;
740
741 if (*line == '"') {
742 char *name = find_name_gnu(root, line, p_value);
743 if (name)
744 return name;
745 }
746
747 len = strchrnul(line, '\n') - line;
748 date_len = diff_timestamp_len(line, len);
749 if (!date_len)
750 return find_name_common(root, line, def, p_value, NULL, TERM_TAB);
751 len -= date_len;
752
753 return find_name_common(root, line, def, p_value, line + len, 0);
754 }
755
756 /*
757 * Given the string after "--- " or "+++ ", guess the appropriate
758 * p_value for the given patch.
759 */
760 static int guess_p_value(struct apply_state *state, const char *nameline)
761 {
762 char *name, *cp;
763 int val = -1;
764
765 if (is_dev_null(nameline))
766 return -1;
767 name = find_name_traditional(&state->root, nameline, NULL, 0);
768 if (!name)
769 return -1;
770 cp = strchr(name, '/');
771 if (!cp)
772 val = 0;
773 else if (state->prefix) {
774 /*
775 * Does it begin with "a/$our-prefix" and such? Then this is
776 * very likely to apply to our directory.
777 */
778 if (starts_with(name, state->prefix))
779 val = count_slashes(state->prefix);
780 else {
781 cp++;
782 if (starts_with(cp, state->prefix))
783 val = count_slashes(state->prefix) + 1;
784 }
785 }
786 free(name);
787 return val;
788 }
789
790 /*
791 * Does the ---/+++ line have the POSIX timestamp after the last HT?
792 * GNU diff puts epoch there to signal a creation/deletion event. Is
793 * this such a timestamp?
794 */
795 static int has_epoch_timestamp(const char *nameline)
796 {
797 /*
798 * We are only interested in epoch timestamp; any non-zero
799 * fraction cannot be one, hence "(\.0+)?" in the regexp below.
800 * For the same reason, the date must be either 1969-12-31 or
801 * 1970-01-01, and the seconds part must be "00".
802 */
803 const char stamp_regexp[] =
804 "^[0-2][0-9]:([0-5][0-9]):00(\\.0+)?"
805 " "
806 "([-+][0-2][0-9]:?[0-5][0-9])\n";
807 const char *timestamp = NULL, *cp, *colon;
808 static regex_t *stamp;
809 regmatch_t m[10];
810 int zoneoffset, epoch_hour, hour, minute;
811 int status;
812
813 for (cp = nameline; *cp != '\n'; cp++) {
814 if (*cp == '\t')
815 timestamp = cp + 1;
816 }
817 if (!timestamp)
818 return 0;
819
820 /*
821 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31
822 * (west of GMT) or 1970-01-01 (east of GMT)
823 */
824 if (skip_prefix(timestamp, "1969-12-31 ", &timestamp))
825 epoch_hour = 24;
826 else if (skip_prefix(timestamp, "1970-01-01 ", &timestamp))
827 epoch_hour = 0;
828 else
829 return 0;
830
831 if (!stamp) {
832 stamp = xmalloc(sizeof(*stamp));
833 if (regcomp(stamp, stamp_regexp, REG_EXTENDED)) {
834 warning(_("Cannot prepare timestamp regexp %s"),
835 stamp_regexp);
836 return 0;
837 }
838 }
839
840 status = regexec(stamp, timestamp, ARRAY_SIZE(m), m, 0);
841 if (status) {
842 if (status != REG_NOMATCH)
843 warning(_("regexec returned %d for input: %s"),
844 status, timestamp);
845 return 0;
846 }
847
848 hour = strtol(timestamp, NULL, 10);
849 minute = strtol(timestamp + m[1].rm_so, NULL, 10);
850
851 zoneoffset = strtol(timestamp + m[3].rm_so + 1, (char **) &colon, 10);
852 if (*colon == ':')
853 zoneoffset = zoneoffset * 60 + strtol(colon + 1, NULL, 10);
854 else
855 zoneoffset = (zoneoffset / 100) * 60 + (zoneoffset % 100);
856 if (timestamp[m[3].rm_so] == '-')
857 zoneoffset = -zoneoffset;
858
859 return hour * 60 + minute - zoneoffset == epoch_hour * 60;
860 }
861
862 /*
863 * Get the name etc info from the ---/+++ lines of a traditional patch header
864 *
865 * FIXME! The end-of-filename heuristics are kind of screwy. For existing
866 * files, we can happily check the index for a match, but for creating a
867 * new file we should try to match whatever "patch" does. I have no idea.
868 */
869 static int parse_traditional_patch(struct apply_state *state,
870 const char *first,
871 const char *second,
872 struct patch *patch)
873 {
874 char *name;
875
876 first += 4; /* skip "--- " */
877 second += 4; /* skip "+++ " */
878 if (!state->p_value_known) {
879 int p, q;
880 p = guess_p_value(state, first);
881 q = guess_p_value(state, second);
882 if (p < 0) p = q;
883 if (0 <= p && p == q) {
884 state->p_value = p;
885 state->p_value_known = 1;
886 }
887 }
888 if (is_dev_null(first)) {
889 patch->is_new = 1;
890 patch->is_delete = 0;
891 name = find_name_traditional(&state->root, second, NULL, state->p_value);
892 patch->new_name = name;
893 } else if (is_dev_null(second)) {
894 patch->is_new = 0;
895 patch->is_delete = 1;
896 name = find_name_traditional(&state->root, first, NULL, state->p_value);
897 patch->old_name = name;
898 } else {
899 char *first_name;
900 first_name = find_name_traditional(&state->root, first, NULL, state->p_value);
901 name = find_name_traditional(&state->root, second, first_name, state->p_value);
902 free(first_name);
903 if (has_epoch_timestamp(first)) {
904 patch->is_new = 1;
905 patch->is_delete = 0;
906 patch->new_name = name;
907 } else if (has_epoch_timestamp(second)) {
908 patch->is_new = 0;
909 patch->is_delete = 1;
910 patch->old_name = name;
911 } else {
912 patch->old_name = name;
913 patch->new_name = xstrdup_or_null(name);
914 }
915 }
916 if (!name)
917 return error(_("unable to find filename in patch at line %d"), state->linenr);
918
919 return 0;
920 }
921
922 static int gitdiff_hdrend(struct gitdiff_data *state UNUSED,
923 const char *line UNUSED,
924 struct patch *patch UNUSED)
925 {
926 return 1;
927 }
928
929 /*
930 * We're anal about diff header consistency, to make
931 * sure that we don't end up having strange ambiguous
932 * patches floating around.
933 *
934 * As a result, gitdiff_{old|new}name() will check
935 * their names against any previous information, just
936 * to make sure..
937 */
938 #define DIFF_OLD_NAME 0
939 #define DIFF_NEW_NAME 1
940
941 static int gitdiff_verify_name(struct gitdiff_data *state,
942 const char *line,
943 int isnull,
944 char **name,
945 int side)
946 {
947 if (!*name && !isnull) {
948 *name = find_name(state->root, line, NULL, state->p_value, TERM_TAB);
949 return 0;
950 }
951
952 if (*name) {
953 char *another;
954 if (isnull)
955 return error(_("git apply: bad git-diff - expected /dev/null, got %s on line %d"),
956 *name, state->linenr);
957 another = find_name(state->root, line, NULL, state->p_value, TERM_TAB);
958 if (!another || strcmp(another, *name)) {
959 free(another);
960 return error((side == DIFF_NEW_NAME) ?
961 _("git apply: bad git-diff - inconsistent new filename on line %d") :
962 _("git apply: bad git-diff - inconsistent old filename on line %d"), state->linenr);
963 }
964 free(another);
965 } else {
966 if (!is_dev_null(line))
967 return error(_("git apply: bad git-diff - expected /dev/null on line %d"), state->linenr);
968 }
969
970 return 0;
971 }
972
973 static int gitdiff_oldname(struct gitdiff_data *state,
974 const char *line,
975 struct patch *patch)
976 {
977 return gitdiff_verify_name(state, line,
978 patch->is_new, &patch->old_name,
979 DIFF_OLD_NAME);
980 }
981
982 static int gitdiff_newname(struct gitdiff_data *state,
983 const char *line,
984 struct patch *patch)
985 {
986 return gitdiff_verify_name(state, line,
987 patch->is_delete, &patch->new_name,
988 DIFF_NEW_NAME);
989 }
990
991 static int parse_mode_line(const char *line, int linenr, unsigned int *mode)
992 {
993 char *end;
994 *mode = strtoul(line, &end, 8);
995 if (end == line || !isspace(*end))
996 return error(_("invalid mode on line %d: %s"), linenr, line);
997 return 0;
998 }
999
1000 static int gitdiff_oldmode(struct gitdiff_data *state,
1001 const char *line,
1002 struct patch *patch)
1003 {
1004 return parse_mode_line(line, state->linenr, &patch->old_mode);
1005 }
1006
1007 static int gitdiff_newmode(struct gitdiff_data *state,
1008 const char *line,
1009 struct patch *patch)
1010 {
1011 return parse_mode_line(line, state->linenr, &patch->new_mode);
1012 }
1013
1014 static int gitdiff_delete(struct gitdiff_data *state,
1015 const char *line,
1016 struct patch *patch)
1017 {
1018 patch->is_delete = 1;
1019 free(patch->old_name);
1020 patch->old_name = xstrdup_or_null(patch->def_name);
1021 return gitdiff_oldmode(state, line, patch);
1022 }
1023
1024 static int gitdiff_newfile(struct gitdiff_data *state,
1025 const char *line,
1026 struct patch *patch)
1027 {
1028 patch->is_new = 1;
1029 free(patch->new_name);
1030 patch->new_name = xstrdup_or_null(patch->def_name);
1031 return gitdiff_newmode(state, line, patch);
1032 }
1033
1034 static int gitdiff_copysrc(struct gitdiff_data *state,
1035 const char *line,
1036 struct patch *patch)
1037 {
1038 patch->is_copy = 1;
1039 free(patch->old_name);
1040 patch->old_name = find_name(state->root, line, NULL, state->p_value ? state->p_value - 1 : 0, 0);
1041 return 0;
1042 }
1043
1044 static int gitdiff_copydst(struct gitdiff_data *state,
1045 const char *line,
1046 struct patch *patch)
1047 {
1048 patch->is_copy = 1;
1049 free(patch->new_name);
1050 patch->new_name = find_name(state->root, line, NULL, state->p_value ? state->p_value - 1 : 0, 0);
1051 return 0;
1052 }
1053
1054 static int gitdiff_renamesrc(struct gitdiff_data *state,
1055 const char *line,
1056 struct patch *patch)
1057 {
1058 patch->is_rename = 1;
1059 free(patch->old_name);
1060 patch->old_name = find_name(state->root, line, NULL, state->p_value ? state->p_value - 1 : 0, 0);
1061 return 0;
1062 }
1063
1064 static int gitdiff_renamedst(struct gitdiff_data *state,
1065 const char *line,
1066 struct patch *patch)
1067 {
1068 patch->is_rename = 1;
1069 free(patch->new_name);
1070 patch->new_name = find_name(state->root, line, NULL, state->p_value ? state->p_value - 1 : 0, 0);
1071 return 0;
1072 }
1073
1074 static int gitdiff_similarity(struct gitdiff_data *state UNUSED,
1075 const char *line,
1076 struct patch *patch)
1077 {
1078 unsigned long val = strtoul(line, NULL, 10);
1079 if (val <= 100)
1080 patch->score = val;
1081 return 0;
1082 }
1083
1084 static int gitdiff_dissimilarity(struct gitdiff_data *state UNUSED,
1085 const char *line,
1086 struct patch *patch)
1087 {
1088 unsigned long val = strtoul(line, NULL, 10);
1089 if (val <= 100)
1090 patch->score = val;
1091 return 0;
1092 }
1093
1094 static int gitdiff_index(struct gitdiff_data *state,
1095 const char *line,
1096 struct patch *patch)
1097 {
1098 /*
1099 * index line is N hexadecimal, "..", N hexadecimal,
1100 * and optional space with octal mode.
1101 */
1102 const char *ptr, *eol;
1103 int len;
1104 const unsigned hexsz = the_hash_algo->hexsz;
1105
1106 ptr = strchr(line, '.');
1107 if (!ptr || ptr[1] != '.' || hexsz < ptr - line)
1108 return 0;
1109 len = ptr - line;
1110 memcpy(patch->old_oid_prefix, line, len);
1111 patch->old_oid_prefix[len] = 0;
1112
1113 line = ptr + 2;
1114 ptr = strchr(line, ' ');
1115 eol = strchrnul(line, '\n');
1116
1117 if (!ptr || eol < ptr)
1118 ptr = eol;
1119 len = ptr - line;
1120
1121 if (hexsz < len)
1122 return 0;
1123 memcpy(patch->new_oid_prefix, line, len);
1124 patch->new_oid_prefix[len] = 0;
1125 if (*ptr == ' ')
1126 return gitdiff_oldmode(state, ptr + 1, patch);
1127 return 0;
1128 }
1129
1130 /*
1131 * This is normal for a diff that doesn't change anything: we'll fall through
1132 * into the next diff. Tell the parser to break out.
1133 */
1134 static int gitdiff_unrecognized(struct gitdiff_data *state UNUSED,
1135 const char *line UNUSED,
1136 struct patch *patch UNUSED)
1137 {
1138 return 1;
1139 }
1140
1141 /*
1142 * Skip p_value leading components from "line"; as we do not accept
1143 * absolute paths, return NULL in that case.
1144 */
1145 static const char *skip_tree_prefix(int p_value,
1146 const char *line,
1147 int llen)
1148 {
1149 int nslash;
1150 int i;
1151
1152 if (!p_value)
1153 return (llen && line[0] == '/') ? NULL : line;
1154
1155 nslash = p_value;
1156 for (i = 0; i < llen; i++) {
1157 int ch = line[i];
1158 if (ch == '/' && --nslash <= 0)
1159 return (i == 0) ? NULL : &line[i + 1];
1160 }
1161 return NULL;
1162 }
1163
1164 /*
1165 * This is to extract the same name that appears on "diff --git"
1166 * line. We do not find and return anything if it is a rename
1167 * patch, and it is OK because we will find the name elsewhere.
1168 * We need to reliably find name only when it is mode-change only,
1169 * creation or deletion of an empty file. In any of these cases,
1170 * both sides are the same name under a/ and b/ respectively.
1171 */
1172 static char *git_header_name(int p_value,
1173 const char *line,
1174 int llen)
1175 {
1176 const char *name;
1177 const char *second = NULL;
1178 size_t len, line_len;
1179
1180 line += strlen("diff --git ");
1181 llen -= strlen("diff --git ");
1182
1183 if (*line == '"') {
1184 const char *cp;
1185 struct strbuf first = STRBUF_INIT;
1186 struct strbuf sp = STRBUF_INIT;
1187
1188 if (unquote_c_style(&first, line, &second))
1189 goto free_and_fail1;
1190
1191 /* strip the a/b prefix including trailing slash */
1192 cp = skip_tree_prefix(p_value, first.buf, first.len);
1193 if (!cp)
1194 goto free_and_fail1;
1195 strbuf_remove(&first, 0, cp - first.buf);
1196
1197 /*
1198 * second points at one past closing dq of name.
1199 * find the second name.
1200 */
1201 while ((second < line + llen) && isspace(*second))
1202 second++;
1203
1204 if (line + llen <= second)
1205 goto free_and_fail1;
1206 if (*second == '"') {
1207 if (unquote_c_style(&sp, second, NULL))
1208 goto free_and_fail1;
1209 cp = skip_tree_prefix(p_value, sp.buf, sp.len);
1210 if (!cp)
1211 goto free_and_fail1;
1212 /* They must match, otherwise ignore */
1213 if (strcmp(cp, first.buf))
1214 goto free_and_fail1;
1215 strbuf_release(&sp);
1216 return strbuf_detach(&first, NULL);
1217 }
1218
1219 /* unquoted second */
1220 cp = skip_tree_prefix(p_value, second, line + llen - second);
1221 if (!cp)
1222 goto free_and_fail1;
1223 if (line + llen - cp != first.len ||
1224 memcmp(first.buf, cp, first.len))
1225 goto free_and_fail1;
1226 return strbuf_detach(&first, NULL);
1227
1228 free_and_fail1:
1229 strbuf_release(&first);
1230 strbuf_release(&sp);
1231 return NULL;
1232 }
1233
1234 /* unquoted first name */
1235 name = skip_tree_prefix(p_value, line, llen);
1236 if (!name)
1237 return NULL;
1238
1239 /*
1240 * since the first name is unquoted, a dq if exists must be
1241 * the beginning of the second name.
1242 */
1243 for (second = name; second < line + llen; second++) {
1244 if (*second == '"') {
1245 struct strbuf sp = STRBUF_INIT;
1246 const char *np;
1247
1248 if (unquote_c_style(&sp, second, NULL))
1249 goto free_and_fail2;
1250
1251 np = skip_tree_prefix(p_value, sp.buf, sp.len);
1252 if (!np)
1253 goto free_and_fail2;
1254
1255 len = sp.buf + sp.len - np;
1256 if (len < second - name &&
1257 !strncmp(np, name, len) &&
1258 isspace(name[len])) {
1259 /* Good */
1260 strbuf_remove(&sp, 0, np - sp.buf);
1261 return strbuf_detach(&sp, NULL);
1262 }
1263
1264 free_and_fail2:
1265 strbuf_release(&sp);
1266 return NULL;
1267 }
1268 }
1269
1270 /*
1271 * Accept a name only if it shows up twice, exactly the same
1272 * form.
1273 */
1274 second = strchr(name, '\n');
1275 if (!second)
1276 return NULL;
1277 line_len = second - name;
1278 for (len = 0 ; ; len++) {
1279 switch (name[len]) {
1280 default:
1281 continue;
1282 case '\n':
1283 return NULL;
1284 case '\t': case ' ':
1285 /*
1286 * Is this the separator between the preimage
1287 * and the postimage pathname? Again, we are
1288 * only interested in the case where there is
1289 * no rename, as this is only to set def_name
1290 * and a rename patch has the names elsewhere
1291 * in an unambiguous form.
1292 */
1293 if (!name[len + 1])
1294 return NULL; /* no postimage name */
1295 second = skip_tree_prefix(p_value, name + len + 1,
1296 line_len - (len + 1));
1297 if (!second)
1298 return NULL;
1299 /*
1300 * Does len bytes starting at "name" and "second"
1301 * (that are separated by one HT or SP we just
1302 * found) exactly match?
1303 */
1304 if (second[len] == '\n' && !strncmp(name, second, len))
1305 return xmemdupz(name, len);
1306 }
1307 }
1308 }
1309
1310 static int check_header_line(int linenr, struct patch *patch)
1311 {
1312 int extensions = (patch->is_delete == 1) + (patch->is_new == 1) +
1313 (patch->is_rename == 1) + (patch->is_copy == 1);
1314 if (extensions > 1)
1315 return error(_("inconsistent header lines %d and %d"),
1316 patch->extension_linenr, linenr);
1317 if (extensions && !patch->extension_linenr)
1318 patch->extension_linenr = linenr;
1319 return 0;
1320 }
1321
1322 int parse_git_diff_header(struct strbuf *root,
1323 int *linenr,
1324 int p_value,
1325 const char *line,
1326 int len,
1327 unsigned int size,
1328 struct patch *patch)
1329 {
1330 unsigned long offset;
1331 struct gitdiff_data parse_hdr_state;
1332
1333 /* A git diff has explicit new/delete information, so we don't guess */
1334 patch->is_new = 0;
1335 patch->is_delete = 0;
1336
1337 /*
1338 * Some things may not have the old name in the
1339 * rest of the headers anywhere (pure mode changes,
1340 * or removing or adding empty files), so we get
1341 * the default name from the header.
1342 */
1343 patch->def_name = git_header_name(p_value, line, len);
1344 if (patch->def_name && root->len) {
1345 char *s = xstrfmt("%s%s", root->buf, patch->def_name);
1346 free(patch->def_name);
1347 patch->def_name = s;
1348 }
1349
1350 line += len;
1351 size -= len;
1352 (*linenr)++;
1353 parse_hdr_state.root = root;
1354 parse_hdr_state.linenr = *linenr;
1355 parse_hdr_state.p_value = p_value;
1356
1357 for (offset = len ; size > 0 ; offset += len, size -= len, line += len, (*linenr)++) {
1358 static const struct opentry {
1359 const char *str;
1360 int (*fn)(struct gitdiff_data *, const char *, struct patch *);
1361 } optable[] = {
1362 { "@@ -", gitdiff_hdrend },
1363 { "--- ", gitdiff_oldname },
1364 { "+++ ", gitdiff_newname },
1365 { "old mode ", gitdiff_oldmode },
1366 { "new mode ", gitdiff_newmode },
1367 { "deleted file mode ", gitdiff_delete },
1368 { "new file mode ", gitdiff_newfile },
1369 { "copy from ", gitdiff_copysrc },
1370 { "copy to ", gitdiff_copydst },
1371 { "rename old ", gitdiff_renamesrc },
1372 { "rename new ", gitdiff_renamedst },
1373 { "rename from ", gitdiff_renamesrc },
1374 { "rename to ", gitdiff_renamedst },
1375 { "similarity index ", gitdiff_similarity },
1376 { "dissimilarity index ", gitdiff_dissimilarity },
1377 { "index ", gitdiff_index },
1378 { "", gitdiff_unrecognized },
1379 };
1380 int i;
1381
1382 len = linelen(line, size);
1383 if (!len || line[len-1] != '\n')
1384 break;
1385 for (i = 0; i < ARRAY_SIZE(optable); i++) {
1386 const struct opentry *p = optable + i;
1387 int oplen = strlen(p->str);
1388 int res;
1389 if (len < oplen || memcmp(p->str, line, oplen))
1390 continue;
1391 res = p->fn(&parse_hdr_state, line + oplen, patch);
1392 if (res < 0)
1393 return -1;
1394 if (check_header_line(*linenr, patch))
1395 return -1;
1396 if (res > 0)
1397 goto done;
1398 break;
1399 }
1400 }
1401
1402 done:
1403 if (!patch->old_name && !patch->new_name) {
1404 if (!patch->def_name) {
1405 error(Q_("git diff header lacks filename information when removing "
1406 "%d leading pathname component (line %d)",
1407 "git diff header lacks filename information when removing "
1408 "%d leading pathname components (line %d)",
1409 parse_hdr_state.p_value),
1410 parse_hdr_state.p_value, *linenr);
1411 return -128;
1412 }
1413 patch->old_name = xstrdup(patch->def_name);
1414 patch->new_name = xstrdup(patch->def_name);
1415 }
1416 if ((!patch->new_name && !patch->is_delete) ||
1417 (!patch->old_name && !patch->is_new)) {
1418 error(_("git diff header lacks filename information "
1419 "(line %d)"), *linenr);
1420 return -128;
1421 }
1422 patch->is_toplevel_relative = 1;
1423 return offset;
1424 }
1425
1426 static int parse_num(const char *line, unsigned long *p)
1427 {
1428 char *ptr;
1429
1430 if (!isdigit(*line))
1431 return 0;
1432 *p = strtoul(line, &ptr, 10);
1433 return ptr - line;
1434 }
1435
1436 static int parse_range(const char *line, int len, int offset, const char *expect,
1437 unsigned long *p1, unsigned long *p2)
1438 {
1439 int digits, ex;
1440
1441 if (offset < 0 || offset >= len)
1442 return -1;
1443 line += offset;
1444 len -= offset;
1445
1446 digits = parse_num(line, p1);
1447 if (!digits)
1448 return -1;
1449
1450 offset += digits;
1451 line += digits;
1452 len -= digits;
1453
1454 *p2 = 1;
1455 if (*line == ',') {
1456 digits = parse_num(line+1, p2);
1457 if (!digits)
1458 return -1;
1459
1460 offset += digits+1;
1461 line += digits+1;
1462 len -= digits+1;
1463 }
1464
1465 ex = strlen(expect);
1466 if (ex > len)
1467 return -1;
1468 if (memcmp(line, expect, ex))
1469 return -1;
1470
1471 return offset + ex;
1472 }
1473
1474 static void recount_diff(const char *line, int size, struct fragment *fragment)
1475 {
1476 int oldlines = 0, newlines = 0, ret = 0;
1477
1478 if (size < 1) {
1479 warning("recount: ignore empty hunk");
1480 return;
1481 }
1482
1483 for (;;) {
1484 int len = linelen(line, size);
1485 size -= len;
1486 line += len;
1487
1488 if (size < 1)
1489 break;
1490
1491 switch (*line) {
1492 case ' ': case '\n':
1493 newlines++;
1494 /* fall through */
1495 case '-':
1496 oldlines++;
1497 continue;
1498 case '+':
1499 newlines++;
1500 continue;
1501 case '\\':
1502 continue;
1503 case '@':
1504 ret = size < 3 || !starts_with(line, "@@ ");
1505 break;
1506 case 'd':
1507 ret = size < 5 || !starts_with(line, "diff ");
1508 break;
1509 default:
1510 ret = -1;
1511 break;
1512 }
1513 if (ret) {
1514 warning(_("recount: unexpected line: %.*s"),
1515 (int)linelen(line, size), line);
1516 return;
1517 }
1518 break;
1519 }
1520 fragment->oldlines = oldlines;
1521 fragment->newlines = newlines;
1522 }
1523
1524 /*
1525 * Parse a unified diff fragment header of the
1526 * form "@@ -a,b +c,d @@"
1527 */
1528 static int parse_fragment_header(const char *line, int len, struct fragment *fragment)
1529 {
1530 int offset;
1531
1532 if (!len || line[len-1] != '\n')
1533 return -1;
1534
1535 /* Figure out the number of lines in a fragment */
1536 offset = parse_range(line, len, 4, " +", &fragment->oldpos, &fragment->oldlines);
1537 offset = parse_range(line, len, offset, " @@", &fragment->newpos, &fragment->newlines);
1538
1539 return offset;
1540 }
1541
1542 /*
1543 * Find file diff header
1544 *
1545 * Returns:
1546 * -1 if no header was found
1547 * -128 in case of error
1548 * the size of the header in bytes (called "offset") otherwise
1549 */
1550 static int find_header(struct apply_state *state,
1551 const char *line,
1552 unsigned long size,
1553 int *hdrsize,
1554 struct patch *patch)
1555 {
1556 unsigned long offset, len;
1557
1558 patch->is_toplevel_relative = 0;
1559 patch->is_rename = patch->is_copy = 0;
1560 patch->is_new = patch->is_delete = -1;
1561 patch->old_mode = patch->new_mode = 0;
1562 patch->old_name = patch->new_name = NULL;
1563 for (offset = 0; size > 0; offset += len, size -= len, line += len, state->linenr++) {
1564 unsigned long nextlen;
1565
1566 len = linelen(line, size);
1567 if (!len)
1568 break;
1569
1570 /* Testing this early allows us to take a few shortcuts.. */
1571 if (len < 6)
1572 continue;
1573
1574 /*
1575 * Make sure we don't find any unconnected patch fragments.
1576 * That's a sign that we didn't find a header, and that a
1577 * patch has become corrupted/broken up.
1578 */
1579 if (!memcmp("@@ -", line, 4)) {
1580 struct fragment dummy;
1581 if (parse_fragment_header(line, len, &dummy) < 0)
1582 continue;
1583 error(_("patch fragment without header at line %d: %.*s"),
1584 state->linenr, (int)len-1, line);
1585 return -128;
1586 }
1587
1588 if (size < len + 6)
1589 break;
1590
1591 /*
1592 * Git patch? It might not have a real patch, just a rename
1593 * or mode change, so we handle that specially
1594 */
1595 if (!memcmp("diff --git ", line, 11)) {
1596 int git_hdr_len = parse_git_diff_header(&state->root, &state->linenr,
1597 state->p_value, line, len,
1598 size, patch);
1599 if (git_hdr_len < 0)
1600 return -128;
1601 if (git_hdr_len <= len)
1602 continue;
1603 *hdrsize = git_hdr_len;
1604 return offset;
1605 }
1606
1607 /* --- followed by +++ ? */
1608 if (memcmp("--- ", line, 4) || memcmp("+++ ", line + len, 4))
1609 continue;
1610
1611 /*
1612 * We only accept unified patches, so we want it to
1613 * at least have "@@ -a,b +c,d @@\n", which is 14 chars
1614 * minimum ("@@ -0,0 +1 @@\n" is the shortest).
1615 */
1616 nextlen = linelen(line + len, size - len);
1617 if (size < nextlen + 14 || memcmp("@@ -", line + len + nextlen, 4))
1618 continue;
1619
1620 /* Ok, we'll consider it a patch */
1621 if (parse_traditional_patch(state, line, line+len, patch))
1622 return -128;
1623 *hdrsize = len + nextlen;
1624 state->linenr += 2;
1625 return offset;
1626 }
1627 return -1;
1628 }
1629
1630 static void record_ws_error(struct apply_state *state,
1631 unsigned result,
1632 const char *line,
1633 int len,
1634 int linenr)
1635 {
1636 char *err;
1637
1638 if (!result)
1639 return;
1640
1641 state->whitespace_error++;
1642 if (state->squelch_whitespace_errors &&
1643 state->squelch_whitespace_errors < state->whitespace_error)
1644 return;
1645
1646 err = whitespace_error_string(result);
1647 if (state->apply_verbosity > verbosity_silent)
1648 fprintf(stderr, "%s:%d: %s.\n%.*s\n",
1649 state->patch_input_file, linenr, err, len, line);
1650 free(err);
1651 }
1652
1653 static void check_whitespace(struct apply_state *state,
1654 const char *line,
1655 int len,
1656 unsigned ws_rule)
1657 {
1658 unsigned result = ws_check(line + 1, len - 1, ws_rule);
1659
1660 record_ws_error(state, result, line + 1, len - 2, state->linenr);
1661 }
1662
1663 /*
1664 * Check if the patch has context lines with CRLF or
1665 * the patch wants to remove lines with CRLF.
1666 */
1667 static void check_old_for_crlf(struct patch *patch, const char *line, int len)
1668 {
1669 if (len >= 2 && line[len-1] == '\n' && line[len-2] == '\r') {
1670 patch->ws_rule |= WS_CR_AT_EOL;
1671 patch->crlf_in_old = 1;
1672 }
1673 }
1674
1675
1676 /*
1677 * Parse a unified diff. Note that this really needs to parse each
1678 * fragment separately, since the only way to know the difference
1679 * between a "---" that is part of a patch, and a "---" that starts
1680 * the next patch is to look at the line counts..
1681 */
1682 static int parse_fragment(struct apply_state *state,
1683 const char *line,
1684 unsigned long size,
1685 struct patch *patch,
1686 struct fragment *fragment)
1687 {
1688 int added, deleted;
1689 int len = linelen(line, size), offset;
1690 unsigned long oldlines, newlines;
1691 unsigned long leading, trailing;
1692
1693 offset = parse_fragment_header(line, len, fragment);
1694 if (offset < 0)
1695 return -1;
1696 if (offset > 0 && patch->recount)
1697 recount_diff(line + offset, size - offset, fragment);
1698 oldlines = fragment->oldlines;
1699 newlines = fragment->newlines;
1700 leading = 0;
1701 trailing = 0;
1702
1703 /* Parse the thing.. */
1704 line += len;
1705 size -= len;
1706 state->linenr++;
1707 added = deleted = 0;
1708 for (offset = len;
1709 0 < size;
1710 offset += len, size -= len, line += len, state->linenr++) {
1711 if (!oldlines && !newlines)
1712 break;
1713 len = linelen(line, size);
1714 if (!len || line[len-1] != '\n')
1715 return -1;
1716 switch (*line) {
1717 default:
1718 return -1;
1719 case '\n': /* newer GNU diff, an empty context line */
1720 case ' ':
1721 oldlines--;
1722 newlines--;
1723 if (!deleted && !added)
1724 leading++;
1725 trailing++;
1726 check_old_for_crlf(patch, line, len);
1727 if (!state->apply_in_reverse &&
1728 state->ws_error_action == correct_ws_error)
1729 check_whitespace(state, line, len, patch->ws_rule);
1730 break;
1731 case '-':
1732 if (!state->apply_in_reverse)
1733 check_old_for_crlf(patch, line, len);
1734 if (state->apply_in_reverse &&
1735 state->ws_error_action != nowarn_ws_error)
1736 check_whitespace(state, line, len, patch->ws_rule);
1737 deleted++;
1738 oldlines--;
1739 trailing = 0;
1740 break;
1741 case '+':
1742 if (state->apply_in_reverse)
1743 check_old_for_crlf(patch, line, len);
1744 if (!state->apply_in_reverse &&
1745 state->ws_error_action != nowarn_ws_error)
1746 check_whitespace(state, line, len, patch->ws_rule);
1747 added++;
1748 newlines--;
1749 trailing = 0;
1750 break;
1751
1752 /*
1753 * We allow "\ No newline at end of file". Depending
1754 * on locale settings when the patch was produced we
1755 * don't know what this line looks like. The only
1756 * thing we do know is that it begins with "\ ".
1757 * Checking for 12 is just for sanity check -- any
1758 * l10n of "\ No newline..." is at least that long.
1759 */
1760 case '\\':
1761 if (len < 12 || memcmp(line, "\\ ", 2))
1762 return -1;
1763 break;
1764 }
1765 }
1766 if (oldlines || newlines)
1767 return -1;
1768 if (!patch->recount && !deleted && !added)
1769 return -1;
1770
1771 fragment->leading = leading;
1772 fragment->trailing = trailing;
1773
1774 /*
1775 * If a fragment ends with an incomplete line, we failed to include
1776 * it in the above loop because we hit oldlines == newlines == 0
1777 * before seeing it.
1778 */
1779 if (12 < size && !memcmp(line, "\\ ", 2))
1780 offset += linelen(line, size);
1781
1782 patch->lines_added += added;
1783 patch->lines_deleted += deleted;
1784
1785 if (0 < patch->is_new && oldlines)
1786 return error(_("new file depends on old contents"));
1787 if (0 < patch->is_delete && newlines)
1788 return error(_("deleted file still has contents"));
1789 return offset;
1790 }
1791
1792 /*
1793 * We have seen "diff --git a/... b/..." header (or a traditional patch
1794 * header). Read hunks that belong to this patch into fragments and hang
1795 * them to the given patch structure.
1796 *
1797 * The (fragment->patch, fragment->size) pair points into the memory given
1798 * by the caller, not a copy, when we return.
1799 *
1800 * Returns:
1801 * -1 in case of error,
1802 * the number of bytes in the patch otherwise.
1803 */
1804 static int parse_single_patch(struct apply_state *state,
1805 const char *line,
1806 unsigned long size,
1807 struct patch *patch)
1808 {
1809 unsigned long offset = 0;
1810 unsigned long oldlines = 0, newlines = 0, context = 0;
1811 struct fragment **fragp = &patch->fragments;
1812
1813 while (size > 4 && !memcmp(line, "@@ -", 4)) {
1814 struct fragment *fragment;
1815 int len;
1816
1817 CALLOC_ARRAY(fragment, 1);
1818 fragment->linenr = state->linenr;
1819 len = parse_fragment(state, line, size, patch, fragment);
1820 if (len <= 0) {
1821 free(fragment);
1822 return error(_("corrupt patch at line %d"), state->linenr);
1823 }
1824 fragment->patch = line;
1825 fragment->size = len;
1826 oldlines += fragment->oldlines;
1827 newlines += fragment->newlines;
1828 context += fragment->leading + fragment->trailing;
1829
1830 *fragp = fragment;
1831 fragp = &fragment->next;
1832
1833 offset += len;
1834 line += len;
1835 size -= len;
1836 }
1837
1838 /*
1839 * If something was removed (i.e. we have old-lines) it cannot
1840 * be creation, and if something was added it cannot be
1841 * deletion. However, the reverse is not true; --unified=0
1842 * patches that only add are not necessarily creation even
1843 * though they do not have any old lines, and ones that only
1844 * delete are not necessarily deletion.
1845 *
1846 * Unfortunately, a real creation/deletion patch do _not_ have
1847 * any context line by definition, so we cannot safely tell it
1848 * apart with --unified=0 insanity. At least if the patch has
1849 * more than one hunk it is not creation or deletion.
1850 */
1851 if (patch->is_new < 0 &&
1852 (oldlines || (patch->fragments && patch->fragments->next)))
1853 patch->is_new = 0;
1854 if (patch->is_delete < 0 &&
1855 (newlines || (patch->fragments && patch->fragments->next)))
1856 patch->is_delete = 0;
1857
1858 if (0 < patch->is_new && oldlines)
1859 return error(_("new file %s depends on old contents"), patch->new_name);
1860 if (0 < patch->is_delete && newlines)
1861 return error(_("deleted file %s still has contents"), patch->old_name);
1862 if (!patch->is_delete && !newlines && context && state->apply_verbosity > verbosity_silent)
1863 fprintf_ln(stderr,
1864 _("** warning: "
1865 "file %s becomes empty but is not deleted"),
1866 patch->new_name);
1867
1868 return offset;
1869 }
1870
1871 static inline int metadata_changes(struct patch *patch)
1872 {
1873 return patch->is_rename > 0 ||
1874 patch->is_copy > 0 ||
1875 patch->is_new > 0 ||
1876 patch->is_delete ||
1877 (patch->old_mode && patch->new_mode &&
1878 patch->old_mode != patch->new_mode);
1879 }
1880
1881 static char *inflate_it(const void *data, unsigned long size,
1882 unsigned long inflated_size)
1883 {
1884 git_zstream stream;
1885 void *out;
1886 int st;
1887
1888 memset(&stream, 0, sizeof(stream));
1889
1890 stream.next_in = (unsigned char *)data;
1891 stream.avail_in = size;
1892 stream.next_out = out = xmalloc(inflated_size);
1893 stream.avail_out = inflated_size;
1894 git_inflate_init(&stream);
1895 st = git_inflate(&stream, Z_FINISH);
1896 git_inflate_end(&stream);
1897 if ((st != Z_STREAM_END) || stream.total_out != inflated_size) {
1898 free(out);
1899 return NULL;
1900 }
1901 return out;
1902 }
1903
1904 /*
1905 * Read a binary hunk and return a new fragment; fragment->patch
1906 * points at an allocated memory that the caller must free, so
1907 * it is marked as "->free_patch = 1".
1908 */
1909 static struct fragment *parse_binary_hunk(struct apply_state *state,
1910 char **buf_p,
1911 unsigned long *sz_p,
1912 int *status_p,
1913 int *used_p)
1914 {
1915 /*
1916 * Expect a line that begins with binary patch method ("literal"
1917 * or "delta"), followed by the length of data before deflating.
1918 * a sequence of 'length-byte' followed by base-85 encoded data
1919 * should follow, terminated by a newline.
1920 *
1921 * Each 5-byte sequence of base-85 encodes up to 4 bytes,
1922 * and we would limit the patch line to 66 characters,
1923 * so one line can fit up to 13 groups that would decode
1924 * to 52 bytes max. The length byte 'A'-'Z' corresponds
1925 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.
1926 */
1927 int llen, used;
1928 unsigned long size = *sz_p;
1929 char *buffer = *buf_p;
1930 int patch_method;
1931 unsigned long origlen;
1932 char *data = NULL;
1933 int hunk_size = 0;
1934 struct fragment *frag;
1935
1936 llen = linelen(buffer, size);
1937 used = llen;
1938
1939 *status_p = 0;
1940
1941 if (starts_with(buffer, "delta ")) {
1942 patch_method = BINARY_DELTA_DEFLATED;
1943 origlen = strtoul(buffer + 6, NULL, 10);
1944 }
1945 else if (starts_with(buffer, "literal ")) {
1946 patch_method = BINARY_LITERAL_DEFLATED;
1947 origlen = strtoul(buffer + 8, NULL, 10);
1948 }
1949 else
1950 return NULL;
1951
1952 state->linenr++;
1953 buffer += llen;
1954 size -= llen;
1955 while (1) {
1956 int byte_length, max_byte_length, newsize;
1957 llen = linelen(buffer, size);
1958 used += llen;
1959 state->linenr++;
1960 if (llen == 1) {
1961 /* consume the blank line */
1962 buffer++;
1963 size--;
1964 break;
1965 }
1966 /*
1967 * Minimum line is "A00000\n" which is 7-byte long,
1968 * and the line length must be multiple of 5 plus 2.
1969 */
1970 if ((llen < 7) || (llen-2) % 5)
1971 goto corrupt;
1972 max_byte_length = (llen - 2) / 5 * 4;
1973 byte_length = *buffer;
1974 if ('A' <= byte_length && byte_length <= 'Z')
1975 byte_length = byte_length - 'A' + 1;
1976 else if ('a' <= byte_length && byte_length <= 'z')
1977 byte_length = byte_length - 'a' + 27;
1978 else
1979 goto corrupt;
1980 /* if the input length was not multiple of 4, we would
1981 * have filler at the end but the filler should never
1982 * exceed 3 bytes
1983 */
1984 if (max_byte_length < byte_length ||
1985 byte_length <= max_byte_length - 4)
1986 goto corrupt;
1987 newsize = hunk_size + byte_length;
1988 data = xrealloc(data, newsize);
1989 if (decode_85(data + hunk_size, buffer + 1, byte_length))
1990 goto corrupt;
1991 hunk_size = newsize;
1992 buffer += llen;
1993 size -= llen;
1994 }
1995
1996 CALLOC_ARRAY(frag, 1);
1997 frag->patch = inflate_it(data, hunk_size, origlen);
1998 frag->free_patch = 1;
1999 if (!frag->patch)
2000 goto corrupt;
2001 free(data);
2002 frag->size = origlen;
2003 *buf_p = buffer;
2004 *sz_p = size;
2005 *used_p = used;
2006 frag->binary_patch_method = patch_method;
2007 return frag;
2008
2009 corrupt:
2010 free(data);
2011 *status_p = -1;
2012 error(_("corrupt binary patch at line %d: %.*s"),
2013 state->linenr-1, llen-1, buffer);
2014 return NULL;
2015 }
2016
2017 /*
2018 * Returns:
2019 * -1 in case of error,
2020 * the length of the parsed binary patch otherwise
2021 */
2022 static int parse_binary(struct apply_state *state,
2023 char *buffer,
2024 unsigned long size,
2025 struct patch *patch)
2026 {
2027 /*
2028 * We have read "GIT binary patch\n"; what follows is a line
2029 * that says the patch method (currently, either "literal" or
2030 * "delta") and the length of data before deflating; a
2031 * sequence of 'length-byte' followed by base-85 encoded data
2032 * follows.
2033 *
2034 * When a binary patch is reversible, there is another binary
2035 * hunk in the same format, starting with patch method (either
2036 * "literal" or "delta") with the length of data, and a sequence
2037 * of length-byte + base-85 encoded data, terminated with another
2038 * empty line. This data, when applied to the postimage, produces
2039 * the preimage.
2040 */
2041 struct fragment *forward;
2042 struct fragment *reverse;
2043 int status;
2044 int used, used_1;
2045
2046 forward = parse_binary_hunk(state, &buffer, &size, &status, &used);
2047 if (!forward && !status)
2048 /* there has to be one hunk (forward hunk) */
2049 return error(_("unrecognized binary patch at line %d"), state->linenr-1);
2050 if (status)
2051 /* otherwise we already gave an error message */
2052 return status;
2053
2054 reverse = parse_binary_hunk(state, &buffer, &size, &status, &used_1);
2055 if (reverse)
2056 used += used_1;
2057 else if (status) {
2058 /*
2059 * Not having reverse hunk is not an error, but having
2060 * a corrupt reverse hunk is.
2061 */
2062 free((void*) forward->patch);
2063 free(forward);
2064 return status;
2065 }
2066 forward->next = reverse;
2067 patch->fragments = forward;
2068 patch->is_binary = 1;
2069 return used;
2070 }
2071
2072 static void prefix_one(struct apply_state *state, char **name)
2073 {
2074 char *old_name = *name;
2075 if (!old_name)
2076 return;
2077 *name = prefix_filename(state->prefix, *name);
2078 free(old_name);
2079 }
2080
2081 static void prefix_patch(struct apply_state *state, struct patch *p)
2082 {
2083 if (!state->prefix || p->is_toplevel_relative)
2084 return;
2085 prefix_one(state, &p->new_name);
2086 prefix_one(state, &p->old_name);
2087 }
2088
2089 /*
2090 * include/exclude
2091 */
2092
2093 static void add_name_limit(struct apply_state *state,
2094 const char *name,
2095 int exclude)
2096 {
2097 struct string_list_item *it;
2098
2099 it = string_list_append(&state->limit_by_name, name);
2100 it->util = exclude ? NULL : (void *) 1;
2101 }
2102
2103 static int use_patch(struct apply_state *state, struct patch *p)
2104 {
2105 const char *pathname = p->new_name ? p->new_name : p->old_name;
2106 int i;
2107
2108 /* Paths outside are not touched regardless of "--include" */
2109 if (state->prefix && *state->prefix) {
2110 const char *rest;
2111 if (!skip_prefix(pathname, state->prefix, &rest) || !*rest)
2112 return 0;
2113 }
2114
2115 /* See if it matches any of exclude/include rule */
2116 for (i = 0; i < state->limit_by_name.nr; i++) {
2117 struct string_list_item *it = &state->limit_by_name.items[i];
2118 if (!wildmatch(it->string, pathname, 0))
2119 return (it->util != NULL);
2120 }
2121
2122 /*
2123 * If we had any include, a path that does not match any rule is
2124 * not used. Otherwise, we saw bunch of exclude rules (or none)
2125 * and such a path is used.
2126 */
2127 return !state->has_include;
2128 }
2129
2130 /*
2131 * Read the patch text in "buffer" that extends for "size" bytes; stop
2132 * reading after seeing a single patch (i.e. changes to a single file).
2133 * Create fragments (i.e. patch hunks) and hang them to the given patch.
2134 *
2135 * Returns:
2136 * -1 if no header was found or parse_binary() failed,
2137 * -128 on another error,
2138 * the number of bytes consumed otherwise,
2139 * so that the caller can call us again for the next patch.
2140 */
2141 static int parse_chunk(struct apply_state *state, char *buffer, unsigned long size, struct patch *patch)
2142 {
2143 int hdrsize, patchsize;
2144 int offset = find_header(state, buffer, size, &hdrsize, patch);
2145
2146 if (offset < 0)
2147 return offset;
2148
2149 prefix_patch(state, patch);
2150
2151 if (!use_patch(state, patch))
2152 patch->ws_rule = 0;
2153 else if (patch->new_name)
2154 patch->ws_rule = whitespace_rule(state->repo->index,
2155 patch->new_name);
2156 else
2157 patch->ws_rule = whitespace_rule(state->repo->index,
2158 patch->old_name);
2159
2160 patchsize = parse_single_patch(state,
2161 buffer + offset + hdrsize,
2162 size - offset - hdrsize,
2163 patch);
2164
2165 if (patchsize < 0)
2166 return -128;
2167
2168 if (!patchsize) {
2169 static const char git_binary[] = "GIT binary patch\n";
2170 int hd = hdrsize + offset;
2171 unsigned long llen = linelen(buffer + hd, size - hd);
2172
2173 if (llen == sizeof(git_binary) - 1 &&
2174 !memcmp(git_binary, buffer + hd, llen)) {
2175 int used;
2176 state->linenr++;
2177 used = parse_binary(state, buffer + hd + llen,
2178 size - hd - llen, patch);
2179 if (used < 0)
2180 return -1;
2181 if (used)
2182 patchsize = used + llen;
2183 else
2184 patchsize = 0;
2185 }
2186 else if (!memcmp(" differ\n", buffer + hd + llen - 8, 8)) {
2187 static const char *binhdr[] = {
2188 "Binary files ",
2189 "Files ",
2190 NULL,
2191 };
2192 int i;
2193 for (i = 0; binhdr[i]; i++) {
2194 int len = strlen(binhdr[i]);
2195 if (len < size - hd &&
2196 !memcmp(binhdr[i], buffer + hd, len)) {
2197 state->linenr++;
2198 patch->is_binary = 1;
2199 patchsize = llen;
2200 break;
2201 }
2202 }
2203 }
2204
2205 /* Empty patch cannot be applied if it is a text patch
2206 * without metadata change. A binary patch appears
2207 * empty to us here.
2208 */
2209 if ((state->apply || state->check) &&
2210 (!patch->is_binary && !metadata_changes(patch))) {
2211 error(_("patch with only garbage at line %d"), state->linenr);
2212 return -128;
2213 }
2214 }
2215
2216 return offset + hdrsize + patchsize;
2217 }
2218
2219 static void reverse_patches(struct patch *p)
2220 {
2221 for (; p; p = p->next) {
2222 struct fragment *frag = p->fragments;
2223
2224 SWAP(p->new_name, p->old_name);
2225 SWAP(p->new_mode, p->old_mode);
2226 SWAP(p->is_new, p->is_delete);
2227 SWAP(p->lines_added, p->lines_deleted);
2228 SWAP(p->old_oid_prefix, p->new_oid_prefix);
2229
2230 for (; frag; frag = frag->next) {
2231 SWAP(frag->newpos, frag->oldpos);
2232 SWAP(frag->newlines, frag->oldlines);
2233 }
2234 }
2235 }
2236
2237 static const char pluses[] =
2238 "++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";
2239 static const char minuses[]=
2240 "----------------------------------------------------------------------";
2241
2242 static void show_stats(struct apply_state *state, struct patch *patch)
2243 {
2244 struct strbuf qname = STRBUF_INIT;
2245 char *cp = patch->new_name ? patch->new_name : patch->old_name;
2246 int max, add, del;
2247
2248 quote_c_style(cp, &qname, NULL, 0);
2249
2250 /*
2251 * "scale" the filename
2252 */
2253 max = state->max_len;
2254 if (max > 50)
2255 max = 50;
2256
2257 if (qname.len > max) {
2258 cp = strchr(qname.buf + qname.len + 3 - max, '/');
2259 if (!cp)
2260 cp = qname.buf + qname.len + 3 - max;
2261 strbuf_splice(&qname, 0, cp - qname.buf, "...", 3);
2262 }
2263
2264 if (patch->is_binary) {
2265 printf(" %-*s | Bin\n", max, qname.buf);
2266 strbuf_release(&qname);
2267 return;
2268 }
2269
2270 printf(" %-*s |", max, qname.buf);
2271 strbuf_release(&qname);
2272
2273 /*
2274 * scale the add/delete
2275 */
2276 max = max + state->max_change > 70 ? 70 - max : state->max_change;
2277 add = patch->lines_added;
2278 del = patch->lines_deleted;
2279
2280 if (state->max_change > 0) {
2281 int total = ((add + del) * max + state->max_change / 2) / state->max_change;
2282 add = (add * max + state->max_change / 2) / state->max_change;
2283 del = total - add;
2284 }
2285 printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,
2286 add, pluses, del, minuses);
2287 }
2288
2289 static int read_old_data(struct stat *st, struct patch *patch,
2290 const char *path, struct strbuf *buf)
2291 {
2292 int conv_flags = patch->crlf_in_old ?
2293 CONV_EOL_KEEP_CRLF : CONV_EOL_RENORMALIZE;
2294 switch (st->st_mode & S_IFMT) {
2295 case S_IFLNK:
2296 if (strbuf_readlink(buf, path, st->st_size) < 0)
2297 return error(_("unable to read symlink %s"), path);
2298 return 0;
2299 case S_IFREG:
2300 if (strbuf_read_file(buf, path, st->st_size) != st->st_size)
2301 return error(_("unable to open or read %s"), path);
2302 /*
2303 * "git apply" without "--index/--cached" should never look
2304 * at the index; the target file may not have been added to
2305 * the index yet, and we may not even be in any Git repository.
2306 * Pass NULL to convert_to_git() to stress this; the function
2307 * should never look at the index when explicit crlf option
2308 * is given.
2309 */
2310 convert_to_git(NULL, path, buf->buf, buf->len, buf, conv_flags);
2311 return 0;
2312 default:
2313 return -1;
2314 }
2315 }
2316
2317 /*
2318 * Update the preimage, and the common lines in postimage,
2319 * from buffer buf of length len. If postlen is 0 the postimage
2320 * is updated in place, otherwise it's updated on a new buffer
2321 * of length postlen
2322 */
2323
2324 static void update_pre_post_images(struct image *preimage,
2325 struct image *postimage,
2326 char *buf,
2327 size_t len, size_t postlen)
2328 {
2329 int i, ctx, reduced;
2330 char *new_buf, *old_buf, *fixed;
2331 struct image fixed_preimage;
2332
2333 /*
2334 * Update the preimage with whitespace fixes. Note that we
2335 * are not losing preimage->buf -- apply_one_fragment() will
2336 * free "oldlines".
2337 */
2338 prepare_image(&fixed_preimage, buf, len, 1);
2339 assert(postlen
2340 ? fixed_preimage.nr == preimage->nr
2341 : fixed_preimage.nr <= preimage->nr);
2342 for (i = 0; i < fixed_preimage.nr; i++)
2343 fixed_preimage.line[i].flag = preimage->line[i].flag;
2344 free(preimage->line_allocated);
2345 *preimage = fixed_preimage;
2346
2347 /*
2348 * Adjust the common context lines in postimage. This can be
2349 * done in-place when we are shrinking it with whitespace
2350 * fixing, but needs a new buffer when ignoring whitespace or
2351 * expanding leading tabs to spaces.
2352 *
2353 * We trust the caller to tell us if the update can be done
2354 * in place (postlen==0) or not.
2355 */
2356 old_buf = postimage->buf;
2357 if (postlen)
2358 new_buf = postimage->buf = xmalloc(postlen);
2359 else
2360 new_buf = old_buf;
2361 fixed = preimage->buf;
2362
2363 for (i = reduced = ctx = 0; i < postimage->nr; i++) {
2364 size_t l_len = postimage->line[i].len;
2365 if (!(postimage->line[i].flag & LINE_COMMON)) {
2366 /* an added line -- no counterparts in preimage */
2367 memmove(new_buf, old_buf, l_len);
2368 old_buf += l_len;
2369 new_buf += l_len;
2370 continue;
2371 }
2372
2373 /* a common context -- skip it in the original postimage */
2374 old_buf += l_len;
2375
2376 /* and find the corresponding one in the fixed preimage */
2377 while (ctx < preimage->nr &&
2378 !(preimage->line[ctx].flag & LINE_COMMON)) {
2379 fixed += preimage->line[ctx].len;
2380 ctx++;
2381 }
2382
2383 /*
2384 * preimage is expected to run out, if the caller
2385 * fixed addition of trailing blank lines.
2386 */
2387 if (preimage->nr <= ctx) {
2388 reduced++;
2389 continue;
2390 }
2391
2392 /* and copy it in, while fixing the line length */
2393 l_len = preimage->line[ctx].len;
2394 memcpy(new_buf, fixed, l_len);
2395 new_buf += l_len;
2396 fixed += l_len;
2397 postimage->line[i].len = l_len;
2398 ctx++;
2399 }
2400
2401 if (postlen
2402 ? postlen < new_buf - postimage->buf
2403 : postimage->len < new_buf - postimage->buf)
2404 BUG("caller miscounted postlen: asked %d, orig = %d, used = %d",
2405 (int)postlen, (int) postimage->len, (int)(new_buf - postimage->buf));
2406
2407 /* Fix the length of the whole thing */
2408 postimage->len = new_buf - postimage->buf;
2409 postimage->nr -= reduced;
2410 }
2411
2412 static int line_by_line_fuzzy_match(struct image *img,
2413 struct image *preimage,
2414 struct image *postimage,
2415 unsigned long current,
2416 int current_lno,
2417 int preimage_limit)
2418 {
2419 int i;
2420 size_t imgoff = 0;
2421 size_t preoff = 0;
2422 size_t postlen = postimage->len;
2423 size_t extra_chars;
2424 char *buf;
2425 char *preimage_eof;
2426 char *preimage_end;
2427 struct strbuf fixed;
2428 char *fixed_buf;
2429 size_t fixed_len;
2430
2431 for (i = 0; i < preimage_limit; i++) {
2432 size_t prelen = preimage->line[i].len;
2433 size_t imglen = img->line[current_lno+i].len;
2434
2435 if (!fuzzy_matchlines(img->buf + current + imgoff, imglen,
2436 preimage->buf + preoff, prelen))
2437 return 0;
2438 if (preimage->line[i].flag & LINE_COMMON)
2439 postlen += imglen - prelen;
2440 imgoff += imglen;
2441 preoff += prelen;
2442 }
2443
2444 /*
2445 * Ok, the preimage matches with whitespace fuzz.
2446 *
2447 * imgoff now holds the true length of the target that
2448 * matches the preimage before the end of the file.
2449 *
2450 * Count the number of characters in the preimage that fall
2451 * beyond the end of the file and make sure that all of them
2452 * are whitespace characters. (This can only happen if
2453 * we are removing blank lines at the end of the file.)
2454 */
2455 buf = preimage_eof = preimage->buf + preoff;
2456 for ( ; i < preimage->nr; i++)
2457 preoff += preimage->line[i].len;
2458 preimage_end = preimage->buf + preoff;
2459 for ( ; buf < preimage_end; buf++)
2460 if (!isspace(*buf))
2461 return 0;
2462
2463 /*
2464 * Update the preimage and the common postimage context
2465 * lines to use the same whitespace as the target.
2466 * If whitespace is missing in the target (i.e.
2467 * if the preimage extends beyond the end of the file),
2468 * use the whitespace from the preimage.
2469 */
2470 extra_chars = preimage_end - preimage_eof;
2471 strbuf_init(&fixed, imgoff + extra_chars);
2472 strbuf_add(&fixed, img->buf + current, imgoff);
2473 strbuf_add(&fixed, preimage_eof, extra_chars);
2474 fixed_buf = strbuf_detach(&fixed, &fixed_len);
2475 update_pre_post_images(preimage, postimage,
2476 fixed_buf, fixed_len, postlen);
2477 return 1;
2478 }
2479
2480 static int match_fragment(struct apply_state *state,
2481 struct image *img,
2482 struct image *preimage,
2483 struct image *postimage,
2484 unsigned long current,
2485 int current_lno,
2486 unsigned ws_rule,
2487 int match_beginning, int match_end)
2488 {
2489 int i;
2490 char *fixed_buf, *buf, *orig, *target;
2491 struct strbuf fixed;
2492 size_t fixed_len, postlen;
2493 int preimage_limit;
2494
2495 if (preimage->nr + current_lno <= img->nr) {
2496 /*
2497 * The hunk falls within the boundaries of img.
2498 */
2499 preimage_limit = preimage->nr;
2500 if (match_end && (preimage->nr + current_lno != img->nr))
2501 return 0;
2502 } else if (state->ws_error_action == correct_ws_error &&
2503 (ws_rule & WS_BLANK_AT_EOF)) {
2504 /*
2505 * This hunk extends beyond the end of img, and we are
2506 * removing blank lines at the end of the file. This
2507 * many lines from the beginning of the preimage must
2508 * match with img, and the remainder of the preimage
2509 * must be blank.
2510 */
2511 preimage_limit = img->nr - current_lno;
2512 } else {
2513 /*
2514 * The hunk extends beyond the end of the img and
2515 * we are not removing blanks at the end, so we
2516 * should reject the hunk at this position.
2517 */
2518 return 0;
2519 }
2520
2521 if (match_beginning && current_lno)
2522 return 0;
2523
2524 /* Quick hash check */
2525 for (i = 0; i < preimage_limit; i++)
2526 if ((img->line[current_lno + i].flag & LINE_PATCHED) ||
2527 (preimage->line[i].hash != img->line[current_lno + i].hash))
2528 return 0;
2529
2530 if (preimage_limit == preimage->nr) {
2531 /*
2532 * Do we have an exact match? If we were told to match
2533 * at the end, size must be exactly at current+fragsize,
2534 * otherwise current+fragsize must be still within the preimage,
2535 * and either case, the old piece should match the preimage
2536 * exactly.
2537 */
2538 if ((match_end
2539 ? (current + preimage->len == img->len)
2540 : (current + preimage->len <= img->len)) &&
2541 !memcmp(img->buf + current, preimage->buf, preimage->len))
2542 return 1;
2543 } else {
2544 /*
2545 * The preimage extends beyond the end of img, so
2546 * there cannot be an exact match.
2547 *
2548 * There must be one non-blank context line that match
2549 * a line before the end of img.
2550 */
2551 char *buf_end;
2552
2553 buf = preimage->buf;
2554 buf_end = buf;
2555 for (i = 0; i < preimage_limit; i++)
2556 buf_end += preimage->line[i].len;
2557
2558 for ( ; buf < buf_end; buf++)
2559 if (!isspace(*buf))
2560 break;
2561 if (buf == buf_end)
2562 return 0;
2563 }
2564
2565 /*
2566 * No exact match. If we are ignoring whitespace, run a line-by-line
2567 * fuzzy matching. We collect all the line length information because
2568 * we need it to adjust whitespace if we match.
2569 */
2570 if (state->ws_ignore_action == ignore_ws_change)
2571 return line_by_line_fuzzy_match(img, preimage, postimage,
2572 current, current_lno, preimage_limit);
2573
2574 if (state->ws_error_action != correct_ws_error)
2575 return 0;
2576
2577 /*
2578 * The hunk does not apply byte-by-byte, but the hash says
2579 * it might with whitespace fuzz. We weren't asked to
2580 * ignore whitespace, we were asked to correct whitespace
2581 * errors, so let's try matching after whitespace correction.
2582 *
2583 * While checking the preimage against the target, whitespace
2584 * errors in both fixed, we count how large the corresponding
2585 * postimage needs to be. The postimage prepared by
2586 * apply_one_fragment() has whitespace errors fixed on added
2587 * lines already, but the common lines were propagated as-is,
2588 * which may become longer when their whitespace errors are
2589 * fixed.
2590 */
2591
2592 /* First count added lines in postimage */
2593 postlen = 0;
2594 for (i = 0; i < postimage->nr; i++) {
2595 if (!(postimage->line[i].flag & LINE_COMMON))
2596 postlen += postimage->line[i].len;
2597 }
2598
2599 /*
2600 * The preimage may extend beyond the end of the file,
2601 * but in this loop we will only handle the part of the
2602 * preimage that falls within the file.
2603 */
2604 strbuf_init(&fixed, preimage->len + 1);
2605 orig = preimage->buf;
2606 target = img->buf + current;
2607 for (i = 0; i < preimage_limit; i++) {
2608 size_t oldlen = preimage->line[i].len;
2609 size_t tgtlen = img->line[current_lno + i].len;
2610 size_t fixstart = fixed.len;
2611 struct strbuf tgtfix;
2612 int match;
2613
2614 /* Try fixing the line in the preimage */
2615 ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);
2616
2617 /* Try fixing the line in the target */
2618 strbuf_init(&tgtfix, tgtlen);
2619 ws_fix_copy(&tgtfix, target, tgtlen, ws_rule, NULL);
2620
2621 /*
2622 * If they match, either the preimage was based on
2623 * a version before our tree fixed whitespace breakage,
2624 * or we are lacking a whitespace-fix patch the tree
2625 * the preimage was based on already had (i.e. target
2626 * has whitespace breakage, the preimage doesn't).
2627 * In either case, we are fixing the whitespace breakages
2628 * so we might as well take the fix together with their
2629 * real change.
2630 */
2631 match = (tgtfix.len == fixed.len - fixstart &&
2632 !memcmp(tgtfix.buf, fixed.buf + fixstart,
2633 fixed.len - fixstart));
2634
2635 /* Add the length if this is common with the postimage */
2636 if (preimage->line[i].flag & LINE_COMMON)
2637 postlen += tgtfix.len;
2638
2639 strbuf_release(&tgtfix);
2640 if (!match)
2641 goto unmatch_exit;
2642
2643 orig += oldlen;
2644 target += tgtlen;
2645 }
2646
2647
2648 /*
2649 * Now handle the lines in the preimage that falls beyond the
2650 * end of the file (if any). They will only match if they are
2651 * empty or only contain whitespace (if WS_BLANK_AT_EOL is
2652 * false).
2653 */
2654 for ( ; i < preimage->nr; i++) {
2655 size_t fixstart = fixed.len; /* start of the fixed preimage */
2656 size_t oldlen = preimage->line[i].len;
2657 int j;
2658
2659 /* Try fixing the line in the preimage */
2660 ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);
2661
2662 for (j = fixstart; j < fixed.len; j++)
2663 if (!isspace(fixed.buf[j]))
2664 goto unmatch_exit;
2665
2666 orig += oldlen;
2667 }
2668
2669 /*
2670 * Yes, the preimage is based on an older version that still
2671 * has whitespace breakages unfixed, and fixing them makes the
2672 * hunk match. Update the context lines in the postimage.
2673 */
2674 fixed_buf = strbuf_detach(&fixed, &fixed_len);
2675 if (postlen < postimage->len)
2676 postlen = 0;
2677 update_pre_post_images(preimage, postimage,
2678 fixed_buf, fixed_len, postlen);
2679 return 1;
2680
2681 unmatch_exit:
2682 strbuf_release(&fixed);
2683 return 0;
2684 }
2685
2686 static int find_pos(struct apply_state *state,
2687 struct image *img,
2688 struct image *preimage,
2689 struct image *postimage,
2690 int line,
2691 unsigned ws_rule,
2692 int match_beginning, int match_end)
2693 {
2694 int i;
2695 unsigned long backwards, forwards, current;
2696 int backwards_lno, forwards_lno, current_lno;
2697
2698 /*
2699 * When running with --allow-overlap, it is possible that a hunk is
2700 * seen that pretends to start at the beginning (but no longer does),
2701 * and that *still* needs to match the end. So trust `match_end` more
2702 * than `match_beginning`.
2703 */
2704 if (state->allow_overlap && match_beginning && match_end &&
2705 img->nr - preimage->nr != 0)
2706 match_beginning = 0;
2707
2708 /*
2709 * If match_beginning or match_end is specified, there is no
2710 * point starting from a wrong line that will never match and
2711 * wander around and wait for a match at the specified end.
2712 */
2713 if (match_beginning)
2714 line = 0;
2715 else if (match_end)
2716 line = img->nr - preimage->nr;
2717
2718 /*
2719 * Because the comparison is unsigned, the following test
2720 * will also take care of a negative line number that can
2721 * result when match_end and preimage is larger than the target.
2722 */
2723 if ((size_t) line > img->nr)
2724 line = img->nr;
2725
2726 current = 0;
2727 for (i = 0; i < line; i++)
2728 current += img->line[i].len;
2729
2730 /*
2731 * There's probably some smart way to do this, but I'll leave
2732 * that to the smart and beautiful people. I'm simple and stupid.
2733 */
2734 backwards = current;
2735 backwards_lno = line;
2736 forwards = current;
2737 forwards_lno = line;
2738 current_lno = line;
2739
2740 for (i = 0; ; i++) {
2741 if (match_fragment(state, img, preimage, postimage,
2742 current, current_lno, ws_rule,
2743 match_beginning, match_end))
2744 return current_lno;
2745
2746 again:
2747 if (backwards_lno == 0 && forwards_lno == img->nr)
2748 break;
2749
2750 if (i & 1) {
2751 if (backwards_lno == 0) {
2752 i++;
2753 goto again;
2754 }
2755 backwards_lno--;
2756 backwards -= img->line[backwards_lno].len;
2757 current = backwards;
2758 current_lno = backwards_lno;
2759 } else {
2760 if (forwards_lno == img->nr) {
2761 i++;
2762 goto again;
2763 }
2764 forwards += img->line[forwards_lno].len;
2765 forwards_lno++;
2766 current = forwards;
2767 current_lno = forwards_lno;
2768 }
2769
2770 }
2771 return -1;
2772 }
2773
2774 static void remove_first_line(struct image *img)
2775 {
2776 img->buf += img->line[0].len;
2777 img->len -= img->line[0].len;
2778 img->line++;
2779 img->nr--;
2780 }
2781
2782 static void remove_last_line(struct image *img)
2783 {
2784 img->len -= img->line[--img->nr].len;
2785 }
2786
2787 /*
2788 * The change from "preimage" and "postimage" has been found to
2789 * apply at applied_pos (counts in line numbers) in "img".
2790 * Update "img" to remove "preimage" and replace it with "postimage".
2791 */
2792 static void update_image(struct apply_state *state,
2793 struct image *img,
2794 int applied_pos,
2795 struct image *preimage,
2796 struct image *postimage)
2797 {
2798 /*
2799 * remove the copy of preimage at offset in img
2800 * and replace it with postimage
2801 */
2802 int i, nr;
2803 size_t remove_count, insert_count, applied_at = 0;
2804 char *result;
2805 int preimage_limit;
2806
2807 /*
2808 * If we are removing blank lines at the end of img,
2809 * the preimage may extend beyond the end.
2810 * If that is the case, we must be careful only to
2811 * remove the part of the preimage that falls within
2812 * the boundaries of img. Initialize preimage_limit
2813 * to the number of lines in the preimage that falls
2814 * within the boundaries.
2815 */
2816 preimage_limit = preimage->nr;
2817 if (preimage_limit > img->nr - applied_pos)
2818 preimage_limit = img->nr - applied_pos;
2819
2820 for (i = 0; i < applied_pos; i++)
2821 applied_at += img->line[i].len;
2822
2823 remove_count = 0;
2824 for (i = 0; i < preimage_limit; i++)
2825 remove_count += img->line[applied_pos + i].len;
2826 insert_count = postimage->len;
2827
2828 /* Adjust the contents */
2829 result = xmalloc(st_add3(st_sub(img->len, remove_count), insert_count, 1));
2830 memcpy(result, img->buf, applied_at);
2831 memcpy(result + applied_at, postimage->buf, postimage->len);
2832 memcpy(result + applied_at + postimage->len,
2833 img->buf + (applied_at + remove_count),
2834 img->len - (applied_at + remove_count));
2835 free(img->buf);
2836 img->buf = result;
2837 img->len += insert_count - remove_count;
2838 result[img->len] = '\0';
2839
2840 /* Adjust the line table */
2841 nr = img->nr + postimage->nr - preimage_limit;
2842 if (preimage_limit < postimage->nr) {
2843 /*
2844 * NOTE: this knows that we never call remove_first_line()
2845 * on anything other than pre/post image.
2846 */
2847 REALLOC_ARRAY(img->line, nr);
2848 img->line_allocated = img->line;
2849 }
2850 if (preimage_limit != postimage->nr)
2851 MOVE_ARRAY(img->line + applied_pos + postimage->nr,
2852 img->line + applied_pos + preimage_limit,
2853 img->nr - (applied_pos + preimage_limit));
2854 COPY_ARRAY(img->line + applied_pos, postimage->line, postimage->nr);
2855 if (!state->allow_overlap)
2856 for (i = 0; i < postimage->nr; i++)
2857 img->line[applied_pos + i].flag |= LINE_PATCHED;
2858 img->nr = nr;
2859 }
2860
2861 /*
2862 * Use the patch-hunk text in "frag" to prepare two images (preimage and
2863 * postimage) for the hunk. Find lines that match "preimage" in "img" and
2864 * replace the part of "img" with "postimage" text.
2865 */
2866 static int apply_one_fragment(struct apply_state *state,
2867 struct image *img, struct fragment *frag,
2868 int inaccurate_eof, unsigned ws_rule,
2869 int nth_fragment)
2870 {
2871 int match_beginning, match_end;
2872 const char *patch = frag->patch;
2873 int size = frag->size;
2874 char *old, *oldlines;
2875 struct strbuf newlines;
2876 int new_blank_lines_at_end = 0;
2877 int found_new_blank_lines_at_end = 0;
2878 int hunk_linenr = frag->linenr;
2879 unsigned long leading, trailing;
2880 int pos, applied_pos;
2881 struct image preimage;
2882 struct image postimage;
2883
2884 memset(&preimage, 0, sizeof(preimage));
2885 memset(&postimage, 0, sizeof(postimage));
2886 oldlines = xmalloc(size);
2887 strbuf_init(&newlines, size);
2888
2889 old = oldlines;
2890 while (size > 0) {
2891 char first;
2892 int len = linelen(patch, size);
2893 int plen;
2894 int added_blank_line = 0;
2895 int is_blank_context = 0;
2896 size_t start;
2897
2898 if (!len)
2899 break;
2900
2901 /*
2902 * "plen" is how much of the line we should use for
2903 * the actual patch data. Normally we just remove the
2904 * first character on the line, but if the line is
2905 * followed by "\ No newline", then we also remove the
2906 * last one (which is the newline, of course).
2907 */
2908 plen = len - 1;
2909 if (len < size && patch[len] == '\\')
2910 plen--;
2911 first = *patch;
2912 if (state->apply_in_reverse) {
2913 if (first == '-')
2914 first = '+';
2915 else if (first == '+')
2916 first = '-';
2917 }
2918
2919 switch (first) {
2920 case '\n':
2921 /* Newer GNU diff, empty context line */
2922 if (plen < 0)
2923 /* ... followed by '\No newline'; nothing */
2924 break;
2925 *old++ = '\n';
2926 strbuf_addch(&newlines, '\n');
2927 add_line_info(&preimage, "\n", 1, LINE_COMMON);
2928 add_line_info(&postimage, "\n", 1, LINE_COMMON);
2929 is_blank_context = 1;
2930 break;
2931 case ' ':
2932 if (plen && (ws_rule & WS_BLANK_AT_EOF) &&
2933 ws_blank_line(patch + 1, plen))
2934 is_blank_context = 1;
2935 /* fallthrough */
2936 case '-':
2937 memcpy(old, patch + 1, plen);
2938 add_line_info(&preimage, old, plen,
2939 (first == ' ' ? LINE_COMMON : 0));
2940 old += plen;
2941 if (first == '-')
2942 break;
2943 /* fallthrough */
2944 case '+':
2945 /* --no-add does not add new lines */
2946 if (first == '+' && state->no_add)
2947 break;
2948
2949 start = newlines.len;
2950 if (first != '+' ||
2951 !state->whitespace_error ||
2952 state->ws_error_action != correct_ws_error) {
2953 strbuf_add(&newlines, patch + 1, plen);
2954 }
2955 else {
2956 ws_fix_copy(&newlines, patch + 1, plen, ws_rule, &state->applied_after_fixing_ws);
2957 }
2958 add_line_info(&postimage, newlines.buf + start, newlines.len - start,
2959 (first == '+' ? 0 : LINE_COMMON));
2960 if (first == '+' &&
2961 (ws_rule & WS_BLANK_AT_EOF) &&
2962 ws_blank_line(patch + 1, plen))
2963 added_blank_line = 1;
2964 break;
2965 case '@': case '\\':
2966 /* Ignore it, we already handled it */
2967 break;
2968 default:
2969 if (state->apply_verbosity > verbosity_normal)
2970 error(_("invalid start of line: '%c'"), first);
2971 applied_pos = -1;
2972 goto out;
2973 }
2974 if (added_blank_line) {
2975 if (!new_blank_lines_at_end)
2976 found_new_blank_lines_at_end = hunk_linenr;
2977 new_blank_lines_at_end++;
2978 }
2979 else if (is_blank_context)
2980 ;
2981 else
2982 new_blank_lines_at_end = 0;
2983 patch += len;
2984 size -= len;
2985 hunk_linenr++;
2986 }
2987 if (inaccurate_eof &&
2988 old > oldlines && old[-1] == '\n' &&
2989 newlines.len > 0 && newlines.buf[newlines.len - 1] == '\n') {
2990 old--;
2991 strbuf_setlen(&newlines, newlines.len - 1);
2992 preimage.line_allocated[preimage.nr - 1].len--;
2993 postimage.line_allocated[postimage.nr - 1].len--;
2994 }
2995
2996 leading = frag->leading;
2997 trailing = frag->trailing;
2998
2999 /*
3000 * A hunk to change lines at the beginning would begin with
3001 * @@ -1,L +N,M @@
3002 * but we need to be careful. -U0 that inserts before the second
3003 * line also has this pattern.
3004 *
3005 * And a hunk to add to an empty file would begin with
3006 * @@ -0,0 +N,M @@
3007 *
3008 * In other words, a hunk that is (frag->oldpos <= 1) with or
3009 * without leading context must match at the beginning.
3010 */
3011 match_beginning = (!frag->oldpos ||
3012 (frag->oldpos == 1 && !state->unidiff_zero));
3013
3014 /*
3015 * A hunk without trailing lines must match at the end.
3016 * However, we simply cannot tell if a hunk must match end
3017 * from the lack of trailing lines if the patch was generated
3018 * with unidiff without any context.
3019 */
3020 match_end = !state->unidiff_zero && !trailing;
3021
3022 pos = frag->newpos ? (frag->newpos - 1) : 0;
3023 preimage.buf = oldlines;
3024 preimage.len = old - oldlines;
3025 postimage.buf = newlines.buf;
3026 postimage.len = newlines.len;
3027 preimage.line = preimage.line_allocated;
3028 postimage.line = postimage.line_allocated;
3029
3030 for (;;) {
3031
3032 applied_pos = find_pos(state, img, &preimage, &postimage, pos,
3033 ws_rule, match_beginning, match_end);
3034
3035 if (applied_pos >= 0)
3036 break;
3037
3038 /* Am I at my context limits? */
3039 if ((leading <= state->p_context) && (trailing <= state->p_context))
3040 break;
3041 if (match_beginning || match_end) {
3042 match_beginning = match_end = 0;
3043 continue;
3044 }
3045
3046 /*
3047 * Reduce the number of context lines; reduce both
3048 * leading and trailing if they are equal otherwise
3049 * just reduce the larger context.
3050 */
3051 if (leading >= trailing) {
3052 remove_first_line(&preimage);
3053 remove_first_line(&postimage);
3054 pos--;
3055 leading--;
3056 }
3057 if (trailing > leading) {
3058 remove_last_line(&preimage);
3059 remove_last_line(&postimage);
3060 trailing--;
3061 }
3062 }
3063
3064 if (applied_pos >= 0) {
3065 if (new_blank_lines_at_end &&
3066 preimage.nr + applied_pos >= img->nr &&
3067 (ws_rule & WS_BLANK_AT_EOF) &&
3068 state->ws_error_action != nowarn_ws_error) {
3069 record_ws_error(state, WS_BLANK_AT_EOF, "+", 1,
3070 found_new_blank_lines_at_end);
3071 if (state->ws_error_action == correct_ws_error) {
3072 while (new_blank_lines_at_end--)
3073 remove_last_line(&postimage);
3074 }
3075 /*
3076 * We would want to prevent write_out_results()
3077 * from taking place in apply_patch() that follows
3078 * the callchain led us here, which is:
3079 * apply_patch->check_patch_list->check_patch->
3080 * apply_data->apply_fragments->apply_one_fragment
3081 */
3082 if (state->ws_error_action == die_on_ws_error)
3083 state->apply = 0;
3084 }
3085
3086 if (state->apply_verbosity > verbosity_normal && applied_pos != pos) {
3087 int offset = applied_pos - pos;
3088 if (state->apply_in_reverse)
3089 offset = 0 - offset;
3090 fprintf_ln(stderr,
3091 Q_("Hunk #%d succeeded at %d (offset %d line).",
3092 "Hunk #%d succeeded at %d (offset %d lines).",
3093 offset),
3094 nth_fragment, applied_pos + 1, offset);
3095 }
3096
3097 /*
3098 * Warn if it was necessary to reduce the number
3099 * of context lines.
3100 */
3101 if ((leading != frag->leading ||
3102 trailing != frag->trailing) && state->apply_verbosity > verbosity_silent)
3103 fprintf_ln(stderr, _("Context reduced to (%ld/%ld)"
3104 " to apply fragment at %d"),
3105 leading, trailing, applied_pos+1);
3106 update_image(state, img, applied_pos, &preimage, &postimage);
3107 } else {
3108 if (state->apply_verbosity > verbosity_normal)
3109 error(_("while searching for:\n%.*s"),
3110 (int)(old - oldlines), oldlines);
3111 }
3112
3113 out:
3114 free(oldlines);
3115 strbuf_release(&newlines);
3116 free(preimage.line_allocated);
3117 free(postimage.line_allocated);
3118
3119 return (applied_pos < 0);
3120 }
3121
3122 static int apply_binary_fragment(struct apply_state *state,
3123 struct image *img,
3124 struct patch *patch)
3125 {
3126 struct fragment *fragment = patch->fragments;
3127 unsigned long len;
3128 void *dst;
3129
3130 if (!fragment)
3131 return error(_("missing binary patch data for '%s'"),
3132 patch->new_name ?
3133 patch->new_name :
3134 patch->old_name);
3135
3136 /* Binary patch is irreversible without the optional second hunk */
3137 if (state->apply_in_reverse) {
3138 if (!fragment->next)
3139 return error(_("cannot reverse-apply a binary patch "
3140 "without the reverse hunk to '%s'"),
3141 patch->new_name
3142 ? patch->new_name : patch->old_name);
3143 fragment = fragment->next;
3144 }
3145 switch (fragment->binary_patch_method) {
3146 case BINARY_DELTA_DEFLATED:
3147 dst = patch_delta(img->buf, img->len, fragment->patch,
3148 fragment->size, &len);
3149 if (!dst)
3150 return -1;
3151 clear_image(img);
3152 img->buf = dst;
3153 img->len = len;
3154 return 0;
3155 case BINARY_LITERAL_DEFLATED:
3156 clear_image(img);
3157 img->len = fragment->size;
3158 img->buf = xmemdupz(fragment->patch, img->len);
3159 return 0;
3160 }
3161 return -1;
3162 }
3163
3164 /*
3165 * Replace "img" with the result of applying the binary patch.
3166 * The binary patch data itself in patch->fragment is still kept
3167 * but the preimage prepared by the caller in "img" is freed here
3168 * or in the helper function apply_binary_fragment() this calls.
3169 */
3170 static int apply_binary(struct apply_state *state,
3171 struct image *img,
3172 struct patch *patch)
3173 {
3174 const char *name = patch->old_name ? patch->old_name : patch->new_name;
3175 struct object_id oid;
3176 const unsigned hexsz = the_hash_algo->hexsz;
3177
3178 /*
3179 * For safety, we require patch index line to contain
3180 * full hex textual object ID for old and new, at least for now.
3181 */
3182 if (strlen(patch->old_oid_prefix) != hexsz ||
3183 strlen(patch->new_oid_prefix) != hexsz ||
3184 get_oid_hex(patch->old_oid_prefix, &oid) ||
3185 get_oid_hex(patch->new_oid_prefix, &oid))
3186 return error(_("cannot apply binary patch to '%s' "
3187 "without full index line"), name);
3188
3189 if (patch->old_name) {
3190 /*
3191 * See if the old one matches what the patch
3192 * applies to.
3193 */
3194 hash_object_file(the_hash_algo, img->buf, img->len, OBJ_BLOB,
3195 &oid);
3196 if (strcmp(oid_to_hex(&oid), patch->old_oid_prefix))
3197 return error(_("the patch applies to '%s' (%s), "
3198 "which does not match the "
3199 "current contents."),
3200 name, oid_to_hex(&oid));
3201 }
3202 else {
3203 /* Otherwise, the old one must be empty. */
3204 if (img->len)
3205 return error(_("the patch applies to an empty "
3206 "'%s' but it is not empty"), name);
3207 }
3208
3209 get_oid_hex(patch->new_oid_prefix, &oid);
3210 if (is_null_oid(&oid)) {
3211 clear_image(img);
3212 return 0; /* deletion patch */
3213 }
3214
3215 if (has_object(the_repository, &oid, 0)) {
3216 /* We already have the postimage */
3217 enum object_type type;
3218 unsigned long size;
3219 char *result;
3220
3221 result = repo_read_object_file(the_repository, &oid, &type,
3222 &size);
3223 if (!result)
3224 return error(_("the necessary postimage %s for "
3225 "'%s' cannot be read"),
3226 patch->new_oid_prefix, name);
3227 clear_image(img);
3228 img->buf = result;
3229 img->len = size;
3230 } else {
3231 /*
3232 * We have verified buf matches the preimage;
3233 * apply the patch data to it, which is stored
3234 * in the patch->fragments->{patch,size}.
3235 */
3236 if (apply_binary_fragment(state, img, patch))
3237 return error(_("binary patch does not apply to '%s'"),
3238 name);
3239
3240 /* verify that the result matches */
3241 hash_object_file(the_hash_algo, img->buf, img->len, OBJ_BLOB,
3242 &oid);
3243 if (strcmp(oid_to_hex(&oid), patch->new_oid_prefix))
3244 return error(_("binary patch to '%s' creates incorrect result (expecting %s, got %s)"),
3245 name, patch->new_oid_prefix, oid_to_hex(&oid));
3246 }
3247
3248 return 0;
3249 }
3250
3251 static int apply_fragments(struct apply_state *state, struct image *img, struct patch *patch)
3252 {
3253 struct fragment *frag = patch->fragments;
3254 const char *name = patch->old_name ? patch->old_name : patch->new_name;
3255 unsigned ws_rule = patch->ws_rule;
3256 unsigned inaccurate_eof = patch->inaccurate_eof;
3257 int nth = 0;
3258
3259 if (patch->is_binary)
3260 return apply_binary(state, img, patch);
3261
3262 while (frag) {
3263 nth++;
3264 if (apply_one_fragment(state, img, frag, inaccurate_eof, ws_rule, nth)) {
3265 error(_("patch failed: %s:%ld"), name, frag->oldpos);
3266 if (!state->apply_with_reject)
3267 return -1;
3268 frag->rejected = 1;
3269 }
3270 frag = frag->next;
3271 }
3272 return 0;
3273 }
3274
3275 static int read_blob_object(struct strbuf *buf, const struct object_id *oid, unsigned mode)
3276 {
3277 if (S_ISGITLINK(mode)) {
3278 strbuf_grow(buf, 100);
3279 strbuf_addf(buf, "Subproject commit %s\n", oid_to_hex(oid));
3280 } else {
3281 enum object_type type;
3282 unsigned long sz;
3283 char *result;
3284
3285 result = repo_read_object_file(the_repository, oid, &type,
3286 &sz);
3287 if (!result)
3288 return -1;
3289 /* XXX read_sha1_file NUL-terminates */
3290 strbuf_attach(buf, result, sz, sz + 1);
3291 }
3292 return 0;
3293 }
3294
3295 static int read_file_or_gitlink(const struct cache_entry *ce, struct strbuf *buf)
3296 {
3297 if (!ce)
3298 return 0;
3299 return read_blob_object(buf, &ce->oid, ce->ce_mode);
3300 }
3301
3302 static struct patch *in_fn_table(struct apply_state *state, const char *name)
3303 {
3304 struct string_list_item *item;
3305
3306 if (!name)
3307 return NULL;
3308
3309 item = string_list_lookup(&state->fn_table, name);
3310 if (item)
3311 return (struct patch *)item->util;
3312
3313 return NULL;
3314 }
3315
3316 /*
3317 * item->util in the filename table records the status of the path.
3318 * Usually it points at a patch (whose result records the contents
3319 * of it after applying it), but it could be PATH_WAS_DELETED for a
3320 * path that a previously applied patch has already removed, or
3321 * PATH_TO_BE_DELETED for a path that a later patch would remove.
3322 *
3323 * The latter is needed to deal with a case where two paths A and B
3324 * are swapped by first renaming A to B and then renaming B to A;
3325 * moving A to B should not be prevented due to presence of B as we
3326 * will remove it in a later patch.
3327 */
3328 #define PATH_TO_BE_DELETED ((struct patch *) -2)
3329 #define PATH_WAS_DELETED ((struct patch *) -1)
3330
3331 static int to_be_deleted(struct patch *patch)
3332 {
3333 return patch == PATH_TO_BE_DELETED;
3334 }
3335
3336 static int was_deleted(struct patch *patch)
3337 {
3338 return patch == PATH_WAS_DELETED;
3339 }
3340
3341 static void add_to_fn_table(struct apply_state *state, struct patch *patch)
3342 {
3343 struct string_list_item *item;
3344
3345 /*
3346 * Always add new_name unless patch is a deletion
3347 * This should cover the cases for normal diffs,
3348 * file creations and copies
3349 */
3350 if (patch->new_name) {
3351 item = string_list_insert(&state->fn_table, patch->new_name);
3352 item->util = patch;
3353 }
3354
3355 /*
3356 * store a failure on rename/deletion cases because
3357 * later chunks shouldn't patch old names
3358 */
3359 if ((patch->new_name == NULL) || (patch->is_rename)) {
3360 item = string_list_insert(&state->fn_table, patch->old_name);
3361 item->util = PATH_WAS_DELETED;
3362 }
3363 }
3364
3365 static void prepare_fn_table(struct apply_state *state, struct patch *patch)
3366 {
3367 /*
3368 * store information about incoming file deletion
3369 */
3370 while (patch) {
3371 if ((patch->new_name == NULL) || (patch->is_rename)) {
3372 struct string_list_item *item;
3373 item = string_list_insert(&state->fn_table, patch->old_name);
3374 item->util = PATH_TO_BE_DELETED;
3375 }
3376 patch = patch->next;
3377 }
3378 }
3379
3380 static int checkout_target(struct index_state *istate,
3381 struct cache_entry *ce, struct stat *st)
3382 {
3383 struct checkout costate = CHECKOUT_INIT;
3384
3385 costate.refresh_cache = 1;
3386 costate.istate = istate;
3387 if (checkout_entry(ce, &costate, NULL, NULL) ||
3388 lstat(ce->name, st))
3389 return error(_("cannot checkout %s"), ce->name);
3390 return 0;
3391 }
3392
3393 static struct patch *previous_patch(struct apply_state *state,
3394 struct patch *patch,
3395 int *gone)
3396 {
3397 struct patch *previous;
3398
3399 *gone = 0;
3400 if (patch->is_copy || patch->is_rename)
3401 return NULL; /* "git" patches do not depend on the order */
3402
3403 previous = in_fn_table(state, patch->old_name);
3404 if (!previous)
3405 return NULL;
3406
3407 if (to_be_deleted(previous))
3408 return NULL; /* the deletion hasn't happened yet */
3409
3410 if (was_deleted(previous))
3411 *gone = 1;
3412
3413 return previous;
3414 }
3415
3416 static int verify_index_match(struct apply_state *state,
3417 const struct cache_entry *ce,
3418 struct stat *st)
3419 {
3420 if (S_ISGITLINK(ce->ce_mode)) {
3421 if (!S_ISDIR(st->st_mode))
3422 return -1;
3423 return 0;
3424 }
3425 return ie_match_stat(state->repo->index, ce, st,
3426 CE_MATCH_IGNORE_VALID | CE_MATCH_IGNORE_SKIP_WORKTREE);
3427 }
3428
3429 #define SUBMODULE_PATCH_WITHOUT_INDEX 1
3430
3431 static int load_patch_target(struct apply_state *state,
3432 struct strbuf *buf,
3433 const struct cache_entry *ce,
3434 struct stat *st,
3435 struct patch *patch,
3436 const char *name,
3437 unsigned expected_mode)
3438 {
3439 if (state->cached || state->check_index) {
3440 if (read_file_or_gitlink(ce, buf))
3441 return error(_("failed to read %s"), name);
3442 } else if (name) {
3443 if (S_ISGITLINK(expected_mode)) {
3444 if (ce)
3445 return read_file_or_gitlink(ce, buf);
3446 else
3447 return SUBMODULE_PATCH_WITHOUT_INDEX;
3448 } else if (has_symlink_leading_path(name, strlen(name))) {
3449 return error(_("reading from '%s' beyond a symbolic link"), name);
3450 } else {
3451 if (read_old_data(st, patch, name, buf))
3452 return error(_("failed to read %s"), name);
3453 }
3454 }
3455 return 0;
3456 }
3457
3458 /*
3459 * We are about to apply "patch"; populate the "image" with the
3460 * current version we have, from the working tree or from the index,
3461 * depending on the situation e.g. --cached/--index. If we are
3462 * applying a non-git patch that incrementally updates the tree,
3463 * we read from the result of a previous diff.
3464 */
3465 static int load_preimage(struct apply_state *state,
3466 struct image *image,
3467 struct patch *patch, struct stat *st,
3468 const struct cache_entry *ce)
3469 {
3470 struct strbuf buf = STRBUF_INIT;
3471 size_t len;
3472 char *img;
3473 struct patch *previous;
3474 int status;
3475
3476 previous = previous_patch(state, patch, &status);
3477 if (status)
3478 return error(_("path %s has been renamed/deleted"),
3479 patch->old_name);
3480 if (previous) {
3481 /* We have a patched copy in memory; use that. */
3482 strbuf_add(&buf, previous->result, previous->resultsize);
3483 } else {
3484 status = load_patch_target(state, &buf, ce, st, patch,
3485 patch->old_name, patch->old_mode);
3486 if (status < 0)
3487 return status;
3488 else if (status == SUBMODULE_PATCH_WITHOUT_INDEX) {
3489 /*
3490 * There is no way to apply subproject
3491 * patch without looking at the index.
3492 * NEEDSWORK: shouldn't this be flagged
3493 * as an error???
3494 */
3495 free_fragment_list(patch->fragments);
3496 patch->fragments = NULL;
3497 } else if (status) {
3498 return error(_("failed to read %s"), patch->old_name);
3499 }
3500 }
3501
3502 img = strbuf_detach(&buf, &len);
3503 prepare_image(image, img, len, !patch->is_binary);
3504 return 0;
3505 }
3506
3507 static int resolve_to(struct image *image, const struct object_id *result_id)
3508 {
3509 unsigned long size;
3510 enum object_type type;
3511
3512 clear_image(image);
3513
3514 image->buf = repo_read_object_file(the_repository, result_id, &type,
3515 &size);
3516 if (!image->buf || type != OBJ_BLOB)
3517 die("unable to read blob object %s", oid_to_hex(result_id));
3518 image->len = size;
3519
3520 return 0;
3521 }
3522
3523 static int three_way_merge(struct apply_state *state,
3524 struct image *image,
3525 char *path,
3526 const struct object_id *base,
3527 const struct object_id *ours,
3528 const struct object_id *theirs)
3529 {
3530 mmfile_t base_file, our_file, their_file;
3531 mmbuffer_t result = { NULL };
3532 enum ll_merge_result status;
3533
3534 /* resolve trivial cases first */
3535 if (oideq(base, ours))
3536 return resolve_to(image, theirs);
3537 else if (oideq(base, theirs) || oideq(ours, theirs))
3538 return resolve_to(image, ours);
3539
3540 read_mmblob(&base_file, base);
3541 read_mmblob(&our_file, ours);
3542 read_mmblob(&their_file, theirs);
3543 status = ll_merge(&result, path,
3544 &base_file, "base",
3545 &our_file, "ours",
3546 &their_file, "theirs",
3547 state->repo->index,
3548 NULL);
3549 if (status == LL_MERGE_BINARY_CONFLICT)
3550 warning("Cannot merge binary files: %s (%s vs. %s)",
3551 path, "ours", "theirs");
3552 free(base_file.ptr);
3553 free(our_file.ptr);
3554 free(their_file.ptr);
3555 if (status < 0 || !result.ptr) {
3556 free(result.ptr);
3557 return -1;
3558 }
3559 clear_image(image);
3560 image->buf = result.ptr;
3561 image->len = result.size;
3562
3563 return status;
3564 }
3565
3566 /*
3567 * When directly falling back to add/add three-way merge, we read from
3568 * the current contents of the new_name. In no cases other than that
3569 * this function will be called.
3570 */
3571 static int load_current(struct apply_state *state,
3572 struct image *image,
3573 struct patch *patch)
3574 {
3575 struct strbuf buf = STRBUF_INIT;
3576 int status, pos;
3577 size_t len;
3578 char *img;
3579 struct stat st;
3580 struct cache_entry *ce;
3581 char *name = patch->new_name;
3582 unsigned mode = patch->new_mode;
3583
3584 if (!patch->is_new)
3585 BUG("patch to %s is not a creation", patch->old_name);
3586
3587 pos = index_name_pos(state->repo->index, name, strlen(name));
3588 if (pos < 0)
3589 return error(_("%s: does not exist in index"), name);
3590 ce = state->repo->index->cache[pos];
3591 if (lstat(name, &st)) {
3592 if (errno != ENOENT)
3593 return error_errno("%s", name);
3594 if (checkout_target(state->repo->index, ce, &st))
3595 return -1;
3596 }
3597 if (verify_index_match(state, ce, &st))
3598 return error(_("%s: does not match index"), name);
3599
3600 status = load_patch_target(state, &buf, ce, &st, patch, name, mode);
3601 if (status < 0)
3602 return status;
3603 else if (status)
3604 return -1;
3605 img = strbuf_detach(&buf, &len);
3606 prepare_image(image, img, len, !patch->is_binary);
3607 return 0;
3608 }
3609
3610 static int try_threeway(struct apply_state *state,
3611 struct image *image,
3612 struct patch *patch,
3613 struct stat *st,
3614 const struct cache_entry *ce)
3615 {
3616 struct object_id pre_oid, post_oid, our_oid;
3617 struct strbuf buf = STRBUF_INIT;
3618 size_t len;
3619 int status;
3620 char *img;
3621 struct image tmp_image;
3622
3623 /* No point falling back to 3-way merge in these cases */
3624 if (patch->is_delete ||
3625 S_ISGITLINK(patch->old_mode) || S_ISGITLINK(patch->new_mode) ||
3626 (patch->is_new && !patch->direct_to_threeway) ||
3627 (patch->is_rename && !patch->lines_added && !patch->lines_deleted))
3628 return -1;
3629
3630 /* Preimage the patch was prepared for */
3631 if (patch->is_new)
3632 write_object_file("", 0, OBJ_BLOB, &pre_oid);
3633 else if (repo_get_oid(the_repository, patch->old_oid_prefix, &pre_oid) ||
3634 read_blob_object(&buf, &pre_oid, patch->old_mode))
3635 return error(_("repository lacks the necessary blob to perform 3-way merge."));
3636
3637 if (state->apply_verbosity > verbosity_silent && patch->direct_to_threeway)
3638 fprintf(stderr, _("Performing three-way merge...\n"));
3639
3640 img = strbuf_detach(&buf, &len);
3641 prepare_image(&tmp_image, img, len, 1);
3642 /* Apply the patch to get the post image */
3643 if (apply_fragments(state, &tmp_image, patch) < 0) {
3644 clear_image(&tmp_image);
3645 return -1;
3646 }
3647 /* post_oid is theirs */
3648 write_object_file(tmp_image.buf, tmp_image.len, OBJ_BLOB, &post_oid);
3649 clear_image(&tmp_image);
3650
3651 /* our_oid is ours */
3652 if (patch->is_new) {
3653 if (load_current(state, &tmp_image, patch))
3654 return error(_("cannot read the current contents of '%s'"),
3655 patch->new_name);
3656 } else {
3657 if (load_preimage(state, &tmp_image, patch, st, ce))
3658 return error(_("cannot read the current contents of '%s'"),
3659 patch->old_name);
3660 }
3661 write_object_file(tmp_image.buf, tmp_image.len, OBJ_BLOB, &our_oid);
3662 clear_image(&tmp_image);
3663
3664 /* in-core three-way merge between post and our using pre as base */
3665 status = three_way_merge(state, image, patch->new_name,
3666 &pre_oid, &our_oid, &post_oid);
3667 if (status < 0) {
3668 if (state->apply_verbosity > verbosity_silent)
3669 fprintf(stderr,
3670 _("Failed to perform three-way merge...\n"));
3671 return status;
3672 }
3673
3674 if (status) {
3675 patch->conflicted_threeway = 1;
3676 if (patch->is_new)
3677 oidclr(&patch->threeway_stage[0]);
3678 else
3679 oidcpy(&patch->threeway_stage[0], &pre_oid);
3680 oidcpy(&patch->threeway_stage[1], &our_oid);
3681 oidcpy(&patch->threeway_stage[2], &post_oid);
3682 if (state->apply_verbosity > verbosity_silent)
3683 fprintf(stderr,
3684 _("Applied patch to '%s' with conflicts.\n"),
3685 patch->new_name);
3686 } else {
3687 if (state->apply_verbosity > verbosity_silent)
3688 fprintf(stderr,
3689 _("Applied patch to '%s' cleanly.\n"),
3690 patch->new_name);
3691 }
3692 return 0;
3693 }
3694
3695 static int apply_data(struct apply_state *state, struct patch *patch,
3696 struct stat *st, const struct cache_entry *ce)
3697 {
3698 struct image image;
3699
3700 if (load_preimage(state, &image, patch, st, ce) < 0)
3701 return -1;
3702
3703 if (!state->threeway || try_threeway(state, &image, patch, st, ce) < 0) {
3704 if (state->apply_verbosity > verbosity_silent &&
3705 state->threeway && !patch->direct_to_threeway)
3706 fprintf(stderr, _("Falling back to direct application...\n"));
3707
3708 /* Note: with --reject, apply_fragments() returns 0 */
3709 if (patch->direct_to_threeway || apply_fragments(state, &image, patch) < 0)
3710 return -1;
3711 }
3712 patch->result = image.buf;
3713 patch->resultsize = image.len;
3714 add_to_fn_table(state, patch);
3715 free(image.line_allocated);
3716
3717 if (0 < patch->is_delete && patch->resultsize)
3718 return error(_("removal patch leaves file contents"));
3719
3720 return 0;
3721 }
3722
3723 /*
3724 * If "patch" that we are looking at modifies or deletes what we have,
3725 * we would want it not to lose any local modification we have, either
3726 * in the working tree or in the index.
3727 *
3728 * This also decides if a non-git patch is a creation patch or a
3729 * modification to an existing empty file. We do not check the state
3730 * of the current tree for a creation patch in this function; the caller
3731 * check_patch() separately makes sure (and errors out otherwise) that
3732 * the path the patch creates does not exist in the current tree.
3733 */
3734 static int check_preimage(struct apply_state *state,
3735 struct patch *patch,
3736 struct cache_entry **ce,
3737 struct stat *st)
3738 {
3739 const char *old_name = patch->old_name;
3740 struct patch *previous = NULL;
3741 int stat_ret = 0, status;
3742 unsigned st_mode = 0;
3743
3744 if (!old_name)
3745 return 0;
3746
3747 assert(patch->is_new <= 0);
3748 previous = previous_patch(state, patch, &status);
3749
3750 if (status)
3751 return error(_("path %s has been renamed/deleted"), old_name);
3752 if (previous) {
3753 st_mode = previous->new_mode;
3754 } else if (!state->cached) {
3755 stat_ret = lstat(old_name, st);
3756 if (stat_ret && errno != ENOENT)
3757 return error_errno("%s", old_name);
3758 }
3759
3760 if (state->check_index && !previous) {
3761 int pos = index_name_pos(state->repo->index, old_name,
3762 strlen(old_name));
3763 if (pos < 0) {
3764 if (patch->is_new < 0)
3765 goto is_new;
3766 return error(_("%s: does not exist in index"), old_name);
3767 }
3768 *ce = state->repo->index->cache[pos];
3769 if (stat_ret < 0) {
3770 if (checkout_target(state->repo->index, *ce, st))
3771 return -1;
3772 }
3773 if (!state->cached && verify_index_match(state, *ce, st))
3774 return error(_("%s: does not match index"), old_name);
3775 if (state->cached)
3776 st_mode = (*ce)->ce_mode;
3777 } else if (stat_ret < 0) {
3778 if (patch->is_new < 0)
3779 goto is_new;
3780 return error_errno("%s", old_name);
3781 }
3782
3783 if (!state->cached && !previous)
3784 st_mode = ce_mode_from_stat(*ce, st->st_mode);
3785
3786 if (patch->is_new < 0)
3787 patch->is_new = 0;
3788 if (!patch->old_mode)
3789 patch->old_mode = st_mode;
3790 if ((st_mode ^ patch->old_mode) & S_IFMT)
3791 return error(_("%s: wrong type"), old_name);
3792 if (st_mode != patch->old_mode)
3793 warning(_("%s has type %o, expected %o"),
3794 old_name, st_mode, patch->old_mode);
3795 if (!patch->new_mode && !patch->is_delete)
3796 patch->new_mode = st_mode;
3797 return 0;
3798
3799 is_new:
3800 patch->is_new = 1;
3801 patch->is_delete = 0;
3802 FREE_AND_NULL(patch->old_name);
3803 return 0;
3804 }
3805
3806
3807 #define EXISTS_IN_INDEX 1
3808 #define EXISTS_IN_WORKTREE 2
3809 #define EXISTS_IN_INDEX_AS_ITA 3
3810
3811 static int check_to_create(struct apply_state *state,
3812 const char *new_name,
3813 int ok_if_exists)
3814 {
3815 struct stat nst;
3816
3817 if (state->check_index && (!ok_if_exists || !state->cached)) {
3818 int pos;
3819
3820 pos = index_name_pos(state->repo->index, new_name, strlen(new_name));
3821 if (pos >= 0) {
3822 struct cache_entry *ce = state->repo->index->cache[pos];
3823
3824 /* allow ITA, as they do not yet exist in the index */
3825 if (!ok_if_exists && !(ce->ce_flags & CE_INTENT_TO_ADD))
3826 return EXISTS_IN_INDEX;
3827
3828 /* ITA entries can never match working tree files */
3829 if (!state->cached && (ce->ce_flags & CE_INTENT_TO_ADD))
3830 return EXISTS_IN_INDEX_AS_ITA;
3831 }
3832 }
3833
3834 if (state->cached)
3835 return 0;
3836
3837 if (!lstat(new_name, &nst)) {
3838 if (S_ISDIR(nst.st_mode) || ok_if_exists)
3839 return 0;
3840 /*
3841 * A leading component of new_name might be a symlink
3842 * that is going to be removed with this patch, but
3843 * still pointing at somewhere that has the path.
3844 * In such a case, path "new_name" does not exist as
3845 * far as git is concerned.
3846 */
3847 if (has_symlink_leading_path(new_name, strlen(new_name)))
3848 return 0;
3849
3850 return EXISTS_IN_WORKTREE;
3851 } else if (!is_missing_file_error(errno)) {
3852 return error_errno("%s", new_name);
3853 }
3854 return 0;
3855 }
3856
3857 static void prepare_symlink_changes(struct apply_state *state, struct patch *patch)
3858 {
3859 for ( ; patch; patch = patch->next) {
3860 if ((patch->old_name && S_ISLNK(patch->old_mode)) &&
3861 (patch->is_rename || patch->is_delete))
3862 /* the symlink at patch->old_name is removed */
3863 strset_add(&state->removed_symlinks, patch->old_name);
3864
3865 if (patch->new_name && S_ISLNK(patch->new_mode))
3866 /* the symlink at patch->new_name is created or remains */
3867 strset_add(&state->kept_symlinks, patch->new_name);
3868 }
3869 }
3870
3871 static int path_is_beyond_symlink_1(struct apply_state *state, struct strbuf *name)
3872 {
3873 do {
3874 while (--name->len && name->buf[name->len] != '/')
3875 ; /* scan backwards */
3876 if (!name->len)
3877 break;
3878 name->buf[name->len] = '\0';
3879 if (strset_contains(&state->kept_symlinks, name->buf))
3880 return 1;
3881 if (strset_contains(&state->removed_symlinks, name->buf))
3882 /*
3883 * This cannot be "return 0", because we may
3884 * see a new one created at a higher level.
3885 */
3886 continue;
3887
3888 /* otherwise, check the preimage */
3889 if (state->check_index) {
3890 struct cache_entry *ce;
3891
3892 ce = index_file_exists(state->repo->index, name->buf,
3893 name->len, ignore_case);
3894 if (ce && S_ISLNK(ce->ce_mode))
3895 return 1;
3896 } else {
3897 struct stat st;
3898 if (!lstat(name->buf, &st) && S_ISLNK(st.st_mode))
3899 return 1;
3900 }
3901 } while (1);
3902 return 0;
3903 }
3904
3905 static int path_is_beyond_symlink(struct apply_state *state, const char *name_)
3906 {
3907 int ret;
3908 struct strbuf name = STRBUF_INIT;
3909
3910 assert(*name_ != '\0');
3911 strbuf_addstr(&name, name_);
3912 ret = path_is_beyond_symlink_1(state, &name);
3913 strbuf_release(&name);
3914
3915 return ret;
3916 }
3917
3918 static int check_unsafe_path(struct patch *patch)
3919 {
3920 const char *old_name = NULL;
3921 const char *new_name = NULL;
3922 if (patch->is_delete)
3923 old_name = patch->old_name;
3924 else if (!patch->is_new && !patch->is_copy)
3925 old_name = patch->old_name;
3926 if (!patch->is_delete)
3927 new_name = patch->new_name;
3928
3929 if (old_name && !verify_path(old_name, patch->old_mode))
3930 return error(_("invalid path '%s'"), old_name);
3931 if (new_name && !verify_path(new_name, patch->new_mode))
3932 return error(_("invalid path '%s'"), new_name);
3933 return 0;
3934 }
3935
3936 /*
3937 * Check and apply the patch in-core; leave the result in patch->result
3938 * for the caller to write it out to the final destination.
3939 */
3940 static int check_patch(struct apply_state *state, struct patch *patch)
3941 {
3942 struct stat st;
3943 const char *old_name = patch->old_name;
3944 const char *new_name = patch->new_name;
3945 const char *name = old_name ? old_name : new_name;
3946 struct cache_entry *ce = NULL;
3947 struct patch *tpatch;
3948 int ok_if_exists;
3949 int status;
3950
3951 patch->rejected = 1; /* we will drop this after we succeed */
3952
3953 status = check_preimage(state, patch, &ce, &st);
3954 if (status)
3955 return status;
3956 old_name = patch->old_name;
3957
3958 /*
3959 * A type-change diff is always split into a patch to delete
3960 * old, immediately followed by a patch to create new (see
3961 * diff.c::run_diff()); in such a case it is Ok that the entry
3962 * to be deleted by the previous patch is still in the working
3963 * tree and in the index.
3964 *
3965 * A patch to swap-rename between A and B would first rename A
3966 * to B and then rename B to A. While applying the first one,
3967 * the presence of B should not stop A from getting renamed to
3968 * B; ask to_be_deleted() about the later rename. Removal of
3969 * B and rename from A to B is handled the same way by asking
3970 * was_deleted().
3971 */
3972 if ((tpatch = in_fn_table(state, new_name)) &&
3973 (was_deleted(tpatch) || to_be_deleted(tpatch)))
3974 ok_if_exists = 1;
3975 else
3976 ok_if_exists = 0;
3977
3978 if (new_name &&
3979 ((0 < patch->is_new) || patch->is_rename || patch->is_copy)) {
3980 int err = check_to_create(state, new_name, ok_if_exists);
3981
3982 if (err && state->threeway) {
3983 patch->direct_to_threeway = 1;
3984 } else switch (err) {
3985 case 0:
3986 break; /* happy */
3987 case EXISTS_IN_INDEX:
3988 return error(_("%s: already exists in index"), new_name);
3989 case EXISTS_IN_INDEX_AS_ITA:
3990 return error(_("%s: does not match index"), new_name);
3991 case EXISTS_IN_WORKTREE:
3992 return error(_("%s: already exists in working directory"),
3993 new_name);
3994 default:
3995 return err;
3996 }
3997
3998 if (!patch->new_mode) {
3999 if (0 < patch->is_new)
4000 patch->new_mode = S_IFREG | 0644;
4001 else
4002 patch->new_mode = patch->old_mode;
4003 }
4004 }
4005
4006 if (new_name && old_name) {
4007 int same = !strcmp(old_name, new_name);
4008 if (!patch->new_mode)
4009 patch->new_mode = patch->old_mode;
4010 if ((patch->old_mode ^ patch->new_mode) & S_IFMT) {
4011 if (same)
4012 return error(_("new mode (%o) of %s does not "
4013 "match old mode (%o)"),
4014 patch->new_mode, new_name,
4015 patch->old_mode);
4016 else
4017 return error(_("new mode (%o) of %s does not "
4018 "match old mode (%o) of %s"),
4019 patch->new_mode, new_name,
4020 patch->old_mode, old_name);
4021 }
4022 }
4023
4024 if (!state->unsafe_paths && check_unsafe_path(patch))
4025 return -128;
4026
4027 /*
4028 * An attempt to read from or delete a path that is beyond a
4029 * symbolic link will be prevented by load_patch_target() that
4030 * is called at the beginning of apply_data() so we do not
4031 * have to worry about a patch marked with "is_delete" bit
4032 * here. We however need to make sure that the patch result
4033 * is not deposited to a path that is beyond a symbolic link
4034 * here.
4035 */
4036 if (!patch->is_delete && path_is_beyond_symlink(state, patch->new_name))
4037 return error(_("affected file '%s' is beyond a symbolic link"),
4038 patch->new_name);
4039
4040 if (apply_data(state, patch, &st, ce) < 0)
4041 return error(_("%s: patch does not apply"), name);
4042 patch->rejected = 0;
4043 return 0;
4044 }
4045
4046 static int check_patch_list(struct apply_state *state, struct patch *patch)
4047 {
4048 int err = 0;
4049
4050 prepare_symlink_changes(state, patch);
4051 prepare_fn_table(state, patch);
4052 while (patch) {
4053 int res;
4054 if (state->apply_verbosity > verbosity_normal)
4055 say_patch_name(stderr,
4056 _("Checking patch %s..."), patch);
4057 res = check_patch(state, patch);
4058 if (res == -128)
4059 return -128;
4060 err |= res;
4061 patch = patch->next;
4062 }
4063 return err;
4064 }
4065
4066 static int read_apply_cache(struct apply_state *state)
4067 {
4068 if (state->index_file)
4069 return read_index_from(state->repo->index, state->index_file,
4070 get_git_dir());
4071 else
4072 return repo_read_index(state->repo);
4073 }
4074
4075 /* This function tries to read the object name from the current index */
4076 static int get_current_oid(struct apply_state *state, const char *path,
4077 struct object_id *oid)
4078 {
4079 int pos;
4080
4081 if (read_apply_cache(state) < 0)
4082 return -1;
4083 pos = index_name_pos(state->repo->index, path, strlen(path));
4084 if (pos < 0)
4085 return -1;
4086 oidcpy(oid, &state->repo->index->cache[pos]->oid);
4087 return 0;
4088 }
4089
4090 static int preimage_oid_in_gitlink_patch(struct patch *p, struct object_id *oid)
4091 {
4092 /*
4093 * A usable gitlink patch has only one fragment (hunk) that looks like:
4094 * @@ -1 +1 @@
4095 * -Subproject commit <old sha1>
4096 * +Subproject commit <new sha1>
4097 * or
4098 * @@ -1 +0,0 @@
4099 * -Subproject commit <old sha1>
4100 * for a removal patch.
4101 */
4102 struct fragment *hunk = p->fragments;
4103 static const char heading[] = "-Subproject commit ";
4104 char *preimage;
4105
4106 if (/* does the patch have only one hunk? */
4107 hunk && !hunk->next &&
4108 /* is its preimage one line? */
4109 hunk->oldpos == 1 && hunk->oldlines == 1 &&
4110 /* does preimage begin with the heading? */
4111 (preimage = memchr(hunk->patch, '\n', hunk->size)) != NULL &&
4112 starts_with(++preimage, heading) &&
4113 /* does it record full SHA-1? */
4114 !get_oid_hex(preimage + sizeof(heading) - 1, oid) &&
4115 preimage[sizeof(heading) + the_hash_algo->hexsz - 1] == '\n' &&
4116 /* does the abbreviated name on the index line agree with it? */
4117 starts_with(preimage + sizeof(heading) - 1, p->old_oid_prefix))
4118 return 0; /* it all looks fine */
4119
4120 /* we may have full object name on the index line */
4121 return get_oid_hex(p->old_oid_prefix, oid);
4122 }
4123
4124 /* Build an index that contains just the files needed for a 3way merge */
4125 static int build_fake_ancestor(struct apply_state *state, struct patch *list)
4126 {
4127 struct patch *patch;
4128 struct index_state result = INDEX_STATE_INIT(state->repo);
4129 struct lock_file lock = LOCK_INIT;
4130 int res;
4131
4132 /* Once we start supporting the reverse patch, it may be
4133 * worth showing the new sha1 prefix, but until then...
4134 */
4135 for (patch = list; patch; patch = patch->next) {
4136 struct object_id oid;
4137 struct cache_entry *ce;
4138 const char *name;
4139
4140 name = patch->old_name ? patch->old_name : patch->new_name;
4141 if (0 < patch->is_new)
4142 continue;
4143
4144 if (S_ISGITLINK(patch->old_mode)) {
4145 if (!preimage_oid_in_gitlink_patch(patch, &oid))
4146 ; /* ok, the textual part looks sane */
4147 else
4148 return error(_("sha1 information is lacking or "
4149 "useless for submodule %s"), name);
4150 } else if (!repo_get_oid_blob(the_repository, patch->old_oid_prefix, &oid)) {
4151 ; /* ok */
4152 } else if (!patch->lines_added && !patch->lines_deleted) {
4153 /* mode-only change: update the current */
4154 if (get_current_oid(state, patch->old_name, &oid))
4155 return error(_("mode change for %s, which is not "
4156 "in current HEAD"), name);
4157 } else
4158 return error(_("sha1 information is lacking or useless "
4159 "(%s)."), name);
4160
4161 ce = make_cache_entry(&result, patch->old_mode, &oid, name, 0, 0);
4162 if (!ce)
4163 return error(_("make_cache_entry failed for path '%s'"),
4164 name);
4165 if (add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD)) {
4166 discard_cache_entry(ce);
4167 return error(_("could not add %s to temporary index"),
4168 name);
4169 }
4170 }
4171
4172 hold_lock_file_for_update(&lock, state->fake_ancestor, LOCK_DIE_ON_ERROR);
4173 res = write_locked_index(&result, &lock, COMMIT_LOCK);
4174 discard_index(&result);
4175
4176 if (res)
4177 return error(_("could not write temporary index to %s"),
4178 state->fake_ancestor);
4179
4180 return 0;
4181 }
4182
4183 static void stat_patch_list(struct apply_state *state, struct patch *patch)
4184 {
4185 int files, adds, dels;
4186
4187 for (files = adds = dels = 0 ; patch ; patch = patch->next) {
4188 files++;
4189 adds += patch->lines_added;
4190 dels += patch->lines_deleted;
4191 show_stats(state, patch);
4192 }
4193
4194 print_stat_summary(stdout, files, adds, dels);
4195 }
4196
4197 static void numstat_patch_list(struct apply_state *state,
4198 struct patch *patch)
4199 {
4200 for ( ; patch; patch = patch->next) {
4201 const char *name;
4202 name = patch->new_name ? patch->new_name : patch->old_name;
4203 if (patch->is_binary)
4204 printf("-\t-\t");
4205 else
4206 printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);
4207 write_name_quoted(name, stdout, state->line_termination);
4208 }
4209 }
4210
4211 static void show_file_mode_name(const char *newdelete, unsigned int mode, const char *name)
4212 {
4213 if (mode)
4214 printf(" %s mode %06o %s\n", newdelete, mode, name);
4215 else
4216 printf(" %s %s\n", newdelete, name);
4217 }
4218
4219 static void show_mode_change(struct patch *p, int show_name)
4220 {
4221 if (p->old_mode && p->new_mode && p->old_mode != p->new_mode) {
4222 if (show_name)
4223 printf(" mode change %06o => %06o %s\n",
4224 p->old_mode, p->new_mode, p->new_name);
4225 else
4226 printf(" mode change %06o => %06o\n",
4227 p->old_mode, p->new_mode);
4228 }
4229 }
4230
4231 static void show_rename_copy(struct patch *p)
4232 {
4233 const char *renamecopy = p->is_rename ? "rename" : "copy";
4234 const char *old_name, *new_name;
4235
4236 /* Find common prefix */
4237 old_name = p->old_name;
4238 new_name = p->new_name;
4239 while (1) {
4240 const char *slash_old, *slash_new;
4241 slash_old = strchr(old_name, '/');
4242 slash_new = strchr(new_name, '/');
4243 if (!slash_old ||
4244 !slash_new ||
4245 slash_old - old_name != slash_new - new_name ||
4246 memcmp(old_name, new_name, slash_new - new_name))
4247 break;
4248 old_name = slash_old + 1;
4249 new_name = slash_new + 1;
4250 }
4251 /* p->old_name through old_name is the common prefix, and old_name and
4252 * new_name through the end of names are renames
4253 */
4254 if (old_name != p->old_name)
4255 printf(" %s %.*s{%s => %s} (%d%%)\n", renamecopy,
4256 (int)(old_name - p->old_name), p->old_name,
4257 old_name, new_name, p->score);
4258 else
4259 printf(" %s %s => %s (%d%%)\n", renamecopy,
4260 p->old_name, p->new_name, p->score);
4261 show_mode_change(p, 0);
4262 }
4263
4264 static void summary_patch_list(struct patch *patch)
4265 {
4266 struct patch *p;
4267
4268 for (p = patch; p; p = p->next) {
4269 if (p->is_new)
4270 show_file_mode_name("create", p->new_mode, p->new_name);
4271 else if (p->is_delete)
4272 show_file_mode_name("delete", p->old_mode, p->old_name);
4273 else {
4274 if (p->is_rename || p->is_copy)
4275 show_rename_copy(p);
4276 else {
4277 if (p->score) {
4278 printf(" rewrite %s (%d%%)\n",
4279 p->new_name, p->score);
4280 show_mode_change(p, 0);
4281 }
4282 else
4283 show_mode_change(p, 1);
4284 }
4285 }
4286 }
4287 }
4288
4289 static void patch_stats(struct apply_state *state, struct patch *patch)
4290 {
4291 int lines = patch->lines_added + patch->lines_deleted;
4292
4293 if (lines > state->max_change)
4294 state->max_change = lines;
4295 if (patch->old_name) {
4296 int len = quote_c_style(patch->old_name, NULL, NULL, 0);
4297 if (!len)
4298 len = strlen(patch->old_name);
4299 if (len > state->max_len)
4300 state->max_len = len;
4301 }
4302 if (patch->new_name) {
4303 int len = quote_c_style(patch->new_name, NULL, NULL, 0);
4304 if (!len)
4305 len = strlen(patch->new_name);
4306 if (len > state->max_len)
4307 state->max_len = len;
4308 }
4309 }
4310
4311 static int remove_file(struct apply_state *state, struct patch *patch, int rmdir_empty)
4312 {
4313 if (state->update_index && !state->ita_only) {
4314 if (remove_file_from_index(state->repo->index, patch->old_name) < 0)
4315 return error(_("unable to remove %s from index"), patch->old_name);
4316 }
4317 if (!state->cached) {
4318 if (!remove_or_warn(patch->old_mode, patch->old_name) && rmdir_empty) {
4319 remove_path(patch->old_name);
4320 }
4321 }
4322 return 0;
4323 }
4324
4325 static int add_index_file(struct apply_state *state,
4326 const char *path,
4327 unsigned mode,
4328 void *buf,
4329 unsigned long size)
4330 {
4331 struct stat st;
4332 struct cache_entry *ce;
4333 int namelen = strlen(path);
4334
4335 ce = make_empty_cache_entry(state->repo->index, namelen);
4336 memcpy(ce->name, path, namelen);
4337 ce->ce_mode = create_ce_mode(mode);
4338 ce->ce_flags = create_ce_flags(0);
4339 ce->ce_namelen = namelen;
4340 if (state->ita_only) {
4341 ce->ce_flags |= CE_INTENT_TO_ADD;
4342 set_object_name_for_intent_to_add_entry(ce);
4343 } else if (S_ISGITLINK(mode)) {
4344 const char *s;
4345
4346 if (!skip_prefix(buf, "Subproject commit ", &s) ||
4347 get_oid_hex(s, &ce->oid)) {
4348 discard_cache_entry(ce);
4349 return error(_("corrupt patch for submodule %s"), path);
4350 }
4351 } else {
4352 if (!state->cached) {
4353 if (lstat(path, &st) < 0) {
4354 discard_cache_entry(ce);
4355 return error_errno(_("unable to stat newly "
4356 "created file '%s'"),
4357 path);
4358 }
4359 fill_stat_cache_info(state->repo->index, ce, &st);
4360 }
4361 if (write_object_file(buf, size, OBJ_BLOB, &ce->oid) < 0) {
4362 discard_cache_entry(ce);
4363 return error(_("unable to create backing store "
4364 "for newly created file %s"), path);
4365 }
4366 }
4367 if (add_index_entry(state->repo->index, ce, ADD_CACHE_OK_TO_ADD) < 0) {
4368 discard_cache_entry(ce);
4369 return error(_("unable to add cache entry for %s"), path);
4370 }
4371
4372 return 0;
4373 }
4374
4375 /*
4376 * Returns:
4377 * -1 if an unrecoverable error happened
4378 * 0 if everything went well
4379 * 1 if a recoverable error happened
4380 */
4381 static int try_create_file(struct apply_state *state, const char *path,
4382 unsigned int mode, const char *buf,
4383 unsigned long size)
4384 {
4385 int fd, res;
4386 struct strbuf nbuf = STRBUF_INIT;
4387
4388 if (S_ISGITLINK(mode)) {
4389 struct stat st;
4390 if (!lstat(path, &st) && S_ISDIR(st.st_mode))
4391 return 0;
4392 return !!mkdir(path, 0777);
4393 }
4394
4395 if (has_symlinks && S_ISLNK(mode))
4396 /* Although buf:size is counted string, it also is NUL
4397 * terminated.
4398 */
4399 return !!symlink(buf, path);
4400
4401 fd = open(path, O_CREAT | O_EXCL | O_WRONLY, (mode & 0100) ? 0777 : 0666);
4402 if (fd < 0)
4403 return 1;
4404
4405 if (convert_to_working_tree(state->repo->index, path, buf, size, &nbuf, NULL)) {
4406 size = nbuf.len;
4407 buf = nbuf.buf;
4408 }
4409
4410 res = write_in_full(fd, buf, size) < 0;
4411 if (res)
4412 error_errno(_("failed to write to '%s'"), path);
4413 strbuf_release(&nbuf);
4414
4415 if (close(fd) < 0 && !res)
4416 return error_errno(_("closing file '%s'"), path);
4417
4418 return res ? -1 : 0;
4419 }
4420
4421 /*
4422 * We optimistically assume that the directories exist,
4423 * which is true 99% of the time anyway. If they don't,
4424 * we create them and try again.
4425 *
4426 * Returns:
4427 * -1 on error
4428 * 0 otherwise
4429 */
4430 static int create_one_file(struct apply_state *state,
4431 char *path,
4432 unsigned mode,
4433 const char *buf,
4434 unsigned long size)
4435 {
4436 int res;
4437
4438 if (state->cached)
4439 return 0;
4440
4441 /*
4442 * We already try to detect whether files are beyond a symlink in our
4443 * up-front checks. But in the case where symlinks are created by any
4444 * of the intermediate hunks it can happen that our up-front checks
4445 * didn't yet see the symlink, but at the point of arriving here there
4446 * in fact is one. We thus repeat the check for symlinks here.
4447 *
4448 * Note that this does not make the up-front check obsolete as the
4449 * failure mode is different:
4450 *
4451 * - The up-front checks cause us to abort before we have written
4452 * anything into the working directory. So when we exit this way the
4453 * working directory remains clean.
4454 *
4455 * - The checks here happen in the middle of the action where we have
4456 * already started to apply the patch. The end result will be a dirty
4457 * working directory.
4458 *
4459 * Ideally, we should update the up-front checks to catch what would
4460 * happen when we apply the patch before we damage the working tree.
4461 * We have all the information necessary to do so. But for now, as a
4462 * part of embargoed security work, having this check would serve as a
4463 * reasonable first step.
4464 */
4465 if (path_is_beyond_symlink(state, path))
4466 return error(_("affected file '%s' is beyond a symbolic link"), path);
4467
4468 res = try_create_file(state, path, mode, buf, size);
4469 if (res < 0)
4470 return -1;
4471 if (!res)
4472 return 0;
4473
4474 if (errno == ENOENT) {
4475 if (safe_create_leading_directories_no_share(path))
4476 return 0;
4477 res = try_create_file(state, path, mode, buf, size);
4478 if (res < 0)
4479 return -1;
4480 if (!res)
4481 return 0;
4482 }
4483
4484 if (errno == EEXIST || errno == EACCES) {
4485 /* We may be trying to create a file where a directory
4486 * used to be.
4487 */
4488 struct stat st;
4489 if (!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))
4490 errno = EEXIST;
4491 }
4492
4493 if (errno == EEXIST) {
4494 unsigned int nr = getpid();
4495
4496 for (;;) {
4497 char newpath[PATH_MAX];
4498 mksnpath(newpath, sizeof(newpath), "%s~%u", path, nr);
4499 res = try_create_file(state, newpath, mode, buf, size);
4500 if (res < 0)
4501 return -1;
4502 if (!res) {
4503 if (!rename(newpath, path))
4504 return 0;
4505 unlink_or_warn(newpath);
4506 break;
4507 }
4508 if (errno != EEXIST)
4509 break;
4510 ++nr;
4511 }
4512 }
4513 return error_errno(_("unable to write file '%s' mode %o"),
4514 path, mode);
4515 }
4516
4517 static int add_conflicted_stages_file(struct apply_state *state,
4518 struct patch *patch)
4519 {
4520 int stage, namelen;
4521 unsigned mode;
4522 struct cache_entry *ce;
4523
4524 if (!state->update_index)
4525 return 0;
4526 namelen = strlen(patch->new_name);
4527 mode = patch->new_mode ? patch->new_mode : (S_IFREG | 0644);
4528
4529 remove_file_from_index(state->repo->index, patch->new_name);
4530 for (stage = 1; stage < 4; stage++) {
4531 if (is_null_oid(&patch->threeway_stage[stage - 1]))
4532 continue;
4533 ce = make_empty_cache_entry(state->repo->index, namelen);
4534 memcpy(ce->name, patch->new_name, namelen);
4535 ce->ce_mode = create_ce_mode(mode);
4536 ce->ce_flags = create_ce_flags(stage);
4537 ce->ce_namelen = namelen;
4538 oidcpy(&ce->oid, &patch->threeway_stage[stage - 1]);
4539 if (add_index_entry(state->repo->index, ce, ADD_CACHE_OK_TO_ADD) < 0) {
4540 discard_cache_entry(ce);
4541 return error(_("unable to add cache entry for %s"),
4542 patch->new_name);
4543 }
4544 }
4545
4546 return 0;
4547 }
4548
4549 static int create_file(struct apply_state *state, struct patch *patch)
4550 {
4551 char *path = patch->new_name;
4552 unsigned mode = patch->new_mode;
4553 unsigned long size = patch->resultsize;
4554 char *buf = patch->result;
4555
4556 if (!mode)
4557 mode = S_IFREG | 0644;
4558 if (create_one_file(state, path, mode, buf, size))
4559 return -1;
4560
4561 if (patch->conflicted_threeway)
4562 return add_conflicted_stages_file(state, patch);
4563 else if (state->update_index)
4564 return add_index_file(state, path, mode, buf, size);
4565 return 0;
4566 }
4567
4568 /* phase zero is to remove, phase one is to create */
4569 static int write_out_one_result(struct apply_state *state,
4570 struct patch *patch,
4571 int phase)
4572 {
4573 if (patch->is_delete > 0) {
4574 if (phase == 0)
4575 return remove_file(state, patch, 1);
4576 return 0;
4577 }
4578 if (patch->is_new > 0 || patch->is_copy) {
4579 if (phase == 1)
4580 return create_file(state, patch);
4581 return 0;
4582 }
4583 /*
4584 * Rename or modification boils down to the same
4585 * thing: remove the old, write the new
4586 */
4587 if (phase == 0)
4588 return remove_file(state, patch, patch->is_rename);
4589 if (phase == 1)
4590 return create_file(state, patch);
4591 return 0;
4592 }
4593
4594 static int write_out_one_reject(struct apply_state *state, struct patch *patch)
4595 {
4596 FILE *rej;
4597 char namebuf[PATH_MAX];
4598 struct fragment *frag;
4599 int fd, cnt = 0;
4600 struct strbuf sb = STRBUF_INIT;
4601
4602 for (cnt = 0, frag = patch->fragments; frag; frag = frag->next) {
4603 if (!frag->rejected)
4604 continue;
4605 cnt++;
4606 }
4607
4608 if (!cnt) {
4609 if (state->apply_verbosity > verbosity_normal)
4610 say_patch_name(stderr,
4611 _("Applied patch %s cleanly."), patch);
4612 return 0;
4613 }
4614
4615 /* This should not happen, because a removal patch that leaves
4616 * contents are marked "rejected" at the patch level.
4617 */
4618 if (!patch->new_name)
4619 die(_("internal error"));
4620
4621 /* Say this even without --verbose */
4622 strbuf_addf(&sb, Q_("Applying patch %%s with %d reject...",
4623 "Applying patch %%s with %d rejects...",
4624 cnt),
4625 cnt);
4626 if (state->apply_verbosity > verbosity_silent)
4627 say_patch_name(stderr, sb.buf, patch);
4628 strbuf_release(&sb);
4629
4630 cnt = strlen(patch->new_name);
4631 if (ARRAY_SIZE(namebuf) <= cnt + 5) {
4632 cnt = ARRAY_SIZE(namebuf) - 5;
4633 warning(_("truncating .rej filename to %.*s.rej"),
4634 cnt - 1, patch->new_name);
4635 }
4636 memcpy(namebuf, patch->new_name, cnt);
4637 memcpy(namebuf + cnt, ".rej", 5);
4638
4639 fd = open(namebuf, O_CREAT | O_EXCL | O_WRONLY, 0666);
4640 if (fd < 0) {
4641 if (errno != EEXIST)
4642 return error_errno(_("cannot open %s"), namebuf);
4643 if (unlink(namebuf))
4644 return error_errno(_("cannot unlink '%s'"), namebuf);
4645 fd = open(namebuf, O_CREAT | O_EXCL | O_WRONLY, 0666);
4646 if (fd < 0)
4647 return error_errno(_("cannot open %s"), namebuf);
4648 }
4649 rej = fdopen(fd, "w");
4650 if (!rej)
4651 return error_errno(_("cannot open %s"), namebuf);
4652
4653 /* Normal git tools never deal with .rej, so do not pretend
4654 * this is a git patch by saying --git or giving extended
4655 * headers. While at it, maybe please "kompare" that wants
4656 * the trailing TAB and some garbage at the end of line ;-).
4657 */
4658 fprintf(rej, "diff a/%s b/%s\t(rejected hunks)\n",
4659 patch->new_name, patch->new_name);
4660 for (cnt = 1, frag = patch->fragments;
4661 frag;
4662 cnt++, frag = frag->next) {
4663 if (!frag->rejected) {
4664 if (state->apply_verbosity > verbosity_silent)
4665 fprintf_ln(stderr, _("Hunk #%d applied cleanly."), cnt);
4666 continue;
4667 }
4668 if (state->apply_verbosity > verbosity_silent)
4669 fprintf_ln(stderr, _("Rejected hunk #%d."), cnt);
4670 fprintf(rej, "%.*s", frag->size, frag->patch);
4671 if (frag->patch[frag->size-1] != '\n')
4672 fputc('\n', rej);
4673 }
4674 fclose(rej);
4675 return -1;
4676 }
4677
4678 /*
4679 * Returns:
4680 * -1 if an error happened
4681 * 0 if the patch applied cleanly
4682 * 1 if the patch did not apply cleanly
4683 */
4684 static int write_out_results(struct apply_state *state, struct patch *list)
4685 {
4686 int phase;
4687 int errs = 0;
4688 struct patch *l;
4689 struct string_list cpath = STRING_LIST_INIT_DUP;
4690
4691 for (phase = 0; phase < 2; phase++) {
4692 l = list;
4693 while (l) {
4694 if (l->rejected)
4695 errs = 1;
4696 else {
4697 if (write_out_one_result(state, l, phase)) {
4698 string_list_clear(&cpath, 0);
4699 return -1;
4700 }
4701 if (phase == 1) {
4702 if (write_out_one_reject(state, l))
4703 errs = 1;
4704 if (l->conflicted_threeway) {
4705 string_list_append(&cpath, l->new_name);
4706 errs = 1;
4707 }
4708 }
4709 }
4710 l = l->next;
4711 }
4712 }
4713
4714 if (cpath.nr) {
4715 struct string_list_item *item;
4716
4717 string_list_sort(&cpath);
4718 if (state->apply_verbosity > verbosity_silent) {
4719 for_each_string_list_item(item, &cpath)
4720 fprintf(stderr, "U %s\n", item->string);
4721 }
4722 string_list_clear(&cpath, 0);
4723
4724 /*
4725 * rerere relies on the partially merged result being in the working
4726 * tree with conflict markers, but that isn't written with --cached.
4727 */
4728 if (!state->cached)
4729 repo_rerere(state->repo, 0);
4730 }
4731
4732 return errs;
4733 }
4734
4735 /*
4736 * Try to apply a patch.
4737 *
4738 * Returns:
4739 * -128 if a bad error happened (like patch unreadable)
4740 * -1 if patch did not apply and user cannot deal with it
4741 * 0 if the patch applied
4742 * 1 if the patch did not apply but user might fix it
4743 */
4744 static int apply_patch(struct apply_state *state,
4745 int fd,
4746 const char *filename,
4747 int options)
4748 {
4749 size_t offset;
4750 struct strbuf buf = STRBUF_INIT; /* owns the patch text */
4751 struct patch *list = NULL, **listp = &list;
4752 int skipped_patch = 0;
4753 int res = 0;
4754 int flush_attributes = 0;
4755
4756 state->patch_input_file = filename;
4757 if (read_patch_file(&buf, fd) < 0)
4758 return -128;
4759 offset = 0;
4760 while (offset < buf.len) {
4761 struct patch *patch;
4762 int nr;
4763
4764 CALLOC_ARRAY(patch, 1);
4765 patch->inaccurate_eof = !!(options & APPLY_OPT_INACCURATE_EOF);
4766 patch->recount = !!(options & APPLY_OPT_RECOUNT);
4767 nr = parse_chunk(state, buf.buf + offset, buf.len - offset, patch);
4768 if (nr < 0) {
4769 free_patch(patch);
4770 if (nr == -128) {
4771 res = -128;
4772 goto end;
4773 }
4774 break;
4775 }
4776 if (state->apply_in_reverse)
4777 reverse_patches(patch);
4778 if (use_patch(state, patch)) {
4779 patch_stats(state, patch);
4780 if (!list || !state->apply_in_reverse) {
4781 *listp = patch;
4782 listp = &patch->next;
4783 } else {
4784 patch->next = list;
4785 list = patch;
4786 }
4787
4788 if ((patch->new_name &&
4789 ends_with_path_components(patch->new_name,
4790 GITATTRIBUTES_FILE)) ||
4791 (patch->old_name &&
4792 ends_with_path_components(patch->old_name,
4793 GITATTRIBUTES_FILE)))
4794 flush_attributes = 1;
4795 }
4796 else {
4797 if (state->apply_verbosity > verbosity_normal)
4798 say_patch_name(stderr, _("Skipped patch '%s'."), patch);
4799 free_patch(patch);
4800 skipped_patch++;
4801 }
4802 offset += nr;
4803 }
4804
4805 if (!list && !skipped_patch) {
4806 if (!state->allow_empty) {
4807 error(_("No valid patches in input (allow with \"--allow-empty\")"));
4808 res = -128;
4809 }
4810 goto end;
4811 }
4812
4813 if (state->whitespace_error && (state->ws_error_action == die_on_ws_error))
4814 state->apply = 0;
4815
4816 state->update_index = (state->check_index || state->ita_only) && state->apply;
4817 if (state->update_index && !is_lock_file_locked(&state->lock_file)) {
4818 if (state->index_file)
4819 hold_lock_file_for_update(&state->lock_file,
4820 state->index_file,
4821 LOCK_DIE_ON_ERROR);
4822 else
4823 repo_hold_locked_index(state->repo, &state->lock_file,
4824 LOCK_DIE_ON_ERROR);
4825 }
4826
4827 if (state->check_index && read_apply_cache(state) < 0) {
4828 error(_("unable to read index file"));
4829 res = -128;
4830 goto end;
4831 }
4832
4833 if (state->check || state->apply) {
4834 int r = check_patch_list(state, list);
4835 if (r == -128) {
4836 res = -128;
4837 goto end;
4838 }
4839 if (r < 0 && !state->apply_with_reject) {
4840 res = -1;
4841 goto end;
4842 }
4843 }
4844
4845 if (state->apply) {
4846 int write_res = write_out_results(state, list);
4847 if (write_res < 0) {
4848 res = -128;
4849 goto end;
4850 }
4851 if (write_res > 0) {
4852 /* with --3way, we still need to write the index out */
4853 res = state->apply_with_reject ? -1 : 1;
4854 goto end;
4855 }
4856 }
4857
4858 if (state->fake_ancestor &&
4859 build_fake_ancestor(state, list)) {
4860 res = -128;
4861 goto end;
4862 }
4863
4864 if (state->diffstat && state->apply_verbosity > verbosity_silent)
4865 stat_patch_list(state, list);
4866
4867 if (state->numstat && state->apply_verbosity > verbosity_silent)
4868 numstat_patch_list(state, list);
4869
4870 if (state->summary && state->apply_verbosity > verbosity_silent)
4871 summary_patch_list(list);
4872
4873 if (flush_attributes)
4874 reset_parsed_attributes();
4875 end:
4876 free_patch_list(list);
4877 strbuf_release(&buf);
4878 string_list_clear(&state->fn_table, 0);
4879 return res;
4880 }
4881
4882 static int apply_option_parse_exclude(const struct option *opt,
4883 const char *arg, int unset)
4884 {
4885 struct apply_state *state = opt->value;
4886
4887 BUG_ON_OPT_NEG(unset);
4888
4889 add_name_limit(state, arg, 1);
4890 return 0;
4891 }
4892
4893 static int apply_option_parse_include(const struct option *opt,
4894 const char *arg, int unset)
4895 {
4896 struct apply_state *state = opt->value;
4897
4898 BUG_ON_OPT_NEG(unset);
4899
4900 add_name_limit(state, arg, 0);
4901 state->has_include = 1;
4902 return 0;
4903 }
4904
4905 static int apply_option_parse_p(const struct option *opt,
4906 const char *arg,
4907 int unset)
4908 {
4909 struct apply_state *state = opt->value;
4910
4911 BUG_ON_OPT_NEG(unset);
4912
4913 state->p_value = atoi(arg);
4914 state->p_value_known = 1;
4915 return 0;
4916 }
4917
4918 static int apply_option_parse_space_change(const struct option *opt,
4919 const char *arg, int unset)
4920 {
4921 struct apply_state *state = opt->value;
4922
4923 BUG_ON_OPT_ARG(arg);
4924
4925 if (unset)
4926 state->ws_ignore_action = ignore_ws_none;
4927 else
4928 state->ws_ignore_action = ignore_ws_change;
4929 return 0;
4930 }
4931
4932 static int apply_option_parse_whitespace(const struct option *opt,
4933 const char *arg, int unset)
4934 {
4935 struct apply_state *state = opt->value;
4936
4937 BUG_ON_OPT_NEG(unset);
4938
4939 state->whitespace_option = arg;
4940 if (parse_whitespace_option(state, arg))
4941 return -1;
4942 return 0;
4943 }
4944
4945 static int apply_option_parse_directory(const struct option *opt,
4946 const char *arg, int unset)
4947 {
4948 struct apply_state *state = opt->value;
4949
4950 BUG_ON_OPT_NEG(unset);
4951
4952 strbuf_reset(&state->root);
4953 strbuf_addstr(&state->root, arg);
4954 strbuf_complete(&state->root, '/');
4955 return 0;
4956 }
4957
4958 int apply_all_patches(struct apply_state *state,
4959 int argc,
4960 const char **argv,
4961 int options)
4962 {
4963 int i;
4964 int res;
4965 int errs = 0;
4966 int read_stdin = 1;
4967
4968 for (i = 0; i < argc; i++) {
4969 const char *arg = argv[i];
4970 char *to_free = NULL;
4971 int fd;
4972
4973 if (!strcmp(arg, "-")) {
4974 res = apply_patch(state, 0, "<stdin>", options);
4975 if (res < 0)
4976 goto end;
4977 errs |= res;
4978 read_stdin = 0;
4979 continue;
4980 } else
4981 arg = to_free = prefix_filename(state->prefix, arg);
4982
4983 fd = open(arg, O_RDONLY);
4984 if (fd < 0) {
4985 error(_("can't open patch '%s': %s"), arg, strerror(errno));
4986 res = -128;
4987 free(to_free);
4988 goto end;
4989 }
4990 read_stdin = 0;
4991 set_default_whitespace_mode(state);
4992 res = apply_patch(state, fd, arg, options);
4993 close(fd);
4994 free(to_free);
4995 if (res < 0)
4996 goto end;
4997 errs |= res;
4998 }
4999 set_default_whitespace_mode(state);
5000 if (read_stdin) {
5001 res = apply_patch(state, 0, "<stdin>", options);
5002 if (res < 0)
5003 goto end;
5004 errs |= res;
5005 }
5006
5007 if (state->whitespace_error) {
5008 if (state->squelch_whitespace_errors &&
5009 state->squelch_whitespace_errors < state->whitespace_error) {
5010 int squelched =
5011 state->whitespace_error - state->squelch_whitespace_errors;
5012 warning(Q_("squelched %d whitespace error",
5013 "squelched %d whitespace errors",
5014 squelched),
5015 squelched);
5016 }
5017 if (state->ws_error_action == die_on_ws_error) {
5018 error(Q_("%d line adds whitespace errors.",
5019 "%d lines add whitespace errors.",
5020 state->whitespace_error),
5021 state->whitespace_error);
5022 res = -128;
5023 goto end;
5024 }
5025 if (state->applied_after_fixing_ws && state->apply)
5026 warning(Q_("%d line applied after"
5027 " fixing whitespace errors.",
5028 "%d lines applied after"
5029 " fixing whitespace errors.",
5030 state->applied_after_fixing_ws),
5031 state->applied_after_fixing_ws);
5032 else if (state->whitespace_error)
5033 warning(Q_("%d line adds whitespace errors.",
5034 "%d lines add whitespace errors.",
5035 state->whitespace_error),
5036 state->whitespace_error);
5037 }
5038
5039 if (state->update_index) {
5040 res = write_locked_index(state->repo->index, &state->lock_file, COMMIT_LOCK);
5041 if (res) {
5042 error(_("Unable to write new index file"));
5043 res = -128;
5044 goto end;
5045 }
5046 }
5047
5048 res = !!errs;
5049
5050 end:
5051 rollback_lock_file(&state->lock_file);
5052
5053 if (state->apply_verbosity <= verbosity_silent) {
5054 set_error_routine(state->saved_error_routine);
5055 set_warn_routine(state->saved_warn_routine);
5056 }
5057
5058 if (res > -1)
5059 return res;
5060 return (res == -1 ? 1 : 128);
5061 }
5062
5063 int apply_parse_options(int argc, const char **argv,
5064 struct apply_state *state,
5065 int *force_apply, int *options,
5066 const char * const *apply_usage)
5067 {
5068 struct option builtin_apply_options[] = {
5069 OPT_CALLBACK_F(0, "exclude", state, N_("path"),
5070 N_("don't apply changes matching the given path"),
5071 PARSE_OPT_NONEG, apply_option_parse_exclude),
5072 OPT_CALLBACK_F(0, "include", state, N_("path"),
5073 N_("apply changes matching the given path"),
5074 PARSE_OPT_NONEG, apply_option_parse_include),
5075 OPT_CALLBACK('p', NULL, state, N_("num"),
5076 N_("remove <num> leading slashes from traditional diff paths"),
5077 apply_option_parse_p),
5078 OPT_BOOL(0, "no-add", &state->no_add,
5079 N_("ignore additions made by the patch")),
5080 OPT_BOOL(0, "stat", &state->diffstat,
5081 N_("instead of applying the patch, output diffstat for the input")),
5082 OPT_NOOP_NOARG(0, "allow-binary-replacement"),
5083 OPT_NOOP_NOARG(0, "binary"),
5084 OPT_BOOL(0, "numstat", &state->numstat,
5085 N_("show number of added and deleted lines in decimal notation")),
5086 OPT_BOOL(0, "summary", &state->summary,
5087 N_("instead of applying the patch, output a summary for the input")),
5088 OPT_BOOL(0, "check", &state->check,
5089 N_("instead of applying the patch, see if the patch is applicable")),
5090 OPT_BOOL(0, "index", &state->check_index,
5091 N_("make sure the patch is applicable to the current index")),
5092 OPT_BOOL('N', "intent-to-add", &state->ita_only,
5093 N_("mark new files with `git add --intent-to-add`")),
5094 OPT_BOOL(0, "cached", &state->cached,
5095 N_("apply a patch without touching the working tree")),
5096 OPT_BOOL_F(0, "unsafe-paths", &state->unsafe_paths,
5097 N_("accept a patch that touches outside the working area"),
5098 PARSE_OPT_NOCOMPLETE),
5099 OPT_BOOL(0, "apply", force_apply,
5100 N_("also apply the patch (use with --stat/--summary/--check)")),
5101 OPT_BOOL('3', "3way", &state->threeway,
5102 N_( "attempt three-way merge, fall back on normal patch if that fails")),
5103 OPT_FILENAME(0, "build-fake-ancestor", &state->fake_ancestor,
5104 N_("build a temporary index based on embedded index information")),
5105 /* Think twice before adding "--nul" synonym to this */
5106 OPT_SET_INT('z', NULL, &state->line_termination,
5107 N_("paths are separated with NUL character"), '\0'),
5108 OPT_INTEGER('C', NULL, &state->p_context,
5109 N_("ensure at least <n> lines of context match")),
5110 OPT_CALLBACK(0, "whitespace", state, N_("action"),
5111 N_("detect new or modified lines that have whitespace errors"),
5112 apply_option_parse_whitespace),
5113 OPT_CALLBACK_F(0, "ignore-space-change", state, NULL,
5114 N_("ignore changes in whitespace when finding context"),
5115 PARSE_OPT_NOARG, apply_option_parse_space_change),
5116 OPT_CALLBACK_F(0, "ignore-whitespace", state, NULL,
5117 N_("ignore changes in whitespace when finding context"),
5118 PARSE_OPT_NOARG, apply_option_parse_space_change),
5119 OPT_BOOL('R', "reverse", &state->apply_in_reverse,
5120 N_("apply the patch in reverse")),
5121 OPT_BOOL(0, "unidiff-zero", &state->unidiff_zero,
5122 N_("don't expect at least one line of context")),
5123 OPT_BOOL(0, "reject", &state->apply_with_reject,
5124 N_("leave the rejected hunks in corresponding *.rej files")),
5125 OPT_BOOL(0, "allow-overlap", &state->allow_overlap,
5126 N_("allow overlapping hunks")),
5127 OPT__VERBOSITY(&state->apply_verbosity),
5128 OPT_BIT(0, "inaccurate-eof", options,
5129 N_("tolerate incorrectly detected missing new-line at the end of file"),
5130 APPLY_OPT_INACCURATE_EOF),
5131 OPT_BIT(0, "recount", options,
5132 N_("do not trust the line counts in the hunk headers"),
5133 APPLY_OPT_RECOUNT),
5134 OPT_CALLBACK(0, "directory", state, N_("root"),
5135 N_("prepend <root> to all filenames"),
5136 apply_option_parse_directory),
5137 OPT_BOOL(0, "allow-empty", &state->allow_empty,
5138 N_("don't return error for empty patches")),
5139 OPT_END()
5140 };
5141
5142 return parse_options(argc, argv, state->prefix, builtin_apply_options, apply_usage, 0);
5143 }