1/* 2 * apply.c 3 * 4 * Copyright (C) Linus Torvalds, 2005 5 * 6 * This applies patches on top of some (arbitrary) version of the SCM. 7 * 8 */ 9 10#include "cache.h" 11#include "config.h" 12#include "object-store.h" 13#include "blob.h" 14#include "delta.h" 15#include "diff.h" 16#include "dir.h" 17#include "xdiff-interface.h" 18#include "ll-merge.h" 19#include "lockfile.h" 20#include "parse-options.h" 21#include "quote.h" 22#include "rerere.h" 23#include "apply.h" 24 25static void git_apply_config(void) 26{ 27 git_config_get_string_const("apply.whitespace", &apply_default_whitespace); 28 git_config_get_string_const("apply.ignorewhitespace", &apply_default_ignorewhitespace); 29 git_config(git_default_config, NULL); 30} 31 32static int parse_whitespace_option(struct apply_state *state, const char *option) 33{ 34 if (!option) { 35 state->ws_error_action = warn_on_ws_error; 36 return 0; 37 } 38 if (!strcmp(option, "warn")) { 39 state->ws_error_action = warn_on_ws_error; 40 return 0; 41 } 42 if (!strcmp(option, "nowarn")) { 43 state->ws_error_action = nowarn_ws_error; 44 return 0; 45 } 46 if (!strcmp(option, "error")) { 47 state->ws_error_action = die_on_ws_error; 48 return 0; 49 } 50 if (!strcmp(option, "error-all")) { 51 state->ws_error_action = die_on_ws_error; 52 state->squelch_whitespace_errors = 0; 53 return 0; 54 } 55 if (!strcmp(option, "strip") || !strcmp(option, "fix")) { 56 state->ws_error_action = correct_ws_error; 57 return 0; 58 } 59 return error(_("unrecognized whitespace option '%s'"), option); 60} 61 62static int parse_ignorewhitespace_option(struct apply_state *state, 63 const char *option) 64{ 65 if (!option || !strcmp(option, "no") || 66 !strcmp(option, "false") || !strcmp(option, "never") || 67 !strcmp(option, "none")) { 68 state->ws_ignore_action = ignore_ws_none; 69 return 0; 70 } 71 if (!strcmp(option, "change")) { 72 state->ws_ignore_action = ignore_ws_change; 73 return 0; 74 } 75 return error(_("unrecognized whitespace ignore option '%s'"), option); 76} 77 78int init_apply_state(struct apply_state *state, 79 struct repository *repo, 80 const char *prefix) 81{ 82 memset(state, 0, sizeof(*state)); 83 state->prefix = prefix; 84 state->repo = repo; 85 state->apply = 1; 86 state->line_termination = '\n'; 87 state->p_value = 1; 88 state->p_context = UINT_MAX; 89 state->squelch_whitespace_errors = 5; 90 state->ws_error_action = warn_on_ws_error; 91 state->ws_ignore_action = ignore_ws_none; 92 state->linenr = 1; 93 string_list_init(&state->fn_table, 0); 94 string_list_init(&state->limit_by_name, 0); 95 string_list_init(&state->symlink_changes, 0); 96 strbuf_init(&state->root, 0); 97 98 git_apply_config(); 99 if (apply_default_whitespace && parse_whitespace_option(state, apply_default_whitespace)) 100 return -1; 101 if (apply_default_ignorewhitespace && parse_ignorewhitespace_option(state, apply_default_ignorewhitespace)) 102 return -1; 103 return 0; 104} 105 106void clear_apply_state(struct apply_state *state) 107{ 108 string_list_clear(&state->limit_by_name, 0); 109 string_list_clear(&state->symlink_changes, 0); 110 strbuf_release(&state->root); 111 112 /* &state->fn_table is cleared at the end of apply_patch() */ 113} 114 115static void mute_routine(const char *msg, va_list params) 116{ 117 /* do nothing */ 118} 119 120int check_apply_state(struct apply_state *state, int force_apply) 121{ 122 int is_not_gitdir = !startup_info->have_repository; 123 124 if (state->apply_with_reject && state->threeway) 125 return error(_("--reject and --3way cannot be used together.")); 126 if (state->cached && state->threeway) 127 return error(_("--cached and --3way cannot be used together.")); 128 if (state->threeway) { 129 if (is_not_gitdir) 130 return error(_("--3way outside a repository")); 131 state->check_index = 1; 132 } 133 if (state->apply_with_reject) { 134 state->apply = 1; 135 if (state->apply_verbosity == verbosity_normal) 136 state->apply_verbosity = verbosity_verbose; 137 } 138 if (!force_apply && (state->diffstat || state->numstat || state->summary || state->check || state->fake_ancestor)) 139 state->apply = 0; 140 if (state->check_index && is_not_gitdir) 141 return error(_("--index outside a repository")); 142 if (state->cached) { 143 if (is_not_gitdir) 144 return error(_("--cached outside a repository")); 145 state->check_index = 1; 146 } 147 if (state->ita_only && (state->check_index || is_not_gitdir)) 148 state->ita_only = 0; 149 if (state->check_index) 150 state->unsafe_paths = 0; 151 152 if (state->apply_verbosity <= verbosity_silent) { 153 state->saved_error_routine = get_error_routine(); 154 state->saved_warn_routine = get_warn_routine(); 155 set_error_routine(mute_routine); 156 set_warn_routine(mute_routine); 157 } 158 159 return 0; 160} 161 162static void set_default_whitespace_mode(struct apply_state *state) 163{ 164 if (!state->whitespace_option && !apply_default_whitespace) 165 state->ws_error_action = (state->apply ? warn_on_ws_error : nowarn_ws_error); 166} 167 168/* 169 * This represents one "hunk" from a patch, starting with 170 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The 171 * patch text is pointed at by patch, and its byte length 172 * is stored in size. leading and trailing are the number 173 * of context lines. 174 */ 175struct fragment { 176 unsigned long leading, trailing; 177 unsigned long oldpos, oldlines; 178 unsigned long newpos, newlines; 179 /* 180 * 'patch' is usually borrowed from buf in apply_patch(), 181 * but some codepaths store an allocated buffer. 182 */ 183 const char *patch; 184 unsigned free_patch:1, 185 rejected:1; 186 int size; 187 int linenr; 188 struct fragment *next; 189}; 190 191/* 192 * When dealing with a binary patch, we reuse "leading" field 193 * to store the type of the binary hunk, either deflated "delta" 194 * or deflated "literal". 195 */ 196#define binary_patch_method leading 197#define BINARY_DELTA_DEFLATED 1 198#define BINARY_LITERAL_DEFLATED 2 199 200/* 201 * This represents a "patch" to a file, both metainfo changes 202 * such as creation/deletion, filemode and content changes represented 203 * as a series of fragments. 204 */ 205struct patch { 206 char *new_name, *old_name, *def_name; 207 unsigned int old_mode, new_mode; 208 int is_new, is_delete; /* -1 = unknown, 0 = false, 1 = true */ 209 int rejected; 210 unsigned ws_rule; 211 int lines_added, lines_deleted; 212 int score; 213 int extension_linenr; /* first line specifying delete/new/rename/copy */ 214 unsigned int is_toplevel_relative:1; 215 unsigned int inaccurate_eof:1; 216 unsigned int is_binary:1; 217 unsigned int is_copy:1; 218 unsigned int is_rename:1; 219 unsigned int recount:1; 220 unsigned int conflicted_threeway:1; 221 unsigned int direct_to_threeway:1; 222 unsigned int crlf_in_old:1; 223 struct fragment *fragments; 224 char *result; 225 size_t resultsize; 226 char old_oid_prefix[GIT_MAX_HEXSZ + 1]; 227 char new_oid_prefix[GIT_MAX_HEXSZ + 1]; 228 struct patch *next; 229 230 /* three-way fallback result */ 231 struct object_id threeway_stage[3]; 232}; 233 234static void free_fragment_list(struct fragment *list) 235{ 236 while (list) { 237 struct fragment *next = list->next; 238 if (list->free_patch) 239 free((char *)list->patch); 240 free(list); 241 list = next; 242 } 243} 244 245static void free_patch(struct patch *patch) 246{ 247 free_fragment_list(patch->fragments); 248 free(patch->def_name); 249 free(patch->old_name); 250 free(patch->new_name); 251 free(patch->result); 252 free(patch); 253} 254 255static void free_patch_list(struct patch *list) 256{ 257 while (list) { 258 struct patch *next = list->next; 259 free_patch(list); 260 list = next; 261 } 262} 263 264/* 265 * A line in a file, len-bytes long (includes the terminating LF, 266 * except for an incomplete line at the end if the file ends with 267 * one), and its contents hashes to 'hash'. 268 */ 269struct line { 270 size_t len; 271 unsigned hash : 24; 272 unsigned flag : 8; 273#define LINE_COMMON 1 274#define LINE_PATCHED 2 275}; 276 277/* 278 * This represents a "file", which is an array of "lines". 279 */ 280struct image { 281 char *buf; 282 size_t len; 283 size_t nr; 284 size_t alloc; 285 struct line *line_allocated; 286 struct line *line; 287}; 288 289static uint32_t hash_line(const char *cp, size_t len) 290{ 291 size_t i; 292 uint32_t h; 293 for (i = 0, h = 0; i < len; i++) { 294 if (!isspace(cp[i])) { 295 h = h * 3 + (cp[i] & 0xff); 296 } 297 } 298 return h; 299} 300 301/* 302 * Compare lines s1 of length n1 and s2 of length n2, ignoring 303 * whitespace difference. Returns 1 if they match, 0 otherwise 304 */ 305static int fuzzy_matchlines(const char *s1, size_t n1, 306 const char *s2, size_t n2) 307{ 308 const char *end1 = s1 + n1; 309 const char *end2 = s2 + n2; 310 311 /* ignore line endings */ 312 while (s1 < end1 && (end1[-1] == '\r' || end1[-1] == '\n')) 313 end1--; 314 while (s2 < end2 && (end2[-1] == '\r' || end2[-1] == '\n')) 315 end2--; 316 317 while (s1 < end1 && s2 < end2) { 318 if (isspace(*s1)) { 319 /* 320 * Skip whitespace. We check on both buffers 321 * because we don't want "a b" to match "ab". 322 */ 323 if (!isspace(*s2)) 324 return 0; 325 while (s1 < end1 && isspace(*s1)) 326 s1++; 327 while (s2 < end2 && isspace(*s2)) 328 s2++; 329 } else if (*s1++ != *s2++) 330 return 0; 331 } 332 333 /* If we reached the end on one side only, lines don't match. */ 334 return s1 == end1 && s2 == end2; 335} 336 337static void add_line_info(struct image *img, const char *bol, size_t len, unsigned flag) 338{ 339 ALLOC_GROW(img->line_allocated, img->nr + 1, img->alloc); 340 img->line_allocated[img->nr].len = len; 341 img->line_allocated[img->nr].hash = hash_line(bol, len); 342 img->line_allocated[img->nr].flag = flag; 343 img->nr++; 344} 345 346/* 347 * "buf" has the file contents to be patched (read from various sources). 348 * attach it to "image" and add line-based index to it. 349 * "image" now owns the "buf". 350 */ 351static void prepare_image(struct image *image, char *buf, size_t len, 352 int prepare_linetable) 353{ 354 const char *cp, *ep; 355 356 memset(image, 0, sizeof(*image)); 357 image->buf = buf; 358 image->len = len; 359 360 if (!prepare_linetable) 361 return; 362 363 ep = image->buf + image->len; 364 cp = image->buf; 365 while (cp < ep) { 366 const char *next; 367 for (next = cp; next < ep && *next != '\n'; next++) 368 ; 369 if (next < ep) 370 next++; 371 add_line_info(image, cp, next - cp, 0); 372 cp = next; 373 } 374 image->line = image->line_allocated; 375} 376 377static void clear_image(struct image *image) 378{ 379 free(image->buf); 380 free(image->line_allocated); 381 memset(image, 0, sizeof(*image)); 382} 383 384/* fmt must contain _one_ %s and no other substitution */ 385static void say_patch_name(FILE *output, const char *fmt, struct patch *patch) 386{ 387 struct strbuf sb = STRBUF_INIT; 388 389 if (patch->old_name && patch->new_name && 390 strcmp(patch->old_name, patch->new_name)) { 391 quote_c_style(patch->old_name, &sb, NULL, 0); 392 strbuf_addstr(&sb, " => "); 393 quote_c_style(patch->new_name, &sb, NULL, 0); 394 } else { 395 const char *n = patch->new_name; 396 if (!n) 397 n = patch->old_name; 398 quote_c_style(n, &sb, NULL, 0); 399 } 400 fprintf(output, fmt, sb.buf); 401 fputc('\n', output); 402 strbuf_release(&sb); 403} 404 405#define SLOP (16) 406 407static int read_patch_file(struct strbuf *sb, int fd) 408{ 409 if (strbuf_read(sb, fd, 0) < 0) 410 return error_errno("git apply: failed to read"); 411 412 /* 413 * Make sure that we have some slop in the buffer 414 * so that we can do speculative "memcmp" etc, and 415 * see to it that it is NUL-filled. 416 */ 417 strbuf_grow(sb, SLOP); 418 memset(sb->buf + sb->len, 0, SLOP); 419 return 0; 420} 421 422static unsigned long linelen(const char *buffer, unsigned long size) 423{ 424 unsigned long len = 0; 425 while (size--) { 426 len++; 427 if (*buffer++ == '\n') 428 break; 429 } 430 return len; 431} 432 433static int is_dev_null(const char *str) 434{ 435 return skip_prefix(str, "/dev/null", &str) && isspace(*str); 436} 437 438#define TERM_SPACE 1 439#define TERM_TAB 2 440 441static int name_terminate(int c, int terminate) 442{ 443 if (c == ' ' && !(terminate & TERM_SPACE)) 444 return 0; 445 if (c == '\t' && !(terminate & TERM_TAB)) 446 return 0; 447 448 return 1; 449} 450 451/* remove double slashes to make --index work with such filenames */ 452static char *squash_slash(char *name) 453{ 454 int i = 0, j = 0; 455 456 if (!name) 457 return NULL; 458 459 while (name[i]) { 460 if ((name[j++] = name[i++]) == '/') 461 while (name[i] == '/') 462 i++; 463 } 464 name[j] = '\0'; 465 return name; 466} 467 468static char *find_name_gnu(struct apply_state *state, 469 const char *line, 470 const char *def, 471 int p_value) 472{ 473 struct strbuf name = STRBUF_INIT; 474 char *cp; 475 476 /* 477 * Proposed "new-style" GNU patch/diff format; see 478 * http://marc.info/?l=git&m=112927316408690&w=2 479 */ 480 if (unquote_c_style(&name, line, NULL)) { 481 strbuf_release(&name); 482 return NULL; 483 } 484 485 for (cp = name.buf; p_value; p_value--) { 486 cp = strchr(cp, '/'); 487 if (!cp) { 488 strbuf_release(&name); 489 return NULL; 490 } 491 cp++; 492 } 493 494 strbuf_remove(&name, 0, cp - name.buf); 495 if (state->root.len) 496 strbuf_insert(&name, 0, state->root.buf, state->root.len); 497 return squash_slash(strbuf_detach(&name, NULL)); 498} 499 500static size_t sane_tz_len(const char *line, size_t len) 501{ 502 const char *tz, *p; 503 504 if (len < strlen(" +0500") || line[len-strlen(" +0500")] != ' ') 505 return 0; 506 tz = line + len - strlen(" +0500"); 507 508 if (tz[1] != '+' && tz[1] != '-') 509 return 0; 510 511 for (p = tz + 2; p != line + len; p++) 512 if (!isdigit(*p)) 513 return 0; 514 515 return line + len - tz; 516} 517 518static size_t tz_with_colon_len(const char *line, size_t len) 519{ 520 const char *tz, *p; 521 522 if (len < strlen(" +08:00") || line[len - strlen(":00")] != ':') 523 return 0; 524 tz = line + len - strlen(" +08:00"); 525 526 if (tz[0] != ' ' || (tz[1] != '+' && tz[1] != '-')) 527 return 0; 528 p = tz + 2; 529 if (!isdigit(*p++) || !isdigit(*p++) || *p++ != ':' || 530 !isdigit(*p++) || !isdigit(*p++)) 531 return 0; 532 533 return line + len - tz; 534} 535 536static size_t date_len(const char *line, size_t len) 537{ 538 const char *date, *p; 539 540 if (len < strlen("72-02-05") || line[len-strlen("-05")] != '-') 541 return 0; 542 p = date = line + len - strlen("72-02-05"); 543 544 if (!isdigit(*p++) || !isdigit(*p++) || *p++ != '-' || 545 !isdigit(*p++) || !isdigit(*p++) || *p++ != '-' || 546 !isdigit(*p++) || !isdigit(*p++)) /* Not a date. */ 547 return 0; 548 549 if (date - line >= strlen("19") && 550 isdigit(date[-1]) && isdigit(date[-2])) /* 4-digit year */ 551 date -= strlen("19"); 552 553 return line + len - date; 554} 555 556static size_t short_time_len(const char *line, size_t len) 557{ 558 const char *time, *p; 559 560 if (len < strlen(" 07:01:32") || line[len-strlen(":32")] != ':') 561 return 0; 562 p = time = line + len - strlen(" 07:01:32"); 563 564 /* Permit 1-digit hours? */ 565 if (*p++ != ' ' || 566 !isdigit(*p++) || !isdigit(*p++) || *p++ != ':' || 567 !isdigit(*p++) || !isdigit(*p++) || *p++ != ':' || 568 !isdigit(*p++) || !isdigit(*p++)) /* Not a time. */ 569 return 0; 570 571 return line + len - time; 572} 573 574static size_t fractional_time_len(const char *line, size_t len) 575{ 576 const char *p; 577 size_t n; 578 579 /* Expected format: 19:41:17.620000023 */ 580 if (!len || !isdigit(line[len - 1])) 581 return 0; 582 p = line + len - 1; 583 584 /* Fractional seconds. */ 585 while (p > line && isdigit(*p)) 586 p--; 587 if (*p != '.') 588 return 0; 589 590 /* Hours, minutes, and whole seconds. */ 591 n = short_time_len(line, p - line); 592 if (!n) 593 return 0; 594 595 return line + len - p + n; 596} 597 598static size_t trailing_spaces_len(const char *line, size_t len) 599{ 600 const char *p; 601 602 /* Expected format: ' ' x (1 or more) */ 603 if (!len || line[len - 1] != ' ') 604 return 0; 605 606 p = line + len; 607 while (p != line) { 608 p--; 609 if (*p != ' ') 610 return line + len - (p + 1); 611 } 612 613 /* All spaces! */ 614 return len; 615} 616 617static size_t diff_timestamp_len(const char *line, size_t len) 618{ 619 const char *end = line + len; 620 size_t n; 621 622 /* 623 * Posix: 2010-07-05 19:41:17 624 * GNU: 2010-07-05 19:41:17.620000023 -0500 625 */ 626 627 if (!isdigit(end[-1])) 628 return 0; 629 630 n = sane_tz_len(line, end - line); 631 if (!n) 632 n = tz_with_colon_len(line, end - line); 633 end -= n; 634 635 n = short_time_len(line, end - line); 636 if (!n) 637 n = fractional_time_len(line, end - line); 638 end -= n; 639 640 n = date_len(line, end - line); 641 if (!n) /* No date. Too bad. */ 642 return 0; 643 end -= n; 644 645 if (end == line) /* No space before date. */ 646 return 0; 647 if (end[-1] == '\t') { /* Success! */ 648 end--; 649 return line + len - end; 650 } 651 if (end[-1] != ' ') /* No space before date. */ 652 return 0; 653 654 /* Whitespace damage. */ 655 end -= trailing_spaces_len(line, end - line); 656 return line + len - end; 657} 658 659static char *find_name_common(struct apply_state *state, 660 const char *line, 661 const char *def, 662 int p_value, 663 const char *end, 664 int terminate) 665{ 666 int len; 667 const char *start = NULL; 668 669 if (p_value == 0) 670 start = line; 671 while (line != end) { 672 char c = *line; 673 674 if (!end && isspace(c)) { 675 if (c == '\n') 676 break; 677 if (name_terminate(c, terminate)) 678 break; 679 } 680 line++; 681 if (c == '/' && !--p_value) 682 start = line; 683 } 684 if (!start) 685 return squash_slash(xstrdup_or_null(def)); 686 len = line - start; 687 if (!len) 688 return squash_slash(xstrdup_or_null(def)); 689 690 /* 691 * Generally we prefer the shorter name, especially 692 * if the other one is just a variation of that with 693 * something else tacked on to the end (ie "file.orig" 694 * or "file~"). 695 */ 696 if (def) { 697 int deflen = strlen(def); 698 if (deflen < len && !strncmp(start, def, deflen)) 699 return squash_slash(xstrdup(def)); 700 } 701 702 if (state->root.len) { 703 char *ret = xstrfmt("%s%.*s", state->root.buf, len, start); 704 return squash_slash(ret); 705 } 706 707 return squash_slash(xmemdupz(start, len)); 708} 709 710static char *find_name(struct apply_state *state, 711 const char *line, 712 char *def, 713 int p_value, 714 int terminate) 715{ 716 if (*line == '"') { 717 char *name = find_name_gnu(state, line, def, p_value); 718 if (name) 719 return name; 720 } 721 722 return find_name_common(state, line, def, p_value, NULL, terminate); 723} 724 725static char *find_name_traditional(struct apply_state *state, 726 const char *line, 727 char *def, 728 int p_value) 729{ 730 size_t len; 731 size_t date_len; 732 733 if (*line == '"') { 734 char *name = find_name_gnu(state, line, def, p_value); 735 if (name) 736 return name; 737 } 738 739 len = strchrnul(line, '\n') - line; 740 date_len = diff_timestamp_len(line, len); 741 if (!date_len) 742 return find_name_common(state, line, def, p_value, NULL, TERM_TAB); 743 len -= date_len; 744 745 return find_name_common(state, line, def, p_value, line + len, 0); 746} 747 748/* 749 * Given the string after "--- " or "+++ ", guess the appropriate 750 * p_value for the given patch. 751 */ 752static int guess_p_value(struct apply_state *state, const char *nameline) 753{ 754 char *name, *cp; 755 int val = -1; 756 757 if (is_dev_null(nameline)) 758 return -1; 759 name = find_name_traditional(state, nameline, NULL, 0); 760 if (!name) 761 return -1; 762 cp = strchr(name, '/'); 763 if (!cp) 764 val = 0; 765 else if (state->prefix) { 766 /* 767 * Does it begin with "a/$our-prefix" and such? Then this is 768 * very likely to apply to our directory. 769 */ 770 if (starts_with(name, state->prefix)) 771 val = count_slashes(state->prefix); 772 else { 773 cp++; 774 if (starts_with(cp, state->prefix)) 775 val = count_slashes(state->prefix) + 1; 776 } 777 } 778 free(name); 779 return val; 780} 781 782/* 783 * Does the ---/+++ line have the POSIX timestamp after the last HT? 784 * GNU diff puts epoch there to signal a creation/deletion event. Is 785 * this such a timestamp? 786 */ 787static int has_epoch_timestamp(const char *nameline) 788{ 789 /* 790 * We are only interested in epoch timestamp; any non-zero 791 * fraction cannot be one, hence "(\.0+)?" in the regexp below. 792 * For the same reason, the date must be either 1969-12-31 or 793 * 1970-01-01, and the seconds part must be "00". 794 */ 795 const char stamp_regexp[] = 796 "^[0-2][0-9]:([0-5][0-9]):00(\\.0+)?" 797 " " 798 "([-+][0-2][0-9]:?[0-5][0-9])\n"; 799 const char *timestamp = NULL, *cp, *colon; 800 static regex_t *stamp; 801 regmatch_t m[10]; 802 int zoneoffset, epoch_hour, hour, minute; 803 int status; 804 805 for (cp = nameline; *cp != '\n'; cp++) { 806 if (*cp == '\t') 807 timestamp = cp + 1; 808 } 809 if (!timestamp) 810 return 0; 811 812 /* 813 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31 814 * (west of GMT) or 1970-01-01 (east of GMT) 815 */ 816 if (skip_prefix(timestamp, "1969-12-31 ", ×tamp)) 817 epoch_hour = 24; 818 else if (skip_prefix(timestamp, "1970-01-01 ", ×tamp)) 819 epoch_hour = 0; 820 else 821 return 0; 822 823 if (!stamp) { 824 stamp = xmalloc(sizeof(*stamp)); 825 if (regcomp(stamp, stamp_regexp, REG_EXTENDED)) { 826 warning(_("Cannot prepare timestamp regexp %s"), 827 stamp_regexp); 828 return 0; 829 } 830 } 831 832 status = regexec(stamp, timestamp, ARRAY_SIZE(m), m, 0); 833 if (status) { 834 if (status != REG_NOMATCH) 835 warning(_("regexec returned %d for input: %s"), 836 status, timestamp); 837 return 0; 838 } 839 840 hour = strtol(timestamp, NULL, 10); 841 minute = strtol(timestamp + m[1].rm_so, NULL, 10); 842 843 zoneoffset = strtol(timestamp + m[3].rm_so + 1, (char **) &colon, 10); 844 if (*colon == ':') 845 zoneoffset = zoneoffset * 60 + strtol(colon + 1, NULL, 10); 846 else 847 zoneoffset = (zoneoffset / 100) * 60 + (zoneoffset % 100); 848 if (timestamp[m[3].rm_so] == '-') 849 zoneoffset = -zoneoffset; 850 851 return hour * 60 + minute - zoneoffset == epoch_hour * 60; 852} 853 854/* 855 * Get the name etc info from the ---/+++ lines of a traditional patch header 856 * 857 * FIXME! The end-of-filename heuristics are kind of screwy. For existing 858 * files, we can happily check the index for a match, but for creating a 859 * new file we should try to match whatever "patch" does. I have no idea. 860 */ 861static int parse_traditional_patch(struct apply_state *state, 862 const char *first, 863 const char *second, 864 struct patch *patch) 865{ 866 char *name; 867 868 first += 4; /* skip "--- " */ 869 second += 4; /* skip "+++ " */ 870 if (!state->p_value_known) { 871 int p, q; 872 p = guess_p_value(state, first); 873 q = guess_p_value(state, second); 874 if (p < 0) p = q; 875 if (0 <= p && p == q) { 876 state->p_value = p; 877 state->p_value_known = 1; 878 } 879 } 880 if (is_dev_null(first)) { 881 patch->is_new = 1; 882 patch->is_delete = 0; 883 name = find_name_traditional(state, second, NULL, state->p_value); 884 patch->new_name = name; 885 } else if (is_dev_null(second)) { 886 patch->is_new = 0; 887 patch->is_delete = 1; 888 name = find_name_traditional(state, first, NULL, state->p_value); 889 patch->old_name = name; 890 } else { 891 char *first_name; 892 first_name = find_name_traditional(state, first, NULL, state->p_value); 893 name = find_name_traditional(state, second, first_name, state->p_value); 894 free(first_name); 895 if (has_epoch_timestamp(first)) { 896 patch->is_new = 1; 897 patch->is_delete = 0; 898 patch->new_name = name; 899 } else if (has_epoch_timestamp(second)) { 900 patch->is_new = 0; 901 patch->is_delete = 1; 902 patch->old_name = name; 903 } else { 904 patch->old_name = name; 905 patch->new_name = xstrdup_or_null(name); 906 } 907 } 908 if (!name) 909 return error(_("unable to find filename in patch at line %d"), state->linenr); 910 911 return 0; 912} 913 914static int gitdiff_hdrend(struct apply_state *state, 915 const char *line, 916 struct patch *patch) 917{ 918 return 1; 919} 920 921/* 922 * We're anal about diff header consistency, to make 923 * sure that we don't end up having strange ambiguous 924 * patches floating around. 925 * 926 * As a result, gitdiff_{old|new}name() will check 927 * their names against any previous information, just 928 * to make sure.. 929 */ 930#define DIFF_OLD_NAME 0 931#define DIFF_NEW_NAME 1 932 933static int gitdiff_verify_name(struct apply_state *state, 934 const char *line, 935 int isnull, 936 char **name, 937 int side) 938{ 939 if (!*name && !isnull) { 940 *name = find_name(state, line, NULL, state->p_value, TERM_TAB); 941 return 0; 942 } 943 944 if (*name) { 945 char *another; 946 if (isnull) 947 return error(_("git apply: bad git-diff - expected /dev/null, got %s on line %d"), 948 *name, state->linenr); 949 another = find_name(state, line, NULL, state->p_value, TERM_TAB); 950 if (!another || strcmp(another, *name)) { 951 free(another); 952 return error((side == DIFF_NEW_NAME) ? 953 _("git apply: bad git-diff - inconsistent new filename on line %d") : 954 _("git apply: bad git-diff - inconsistent old filename on line %d"), state->linenr); 955 } 956 free(another); 957 } else { 958 if (!is_dev_null(line)) 959 return error(_("git apply: bad git-diff - expected /dev/null on line %d"), state->linenr); 960 } 961 962 return 0; 963} 964 965static int gitdiff_oldname(struct apply_state *state, 966 const char *line, 967 struct patch *patch) 968{ 969 return gitdiff_verify_name(state, line, 970 patch->is_new, &patch->old_name, 971 DIFF_OLD_NAME); 972} 973 974static int gitdiff_newname(struct apply_state *state, 975 const char *line, 976 struct patch *patch) 977{ 978 return gitdiff_verify_name(state, line, 979 patch->is_delete, &patch->new_name, 980 DIFF_NEW_NAME); 981} 982 983static int parse_mode_line(const char *line, int linenr, unsigned int *mode) 984{ 985 char *end; 986 *mode = strtoul(line, &end, 8); 987 if (end == line || !isspace(*end)) 988 return error(_("invalid mode on line %d: %s"), linenr, line); 989 return 0; 990} 991 992static int gitdiff_oldmode(struct apply_state *state, 993 const char *line, 994 struct patch *patch) 995{ 996 return parse_mode_line(line, state->linenr, &patch->old_mode); 997} 998 999static int gitdiff_newmode(struct apply_state *state,1000 const char *line,1001 struct patch *patch)1002{1003 return parse_mode_line(line, state->linenr, &patch->new_mode);1004}10051006static int gitdiff_delete(struct apply_state *state,1007 const char *line,1008 struct patch *patch)1009{1010 patch->is_delete = 1;1011 free(patch->old_name);1012 patch->old_name = xstrdup_or_null(patch->def_name);1013 return gitdiff_oldmode(state, line, patch);1014}10151016static int gitdiff_newfile(struct apply_state *state,1017 const char *line,1018 struct patch *patch)1019{1020 patch->is_new = 1;1021 free(patch->new_name);1022 patch->new_name = xstrdup_or_null(patch->def_name);1023 return gitdiff_newmode(state, line, patch);1024}10251026static int gitdiff_copysrc(struct apply_state *state,1027 const char *line,1028 struct patch *patch)1029{1030 patch->is_copy = 1;1031 free(patch->old_name);1032 patch->old_name = find_name(state, line, NULL, state->p_value ? state->p_value - 1 : 0, 0);1033 return 0;1034}10351036static int gitdiff_copydst(struct apply_state *state,1037 const char *line,1038 struct patch *patch)1039{1040 patch->is_copy = 1;1041 free(patch->new_name);1042 patch->new_name = find_name(state, line, NULL, state->p_value ? state->p_value - 1 : 0, 0);1043 return 0;1044}10451046static int gitdiff_renamesrc(struct apply_state *state,1047 const char *line,1048 struct patch *patch)1049{1050 patch->is_rename = 1;1051 free(patch->old_name);1052 patch->old_name = find_name(state, line, NULL, state->p_value ? state->p_value - 1 : 0, 0);1053 return 0;1054}10551056static int gitdiff_renamedst(struct apply_state *state,1057 const char *line,1058 struct patch *patch)1059{1060 patch->is_rename = 1;1061 free(patch->new_name);1062 patch->new_name = find_name(state, line, NULL, state->p_value ? state->p_value - 1 : 0, 0);1063 return 0;1064}10651066static int gitdiff_similarity(struct apply_state *state,1067 const char *line,1068 struct patch *patch)1069{1070 unsigned long val = strtoul(line, NULL, 10);1071 if (val <= 100)1072 patch->score = val;1073 return 0;1074}10751076static int gitdiff_dissimilarity(struct apply_state *state,1077 const char *line,1078 struct patch *patch)1079{1080 unsigned long val = strtoul(line, NULL, 10);1081 if (val <= 100)1082 patch->score = val;1083 return 0;1084}10851086static int gitdiff_index(struct apply_state *state,1087 const char *line,1088 struct patch *patch)1089{1090 /*1091 * index line is N hexadecimal, "..", N hexadecimal,1092 * and optional space with octal mode.1093 */1094 const char *ptr, *eol;1095 int len;1096 const unsigned hexsz = the_hash_algo->hexsz;10971098 ptr = strchr(line, '.');1099 if (!ptr || ptr[1] != '.' || hexsz < ptr - line)1100 return 0;1101 len = ptr - line;1102 memcpy(patch->old_oid_prefix, line, len);1103 patch->old_oid_prefix[len] = 0;11041105 line = ptr + 2;1106 ptr = strchr(line, ' ');1107 eol = strchrnul(line, '\n');11081109 if (!ptr || eol < ptr)1110 ptr = eol;1111 len = ptr - line;11121113 if (hexsz < len)1114 return 0;1115 memcpy(patch->new_oid_prefix, line, len);1116 patch->new_oid_prefix[len] = 0;1117 if (*ptr == ' ')1118 return gitdiff_oldmode(state, ptr + 1, patch);1119 return 0;1120}11211122/*1123 * This is normal for a diff that doesn't change anything: we'll fall through1124 * into the next diff. Tell the parser to break out.1125 */1126static int gitdiff_unrecognized(struct apply_state *state,1127 const char *line,1128 struct patch *patch)1129{1130 return 1;1131}11321133/*1134 * Skip p_value leading components from "line"; as we do not accept1135 * absolute paths, return NULL in that case.1136 */1137static const char *skip_tree_prefix(struct apply_state *state,1138 const char *line,1139 int llen)1140{1141 int nslash;1142 int i;11431144 if (!state->p_value)1145 return (llen && line[0] == '/') ? NULL : line;11461147 nslash = state->p_value;1148 for (i = 0; i < llen; i++) {1149 int ch = line[i];1150 if (ch == '/' && --nslash <= 0)1151 return (i == 0) ? NULL : &line[i + 1];1152 }1153 return NULL;1154}11551156/*1157 * This is to extract the same name that appears on "diff --git"1158 * line. We do not find and return anything if it is a rename1159 * patch, and it is OK because we will find the name elsewhere.1160 * We need to reliably find name only when it is mode-change only,1161 * creation or deletion of an empty file. In any of these cases,1162 * both sides are the same name under a/ and b/ respectively.1163 */1164static char *git_header_name(struct apply_state *state,1165 const char *line,1166 int llen)1167{1168 const char *name;1169 const char *second = NULL;1170 size_t len, line_len;11711172 line += strlen("diff --git ");1173 llen -= strlen("diff --git ");11741175 if (*line == '"') {1176 const char *cp;1177 struct strbuf first = STRBUF_INIT;1178 struct strbuf sp = STRBUF_INIT;11791180 if (unquote_c_style(&first, line, &second))1181 goto free_and_fail1;11821183 /* strip the a/b prefix including trailing slash */1184 cp = skip_tree_prefix(state, first.buf, first.len);1185 if (!cp)1186 goto free_and_fail1;1187 strbuf_remove(&first, 0, cp - first.buf);11881189 /*1190 * second points at one past closing dq of name.1191 * find the second name.1192 */1193 while ((second < line + llen) && isspace(*second))1194 second++;11951196 if (line + llen <= second)1197 goto free_and_fail1;1198 if (*second == '"') {1199 if (unquote_c_style(&sp, second, NULL))1200 goto free_and_fail1;1201 cp = skip_tree_prefix(state, sp.buf, sp.len);1202 if (!cp)1203 goto free_and_fail1;1204 /* They must match, otherwise ignore */1205 if (strcmp(cp, first.buf))1206 goto free_and_fail1;1207 strbuf_release(&sp);1208 return strbuf_detach(&first, NULL);1209 }12101211 /* unquoted second */1212 cp = skip_tree_prefix(state, second, line + llen - second);1213 if (!cp)1214 goto free_and_fail1;1215 if (line + llen - cp != first.len ||1216 memcmp(first.buf, cp, first.len))1217 goto free_and_fail1;1218 return strbuf_detach(&first, NULL);12191220 free_and_fail1:1221 strbuf_release(&first);1222 strbuf_release(&sp);1223 return NULL;1224 }12251226 /* unquoted first name */1227 name = skip_tree_prefix(state, line, llen);1228 if (!name)1229 return NULL;12301231 /*1232 * since the first name is unquoted, a dq if exists must be1233 * the beginning of the second name.1234 */1235 for (second = name; second < line + llen; second++) {1236 if (*second == '"') {1237 struct strbuf sp = STRBUF_INIT;1238 const char *np;12391240 if (unquote_c_style(&sp, second, NULL))1241 goto free_and_fail2;12421243 np = skip_tree_prefix(state, sp.buf, sp.len);1244 if (!np)1245 goto free_and_fail2;12461247 len = sp.buf + sp.len - np;1248 if (len < second - name &&1249 !strncmp(np, name, len) &&1250 isspace(name[len])) {1251 /* Good */1252 strbuf_remove(&sp, 0, np - sp.buf);1253 return strbuf_detach(&sp, NULL);1254 }12551256 free_and_fail2:1257 strbuf_release(&sp);1258 return NULL;1259 }1260 }12611262 /*1263 * Accept a name only if it shows up twice, exactly the same1264 * form.1265 */1266 second = strchr(name, '\n');1267 if (!second)1268 return NULL;1269 line_len = second - name;1270 for (len = 0 ; ; len++) {1271 switch (name[len]) {1272 default:1273 continue;1274 case '\n':1275 return NULL;1276 case '\t': case ' ':1277 /*1278 * Is this the separator between the preimage1279 * and the postimage pathname? Again, we are1280 * only interested in the case where there is1281 * no rename, as this is only to set def_name1282 * and a rename patch has the names elsewhere1283 * in an unambiguous form.1284 */1285 if (!name[len + 1])1286 return NULL; /* no postimage name */1287 second = skip_tree_prefix(state, name + len + 1,1288 line_len - (len + 1));1289 if (!second)1290 return NULL;1291 /*1292 * Does len bytes starting at "name" and "second"1293 * (that are separated by one HT or SP we just1294 * found) exactly match?1295 */1296 if (second[len] == '\n' && !strncmp(name, second, len))1297 return xmemdupz(name, len);1298 }1299 }1300}13011302static int check_header_line(struct apply_state *state, struct patch *patch)1303{1304 int extensions = (patch->is_delete == 1) + (patch->is_new == 1) +1305 (patch->is_rename == 1) + (patch->is_copy == 1);1306 if (extensions > 1)1307 return error(_("inconsistent header lines %d and %d"),1308 patch->extension_linenr, state->linenr);1309 if (extensions && !patch->extension_linenr)1310 patch->extension_linenr = state->linenr;1311 return 0;1312}13131314/* Verify that we recognize the lines following a git header */1315static int parse_git_header(struct apply_state *state,1316 const char *line,1317 int len,1318 unsigned int size,1319 struct patch *patch)1320{1321 unsigned long offset;13221323 /* A git diff has explicit new/delete information, so we don't guess */1324 patch->is_new = 0;1325 patch->is_delete = 0;13261327 /*1328 * Some things may not have the old name in the1329 * rest of the headers anywhere (pure mode changes,1330 * or removing or adding empty files), so we get1331 * the default name from the header.1332 */1333 patch->def_name = git_header_name(state, line, len);1334 if (patch->def_name && state->root.len) {1335 char *s = xstrfmt("%s%s", state->root.buf, patch->def_name);1336 free(patch->def_name);1337 patch->def_name = s;1338 }13391340 line += len;1341 size -= len;1342 state->linenr++;1343 for (offset = len ; size > 0 ; offset += len, size -= len, line += len, state->linenr++) {1344 static const struct opentry {1345 const char *str;1346 int (*fn)(struct apply_state *, const char *, struct patch *);1347 } optable[] = {1348 { "@@ -", gitdiff_hdrend },1349 { "--- ", gitdiff_oldname },1350 { "+++ ", gitdiff_newname },1351 { "old mode ", gitdiff_oldmode },1352 { "new mode ", gitdiff_newmode },1353 { "deleted file mode ", gitdiff_delete },1354 { "new file mode ", gitdiff_newfile },1355 { "copy from ", gitdiff_copysrc },1356 { "copy to ", gitdiff_copydst },1357 { "rename old ", gitdiff_renamesrc },1358 { "rename new ", gitdiff_renamedst },1359 { "rename from ", gitdiff_renamesrc },1360 { "rename to ", gitdiff_renamedst },1361 { "similarity index ", gitdiff_similarity },1362 { "dissimilarity index ", gitdiff_dissimilarity },1363 { "index ", gitdiff_index },1364 { "", gitdiff_unrecognized },1365 };1366 int i;13671368 len = linelen(line, size);1369 if (!len || line[len-1] != '\n')1370 break;1371 for (i = 0; i < ARRAY_SIZE(optable); i++) {1372 const struct opentry *p = optable + i;1373 int oplen = strlen(p->str);1374 int res;1375 if (len < oplen || memcmp(p->str, line, oplen))1376 continue;1377 res = p->fn(state, line + oplen, patch);1378 if (res < 0)1379 return -1;1380 if (check_header_line(state, patch))1381 return -1;1382 if (res > 0)1383 return offset;1384 break;1385 }1386 }13871388 return offset;1389}13901391static int parse_num(const char *line, unsigned long *p)1392{1393 char *ptr;13941395 if (!isdigit(*line))1396 return 0;1397 *p = strtoul(line, &ptr, 10);1398 return ptr - line;1399}14001401static int parse_range(const char *line, int len, int offset, const char *expect,1402 unsigned long *p1, unsigned long *p2)1403{1404 int digits, ex;14051406 if (offset < 0 || offset >= len)1407 return -1;1408 line += offset;1409 len -= offset;14101411 digits = parse_num(line, p1);1412 if (!digits)1413 return -1;14141415 offset += digits;1416 line += digits;1417 len -= digits;14181419 *p2 = 1;1420 if (*line == ',') {1421 digits = parse_num(line+1, p2);1422 if (!digits)1423 return -1;14241425 offset += digits+1;1426 line += digits+1;1427 len -= digits+1;1428 }14291430 ex = strlen(expect);1431 if (ex > len)1432 return -1;1433 if (memcmp(line, expect, ex))1434 return -1;14351436 return offset + ex;1437}14381439static void recount_diff(const char *line, int size, struct fragment *fragment)1440{1441 int oldlines = 0, newlines = 0, ret = 0;14421443 if (size < 1) {1444 warning("recount: ignore empty hunk");1445 return;1446 }14471448 for (;;) {1449 int len = linelen(line, size);1450 size -= len;1451 line += len;14521453 if (size < 1)1454 break;14551456 switch (*line) {1457 case ' ': case '\n':1458 newlines++;1459 /* fall through */1460 case '-':1461 oldlines++;1462 continue;1463 case '+':1464 newlines++;1465 continue;1466 case '\\':1467 continue;1468 case '@':1469 ret = size < 3 || !starts_with(line, "@@ ");1470 break;1471 case 'd':1472 ret = size < 5 || !starts_with(line, "diff ");1473 break;1474 default:1475 ret = -1;1476 break;1477 }1478 if (ret) {1479 warning(_("recount: unexpected line: %.*s"),1480 (int)linelen(line, size), line);1481 return;1482 }1483 break;1484 }1485 fragment->oldlines = oldlines;1486 fragment->newlines = newlines;1487}14881489/*1490 * Parse a unified diff fragment header of the1491 * form "@@ -a,b +c,d @@"1492 */1493static int parse_fragment_header(const char *line, int len, struct fragment *fragment)1494{1495 int offset;14961497 if (!len || line[len-1] != '\n')1498 return -1;14991500 /* Figure out the number of lines in a fragment */1501 offset = parse_range(line, len, 4, " +", &fragment->oldpos, &fragment->oldlines);1502 offset = parse_range(line, len, offset, " @@", &fragment->newpos, &fragment->newlines);15031504 return offset;1505}15061507/*1508 * Find file diff header1509 *1510 * Returns:1511 * -1 if no header was found1512 * -128 in case of error1513 * the size of the header in bytes (called "offset") otherwise1514 */1515static int find_header(struct apply_state *state,1516 const char *line,1517 unsigned long size,1518 int *hdrsize,1519 struct patch *patch)1520{1521 unsigned long offset, len;15221523 patch->is_toplevel_relative = 0;1524 patch->is_rename = patch->is_copy = 0;1525 patch->is_new = patch->is_delete = -1;1526 patch->old_mode = patch->new_mode = 0;1527 patch->old_name = patch->new_name = NULL;1528 for (offset = 0; size > 0; offset += len, size -= len, line += len, state->linenr++) {1529 unsigned long nextlen;15301531 len = linelen(line, size);1532 if (!len)1533 break;15341535 /* Testing this early allows us to take a few shortcuts.. */1536 if (len < 6)1537 continue;15381539 /*1540 * Make sure we don't find any unconnected patch fragments.1541 * That's a sign that we didn't find a header, and that a1542 * patch has become corrupted/broken up.1543 */1544 if (!memcmp("@@ -", line, 4)) {1545 struct fragment dummy;1546 if (parse_fragment_header(line, len, &dummy) < 0)1547 continue;1548 error(_("patch fragment without header at line %d: %.*s"),1549 state->linenr, (int)len-1, line);1550 return -128;1551 }15521553 if (size < len + 6)1554 break;15551556 /*1557 * Git patch? It might not have a real patch, just a rename1558 * or mode change, so we handle that specially1559 */1560 if (!memcmp("diff --git ", line, 11)) {1561 int git_hdr_len = parse_git_header(state, line, len, size, patch);1562 if (git_hdr_len < 0)1563 return -128;1564 if (git_hdr_len <= len)1565 continue;1566 if (!patch->old_name && !patch->new_name) {1567 if (!patch->def_name) {1568 error(Q_("git diff header lacks filename information when removing "1569 "%d leading pathname component (line %d)",1570 "git diff header lacks filename information when removing "1571 "%d leading pathname components (line %d)",1572 state->p_value),1573 state->p_value, state->linenr);1574 return -128;1575 }1576 patch->old_name = xstrdup(patch->def_name);1577 patch->new_name = xstrdup(patch->def_name);1578 }1579 if ((!patch->new_name && !patch->is_delete) ||1580 (!patch->old_name && !patch->is_new)) {1581 error(_("git diff header lacks filename information "1582 "(line %d)"), state->linenr);1583 return -128;1584 }1585 patch->is_toplevel_relative = 1;1586 *hdrsize = git_hdr_len;1587 return offset;1588 }15891590 /* --- followed by +++ ? */1591 if (memcmp("--- ", line, 4) || memcmp("+++ ", line + len, 4))1592 continue;15931594 /*1595 * We only accept unified patches, so we want it to1596 * at least have "@@ -a,b +c,d @@\n", which is 14 chars1597 * minimum ("@@ -0,0 +1 @@\n" is the shortest).1598 */1599 nextlen = linelen(line + len, size - len);1600 if (size < nextlen + 14 || memcmp("@@ -", line + len + nextlen, 4))1601 continue;16021603 /* Ok, we'll consider it a patch */1604 if (parse_traditional_patch(state, line, line+len, patch))1605 return -128;1606 *hdrsize = len + nextlen;1607 state->linenr += 2;1608 return offset;1609 }1610 return -1;1611}16121613static void record_ws_error(struct apply_state *state,1614 unsigned result,1615 const char *line,1616 int len,1617 int linenr)1618{1619 char *err;16201621 if (!result)1622 return;16231624 state->whitespace_error++;1625 if (state->squelch_whitespace_errors &&1626 state->squelch_whitespace_errors < state->whitespace_error)1627 return;16281629 err = whitespace_error_string(result);1630 if (state->apply_verbosity > verbosity_silent)1631 fprintf(stderr, "%s:%d: %s.\n%.*s\n",1632 state->patch_input_file, linenr, err, len, line);1633 free(err);1634}16351636static void check_whitespace(struct apply_state *state,1637 const char *line,1638 int len,1639 unsigned ws_rule)1640{1641 unsigned result = ws_check(line + 1, len - 1, ws_rule);16421643 record_ws_error(state, result, line + 1, len - 2, state->linenr);1644}16451646/*1647 * Check if the patch has context lines with CRLF or1648 * the patch wants to remove lines with CRLF.1649 */1650static void check_old_for_crlf(struct patch *patch, const char *line, int len)1651{1652 if (len >= 2 && line[len-1] == '\n' && line[len-2] == '\r') {1653 patch->ws_rule |= WS_CR_AT_EOL;1654 patch->crlf_in_old = 1;1655 }1656}165716581659/*1660 * Parse a unified diff. Note that this really needs to parse each1661 * fragment separately, since the only way to know the difference1662 * between a "---" that is part of a patch, and a "---" that starts1663 * the next patch is to look at the line counts..1664 */1665static int parse_fragment(struct apply_state *state,1666 const char *line,1667 unsigned long size,1668 struct patch *patch,1669 struct fragment *fragment)1670{1671 int added, deleted;1672 int len = linelen(line, size), offset;1673 unsigned long oldlines, newlines;1674 unsigned long leading, trailing;16751676 offset = parse_fragment_header(line, len, fragment);1677 if (offset < 0)1678 return -1;1679 if (offset > 0 && patch->recount)1680 recount_diff(line + offset, size - offset, fragment);1681 oldlines = fragment->oldlines;1682 newlines = fragment->newlines;1683 leading = 0;1684 trailing = 0;16851686 /* Parse the thing.. */1687 line += len;1688 size -= len;1689 state->linenr++;1690 added = deleted = 0;1691 for (offset = len;1692 0 < size;1693 offset += len, size -= len, line += len, state->linenr++) {1694 if (!oldlines && !newlines)1695 break;1696 len = linelen(line, size);1697 if (!len || line[len-1] != '\n')1698 return -1;1699 switch (*line) {1700 default:1701 return -1;1702 case '\n': /* newer GNU diff, an empty context line */1703 case ' ':1704 oldlines--;1705 newlines--;1706 if (!deleted && !added)1707 leading++;1708 trailing++;1709 check_old_for_crlf(patch, line, len);1710 if (!state->apply_in_reverse &&1711 state->ws_error_action == correct_ws_error)1712 check_whitespace(state, line, len, patch->ws_rule);1713 break;1714 case '-':1715 if (!state->apply_in_reverse)1716 check_old_for_crlf(patch, line, len);1717 if (state->apply_in_reverse &&1718 state->ws_error_action != nowarn_ws_error)1719 check_whitespace(state, line, len, patch->ws_rule);1720 deleted++;1721 oldlines--;1722 trailing = 0;1723 break;1724 case '+':1725 if (state->apply_in_reverse)1726 check_old_for_crlf(patch, line, len);1727 if (!state->apply_in_reverse &&1728 state->ws_error_action != nowarn_ws_error)1729 check_whitespace(state, line, len, patch->ws_rule);1730 added++;1731 newlines--;1732 trailing = 0;1733 break;17341735 /*1736 * We allow "\ No newline at end of file". Depending1737 * on locale settings when the patch was produced we1738 * don't know what this line looks like. The only1739 * thing we do know is that it begins with "\ ".1740 * Checking for 12 is just for sanity check -- any1741 * l10n of "\ No newline..." is at least that long.1742 */1743 case '\\':1744 if (len < 12 || memcmp(line, "\\ ", 2))1745 return -1;1746 break;1747 }1748 }1749 if (oldlines || newlines)1750 return -1;1751 if (!patch->recount && !deleted && !added)1752 return -1;17531754 fragment->leading = leading;1755 fragment->trailing = trailing;17561757 /*1758 * If a fragment ends with an incomplete line, we failed to include1759 * it in the above loop because we hit oldlines == newlines == 01760 * before seeing it.1761 */1762 if (12 < size && !memcmp(line, "\\ ", 2))1763 offset += linelen(line, size);17641765 patch->lines_added += added;1766 patch->lines_deleted += deleted;17671768 if (0 < patch->is_new && oldlines)1769 return error(_("new file depends on old contents"));1770 if (0 < patch->is_delete && newlines)1771 return error(_("deleted file still has contents"));1772 return offset;1773}17741775/*1776 * We have seen "diff --git a/... b/..." header (or a traditional patch1777 * header). Read hunks that belong to this patch into fragments and hang1778 * them to the given patch structure.1779 *1780 * The (fragment->patch, fragment->size) pair points into the memory given1781 * by the caller, not a copy, when we return.1782 *1783 * Returns:1784 * -1 in case of error,1785 * the number of bytes in the patch otherwise.1786 */1787static int parse_single_patch(struct apply_state *state,1788 const char *line,1789 unsigned long size,1790 struct patch *patch)1791{1792 unsigned long offset = 0;1793 unsigned long oldlines = 0, newlines = 0, context = 0;1794 struct fragment **fragp = &patch->fragments;17951796 while (size > 4 && !memcmp(line, "@@ -", 4)) {1797 struct fragment *fragment;1798 int len;17991800 fragment = xcalloc(1, sizeof(*fragment));1801 fragment->linenr = state->linenr;1802 len = parse_fragment(state, line, size, patch, fragment);1803 if (len <= 0) {1804 free(fragment);1805 return error(_("corrupt patch at line %d"), state->linenr);1806 }1807 fragment->patch = line;1808 fragment->size = len;1809 oldlines += fragment->oldlines;1810 newlines += fragment->newlines;1811 context += fragment->leading + fragment->trailing;18121813 *fragp = fragment;1814 fragp = &fragment->next;18151816 offset += len;1817 line += len;1818 size -= len;1819 }18201821 /*1822 * If something was removed (i.e. we have old-lines) it cannot1823 * be creation, and if something was added it cannot be1824 * deletion. However, the reverse is not true; --unified=01825 * patches that only add are not necessarily creation even1826 * though they do not have any old lines, and ones that only1827 * delete are not necessarily deletion.1828 *1829 * Unfortunately, a real creation/deletion patch do _not_ have1830 * any context line by definition, so we cannot safely tell it1831 * apart with --unified=0 insanity. At least if the patch has1832 * more than one hunk it is not creation or deletion.1833 */1834 if (patch->is_new < 0 &&1835 (oldlines || (patch->fragments && patch->fragments->next)))1836 patch->is_new = 0;1837 if (patch->is_delete < 0 &&1838 (newlines || (patch->fragments && patch->fragments->next)))1839 patch->is_delete = 0;18401841 if (0 < patch->is_new && oldlines)1842 return error(_("new file %s depends on old contents"), patch->new_name);1843 if (0 < patch->is_delete && newlines)1844 return error(_("deleted file %s still has contents"), patch->old_name);1845 if (!patch->is_delete && !newlines && context && state->apply_verbosity > verbosity_silent)1846 fprintf_ln(stderr,1847 _("** warning: "1848 "file %s becomes empty but is not deleted"),1849 patch->new_name);18501851 return offset;1852}18531854static inline int metadata_changes(struct patch *patch)1855{1856 return patch->is_rename > 0 ||1857 patch->is_copy > 0 ||1858 patch->is_new > 0 ||1859 patch->is_delete ||1860 (patch->old_mode && patch->new_mode &&1861 patch->old_mode != patch->new_mode);1862}18631864static char *inflate_it(const void *data, unsigned long size,1865 unsigned long inflated_size)1866{1867 git_zstream stream;1868 void *out;1869 int st;18701871 memset(&stream, 0, sizeof(stream));18721873 stream.next_in = (unsigned char *)data;1874 stream.avail_in = size;1875 stream.next_out = out = xmalloc(inflated_size);1876 stream.avail_out = inflated_size;1877 git_inflate_init(&stream);1878 st = git_inflate(&stream, Z_FINISH);1879 git_inflate_end(&stream);1880 if ((st != Z_STREAM_END) || stream.total_out != inflated_size) {1881 free(out);1882 return NULL;1883 }1884 return out;1885}18861887/*1888 * Read a binary hunk and return a new fragment; fragment->patch1889 * points at an allocated memory that the caller must free, so1890 * it is marked as "->free_patch = 1".1891 */1892static struct fragment *parse_binary_hunk(struct apply_state *state,1893 char **buf_p,1894 unsigned long *sz_p,1895 int *status_p,1896 int *used_p)1897{1898 /*1899 * Expect a line that begins with binary patch method ("literal"1900 * or "delta"), followed by the length of data before deflating.1901 * a sequence of 'length-byte' followed by base-85 encoded data1902 * should follow, terminated by a newline.1903 *1904 * Each 5-byte sequence of base-85 encodes up to 4 bytes,1905 * and we would limit the patch line to 66 characters,1906 * so one line can fit up to 13 groups that would decode1907 * to 52 bytes max. The length byte 'A'-'Z' corresponds1908 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.1909 */1910 int llen, used;1911 unsigned long size = *sz_p;1912 char *buffer = *buf_p;1913 int patch_method;1914 unsigned long origlen;1915 char *data = NULL;1916 int hunk_size = 0;1917 struct fragment *frag;19181919 llen = linelen(buffer, size);1920 used = llen;19211922 *status_p = 0;19231924 if (starts_with(buffer, "delta ")) {1925 patch_method = BINARY_DELTA_DEFLATED;1926 origlen = strtoul(buffer + 6, NULL, 10);1927 }1928 else if (starts_with(buffer, "literal ")) {1929 patch_method = BINARY_LITERAL_DEFLATED;1930 origlen = strtoul(buffer + 8, NULL, 10);1931 }1932 else1933 return NULL;19341935 state->linenr++;1936 buffer += llen;1937 while (1) {1938 int byte_length, max_byte_length, newsize;1939 llen = linelen(buffer, size);1940 used += llen;1941 state->linenr++;1942 if (llen == 1) {1943 /* consume the blank line */1944 buffer++;1945 size--;1946 break;1947 }1948 /*1949 * Minimum line is "A00000\n" which is 7-byte long,1950 * and the line length must be multiple of 5 plus 2.1951 */1952 if ((llen < 7) || (llen-2) % 5)1953 goto corrupt;1954 max_byte_length = (llen - 2) / 5 * 4;1955 byte_length = *buffer;1956 if ('A' <= byte_length && byte_length <= 'Z')1957 byte_length = byte_length - 'A' + 1;1958 else if ('a' <= byte_length && byte_length <= 'z')1959 byte_length = byte_length - 'a' + 27;1960 else1961 goto corrupt;1962 /* if the input length was not multiple of 4, we would1963 * have filler at the end but the filler should never1964 * exceed 3 bytes1965 */1966 if (max_byte_length < byte_length ||1967 byte_length <= max_byte_length - 4)1968 goto corrupt;1969 newsize = hunk_size + byte_length;1970 data = xrealloc(data, newsize);1971 if (decode_85(data + hunk_size, buffer + 1, byte_length))1972 goto corrupt;1973 hunk_size = newsize;1974 buffer += llen;1975 size -= llen;1976 }19771978 frag = xcalloc(1, sizeof(*frag));1979 frag->patch = inflate_it(data, hunk_size, origlen);1980 frag->free_patch = 1;1981 if (!frag->patch)1982 goto corrupt;1983 free(data);1984 frag->size = origlen;1985 *buf_p = buffer;1986 *sz_p = size;1987 *used_p = used;1988 frag->binary_patch_method = patch_method;1989 return frag;19901991 corrupt:1992 free(data);1993 *status_p = -1;1994 error(_("corrupt binary patch at line %d: %.*s"),1995 state->linenr-1, llen-1, buffer);1996 return NULL;1997}19981999/*2000 * Returns:2001 * -1 in case of error,2002 * the length of the parsed binary patch otherwise2003 */2004static int parse_binary(struct apply_state *state,2005 char *buffer,2006 unsigned long size,2007 struct patch *patch)2008{2009 /*2010 * We have read "GIT binary patch\n"; what follows is a line2011 * that says the patch method (currently, either "literal" or2012 * "delta") and the length of data before deflating; a2013 * sequence of 'length-byte' followed by base-85 encoded data2014 * follows.2015 *2016 * When a binary patch is reversible, there is another binary2017 * hunk in the same format, starting with patch method (either2018 * "literal" or "delta") with the length of data, and a sequence2019 * of length-byte + base-85 encoded data, terminated with another2020 * empty line. This data, when applied to the postimage, produces2021 * the preimage.2022 */2023 struct fragment *forward;2024 struct fragment *reverse;2025 int status;2026 int used, used_1;20272028 forward = parse_binary_hunk(state, &buffer, &size, &status, &used);2029 if (!forward && !status)2030 /* there has to be one hunk (forward hunk) */2031 return error(_("unrecognized binary patch at line %d"), state->linenr-1);2032 if (status)2033 /* otherwise we already gave an error message */2034 return status;20352036 reverse = parse_binary_hunk(state, &buffer, &size, &status, &used_1);2037 if (reverse)2038 used += used_1;2039 else if (status) {2040 /*2041 * Not having reverse hunk is not an error, but having2042 * a corrupt reverse hunk is.2043 */2044 free((void*) forward->patch);2045 free(forward);2046 return status;2047 }2048 forward->next = reverse;2049 patch->fragments = forward;2050 patch->is_binary = 1;2051 return used;2052}20532054static void prefix_one(struct apply_state *state, char **name)2055{2056 char *old_name = *name;2057 if (!old_name)2058 return;2059 *name = prefix_filename(state->prefix, *name);2060 free(old_name);2061}20622063static void prefix_patch(struct apply_state *state, struct patch *p)2064{2065 if (!state->prefix || p->is_toplevel_relative)2066 return;2067 prefix_one(state, &p->new_name);2068 prefix_one(state, &p->old_name);2069}20702071/*2072 * include/exclude2073 */20742075static void add_name_limit(struct apply_state *state,2076 const char *name,2077 int exclude)2078{2079 struct string_list_item *it;20802081 it = string_list_append(&state->limit_by_name, name);2082 it->util = exclude ? NULL : (void *) 1;2083}20842085static int use_patch(struct apply_state *state, struct patch *p)2086{2087 const char *pathname = p->new_name ? p->new_name : p->old_name;2088 int i;20892090 /* Paths outside are not touched regardless of "--include" */2091 if (state->prefix && *state->prefix) {2092 const char *rest;2093 if (!skip_prefix(pathname, state->prefix, &rest) || !*rest)2094 return 0;2095 }20962097 /* See if it matches any of exclude/include rule */2098 for (i = 0; i < state->limit_by_name.nr; i++) {2099 struct string_list_item *it = &state->limit_by_name.items[i];2100 if (!wildmatch(it->string, pathname, 0))2101 return (it->util != NULL);2102 }21032104 /*2105 * If we had any include, a path that does not match any rule is2106 * not used. Otherwise, we saw bunch of exclude rules (or none)2107 * and such a path is used.2108 */2109 return !state->has_include;2110}21112112/*2113 * Read the patch text in "buffer" that extends for "size" bytes; stop2114 * reading after seeing a single patch (i.e. changes to a single file).2115 * Create fragments (i.e. patch hunks) and hang them to the given patch.2116 *2117 * Returns:2118 * -1 if no header was found or parse_binary() failed,2119 * -128 on another error,2120 * the number of bytes consumed otherwise,2121 * so that the caller can call us again for the next patch.2122 */2123static int parse_chunk(struct apply_state *state, char *buffer, unsigned long size, struct patch *patch)2124{2125 int hdrsize, patchsize;2126 int offset = find_header(state, buffer, size, &hdrsize, patch);21272128 if (offset < 0)2129 return offset;21302131 prefix_patch(state, patch);21322133 if (!use_patch(state, patch))2134 patch->ws_rule = 0;2135 else if (patch->new_name)2136 patch->ws_rule = whitespace_rule(state->repo->index,2137 patch->new_name);2138 else2139 patch->ws_rule = whitespace_rule(state->repo->index,2140 patch->old_name);21412142 patchsize = parse_single_patch(state,2143 buffer + offset + hdrsize,2144 size - offset - hdrsize,2145 patch);21462147 if (patchsize < 0)2148 return -128;21492150 if (!patchsize) {2151 static const char git_binary[] = "GIT binary patch\n";2152 int hd = hdrsize + offset;2153 unsigned long llen = linelen(buffer + hd, size - hd);21542155 if (llen == sizeof(git_binary) - 1 &&2156 !memcmp(git_binary, buffer + hd, llen)) {2157 int used;2158 state->linenr++;2159 used = parse_binary(state, buffer + hd + llen,2160 size - hd - llen, patch);2161 if (used < 0)2162 return -1;2163 if (used)2164 patchsize = used + llen;2165 else2166 patchsize = 0;2167 }2168 else if (!memcmp(" differ\n", buffer + hd + llen - 8, 8)) {2169 static const char *binhdr[] = {2170 "Binary files ",2171 "Files ",2172 NULL,2173 };2174 int i;2175 for (i = 0; binhdr[i]; i++) {2176 int len = strlen(binhdr[i]);2177 if (len < size - hd &&2178 !memcmp(binhdr[i], buffer + hd, len)) {2179 state->linenr++;2180 patch->is_binary = 1;2181 patchsize = llen;2182 break;2183 }2184 }2185 }21862187 /* Empty patch cannot be applied if it is a text patch2188 * without metadata change. A binary patch appears2189 * empty to us here.2190 */2191 if ((state->apply || state->check) &&2192 (!patch->is_binary && !metadata_changes(patch))) {2193 error(_("patch with only garbage at line %d"), state->linenr);2194 return -128;2195 }2196 }21972198 return offset + hdrsize + patchsize;2199}22002201static void reverse_patches(struct patch *p)2202{2203 for (; p; p = p->next) {2204 struct fragment *frag = p->fragments;22052206 SWAP(p->new_name, p->old_name);2207 SWAP(p->new_mode, p->old_mode);2208 SWAP(p->is_new, p->is_delete);2209 SWAP(p->lines_added, p->lines_deleted);2210 SWAP(p->old_oid_prefix, p->new_oid_prefix);22112212 for (; frag; frag = frag->next) {2213 SWAP(frag->newpos, frag->oldpos);2214 SWAP(frag->newlines, frag->oldlines);2215 }2216 }2217}22182219static const char pluses[] =2220"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";2221static const char minuses[]=2222"----------------------------------------------------------------------";22232224static void show_stats(struct apply_state *state, struct patch *patch)2225{2226 struct strbuf qname = STRBUF_INIT;2227 char *cp = patch->new_name ? patch->new_name : patch->old_name;2228 int max, add, del;22292230 quote_c_style(cp, &qname, NULL, 0);22312232 /*2233 * "scale" the filename2234 */2235 max = state->max_len;2236 if (max > 50)2237 max = 50;22382239 if (qname.len > max) {2240 cp = strchr(qname.buf + qname.len + 3 - max, '/');2241 if (!cp)2242 cp = qname.buf + qname.len + 3 - max;2243 strbuf_splice(&qname, 0, cp - qname.buf, "...", 3);2244 }22452246 if (patch->is_binary) {2247 printf(" %-*s | Bin\n", max, qname.buf);2248 strbuf_release(&qname);2249 return;2250 }22512252 printf(" %-*s |", max, qname.buf);2253 strbuf_release(&qname);22542255 /*2256 * scale the add/delete2257 */2258 max = max + state->max_change > 70 ? 70 - max : state->max_change;2259 add = patch->lines_added;2260 del = patch->lines_deleted;22612262 if (state->max_change > 0) {2263 int total = ((add + del) * max + state->max_change / 2) / state->max_change;2264 add = (add * max + state->max_change / 2) / state->max_change;2265 del = total - add;2266 }2267 printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,2268 add, pluses, del, minuses);2269}22702271static int read_old_data(struct stat *st, struct patch *patch,2272 const char *path, struct strbuf *buf)2273{2274 int conv_flags = patch->crlf_in_old ?2275 CONV_EOL_KEEP_CRLF : CONV_EOL_RENORMALIZE;2276 switch (st->st_mode & S_IFMT) {2277 case S_IFLNK:2278 if (strbuf_readlink(buf, path, st->st_size) < 0)2279 return error(_("unable to read symlink %s"), path);2280 return 0;2281 case S_IFREG:2282 if (strbuf_read_file(buf, path, st->st_size) != st->st_size)2283 return error(_("unable to open or read %s"), path);2284 /*2285 * "git apply" without "--index/--cached" should never look2286 * at the index; the target file may not have been added to2287 * the index yet, and we may not even be in any Git repository.2288 * Pass NULL to convert_to_git() to stress this; the function2289 * should never look at the index when explicit crlf option2290 * is given.2291 */2292 convert_to_git(NULL, path, buf->buf, buf->len, buf, conv_flags);2293 return 0;2294 default:2295 return -1;2296 }2297}22982299/*2300 * Update the preimage, and the common lines in postimage,2301 * from buffer buf of length len. If postlen is 0 the postimage2302 * is updated in place, otherwise it's updated on a new buffer2303 * of length postlen2304 */23052306static void update_pre_post_images(struct image *preimage,2307 struct image *postimage,2308 char *buf,2309 size_t len, size_t postlen)2310{2311 int i, ctx, reduced;2312 char *new_buf, *old_buf, *fixed;2313 struct image fixed_preimage;23142315 /*2316 * Update the preimage with whitespace fixes. Note that we2317 * are not losing preimage->buf -- apply_one_fragment() will2318 * free "oldlines".2319 */2320 prepare_image(&fixed_preimage, buf, len, 1);2321 assert(postlen2322 ? fixed_preimage.nr == preimage->nr2323 : fixed_preimage.nr <= preimage->nr);2324 for (i = 0; i < fixed_preimage.nr; i++)2325 fixed_preimage.line[i].flag = preimage->line[i].flag;2326 free(preimage->line_allocated);2327 *preimage = fixed_preimage;23282329 /*2330 * Adjust the common context lines in postimage. This can be2331 * done in-place when we are shrinking it with whitespace2332 * fixing, but needs a new buffer when ignoring whitespace or2333 * expanding leading tabs to spaces.2334 *2335 * We trust the caller to tell us if the update can be done2336 * in place (postlen==0) or not.2337 */2338 old_buf = postimage->buf;2339 if (postlen)2340 new_buf = postimage->buf = xmalloc(postlen);2341 else2342 new_buf = old_buf;2343 fixed = preimage->buf;23442345 for (i = reduced = ctx = 0; i < postimage->nr; i++) {2346 size_t l_len = postimage->line[i].len;2347 if (!(postimage->line[i].flag & LINE_COMMON)) {2348 /* an added line -- no counterparts in preimage */2349 memmove(new_buf, old_buf, l_len);2350 old_buf += l_len;2351 new_buf += l_len;2352 continue;2353 }23542355 /* a common context -- skip it in the original postimage */2356 old_buf += l_len;23572358 /* and find the corresponding one in the fixed preimage */2359 while (ctx < preimage->nr &&2360 !(preimage->line[ctx].flag & LINE_COMMON)) {2361 fixed += preimage->line[ctx].len;2362 ctx++;2363 }23642365 /*2366 * preimage is expected to run out, if the caller2367 * fixed addition of trailing blank lines.2368 */2369 if (preimage->nr <= ctx) {2370 reduced++;2371 continue;2372 }23732374 /* and copy it in, while fixing the line length */2375 l_len = preimage->line[ctx].len;2376 memcpy(new_buf, fixed, l_len);2377 new_buf += l_len;2378 fixed += l_len;2379 postimage->line[i].len = l_len;2380 ctx++;2381 }23822383 if (postlen2384 ? postlen < new_buf - postimage->buf2385 : postimage->len < new_buf - postimage->buf)2386 BUG("caller miscounted postlen: asked %d, orig = %d, used = %d",2387 (int)postlen, (int) postimage->len, (int)(new_buf - postimage->buf));23882389 /* Fix the length of the whole thing */2390 postimage->len = new_buf - postimage->buf;2391 postimage->nr -= reduced;2392}23932394static int line_by_line_fuzzy_match(struct image *img,2395 struct image *preimage,2396 struct image *postimage,2397 unsigned long current,2398 int current_lno,2399 int preimage_limit)2400{2401 int i;2402 size_t imgoff = 0;2403 size_t preoff = 0;2404 size_t postlen = postimage->len;2405 size_t extra_chars;2406 char *buf;2407 char *preimage_eof;2408 char *preimage_end;2409 struct strbuf fixed;2410 char *fixed_buf;2411 size_t fixed_len;24122413 for (i = 0; i < preimage_limit; i++) {2414 size_t prelen = preimage->line[i].len;2415 size_t imglen = img->line[current_lno+i].len;24162417 if (!fuzzy_matchlines(img->buf + current + imgoff, imglen,2418 preimage->buf + preoff, prelen))2419 return 0;2420 if (preimage->line[i].flag & LINE_COMMON)2421 postlen += imglen - prelen;2422 imgoff += imglen;2423 preoff += prelen;2424 }24252426 /*2427 * Ok, the preimage matches with whitespace fuzz.2428 *2429 * imgoff now holds the true length of the target that2430 * matches the preimage before the end of the file.2431 *2432 * Count the number of characters in the preimage that fall2433 * beyond the end of the file and make sure that all of them2434 * are whitespace characters. (This can only happen if2435 * we are removing blank lines at the end of the file.)2436 */2437 buf = preimage_eof = preimage->buf + preoff;2438 for ( ; i < preimage->nr; i++)2439 preoff += preimage->line[i].len;2440 preimage_end = preimage->buf + preoff;2441 for ( ; buf < preimage_end; buf++)2442 if (!isspace(*buf))2443 return 0;24442445 /*2446 * Update the preimage and the common postimage context2447 * lines to use the same whitespace as the target.2448 * If whitespace is missing in the target (i.e.2449 * if the preimage extends beyond the end of the file),2450 * use the whitespace from the preimage.2451 */2452 extra_chars = preimage_end - preimage_eof;2453 strbuf_init(&fixed, imgoff + extra_chars);2454 strbuf_add(&fixed, img->buf + current, imgoff);2455 strbuf_add(&fixed, preimage_eof, extra_chars);2456 fixed_buf = strbuf_detach(&fixed, &fixed_len);2457 update_pre_post_images(preimage, postimage,2458 fixed_buf, fixed_len, postlen);2459 return 1;2460}24612462static int match_fragment(struct apply_state *state,2463 struct image *img,2464 struct image *preimage,2465 struct image *postimage,2466 unsigned long current,2467 int current_lno,2468 unsigned ws_rule,2469 int match_beginning, int match_end)2470{2471 int i;2472 char *fixed_buf, *buf, *orig, *target;2473 struct strbuf fixed;2474 size_t fixed_len, postlen;2475 int preimage_limit;24762477 if (preimage->nr + current_lno <= img->nr) {2478 /*2479 * The hunk falls within the boundaries of img.2480 */2481 preimage_limit = preimage->nr;2482 if (match_end && (preimage->nr + current_lno != img->nr))2483 return 0;2484 } else if (state->ws_error_action == correct_ws_error &&2485 (ws_rule & WS_BLANK_AT_EOF)) {2486 /*2487 * This hunk extends beyond the end of img, and we are2488 * removing blank lines at the end of the file. This2489 * many lines from the beginning of the preimage must2490 * match with img, and the remainder of the preimage2491 * must be blank.2492 */2493 preimage_limit = img->nr - current_lno;2494 } else {2495 /*2496 * The hunk extends beyond the end of the img and2497 * we are not removing blanks at the end, so we2498 * should reject the hunk at this position.2499 */2500 return 0;2501 }25022503 if (match_beginning && current_lno)2504 return 0;25052506 /* Quick hash check */2507 for (i = 0; i < preimage_limit; i++)2508 if ((img->line[current_lno + i].flag & LINE_PATCHED) ||2509 (preimage->line[i].hash != img->line[current_lno + i].hash))2510 return 0;25112512 if (preimage_limit == preimage->nr) {2513 /*2514 * Do we have an exact match? If we were told to match2515 * at the end, size must be exactly at current+fragsize,2516 * otherwise current+fragsize must be still within the preimage,2517 * and either case, the old piece should match the preimage2518 * exactly.2519 */2520 if ((match_end2521 ? (current + preimage->len == img->len)2522 : (current + preimage->len <= img->len)) &&2523 !memcmp(img->buf + current, preimage->buf, preimage->len))2524 return 1;2525 } else {2526 /*2527 * The preimage extends beyond the end of img, so2528 * there cannot be an exact match.2529 *2530 * There must be one non-blank context line that match2531 * a line before the end of img.2532 */2533 char *buf_end;25342535 buf = preimage->buf;2536 buf_end = buf;2537 for (i = 0; i < preimage_limit; i++)2538 buf_end += preimage->line[i].len;25392540 for ( ; buf < buf_end; buf++)2541 if (!isspace(*buf))2542 break;2543 if (buf == buf_end)2544 return 0;2545 }25462547 /*2548 * No exact match. If we are ignoring whitespace, run a line-by-line2549 * fuzzy matching. We collect all the line length information because2550 * we need it to adjust whitespace if we match.2551 */2552 if (state->ws_ignore_action == ignore_ws_change)2553 return line_by_line_fuzzy_match(img, preimage, postimage,2554 current, current_lno, preimage_limit);25552556 if (state->ws_error_action != correct_ws_error)2557 return 0;25582559 /*2560 * The hunk does not apply byte-by-byte, but the hash says2561 * it might with whitespace fuzz. We weren't asked to2562 * ignore whitespace, we were asked to correct whitespace2563 * errors, so let's try matching after whitespace correction.2564 *2565 * While checking the preimage against the target, whitespace2566 * errors in both fixed, we count how large the corresponding2567 * postimage needs to be. The postimage prepared by2568 * apply_one_fragment() has whitespace errors fixed on added2569 * lines already, but the common lines were propagated as-is,2570 * which may become longer when their whitespace errors are2571 * fixed.2572 */25732574 /* First count added lines in postimage */2575 postlen = 0;2576 for (i = 0; i < postimage->nr; i++) {2577 if (!(postimage->line[i].flag & LINE_COMMON))2578 postlen += postimage->line[i].len;2579 }25802581 /*2582 * The preimage may extend beyond the end of the file,2583 * but in this loop we will only handle the part of the2584 * preimage that falls within the file.2585 */2586 strbuf_init(&fixed, preimage->len + 1);2587 orig = preimage->buf;2588 target = img->buf + current;2589 for (i = 0; i < preimage_limit; i++) {2590 size_t oldlen = preimage->line[i].len;2591 size_t tgtlen = img->line[current_lno + i].len;2592 size_t fixstart = fixed.len;2593 struct strbuf tgtfix;2594 int match;25952596 /* Try fixing the line in the preimage */2597 ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);25982599 /* Try fixing the line in the target */2600 strbuf_init(&tgtfix, tgtlen);2601 ws_fix_copy(&tgtfix, target, tgtlen, ws_rule, NULL);26022603 /*2604 * If they match, either the preimage was based on2605 * a version before our tree fixed whitespace breakage,2606 * or we are lacking a whitespace-fix patch the tree2607 * the preimage was based on already had (i.e. target2608 * has whitespace breakage, the preimage doesn't).2609 * In either case, we are fixing the whitespace breakages2610 * so we might as well take the fix together with their2611 * real change.2612 */2613 match = (tgtfix.len == fixed.len - fixstart &&2614 !memcmp(tgtfix.buf, fixed.buf + fixstart,2615 fixed.len - fixstart));26162617 /* Add the length if this is common with the postimage */2618 if (preimage->line[i].flag & LINE_COMMON)2619 postlen += tgtfix.len;26202621 strbuf_release(&tgtfix);2622 if (!match)2623 goto unmatch_exit;26242625 orig += oldlen;2626 target += tgtlen;2627 }262826292630 /*2631 * Now handle the lines in the preimage that falls beyond the2632 * end of the file (if any). They will only match if they are2633 * empty or only contain whitespace (if WS_BLANK_AT_EOL is2634 * false).2635 */2636 for ( ; i < preimage->nr; i++) {2637 size_t fixstart = fixed.len; /* start of the fixed preimage */2638 size_t oldlen = preimage->line[i].len;2639 int j;26402641 /* Try fixing the line in the preimage */2642 ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);26432644 for (j = fixstart; j < fixed.len; j++)2645 if (!isspace(fixed.buf[j]))2646 goto unmatch_exit;26472648 orig += oldlen;2649 }26502651 /*2652 * Yes, the preimage is based on an older version that still2653 * has whitespace breakages unfixed, and fixing them makes the2654 * hunk match. Update the context lines in the postimage.2655 */2656 fixed_buf = strbuf_detach(&fixed, &fixed_len);2657 if (postlen < postimage->len)2658 postlen = 0;2659 update_pre_post_images(preimage, postimage,2660 fixed_buf, fixed_len, postlen);2661 return 1;26622663 unmatch_exit:2664 strbuf_release(&fixed);2665 return 0;2666}26672668static int find_pos(struct apply_state *state,2669 struct image *img,2670 struct image *preimage,2671 struct image *postimage,2672 int line,2673 unsigned ws_rule,2674 int match_beginning, int match_end)2675{2676 int i;2677 unsigned long backwards, forwards, current;2678 int backwards_lno, forwards_lno, current_lno;26792680 /*2681 * If match_beginning or match_end is specified, there is no2682 * point starting from a wrong line that will never match and2683 * wander around and wait for a match at the specified end.2684 */2685 if (match_beginning)2686 line = 0;2687 else if (match_end)2688 line = img->nr - preimage->nr;26892690 /*2691 * Because the comparison is unsigned, the following test2692 * will also take care of a negative line number that can2693 * result when match_end and preimage is larger than the target.2694 */2695 if ((size_t) line > img->nr)2696 line = img->nr;26972698 current = 0;2699 for (i = 0; i < line; i++)2700 current += img->line[i].len;27012702 /*2703 * There's probably some smart way to do this, but I'll leave2704 * that to the smart and beautiful people. I'm simple and stupid.2705 */2706 backwards = current;2707 backwards_lno = line;2708 forwards = current;2709 forwards_lno = line;2710 current_lno = line;27112712 for (i = 0; ; i++) {2713 if (match_fragment(state, img, preimage, postimage,2714 current, current_lno, ws_rule,2715 match_beginning, match_end))2716 return current_lno;27172718 again:2719 if (backwards_lno == 0 && forwards_lno == img->nr)2720 break;27212722 if (i & 1) {2723 if (backwards_lno == 0) {2724 i++;2725 goto again;2726 }2727 backwards_lno--;2728 backwards -= img->line[backwards_lno].len;2729 current = backwards;2730 current_lno = backwards_lno;2731 } else {2732 if (forwards_lno == img->nr) {2733 i++;2734 goto again;2735 }2736 forwards += img->line[forwards_lno].len;2737 forwards_lno++;2738 current = forwards;2739 current_lno = forwards_lno;2740 }27412742 }2743 return -1;2744}27452746static void remove_first_line(struct image *img)2747{2748 img->buf += img->line[0].len;2749 img->len -= img->line[0].len;2750 img->line++;2751 img->nr--;2752}27532754static void remove_last_line(struct image *img)2755{2756 img->len -= img->line[--img->nr].len;2757}27582759/*2760 * The change from "preimage" and "postimage" has been found to2761 * apply at applied_pos (counts in line numbers) in "img".2762 * Update "img" to remove "preimage" and replace it with "postimage".2763 */2764static void update_image(struct apply_state *state,2765 struct image *img,2766 int applied_pos,2767 struct image *preimage,2768 struct image *postimage)2769{2770 /*2771 * remove the copy of preimage at offset in img2772 * and replace it with postimage2773 */2774 int i, nr;2775 size_t remove_count, insert_count, applied_at = 0;2776 char *result;2777 int preimage_limit;27782779 /*2780 * If we are removing blank lines at the end of img,2781 * the preimage may extend beyond the end.2782 * If that is the case, we must be careful only to2783 * remove the part of the preimage that falls within2784 * the boundaries of img. Initialize preimage_limit2785 * to the number of lines in the preimage that falls2786 * within the boundaries.2787 */2788 preimage_limit = preimage->nr;2789 if (preimage_limit > img->nr - applied_pos)2790 preimage_limit = img->nr - applied_pos;27912792 for (i = 0; i < applied_pos; i++)2793 applied_at += img->line[i].len;27942795 remove_count = 0;2796 for (i = 0; i < preimage_limit; i++)2797 remove_count += img->line[applied_pos + i].len;2798 insert_count = postimage->len;27992800 /* Adjust the contents */2801 result = xmalloc(st_add3(st_sub(img->len, remove_count), insert_count, 1));2802 memcpy(result, img->buf, applied_at);2803 memcpy(result + applied_at, postimage->buf, postimage->len);2804 memcpy(result + applied_at + postimage->len,2805 img->buf + (applied_at + remove_count),2806 img->len - (applied_at + remove_count));2807 free(img->buf);2808 img->buf = result;2809 img->len += insert_count - remove_count;2810 result[img->len] = '\0';28112812 /* Adjust the line table */2813 nr = img->nr + postimage->nr - preimage_limit;2814 if (preimage_limit < postimage->nr) {2815 /*2816 * NOTE: this knows that we never call remove_first_line()2817 * on anything other than pre/post image.2818 */2819 REALLOC_ARRAY(img->line, nr);2820 img->line_allocated = img->line;2821 }2822 if (preimage_limit != postimage->nr)2823 MOVE_ARRAY(img->line + applied_pos + postimage->nr,2824 img->line + applied_pos + preimage_limit,2825 img->nr - (applied_pos + preimage_limit));2826 COPY_ARRAY(img->line + applied_pos, postimage->line, postimage->nr);2827 if (!state->allow_overlap)2828 for (i = 0; i < postimage->nr; i++)2829 img->line[applied_pos + i].flag |= LINE_PATCHED;2830 img->nr = nr;2831}28322833/*2834 * Use the patch-hunk text in "frag" to prepare two images (preimage and2835 * postimage) for the hunk. Find lines that match "preimage" in "img" and2836 * replace the part of "img" with "postimage" text.2837 */2838static int apply_one_fragment(struct apply_state *state,2839 struct image *img, struct fragment *frag,2840 int inaccurate_eof, unsigned ws_rule,2841 int nth_fragment)2842{2843 int match_beginning, match_end;2844 const char *patch = frag->patch;2845 int size = frag->size;2846 char *old, *oldlines;2847 struct strbuf newlines;2848 int new_blank_lines_at_end = 0;2849 int found_new_blank_lines_at_end = 0;2850 int hunk_linenr = frag->linenr;2851 unsigned long leading, trailing;2852 int pos, applied_pos;2853 struct image preimage;2854 struct image postimage;28552856 memset(&preimage, 0, sizeof(preimage));2857 memset(&postimage, 0, sizeof(postimage));2858 oldlines = xmalloc(size);2859 strbuf_init(&newlines, size);28602861 old = oldlines;2862 while (size > 0) {2863 char first;2864 int len = linelen(patch, size);2865 int plen;2866 int added_blank_line = 0;2867 int is_blank_context = 0;2868 size_t start;28692870 if (!len)2871 break;28722873 /*2874 * "plen" is how much of the line we should use for2875 * the actual patch data. Normally we just remove the2876 * first character on the line, but if the line is2877 * followed by "\ No newline", then we also remove the2878 * last one (which is the newline, of course).2879 */2880 plen = len - 1;2881 if (len < size && patch[len] == '\\')2882 plen--;2883 first = *patch;2884 if (state->apply_in_reverse) {2885 if (first == '-')2886 first = '+';2887 else if (first == '+')2888 first = '-';2889 }28902891 switch (first) {2892 case '\n':2893 /* Newer GNU diff, empty context line */2894 if (plen < 0)2895 /* ... followed by '\No newline'; nothing */2896 break;2897 *old++ = '\n';2898 strbuf_addch(&newlines, '\n');2899 add_line_info(&preimage, "\n", 1, LINE_COMMON);2900 add_line_info(&postimage, "\n", 1, LINE_COMMON);2901 is_blank_context = 1;2902 break;2903 case ' ':2904 if (plen && (ws_rule & WS_BLANK_AT_EOF) &&2905 ws_blank_line(patch + 1, plen, ws_rule))2906 is_blank_context = 1;2907 /* fallthrough */2908 case '-':2909 memcpy(old, patch + 1, plen);2910 add_line_info(&preimage, old, plen,2911 (first == ' ' ? LINE_COMMON : 0));2912 old += plen;2913 if (first == '-')2914 break;2915 /* fallthrough */2916 case '+':2917 /* --no-add does not add new lines */2918 if (first == '+' && state->no_add)2919 break;29202921 start = newlines.len;2922 if (first != '+' ||2923 !state->whitespace_error ||2924 state->ws_error_action != correct_ws_error) {2925 strbuf_add(&newlines, patch + 1, plen);2926 }2927 else {2928 ws_fix_copy(&newlines, patch + 1, plen, ws_rule, &state->applied_after_fixing_ws);2929 }2930 add_line_info(&postimage, newlines.buf + start, newlines.len - start,2931 (first == '+' ? 0 : LINE_COMMON));2932 if (first == '+' &&2933 (ws_rule & WS_BLANK_AT_EOF) &&2934 ws_blank_line(patch + 1, plen, ws_rule))2935 added_blank_line = 1;2936 break;2937 case '@': case '\\':2938 /* Ignore it, we already handled it */2939 break;2940 default:2941 if (state->apply_verbosity > verbosity_normal)2942 error(_("invalid start of line: '%c'"), first);2943 applied_pos = -1;2944 goto out;2945 }2946 if (added_blank_line) {2947 if (!new_blank_lines_at_end)2948 found_new_blank_lines_at_end = hunk_linenr;2949 new_blank_lines_at_end++;2950 }2951 else if (is_blank_context)2952 ;2953 else2954 new_blank_lines_at_end = 0;2955 patch += len;2956 size -= len;2957 hunk_linenr++;2958 }2959 if (inaccurate_eof &&2960 old > oldlines && old[-1] == '\n' &&2961 newlines.len > 0 && newlines.buf[newlines.len - 1] == '\n') {2962 old--;2963 strbuf_setlen(&newlines, newlines.len - 1);2964 preimage.line_allocated[preimage.nr - 1].len--;2965 postimage.line_allocated[postimage.nr - 1].len--;2966 }29672968 leading = frag->leading;2969 trailing = frag->trailing;29702971 /*2972 * A hunk to change lines at the beginning would begin with2973 * @@ -1,L +N,M @@2974 * but we need to be careful. -U0 that inserts before the second2975 * line also has this pattern.2976 *2977 * And a hunk to add to an empty file would begin with2978 * @@ -0,0 +N,M @@2979 *2980 * In other words, a hunk that is (frag->oldpos <= 1) with or2981 * without leading context must match at the beginning.2982 */2983 match_beginning = (!frag->oldpos ||2984 (frag->oldpos == 1 && !state->unidiff_zero));29852986 /*2987 * A hunk without trailing lines must match at the end.2988 * However, we simply cannot tell if a hunk must match end2989 * from the lack of trailing lines if the patch was generated2990 * with unidiff without any context.2991 */2992 match_end = !state->unidiff_zero && !trailing;29932994 pos = frag->newpos ? (frag->newpos - 1) : 0;2995 preimage.buf = oldlines;2996 preimage.len = old - oldlines;2997 postimage.buf = newlines.buf;2998 postimage.len = newlines.len;2999 preimage.line = preimage.line_allocated;3000 postimage.line = postimage.line_allocated;30013002 for (;;) {30033004 applied_pos = find_pos(state, img, &preimage, &postimage, pos,3005 ws_rule, match_beginning, match_end);30063007 if (applied_pos >= 0)3008 break;30093010 /* Am I at my context limits? */3011 if ((leading <= state->p_context) && (trailing <= state->p_context))3012 break;3013 if (match_beginning || match_end) {3014 match_beginning = match_end = 0;3015 continue;3016 }30173018 /*3019 * Reduce the number of context lines; reduce both3020 * leading and trailing if they are equal otherwise3021 * just reduce the larger context.3022 */3023 if (leading >= trailing) {3024 remove_first_line(&preimage);3025 remove_first_line(&postimage);3026 pos--;3027 leading--;3028 }3029 if (trailing > leading) {3030 remove_last_line(&preimage);3031 remove_last_line(&postimage);3032 trailing--;3033 }3034 }30353036 if (applied_pos >= 0) {3037 if (new_blank_lines_at_end &&3038 preimage.nr + applied_pos >= img->nr &&3039 (ws_rule & WS_BLANK_AT_EOF) &&3040 state->ws_error_action != nowarn_ws_error) {3041 record_ws_error(state, WS_BLANK_AT_EOF, "+", 1,3042 found_new_blank_lines_at_end);3043 if (state->ws_error_action == correct_ws_error) {3044 while (new_blank_lines_at_end--)3045 remove_last_line(&postimage);3046 }3047 /*3048 * We would want to prevent write_out_results()3049 * from taking place in apply_patch() that follows3050 * the callchain led us here, which is:3051 * apply_patch->check_patch_list->check_patch->3052 * apply_data->apply_fragments->apply_one_fragment3053 */3054 if (state->ws_error_action == die_on_ws_error)3055 state->apply = 0;3056 }30573058 if (state->apply_verbosity > verbosity_normal && applied_pos != pos) {3059 int offset = applied_pos - pos;3060 if (state->apply_in_reverse)3061 offset = 0 - offset;3062 fprintf_ln(stderr,3063 Q_("Hunk #%d succeeded at %d (offset %d line).",3064 "Hunk #%d succeeded at %d (offset %d lines).",3065 offset),3066 nth_fragment, applied_pos + 1, offset);3067 }30683069 /*3070 * Warn if it was necessary to reduce the number3071 * of context lines.3072 */3073 if ((leading != frag->leading ||3074 trailing != frag->trailing) && state->apply_verbosity > verbosity_silent)3075 fprintf_ln(stderr, _("Context reduced to (%ld/%ld)"3076 " to apply fragment at %d"),3077 leading, trailing, applied_pos+1);3078 update_image(state, img, applied_pos, &preimage, &postimage);3079 } else {3080 if (state->apply_verbosity > verbosity_normal)3081 error(_("while searching for:\n%.*s"),3082 (int)(old - oldlines), oldlines);3083 }30843085out:3086 free(oldlines);3087 strbuf_release(&newlines);3088 free(preimage.line_allocated);3089 free(postimage.line_allocated);30903091 return (applied_pos < 0);3092}30933094static int apply_binary_fragment(struct apply_state *state,3095 struct image *img,3096 struct patch *patch)3097{3098 struct fragment *fragment = patch->fragments;3099 unsigned long len;3100 void *dst;31013102 if (!fragment)3103 return error(_("missing binary patch data for '%s'"),3104 patch->new_name ?3105 patch->new_name :3106 patch->old_name);31073108 /* Binary patch is irreversible without the optional second hunk */3109 if (state->apply_in_reverse) {3110 if (!fragment->next)3111 return error(_("cannot reverse-apply a binary patch "3112 "without the reverse hunk to '%s'"),3113 patch->new_name3114 ? patch->new_name : patch->old_name);3115 fragment = fragment->next;3116 }3117 switch (fragment->binary_patch_method) {3118 case BINARY_DELTA_DEFLATED:3119 dst = patch_delta(img->buf, img->len, fragment->patch,3120 fragment->size, &len);3121 if (!dst)3122 return -1;3123 clear_image(img);3124 img->buf = dst;3125 img->len = len;3126 return 0;3127 case BINARY_LITERAL_DEFLATED:3128 clear_image(img);3129 img->len = fragment->size;3130 img->buf = xmemdupz(fragment->patch, img->len);3131 return 0;3132 }3133 return -1;3134}31353136/*3137 * Replace "img" with the result of applying the binary patch.3138 * The binary patch data itself in patch->fragment is still kept3139 * but the preimage prepared by the caller in "img" is freed here3140 * or in the helper function apply_binary_fragment() this calls.3141 */3142static int apply_binary(struct apply_state *state,3143 struct image *img,3144 struct patch *patch)3145{3146 const char *name = patch->old_name ? patch->old_name : patch->new_name;3147 struct object_id oid;3148 const unsigned hexsz = the_hash_algo->hexsz;31493150 /*3151 * For safety, we require patch index line to contain3152 * full hex textual object ID for old and new, at least for now.3153 */3154 if (strlen(patch->old_oid_prefix) != hexsz ||3155 strlen(patch->new_oid_prefix) != hexsz ||3156 get_oid_hex(patch->old_oid_prefix, &oid) ||3157 get_oid_hex(patch->new_oid_prefix, &oid))3158 return error(_("cannot apply binary patch to '%s' "3159 "without full index line"), name);31603161 if (patch->old_name) {3162 /*3163 * See if the old one matches what the patch3164 * applies to.3165 */3166 hash_object_file(img->buf, img->len, blob_type, &oid);3167 if (strcmp(oid_to_hex(&oid), patch->old_oid_prefix))3168 return error(_("the patch applies to '%s' (%s), "3169 "which does not match the "3170 "current contents."),3171 name, oid_to_hex(&oid));3172 }3173 else {3174 /* Otherwise, the old one must be empty. */3175 if (img->len)3176 return error(_("the patch applies to an empty "3177 "'%s' but it is not empty"), name);3178 }31793180 get_oid_hex(patch->new_oid_prefix, &oid);3181 if (is_null_oid(&oid)) {3182 clear_image(img);3183 return 0; /* deletion patch */3184 }31853186 if (has_sha1_file(oid.hash)) {3187 /* We already have the postimage */3188 enum object_type type;3189 unsigned long size;3190 char *result;31913192 result = read_object_file(&oid, &type, &size);3193 if (!result)3194 return error(_("the necessary postimage %s for "3195 "'%s' cannot be read"),3196 patch->new_oid_prefix, name);3197 clear_image(img);3198 img->buf = result;3199 img->len = size;3200 } else {3201 /*3202 * We have verified buf matches the preimage;3203 * apply the patch data to it, which is stored3204 * in the patch->fragments->{patch,size}.3205 */3206 if (apply_binary_fragment(state, img, patch))3207 return error(_("binary patch does not apply to '%s'"),3208 name);32093210 /* verify that the result matches */3211 hash_object_file(img->buf, img->len, blob_type, &oid);3212 if (strcmp(oid_to_hex(&oid), patch->new_oid_prefix))3213 return error(_("binary patch to '%s' creates incorrect result (expecting %s, got %s)"),3214 name, patch->new_oid_prefix, oid_to_hex(&oid));3215 }32163217 return 0;3218}32193220static int apply_fragments(struct apply_state *state, struct image *img, struct patch *patch)3221{3222 struct fragment *frag = patch->fragments;3223 const char *name = patch->old_name ? patch->old_name : patch->new_name;3224 unsigned ws_rule = patch->ws_rule;3225 unsigned inaccurate_eof = patch->inaccurate_eof;3226 int nth = 0;32273228 if (patch->is_binary)3229 return apply_binary(state, img, patch);32303231 while (frag) {3232 nth++;3233 if (apply_one_fragment(state, img, frag, inaccurate_eof, ws_rule, nth)) {3234 error(_("patch failed: %s:%ld"), name, frag->oldpos);3235 if (!state->apply_with_reject)3236 return -1;3237 frag->rejected = 1;3238 }3239 frag = frag->next;3240 }3241 return 0;3242}32433244static int read_blob_object(struct strbuf *buf, const struct object_id *oid, unsigned mode)3245{3246 if (S_ISGITLINK(mode)) {3247 strbuf_grow(buf, 100);3248 strbuf_addf(buf, "Subproject commit %s\n", oid_to_hex(oid));3249 } else {3250 enum object_type type;3251 unsigned long sz;3252 char *result;32533254 result = read_object_file(oid, &type, &sz);3255 if (!result)3256 return -1;3257 /* XXX read_sha1_file NUL-terminates */3258 strbuf_attach(buf, result, sz, sz + 1);3259 }3260 return 0;3261}32623263static int read_file_or_gitlink(const struct cache_entry *ce, struct strbuf *buf)3264{3265 if (!ce)3266 return 0;3267 return read_blob_object(buf, &ce->oid, ce->ce_mode);3268}32693270static struct patch *in_fn_table(struct apply_state *state, const char *name)3271{3272 struct string_list_item *item;32733274 if (name == NULL)3275 return NULL;32763277 item = string_list_lookup(&state->fn_table, name);3278 if (item != NULL)3279 return (struct patch *)item->util;32803281 return NULL;3282}32833284/*3285 * item->util in the filename table records the status of the path.3286 * Usually it points at a patch (whose result records the contents3287 * of it after applying it), but it could be PATH_WAS_DELETED for a3288 * path that a previously applied patch has already removed, or3289 * PATH_TO_BE_DELETED for a path that a later patch would remove.3290 *3291 * The latter is needed to deal with a case where two paths A and B3292 * are swapped by first renaming A to B and then renaming B to A;3293 * moving A to B should not be prevented due to presence of B as we3294 * will remove it in a later patch.3295 */3296#define PATH_TO_BE_DELETED ((struct patch *) -2)3297#define PATH_WAS_DELETED ((struct patch *) -1)32983299static int to_be_deleted(struct patch *patch)3300{3301 return patch == PATH_TO_BE_DELETED;3302}33033304static int was_deleted(struct patch *patch)3305{3306 return patch == PATH_WAS_DELETED;3307}33083309static void add_to_fn_table(struct apply_state *state, struct patch *patch)3310{3311 struct string_list_item *item;33123313 /*3314 * Always add new_name unless patch is a deletion3315 * This should cover the cases for normal diffs,3316 * file creations and copies3317 */3318 if (patch->new_name != NULL) {3319 item = string_list_insert(&state->fn_table, patch->new_name);3320 item->util = patch;3321 }33223323 /*3324 * store a failure on rename/deletion cases because3325 * later chunks shouldn't patch old names3326 */3327 if ((patch->new_name == NULL) || (patch->is_rename)) {3328 item = string_list_insert(&state->fn_table, patch->old_name);3329 item->util = PATH_WAS_DELETED;3330 }3331}33323333static void prepare_fn_table(struct apply_state *state, struct patch *patch)3334{3335 /*3336 * store information about incoming file deletion3337 */3338 while (patch) {3339 if ((patch->new_name == NULL) || (patch->is_rename)) {3340 struct string_list_item *item;3341 item = string_list_insert(&state->fn_table, patch->old_name);3342 item->util = PATH_TO_BE_DELETED;3343 }3344 patch = patch->next;3345 }3346}33473348static int checkout_target(struct index_state *istate,3349 struct cache_entry *ce, struct stat *st)3350{3351 struct checkout costate = CHECKOUT_INIT;33523353 costate.refresh_cache = 1;3354 costate.istate = istate;3355 if (checkout_entry(ce, &costate, NULL) || lstat(ce->name, st))3356 return error(_("cannot checkout %s"), ce->name);3357 return 0;3358}33593360static struct patch *previous_patch(struct apply_state *state,3361 struct patch *patch,3362 int *gone)3363{3364 struct patch *previous;33653366 *gone = 0;3367 if (patch->is_copy || patch->is_rename)3368 return NULL; /* "git" patches do not depend on the order */33693370 previous = in_fn_table(state, patch->old_name);3371 if (!previous)3372 return NULL;33733374 if (to_be_deleted(previous))3375 return NULL; /* the deletion hasn't happened yet */33763377 if (was_deleted(previous))3378 *gone = 1;33793380 return previous;3381}33823383static int verify_index_match(struct apply_state *state,3384 const struct cache_entry *ce,3385 struct stat *st)3386{3387 if (S_ISGITLINK(ce->ce_mode)) {3388 if (!S_ISDIR(st->st_mode))3389 return -1;3390 return 0;3391 }3392 return ie_match_stat(state->repo->index, ce, st,3393 CE_MATCH_IGNORE_VALID | CE_MATCH_IGNORE_SKIP_WORKTREE);3394}33953396#define SUBMODULE_PATCH_WITHOUT_INDEX 133973398static int load_patch_target(struct apply_state *state,3399 struct strbuf *buf,3400 const struct cache_entry *ce,3401 struct stat *st,3402 struct patch *patch,3403 const char *name,3404 unsigned expected_mode)3405{3406 if (state->cached || state->check_index) {3407 if (read_file_or_gitlink(ce, buf))3408 return error(_("failed to read %s"), name);3409 } else if (name) {3410 if (S_ISGITLINK(expected_mode)) {3411 if (ce)3412 return read_file_or_gitlink(ce, buf);3413 else3414 return SUBMODULE_PATCH_WITHOUT_INDEX;3415 } else if (has_symlink_leading_path(name, strlen(name))) {3416 return error(_("reading from '%s' beyond a symbolic link"), name);3417 } else {3418 if (read_old_data(st, patch, name, buf))3419 return error(_("failed to read %s"), name);3420 }3421 }3422 return 0;3423}34243425/*3426 * We are about to apply "patch"; populate the "image" with the3427 * current version we have, from the working tree or from the index,3428 * depending on the situation e.g. --cached/--index. If we are3429 * applying a non-git patch that incrementally updates the tree,3430 * we read from the result of a previous diff.3431 */3432static int load_preimage(struct apply_state *state,3433 struct image *image,3434 struct patch *patch, struct stat *st,3435 const struct cache_entry *ce)3436{3437 struct strbuf buf = STRBUF_INIT;3438 size_t len;3439 char *img;3440 struct patch *previous;3441 int status;34423443 previous = previous_patch(state, patch, &status);3444 if (status)3445 return error(_("path %s has been renamed/deleted"),3446 patch->old_name);3447 if (previous) {3448 /* We have a patched copy in memory; use that. */3449 strbuf_add(&buf, previous->result, previous->resultsize);3450 } else {3451 status = load_patch_target(state, &buf, ce, st, patch,3452 patch->old_name, patch->old_mode);3453 if (status < 0)3454 return status;3455 else if (status == SUBMODULE_PATCH_WITHOUT_INDEX) {3456 /*3457 * There is no way to apply subproject3458 * patch without looking at the index.3459 * NEEDSWORK: shouldn't this be flagged3460 * as an error???3461 */3462 free_fragment_list(patch->fragments);3463 patch->fragments = NULL;3464 } else if (status) {3465 return error(_("failed to read %s"), patch->old_name);3466 }3467 }34683469 img = strbuf_detach(&buf, &len);3470 prepare_image(image, img, len, !patch->is_binary);3471 return 0;3472}34733474static int three_way_merge(struct apply_state *state,3475 struct image *image,3476 char *path,3477 const struct object_id *base,3478 const struct object_id *ours,3479 const struct object_id *theirs)3480{3481 mmfile_t base_file, our_file, their_file;3482 mmbuffer_t result = { NULL };3483 int status;34843485 read_mmblob(&base_file, base);3486 read_mmblob(&our_file, ours);3487 read_mmblob(&their_file, theirs);3488 status = ll_merge(&result, path,3489 &base_file, "base",3490 &our_file, "ours",3491 &their_file, "theirs",3492 state->repo->index,3493 NULL);3494 free(base_file.ptr);3495 free(our_file.ptr);3496 free(their_file.ptr);3497 if (status < 0 || !result.ptr) {3498 free(result.ptr);3499 return -1;3500 }3501 clear_image(image);3502 image->buf = result.ptr;3503 image->len = result.size;35043505 return status;3506}35073508/*3509 * When directly falling back to add/add three-way merge, we read from3510 * the current contents of the new_name. In no cases other than that3511 * this function will be called.3512 */3513static int load_current(struct apply_state *state,3514 struct image *image,3515 struct patch *patch)3516{3517 struct strbuf buf = STRBUF_INIT;3518 int status, pos;3519 size_t len;3520 char *img;3521 struct stat st;3522 struct cache_entry *ce;3523 char *name = patch->new_name;3524 unsigned mode = patch->new_mode;35253526 if (!patch->is_new)3527 BUG("patch to %s is not a creation", patch->old_name);35283529 pos = index_name_pos(state->repo->index, name, strlen(name));3530 if (pos < 0)3531 return error(_("%s: does not exist in index"), name);3532 ce = state->repo->index->cache[pos];3533 if (lstat(name, &st)) {3534 if (errno != ENOENT)3535 return error_errno("%s", name);3536 if (checkout_target(state->repo->index, ce, &st))3537 return -1;3538 }3539 if (verify_index_match(state, ce, &st))3540 return error(_("%s: does not match index"), name);35413542 status = load_patch_target(state, &buf, ce, &st, patch, name, mode);3543 if (status < 0)3544 return status;3545 else if (status)3546 return -1;3547 img = strbuf_detach(&buf, &len);3548 prepare_image(image, img, len, !patch->is_binary);3549 return 0;3550}35513552static int try_threeway(struct apply_state *state,3553 struct image *image,3554 struct patch *patch,3555 struct stat *st,3556 const struct cache_entry *ce)3557{3558 struct object_id pre_oid, post_oid, our_oid;3559 struct strbuf buf = STRBUF_INIT;3560 size_t len;3561 int status;3562 char *img;3563 struct image tmp_image;35643565 /* No point falling back to 3-way merge in these cases */3566 if (patch->is_delete ||3567 S_ISGITLINK(patch->old_mode) || S_ISGITLINK(patch->new_mode))3568 return -1;35693570 /* Preimage the patch was prepared for */3571 if (patch->is_new)3572 write_object_file("", 0, blob_type, &pre_oid);3573 else if (get_oid(patch->old_oid_prefix, &pre_oid) ||3574 read_blob_object(&buf, &pre_oid, patch->old_mode))3575 return error(_("repository lacks the necessary blob to fall back on 3-way merge."));35763577 if (state->apply_verbosity > verbosity_silent)3578 fprintf(stderr, _("Falling back to three-way merge...\n"));35793580 img = strbuf_detach(&buf, &len);3581 prepare_image(&tmp_image, img, len, 1);3582 /* Apply the patch to get the post image */3583 if (apply_fragments(state, &tmp_image, patch) < 0) {3584 clear_image(&tmp_image);3585 return -1;3586 }3587 /* post_oid is theirs */3588 write_object_file(tmp_image.buf, tmp_image.len, blob_type, &post_oid);3589 clear_image(&tmp_image);35903591 /* our_oid is ours */3592 if (patch->is_new) {3593 if (load_current(state, &tmp_image, patch))3594 return error(_("cannot read the current contents of '%s'"),3595 patch->new_name);3596 } else {3597 if (load_preimage(state, &tmp_image, patch, st, ce))3598 return error(_("cannot read the current contents of '%s'"),3599 patch->old_name);3600 }3601 write_object_file(tmp_image.buf, tmp_image.len, blob_type, &our_oid);3602 clear_image(&tmp_image);36033604 /* in-core three-way merge between post and our using pre as base */3605 status = three_way_merge(state, image, patch->new_name,3606 &pre_oid, &our_oid, &post_oid);3607 if (status < 0) {3608 if (state->apply_verbosity > verbosity_silent)3609 fprintf(stderr,3610 _("Failed to fall back on three-way merge...\n"));3611 return status;3612 }36133614 if (status) {3615 patch->conflicted_threeway = 1;3616 if (patch->is_new)3617 oidclr(&patch->threeway_stage[0]);3618 else3619 oidcpy(&patch->threeway_stage[0], &pre_oid);3620 oidcpy(&patch->threeway_stage[1], &our_oid);3621 oidcpy(&patch->threeway_stage[2], &post_oid);3622 if (state->apply_verbosity > verbosity_silent)3623 fprintf(stderr,3624 _("Applied patch to '%s' with conflicts.\n"),3625 patch->new_name);3626 } else {3627 if (state->apply_verbosity > verbosity_silent)3628 fprintf(stderr,3629 _("Applied patch to '%s' cleanly.\n"),3630 patch->new_name);3631 }3632 return 0;3633}36343635static int apply_data(struct apply_state *state, struct patch *patch,3636 struct stat *st, const struct cache_entry *ce)3637{3638 struct image image;36393640 if (load_preimage(state, &image, patch, st, ce) < 0)3641 return -1;36423643 if (patch->direct_to_threeway ||3644 apply_fragments(state, &image, patch) < 0) {3645 /* Note: with --reject, apply_fragments() returns 0 */3646 if (!state->threeway || try_threeway(state, &image, patch, st, ce) < 0)3647 return -1;3648 }3649 patch->result = image.buf;3650 patch->resultsize = image.len;3651 add_to_fn_table(state, patch);3652 free(image.line_allocated);36533654 if (0 < patch->is_delete && patch->resultsize)3655 return error(_("removal patch leaves file contents"));36563657 return 0;3658}36593660/*3661 * If "patch" that we are looking at modifies or deletes what we have,3662 * we would want it not to lose any local modification we have, either3663 * in the working tree or in the index.3664 *3665 * This also decides if a non-git patch is a creation patch or a3666 * modification to an existing empty file. We do not check the state3667 * of the current tree for a creation patch in this function; the caller3668 * check_patch() separately makes sure (and errors out otherwise) that3669 * the path the patch creates does not exist in the current tree.3670 */3671static int check_preimage(struct apply_state *state,3672 struct patch *patch,3673 struct cache_entry **ce,3674 struct stat *st)3675{3676 const char *old_name = patch->old_name;3677 struct patch *previous = NULL;3678 int stat_ret = 0, status;3679 unsigned st_mode = 0;36803681 if (!old_name)3682 return 0;36833684 assert(patch->is_new <= 0);3685 previous = previous_patch(state, patch, &status);36863687 if (status)3688 return error(_("path %s has been renamed/deleted"), old_name);3689 if (previous) {3690 st_mode = previous->new_mode;3691 } else if (!state->cached) {3692 stat_ret = lstat(old_name, st);3693 if (stat_ret && errno != ENOENT)3694 return error_errno("%s", old_name);3695 }36963697 if (state->check_index && !previous) {3698 int pos = index_name_pos(state->repo->index, old_name,3699 strlen(old_name));3700 if (pos < 0) {3701 if (patch->is_new < 0)3702 goto is_new;3703 return error(_("%s: does not exist in index"), old_name);3704 }3705 *ce = state->repo->index->cache[pos];3706 if (stat_ret < 0) {3707 if (checkout_target(state->repo->index, *ce, st))3708 return -1;3709 }3710 if (!state->cached && verify_index_match(state, *ce, st))3711 return error(_("%s: does not match index"), old_name);3712 if (state->cached)3713 st_mode = (*ce)->ce_mode;3714 } else if (stat_ret < 0) {3715 if (patch->is_new < 0)3716 goto is_new;3717 return error_errno("%s", old_name);3718 }37193720 if (!state->cached && !previous)3721 st_mode = ce_mode_from_stat(*ce, st->st_mode);37223723 if (patch->is_new < 0)3724 patch->is_new = 0;3725 if (!patch->old_mode)3726 patch->old_mode = st_mode;3727 if ((st_mode ^ patch->old_mode) & S_IFMT)3728 return error(_("%s: wrong type"), old_name);3729 if (st_mode != patch->old_mode)3730 warning(_("%s has type %o, expected %o"),3731 old_name, st_mode, patch->old_mode);3732 if (!patch->new_mode && !patch->is_delete)3733 patch->new_mode = st_mode;3734 return 0;37353736 is_new:3737 patch->is_new = 1;3738 patch->is_delete = 0;3739 FREE_AND_NULL(patch->old_name);3740 return 0;3741}374237433744#define EXISTS_IN_INDEX 13745#define EXISTS_IN_WORKTREE 237463747static int check_to_create(struct apply_state *state,3748 const char *new_name,3749 int ok_if_exists)3750{3751 struct stat nst;37523753 if (state->check_index &&3754 index_name_pos(state->repo->index, new_name, strlen(new_name)) >= 0 &&3755 !ok_if_exists)3756 return EXISTS_IN_INDEX;3757 if (state->cached)3758 return 0;37593760 if (!lstat(new_name, &nst)) {3761 if (S_ISDIR(nst.st_mode) || ok_if_exists)3762 return 0;3763 /*3764 * A leading component of new_name might be a symlink3765 * that is going to be removed with this patch, but3766 * still pointing at somewhere that has the path.3767 * In such a case, path "new_name" does not exist as3768 * far as git is concerned.3769 */3770 if (has_symlink_leading_path(new_name, strlen(new_name)))3771 return 0;37723773 return EXISTS_IN_WORKTREE;3774 } else if (!is_missing_file_error(errno)) {3775 return error_errno("%s", new_name);3776 }3777 return 0;3778}37793780static uintptr_t register_symlink_changes(struct apply_state *state,3781 const char *path,3782 uintptr_t what)3783{3784 struct string_list_item *ent;37853786 ent = string_list_lookup(&state->symlink_changes, path);3787 if (!ent) {3788 ent = string_list_insert(&state->symlink_changes, path);3789 ent->util = (void *)0;3790 }3791 ent->util = (void *)(what | ((uintptr_t)ent->util));3792 return (uintptr_t)ent->util;3793}37943795static uintptr_t check_symlink_changes(struct apply_state *state, const char *path)3796{3797 struct string_list_item *ent;37983799 ent = string_list_lookup(&state->symlink_changes, path);3800 if (!ent)3801 return 0;3802 return (uintptr_t)ent->util;3803}38043805static void prepare_symlink_changes(struct apply_state *state, struct patch *patch)3806{3807 for ( ; patch; patch = patch->next) {3808 if ((patch->old_name && S_ISLNK(patch->old_mode)) &&3809 (patch->is_rename || patch->is_delete))3810 /* the symlink at patch->old_name is removed */3811 register_symlink_changes(state, patch->old_name, APPLY_SYMLINK_GOES_AWAY);38123813 if (patch->new_name && S_ISLNK(patch->new_mode))3814 /* the symlink at patch->new_name is created or remains */3815 register_symlink_changes(state, patch->new_name, APPLY_SYMLINK_IN_RESULT);3816 }3817}38183819static int path_is_beyond_symlink_1(struct apply_state *state, struct strbuf *name)3820{3821 do {3822 unsigned int change;38233824 while (--name->len && name->buf[name->len] != '/')3825 ; /* scan backwards */3826 if (!name->len)3827 break;3828 name->buf[name->len] = '\0';3829 change = check_symlink_changes(state, name->buf);3830 if (change & APPLY_SYMLINK_IN_RESULT)3831 return 1;3832 if (change & APPLY_SYMLINK_GOES_AWAY)3833 /*3834 * This cannot be "return 0", because we may3835 * see a new one created at a higher level.3836 */3837 continue;38383839 /* otherwise, check the preimage */3840 if (state->check_index) {3841 struct cache_entry *ce;38423843 ce = index_file_exists(state->repo->index, name->buf,3844 name->len, ignore_case);3845 if (ce && S_ISLNK(ce->ce_mode))3846 return 1;3847 } else {3848 struct stat st;3849 if (!lstat(name->buf, &st) && S_ISLNK(st.st_mode))3850 return 1;3851 }3852 } while (1);3853 return 0;3854}38553856static int path_is_beyond_symlink(struct apply_state *state, const char *name_)3857{3858 int ret;3859 struct strbuf name = STRBUF_INIT;38603861 assert(*name_ != '\0');3862 strbuf_addstr(&name, name_);3863 ret = path_is_beyond_symlink_1(state, &name);3864 strbuf_release(&name);38653866 return ret;3867}38683869static int check_unsafe_path(struct patch *patch)3870{3871 const char *old_name = NULL;3872 const char *new_name = NULL;3873 if (patch->is_delete)3874 old_name = patch->old_name;3875 else if (!patch->is_new && !patch->is_copy)3876 old_name = patch->old_name;3877 if (!patch->is_delete)3878 new_name = patch->new_name;38793880 if (old_name && !verify_path(old_name, patch->old_mode))3881 return error(_("invalid path '%s'"), old_name);3882 if (new_name && !verify_path(new_name, patch->new_mode))3883 return error(_("invalid path '%s'"), new_name);3884 return 0;3885}38863887/*3888 * Check and apply the patch in-core; leave the result in patch->result3889 * for the caller to write it out to the final destination.3890 */3891static int check_patch(struct apply_state *state, struct patch *patch)3892{3893 struct stat st;3894 const char *old_name = patch->old_name;3895 const char *new_name = patch->new_name;3896 const char *name = old_name ? old_name : new_name;3897 struct cache_entry *ce = NULL;3898 struct patch *tpatch;3899 int ok_if_exists;3900 int status;39013902 patch->rejected = 1; /* we will drop this after we succeed */39033904 status = check_preimage(state, patch, &ce, &st);3905 if (status)3906 return status;3907 old_name = patch->old_name;39083909 /*3910 * A type-change diff is always split into a patch to delete3911 * old, immediately followed by a patch to create new (see3912 * diff.c::run_diff()); in such a case it is Ok that the entry3913 * to be deleted by the previous patch is still in the working3914 * tree and in the index.3915 *3916 * A patch to swap-rename between A and B would first rename A3917 * to B and then rename B to A. While applying the first one,3918 * the presence of B should not stop A from getting renamed to3919 * B; ask to_be_deleted() about the later rename. Removal of3920 * B and rename from A to B is handled the same way by asking3921 * was_deleted().3922 */3923 if ((tpatch = in_fn_table(state, new_name)) &&3924 (was_deleted(tpatch) || to_be_deleted(tpatch)))3925 ok_if_exists = 1;3926 else3927 ok_if_exists = 0;39283929 if (new_name &&3930 ((0 < patch->is_new) || patch->is_rename || patch->is_copy)) {3931 int err = check_to_create(state, new_name, ok_if_exists);39323933 if (err && state->threeway) {3934 patch->direct_to_threeway = 1;3935 } else switch (err) {3936 case 0:3937 break; /* happy */3938 case EXISTS_IN_INDEX:3939 return error(_("%s: already exists in index"), new_name);3940 break;3941 case EXISTS_IN_WORKTREE:3942 return error(_("%s: already exists in working directory"),3943 new_name);3944 default:3945 return err;3946 }39473948 if (!patch->new_mode) {3949 if (0 < patch->is_new)3950 patch->new_mode = S_IFREG | 0644;3951 else3952 patch->new_mode = patch->old_mode;3953 }3954 }39553956 if (new_name && old_name) {3957 int same = !strcmp(old_name, new_name);3958 if (!patch->new_mode)3959 patch->new_mode = patch->old_mode;3960 if ((patch->old_mode ^ patch->new_mode) & S_IFMT) {3961 if (same)3962 return error(_("new mode (%o) of %s does not "3963 "match old mode (%o)"),3964 patch->new_mode, new_name,3965 patch->old_mode);3966 else3967 return error(_("new mode (%o) of %s does not "3968 "match old mode (%o) of %s"),3969 patch->new_mode, new_name,3970 patch->old_mode, old_name);3971 }3972 }39733974 if (!state->unsafe_paths && check_unsafe_path(patch))3975 return -128;39763977 /*3978 * An attempt to read from or delete a path that is beyond a3979 * symbolic link will be prevented by load_patch_target() that3980 * is called at the beginning of apply_data() so we do not3981 * have to worry about a patch marked with "is_delete" bit3982 * here. We however need to make sure that the patch result3983 * is not deposited to a path that is beyond a symbolic link3984 * here.3985 */3986 if (!patch->is_delete && path_is_beyond_symlink(state, patch->new_name))3987 return error(_("affected file '%s' is beyond a symbolic link"),3988 patch->new_name);39893990 if (apply_data(state, patch, &st, ce) < 0)3991 return error(_("%s: patch does not apply"), name);3992 patch->rejected = 0;3993 return 0;3994}39953996static int check_patch_list(struct apply_state *state, struct patch *patch)3997{3998 int err = 0;39994000 prepare_symlink_changes(state, patch);4001 prepare_fn_table(state, patch);4002 while (patch) {4003 int res;4004 if (state->apply_verbosity > verbosity_normal)4005 say_patch_name(stderr,4006 _("Checking patch %s..."), patch);4007 res = check_patch(state, patch);4008 if (res == -128)4009 return -128;4010 err |= res;4011 patch = patch->next;4012 }4013 return err;4014}40154016static int read_apply_cache(struct apply_state *state)4017{4018 if (state->index_file)4019 return read_index_from(state->repo->index, state->index_file,4020 get_git_dir());4021 else4022 return read_index(state->repo->index);4023}40244025/* This function tries to read the object name from the current index */4026static int get_current_oid(struct apply_state *state, const char *path,4027 struct object_id *oid)4028{4029 int pos;40304031 if (read_apply_cache(state) < 0)4032 return -1;4033 pos = index_name_pos(state->repo->index, path, strlen(path));4034 if (pos < 0)4035 return -1;4036 oidcpy(oid, &state->repo->index->cache[pos]->oid);4037 return 0;4038}40394040static int preimage_oid_in_gitlink_patch(struct patch *p, struct object_id *oid)4041{4042 /*4043 * A usable gitlink patch has only one fragment (hunk) that looks like:4044 * @@ -1 +1 @@4045 * -Subproject commit <old sha1>4046 * +Subproject commit <new sha1>4047 * or4048 * @@ -1 +0,0 @@4049 * -Subproject commit <old sha1>4050 * for a removal patch.4051 */4052 struct fragment *hunk = p->fragments;4053 static const char heading[] = "-Subproject commit ";4054 char *preimage;40554056 if (/* does the patch have only one hunk? */4057 hunk && !hunk->next &&4058 /* is its preimage one line? */4059 hunk->oldpos == 1 && hunk->oldlines == 1 &&4060 /* does preimage begin with the heading? */4061 (preimage = memchr(hunk->patch, '\n', hunk->size)) != NULL &&4062 starts_with(++preimage, heading) &&4063 /* does it record full SHA-1? */4064 !get_oid_hex(preimage + sizeof(heading) - 1, oid) &&4065 preimage[sizeof(heading) + the_hash_algo->hexsz - 1] == '\n' &&4066 /* does the abbreviated name on the index line agree with it? */4067 starts_with(preimage + sizeof(heading) - 1, p->old_oid_prefix))4068 return 0; /* it all looks fine */40694070 /* we may have full object name on the index line */4071 return get_oid_hex(p->old_oid_prefix, oid);4072}40734074/* Build an index that contains just the files needed for a 3way merge */4075static int build_fake_ancestor(struct apply_state *state, struct patch *list)4076{4077 struct patch *patch;4078 struct index_state result = { NULL };4079 struct lock_file lock = LOCK_INIT;4080 int res;40814082 /* Once we start supporting the reverse patch, it may be4083 * worth showing the new sha1 prefix, but until then...4084 */4085 for (patch = list; patch; patch = patch->next) {4086 struct object_id oid;4087 struct cache_entry *ce;4088 const char *name;40894090 name = patch->old_name ? patch->old_name : patch->new_name;4091 if (0 < patch->is_new)4092 continue;40934094 if (S_ISGITLINK(patch->old_mode)) {4095 if (!preimage_oid_in_gitlink_patch(patch, &oid))4096 ; /* ok, the textual part looks sane */4097 else4098 return error(_("sha1 information is lacking or "4099 "useless for submodule %s"), name);4100 } else if (!get_oid_blob(patch->old_oid_prefix, &oid)) {4101 ; /* ok */4102 } else if (!patch->lines_added && !patch->lines_deleted) {4103 /* mode-only change: update the current */4104 if (get_current_oid(state, patch->old_name, &oid))4105 return error(_("mode change for %s, which is not "4106 "in current HEAD"), name);4107 } else4108 return error(_("sha1 information is lacking or useless "4109 "(%s)."), name);41104111 ce = make_cache_entry(&result, patch->old_mode, &oid, name, 0, 0);4112 if (!ce)4113 return error(_("make_cache_entry failed for path '%s'"),4114 name);4115 if (add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD)) {4116 discard_cache_entry(ce);4117 return error(_("could not add %s to temporary index"),4118 name);4119 }4120 }41214122 hold_lock_file_for_update(&lock, state->fake_ancestor, LOCK_DIE_ON_ERROR);4123 res = write_locked_index(&result, &lock, COMMIT_LOCK);4124 discard_index(&result);41254126 if (res)4127 return error(_("could not write temporary index to %s"),4128 state->fake_ancestor);41294130 return 0;4131}41324133static void stat_patch_list(struct apply_state *state, struct patch *patch)4134{4135 int files, adds, dels;41364137 for (files = adds = dels = 0 ; patch ; patch = patch->next) {4138 files++;4139 adds += patch->lines_added;4140 dels += patch->lines_deleted;4141 show_stats(state, patch);4142 }41434144 print_stat_summary(stdout, files, adds, dels);4145}41464147static void numstat_patch_list(struct apply_state *state,4148 struct patch *patch)4149{4150 for ( ; patch; patch = patch->next) {4151 const char *name;4152 name = patch->new_name ? patch->new_name : patch->old_name;4153 if (patch->is_binary)4154 printf("-\t-\t");4155 else4156 printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);4157 write_name_quoted(name, stdout, state->line_termination);4158 }4159}41604161static void show_file_mode_name(const char *newdelete, unsigned int mode, const char *name)4162{4163 if (mode)4164 printf(" %s mode %06o %s\n", newdelete, mode, name);4165 else4166 printf(" %s %s\n", newdelete, name);4167}41684169static void show_mode_change(struct patch *p, int show_name)4170{4171 if (p->old_mode && p->new_mode && p->old_mode != p->new_mode) {4172 if (show_name)4173 printf(" mode change %06o => %06o %s\n",4174 p->old_mode, p->new_mode, p->new_name);4175 else4176 printf(" mode change %06o => %06o\n",4177 p->old_mode, p->new_mode);4178 }4179}41804181static void show_rename_copy(struct patch *p)4182{4183 const char *renamecopy = p->is_rename ? "rename" : "copy";4184 const char *old_name, *new_name;41854186 /* Find common prefix */4187 old_name = p->old_name;4188 new_name = p->new_name;4189 while (1) {4190 const char *slash_old, *slash_new;4191 slash_old = strchr(old_name, '/');4192 slash_new = strchr(new_name, '/');4193 if (!slash_old ||4194 !slash_new ||4195 slash_old - old_name != slash_new - new_name ||4196 memcmp(old_name, new_name, slash_new - new_name))4197 break;4198 old_name = slash_old + 1;4199 new_name = slash_new + 1;4200 }4201 /* p->old_name thru old_name is the common prefix, and old_name and new_name4202 * through the end of names are renames4203 */4204 if (old_name != p->old_name)4205 printf(" %s %.*s{%s => %s} (%d%%)\n", renamecopy,4206 (int)(old_name - p->old_name), p->old_name,4207 old_name, new_name, p->score);4208 else4209 printf(" %s %s => %s (%d%%)\n", renamecopy,4210 p->old_name, p->new_name, p->score);4211 show_mode_change(p, 0);4212}42134214static void summary_patch_list(struct patch *patch)4215{4216 struct patch *p;42174218 for (p = patch; p; p = p->next) {4219 if (p->is_new)4220 show_file_mode_name("create", p->new_mode, p->new_name);4221 else if (p->is_delete)4222 show_file_mode_name("delete", p->old_mode, p->old_name);4223 else {4224 if (p->is_rename || p->is_copy)4225 show_rename_copy(p);4226 else {4227 if (p->score) {4228 printf(" rewrite %s (%d%%)\n",4229 p->new_name, p->score);4230 show_mode_change(p, 0);4231 }4232 else4233 show_mode_change(p, 1);4234 }4235 }4236 }4237}42384239static void patch_stats(struct apply_state *state, struct patch *patch)4240{4241 int lines = patch->lines_added + patch->lines_deleted;42424243 if (lines > state->max_change)4244 state->max_change = lines;4245 if (patch->old_name) {4246 int len = quote_c_style(patch->old_name, NULL, NULL, 0);4247 if (!len)4248 len = strlen(patch->old_name);4249 if (len > state->max_len)4250 state->max_len = len;4251 }4252 if (patch->new_name) {4253 int len = quote_c_style(patch->new_name, NULL, NULL, 0);4254 if (!len)4255 len = strlen(patch->new_name);4256 if (len > state->max_len)4257 state->max_len = len;4258 }4259}42604261static int remove_file(struct apply_state *state, struct patch *patch, int rmdir_empty)4262{4263 if (state->update_index && !state->ita_only) {4264 if (remove_file_from_index(state->repo->index, patch->old_name) < 0)4265 return error(_("unable to remove %s from index"), patch->old_name);4266 }4267 if (!state->cached) {4268 if (!remove_or_warn(patch->old_mode, patch->old_name) && rmdir_empty) {4269 remove_path(patch->old_name);4270 }4271 }4272 return 0;4273}42744275static int add_index_file(struct apply_state *state,4276 const char *path,4277 unsigned mode,4278 void *buf,4279 unsigned long size)4280{4281 struct stat st;4282 struct cache_entry *ce;4283 int namelen = strlen(path);42844285 ce = make_empty_cache_entry(state->repo->index, namelen);4286 memcpy(ce->name, path, namelen);4287 ce->ce_mode = create_ce_mode(mode);4288 ce->ce_flags = create_ce_flags(0);4289 ce->ce_namelen = namelen;4290 if (state->ita_only) {4291 ce->ce_flags |= CE_INTENT_TO_ADD;4292 set_object_name_for_intent_to_add_entry(ce);4293 } else if (S_ISGITLINK(mode)) {4294 const char *s;42954296 if (!skip_prefix(buf, "Subproject commit ", &s) ||4297 get_oid_hex(s, &ce->oid)) {4298 discard_cache_entry(ce);4299 return error(_("corrupt patch for submodule %s"), path);4300 }4301 } else {4302 if (!state->cached) {4303 if (lstat(path, &st) < 0) {4304 discard_cache_entry(ce);4305 return error_errno(_("unable to stat newly "4306 "created file '%s'"),4307 path);4308 }4309 fill_stat_cache_info(ce, &st);4310 }4311 if (write_object_file(buf, size, blob_type, &ce->oid) < 0) {4312 discard_cache_entry(ce);4313 return error(_("unable to create backing store "4314 "for newly created file %s"), path);4315 }4316 }4317 if (add_index_entry(state->repo->index, ce, ADD_CACHE_OK_TO_ADD) < 0) {4318 discard_cache_entry(ce);4319 return error(_("unable to add cache entry for %s"), path);4320 }43214322 return 0;4323}43244325/*4326 * Returns:4327 * -1 if an unrecoverable error happened4328 * 0 if everything went well4329 * 1 if a recoverable error happened4330 */4331static int try_create_file(struct apply_state *state, const char *path,4332 unsigned int mode, const char *buf,4333 unsigned long size)4334{4335 int fd, res;4336 struct strbuf nbuf = STRBUF_INIT;43374338 if (S_ISGITLINK(mode)) {4339 struct stat st;4340 if (!lstat(path, &st) && S_ISDIR(st.st_mode))4341 return 0;4342 return !!mkdir(path, 0777);4343 }43444345 if (has_symlinks && S_ISLNK(mode))4346 /* Although buf:size is counted string, it also is NUL4347 * terminated.4348 */4349 return !!symlink(buf, path);43504351 fd = open(path, O_CREAT | O_EXCL | O_WRONLY, (mode & 0100) ? 0777 : 0666);4352 if (fd < 0)4353 return 1;43544355 if (convert_to_working_tree(state->repo->index, path, buf, size, &nbuf)) {4356 size = nbuf.len;4357 buf = nbuf.buf;4358 }43594360 res = write_in_full(fd, buf, size) < 0;4361 if (res)4362 error_errno(_("failed to write to '%s'"), path);4363 strbuf_release(&nbuf);43644365 if (close(fd) < 0 && !res)4366 return error_errno(_("closing file '%s'"), path);43674368 return res ? -1 : 0;4369}43704371/*4372 * We optimistically assume that the directories exist,4373 * which is true 99% of the time anyway. If they don't,4374 * we create them and try again.4375 *4376 * Returns:4377 * -1 on error4378 * 0 otherwise4379 */4380static int create_one_file(struct apply_state *state,4381 char *path,4382 unsigned mode,4383 const char *buf,4384 unsigned long size)4385{4386 int res;43874388 if (state->cached)4389 return 0;43904391 res = try_create_file(state, path, mode, buf, size);4392 if (res < 0)4393 return -1;4394 if (!res)4395 return 0;43964397 if (errno == ENOENT) {4398 if (safe_create_leading_directories(path))4399 return 0;4400 res = try_create_file(state, path, mode, buf, size);4401 if (res < 0)4402 return -1;4403 if (!res)4404 return 0;4405 }44064407 if (errno == EEXIST || errno == EACCES) {4408 /* We may be trying to create a file where a directory4409 * used to be.4410 */4411 struct stat st;4412 if (!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))4413 errno = EEXIST;4414 }44154416 if (errno == EEXIST) {4417 unsigned int nr = getpid();44184419 for (;;) {4420 char newpath[PATH_MAX];4421 mksnpath(newpath, sizeof(newpath), "%s~%u", path, nr);4422 res = try_create_file(state, newpath, mode, buf, size);4423 if (res < 0)4424 return -1;4425 if (!res) {4426 if (!rename(newpath, path))4427 return 0;4428 unlink_or_warn(newpath);4429 break;4430 }4431 if (errno != EEXIST)4432 break;4433 ++nr;4434 }4435 }4436 return error_errno(_("unable to write file '%s' mode %o"),4437 path, mode);4438}44394440static int add_conflicted_stages_file(struct apply_state *state,4441 struct patch *patch)4442{4443 int stage, namelen;4444 unsigned mode;4445 struct cache_entry *ce;44464447 if (!state->update_index)4448 return 0;4449 namelen = strlen(patch->new_name);4450 mode = patch->new_mode ? patch->new_mode : (S_IFREG | 0644);44514452 remove_file_from_index(state->repo->index, patch->new_name);4453 for (stage = 1; stage < 4; stage++) {4454 if (is_null_oid(&patch->threeway_stage[stage - 1]))4455 continue;4456 ce = make_empty_cache_entry(state->repo->index, namelen);4457 memcpy(ce->name, patch->new_name, namelen);4458 ce->ce_mode = create_ce_mode(mode);4459 ce->ce_flags = create_ce_flags(stage);4460 ce->ce_namelen = namelen;4461 oidcpy(&ce->oid, &patch->threeway_stage[stage - 1]);4462 if (add_index_entry(state->repo->index, ce, ADD_CACHE_OK_TO_ADD) < 0) {4463 discard_cache_entry(ce);4464 return error(_("unable to add cache entry for %s"),4465 patch->new_name);4466 }4467 }44684469 return 0;4470}44714472static int create_file(struct apply_state *state, struct patch *patch)4473{4474 char *path = patch->new_name;4475 unsigned mode = patch->new_mode;4476 unsigned long size = patch->resultsize;4477 char *buf = patch->result;44784479 if (!mode)4480 mode = S_IFREG | 0644;4481 if (create_one_file(state, path, mode, buf, size))4482 return -1;44834484 if (patch->conflicted_threeway)4485 return add_conflicted_stages_file(state, patch);4486 else if (state->update_index)4487 return add_index_file(state, path, mode, buf, size);4488 return 0;4489}44904491/* phase zero is to remove, phase one is to create */4492static int write_out_one_result(struct apply_state *state,4493 struct patch *patch,4494 int phase)4495{4496 if (patch->is_delete > 0) {4497 if (phase == 0)4498 return remove_file(state, patch, 1);4499 return 0;4500 }4501 if (patch->is_new > 0 || patch->is_copy) {4502 if (phase == 1)4503 return create_file(state, patch);4504 return 0;4505 }4506 /*4507 * Rename or modification boils down to the same4508 * thing: remove the old, write the new4509 */4510 if (phase == 0)4511 return remove_file(state, patch, patch->is_rename);4512 if (phase == 1)4513 return create_file(state, patch);4514 return 0;4515}45164517static int write_out_one_reject(struct apply_state *state, struct patch *patch)4518{4519 FILE *rej;4520 char namebuf[PATH_MAX];4521 struct fragment *frag;4522 int cnt = 0;4523 struct strbuf sb = STRBUF_INIT;45244525 for (cnt = 0, frag = patch->fragments; frag; frag = frag->next) {4526 if (!frag->rejected)4527 continue;4528 cnt++;4529 }45304531 if (!cnt) {4532 if (state->apply_verbosity > verbosity_normal)4533 say_patch_name(stderr,4534 _("Applied patch %s cleanly."), patch);4535 return 0;4536 }45374538 /* This should not happen, because a removal patch that leaves4539 * contents are marked "rejected" at the patch level.4540 */4541 if (!patch->new_name)4542 die(_("internal error"));45434544 /* Say this even without --verbose */4545 strbuf_addf(&sb, Q_("Applying patch %%s with %d reject...",4546 "Applying patch %%s with %d rejects...",4547 cnt),4548 cnt);4549 if (state->apply_verbosity > verbosity_silent)4550 say_patch_name(stderr, sb.buf, patch);4551 strbuf_release(&sb);45524553 cnt = strlen(patch->new_name);4554 if (ARRAY_SIZE(namebuf) <= cnt + 5) {4555 cnt = ARRAY_SIZE(namebuf) - 5;4556 warning(_("truncating .rej filename to %.*s.rej"),4557 cnt - 1, patch->new_name);4558 }4559 memcpy(namebuf, patch->new_name, cnt);4560 memcpy(namebuf + cnt, ".rej", 5);45614562 rej = fopen(namebuf, "w");4563 if (!rej)4564 return error_errno(_("cannot open %s"), namebuf);45654566 /* Normal git tools never deal with .rej, so do not pretend4567 * this is a git patch by saying --git or giving extended4568 * headers. While at it, maybe please "kompare" that wants4569 * the trailing TAB and some garbage at the end of line ;-).4570 */4571 fprintf(rej, "diff a/%s b/%s\t(rejected hunks)\n",4572 patch->new_name, patch->new_name);4573 for (cnt = 1, frag = patch->fragments;4574 frag;4575 cnt++, frag = frag->next) {4576 if (!frag->rejected) {4577 if (state->apply_verbosity > verbosity_silent)4578 fprintf_ln(stderr, _("Hunk #%d applied cleanly."), cnt);4579 continue;4580 }4581 if (state->apply_verbosity > verbosity_silent)4582 fprintf_ln(stderr, _("Rejected hunk #%d."), cnt);4583 fprintf(rej, "%.*s", frag->size, frag->patch);4584 if (frag->patch[frag->size-1] != '\n')4585 fputc('\n', rej);4586 }4587 fclose(rej);4588 return -1;4589}45904591/*4592 * Returns:4593 * -1 if an error happened4594 * 0 if the patch applied cleanly4595 * 1 if the patch did not apply cleanly4596 */4597static int write_out_results(struct apply_state *state, struct patch *list)4598{4599 int phase;4600 int errs = 0;4601 struct patch *l;4602 struct string_list cpath = STRING_LIST_INIT_DUP;46034604 for (phase = 0; phase < 2; phase++) {4605 l = list;4606 while (l) {4607 if (l->rejected)4608 errs = 1;4609 else {4610 if (write_out_one_result(state, l, phase)) {4611 string_list_clear(&cpath, 0);4612 return -1;4613 }4614 if (phase == 1) {4615 if (write_out_one_reject(state, l))4616 errs = 1;4617 if (l->conflicted_threeway) {4618 string_list_append(&cpath, l->new_name);4619 errs = 1;4620 }4621 }4622 }4623 l = l->next;4624 }4625 }46264627 if (cpath.nr) {4628 struct string_list_item *item;46294630 string_list_sort(&cpath);4631 if (state->apply_verbosity > verbosity_silent) {4632 for_each_string_list_item(item, &cpath)4633 fprintf(stderr, "U %s\n", item->string);4634 }4635 string_list_clear(&cpath, 0);46364637 repo_rerere(state->repo, 0);4638 }46394640 return errs;4641}46424643/*4644 * Try to apply a patch.4645 *4646 * Returns:4647 * -128 if a bad error happened (like patch unreadable)4648 * -1 if patch did not apply and user cannot deal with it4649 * 0 if the patch applied4650 * 1 if the patch did not apply but user might fix it4651 */4652static int apply_patch(struct apply_state *state,4653 int fd,4654 const char *filename,4655 int options)4656{4657 size_t offset;4658 struct strbuf buf = STRBUF_INIT; /* owns the patch text */4659 struct patch *list = NULL, **listp = &list;4660 int skipped_patch = 0;4661 int res = 0;46624663 state->patch_input_file = filename;4664 if (read_patch_file(&buf, fd) < 0)4665 return -128;4666 offset = 0;4667 while (offset < buf.len) {4668 struct patch *patch;4669 int nr;46704671 patch = xcalloc(1, sizeof(*patch));4672 patch->inaccurate_eof = !!(options & APPLY_OPT_INACCURATE_EOF);4673 patch->recount = !!(options & APPLY_OPT_RECOUNT);4674 nr = parse_chunk(state, buf.buf + offset, buf.len - offset, patch);4675 if (nr < 0) {4676 free_patch(patch);4677 if (nr == -128) {4678 res = -128;4679 goto end;4680 }4681 break;4682 }4683 if (state->apply_in_reverse)4684 reverse_patches(patch);4685 if (use_patch(state, patch)) {4686 patch_stats(state, patch);4687 *listp = patch;4688 listp = &patch->next;4689 }4690 else {4691 if (state->apply_verbosity > verbosity_normal)4692 say_patch_name(stderr, _("Skipped patch '%s'."), patch);4693 free_patch(patch);4694 skipped_patch++;4695 }4696 offset += nr;4697 }46984699 if (!list && !skipped_patch) {4700 error(_("unrecognized input"));4701 res = -128;4702 goto end;4703 }47044705 if (state->whitespace_error && (state->ws_error_action == die_on_ws_error))4706 state->apply = 0;47074708 state->update_index = (state->check_index || state->ita_only) && state->apply;4709 if (state->update_index && !is_lock_file_locked(&state->lock_file)) {4710 if (state->index_file)4711 hold_lock_file_for_update(&state->lock_file,4712 state->index_file,4713 LOCK_DIE_ON_ERROR);4714 else4715 hold_locked_index(&state->lock_file, LOCK_DIE_ON_ERROR);4716 }47174718 if (state->check_index && read_apply_cache(state) < 0) {4719 error(_("unable to read index file"));4720 res = -128;4721 goto end;4722 }47234724 if (state->check || state->apply) {4725 int r = check_patch_list(state, list);4726 if (r == -128) {4727 res = -128;4728 goto end;4729 }4730 if (r < 0 && !state->apply_with_reject) {4731 res = -1;4732 goto end;4733 }4734 }47354736 if (state->apply) {4737 int write_res = write_out_results(state, list);4738 if (write_res < 0) {4739 res = -128;4740 goto end;4741 }4742 if (write_res > 0) {4743 /* with --3way, we still need to write the index out */4744 res = state->apply_with_reject ? -1 : 1;4745 goto end;4746 }4747 }47484749 if (state->fake_ancestor &&4750 build_fake_ancestor(state, list)) {4751 res = -128;4752 goto end;4753 }47544755 if (state->diffstat && state->apply_verbosity > verbosity_silent)4756 stat_patch_list(state, list);47574758 if (state->numstat && state->apply_verbosity > verbosity_silent)4759 numstat_patch_list(state, list);47604761 if (state->summary && state->apply_verbosity > verbosity_silent)4762 summary_patch_list(list);47634764end:4765 free_patch_list(list);4766 strbuf_release(&buf);4767 string_list_clear(&state->fn_table, 0);4768 return res;4769}47704771static int apply_option_parse_exclude(const struct option *opt,4772 const char *arg, int unset)4773{4774 struct apply_state *state = opt->value;47754776 BUG_ON_OPT_NEG(unset);47774778 add_name_limit(state, arg, 1);4779 return 0;4780}47814782static int apply_option_parse_include(const struct option *opt,4783 const char *arg, int unset)4784{4785 struct apply_state *state = opt->value;47864787 BUG_ON_OPT_NEG(unset);47884789 add_name_limit(state, arg, 0);4790 state->has_include = 1;4791 return 0;4792}47934794static int apply_option_parse_p(const struct option *opt,4795 const char *arg,4796 int unset)4797{4798 struct apply_state *state = opt->value;47994800 BUG_ON_OPT_NEG(unset);48014802 state->p_value = atoi(arg);4803 state->p_value_known = 1;4804 return 0;4805}48064807static int apply_option_parse_space_change(const struct option *opt,4808 const char *arg, int unset)4809{4810 struct apply_state *state = opt->value;48114812 BUG_ON_OPT_ARG(arg);48134814 if (unset)4815 state->ws_ignore_action = ignore_ws_none;4816 else4817 state->ws_ignore_action = ignore_ws_change;4818 return 0;4819}48204821static int apply_option_parse_whitespace(const struct option *opt,4822 const char *arg, int unset)4823{4824 struct apply_state *state = opt->value;48254826 BUG_ON_OPT_NEG(unset);48274828 state->whitespace_option = arg;4829 if (parse_whitespace_option(state, arg))4830 return -1;4831 return 0;4832}48334834static int apply_option_parse_directory(const struct option *opt,4835 const char *arg, int unset)4836{4837 struct apply_state *state = opt->value;48384839 BUG_ON_OPT_NEG(unset);48404841 strbuf_reset(&state->root);4842 strbuf_addstr(&state->root, arg);4843 strbuf_complete(&state->root, '/');4844 return 0;4845}48464847int apply_all_patches(struct apply_state *state,4848 int argc,4849 const char **argv,4850 int options)4851{4852 int i;4853 int res;4854 int errs = 0;4855 int read_stdin = 1;48564857 for (i = 0; i < argc; i++) {4858 const char *arg = argv[i];4859 char *to_free = NULL;4860 int fd;48614862 if (!strcmp(arg, "-")) {4863 res = apply_patch(state, 0, "<stdin>", options);4864 if (res < 0)4865 goto end;4866 errs |= res;4867 read_stdin = 0;4868 continue;4869 } else4870 arg = to_free = prefix_filename(state->prefix, arg);48714872 fd = open(arg, O_RDONLY);4873 if (fd < 0) {4874 error(_("can't open patch '%s': %s"), arg, strerror(errno));4875 res = -128;4876 free(to_free);4877 goto end;4878 }4879 read_stdin = 0;4880 set_default_whitespace_mode(state);4881 res = apply_patch(state, fd, arg, options);4882 close(fd);4883 free(to_free);4884 if (res < 0)4885 goto end;4886 errs |= res;4887 }4888 set_default_whitespace_mode(state);4889 if (read_stdin) {4890 res = apply_patch(state, 0, "<stdin>", options);4891 if (res < 0)4892 goto end;4893 errs |= res;4894 }48954896 if (state->whitespace_error) {4897 if (state->squelch_whitespace_errors &&4898 state->squelch_whitespace_errors < state->whitespace_error) {4899 int squelched =4900 state->whitespace_error - state->squelch_whitespace_errors;4901 warning(Q_("squelched %d whitespace error",4902 "squelched %d whitespace errors",4903 squelched),4904 squelched);4905 }4906 if (state->ws_error_action == die_on_ws_error) {4907 error(Q_("%d line adds whitespace errors.",4908 "%d lines add whitespace errors.",4909 state->whitespace_error),4910 state->whitespace_error);4911 res = -128;4912 goto end;4913 }4914 if (state->applied_after_fixing_ws && state->apply)4915 warning(Q_("%d line applied after"4916 " fixing whitespace errors.",4917 "%d lines applied after"4918 " fixing whitespace errors.",4919 state->applied_after_fixing_ws),4920 state->applied_after_fixing_ws);4921 else if (state->whitespace_error)4922 warning(Q_("%d line adds whitespace errors.",4923 "%d lines add whitespace errors.",4924 state->whitespace_error),4925 state->whitespace_error);4926 }49274928 if (state->update_index) {4929 res = write_locked_index(state->repo->index, &state->lock_file, COMMIT_LOCK);4930 if (res) {4931 error(_("Unable to write new index file"));4932 res = -128;4933 goto end;4934 }4935 }49364937 res = !!errs;49384939end:4940 rollback_lock_file(&state->lock_file);49414942 if (state->apply_verbosity <= verbosity_silent) {4943 set_error_routine(state->saved_error_routine);4944 set_warn_routine(state->saved_warn_routine);4945 }49464947 if (res > -1)4948 return res;4949 return (res == -1 ? 1 : 128);4950}49514952int apply_parse_options(int argc, const char **argv,4953 struct apply_state *state,4954 int *force_apply, int *options,4955 const char * const *apply_usage)4956{4957 struct option builtin_apply_options[] = {4958 { OPTION_CALLBACK, 0, "exclude", state, N_("path"),4959 N_("don't apply changes matching the given path"),4960 PARSE_OPT_NONEG, apply_option_parse_exclude },4961 { OPTION_CALLBACK, 0, "include", state, N_("path"),4962 N_("apply changes matching the given path"),4963 PARSE_OPT_NONEG, apply_option_parse_include },4964 { OPTION_CALLBACK, 'p', NULL, state, N_("num"),4965 N_("remove <num> leading slashes from traditional diff paths"),4966 0, apply_option_parse_p },4967 OPT_BOOL(0, "no-add", &state->no_add,4968 N_("ignore additions made by the patch")),4969 OPT_BOOL(0, "stat", &state->diffstat,4970 N_("instead of applying the patch, output diffstat for the input")),4971 OPT_NOOP_NOARG(0, "allow-binary-replacement"),4972 OPT_NOOP_NOARG(0, "binary"),4973 OPT_BOOL(0, "numstat", &state->numstat,4974 N_("show number of added and deleted lines in decimal notation")),4975 OPT_BOOL(0, "summary", &state->summary,4976 N_("instead of applying the patch, output a summary for the input")),4977 OPT_BOOL(0, "check", &state->check,4978 N_("instead of applying the patch, see if the patch is applicable")),4979 OPT_BOOL(0, "index", &state->check_index,4980 N_("make sure the patch is applicable to the current index")),4981 OPT_BOOL('N', "intent-to-add", &state->ita_only,4982 N_("mark new files with `git add --intent-to-add`")),4983 OPT_BOOL(0, "cached", &state->cached,4984 N_("apply a patch without touching the working tree")),4985 OPT_BOOL_F(0, "unsafe-paths", &state->unsafe_paths,4986 N_("accept a patch that touches outside the working area"),4987 PARSE_OPT_NOCOMPLETE),4988 OPT_BOOL(0, "apply", force_apply,4989 N_("also apply the patch (use with --stat/--summary/--check)")),4990 OPT_BOOL('3', "3way", &state->threeway,4991 N_( "attempt three-way merge if a patch does not apply")),4992 OPT_FILENAME(0, "build-fake-ancestor", &state->fake_ancestor,4993 N_("build a temporary index based on embedded index information")),4994 /* Think twice before adding "--nul" synonym to this */4995 OPT_SET_INT('z', NULL, &state->line_termination,4996 N_("paths are separated with NUL character"), '\0'),4997 OPT_INTEGER('C', NULL, &state->p_context,4998 N_("ensure at least <n> lines of context match")),4999 { OPTION_CALLBACK, 0, "whitespace", state, N_("action"),5000 N_("detect new or modified lines that have whitespace errors"),5001 0, apply_option_parse_whitespace },5002 { OPTION_CALLBACK, 0, "ignore-space-change", state, NULL,5003 N_("ignore changes in whitespace when finding context"),5004 PARSE_OPT_NOARG, apply_option_parse_space_change },5005 { OPTION_CALLBACK, 0, "ignore-whitespace", state, NULL,5006 N_("ignore changes in whitespace when finding context"),5007 PARSE_OPT_NOARG, apply_option_parse_space_change },5008 OPT_BOOL('R', "reverse", &state->apply_in_reverse,5009 N_("apply the patch in reverse")),5010 OPT_BOOL(0, "unidiff-zero", &state->unidiff_zero,5011 N_("don't expect at least one line of context")),5012 OPT_BOOL(0, "reject", &state->apply_with_reject,5013 N_("leave the rejected hunks in corresponding *.rej files")),5014 OPT_BOOL(0, "allow-overlap", &state->allow_overlap,5015 N_("allow overlapping hunks")),5016 OPT__VERBOSE(&state->apply_verbosity, N_("be verbose")),5017 OPT_BIT(0, "inaccurate-eof", options,5018 N_("tolerate incorrectly detected missing new-line at the end of file"),5019 APPLY_OPT_INACCURATE_EOF),5020 OPT_BIT(0, "recount", options,5021 N_("do not trust the line counts in the hunk headers"),5022 APPLY_OPT_RECOUNT),5023 { OPTION_CALLBACK, 0, "directory", state, N_("root"),5024 N_("prepend <root> to all filenames"),5025 0, apply_option_parse_directory },5026 OPT_END()5027 };50285029 return parse_options(argc, argv, state->prefix, builtin_apply_options, apply_usage, 0);5030}