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