4 * Copyright (C) Linus Torvalds, 2005
6 * This applies patches on top of some (arbitrary) version of the SCM.
10 #include "git-compat-util.h"
15 #include "object-store-ll.h"
20 #include "environment.h"
23 #include "xdiff-interface.h"
26 #include "name-hash.h"
27 #include "object-name.h"
28 #include "object-file.h"
29 #include "parse-options.h"
32 #include "read-cache.h"
38 #include "wildmatch.h"
48 static void git_apply_config(void)
50 git_config_get_string("apply.whitespace", &apply_default_whitespace
);
51 git_config_get_string("apply.ignorewhitespace", &apply_default_ignorewhitespace
);
52 git_config(git_xmerge_config
, NULL
);
55 static int parse_whitespace_option(struct apply_state
*state
, const char *option
)
58 state
->ws_error_action
= warn_on_ws_error
;
61 if (!strcmp(option
, "warn")) {
62 state
->ws_error_action
= warn_on_ws_error
;
65 if (!strcmp(option
, "nowarn")) {
66 state
->ws_error_action
= nowarn_ws_error
;
69 if (!strcmp(option
, "error")) {
70 state
->ws_error_action
= die_on_ws_error
;
73 if (!strcmp(option
, "error-all")) {
74 state
->ws_error_action
= die_on_ws_error
;
75 state
->squelch_whitespace_errors
= 0;
78 if (!strcmp(option
, "strip") || !strcmp(option
, "fix")) {
79 state
->ws_error_action
= correct_ws_error
;
83 * Please update $__git_whitespacelist in git-completion.bash
84 * when you add new options.
86 return error(_("unrecognized whitespace option '%s'"), option
);
89 static int parse_ignorewhitespace_option(struct apply_state
*state
,
92 if (!option
|| !strcmp(option
, "no") ||
93 !strcmp(option
, "false") || !strcmp(option
, "never") ||
94 !strcmp(option
, "none")) {
95 state
->ws_ignore_action
= ignore_ws_none
;
98 if (!strcmp(option
, "change")) {
99 state
->ws_ignore_action
= ignore_ws_change
;
102 return error(_("unrecognized whitespace ignore option '%s'"), option
);
105 int init_apply_state(struct apply_state
*state
,
106 struct repository
*repo
,
109 memset(state
, 0, sizeof(*state
));
110 state
->prefix
= prefix
;
113 state
->line_termination
= '\n';
115 state
->p_context
= UINT_MAX
;
116 state
->squelch_whitespace_errors
= 5;
117 state
->ws_error_action
= warn_on_ws_error
;
118 state
->ws_ignore_action
= ignore_ws_none
;
120 string_list_init_nodup(&state
->fn_table
);
121 string_list_init_nodup(&state
->limit_by_name
);
122 strset_init(&state
->removed_symlinks
);
123 strset_init(&state
->kept_symlinks
);
124 strbuf_init(&state
->root
, 0);
127 if (apply_default_whitespace
&& parse_whitespace_option(state
, apply_default_whitespace
))
129 if (apply_default_ignorewhitespace
&& parse_ignorewhitespace_option(state
, apply_default_ignorewhitespace
))
134 void clear_apply_state(struct apply_state
*state
)
136 string_list_clear(&state
->limit_by_name
, 0);
137 strset_clear(&state
->removed_symlinks
);
138 strset_clear(&state
->kept_symlinks
);
139 strbuf_release(&state
->root
);
141 /* &state->fn_table is cleared at the end of apply_patch() */
144 static void mute_routine(const char *msg UNUSED
, va_list params UNUSED
)
149 int check_apply_state(struct apply_state
*state
, int force_apply
)
151 int is_not_gitdir
= !startup_info
->have_repository
;
153 if (state
->apply_with_reject
&& state
->threeway
)
154 return error(_("options '%s' and '%s' cannot be used together"), "--reject", "--3way");
155 if (state
->threeway
) {
157 return error(_("'%s' outside a repository"), "--3way");
158 state
->check_index
= 1;
160 if (state
->apply_with_reject
) {
162 if (state
->apply_verbosity
== verbosity_normal
)
163 state
->apply_verbosity
= verbosity_verbose
;
165 if (!force_apply
&& (state
->diffstat
|| state
->numstat
|| state
->summary
|| state
->check
|| state
->fake_ancestor
))
167 if (state
->check_index
&& is_not_gitdir
)
168 return error(_("'%s' outside a repository"), "--index");
171 return error(_("'%s' outside a repository"), "--cached");
172 state
->check_index
= 1;
174 if (state
->ita_only
&& (state
->check_index
|| is_not_gitdir
))
176 if (state
->check_index
)
177 state
->unsafe_paths
= 0;
179 if (state
->apply_verbosity
<= verbosity_silent
) {
180 state
->saved_error_routine
= get_error_routine();
181 state
->saved_warn_routine
= get_warn_routine();
182 set_error_routine(mute_routine
);
183 set_warn_routine(mute_routine
);
189 static void set_default_whitespace_mode(struct apply_state
*state
)
191 if (!state
->whitespace_option
&& !apply_default_whitespace
)
192 state
->ws_error_action
= (state
->apply
? warn_on_ws_error
: nowarn_ws_error
);
196 * This represents one "hunk" from a patch, starting with
197 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The
198 * patch text is pointed at by patch, and its byte length
199 * is stored in size. leading and trailing are the number
203 unsigned long leading
, trailing
;
204 unsigned long oldpos
, oldlines
;
205 unsigned long newpos
, newlines
;
207 * 'patch' is usually borrowed from buf in apply_patch(),
208 * but some codepaths store an allocated buffer.
211 unsigned free_patch
:1,
215 struct fragment
*next
;
219 * When dealing with a binary patch, we reuse "leading" field
220 * to store the type of the binary hunk, either deflated "delta"
221 * or deflated "literal".
223 #define binary_patch_method leading
224 #define BINARY_DELTA_DEFLATED 1
225 #define BINARY_LITERAL_DEFLATED 2
227 static void free_fragment_list(struct fragment
*list
)
230 struct fragment
*next
= list
->next
;
231 if (list
->free_patch
)
232 free((char *)list
->patch
);
238 void release_patch(struct patch
*patch
)
240 free_fragment_list(patch
->fragments
);
241 free(patch
->def_name
);
242 free(patch
->old_name
);
243 free(patch
->new_name
);
247 static void free_patch(struct patch
*patch
)
249 release_patch(patch
);
253 static void free_patch_list(struct patch
*list
)
256 struct patch
*next
= list
->next
;
263 * A line in a file, len-bytes long (includes the terminating LF,
264 * except for an incomplete line at the end if the file ends with
265 * one), and its contents hashes to 'hash'.
271 #define LINE_COMMON 1
272 #define LINE_PATCHED 2
276 * This represents a "file", which is an array of "lines".
283 struct line
*line_allocated
;
287 static uint32_t hash_line(const char *cp
, size_t len
)
291 for (i
= 0, h
= 0; i
< len
; i
++) {
292 if (!isspace(cp
[i
])) {
293 h
= h
* 3 + (cp
[i
] & 0xff);
300 * Compare lines s1 of length n1 and s2 of length n2, ignoring
301 * whitespace difference. Returns 1 if they match, 0 otherwise
303 static int fuzzy_matchlines(const char *s1
, size_t n1
,
304 const char *s2
, size_t n2
)
306 const char *end1
= s1
+ n1
;
307 const char *end2
= s2
+ n2
;
309 /* ignore line endings */
310 while (s1
< end1
&& (end1
[-1] == '\r' || end1
[-1] == '\n'))
312 while (s2
< end2
&& (end2
[-1] == '\r' || end2
[-1] == '\n'))
315 while (s1
< end1
&& s2
< end2
) {
318 * Skip whitespace. We check on both buffers
319 * because we don't want "a b" to match "ab".
323 while (s1
< end1
&& isspace(*s1
))
325 while (s2
< end2
&& isspace(*s2
))
327 } else if (*s1
++ != *s2
++)
331 /* If we reached the end on one side only, lines don't match. */
332 return s1
== end1
&& s2
== end2
;
335 static void add_line_info(struct image
*img
, const char *bol
, size_t len
, unsigned flag
)
337 ALLOC_GROW(img
->line_allocated
, img
->nr
+ 1, img
->alloc
);
338 img
->line_allocated
[img
->nr
].len
= len
;
339 img
->line_allocated
[img
->nr
].hash
= hash_line(bol
, len
);
340 img
->line_allocated
[img
->nr
].flag
= flag
;
345 * "buf" has the file contents to be patched (read from various sources).
346 * attach it to "image" and add line-based index to it.
347 * "image" now owns the "buf".
349 static void prepare_image(struct image
*image
, char *buf
, size_t len
,
350 int prepare_linetable
)
354 memset(image
, 0, sizeof(*image
));
358 if (!prepare_linetable
)
361 ep
= image
->buf
+ image
->len
;
365 for (next
= cp
; next
< ep
&& *next
!= '\n'; next
++)
369 add_line_info(image
, cp
, next
- cp
, 0);
372 image
->line
= image
->line_allocated
;
375 static void clear_image(struct image
*image
)
378 free(image
->line_allocated
);
379 memset(image
, 0, sizeof(*image
));
382 /* fmt must contain _one_ %s and no other substitution */
383 static void say_patch_name(FILE *output
, const char *fmt
, struct patch
*patch
)
385 struct strbuf sb
= STRBUF_INIT
;
387 if (patch
->old_name
&& patch
->new_name
&&
388 strcmp(patch
->old_name
, patch
->new_name
)) {
389 quote_c_style(patch
->old_name
, &sb
, NULL
, 0);
390 strbuf_addstr(&sb
, " => ");
391 quote_c_style(patch
->new_name
, &sb
, NULL
, 0);
393 const char *n
= patch
->new_name
;
396 quote_c_style(n
, &sb
, NULL
, 0);
398 fprintf(output
, fmt
, sb
.buf
);
406 * apply.c isn't equipped to handle arbitrarily large patches, because
407 * it intermingles `unsigned long` with `int` for the type used to store
410 * Only process patches that are just shy of 1 GiB large in order to
411 * avoid any truncation or overflow issues.
413 #define MAX_APPLY_SIZE (1024UL * 1024 * 1023)
415 static int read_patch_file(struct strbuf
*sb
, int fd
)
417 if (strbuf_read(sb
, fd
, 0) < 0)
418 return error_errno(_("failed to read patch"));
419 else if (sb
->len
>= MAX_APPLY_SIZE
)
420 return error(_("patch too large"));
422 * Make sure that we have some slop in the buffer
423 * so that we can do speculative "memcmp" etc, and
424 * see to it that it is NUL-filled.
426 strbuf_grow(sb
, SLOP
);
427 memset(sb
->buf
+ sb
->len
, 0, SLOP
);
431 static unsigned long linelen(const char *buffer
, unsigned long size
)
433 unsigned long len
= 0;
436 if (*buffer
++ == '\n')
442 static int is_dev_null(const char *str
)
444 return skip_prefix(str
, "/dev/null", &str
) && isspace(*str
);
450 static int name_terminate(int c
, int terminate
)
452 if (c
== ' ' && !(terminate
& TERM_SPACE
))
454 if (c
== '\t' && !(terminate
& TERM_TAB
))
460 /* remove double slashes to make --index work with such filenames */
461 static char *squash_slash(char *name
)
469 if ((name
[j
++] = name
[i
++]) == '/')
470 while (name
[i
] == '/')
477 static char *find_name_gnu(struct strbuf
*root
,
481 struct strbuf name
= STRBUF_INIT
;
485 * Proposed "new-style" GNU patch/diff format; see
486 * https://lore.kernel.org/git/7vll0wvb2a.fsf@assigned-by-dhcp.cox.net/
488 if (unquote_c_style(&name
, line
, NULL
)) {
489 strbuf_release(&name
);
493 for (cp
= name
.buf
; p_value
; p_value
--) {
494 cp
= strchr(cp
, '/');
496 strbuf_release(&name
);
502 strbuf_remove(&name
, 0, cp
- name
.buf
);
504 strbuf_insert(&name
, 0, root
->buf
, root
->len
);
505 return squash_slash(strbuf_detach(&name
, NULL
));
508 static size_t sane_tz_len(const char *line
, size_t len
)
512 if (len
< strlen(" +0500") || line
[len
-strlen(" +0500")] != ' ')
514 tz
= line
+ len
- strlen(" +0500");
516 if (tz
[1] != '+' && tz
[1] != '-')
519 for (p
= tz
+ 2; p
!= line
+ len
; p
++)
523 return line
+ len
- tz
;
526 static size_t tz_with_colon_len(const char *line
, size_t len
)
530 if (len
< strlen(" +08:00") || line
[len
- strlen(":00")] != ':')
532 tz
= line
+ len
- strlen(" +08:00");
534 if (tz
[0] != ' ' || (tz
[1] != '+' && tz
[1] != '-'))
537 if (!isdigit(*p
++) || !isdigit(*p
++) || *p
++ != ':' ||
538 !isdigit(*p
++) || !isdigit(*p
++))
541 return line
+ len
- tz
;
544 static size_t date_len(const char *line
, size_t len
)
546 const char *date
, *p
;
548 if (len
< strlen("72-02-05") || line
[len
-strlen("-05")] != '-')
550 p
= date
= line
+ len
- strlen("72-02-05");
552 if (!isdigit(*p
++) || !isdigit(*p
++) || *p
++ != '-' ||
553 !isdigit(*p
++) || !isdigit(*p
++) || *p
++ != '-' ||
554 !isdigit(*p
++) || !isdigit(*p
++)) /* Not a date. */
557 if (date
- line
>= strlen("19") &&
558 isdigit(date
[-1]) && isdigit(date
[-2])) /* 4-digit year */
559 date
-= strlen("19");
561 return line
+ len
- date
;
564 static size_t short_time_len(const char *line
, size_t len
)
566 const char *time
, *p
;
568 if (len
< strlen(" 07:01:32") || line
[len
-strlen(":32")] != ':')
570 p
= time
= line
+ len
- strlen(" 07:01:32");
572 /* Permit 1-digit hours? */
574 !isdigit(*p
++) || !isdigit(*p
++) || *p
++ != ':' ||
575 !isdigit(*p
++) || !isdigit(*p
++) || *p
++ != ':' ||
576 !isdigit(*p
++) || !isdigit(*p
++)) /* Not a time. */
579 return line
+ len
- time
;
582 static size_t fractional_time_len(const char *line
, size_t len
)
587 /* Expected format: 19:41:17.620000023 */
588 if (!len
|| !isdigit(line
[len
- 1]))
592 /* Fractional seconds. */
593 while (p
> line
&& isdigit(*p
))
598 /* Hours, minutes, and whole seconds. */
599 n
= short_time_len(line
, p
- line
);
603 return line
+ len
- p
+ n
;
606 static size_t trailing_spaces_len(const char *line
, size_t len
)
610 /* Expected format: ' ' x (1 or more) */
611 if (!len
|| line
[len
- 1] != ' ')
618 return line
+ len
- (p
+ 1);
625 static size_t diff_timestamp_len(const char *line
, size_t len
)
627 const char *end
= line
+ len
;
631 * Posix: 2010-07-05 19:41:17
632 * GNU: 2010-07-05 19:41:17.620000023 -0500
635 if (!isdigit(end
[-1]))
638 n
= sane_tz_len(line
, end
- line
);
640 n
= tz_with_colon_len(line
, end
- line
);
643 n
= short_time_len(line
, end
- line
);
645 n
= fractional_time_len(line
, end
- line
);
648 n
= date_len(line
, end
- line
);
649 if (!n
) /* No date. Too bad. */
653 if (end
== line
) /* No space before date. */
655 if (end
[-1] == '\t') { /* Success! */
657 return line
+ len
- end
;
659 if (end
[-1] != ' ') /* No space before date. */
662 /* Whitespace damage. */
663 end
-= trailing_spaces_len(line
, end
- line
);
664 return line
+ len
- end
;
667 static char *find_name_common(struct strbuf
*root
,
675 const char *start
= NULL
;
679 while (line
!= end
) {
682 if (!end
&& isspace(c
)) {
685 if (name_terminate(c
, terminate
))
689 if (c
== '/' && !--p_value
)
693 return squash_slash(xstrdup_or_null(def
));
696 return squash_slash(xstrdup_or_null(def
));
699 * Generally we prefer the shorter name, especially
700 * if the other one is just a variation of that with
701 * something else tacked on to the end (ie "file.orig"
705 int deflen
= strlen(def
);
706 if (deflen
< len
&& !strncmp(start
, def
, deflen
))
707 return squash_slash(xstrdup(def
));
711 char *ret
= xstrfmt("%s%.*s", root
->buf
, len
, start
);
712 return squash_slash(ret
);
715 return squash_slash(xmemdupz(start
, len
));
718 static char *find_name(struct strbuf
*root
,
725 char *name
= find_name_gnu(root
, line
, p_value
);
730 return find_name_common(root
, line
, def
, p_value
, NULL
, terminate
);
733 static char *find_name_traditional(struct strbuf
*root
,
742 char *name
= find_name_gnu(root
, line
, p_value
);
747 len
= strchrnul(line
, '\n') - line
;
748 date_len
= diff_timestamp_len(line
, len
);
750 return find_name_common(root
, line
, def
, p_value
, NULL
, TERM_TAB
);
753 return find_name_common(root
, line
, def
, p_value
, line
+ len
, 0);
757 * Given the string after "--- " or "+++ ", guess the appropriate
758 * p_value for the given patch.
760 static int guess_p_value(struct apply_state
*state
, const char *nameline
)
765 if (is_dev_null(nameline
))
767 name
= find_name_traditional(&state
->root
, nameline
, NULL
, 0);
770 cp
= strchr(name
, '/');
773 else if (state
->prefix
) {
775 * Does it begin with "a/$our-prefix" and such? Then this is
776 * very likely to apply to our directory.
778 if (starts_with(name
, state
->prefix
))
779 val
= count_slashes(state
->prefix
);
782 if (starts_with(cp
, state
->prefix
))
783 val
= count_slashes(state
->prefix
) + 1;
791 * Does the ---/+++ line have the POSIX timestamp after the last HT?
792 * GNU diff puts epoch there to signal a creation/deletion event. Is
793 * this such a timestamp?
795 static int has_epoch_timestamp(const char *nameline
)
798 * We are only interested in epoch timestamp; any non-zero
799 * fraction cannot be one, hence "(\.0+)?" in the regexp below.
800 * For the same reason, the date must be either 1969-12-31 or
801 * 1970-01-01, and the seconds part must be "00".
803 const char stamp_regexp
[] =
804 "^[0-2][0-9]:([0-5][0-9]):00(\\.0+)?"
806 "([-+][0-2][0-9]:?[0-5][0-9])\n";
807 const char *timestamp
= NULL
, *cp
, *colon
;
808 static regex_t
*stamp
;
810 int zoneoffset
, epoch_hour
, hour
, minute
;
813 for (cp
= nameline
; *cp
!= '\n'; cp
++) {
821 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31
822 * (west of GMT) or 1970-01-01 (east of GMT)
824 if (skip_prefix(timestamp
, "1969-12-31 ", ×tamp
))
826 else if (skip_prefix(timestamp
, "1970-01-01 ", ×tamp
))
832 stamp
= xmalloc(sizeof(*stamp
));
833 if (regcomp(stamp
, stamp_regexp
, REG_EXTENDED
)) {
834 warning(_("Cannot prepare timestamp regexp %s"),
840 status
= regexec(stamp
, timestamp
, ARRAY_SIZE(m
), m
, 0);
842 if (status
!= REG_NOMATCH
)
843 warning(_("regexec returned %d for input: %s"),
848 hour
= strtol(timestamp
, NULL
, 10);
849 minute
= strtol(timestamp
+ m
[1].rm_so
, NULL
, 10);
851 zoneoffset
= strtol(timestamp
+ m
[3].rm_so
+ 1, (char **) &colon
, 10);
853 zoneoffset
= zoneoffset
* 60 + strtol(colon
+ 1, NULL
, 10);
855 zoneoffset
= (zoneoffset
/ 100) * 60 + (zoneoffset
% 100);
856 if (timestamp
[m
[3].rm_so
] == '-')
857 zoneoffset
= -zoneoffset
;
859 return hour
* 60 + minute
- zoneoffset
== epoch_hour
* 60;
863 * Get the name etc info from the ---/+++ lines of a traditional patch header
865 * FIXME! The end-of-filename heuristics are kind of screwy. For existing
866 * files, we can happily check the index for a match, but for creating a
867 * new file we should try to match whatever "patch" does. I have no idea.
869 static int parse_traditional_patch(struct apply_state
*state
,
876 first
+= 4; /* skip "--- " */
877 second
+= 4; /* skip "+++ " */
878 if (!state
->p_value_known
) {
880 p
= guess_p_value(state
, first
);
881 q
= guess_p_value(state
, second
);
883 if (0 <= p
&& p
== q
) {
885 state
->p_value_known
= 1;
888 if (is_dev_null(first
)) {
890 patch
->is_delete
= 0;
891 name
= find_name_traditional(&state
->root
, second
, NULL
, state
->p_value
);
892 patch
->new_name
= name
;
893 } else if (is_dev_null(second
)) {
895 patch
->is_delete
= 1;
896 name
= find_name_traditional(&state
->root
, first
, NULL
, state
->p_value
);
897 patch
->old_name
= name
;
900 first_name
= find_name_traditional(&state
->root
, first
, NULL
, state
->p_value
);
901 name
= find_name_traditional(&state
->root
, second
, first_name
, state
->p_value
);
903 if (has_epoch_timestamp(first
)) {
905 patch
->is_delete
= 0;
906 patch
->new_name
= name
;
907 } else if (has_epoch_timestamp(second
)) {
909 patch
->is_delete
= 1;
910 patch
->old_name
= name
;
912 patch
->old_name
= name
;
913 patch
->new_name
= xstrdup_or_null(name
);
917 return error(_("unable to find filename in patch at line %d"), state
->linenr
);
922 static int gitdiff_hdrend(struct gitdiff_data
*state UNUSED
,
923 const char *line UNUSED
,
924 struct patch
*patch UNUSED
)
930 * We're anal about diff header consistency, to make
931 * sure that we don't end up having strange ambiguous
932 * patches floating around.
934 * As a result, gitdiff_{old|new}name() will check
935 * their names against any previous information, just
938 #define DIFF_OLD_NAME 0
939 #define DIFF_NEW_NAME 1
941 static int gitdiff_verify_name(struct gitdiff_data
*state
,
947 if (!*name
&& !isnull
) {
948 *name
= find_name(state
->root
, line
, NULL
, state
->p_value
, TERM_TAB
);
955 return error(_("git apply: bad git-diff - expected /dev/null, got %s on line %d"),
956 *name
, state
->linenr
);
957 another
= find_name(state
->root
, line
, NULL
, state
->p_value
, TERM_TAB
);
958 if (!another
|| strcmp(another
, *name
)) {
960 return error((side
== DIFF_NEW_NAME
) ?
961 _("git apply: bad git-diff - inconsistent new filename on line %d") :
962 _("git apply: bad git-diff - inconsistent old filename on line %d"), state
->linenr
);
966 if (!is_dev_null(line
))
967 return error(_("git apply: bad git-diff - expected /dev/null on line %d"), state
->linenr
);
973 static int gitdiff_oldname(struct gitdiff_data
*state
,
977 return gitdiff_verify_name(state
, line
,
978 patch
->is_new
, &patch
->old_name
,
982 static int gitdiff_newname(struct gitdiff_data
*state
,
986 return gitdiff_verify_name(state
, line
,
987 patch
->is_delete
, &patch
->new_name
,
991 static int parse_mode_line(const char *line
, int linenr
, unsigned int *mode
)
994 *mode
= strtoul(line
, &end
, 8);
995 if (end
== line
|| !isspace(*end
))
996 return error(_("invalid mode on line %d: %s"), linenr
, line
);
1000 static int gitdiff_oldmode(struct gitdiff_data
*state
,
1002 struct patch
*patch
)
1004 return parse_mode_line(line
, state
->linenr
, &patch
->old_mode
);
1007 static int gitdiff_newmode(struct gitdiff_data
*state
,
1009 struct patch
*patch
)
1011 return parse_mode_line(line
, state
->linenr
, &patch
->new_mode
);
1014 static int gitdiff_delete(struct gitdiff_data
*state
,
1016 struct patch
*patch
)
1018 patch
->is_delete
= 1;
1019 free(patch
->old_name
);
1020 patch
->old_name
= xstrdup_or_null(patch
->def_name
);
1021 return gitdiff_oldmode(state
, line
, patch
);
1024 static int gitdiff_newfile(struct gitdiff_data
*state
,
1026 struct patch
*patch
)
1029 free(patch
->new_name
);
1030 patch
->new_name
= xstrdup_or_null(patch
->def_name
);
1031 return gitdiff_newmode(state
, line
, patch
);
1034 static int gitdiff_copysrc(struct gitdiff_data
*state
,
1036 struct patch
*patch
)
1039 free(patch
->old_name
);
1040 patch
->old_name
= find_name(state
->root
, line
, NULL
, state
->p_value
? state
->p_value
- 1 : 0, 0);
1044 static int gitdiff_copydst(struct gitdiff_data
*state
,
1046 struct patch
*patch
)
1049 free(patch
->new_name
);
1050 patch
->new_name
= find_name(state
->root
, line
, NULL
, state
->p_value
? state
->p_value
- 1 : 0, 0);
1054 static int gitdiff_renamesrc(struct gitdiff_data
*state
,
1056 struct patch
*patch
)
1058 patch
->is_rename
= 1;
1059 free(patch
->old_name
);
1060 patch
->old_name
= find_name(state
->root
, line
, NULL
, state
->p_value
? state
->p_value
- 1 : 0, 0);
1064 static int gitdiff_renamedst(struct gitdiff_data
*state
,
1066 struct patch
*patch
)
1068 patch
->is_rename
= 1;
1069 free(patch
->new_name
);
1070 patch
->new_name
= find_name(state
->root
, line
, NULL
, state
->p_value
? state
->p_value
- 1 : 0, 0);
1074 static int gitdiff_similarity(struct gitdiff_data
*state UNUSED
,
1076 struct patch
*patch
)
1078 unsigned long val
= strtoul(line
, NULL
, 10);
1084 static int gitdiff_dissimilarity(struct gitdiff_data
*state UNUSED
,
1086 struct patch
*patch
)
1088 unsigned long val
= strtoul(line
, NULL
, 10);
1094 static int gitdiff_index(struct gitdiff_data
*state
,
1096 struct patch
*patch
)
1099 * index line is N hexadecimal, "..", N hexadecimal,
1100 * and optional space with octal mode.
1102 const char *ptr
, *eol
;
1104 const unsigned hexsz
= the_hash_algo
->hexsz
;
1106 ptr
= strchr(line
, '.');
1107 if (!ptr
|| ptr
[1] != '.' || hexsz
< ptr
- line
)
1110 memcpy(patch
->old_oid_prefix
, line
, len
);
1111 patch
->old_oid_prefix
[len
] = 0;
1114 ptr
= strchr(line
, ' ');
1115 eol
= strchrnul(line
, '\n');
1117 if (!ptr
|| eol
< ptr
)
1123 memcpy(patch
->new_oid_prefix
, line
, len
);
1124 patch
->new_oid_prefix
[len
] = 0;
1126 return gitdiff_oldmode(state
, ptr
+ 1, patch
);
1131 * This is normal for a diff that doesn't change anything: we'll fall through
1132 * into the next diff. Tell the parser to break out.
1134 static int gitdiff_unrecognized(struct gitdiff_data
*state UNUSED
,
1135 const char *line UNUSED
,
1136 struct patch
*patch UNUSED
)
1142 * Skip p_value leading components from "line"; as we do not accept
1143 * absolute paths, return NULL in that case.
1145 static const char *skip_tree_prefix(int p_value
,
1153 return (llen
&& line
[0] == '/') ? NULL
: line
;
1156 for (i
= 0; i
< llen
; i
++) {
1158 if (ch
== '/' && --nslash
<= 0)
1159 return (i
== 0) ? NULL
: &line
[i
+ 1];
1165 * This is to extract the same name that appears on "diff --git"
1166 * line. We do not find and return anything if it is a rename
1167 * patch, and it is OK because we will find the name elsewhere.
1168 * We need to reliably find name only when it is mode-change only,
1169 * creation or deletion of an empty file. In any of these cases,
1170 * both sides are the same name under a/ and b/ respectively.
1172 static char *git_header_name(int p_value
,
1177 const char *second
= NULL
;
1178 size_t len
, line_len
;
1180 line
+= strlen("diff --git ");
1181 llen
-= strlen("diff --git ");
1185 struct strbuf first
= STRBUF_INIT
;
1186 struct strbuf sp
= STRBUF_INIT
;
1188 if (unquote_c_style(&first
, line
, &second
))
1189 goto free_and_fail1
;
1191 /* strip the a/b prefix including trailing slash */
1192 cp
= skip_tree_prefix(p_value
, first
.buf
, first
.len
);
1194 goto free_and_fail1
;
1195 strbuf_remove(&first
, 0, cp
- first
.buf
);
1198 * second points at one past closing dq of name.
1199 * find the second name.
1201 while ((second
< line
+ llen
) && isspace(*second
))
1204 if (line
+ llen
<= second
)
1205 goto free_and_fail1
;
1206 if (*second
== '"') {
1207 if (unquote_c_style(&sp
, second
, NULL
))
1208 goto free_and_fail1
;
1209 cp
= skip_tree_prefix(p_value
, sp
.buf
, sp
.len
);
1211 goto free_and_fail1
;
1212 /* They must match, otherwise ignore */
1213 if (strcmp(cp
, first
.buf
))
1214 goto free_and_fail1
;
1215 strbuf_release(&sp
);
1216 return strbuf_detach(&first
, NULL
);
1219 /* unquoted second */
1220 cp
= skip_tree_prefix(p_value
, second
, line
+ llen
- second
);
1222 goto free_and_fail1
;
1223 if (line
+ llen
- cp
!= first
.len
||
1224 memcmp(first
.buf
, cp
, first
.len
))
1225 goto free_and_fail1
;
1226 return strbuf_detach(&first
, NULL
);
1229 strbuf_release(&first
);
1230 strbuf_release(&sp
);
1234 /* unquoted first name */
1235 name
= skip_tree_prefix(p_value
, line
, llen
);
1240 * since the first name is unquoted, a dq if exists must be
1241 * the beginning of the second name.
1243 for (second
= name
; second
< line
+ llen
; second
++) {
1244 if (*second
== '"') {
1245 struct strbuf sp
= STRBUF_INIT
;
1248 if (unquote_c_style(&sp
, second
, NULL
))
1249 goto free_and_fail2
;
1251 np
= skip_tree_prefix(p_value
, sp
.buf
, sp
.len
);
1253 goto free_and_fail2
;
1255 len
= sp
.buf
+ sp
.len
- np
;
1256 if (len
< second
- name
&&
1257 !strncmp(np
, name
, len
) &&
1258 isspace(name
[len
])) {
1260 strbuf_remove(&sp
, 0, np
- sp
.buf
);
1261 return strbuf_detach(&sp
, NULL
);
1265 strbuf_release(&sp
);
1271 * Accept a name only if it shows up twice, exactly the same
1274 second
= strchr(name
, '\n');
1277 line_len
= second
- name
;
1278 for (len
= 0 ; ; len
++) {
1279 switch (name
[len
]) {
1284 case '\t': case ' ':
1286 * Is this the separator between the preimage
1287 * and the postimage pathname? Again, we are
1288 * only interested in the case where there is
1289 * no rename, as this is only to set def_name
1290 * and a rename patch has the names elsewhere
1291 * in an unambiguous form.
1294 return NULL
; /* no postimage name */
1295 second
= skip_tree_prefix(p_value
, name
+ len
+ 1,
1296 line_len
- (len
+ 1));
1300 * Does len bytes starting at "name" and "second"
1301 * (that are separated by one HT or SP we just
1302 * found) exactly match?
1304 if (second
[len
] == '\n' && !strncmp(name
, second
, len
))
1305 return xmemdupz(name
, len
);
1310 static int check_header_line(int linenr
, struct patch
*patch
)
1312 int extensions
= (patch
->is_delete
== 1) + (patch
->is_new
== 1) +
1313 (patch
->is_rename
== 1) + (patch
->is_copy
== 1);
1315 return error(_("inconsistent header lines %d and %d"),
1316 patch
->extension_linenr
, linenr
);
1317 if (extensions
&& !patch
->extension_linenr
)
1318 patch
->extension_linenr
= linenr
;
1322 int parse_git_diff_header(struct strbuf
*root
,
1328 struct patch
*patch
)
1330 unsigned long offset
;
1331 struct gitdiff_data parse_hdr_state
;
1333 /* A git diff has explicit new/delete information, so we don't guess */
1335 patch
->is_delete
= 0;
1338 * Some things may not have the old name in the
1339 * rest of the headers anywhere (pure mode changes,
1340 * or removing or adding empty files), so we get
1341 * the default name from the header.
1343 patch
->def_name
= git_header_name(p_value
, line
, len
);
1344 if (patch
->def_name
&& root
->len
) {
1345 char *s
= xstrfmt("%s%s", root
->buf
, patch
->def_name
);
1346 free(patch
->def_name
);
1347 patch
->def_name
= s
;
1353 parse_hdr_state
.root
= root
;
1354 parse_hdr_state
.linenr
= *linenr
;
1355 parse_hdr_state
.p_value
= p_value
;
1357 for (offset
= len
; size
> 0 ; offset
+= len
, size
-= len
, line
+= len
, (*linenr
)++) {
1358 static const struct opentry
{
1360 int (*fn
)(struct gitdiff_data
*, const char *, struct patch
*);
1362 { "@@ -", gitdiff_hdrend
},
1363 { "--- ", gitdiff_oldname
},
1364 { "+++ ", gitdiff_newname
},
1365 { "old mode ", gitdiff_oldmode
},
1366 { "new mode ", gitdiff_newmode
},
1367 { "deleted file mode ", gitdiff_delete
},
1368 { "new file mode ", gitdiff_newfile
},
1369 { "copy from ", gitdiff_copysrc
},
1370 { "copy to ", gitdiff_copydst
},
1371 { "rename old ", gitdiff_renamesrc
},
1372 { "rename new ", gitdiff_renamedst
},
1373 { "rename from ", gitdiff_renamesrc
},
1374 { "rename to ", gitdiff_renamedst
},
1375 { "similarity index ", gitdiff_similarity
},
1376 { "dissimilarity index ", gitdiff_dissimilarity
},
1377 { "index ", gitdiff_index
},
1378 { "", gitdiff_unrecognized
},
1382 len
= linelen(line
, size
);
1383 if (!len
|| line
[len
-1] != '\n')
1385 for (i
= 0; i
< ARRAY_SIZE(optable
); i
++) {
1386 const struct opentry
*p
= optable
+ i
;
1387 int oplen
= strlen(p
->str
);
1389 if (len
< oplen
|| memcmp(p
->str
, line
, oplen
))
1391 res
= p
->fn(&parse_hdr_state
, line
+ oplen
, patch
);
1394 if (check_header_line(*linenr
, patch
))
1403 if (!patch
->old_name
&& !patch
->new_name
) {
1404 if (!patch
->def_name
) {
1405 error(Q_("git diff header lacks filename information when removing "
1406 "%d leading pathname component (line %d)",
1407 "git diff header lacks filename information when removing "
1408 "%d leading pathname components (line %d)",
1409 parse_hdr_state
.p_value
),
1410 parse_hdr_state
.p_value
, *linenr
);
1413 patch
->old_name
= xstrdup(patch
->def_name
);
1414 patch
->new_name
= xstrdup(patch
->def_name
);
1416 if ((!patch
->new_name
&& !patch
->is_delete
) ||
1417 (!patch
->old_name
&& !patch
->is_new
)) {
1418 error(_("git diff header lacks filename information "
1419 "(line %d)"), *linenr
);
1422 patch
->is_toplevel_relative
= 1;
1426 static int parse_num(const char *line
, unsigned long *p
)
1430 if (!isdigit(*line
))
1432 *p
= strtoul(line
, &ptr
, 10);
1436 static int parse_range(const char *line
, int len
, int offset
, const char *expect
,
1437 unsigned long *p1
, unsigned long *p2
)
1441 if (offset
< 0 || offset
>= len
)
1446 digits
= parse_num(line
, p1
);
1456 digits
= parse_num(line
+1, p2
);
1465 ex
= strlen(expect
);
1468 if (memcmp(line
, expect
, ex
))
1474 static void recount_diff(const char *line
, int size
, struct fragment
*fragment
)
1476 int oldlines
= 0, newlines
= 0, ret
= 0;
1479 warning("recount: ignore empty hunk");
1484 int len
= linelen(line
, size
);
1492 case ' ': case '\n':
1504 ret
= size
< 3 || !starts_with(line
, "@@ ");
1507 ret
= size
< 5 || !starts_with(line
, "diff ");
1514 warning(_("recount: unexpected line: %.*s"),
1515 (int)linelen(line
, size
), line
);
1520 fragment
->oldlines
= oldlines
;
1521 fragment
->newlines
= newlines
;
1525 * Parse a unified diff fragment header of the
1526 * form "@@ -a,b +c,d @@"
1528 static int parse_fragment_header(const char *line
, int len
, struct fragment
*fragment
)
1532 if (!len
|| line
[len
-1] != '\n')
1535 /* Figure out the number of lines in a fragment */
1536 offset
= parse_range(line
, len
, 4, " +", &fragment
->oldpos
, &fragment
->oldlines
);
1537 offset
= parse_range(line
, len
, offset
, " @@", &fragment
->newpos
, &fragment
->newlines
);
1543 * Find file diff header
1546 * -1 if no header was found
1547 * -128 in case of error
1548 * the size of the header in bytes (called "offset") otherwise
1550 static int find_header(struct apply_state
*state
,
1554 struct patch
*patch
)
1556 unsigned long offset
, len
;
1558 patch
->is_toplevel_relative
= 0;
1559 patch
->is_rename
= patch
->is_copy
= 0;
1560 patch
->is_new
= patch
->is_delete
= -1;
1561 patch
->old_mode
= patch
->new_mode
= 0;
1562 patch
->old_name
= patch
->new_name
= NULL
;
1563 for (offset
= 0; size
> 0; offset
+= len
, size
-= len
, line
+= len
, state
->linenr
++) {
1564 unsigned long nextlen
;
1566 len
= linelen(line
, size
);
1570 /* Testing this early allows us to take a few shortcuts.. */
1575 * Make sure we don't find any unconnected patch fragments.
1576 * That's a sign that we didn't find a header, and that a
1577 * patch has become corrupted/broken up.
1579 if (!memcmp("@@ -", line
, 4)) {
1580 struct fragment dummy
;
1581 if (parse_fragment_header(line
, len
, &dummy
) < 0)
1583 error(_("patch fragment without header at line %d: %.*s"),
1584 state
->linenr
, (int)len
-1, line
);
1592 * Git patch? It might not have a real patch, just a rename
1593 * or mode change, so we handle that specially
1595 if (!memcmp("diff --git ", line
, 11)) {
1596 int git_hdr_len
= parse_git_diff_header(&state
->root
, &state
->linenr
,
1597 state
->p_value
, line
, len
,
1599 if (git_hdr_len
< 0)
1601 if (git_hdr_len
<= len
)
1603 *hdrsize
= git_hdr_len
;
1607 /* --- followed by +++ ? */
1608 if (memcmp("--- ", line
, 4) || memcmp("+++ ", line
+ len
, 4))
1612 * We only accept unified patches, so we want it to
1613 * at least have "@@ -a,b +c,d @@\n", which is 14 chars
1614 * minimum ("@@ -0,0 +1 @@\n" is the shortest).
1616 nextlen
= linelen(line
+ len
, size
- len
);
1617 if (size
< nextlen
+ 14 || memcmp("@@ -", line
+ len
+ nextlen
, 4))
1620 /* Ok, we'll consider it a patch */
1621 if (parse_traditional_patch(state
, line
, line
+len
, patch
))
1623 *hdrsize
= len
+ nextlen
;
1630 static void record_ws_error(struct apply_state
*state
,
1641 state
->whitespace_error
++;
1642 if (state
->squelch_whitespace_errors
&&
1643 state
->squelch_whitespace_errors
< state
->whitespace_error
)
1646 err
= whitespace_error_string(result
);
1647 if (state
->apply_verbosity
> verbosity_silent
)
1648 fprintf(stderr
, "%s:%d: %s.\n%.*s\n",
1649 state
->patch_input_file
, linenr
, err
, len
, line
);
1653 static void check_whitespace(struct apply_state
*state
,
1658 unsigned result
= ws_check(line
+ 1, len
- 1, ws_rule
);
1660 record_ws_error(state
, result
, line
+ 1, len
- 2, state
->linenr
);
1664 * Check if the patch has context lines with CRLF or
1665 * the patch wants to remove lines with CRLF.
1667 static void check_old_for_crlf(struct patch
*patch
, const char *line
, int len
)
1669 if (len
>= 2 && line
[len
-1] == '\n' && line
[len
-2] == '\r') {
1670 patch
->ws_rule
|= WS_CR_AT_EOL
;
1671 patch
->crlf_in_old
= 1;
1677 * Parse a unified diff. Note that this really needs to parse each
1678 * fragment separately, since the only way to know the difference
1679 * between a "---" that is part of a patch, and a "---" that starts
1680 * the next patch is to look at the line counts..
1682 static int parse_fragment(struct apply_state
*state
,
1685 struct patch
*patch
,
1686 struct fragment
*fragment
)
1689 int len
= linelen(line
, size
), offset
;
1690 unsigned long oldlines
, newlines
;
1691 unsigned long leading
, trailing
;
1693 offset
= parse_fragment_header(line
, len
, fragment
);
1696 if (offset
> 0 && patch
->recount
)
1697 recount_diff(line
+ offset
, size
- offset
, fragment
);
1698 oldlines
= fragment
->oldlines
;
1699 newlines
= fragment
->newlines
;
1703 /* Parse the thing.. */
1707 added
= deleted
= 0;
1710 offset
+= len
, size
-= len
, line
+= len
, state
->linenr
++) {
1711 if (!oldlines
&& !newlines
)
1713 len
= linelen(line
, size
);
1714 if (!len
|| line
[len
-1] != '\n')
1719 case '\n': /* newer GNU diff, an empty context line */
1723 if (!deleted
&& !added
)
1726 check_old_for_crlf(patch
, line
, len
);
1727 if (!state
->apply_in_reverse
&&
1728 state
->ws_error_action
== correct_ws_error
)
1729 check_whitespace(state
, line
, len
, patch
->ws_rule
);
1732 if (!state
->apply_in_reverse
)
1733 check_old_for_crlf(patch
, line
, len
);
1734 if (state
->apply_in_reverse
&&
1735 state
->ws_error_action
!= nowarn_ws_error
)
1736 check_whitespace(state
, line
, len
, patch
->ws_rule
);
1742 if (state
->apply_in_reverse
)
1743 check_old_for_crlf(patch
, line
, len
);
1744 if (!state
->apply_in_reverse
&&
1745 state
->ws_error_action
!= nowarn_ws_error
)
1746 check_whitespace(state
, line
, len
, patch
->ws_rule
);
1753 * We allow "\ No newline at end of file". Depending
1754 * on locale settings when the patch was produced we
1755 * don't know what this line looks like. The only
1756 * thing we do know is that it begins with "\ ".
1757 * Checking for 12 is just for sanity check -- any
1758 * l10n of "\ No newline..." is at least that long.
1761 if (len
< 12 || memcmp(line
, "\\ ", 2))
1766 if (oldlines
|| newlines
)
1768 if (!patch
->recount
&& !deleted
&& !added
)
1771 fragment
->leading
= leading
;
1772 fragment
->trailing
= trailing
;
1775 * If a fragment ends with an incomplete line, we failed to include
1776 * it in the above loop because we hit oldlines == newlines == 0
1779 if (12 < size
&& !memcmp(line
, "\\ ", 2))
1780 offset
+= linelen(line
, size
);
1782 patch
->lines_added
+= added
;
1783 patch
->lines_deleted
+= deleted
;
1785 if (0 < patch
->is_new
&& oldlines
)
1786 return error(_("new file depends on old contents"));
1787 if (0 < patch
->is_delete
&& newlines
)
1788 return error(_("deleted file still has contents"));
1793 * We have seen "diff --git a/... b/..." header (or a traditional patch
1794 * header). Read hunks that belong to this patch into fragments and hang
1795 * them to the given patch structure.
1797 * The (fragment->patch, fragment->size) pair points into the memory given
1798 * by the caller, not a copy, when we return.
1801 * -1 in case of error,
1802 * the number of bytes in the patch otherwise.
1804 static int parse_single_patch(struct apply_state
*state
,
1807 struct patch
*patch
)
1809 unsigned long offset
= 0;
1810 unsigned long oldlines
= 0, newlines
= 0, context
= 0;
1811 struct fragment
**fragp
= &patch
->fragments
;
1813 while (size
> 4 && !memcmp(line
, "@@ -", 4)) {
1814 struct fragment
*fragment
;
1817 CALLOC_ARRAY(fragment
, 1);
1818 fragment
->linenr
= state
->linenr
;
1819 len
= parse_fragment(state
, line
, size
, patch
, fragment
);
1822 return error(_("corrupt patch at line %d"), state
->linenr
);
1824 fragment
->patch
= line
;
1825 fragment
->size
= len
;
1826 oldlines
+= fragment
->oldlines
;
1827 newlines
+= fragment
->newlines
;
1828 context
+= fragment
->leading
+ fragment
->trailing
;
1831 fragp
= &fragment
->next
;
1839 * If something was removed (i.e. we have old-lines) it cannot
1840 * be creation, and if something was added it cannot be
1841 * deletion. However, the reverse is not true; --unified=0
1842 * patches that only add are not necessarily creation even
1843 * though they do not have any old lines, and ones that only
1844 * delete are not necessarily deletion.
1846 * Unfortunately, a real creation/deletion patch do _not_ have
1847 * any context line by definition, so we cannot safely tell it
1848 * apart with --unified=0 insanity. At least if the patch has
1849 * more than one hunk it is not creation or deletion.
1851 if (patch
->is_new
< 0 &&
1852 (oldlines
|| (patch
->fragments
&& patch
->fragments
->next
)))
1854 if (patch
->is_delete
< 0 &&
1855 (newlines
|| (patch
->fragments
&& patch
->fragments
->next
)))
1856 patch
->is_delete
= 0;
1858 if (0 < patch
->is_new
&& oldlines
)
1859 return error(_("new file %s depends on old contents"), patch
->new_name
);
1860 if (0 < patch
->is_delete
&& newlines
)
1861 return error(_("deleted file %s still has contents"), patch
->old_name
);
1862 if (!patch
->is_delete
&& !newlines
&& context
&& state
->apply_verbosity
> verbosity_silent
)
1865 "file %s becomes empty but is not deleted"),
1871 static inline int metadata_changes(struct patch
*patch
)
1873 return patch
->is_rename
> 0 ||
1874 patch
->is_copy
> 0 ||
1875 patch
->is_new
> 0 ||
1877 (patch
->old_mode
&& patch
->new_mode
&&
1878 patch
->old_mode
!= patch
->new_mode
);
1881 static char *inflate_it(const void *data
, unsigned long size
,
1882 unsigned long inflated_size
)
1888 memset(&stream
, 0, sizeof(stream
));
1890 stream
.next_in
= (unsigned char *)data
;
1891 stream
.avail_in
= size
;
1892 stream
.next_out
= out
= xmalloc(inflated_size
);
1893 stream
.avail_out
= inflated_size
;
1894 git_inflate_init(&stream
);
1895 st
= git_inflate(&stream
, Z_FINISH
);
1896 git_inflate_end(&stream
);
1897 if ((st
!= Z_STREAM_END
) || stream
.total_out
!= inflated_size
) {
1905 * Read a binary hunk and return a new fragment; fragment->patch
1906 * points at an allocated memory that the caller must free, so
1907 * it is marked as "->free_patch = 1".
1909 static struct fragment
*parse_binary_hunk(struct apply_state
*state
,
1911 unsigned long *sz_p
,
1916 * Expect a line that begins with binary patch method ("literal"
1917 * or "delta"), followed by the length of data before deflating.
1918 * a sequence of 'length-byte' followed by base-85 encoded data
1919 * should follow, terminated by a newline.
1921 * Each 5-byte sequence of base-85 encodes up to 4 bytes,
1922 * and we would limit the patch line to 66 characters,
1923 * so one line can fit up to 13 groups that would decode
1924 * to 52 bytes max. The length byte 'A'-'Z' corresponds
1925 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.
1928 unsigned long size
= *sz_p
;
1929 char *buffer
= *buf_p
;
1931 unsigned long origlen
;
1934 struct fragment
*frag
;
1936 llen
= linelen(buffer
, size
);
1941 if (starts_with(buffer
, "delta ")) {
1942 patch_method
= BINARY_DELTA_DEFLATED
;
1943 origlen
= strtoul(buffer
+ 6, NULL
, 10);
1945 else if (starts_with(buffer
, "literal ")) {
1946 patch_method
= BINARY_LITERAL_DEFLATED
;
1947 origlen
= strtoul(buffer
+ 8, NULL
, 10);
1956 int byte_length
, max_byte_length
, newsize
;
1957 llen
= linelen(buffer
, size
);
1961 /* consume the blank line */
1967 * Minimum line is "A00000\n" which is 7-byte long,
1968 * and the line length must be multiple of 5 plus 2.
1970 if ((llen
< 7) || (llen
-2) % 5)
1972 max_byte_length
= (llen
- 2) / 5 * 4;
1973 byte_length
= *buffer
;
1974 if ('A' <= byte_length
&& byte_length
<= 'Z')
1975 byte_length
= byte_length
- 'A' + 1;
1976 else if ('a' <= byte_length
&& byte_length
<= 'z')
1977 byte_length
= byte_length
- 'a' + 27;
1980 /* if the input length was not multiple of 4, we would
1981 * have filler at the end but the filler should never
1984 if (max_byte_length
< byte_length
||
1985 byte_length
<= max_byte_length
- 4)
1987 newsize
= hunk_size
+ byte_length
;
1988 data
= xrealloc(data
, newsize
);
1989 if (decode_85(data
+ hunk_size
, buffer
+ 1, byte_length
))
1991 hunk_size
= newsize
;
1996 CALLOC_ARRAY(frag
, 1);
1997 frag
->patch
= inflate_it(data
, hunk_size
, origlen
);
1998 frag
->free_patch
= 1;
2002 frag
->size
= origlen
;
2006 frag
->binary_patch_method
= patch_method
;
2012 error(_("corrupt binary patch at line %d: %.*s"),
2013 state
->linenr
-1, llen
-1, buffer
);
2019 * -1 in case of error,
2020 * the length of the parsed binary patch otherwise
2022 static int parse_binary(struct apply_state
*state
,
2025 struct patch
*patch
)
2028 * We have read "GIT binary patch\n"; what follows is a line
2029 * that says the patch method (currently, either "literal" or
2030 * "delta") and the length of data before deflating; a
2031 * sequence of 'length-byte' followed by base-85 encoded data
2034 * When a binary patch is reversible, there is another binary
2035 * hunk in the same format, starting with patch method (either
2036 * "literal" or "delta") with the length of data, and a sequence
2037 * of length-byte + base-85 encoded data, terminated with another
2038 * empty line. This data, when applied to the postimage, produces
2041 struct fragment
*forward
;
2042 struct fragment
*reverse
;
2046 forward
= parse_binary_hunk(state
, &buffer
, &size
, &status
, &used
);
2047 if (!forward
&& !status
)
2048 /* there has to be one hunk (forward hunk) */
2049 return error(_("unrecognized binary patch at line %d"), state
->linenr
-1);
2051 /* otherwise we already gave an error message */
2054 reverse
= parse_binary_hunk(state
, &buffer
, &size
, &status
, &used_1
);
2059 * Not having reverse hunk is not an error, but having
2060 * a corrupt reverse hunk is.
2062 free((void*) forward
->patch
);
2066 forward
->next
= reverse
;
2067 patch
->fragments
= forward
;
2068 patch
->is_binary
= 1;
2072 static void prefix_one(struct apply_state
*state
, char **name
)
2074 char *old_name
= *name
;
2077 *name
= prefix_filename(state
->prefix
, *name
);
2081 static void prefix_patch(struct apply_state
*state
, struct patch
*p
)
2083 if (!state
->prefix
|| p
->is_toplevel_relative
)
2085 prefix_one(state
, &p
->new_name
);
2086 prefix_one(state
, &p
->old_name
);
2093 static void add_name_limit(struct apply_state
*state
,
2097 struct string_list_item
*it
;
2099 it
= string_list_append(&state
->limit_by_name
, name
);
2100 it
->util
= exclude
? NULL
: (void *) 1;
2103 static int use_patch(struct apply_state
*state
, struct patch
*p
)
2105 const char *pathname
= p
->new_name
? p
->new_name
: p
->old_name
;
2108 /* Paths outside are not touched regardless of "--include" */
2109 if (state
->prefix
&& *state
->prefix
) {
2111 if (!skip_prefix(pathname
, state
->prefix
, &rest
) || !*rest
)
2115 /* See if it matches any of exclude/include rule */
2116 for (i
= 0; i
< state
->limit_by_name
.nr
; i
++) {
2117 struct string_list_item
*it
= &state
->limit_by_name
.items
[i
];
2118 if (!wildmatch(it
->string
, pathname
, 0))
2119 return (it
->util
!= NULL
);
2123 * If we had any include, a path that does not match any rule is
2124 * not used. Otherwise, we saw bunch of exclude rules (or none)
2125 * and such a path is used.
2127 return !state
->has_include
;
2131 * Read the patch text in "buffer" that extends for "size" bytes; stop
2132 * reading after seeing a single patch (i.e. changes to a single file).
2133 * Create fragments (i.e. patch hunks) and hang them to the given patch.
2136 * -1 if no header was found or parse_binary() failed,
2137 * -128 on another error,
2138 * the number of bytes consumed otherwise,
2139 * so that the caller can call us again for the next patch.
2141 static int parse_chunk(struct apply_state
*state
, char *buffer
, unsigned long size
, struct patch
*patch
)
2143 int hdrsize
, patchsize
;
2144 int offset
= find_header(state
, buffer
, size
, &hdrsize
, patch
);
2149 prefix_patch(state
, patch
);
2151 if (!use_patch(state
, patch
))
2153 else if (patch
->new_name
)
2154 patch
->ws_rule
= whitespace_rule(state
->repo
->index
,
2157 patch
->ws_rule
= whitespace_rule(state
->repo
->index
,
2160 patchsize
= parse_single_patch(state
,
2161 buffer
+ offset
+ hdrsize
,
2162 size
- offset
- hdrsize
,
2169 static const char git_binary
[] = "GIT binary patch\n";
2170 int hd
= hdrsize
+ offset
;
2171 unsigned long llen
= linelen(buffer
+ hd
, size
- hd
);
2173 if (llen
== sizeof(git_binary
) - 1 &&
2174 !memcmp(git_binary
, buffer
+ hd
, llen
)) {
2177 used
= parse_binary(state
, buffer
+ hd
+ llen
,
2178 size
- hd
- llen
, patch
);
2182 patchsize
= used
+ llen
;
2186 else if (!memcmp(" differ\n", buffer
+ hd
+ llen
- 8, 8)) {
2187 static const char *binhdr
[] = {
2193 for (i
= 0; binhdr
[i
]; i
++) {
2194 int len
= strlen(binhdr
[i
]);
2195 if (len
< size
- hd
&&
2196 !memcmp(binhdr
[i
], buffer
+ hd
, len
)) {
2198 patch
->is_binary
= 1;
2205 /* Empty patch cannot be applied if it is a text patch
2206 * without metadata change. A binary patch appears
2209 if ((state
->apply
|| state
->check
) &&
2210 (!patch
->is_binary
&& !metadata_changes(patch
))) {
2211 error(_("patch with only garbage at line %d"), state
->linenr
);
2216 return offset
+ hdrsize
+ patchsize
;
2219 static void reverse_patches(struct patch
*p
)
2221 for (; p
; p
= p
->next
) {
2222 struct fragment
*frag
= p
->fragments
;
2224 SWAP(p
->new_name
, p
->old_name
);
2225 SWAP(p
->new_mode
, p
->old_mode
);
2226 SWAP(p
->is_new
, p
->is_delete
);
2227 SWAP(p
->lines_added
, p
->lines_deleted
);
2228 SWAP(p
->old_oid_prefix
, p
->new_oid_prefix
);
2230 for (; frag
; frag
= frag
->next
) {
2231 SWAP(frag
->newpos
, frag
->oldpos
);
2232 SWAP(frag
->newlines
, frag
->oldlines
);
2237 static const char pluses
[] =
2238 "++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";
2239 static const char minuses
[]=
2240 "----------------------------------------------------------------------";
2242 static void show_stats(struct apply_state
*state
, struct patch
*patch
)
2244 struct strbuf qname
= STRBUF_INIT
;
2245 char *cp
= patch
->new_name
? patch
->new_name
: patch
->old_name
;
2248 quote_c_style(cp
, &qname
, NULL
, 0);
2251 * "scale" the filename
2253 max
= state
->max_len
;
2257 if (qname
.len
> max
) {
2258 cp
= strchr(qname
.buf
+ qname
.len
+ 3 - max
, '/');
2260 cp
= qname
.buf
+ qname
.len
+ 3 - max
;
2261 strbuf_splice(&qname
, 0, cp
- qname
.buf
, "...", 3);
2264 if (patch
->is_binary
) {
2265 printf(" %-*s | Bin\n", max
, qname
.buf
);
2266 strbuf_release(&qname
);
2270 printf(" %-*s |", max
, qname
.buf
);
2271 strbuf_release(&qname
);
2274 * scale the add/delete
2276 max
= max
+ state
->max_change
> 70 ? 70 - max
: state
->max_change
;
2277 add
= patch
->lines_added
;
2278 del
= patch
->lines_deleted
;
2280 if (state
->max_change
> 0) {
2281 int total
= ((add
+ del
) * max
+ state
->max_change
/ 2) / state
->max_change
;
2282 add
= (add
* max
+ state
->max_change
/ 2) / state
->max_change
;
2285 printf("%5d %.*s%.*s\n", patch
->lines_added
+ patch
->lines_deleted
,
2286 add
, pluses
, del
, minuses
);
2289 static int read_old_data(struct stat
*st
, struct patch
*patch
,
2290 const char *path
, struct strbuf
*buf
)
2292 int conv_flags
= patch
->crlf_in_old
?
2293 CONV_EOL_KEEP_CRLF
: CONV_EOL_RENORMALIZE
;
2294 switch (st
->st_mode
& S_IFMT
) {
2296 if (strbuf_readlink(buf
, path
, st
->st_size
) < 0)
2297 return error(_("unable to read symlink %s"), path
);
2300 if (strbuf_read_file(buf
, path
, st
->st_size
) != st
->st_size
)
2301 return error(_("unable to open or read %s"), path
);
2303 * "git apply" without "--index/--cached" should never look
2304 * at the index; the target file may not have been added to
2305 * the index yet, and we may not even be in any Git repository.
2306 * Pass NULL to convert_to_git() to stress this; the function
2307 * should never look at the index when explicit crlf option
2310 convert_to_git(NULL
, path
, buf
->buf
, buf
->len
, buf
, conv_flags
);
2318 * Update the preimage, and the common lines in postimage,
2319 * from buffer buf of length len. If postlen is 0 the postimage
2320 * is updated in place, otherwise it's updated on a new buffer
2324 static void update_pre_post_images(struct image
*preimage
,
2325 struct image
*postimage
,
2327 size_t len
, size_t postlen
)
2329 int i
, ctx
, reduced
;
2330 char *new_buf
, *old_buf
, *fixed
;
2331 struct image fixed_preimage
;
2334 * Update the preimage with whitespace fixes. Note that we
2335 * are not losing preimage->buf -- apply_one_fragment() will
2338 prepare_image(&fixed_preimage
, buf
, len
, 1);
2340 ? fixed_preimage
.nr
== preimage
->nr
2341 : fixed_preimage
.nr
<= preimage
->nr
);
2342 for (i
= 0; i
< fixed_preimage
.nr
; i
++)
2343 fixed_preimage
.line
[i
].flag
= preimage
->line
[i
].flag
;
2344 free(preimage
->line_allocated
);
2345 *preimage
= fixed_preimage
;
2348 * Adjust the common context lines in postimage. This can be
2349 * done in-place when we are shrinking it with whitespace
2350 * fixing, but needs a new buffer when ignoring whitespace or
2351 * expanding leading tabs to spaces.
2353 * We trust the caller to tell us if the update can be done
2354 * in place (postlen==0) or not.
2356 old_buf
= postimage
->buf
;
2358 new_buf
= postimage
->buf
= xmalloc(postlen
);
2361 fixed
= preimage
->buf
;
2363 for (i
= reduced
= ctx
= 0; i
< postimage
->nr
; i
++) {
2364 size_t l_len
= postimage
->line
[i
].len
;
2365 if (!(postimage
->line
[i
].flag
& LINE_COMMON
)) {
2366 /* an added line -- no counterparts in preimage */
2367 memmove(new_buf
, old_buf
, l_len
);
2373 /* a common context -- skip it in the original postimage */
2376 /* and find the corresponding one in the fixed preimage */
2377 while (ctx
< preimage
->nr
&&
2378 !(preimage
->line
[ctx
].flag
& LINE_COMMON
)) {
2379 fixed
+= preimage
->line
[ctx
].len
;
2384 * preimage is expected to run out, if the caller
2385 * fixed addition of trailing blank lines.
2387 if (preimage
->nr
<= ctx
) {
2392 /* and copy it in, while fixing the line length */
2393 l_len
= preimage
->line
[ctx
].len
;
2394 memcpy(new_buf
, fixed
, l_len
);
2397 postimage
->line
[i
].len
= l_len
;
2402 ? postlen
< new_buf
- postimage
->buf
2403 : postimage
->len
< new_buf
- postimage
->buf
)
2404 BUG("caller miscounted postlen: asked %d, orig = %d, used = %d",
2405 (int)postlen
, (int) postimage
->len
, (int)(new_buf
- postimage
->buf
));
2407 /* Fix the length of the whole thing */
2408 postimage
->len
= new_buf
- postimage
->buf
;
2409 postimage
->nr
-= reduced
;
2412 static int line_by_line_fuzzy_match(struct image
*img
,
2413 struct image
*preimage
,
2414 struct image
*postimage
,
2415 unsigned long current
,
2422 size_t postlen
= postimage
->len
;
2427 struct strbuf fixed
;
2431 for (i
= 0; i
< preimage_limit
; i
++) {
2432 size_t prelen
= preimage
->line
[i
].len
;
2433 size_t imglen
= img
->line
[current_lno
+i
].len
;
2435 if (!fuzzy_matchlines(img
->buf
+ current
+ imgoff
, imglen
,
2436 preimage
->buf
+ preoff
, prelen
))
2438 if (preimage
->line
[i
].flag
& LINE_COMMON
)
2439 postlen
+= imglen
- prelen
;
2445 * Ok, the preimage matches with whitespace fuzz.
2447 * imgoff now holds the true length of the target that
2448 * matches the preimage before the end of the file.
2450 * Count the number of characters in the preimage that fall
2451 * beyond the end of the file and make sure that all of them
2452 * are whitespace characters. (This can only happen if
2453 * we are removing blank lines at the end of the file.)
2455 buf
= preimage_eof
= preimage
->buf
+ preoff
;
2456 for ( ; i
< preimage
->nr
; i
++)
2457 preoff
+= preimage
->line
[i
].len
;
2458 preimage_end
= preimage
->buf
+ preoff
;
2459 for ( ; buf
< preimage_end
; buf
++)
2464 * Update the preimage and the common postimage context
2465 * lines to use the same whitespace as the target.
2466 * If whitespace is missing in the target (i.e.
2467 * if the preimage extends beyond the end of the file),
2468 * use the whitespace from the preimage.
2470 extra_chars
= preimage_end
- preimage_eof
;
2471 strbuf_init(&fixed
, imgoff
+ extra_chars
);
2472 strbuf_add(&fixed
, img
->buf
+ current
, imgoff
);
2473 strbuf_add(&fixed
, preimage_eof
, extra_chars
);
2474 fixed_buf
= strbuf_detach(&fixed
, &fixed_len
);
2475 update_pre_post_images(preimage
, postimage
,
2476 fixed_buf
, fixed_len
, postlen
);
2480 static int match_fragment(struct apply_state
*state
,
2482 struct image
*preimage
,
2483 struct image
*postimage
,
2484 unsigned long current
,
2487 int match_beginning
, int match_end
)
2490 char *fixed_buf
, *buf
, *orig
, *target
;
2491 struct strbuf fixed
;
2492 size_t fixed_len
, postlen
;
2495 if (preimage
->nr
+ current_lno
<= img
->nr
) {
2497 * The hunk falls within the boundaries of img.
2499 preimage_limit
= preimage
->nr
;
2500 if (match_end
&& (preimage
->nr
+ current_lno
!= img
->nr
))
2502 } else if (state
->ws_error_action
== correct_ws_error
&&
2503 (ws_rule
& WS_BLANK_AT_EOF
)) {
2505 * This hunk extends beyond the end of img, and we are
2506 * removing blank lines at the end of the file. This
2507 * many lines from the beginning of the preimage must
2508 * match with img, and the remainder of the preimage
2511 preimage_limit
= img
->nr
- current_lno
;
2514 * The hunk extends beyond the end of the img and
2515 * we are not removing blanks at the end, so we
2516 * should reject the hunk at this position.
2521 if (match_beginning
&& current_lno
)
2524 /* Quick hash check */
2525 for (i
= 0; i
< preimage_limit
; i
++)
2526 if ((img
->line
[current_lno
+ i
].flag
& LINE_PATCHED
) ||
2527 (preimage
->line
[i
].hash
!= img
->line
[current_lno
+ i
].hash
))
2530 if (preimage_limit
== preimage
->nr
) {
2532 * Do we have an exact match? If we were told to match
2533 * at the end, size must be exactly at current+fragsize,
2534 * otherwise current+fragsize must be still within the preimage,
2535 * and either case, the old piece should match the preimage
2539 ? (current
+ preimage
->len
== img
->len
)
2540 : (current
+ preimage
->len
<= img
->len
)) &&
2541 !memcmp(img
->buf
+ current
, preimage
->buf
, preimage
->len
))
2545 * The preimage extends beyond the end of img, so
2546 * there cannot be an exact match.
2548 * There must be one non-blank context line that match
2549 * a line before the end of img.
2553 buf
= preimage
->buf
;
2555 for (i
= 0; i
< preimage_limit
; i
++)
2556 buf_end
+= preimage
->line
[i
].len
;
2558 for ( ; buf
< buf_end
; buf
++)
2566 * No exact match. If we are ignoring whitespace, run a line-by-line
2567 * fuzzy matching. We collect all the line length information because
2568 * we need it to adjust whitespace if we match.
2570 if (state
->ws_ignore_action
== ignore_ws_change
)
2571 return line_by_line_fuzzy_match(img
, preimage
, postimage
,
2572 current
, current_lno
, preimage_limit
);
2574 if (state
->ws_error_action
!= correct_ws_error
)
2578 * The hunk does not apply byte-by-byte, but the hash says
2579 * it might with whitespace fuzz. We weren't asked to
2580 * ignore whitespace, we were asked to correct whitespace
2581 * errors, so let's try matching after whitespace correction.
2583 * While checking the preimage against the target, whitespace
2584 * errors in both fixed, we count how large the corresponding
2585 * postimage needs to be. The postimage prepared by
2586 * apply_one_fragment() has whitespace errors fixed on added
2587 * lines already, but the common lines were propagated as-is,
2588 * which may become longer when their whitespace errors are
2592 /* First count added lines in postimage */
2594 for (i
= 0; i
< postimage
->nr
; i
++) {
2595 if (!(postimage
->line
[i
].flag
& LINE_COMMON
))
2596 postlen
+= postimage
->line
[i
].len
;
2600 * The preimage may extend beyond the end of the file,
2601 * but in this loop we will only handle the part of the
2602 * preimage that falls within the file.
2604 strbuf_init(&fixed
, preimage
->len
+ 1);
2605 orig
= preimage
->buf
;
2606 target
= img
->buf
+ current
;
2607 for (i
= 0; i
< preimage_limit
; i
++) {
2608 size_t oldlen
= preimage
->line
[i
].len
;
2609 size_t tgtlen
= img
->line
[current_lno
+ i
].len
;
2610 size_t fixstart
= fixed
.len
;
2611 struct strbuf tgtfix
;
2614 /* Try fixing the line in the preimage */
2615 ws_fix_copy(&fixed
, orig
, oldlen
, ws_rule
, NULL
);
2617 /* Try fixing the line in the target */
2618 strbuf_init(&tgtfix
, tgtlen
);
2619 ws_fix_copy(&tgtfix
, target
, tgtlen
, ws_rule
, NULL
);
2622 * If they match, either the preimage was based on
2623 * a version before our tree fixed whitespace breakage,
2624 * or we are lacking a whitespace-fix patch the tree
2625 * the preimage was based on already had (i.e. target
2626 * has whitespace breakage, the preimage doesn't).
2627 * In either case, we are fixing the whitespace breakages
2628 * so we might as well take the fix together with their
2631 match
= (tgtfix
.len
== fixed
.len
- fixstart
&&
2632 !memcmp(tgtfix
.buf
, fixed
.buf
+ fixstart
,
2633 fixed
.len
- fixstart
));
2635 /* Add the length if this is common with the postimage */
2636 if (preimage
->line
[i
].flag
& LINE_COMMON
)
2637 postlen
+= tgtfix
.len
;
2639 strbuf_release(&tgtfix
);
2649 * Now handle the lines in the preimage that falls beyond the
2650 * end of the file (if any). They will only match if they are
2651 * empty or only contain whitespace (if WS_BLANK_AT_EOL is
2654 for ( ; i
< preimage
->nr
; i
++) {
2655 size_t fixstart
= fixed
.len
; /* start of the fixed preimage */
2656 size_t oldlen
= preimage
->line
[i
].len
;
2659 /* Try fixing the line in the preimage */
2660 ws_fix_copy(&fixed
, orig
, oldlen
, ws_rule
, NULL
);
2662 for (j
= fixstart
; j
< fixed
.len
; j
++)
2663 if (!isspace(fixed
.buf
[j
]))
2670 * Yes, the preimage is based on an older version that still
2671 * has whitespace breakages unfixed, and fixing them makes the
2672 * hunk match. Update the context lines in the postimage.
2674 fixed_buf
= strbuf_detach(&fixed
, &fixed_len
);
2675 if (postlen
< postimage
->len
)
2677 update_pre_post_images(preimage
, postimage
,
2678 fixed_buf
, fixed_len
, postlen
);
2682 strbuf_release(&fixed
);
2686 static int find_pos(struct apply_state
*state
,
2688 struct image
*preimage
,
2689 struct image
*postimage
,
2692 int match_beginning
, int match_end
)
2695 unsigned long backwards
, forwards
, current
;
2696 int backwards_lno
, forwards_lno
, current_lno
;
2699 * When running with --allow-overlap, it is possible that a hunk is
2700 * seen that pretends to start at the beginning (but no longer does),
2701 * and that *still* needs to match the end. So trust `match_end` more
2702 * than `match_beginning`.
2704 if (state
->allow_overlap
&& match_beginning
&& match_end
&&
2705 img
->nr
- preimage
->nr
!= 0)
2706 match_beginning
= 0;
2709 * If match_beginning or match_end is specified, there is no
2710 * point starting from a wrong line that will never match and
2711 * wander around and wait for a match at the specified end.
2713 if (match_beginning
)
2716 line
= img
->nr
- preimage
->nr
;
2719 * Because the comparison is unsigned, the following test
2720 * will also take care of a negative line number that can
2721 * result when match_end and preimage is larger than the target.
2723 if ((size_t) line
> img
->nr
)
2727 for (i
= 0; i
< line
; i
++)
2728 current
+= img
->line
[i
].len
;
2731 * There's probably some smart way to do this, but I'll leave
2732 * that to the smart and beautiful people. I'm simple and stupid.
2734 backwards
= current
;
2735 backwards_lno
= line
;
2737 forwards_lno
= line
;
2740 for (i
= 0; ; i
++) {
2741 if (match_fragment(state
, img
, preimage
, postimage
,
2742 current
, current_lno
, ws_rule
,
2743 match_beginning
, match_end
))
2747 if (backwards_lno
== 0 && forwards_lno
== img
->nr
)
2751 if (backwards_lno
== 0) {
2756 backwards
-= img
->line
[backwards_lno
].len
;
2757 current
= backwards
;
2758 current_lno
= backwards_lno
;
2760 if (forwards_lno
== img
->nr
) {
2764 forwards
+= img
->line
[forwards_lno
].len
;
2767 current_lno
= forwards_lno
;
2774 static void remove_first_line(struct image
*img
)
2776 img
->buf
+= img
->line
[0].len
;
2777 img
->len
-= img
->line
[0].len
;
2782 static void remove_last_line(struct image
*img
)
2784 img
->len
-= img
->line
[--img
->nr
].len
;
2788 * The change from "preimage" and "postimage" has been found to
2789 * apply at applied_pos (counts in line numbers) in "img".
2790 * Update "img" to remove "preimage" and replace it with "postimage".
2792 static void update_image(struct apply_state
*state
,
2795 struct image
*preimage
,
2796 struct image
*postimage
)
2799 * remove the copy of preimage at offset in img
2800 * and replace it with postimage
2803 size_t remove_count
, insert_count
, applied_at
= 0;
2808 * If we are removing blank lines at the end of img,
2809 * the preimage may extend beyond the end.
2810 * If that is the case, we must be careful only to
2811 * remove the part of the preimage that falls within
2812 * the boundaries of img. Initialize preimage_limit
2813 * to the number of lines in the preimage that falls
2814 * within the boundaries.
2816 preimage_limit
= preimage
->nr
;
2817 if (preimage_limit
> img
->nr
- applied_pos
)
2818 preimage_limit
= img
->nr
- applied_pos
;
2820 for (i
= 0; i
< applied_pos
; i
++)
2821 applied_at
+= img
->line
[i
].len
;
2824 for (i
= 0; i
< preimage_limit
; i
++)
2825 remove_count
+= img
->line
[applied_pos
+ i
].len
;
2826 insert_count
= postimage
->len
;
2828 /* Adjust the contents */
2829 result
= xmalloc(st_add3(st_sub(img
->len
, remove_count
), insert_count
, 1));
2830 memcpy(result
, img
->buf
, applied_at
);
2831 memcpy(result
+ applied_at
, postimage
->buf
, postimage
->len
);
2832 memcpy(result
+ applied_at
+ postimage
->len
,
2833 img
->buf
+ (applied_at
+ remove_count
),
2834 img
->len
- (applied_at
+ remove_count
));
2837 img
->len
+= insert_count
- remove_count
;
2838 result
[img
->len
] = '\0';
2840 /* Adjust the line table */
2841 nr
= img
->nr
+ postimage
->nr
- preimage_limit
;
2842 if (preimage_limit
< postimage
->nr
) {
2844 * NOTE: this knows that we never call remove_first_line()
2845 * on anything other than pre/post image.
2847 REALLOC_ARRAY(img
->line
, nr
);
2848 img
->line_allocated
= img
->line
;
2850 if (preimage_limit
!= postimage
->nr
)
2851 MOVE_ARRAY(img
->line
+ applied_pos
+ postimage
->nr
,
2852 img
->line
+ applied_pos
+ preimage_limit
,
2853 img
->nr
- (applied_pos
+ preimage_limit
));
2854 COPY_ARRAY(img
->line
+ applied_pos
, postimage
->line
, postimage
->nr
);
2855 if (!state
->allow_overlap
)
2856 for (i
= 0; i
< postimage
->nr
; i
++)
2857 img
->line
[applied_pos
+ i
].flag
|= LINE_PATCHED
;
2862 * Use the patch-hunk text in "frag" to prepare two images (preimage and
2863 * postimage) for the hunk. Find lines that match "preimage" in "img" and
2864 * replace the part of "img" with "postimage" text.
2866 static int apply_one_fragment(struct apply_state
*state
,
2867 struct image
*img
, struct fragment
*frag
,
2868 int inaccurate_eof
, unsigned ws_rule
,
2871 int match_beginning
, match_end
;
2872 const char *patch
= frag
->patch
;
2873 int size
= frag
->size
;
2874 char *old
, *oldlines
;
2875 struct strbuf newlines
;
2876 int new_blank_lines_at_end
= 0;
2877 int found_new_blank_lines_at_end
= 0;
2878 int hunk_linenr
= frag
->linenr
;
2879 unsigned long leading
, trailing
;
2880 int pos
, applied_pos
;
2881 struct image preimage
;
2882 struct image postimage
;
2884 memset(&preimage
, 0, sizeof(preimage
));
2885 memset(&postimage
, 0, sizeof(postimage
));
2886 oldlines
= xmalloc(size
);
2887 strbuf_init(&newlines
, size
);
2892 int len
= linelen(patch
, size
);
2894 int added_blank_line
= 0;
2895 int is_blank_context
= 0;
2902 * "plen" is how much of the line we should use for
2903 * the actual patch data. Normally we just remove the
2904 * first character on the line, but if the line is
2905 * followed by "\ No newline", then we also remove the
2906 * last one (which is the newline, of course).
2909 if (len
< size
&& patch
[len
] == '\\')
2912 if (state
->apply_in_reverse
) {
2915 else if (first
== '+')
2921 /* Newer GNU diff, empty context line */
2923 /* ... followed by '\No newline'; nothing */
2926 strbuf_addch(&newlines
, '\n');
2927 add_line_info(&preimage
, "\n", 1, LINE_COMMON
);
2928 add_line_info(&postimage
, "\n", 1, LINE_COMMON
);
2929 is_blank_context
= 1;
2932 if (plen
&& (ws_rule
& WS_BLANK_AT_EOF
) &&
2933 ws_blank_line(patch
+ 1, plen
))
2934 is_blank_context
= 1;
2937 memcpy(old
, patch
+ 1, plen
);
2938 add_line_info(&preimage
, old
, plen
,
2939 (first
== ' ' ? LINE_COMMON
: 0));
2945 /* --no-add does not add new lines */
2946 if (first
== '+' && state
->no_add
)
2949 start
= newlines
.len
;
2951 !state
->whitespace_error
||
2952 state
->ws_error_action
!= correct_ws_error
) {
2953 strbuf_add(&newlines
, patch
+ 1, plen
);
2956 ws_fix_copy(&newlines
, patch
+ 1, plen
, ws_rule
, &state
->applied_after_fixing_ws
);
2958 add_line_info(&postimage
, newlines
.buf
+ start
, newlines
.len
- start
,
2959 (first
== '+' ? 0 : LINE_COMMON
));
2961 (ws_rule
& WS_BLANK_AT_EOF
) &&
2962 ws_blank_line(patch
+ 1, plen
))
2963 added_blank_line
= 1;
2965 case '@': case '\\':
2966 /* Ignore it, we already handled it */
2969 if (state
->apply_verbosity
> verbosity_normal
)
2970 error(_("invalid start of line: '%c'"), first
);
2974 if (added_blank_line
) {
2975 if (!new_blank_lines_at_end
)
2976 found_new_blank_lines_at_end
= hunk_linenr
;
2977 new_blank_lines_at_end
++;
2979 else if (is_blank_context
)
2982 new_blank_lines_at_end
= 0;
2987 if (inaccurate_eof
&&
2988 old
> oldlines
&& old
[-1] == '\n' &&
2989 newlines
.len
> 0 && newlines
.buf
[newlines
.len
- 1] == '\n') {
2991 strbuf_setlen(&newlines
, newlines
.len
- 1);
2992 preimage
.line_allocated
[preimage
.nr
- 1].len
--;
2993 postimage
.line_allocated
[postimage
.nr
- 1].len
--;
2996 leading
= frag
->leading
;
2997 trailing
= frag
->trailing
;
3000 * A hunk to change lines at the beginning would begin with
3002 * but we need to be careful. -U0 that inserts before the second
3003 * line also has this pattern.
3005 * And a hunk to add to an empty file would begin with
3008 * In other words, a hunk that is (frag->oldpos <= 1) with or
3009 * without leading context must match at the beginning.
3011 match_beginning
= (!frag
->oldpos
||
3012 (frag
->oldpos
== 1 && !state
->unidiff_zero
));
3015 * A hunk without trailing lines must match at the end.
3016 * However, we simply cannot tell if a hunk must match end
3017 * from the lack of trailing lines if the patch was generated
3018 * with unidiff without any context.
3020 match_end
= !state
->unidiff_zero
&& !trailing
;
3022 pos
= frag
->newpos
? (frag
->newpos
- 1) : 0;
3023 preimage
.buf
= oldlines
;
3024 preimage
.len
= old
- oldlines
;
3025 postimage
.buf
= newlines
.buf
;
3026 postimage
.len
= newlines
.len
;
3027 preimage
.line
= preimage
.line_allocated
;
3028 postimage
.line
= postimage
.line_allocated
;
3032 applied_pos
= find_pos(state
, img
, &preimage
, &postimage
, pos
,
3033 ws_rule
, match_beginning
, match_end
);
3035 if (applied_pos
>= 0)
3038 /* Am I at my context limits? */
3039 if ((leading
<= state
->p_context
) && (trailing
<= state
->p_context
))
3041 if (match_beginning
|| match_end
) {
3042 match_beginning
= match_end
= 0;
3047 * Reduce the number of context lines; reduce both
3048 * leading and trailing if they are equal otherwise
3049 * just reduce the larger context.
3051 if (leading
>= trailing
) {
3052 remove_first_line(&preimage
);
3053 remove_first_line(&postimage
);
3057 if (trailing
> leading
) {
3058 remove_last_line(&preimage
);
3059 remove_last_line(&postimage
);
3064 if (applied_pos
>= 0) {
3065 if (new_blank_lines_at_end
&&
3066 preimage
.nr
+ applied_pos
>= img
->nr
&&
3067 (ws_rule
& WS_BLANK_AT_EOF
) &&
3068 state
->ws_error_action
!= nowarn_ws_error
) {
3069 record_ws_error(state
, WS_BLANK_AT_EOF
, "+", 1,
3070 found_new_blank_lines_at_end
);
3071 if (state
->ws_error_action
== correct_ws_error
) {
3072 while (new_blank_lines_at_end
--)
3073 remove_last_line(&postimage
);
3076 * We would want to prevent write_out_results()
3077 * from taking place in apply_patch() that follows
3078 * the callchain led us here, which is:
3079 * apply_patch->check_patch_list->check_patch->
3080 * apply_data->apply_fragments->apply_one_fragment
3082 if (state
->ws_error_action
== die_on_ws_error
)
3086 if (state
->apply_verbosity
> verbosity_normal
&& applied_pos
!= pos
) {
3087 int offset
= applied_pos
- pos
;
3088 if (state
->apply_in_reverse
)
3089 offset
= 0 - offset
;
3091 Q_("Hunk #%d succeeded at %d (offset %d line).",
3092 "Hunk #%d succeeded at %d (offset %d lines).",
3094 nth_fragment
, applied_pos
+ 1, offset
);
3098 * Warn if it was necessary to reduce the number
3101 if ((leading
!= frag
->leading
||
3102 trailing
!= frag
->trailing
) && state
->apply_verbosity
> verbosity_silent
)
3103 fprintf_ln(stderr
, _("Context reduced to (%ld/%ld)"
3104 " to apply fragment at %d"),
3105 leading
, trailing
, applied_pos
+1);
3106 update_image(state
, img
, applied_pos
, &preimage
, &postimage
);
3108 if (state
->apply_verbosity
> verbosity_normal
)
3109 error(_("while searching for:\n%.*s"),
3110 (int)(old
- oldlines
), oldlines
);
3115 strbuf_release(&newlines
);
3116 free(preimage
.line_allocated
);
3117 free(postimage
.line_allocated
);
3119 return (applied_pos
< 0);
3122 static int apply_binary_fragment(struct apply_state
*state
,
3124 struct patch
*patch
)
3126 struct fragment
*fragment
= patch
->fragments
;
3131 return error(_("missing binary patch data for '%s'"),
3136 /* Binary patch is irreversible without the optional second hunk */
3137 if (state
->apply_in_reverse
) {
3138 if (!fragment
->next
)
3139 return error(_("cannot reverse-apply a binary patch "
3140 "without the reverse hunk to '%s'"),
3142 ? patch
->new_name
: patch
->old_name
);
3143 fragment
= fragment
->next
;
3145 switch (fragment
->binary_patch_method
) {
3146 case BINARY_DELTA_DEFLATED
:
3147 dst
= patch_delta(img
->buf
, img
->len
, fragment
->patch
,
3148 fragment
->size
, &len
);
3155 case BINARY_LITERAL_DEFLATED
:
3157 img
->len
= fragment
->size
;
3158 img
->buf
= xmemdupz(fragment
->patch
, img
->len
);
3165 * Replace "img" with the result of applying the binary patch.
3166 * The binary patch data itself in patch->fragment is still kept
3167 * but the preimage prepared by the caller in "img" is freed here
3168 * or in the helper function apply_binary_fragment() this calls.
3170 static int apply_binary(struct apply_state
*state
,
3172 struct patch
*patch
)
3174 const char *name
= patch
->old_name
? patch
->old_name
: patch
->new_name
;
3175 struct object_id oid
;
3176 const unsigned hexsz
= the_hash_algo
->hexsz
;
3179 * For safety, we require patch index line to contain
3180 * full hex textual object ID for old and new, at least for now.
3182 if (strlen(patch
->old_oid_prefix
) != hexsz
||
3183 strlen(patch
->new_oid_prefix
) != hexsz
||
3184 get_oid_hex(patch
->old_oid_prefix
, &oid
) ||
3185 get_oid_hex(patch
->new_oid_prefix
, &oid
))
3186 return error(_("cannot apply binary patch to '%s' "
3187 "without full index line"), name
);
3189 if (patch
->old_name
) {
3191 * See if the old one matches what the patch
3194 hash_object_file(the_hash_algo
, img
->buf
, img
->len
, OBJ_BLOB
,
3196 if (strcmp(oid_to_hex(&oid
), patch
->old_oid_prefix
))
3197 return error(_("the patch applies to '%s' (%s), "
3198 "which does not match the "
3199 "current contents."),
3200 name
, oid_to_hex(&oid
));
3203 /* Otherwise, the old one must be empty. */
3205 return error(_("the patch applies to an empty "
3206 "'%s' but it is not empty"), name
);
3209 get_oid_hex(patch
->new_oid_prefix
, &oid
);
3210 if (is_null_oid(&oid
)) {
3212 return 0; /* deletion patch */
3215 if (has_object(the_repository
, &oid
, 0)) {
3216 /* We already have the postimage */
3217 enum object_type type
;
3221 result
= repo_read_object_file(the_repository
, &oid
, &type
,
3224 return error(_("the necessary postimage %s for "
3225 "'%s' cannot be read"),
3226 patch
->new_oid_prefix
, name
);
3232 * We have verified buf matches the preimage;
3233 * apply the patch data to it, which is stored
3234 * in the patch->fragments->{patch,size}.
3236 if (apply_binary_fragment(state
, img
, patch
))
3237 return error(_("binary patch does not apply to '%s'"),
3240 /* verify that the result matches */
3241 hash_object_file(the_hash_algo
, img
->buf
, img
->len
, OBJ_BLOB
,
3243 if (strcmp(oid_to_hex(&oid
), patch
->new_oid_prefix
))
3244 return error(_("binary patch to '%s' creates incorrect result (expecting %s, got %s)"),
3245 name
, patch
->new_oid_prefix
, oid_to_hex(&oid
));
3251 static int apply_fragments(struct apply_state
*state
, struct image
*img
, struct patch
*patch
)
3253 struct fragment
*frag
= patch
->fragments
;
3254 const char *name
= patch
->old_name
? patch
->old_name
: patch
->new_name
;
3255 unsigned ws_rule
= patch
->ws_rule
;
3256 unsigned inaccurate_eof
= patch
->inaccurate_eof
;
3259 if (patch
->is_binary
)
3260 return apply_binary(state
, img
, patch
);
3264 if (apply_one_fragment(state
, img
, frag
, inaccurate_eof
, ws_rule
, nth
)) {
3265 error(_("patch failed: %s:%ld"), name
, frag
->oldpos
);
3266 if (!state
->apply_with_reject
)
3275 static int read_blob_object(struct strbuf
*buf
, const struct object_id
*oid
, unsigned mode
)
3277 if (S_ISGITLINK(mode
)) {
3278 strbuf_grow(buf
, 100);
3279 strbuf_addf(buf
, "Subproject commit %s\n", oid_to_hex(oid
));
3281 enum object_type type
;
3285 result
= repo_read_object_file(the_repository
, oid
, &type
,
3289 /* XXX read_sha1_file NUL-terminates */
3290 strbuf_attach(buf
, result
, sz
, sz
+ 1);
3295 static int read_file_or_gitlink(const struct cache_entry
*ce
, struct strbuf
*buf
)
3299 return read_blob_object(buf
, &ce
->oid
, ce
->ce_mode
);
3302 static struct patch
*in_fn_table(struct apply_state
*state
, const char *name
)
3304 struct string_list_item
*item
;
3309 item
= string_list_lookup(&state
->fn_table
, name
);
3311 return (struct patch
*)item
->util
;
3317 * item->util in the filename table records the status of the path.
3318 * Usually it points at a patch (whose result records the contents
3319 * of it after applying it), but it could be PATH_WAS_DELETED for a
3320 * path that a previously applied patch has already removed, or
3321 * PATH_TO_BE_DELETED for a path that a later patch would remove.
3323 * The latter is needed to deal with a case where two paths A and B
3324 * are swapped by first renaming A to B and then renaming B to A;
3325 * moving A to B should not be prevented due to presence of B as we
3326 * will remove it in a later patch.
3328 #define PATH_TO_BE_DELETED ((struct patch *) -2)
3329 #define PATH_WAS_DELETED ((struct patch *) -1)
3331 static int to_be_deleted(struct patch
*patch
)
3333 return patch
== PATH_TO_BE_DELETED
;
3336 static int was_deleted(struct patch
*patch
)
3338 return patch
== PATH_WAS_DELETED
;
3341 static void add_to_fn_table(struct apply_state
*state
, struct patch
*patch
)
3343 struct string_list_item
*item
;
3346 * Always add new_name unless patch is a deletion
3347 * This should cover the cases for normal diffs,
3348 * file creations and copies
3350 if (patch
->new_name
) {
3351 item
= string_list_insert(&state
->fn_table
, patch
->new_name
);
3356 * store a failure on rename/deletion cases because
3357 * later chunks shouldn't patch old names
3359 if ((patch
->new_name
== NULL
) || (patch
->is_rename
)) {
3360 item
= string_list_insert(&state
->fn_table
, patch
->old_name
);
3361 item
->util
= PATH_WAS_DELETED
;
3365 static void prepare_fn_table(struct apply_state
*state
, struct patch
*patch
)
3368 * store information about incoming file deletion
3371 if ((patch
->new_name
== NULL
) || (patch
->is_rename
)) {
3372 struct string_list_item
*item
;
3373 item
= string_list_insert(&state
->fn_table
, patch
->old_name
);
3374 item
->util
= PATH_TO_BE_DELETED
;
3376 patch
= patch
->next
;
3380 static int checkout_target(struct index_state
*istate
,
3381 struct cache_entry
*ce
, struct stat
*st
)
3383 struct checkout costate
= CHECKOUT_INIT
;
3385 costate
.refresh_cache
= 1;
3386 costate
.istate
= istate
;
3387 if (checkout_entry(ce
, &costate
, NULL
, NULL
) ||
3388 lstat(ce
->name
, st
))
3389 return error(_("cannot checkout %s"), ce
->name
);
3393 static struct patch
*previous_patch(struct apply_state
*state
,
3394 struct patch
*patch
,
3397 struct patch
*previous
;
3400 if (patch
->is_copy
|| patch
->is_rename
)
3401 return NULL
; /* "git" patches do not depend on the order */
3403 previous
= in_fn_table(state
, patch
->old_name
);
3407 if (to_be_deleted(previous
))
3408 return NULL
; /* the deletion hasn't happened yet */
3410 if (was_deleted(previous
))
3416 static int verify_index_match(struct apply_state
*state
,
3417 const struct cache_entry
*ce
,
3420 if (S_ISGITLINK(ce
->ce_mode
)) {
3421 if (!S_ISDIR(st
->st_mode
))
3425 return ie_match_stat(state
->repo
->index
, ce
, st
,
3426 CE_MATCH_IGNORE_VALID
| CE_MATCH_IGNORE_SKIP_WORKTREE
);
3429 #define SUBMODULE_PATCH_WITHOUT_INDEX 1
3431 static int load_patch_target(struct apply_state
*state
,
3433 const struct cache_entry
*ce
,
3435 struct patch
*patch
,
3437 unsigned expected_mode
)
3439 if (state
->cached
|| state
->check_index
) {
3440 if (read_file_or_gitlink(ce
, buf
))
3441 return error(_("failed to read %s"), name
);
3443 if (S_ISGITLINK(expected_mode
)) {
3445 return read_file_or_gitlink(ce
, buf
);
3447 return SUBMODULE_PATCH_WITHOUT_INDEX
;
3448 } else if (has_symlink_leading_path(name
, strlen(name
))) {
3449 return error(_("reading from '%s' beyond a symbolic link"), name
);
3451 if (read_old_data(st
, patch
, name
, buf
))
3452 return error(_("failed to read %s"), name
);
3459 * We are about to apply "patch"; populate the "image" with the
3460 * current version we have, from the working tree or from the index,
3461 * depending on the situation e.g. --cached/--index. If we are
3462 * applying a non-git patch that incrementally updates the tree,
3463 * we read from the result of a previous diff.
3465 static int load_preimage(struct apply_state
*state
,
3466 struct image
*image
,
3467 struct patch
*patch
, struct stat
*st
,
3468 const struct cache_entry
*ce
)
3470 struct strbuf buf
= STRBUF_INIT
;
3473 struct patch
*previous
;
3476 previous
= previous_patch(state
, patch
, &status
);
3478 return error(_("path %s has been renamed/deleted"),
3481 /* We have a patched copy in memory; use that. */
3482 strbuf_add(&buf
, previous
->result
, previous
->resultsize
);
3484 status
= load_patch_target(state
, &buf
, ce
, st
, patch
,
3485 patch
->old_name
, patch
->old_mode
);
3488 else if (status
== SUBMODULE_PATCH_WITHOUT_INDEX
) {
3490 * There is no way to apply subproject
3491 * patch without looking at the index.
3492 * NEEDSWORK: shouldn't this be flagged
3495 free_fragment_list(patch
->fragments
);
3496 patch
->fragments
= NULL
;
3497 } else if (status
) {
3498 return error(_("failed to read %s"), patch
->old_name
);
3502 img
= strbuf_detach(&buf
, &len
);
3503 prepare_image(image
, img
, len
, !patch
->is_binary
);
3507 static int resolve_to(struct image
*image
, const struct object_id
*result_id
)
3510 enum object_type type
;
3514 image
->buf
= repo_read_object_file(the_repository
, result_id
, &type
,
3516 if (!image
->buf
|| type
!= OBJ_BLOB
)
3517 die("unable to read blob object %s", oid_to_hex(result_id
));
3523 static int three_way_merge(struct apply_state
*state
,
3524 struct image
*image
,
3526 const struct object_id
*base
,
3527 const struct object_id
*ours
,
3528 const struct object_id
*theirs
)
3530 mmfile_t base_file
, our_file
, their_file
;
3531 mmbuffer_t result
= { NULL
};
3532 enum ll_merge_result status
;
3534 /* resolve trivial cases first */
3535 if (oideq(base
, ours
))
3536 return resolve_to(image
, theirs
);
3537 else if (oideq(base
, theirs
) || oideq(ours
, theirs
))
3538 return resolve_to(image
, ours
);
3540 read_mmblob(&base_file
, base
);
3541 read_mmblob(&our_file
, ours
);
3542 read_mmblob(&their_file
, theirs
);
3543 status
= ll_merge(&result
, path
,
3546 &their_file
, "theirs",
3549 if (status
== LL_MERGE_BINARY_CONFLICT
)
3550 warning("Cannot merge binary files: %s (%s vs. %s)",
3551 path
, "ours", "theirs");
3552 free(base_file
.ptr
);
3554 free(their_file
.ptr
);
3555 if (status
< 0 || !result
.ptr
) {
3560 image
->buf
= result
.ptr
;
3561 image
->len
= result
.size
;
3567 * When directly falling back to add/add three-way merge, we read from
3568 * the current contents of the new_name. In no cases other than that
3569 * this function will be called.
3571 static int load_current(struct apply_state
*state
,
3572 struct image
*image
,
3573 struct patch
*patch
)
3575 struct strbuf buf
= STRBUF_INIT
;
3580 struct cache_entry
*ce
;
3581 char *name
= patch
->new_name
;
3582 unsigned mode
= patch
->new_mode
;
3585 BUG("patch to %s is not a creation", patch
->old_name
);
3587 pos
= index_name_pos(state
->repo
->index
, name
, strlen(name
));
3589 return error(_("%s: does not exist in index"), name
);
3590 ce
= state
->repo
->index
->cache
[pos
];
3591 if (lstat(name
, &st
)) {
3592 if (errno
!= ENOENT
)
3593 return error_errno("%s", name
);
3594 if (checkout_target(state
->repo
->index
, ce
, &st
))
3597 if (verify_index_match(state
, ce
, &st
))
3598 return error(_("%s: does not match index"), name
);
3600 status
= load_patch_target(state
, &buf
, ce
, &st
, patch
, name
, mode
);
3605 img
= strbuf_detach(&buf
, &len
);
3606 prepare_image(image
, img
, len
, !patch
->is_binary
);
3610 static int try_threeway(struct apply_state
*state
,
3611 struct image
*image
,
3612 struct patch
*patch
,
3614 const struct cache_entry
*ce
)
3616 struct object_id pre_oid
, post_oid
, our_oid
;
3617 struct strbuf buf
= STRBUF_INIT
;
3621 struct image tmp_image
;
3623 /* No point falling back to 3-way merge in these cases */
3624 if (patch
->is_delete
||
3625 S_ISGITLINK(patch
->old_mode
) || S_ISGITLINK(patch
->new_mode
) ||
3626 (patch
->is_new
&& !patch
->direct_to_threeway
) ||
3627 (patch
->is_rename
&& !patch
->lines_added
&& !patch
->lines_deleted
))
3630 /* Preimage the patch was prepared for */
3632 write_object_file("", 0, OBJ_BLOB
, &pre_oid
);
3633 else if (repo_get_oid(the_repository
, patch
->old_oid_prefix
, &pre_oid
) ||
3634 read_blob_object(&buf
, &pre_oid
, patch
->old_mode
))
3635 return error(_("repository lacks the necessary blob to perform 3-way merge."));
3637 if (state
->apply_verbosity
> verbosity_silent
&& patch
->direct_to_threeway
)
3638 fprintf(stderr
, _("Performing three-way merge...\n"));
3640 img
= strbuf_detach(&buf
, &len
);
3641 prepare_image(&tmp_image
, img
, len
, 1);
3642 /* Apply the patch to get the post image */
3643 if (apply_fragments(state
, &tmp_image
, patch
) < 0) {
3644 clear_image(&tmp_image
);
3647 /* post_oid is theirs */
3648 write_object_file(tmp_image
.buf
, tmp_image
.len
, OBJ_BLOB
, &post_oid
);
3649 clear_image(&tmp_image
);
3651 /* our_oid is ours */
3652 if (patch
->is_new
) {
3653 if (load_current(state
, &tmp_image
, patch
))
3654 return error(_("cannot read the current contents of '%s'"),
3657 if (load_preimage(state
, &tmp_image
, patch
, st
, ce
))
3658 return error(_("cannot read the current contents of '%s'"),
3661 write_object_file(tmp_image
.buf
, tmp_image
.len
, OBJ_BLOB
, &our_oid
);
3662 clear_image(&tmp_image
);
3664 /* in-core three-way merge between post and our using pre as base */
3665 status
= three_way_merge(state
, image
, patch
->new_name
,
3666 &pre_oid
, &our_oid
, &post_oid
);
3668 if (state
->apply_verbosity
> verbosity_silent
)
3670 _("Failed to perform three-way merge...\n"));
3675 patch
->conflicted_threeway
= 1;
3677 oidclr(&patch
->threeway_stage
[0]);
3679 oidcpy(&patch
->threeway_stage
[0], &pre_oid
);
3680 oidcpy(&patch
->threeway_stage
[1], &our_oid
);
3681 oidcpy(&patch
->threeway_stage
[2], &post_oid
);
3682 if (state
->apply_verbosity
> verbosity_silent
)
3684 _("Applied patch to '%s' with conflicts.\n"),
3687 if (state
->apply_verbosity
> verbosity_silent
)
3689 _("Applied patch to '%s' cleanly.\n"),
3695 static int apply_data(struct apply_state
*state
, struct patch
*patch
,
3696 struct stat
*st
, const struct cache_entry
*ce
)
3700 if (load_preimage(state
, &image
, patch
, st
, ce
) < 0)
3703 if (!state
->threeway
|| try_threeway(state
, &image
, patch
, st
, ce
) < 0) {
3704 if (state
->apply_verbosity
> verbosity_silent
&&
3705 state
->threeway
&& !patch
->direct_to_threeway
)
3706 fprintf(stderr
, _("Falling back to direct application...\n"));
3708 /* Note: with --reject, apply_fragments() returns 0 */
3709 if (patch
->direct_to_threeway
|| apply_fragments(state
, &image
, patch
) < 0)
3712 patch
->result
= image
.buf
;
3713 patch
->resultsize
= image
.len
;
3714 add_to_fn_table(state
, patch
);
3715 free(image
.line_allocated
);
3717 if (0 < patch
->is_delete
&& patch
->resultsize
)
3718 return error(_("removal patch leaves file contents"));
3724 * If "patch" that we are looking at modifies or deletes what we have,
3725 * we would want it not to lose any local modification we have, either
3726 * in the working tree or in the index.
3728 * This also decides if a non-git patch is a creation patch or a
3729 * modification to an existing empty file. We do not check the state
3730 * of the current tree for a creation patch in this function; the caller
3731 * check_patch() separately makes sure (and errors out otherwise) that
3732 * the path the patch creates does not exist in the current tree.
3734 static int check_preimage(struct apply_state
*state
,
3735 struct patch
*patch
,
3736 struct cache_entry
**ce
,
3739 const char *old_name
= patch
->old_name
;
3740 struct patch
*previous
= NULL
;
3741 int stat_ret
= 0, status
;
3742 unsigned st_mode
= 0;
3747 assert(patch
->is_new
<= 0);
3748 previous
= previous_patch(state
, patch
, &status
);
3751 return error(_("path %s has been renamed/deleted"), old_name
);
3753 st_mode
= previous
->new_mode
;
3754 } else if (!state
->cached
) {
3755 stat_ret
= lstat(old_name
, st
);
3756 if (stat_ret
&& errno
!= ENOENT
)
3757 return error_errno("%s", old_name
);
3760 if (state
->check_index
&& !previous
) {
3761 int pos
= index_name_pos(state
->repo
->index
, old_name
,
3764 if (patch
->is_new
< 0)
3766 return error(_("%s: does not exist in index"), old_name
);
3768 *ce
= state
->repo
->index
->cache
[pos
];
3770 if (checkout_target(state
->repo
->index
, *ce
, st
))
3773 if (!state
->cached
&& verify_index_match(state
, *ce
, st
))
3774 return error(_("%s: does not match index"), old_name
);
3776 st_mode
= (*ce
)->ce_mode
;
3777 } else if (stat_ret
< 0) {
3778 if (patch
->is_new
< 0)
3780 return error_errno("%s", old_name
);
3783 if (!state
->cached
&& !previous
)
3784 st_mode
= ce_mode_from_stat(*ce
, st
->st_mode
);
3786 if (patch
->is_new
< 0)
3788 if (!patch
->old_mode
)
3789 patch
->old_mode
= st_mode
;
3790 if ((st_mode
^ patch
->old_mode
) & S_IFMT
)
3791 return error(_("%s: wrong type"), old_name
);
3792 if (st_mode
!= patch
->old_mode
)
3793 warning(_("%s has type %o, expected %o"),
3794 old_name
, st_mode
, patch
->old_mode
);
3795 if (!patch
->new_mode
&& !patch
->is_delete
)
3796 patch
->new_mode
= st_mode
;
3801 patch
->is_delete
= 0;
3802 FREE_AND_NULL(patch
->old_name
);
3807 #define EXISTS_IN_INDEX 1
3808 #define EXISTS_IN_WORKTREE 2
3809 #define EXISTS_IN_INDEX_AS_ITA 3
3811 static int check_to_create(struct apply_state
*state
,
3812 const char *new_name
,
3817 if (state
->check_index
&& (!ok_if_exists
|| !state
->cached
)) {
3820 pos
= index_name_pos(state
->repo
->index
, new_name
, strlen(new_name
));
3822 struct cache_entry
*ce
= state
->repo
->index
->cache
[pos
];
3824 /* allow ITA, as they do not yet exist in the index */
3825 if (!ok_if_exists
&& !(ce
->ce_flags
& CE_INTENT_TO_ADD
))
3826 return EXISTS_IN_INDEX
;
3828 /* ITA entries can never match working tree files */
3829 if (!state
->cached
&& (ce
->ce_flags
& CE_INTENT_TO_ADD
))
3830 return EXISTS_IN_INDEX_AS_ITA
;
3837 if (!lstat(new_name
, &nst
)) {
3838 if (S_ISDIR(nst
.st_mode
) || ok_if_exists
)
3841 * A leading component of new_name might be a symlink
3842 * that is going to be removed with this patch, but
3843 * still pointing at somewhere that has the path.
3844 * In such a case, path "new_name" does not exist as
3845 * far as git is concerned.
3847 if (has_symlink_leading_path(new_name
, strlen(new_name
)))
3850 return EXISTS_IN_WORKTREE
;
3851 } else if (!is_missing_file_error(errno
)) {
3852 return error_errno("%s", new_name
);
3857 static void prepare_symlink_changes(struct apply_state
*state
, struct patch
*patch
)
3859 for ( ; patch
; patch
= patch
->next
) {
3860 if ((patch
->old_name
&& S_ISLNK(patch
->old_mode
)) &&
3861 (patch
->is_rename
|| patch
->is_delete
))
3862 /* the symlink at patch->old_name is removed */
3863 strset_add(&state
->removed_symlinks
, patch
->old_name
);
3865 if (patch
->new_name
&& S_ISLNK(patch
->new_mode
))
3866 /* the symlink at patch->new_name is created or remains */
3867 strset_add(&state
->kept_symlinks
, patch
->new_name
);
3871 static int path_is_beyond_symlink_1(struct apply_state
*state
, struct strbuf
*name
)
3874 while (--name
->len
&& name
->buf
[name
->len
] != '/')
3875 ; /* scan backwards */
3878 name
->buf
[name
->len
] = '\0';
3879 if (strset_contains(&state
->kept_symlinks
, name
->buf
))
3881 if (strset_contains(&state
->removed_symlinks
, name
->buf
))
3883 * This cannot be "return 0", because we may
3884 * see a new one created at a higher level.
3888 /* otherwise, check the preimage */
3889 if (state
->check_index
) {
3890 struct cache_entry
*ce
;
3892 ce
= index_file_exists(state
->repo
->index
, name
->buf
,
3893 name
->len
, ignore_case
);
3894 if (ce
&& S_ISLNK(ce
->ce_mode
))
3898 if (!lstat(name
->buf
, &st
) && S_ISLNK(st
.st_mode
))
3905 static int path_is_beyond_symlink(struct apply_state
*state
, const char *name_
)
3908 struct strbuf name
= STRBUF_INIT
;
3910 assert(*name_
!= '\0');
3911 strbuf_addstr(&name
, name_
);
3912 ret
= path_is_beyond_symlink_1(state
, &name
);
3913 strbuf_release(&name
);
3918 static int check_unsafe_path(struct patch
*patch
)
3920 const char *old_name
= NULL
;
3921 const char *new_name
= NULL
;
3922 if (patch
->is_delete
)
3923 old_name
= patch
->old_name
;
3924 else if (!patch
->is_new
&& !patch
->is_copy
)
3925 old_name
= patch
->old_name
;
3926 if (!patch
->is_delete
)
3927 new_name
= patch
->new_name
;
3929 if (old_name
&& !verify_path(old_name
, patch
->old_mode
))
3930 return error(_("invalid path '%s'"), old_name
);
3931 if (new_name
&& !verify_path(new_name
, patch
->new_mode
))
3932 return error(_("invalid path '%s'"), new_name
);
3937 * Check and apply the patch in-core; leave the result in patch->result
3938 * for the caller to write it out to the final destination.
3940 static int check_patch(struct apply_state
*state
, struct patch
*patch
)
3943 const char *old_name
= patch
->old_name
;
3944 const char *new_name
= patch
->new_name
;
3945 const char *name
= old_name
? old_name
: new_name
;
3946 struct cache_entry
*ce
= NULL
;
3947 struct patch
*tpatch
;
3951 patch
->rejected
= 1; /* we will drop this after we succeed */
3953 status
= check_preimage(state
, patch
, &ce
, &st
);
3956 old_name
= patch
->old_name
;
3959 * A type-change diff is always split into a patch to delete
3960 * old, immediately followed by a patch to create new (see
3961 * diff.c::run_diff()); in such a case it is Ok that the entry
3962 * to be deleted by the previous patch is still in the working
3963 * tree and in the index.
3965 * A patch to swap-rename between A and B would first rename A
3966 * to B and then rename B to A. While applying the first one,
3967 * the presence of B should not stop A from getting renamed to
3968 * B; ask to_be_deleted() about the later rename. Removal of
3969 * B and rename from A to B is handled the same way by asking
3972 if ((tpatch
= in_fn_table(state
, new_name
)) &&
3973 (was_deleted(tpatch
) || to_be_deleted(tpatch
)))
3979 ((0 < patch
->is_new
) || patch
->is_rename
|| patch
->is_copy
)) {
3980 int err
= check_to_create(state
, new_name
, ok_if_exists
);
3982 if (err
&& state
->threeway
) {
3983 patch
->direct_to_threeway
= 1;
3984 } else switch (err
) {
3987 case EXISTS_IN_INDEX
:
3988 return error(_("%s: already exists in index"), new_name
);
3989 case EXISTS_IN_INDEX_AS_ITA
:
3990 return error(_("%s: does not match index"), new_name
);
3991 case EXISTS_IN_WORKTREE
:
3992 return error(_("%s: already exists in working directory"),
3998 if (!patch
->new_mode
) {
3999 if (0 < patch
->is_new
)
4000 patch
->new_mode
= S_IFREG
| 0644;
4002 patch
->new_mode
= patch
->old_mode
;
4006 if (new_name
&& old_name
) {
4007 int same
= !strcmp(old_name
, new_name
);
4008 if (!patch
->new_mode
)
4009 patch
->new_mode
= patch
->old_mode
;
4010 if ((patch
->old_mode
^ patch
->new_mode
) & S_IFMT
) {
4012 return error(_("new mode (%o) of %s does not "
4013 "match old mode (%o)"),
4014 patch
->new_mode
, new_name
,
4017 return error(_("new mode (%o) of %s does not "
4018 "match old mode (%o) of %s"),
4019 patch
->new_mode
, new_name
,
4020 patch
->old_mode
, old_name
);
4024 if (!state
->unsafe_paths
&& check_unsafe_path(patch
))
4028 * An attempt to read from or delete a path that is beyond a
4029 * symbolic link will be prevented by load_patch_target() that
4030 * is called at the beginning of apply_data() so we do not
4031 * have to worry about a patch marked with "is_delete" bit
4032 * here. We however need to make sure that the patch result
4033 * is not deposited to a path that is beyond a symbolic link
4036 if (!patch
->is_delete
&& path_is_beyond_symlink(state
, patch
->new_name
))
4037 return error(_("affected file '%s' is beyond a symbolic link"),
4040 if (apply_data(state
, patch
, &st
, ce
) < 0)
4041 return error(_("%s: patch does not apply"), name
);
4042 patch
->rejected
= 0;
4046 static int check_patch_list(struct apply_state
*state
, struct patch
*patch
)
4050 prepare_symlink_changes(state
, patch
);
4051 prepare_fn_table(state
, patch
);
4054 if (state
->apply_verbosity
> verbosity_normal
)
4055 say_patch_name(stderr
,
4056 _("Checking patch %s..."), patch
);
4057 res
= check_patch(state
, patch
);
4061 patch
= patch
->next
;
4066 static int read_apply_cache(struct apply_state
*state
)
4068 if (state
->index_file
)
4069 return read_index_from(state
->repo
->index
, state
->index_file
,
4072 return repo_read_index(state
->repo
);
4075 /* This function tries to read the object name from the current index */
4076 static int get_current_oid(struct apply_state
*state
, const char *path
,
4077 struct object_id
*oid
)
4081 if (read_apply_cache(state
) < 0)
4083 pos
= index_name_pos(state
->repo
->index
, path
, strlen(path
));
4086 oidcpy(oid
, &state
->repo
->index
->cache
[pos
]->oid
);
4090 static int preimage_oid_in_gitlink_patch(struct patch
*p
, struct object_id
*oid
)
4093 * A usable gitlink patch has only one fragment (hunk) that looks like:
4095 * -Subproject commit <old sha1>
4096 * +Subproject commit <new sha1>
4099 * -Subproject commit <old sha1>
4100 * for a removal patch.
4102 struct fragment
*hunk
= p
->fragments
;
4103 static const char heading
[] = "-Subproject commit ";
4106 if (/* does the patch have only one hunk? */
4107 hunk
&& !hunk
->next
&&
4108 /* is its preimage one line? */
4109 hunk
->oldpos
== 1 && hunk
->oldlines
== 1 &&
4110 /* does preimage begin with the heading? */
4111 (preimage
= memchr(hunk
->patch
, '\n', hunk
->size
)) != NULL
&&
4112 starts_with(++preimage
, heading
) &&
4113 /* does it record full SHA-1? */
4114 !get_oid_hex(preimage
+ sizeof(heading
) - 1, oid
) &&
4115 preimage
[sizeof(heading
) + the_hash_algo
->hexsz
- 1] == '\n' &&
4116 /* does the abbreviated name on the index line agree with it? */
4117 starts_with(preimage
+ sizeof(heading
) - 1, p
->old_oid_prefix
))
4118 return 0; /* it all looks fine */
4120 /* we may have full object name on the index line */
4121 return get_oid_hex(p
->old_oid_prefix
, oid
);
4124 /* Build an index that contains just the files needed for a 3way merge */
4125 static int build_fake_ancestor(struct apply_state
*state
, struct patch
*list
)
4127 struct patch
*patch
;
4128 struct index_state result
= INDEX_STATE_INIT(state
->repo
);
4129 struct lock_file lock
= LOCK_INIT
;
4132 /* Once we start supporting the reverse patch, it may be
4133 * worth showing the new sha1 prefix, but until then...
4135 for (patch
= list
; patch
; patch
= patch
->next
) {
4136 struct object_id oid
;
4137 struct cache_entry
*ce
;
4140 name
= patch
->old_name
? patch
->old_name
: patch
->new_name
;
4141 if (0 < patch
->is_new
)
4144 if (S_ISGITLINK(patch
->old_mode
)) {
4145 if (!preimage_oid_in_gitlink_patch(patch
, &oid
))
4146 ; /* ok, the textual part looks sane */
4148 return error(_("sha1 information is lacking or "
4149 "useless for submodule %s"), name
);
4150 } else if (!repo_get_oid_blob(the_repository
, patch
->old_oid_prefix
, &oid
)) {
4152 } else if (!patch
->lines_added
&& !patch
->lines_deleted
) {
4153 /* mode-only change: update the current */
4154 if (get_current_oid(state
, patch
->old_name
, &oid
))
4155 return error(_("mode change for %s, which is not "
4156 "in current HEAD"), name
);
4158 return error(_("sha1 information is lacking or useless "
4161 ce
= make_cache_entry(&result
, patch
->old_mode
, &oid
, name
, 0, 0);
4163 return error(_("make_cache_entry failed for path '%s'"),
4165 if (add_index_entry(&result
, ce
, ADD_CACHE_OK_TO_ADD
)) {
4166 discard_cache_entry(ce
);
4167 return error(_("could not add %s to temporary index"),
4172 hold_lock_file_for_update(&lock
, state
->fake_ancestor
, LOCK_DIE_ON_ERROR
);
4173 res
= write_locked_index(&result
, &lock
, COMMIT_LOCK
);
4174 discard_index(&result
);
4177 return error(_("could not write temporary index to %s"),
4178 state
->fake_ancestor
);
4183 static void stat_patch_list(struct apply_state
*state
, struct patch
*patch
)
4185 int files
, adds
, dels
;
4187 for (files
= adds
= dels
= 0 ; patch
; patch
= patch
->next
) {
4189 adds
+= patch
->lines_added
;
4190 dels
+= patch
->lines_deleted
;
4191 show_stats(state
, patch
);
4194 print_stat_summary(stdout
, files
, adds
, dels
);
4197 static void numstat_patch_list(struct apply_state
*state
,
4198 struct patch
*patch
)
4200 for ( ; patch
; patch
= patch
->next
) {
4202 name
= patch
->new_name
? patch
->new_name
: patch
->old_name
;
4203 if (patch
->is_binary
)
4206 printf("%d\t%d\t", patch
->lines_added
, patch
->lines_deleted
);
4207 write_name_quoted(name
, stdout
, state
->line_termination
);
4211 static void show_file_mode_name(const char *newdelete
, unsigned int mode
, const char *name
)
4214 printf(" %s mode %06o %s\n", newdelete
, mode
, name
);
4216 printf(" %s %s\n", newdelete
, name
);
4219 static void show_mode_change(struct patch
*p
, int show_name
)
4221 if (p
->old_mode
&& p
->new_mode
&& p
->old_mode
!= p
->new_mode
) {
4223 printf(" mode change %06o => %06o %s\n",
4224 p
->old_mode
, p
->new_mode
, p
->new_name
);
4226 printf(" mode change %06o => %06o\n",
4227 p
->old_mode
, p
->new_mode
);
4231 static void show_rename_copy(struct patch
*p
)
4233 const char *renamecopy
= p
->is_rename
? "rename" : "copy";
4234 const char *old_name
, *new_name
;
4236 /* Find common prefix */
4237 old_name
= p
->old_name
;
4238 new_name
= p
->new_name
;
4240 const char *slash_old
, *slash_new
;
4241 slash_old
= strchr(old_name
, '/');
4242 slash_new
= strchr(new_name
, '/');
4245 slash_old
- old_name
!= slash_new
- new_name
||
4246 memcmp(old_name
, new_name
, slash_new
- new_name
))
4248 old_name
= slash_old
+ 1;
4249 new_name
= slash_new
+ 1;
4251 /* p->old_name through old_name is the common prefix, and old_name and
4252 * new_name through the end of names are renames
4254 if (old_name
!= p
->old_name
)
4255 printf(" %s %.*s{%s => %s} (%d%%)\n", renamecopy
,
4256 (int)(old_name
- p
->old_name
), p
->old_name
,
4257 old_name
, new_name
, p
->score
);
4259 printf(" %s %s => %s (%d%%)\n", renamecopy
,
4260 p
->old_name
, p
->new_name
, p
->score
);
4261 show_mode_change(p
, 0);
4264 static void summary_patch_list(struct patch
*patch
)
4268 for (p
= patch
; p
; p
= p
->next
) {
4270 show_file_mode_name("create", p
->new_mode
, p
->new_name
);
4271 else if (p
->is_delete
)
4272 show_file_mode_name("delete", p
->old_mode
, p
->old_name
);
4274 if (p
->is_rename
|| p
->is_copy
)
4275 show_rename_copy(p
);
4278 printf(" rewrite %s (%d%%)\n",
4279 p
->new_name
, p
->score
);
4280 show_mode_change(p
, 0);
4283 show_mode_change(p
, 1);
4289 static void patch_stats(struct apply_state
*state
, struct patch
*patch
)
4291 int lines
= patch
->lines_added
+ patch
->lines_deleted
;
4293 if (lines
> state
->max_change
)
4294 state
->max_change
= lines
;
4295 if (patch
->old_name
) {
4296 int len
= quote_c_style(patch
->old_name
, NULL
, NULL
, 0);
4298 len
= strlen(patch
->old_name
);
4299 if (len
> state
->max_len
)
4300 state
->max_len
= len
;
4302 if (patch
->new_name
) {
4303 int len
= quote_c_style(patch
->new_name
, NULL
, NULL
, 0);
4305 len
= strlen(patch
->new_name
);
4306 if (len
> state
->max_len
)
4307 state
->max_len
= len
;
4311 static int remove_file(struct apply_state
*state
, struct patch
*patch
, int rmdir_empty
)
4313 if (state
->update_index
&& !state
->ita_only
) {
4314 if (remove_file_from_index(state
->repo
->index
, patch
->old_name
) < 0)
4315 return error(_("unable to remove %s from index"), patch
->old_name
);
4317 if (!state
->cached
) {
4318 if (!remove_or_warn(patch
->old_mode
, patch
->old_name
) && rmdir_empty
) {
4319 remove_path(patch
->old_name
);
4325 static int add_index_file(struct apply_state
*state
,
4332 struct cache_entry
*ce
;
4333 int namelen
= strlen(path
);
4335 ce
= make_empty_cache_entry(state
->repo
->index
, namelen
);
4336 memcpy(ce
->name
, path
, namelen
);
4337 ce
->ce_mode
= create_ce_mode(mode
);
4338 ce
->ce_flags
= create_ce_flags(0);
4339 ce
->ce_namelen
= namelen
;
4340 if (state
->ita_only
) {
4341 ce
->ce_flags
|= CE_INTENT_TO_ADD
;
4342 set_object_name_for_intent_to_add_entry(ce
);
4343 } else if (S_ISGITLINK(mode
)) {
4346 if (!skip_prefix(buf
, "Subproject commit ", &s
) ||
4347 get_oid_hex(s
, &ce
->oid
)) {
4348 discard_cache_entry(ce
);
4349 return error(_("corrupt patch for submodule %s"), path
);
4352 if (!state
->cached
) {
4353 if (lstat(path
, &st
) < 0) {
4354 discard_cache_entry(ce
);
4355 return error_errno(_("unable to stat newly "
4356 "created file '%s'"),
4359 fill_stat_cache_info(state
->repo
->index
, ce
, &st
);
4361 if (write_object_file(buf
, size
, OBJ_BLOB
, &ce
->oid
) < 0) {
4362 discard_cache_entry(ce
);
4363 return error(_("unable to create backing store "
4364 "for newly created file %s"), path
);
4367 if (add_index_entry(state
->repo
->index
, ce
, ADD_CACHE_OK_TO_ADD
) < 0) {
4368 discard_cache_entry(ce
);
4369 return error(_("unable to add cache entry for %s"), path
);
4377 * -1 if an unrecoverable error happened
4378 * 0 if everything went well
4379 * 1 if a recoverable error happened
4381 static int try_create_file(struct apply_state
*state
, const char *path
,
4382 unsigned int mode
, const char *buf
,
4386 struct strbuf nbuf
= STRBUF_INIT
;
4388 if (S_ISGITLINK(mode
)) {
4390 if (!lstat(path
, &st
) && S_ISDIR(st
.st_mode
))
4392 return !!mkdir(path
, 0777);
4395 if (has_symlinks
&& S_ISLNK(mode
))
4396 /* Although buf:size is counted string, it also is NUL
4399 return !!symlink(buf
, path
);
4401 fd
= open(path
, O_CREAT
| O_EXCL
| O_WRONLY
, (mode
& 0100) ? 0777 : 0666);
4405 if (convert_to_working_tree(state
->repo
->index
, path
, buf
, size
, &nbuf
, NULL
)) {
4410 res
= write_in_full(fd
, buf
, size
) < 0;
4412 error_errno(_("failed to write to '%s'"), path
);
4413 strbuf_release(&nbuf
);
4415 if (close(fd
) < 0 && !res
)
4416 return error_errno(_("closing file '%s'"), path
);
4418 return res
? -1 : 0;
4422 * We optimistically assume that the directories exist,
4423 * which is true 99% of the time anyway. If they don't,
4424 * we create them and try again.
4430 static int create_one_file(struct apply_state
*state
,
4442 * We already try to detect whether files are beyond a symlink in our
4443 * up-front checks. But in the case where symlinks are created by any
4444 * of the intermediate hunks it can happen that our up-front checks
4445 * didn't yet see the symlink, but at the point of arriving here there
4446 * in fact is one. We thus repeat the check for symlinks here.
4448 * Note that this does not make the up-front check obsolete as the
4449 * failure mode is different:
4451 * - The up-front checks cause us to abort before we have written
4452 * anything into the working directory. So when we exit this way the
4453 * working directory remains clean.
4455 * - The checks here happen in the middle of the action where we have
4456 * already started to apply the patch. The end result will be a dirty
4457 * working directory.
4459 * Ideally, we should update the up-front checks to catch what would
4460 * happen when we apply the patch before we damage the working tree.
4461 * We have all the information necessary to do so. But for now, as a
4462 * part of embargoed security work, having this check would serve as a
4463 * reasonable first step.
4465 if (path_is_beyond_symlink(state
, path
))
4466 return error(_("affected file '%s' is beyond a symbolic link"), path
);
4468 res
= try_create_file(state
, path
, mode
, buf
, size
);
4474 if (errno
== ENOENT
) {
4475 if (safe_create_leading_directories_no_share(path
))
4477 res
= try_create_file(state
, path
, mode
, buf
, size
);
4484 if (errno
== EEXIST
|| errno
== EACCES
) {
4485 /* We may be trying to create a file where a directory
4489 if (!lstat(path
, &st
) && (!S_ISDIR(st
.st_mode
) || !rmdir(path
)))
4493 if (errno
== EEXIST
) {
4494 unsigned int nr
= getpid();
4497 char newpath
[PATH_MAX
];
4498 mksnpath(newpath
, sizeof(newpath
), "%s~%u", path
, nr
);
4499 res
= try_create_file(state
, newpath
, mode
, buf
, size
);
4503 if (!rename(newpath
, path
))
4505 unlink_or_warn(newpath
);
4508 if (errno
!= EEXIST
)
4513 return error_errno(_("unable to write file '%s' mode %o"),
4517 static int add_conflicted_stages_file(struct apply_state
*state
,
4518 struct patch
*patch
)
4522 struct cache_entry
*ce
;
4524 if (!state
->update_index
)
4526 namelen
= strlen(patch
->new_name
);
4527 mode
= patch
->new_mode
? patch
->new_mode
: (S_IFREG
| 0644);
4529 remove_file_from_index(state
->repo
->index
, patch
->new_name
);
4530 for (stage
= 1; stage
< 4; stage
++) {
4531 if (is_null_oid(&patch
->threeway_stage
[stage
- 1]))
4533 ce
= make_empty_cache_entry(state
->repo
->index
, namelen
);
4534 memcpy(ce
->name
, patch
->new_name
, namelen
);
4535 ce
->ce_mode
= create_ce_mode(mode
);
4536 ce
->ce_flags
= create_ce_flags(stage
);
4537 ce
->ce_namelen
= namelen
;
4538 oidcpy(&ce
->oid
, &patch
->threeway_stage
[stage
- 1]);
4539 if (add_index_entry(state
->repo
->index
, ce
, ADD_CACHE_OK_TO_ADD
) < 0) {
4540 discard_cache_entry(ce
);
4541 return error(_("unable to add cache entry for %s"),
4549 static int create_file(struct apply_state
*state
, struct patch
*patch
)
4551 char *path
= patch
->new_name
;
4552 unsigned mode
= patch
->new_mode
;
4553 unsigned long size
= patch
->resultsize
;
4554 char *buf
= patch
->result
;
4557 mode
= S_IFREG
| 0644;
4558 if (create_one_file(state
, path
, mode
, buf
, size
))
4561 if (patch
->conflicted_threeway
)
4562 return add_conflicted_stages_file(state
, patch
);
4563 else if (state
->update_index
)
4564 return add_index_file(state
, path
, mode
, buf
, size
);
4568 /* phase zero is to remove, phase one is to create */
4569 static int write_out_one_result(struct apply_state
*state
,
4570 struct patch
*patch
,
4573 if (patch
->is_delete
> 0) {
4575 return remove_file(state
, patch
, 1);
4578 if (patch
->is_new
> 0 || patch
->is_copy
) {
4580 return create_file(state
, patch
);
4584 * Rename or modification boils down to the same
4585 * thing: remove the old, write the new
4588 return remove_file(state
, patch
, patch
->is_rename
);
4590 return create_file(state
, patch
);
4594 static int write_out_one_reject(struct apply_state
*state
, struct patch
*patch
)
4597 char namebuf
[PATH_MAX
];
4598 struct fragment
*frag
;
4600 struct strbuf sb
= STRBUF_INIT
;
4602 for (cnt
= 0, frag
= patch
->fragments
; frag
; frag
= frag
->next
) {
4603 if (!frag
->rejected
)
4609 if (state
->apply_verbosity
> verbosity_normal
)
4610 say_patch_name(stderr
,
4611 _("Applied patch %s cleanly."), patch
);
4615 /* This should not happen, because a removal patch that leaves
4616 * contents are marked "rejected" at the patch level.
4618 if (!patch
->new_name
)
4619 die(_("internal error"));
4621 /* Say this even without --verbose */
4622 strbuf_addf(&sb
, Q_("Applying patch %%s with %d reject...",
4623 "Applying patch %%s with %d rejects...",
4626 if (state
->apply_verbosity
> verbosity_silent
)
4627 say_patch_name(stderr
, sb
.buf
, patch
);
4628 strbuf_release(&sb
);
4630 cnt
= strlen(patch
->new_name
);
4631 if (ARRAY_SIZE(namebuf
) <= cnt
+ 5) {
4632 cnt
= ARRAY_SIZE(namebuf
) - 5;
4633 warning(_("truncating .rej filename to %.*s.rej"),
4634 cnt
- 1, patch
->new_name
);
4636 memcpy(namebuf
, patch
->new_name
, cnt
);
4637 memcpy(namebuf
+ cnt
, ".rej", 5);
4639 fd
= open(namebuf
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666);
4641 if (errno
!= EEXIST
)
4642 return error_errno(_("cannot open %s"), namebuf
);
4643 if (unlink(namebuf
))
4644 return error_errno(_("cannot unlink '%s'"), namebuf
);
4645 fd
= open(namebuf
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666);
4647 return error_errno(_("cannot open %s"), namebuf
);
4649 rej
= fdopen(fd
, "w");
4651 return error_errno(_("cannot open %s"), namebuf
);
4653 /* Normal git tools never deal with .rej, so do not pretend
4654 * this is a git patch by saying --git or giving extended
4655 * headers. While at it, maybe please "kompare" that wants
4656 * the trailing TAB and some garbage at the end of line ;-).
4658 fprintf(rej
, "diff a/%s b/%s\t(rejected hunks)\n",
4659 patch
->new_name
, patch
->new_name
);
4660 for (cnt
= 1, frag
= patch
->fragments
;
4662 cnt
++, frag
= frag
->next
) {
4663 if (!frag
->rejected
) {
4664 if (state
->apply_verbosity
> verbosity_silent
)
4665 fprintf_ln(stderr
, _("Hunk #%d applied cleanly."), cnt
);
4668 if (state
->apply_verbosity
> verbosity_silent
)
4669 fprintf_ln(stderr
, _("Rejected hunk #%d."), cnt
);
4670 fprintf(rej
, "%.*s", frag
->size
, frag
->patch
);
4671 if (frag
->patch
[frag
->size
-1] != '\n')
4680 * -1 if an error happened
4681 * 0 if the patch applied cleanly
4682 * 1 if the patch did not apply cleanly
4684 static int write_out_results(struct apply_state
*state
, struct patch
*list
)
4689 struct string_list cpath
= STRING_LIST_INIT_DUP
;
4691 for (phase
= 0; phase
< 2; phase
++) {
4697 if (write_out_one_result(state
, l
, phase
)) {
4698 string_list_clear(&cpath
, 0);
4702 if (write_out_one_reject(state
, l
))
4704 if (l
->conflicted_threeway
) {
4705 string_list_append(&cpath
, l
->new_name
);
4715 struct string_list_item
*item
;
4717 string_list_sort(&cpath
);
4718 if (state
->apply_verbosity
> verbosity_silent
) {
4719 for_each_string_list_item(item
, &cpath
)
4720 fprintf(stderr
, "U %s\n", item
->string
);
4722 string_list_clear(&cpath
, 0);
4725 * rerere relies on the partially merged result being in the working
4726 * tree with conflict markers, but that isn't written with --cached.
4729 repo_rerere(state
->repo
, 0);
4736 * Try to apply a patch.
4739 * -128 if a bad error happened (like patch unreadable)
4740 * -1 if patch did not apply and user cannot deal with it
4741 * 0 if the patch applied
4742 * 1 if the patch did not apply but user might fix it
4744 static int apply_patch(struct apply_state
*state
,
4746 const char *filename
,
4750 struct strbuf buf
= STRBUF_INIT
; /* owns the patch text */
4751 struct patch
*list
= NULL
, **listp
= &list
;
4752 int skipped_patch
= 0;
4754 int flush_attributes
= 0;
4756 state
->patch_input_file
= filename
;
4757 if (read_patch_file(&buf
, fd
) < 0)
4760 while (offset
< buf
.len
) {
4761 struct patch
*patch
;
4764 CALLOC_ARRAY(patch
, 1);
4765 patch
->inaccurate_eof
= !!(options
& APPLY_OPT_INACCURATE_EOF
);
4766 patch
->recount
= !!(options
& APPLY_OPT_RECOUNT
);
4767 nr
= parse_chunk(state
, buf
.buf
+ offset
, buf
.len
- offset
, patch
);
4776 if (state
->apply_in_reverse
)
4777 reverse_patches(patch
);
4778 if (use_patch(state
, patch
)) {
4779 patch_stats(state
, patch
);
4780 if (!list
|| !state
->apply_in_reverse
) {
4782 listp
= &patch
->next
;
4788 if ((patch
->new_name
&&
4789 ends_with_path_components(patch
->new_name
,
4790 GITATTRIBUTES_FILE
)) ||
4792 ends_with_path_components(patch
->old_name
,
4793 GITATTRIBUTES_FILE
)))
4794 flush_attributes
= 1;
4797 if (state
->apply_verbosity
> verbosity_normal
)
4798 say_patch_name(stderr
, _("Skipped patch '%s'."), patch
);
4805 if (!list
&& !skipped_patch
) {
4806 if (!state
->allow_empty
) {
4807 error(_("No valid patches in input (allow with \"--allow-empty\")"));
4813 if (state
->whitespace_error
&& (state
->ws_error_action
== die_on_ws_error
))
4816 state
->update_index
= (state
->check_index
|| state
->ita_only
) && state
->apply
;
4817 if (state
->update_index
&& !is_lock_file_locked(&state
->lock_file
)) {
4818 if (state
->index_file
)
4819 hold_lock_file_for_update(&state
->lock_file
,
4823 repo_hold_locked_index(state
->repo
, &state
->lock_file
,
4827 if (state
->check_index
&& read_apply_cache(state
) < 0) {
4828 error(_("unable to read index file"));
4833 if (state
->check
|| state
->apply
) {
4834 int r
= check_patch_list(state
, list
);
4839 if (r
< 0 && !state
->apply_with_reject
) {
4846 int write_res
= write_out_results(state
, list
);
4847 if (write_res
< 0) {
4851 if (write_res
> 0) {
4852 /* with --3way, we still need to write the index out */
4853 res
= state
->apply_with_reject
? -1 : 1;
4858 if (state
->fake_ancestor
&&
4859 build_fake_ancestor(state
, list
)) {
4864 if (state
->diffstat
&& state
->apply_verbosity
> verbosity_silent
)
4865 stat_patch_list(state
, list
);
4867 if (state
->numstat
&& state
->apply_verbosity
> verbosity_silent
)
4868 numstat_patch_list(state
, list
);
4870 if (state
->summary
&& state
->apply_verbosity
> verbosity_silent
)
4871 summary_patch_list(list
);
4873 if (flush_attributes
)
4874 reset_parsed_attributes();
4876 free_patch_list(list
);
4877 strbuf_release(&buf
);
4878 string_list_clear(&state
->fn_table
, 0);
4882 static int apply_option_parse_exclude(const struct option
*opt
,
4883 const char *arg
, int unset
)
4885 struct apply_state
*state
= opt
->value
;
4887 BUG_ON_OPT_NEG(unset
);
4889 add_name_limit(state
, arg
, 1);
4893 static int apply_option_parse_include(const struct option
*opt
,
4894 const char *arg
, int unset
)
4896 struct apply_state
*state
= opt
->value
;
4898 BUG_ON_OPT_NEG(unset
);
4900 add_name_limit(state
, arg
, 0);
4901 state
->has_include
= 1;
4905 static int apply_option_parse_p(const struct option
*opt
,
4909 struct apply_state
*state
= opt
->value
;
4911 BUG_ON_OPT_NEG(unset
);
4913 state
->p_value
= atoi(arg
);
4914 state
->p_value_known
= 1;
4918 static int apply_option_parse_space_change(const struct option
*opt
,
4919 const char *arg
, int unset
)
4921 struct apply_state
*state
= opt
->value
;
4923 BUG_ON_OPT_ARG(arg
);
4926 state
->ws_ignore_action
= ignore_ws_none
;
4928 state
->ws_ignore_action
= ignore_ws_change
;
4932 static int apply_option_parse_whitespace(const struct option
*opt
,
4933 const char *arg
, int unset
)
4935 struct apply_state
*state
= opt
->value
;
4937 BUG_ON_OPT_NEG(unset
);
4939 state
->whitespace_option
= arg
;
4940 if (parse_whitespace_option(state
, arg
))
4945 static int apply_option_parse_directory(const struct option
*opt
,
4946 const char *arg
, int unset
)
4948 struct apply_state
*state
= opt
->value
;
4950 BUG_ON_OPT_NEG(unset
);
4952 strbuf_reset(&state
->root
);
4953 strbuf_addstr(&state
->root
, arg
);
4954 strbuf_complete(&state
->root
, '/');
4958 int apply_all_patches(struct apply_state
*state
,
4968 for (i
= 0; i
< argc
; i
++) {
4969 const char *arg
= argv
[i
];
4970 char *to_free
= NULL
;
4973 if (!strcmp(arg
, "-")) {
4974 res
= apply_patch(state
, 0, "<stdin>", options
);
4981 arg
= to_free
= prefix_filename(state
->prefix
, arg
);
4983 fd
= open(arg
, O_RDONLY
);
4985 error(_("can't open patch '%s': %s"), arg
, strerror(errno
));
4991 set_default_whitespace_mode(state
);
4992 res
= apply_patch(state
, fd
, arg
, options
);
4999 set_default_whitespace_mode(state
);
5001 res
= apply_patch(state
, 0, "<stdin>", options
);
5007 if (state
->whitespace_error
) {
5008 if (state
->squelch_whitespace_errors
&&
5009 state
->squelch_whitespace_errors
< state
->whitespace_error
) {
5011 state
->whitespace_error
- state
->squelch_whitespace_errors
;
5012 warning(Q_("squelched %d whitespace error",
5013 "squelched %d whitespace errors",
5017 if (state
->ws_error_action
== die_on_ws_error
) {
5018 error(Q_("%d line adds whitespace errors.",
5019 "%d lines add whitespace errors.",
5020 state
->whitespace_error
),
5021 state
->whitespace_error
);
5025 if (state
->applied_after_fixing_ws
&& state
->apply
)
5026 warning(Q_("%d line applied after"
5027 " fixing whitespace errors.",
5028 "%d lines applied after"
5029 " fixing whitespace errors.",
5030 state
->applied_after_fixing_ws
),
5031 state
->applied_after_fixing_ws
);
5032 else if (state
->whitespace_error
)
5033 warning(Q_("%d line adds whitespace errors.",
5034 "%d lines add whitespace errors.",
5035 state
->whitespace_error
),
5036 state
->whitespace_error
);
5039 if (state
->update_index
) {
5040 res
= write_locked_index(state
->repo
->index
, &state
->lock_file
, COMMIT_LOCK
);
5042 error(_("Unable to write new index file"));
5051 rollback_lock_file(&state
->lock_file
);
5053 if (state
->apply_verbosity
<= verbosity_silent
) {
5054 set_error_routine(state
->saved_error_routine
);
5055 set_warn_routine(state
->saved_warn_routine
);
5060 return (res
== -1 ? 1 : 128);
5063 int apply_parse_options(int argc
, const char **argv
,
5064 struct apply_state
*state
,
5065 int *force_apply
, int *options
,
5066 const char * const *apply_usage
)
5068 struct option builtin_apply_options
[] = {
5069 OPT_CALLBACK_F(0, "exclude", state
, N_("path"),
5070 N_("don't apply changes matching the given path"),
5071 PARSE_OPT_NONEG
, apply_option_parse_exclude
),
5072 OPT_CALLBACK_F(0, "include", state
, N_("path"),
5073 N_("apply changes matching the given path"),
5074 PARSE_OPT_NONEG
, apply_option_parse_include
),
5075 OPT_CALLBACK('p', NULL
, state
, N_("num"),
5076 N_("remove <num> leading slashes from traditional diff paths"),
5077 apply_option_parse_p
),
5078 OPT_BOOL(0, "no-add", &state
->no_add
,
5079 N_("ignore additions made by the patch")),
5080 OPT_BOOL(0, "stat", &state
->diffstat
,
5081 N_("instead of applying the patch, output diffstat for the input")),
5082 OPT_NOOP_NOARG(0, "allow-binary-replacement"),
5083 OPT_NOOP_NOARG(0, "binary"),
5084 OPT_BOOL(0, "numstat", &state
->numstat
,
5085 N_("show number of added and deleted lines in decimal notation")),
5086 OPT_BOOL(0, "summary", &state
->summary
,
5087 N_("instead of applying the patch, output a summary for the input")),
5088 OPT_BOOL(0, "check", &state
->check
,
5089 N_("instead of applying the patch, see if the patch is applicable")),
5090 OPT_BOOL(0, "index", &state
->check_index
,
5091 N_("make sure the patch is applicable to the current index")),
5092 OPT_BOOL('N', "intent-to-add", &state
->ita_only
,
5093 N_("mark new files with `git add --intent-to-add`")),
5094 OPT_BOOL(0, "cached", &state
->cached
,
5095 N_("apply a patch without touching the working tree")),
5096 OPT_BOOL_F(0, "unsafe-paths", &state
->unsafe_paths
,
5097 N_("accept a patch that touches outside the working area"),
5098 PARSE_OPT_NOCOMPLETE
),
5099 OPT_BOOL(0, "apply", force_apply
,
5100 N_("also apply the patch (use with --stat/--summary/--check)")),
5101 OPT_BOOL('3', "3way", &state
->threeway
,
5102 N_( "attempt three-way merge, fall back on normal patch if that fails")),
5103 OPT_FILENAME(0, "build-fake-ancestor", &state
->fake_ancestor
,
5104 N_("build a temporary index based on embedded index information")),
5105 /* Think twice before adding "--nul" synonym to this */
5106 OPT_SET_INT('z', NULL
, &state
->line_termination
,
5107 N_("paths are separated with NUL character"), '\0'),
5108 OPT_INTEGER('C', NULL
, &state
->p_context
,
5109 N_("ensure at least <n> lines of context match")),
5110 OPT_CALLBACK(0, "whitespace", state
, N_("action"),
5111 N_("detect new or modified lines that have whitespace errors"),
5112 apply_option_parse_whitespace
),
5113 OPT_CALLBACK_F(0, "ignore-space-change", state
, NULL
,
5114 N_("ignore changes in whitespace when finding context"),
5115 PARSE_OPT_NOARG
, apply_option_parse_space_change
),
5116 OPT_CALLBACK_F(0, "ignore-whitespace", state
, NULL
,
5117 N_("ignore changes in whitespace when finding context"),
5118 PARSE_OPT_NOARG
, apply_option_parse_space_change
),
5119 OPT_BOOL('R', "reverse", &state
->apply_in_reverse
,
5120 N_("apply the patch in reverse")),
5121 OPT_BOOL(0, "unidiff-zero", &state
->unidiff_zero
,
5122 N_("don't expect at least one line of context")),
5123 OPT_BOOL(0, "reject", &state
->apply_with_reject
,
5124 N_("leave the rejected hunks in corresponding *.rej files")),
5125 OPT_BOOL(0, "allow-overlap", &state
->allow_overlap
,
5126 N_("allow overlapping hunks")),
5127 OPT__VERBOSITY(&state
->apply_verbosity
),
5128 OPT_BIT(0, "inaccurate-eof", options
,
5129 N_("tolerate incorrectly detected missing new-line at the end of file"),
5130 APPLY_OPT_INACCURATE_EOF
),
5131 OPT_BIT(0, "recount", options
,
5132 N_("do not trust the line counts in the hunk headers"),
5134 OPT_CALLBACK(0, "directory", state
, N_("root"),
5135 N_("prepend <root> to all filenames"),
5136 apply_option_parse_directory
),
5137 OPT_BOOL(0, "allow-empty", &state
->allow_empty
,
5138 N_("don't return error for empty patches")),
5142 return parse_options(argc
, argv
, state
->prefix
, builtin_apply_options
, apply_usage
, 0);