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"blob.h" 13#include"delta.h" 14#include"diff.h" 15#include"dir.h" 16#include"xdiff-interface.h" 17#include"ll-merge.h" 18#include"lockfile.h" 19#include"parse-options.h" 20#include"quote.h" 21#include"rerere.h" 22#include"apply.h" 23 24static voidgit_apply_config(void) 25{ 26git_config_get_string_const("apply.whitespace", &apply_default_whitespace); 27git_config_get_string_const("apply.ignorewhitespace", &apply_default_ignorewhitespace); 28git_config(git_default_config, NULL); 29} 30 31static intparse_whitespace_option(struct apply_state *state,const char*option) 32{ 33if(!option) { 34 state->ws_error_action = warn_on_ws_error; 35return0; 36} 37if(!strcmp(option,"warn")) { 38 state->ws_error_action = warn_on_ws_error; 39return0; 40} 41if(!strcmp(option,"nowarn")) { 42 state->ws_error_action = nowarn_ws_error; 43return0; 44} 45if(!strcmp(option,"error")) { 46 state->ws_error_action = die_on_ws_error; 47return0; 48} 49if(!strcmp(option,"error-all")) { 50 state->ws_error_action = die_on_ws_error; 51 state->squelch_whitespace_errors =0; 52return0; 53} 54if(!strcmp(option,"strip") || !strcmp(option,"fix")) { 55 state->ws_error_action = correct_ws_error; 56return0; 57} 58returnerror(_("unrecognized whitespace option '%s'"), option); 59} 60 61static intparse_ignorewhitespace_option(struct apply_state *state, 62const char*option) 63{ 64if(!option || !strcmp(option,"no") || 65!strcmp(option,"false") || !strcmp(option,"never") || 66!strcmp(option,"none")) { 67 state->ws_ignore_action = ignore_ws_none; 68return0; 69} 70if(!strcmp(option,"change")) { 71 state->ws_ignore_action = ignore_ws_change; 72return0; 73} 74returnerror(_("unrecognized whitespace ignore option '%s'"), option); 75} 76 77intinit_apply_state(struct apply_state *state, 78const char*prefix, 79struct lock_file *lock_file) 80{ 81memset(state,0,sizeof(*state)); 82 state->prefix = prefix; 83 state->prefix_length = state->prefix ?strlen(state->prefix) :0; 84 state->lock_file = lock_file; 85 state->newfd = -1; 86 state->apply =1; 87 state->line_termination ='\n'; 88 state->p_value =1; 89 state->p_context = UINT_MAX; 90 state->squelch_whitespace_errors =5; 91 state->ws_error_action = warn_on_ws_error; 92 state->ws_ignore_action = ignore_ws_none; 93 state->linenr =1; 94string_list_init(&state->fn_table,0); 95string_list_init(&state->limit_by_name,0); 96string_list_init(&state->symlink_changes,0); 97strbuf_init(&state->root,0); 98 99git_apply_config(); 100if(apply_default_whitespace &&parse_whitespace_option(state, apply_default_whitespace)) 101return-1; 102if(apply_default_ignorewhitespace &&parse_ignorewhitespace_option(state, apply_default_ignorewhitespace)) 103return-1; 104return0; 105} 106 107voidclear_apply_state(struct apply_state *state) 108{ 109string_list_clear(&state->limit_by_name,0); 110string_list_clear(&state->symlink_changes,0); 111strbuf_release(&state->root); 112 113/* &state->fn_table is cleared at the end of apply_patch() */ 114} 115 116static voidmute_routine(const char*msg,va_list params) 117{ 118/* do nothing */ 119} 120 121intcheck_apply_state(struct apply_state *state,int force_apply) 122{ 123int is_not_gitdir = !startup_info->have_repository; 124 125if(state->apply_with_reject && state->threeway) 126returnerror(_("--reject and --3way cannot be used together.")); 127if(state->cached && state->threeway) 128returnerror(_("--cached and --3way cannot be used together.")); 129if(state->threeway) { 130if(is_not_gitdir) 131returnerror(_("--3way outside a repository")); 132 state->check_index =1; 133} 134if(state->apply_with_reject) { 135 state->apply =1; 136if(state->apply_verbosity == verbosity_normal) 137 state->apply_verbosity = verbosity_verbose; 138} 139if(!force_apply && (state->diffstat || state->numstat || state->summary || state->check || state->fake_ancestor)) 140 state->apply =0; 141if(state->check_index && is_not_gitdir) 142returnerror(_("--index outside a repository")); 143if(state->cached) { 144if(is_not_gitdir) 145returnerror(_("--cached outside a repository")); 146 state->check_index =1; 147} 148if(state->check_index) 149 state->unsafe_paths =0; 150if(!state->lock_file) 151returnerror("BUG: state->lock_file should not be NULL"); 152 153if(state->apply_verbosity <= verbosity_silent) { 154 state->saved_error_routine =get_error_routine(); 155 state->saved_warn_routine =get_warn_routine(); 156set_error_routine(mute_routine); 157set_warn_routine(mute_routine); 158} 159 160return0; 161} 162 163static voidset_default_whitespace_mode(struct apply_state *state) 164{ 165if(!state->whitespace_option && !apply_default_whitespace) 166 state->ws_error_action = (state->apply ? warn_on_ws_error : nowarn_ws_error); 167} 168 169/* 170 * This represents one "hunk" from a patch, starting with 171 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The 172 * patch text is pointed at by patch, and its byte length 173 * is stored in size. leading and trailing are the number 174 * of context lines. 175 */ 176struct fragment { 177unsigned long leading, trailing; 178unsigned long oldpos, oldlines; 179unsigned long newpos, newlines; 180/* 181 * 'patch' is usually borrowed from buf in apply_patch(), 182 * but some codepaths store an allocated buffer. 183 */ 184const char*patch; 185unsigned free_patch:1, 186 rejected:1; 187int size; 188int linenr; 189struct fragment *next; 190}; 191 192/* 193 * When dealing with a binary patch, we reuse "leading" field 194 * to store the type of the binary hunk, either deflated "delta" 195 * or deflated "literal". 196 */ 197#define binary_patch_method leading 198#define BINARY_DELTA_DEFLATED 1 199#define BINARY_LITERAL_DEFLATED 2 200 201/* 202 * This represents a "patch" to a file, both metainfo changes 203 * such as creation/deletion, filemode and content changes represented 204 * as a series of fragments. 205 */ 206struct patch { 207char*new_name, *old_name, *def_name; 208unsigned int old_mode, new_mode; 209int is_new, is_delete;/* -1 = unknown, 0 = false, 1 = true */ 210int rejected; 211unsigned ws_rule; 212int lines_added, lines_deleted; 213int score; 214int extension_linenr;/* first line specifying delete/new/rename/copy */ 215unsigned int is_toplevel_relative:1; 216unsigned int inaccurate_eof:1; 217unsigned int is_binary:1; 218unsigned int is_copy:1; 219unsigned int is_rename:1; 220unsigned int recount:1; 221unsigned int conflicted_threeway:1; 222unsigned int direct_to_threeway:1; 223struct fragment *fragments; 224char*result; 225size_t resultsize; 226char old_sha1_prefix[41]; 227char new_sha1_prefix[41]; 228struct patch *next; 229 230/* three-way fallback result */ 231struct object_id threeway_stage[3]; 232}; 233 234static voidfree_fragment_list(struct fragment *list) 235{ 236while(list) { 237struct fragment *next = list->next; 238if(list->free_patch) 239free((char*)list->patch); 240free(list); 241 list = next; 242} 243} 244 245static voidfree_patch(struct patch *patch) 246{ 247free_fragment_list(patch->fragments); 248free(patch->def_name); 249free(patch->old_name); 250free(patch->new_name); 251free(patch->result); 252free(patch); 253} 254 255static voidfree_patch_list(struct patch *list) 256{ 257while(list) { 258struct patch *next = list->next; 259free_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 { 270size_t len; 271unsigned hash :24; 272unsigned 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 { 281char*buf; 282size_t len; 283size_t nr; 284size_t alloc; 285struct line *line_allocated; 286struct line *line; 287}; 288 289static uint32_thash_line(const char*cp,size_t len) 290{ 291size_t i; 292uint32_t h; 293for(i =0, h =0; i < len; i++) { 294if(!isspace(cp[i])) { 295 h = h *3+ (cp[i] &0xff); 296} 297} 298return 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 intfuzzy_matchlines(const char*s1,size_t n1, 306const char*s2,size_t n2) 307{ 308const char*last1 = s1 + n1 -1; 309const char*last2 = s2 + n2 -1; 310int result =0; 311 312/* ignore line endings */ 313while((*last1 =='\r') || (*last1 =='\n')) 314 last1--; 315while((*last2 =='\r') || (*last2 =='\n')) 316 last2--; 317 318/* skip leading whitespaces, if both begin with whitespace */ 319if(s1 <= last1 && s2 <= last2 &&isspace(*s1) &&isspace(*s2)) { 320while(isspace(*s1) && (s1 <= last1)) 321 s1++; 322while(isspace(*s2) && (s2 <= last2)) 323 s2++; 324} 325/* early return if both lines are empty */ 326if((s1 > last1) && (s2 > last2)) 327return1; 328while(!result) { 329 result = *s1++ - *s2++; 330/* 331 * Skip whitespace inside. We check for whitespace on 332 * both buffers because we don't want "a b" to match 333 * "ab" 334 */ 335if(isspace(*s1) &&isspace(*s2)) { 336while(isspace(*s1) && s1 <= last1) 337 s1++; 338while(isspace(*s2) && s2 <= last2) 339 s2++; 340} 341/* 342 * If we reached the end on one side only, 343 * lines don't match 344 */ 345if( 346((s2 > last2) && (s1 <= last1)) || 347((s1 > last1) && (s2 <= last2))) 348return0; 349if((s1 > last1) && (s2 > last2)) 350break; 351} 352 353return!result; 354} 355 356static voidadd_line_info(struct image *img,const char*bol,size_t len,unsigned flag) 357{ 358ALLOC_GROW(img->line_allocated, img->nr +1, img->alloc); 359 img->line_allocated[img->nr].len = len; 360 img->line_allocated[img->nr].hash =hash_line(bol, len); 361 img->line_allocated[img->nr].flag = flag; 362 img->nr++; 363} 364 365/* 366 * "buf" has the file contents to be patched (read from various sources). 367 * attach it to "image" and add line-based index to it. 368 * "image" now owns the "buf". 369 */ 370static voidprepare_image(struct image *image,char*buf,size_t len, 371int prepare_linetable) 372{ 373const char*cp, *ep; 374 375memset(image,0,sizeof(*image)); 376 image->buf = buf; 377 image->len = len; 378 379if(!prepare_linetable) 380return; 381 382 ep = image->buf + image->len; 383 cp = image->buf; 384while(cp < ep) { 385const char*next; 386for(next = cp; next < ep && *next !='\n'; next++) 387; 388if(next < ep) 389 next++; 390add_line_info(image, cp, next - cp,0); 391 cp = next; 392} 393 image->line = image->line_allocated; 394} 395 396static voidclear_image(struct image *image) 397{ 398free(image->buf); 399free(image->line_allocated); 400memset(image,0,sizeof(*image)); 401} 402 403/* fmt must contain _one_ %s and no other substitution */ 404static voidsay_patch_name(FILE*output,const char*fmt,struct patch *patch) 405{ 406struct strbuf sb = STRBUF_INIT; 407 408if(patch->old_name && patch->new_name && 409strcmp(patch->old_name, patch->new_name)) { 410quote_c_style(patch->old_name, &sb, NULL,0); 411strbuf_addstr(&sb," => "); 412quote_c_style(patch->new_name, &sb, NULL,0); 413}else{ 414const char*n = patch->new_name; 415if(!n) 416 n = patch->old_name; 417quote_c_style(n, &sb, NULL,0); 418} 419fprintf(output, fmt, sb.buf); 420fputc('\n', output); 421strbuf_release(&sb); 422} 423 424#define SLOP (16) 425 426static intread_patch_file(struct strbuf *sb,int fd) 427{ 428if(strbuf_read(sb, fd,0) <0) 429returnerror_errno("git apply: failed to read"); 430 431/* 432 * Make sure that we have some slop in the buffer 433 * so that we can do speculative "memcmp" etc, and 434 * see to it that it is NUL-filled. 435 */ 436strbuf_grow(sb, SLOP); 437memset(sb->buf + sb->len,0, SLOP); 438return0; 439} 440 441static unsigned longlinelen(const char*buffer,unsigned long size) 442{ 443unsigned long len =0; 444while(size--) { 445 len++; 446if(*buffer++ =='\n') 447break; 448} 449return len; 450} 451 452static intis_dev_null(const char*str) 453{ 454returnskip_prefix(str,"/dev/null", &str) &&isspace(*str); 455} 456 457#define TERM_SPACE 1 458#define TERM_TAB 2 459 460static intname_terminate(int c,int terminate) 461{ 462if(c ==' '&& !(terminate & TERM_SPACE)) 463return0; 464if(c =='\t'&& !(terminate & TERM_TAB)) 465return0; 466 467return1; 468} 469 470/* remove double slashes to make --index work with such filenames */ 471static char*squash_slash(char*name) 472{ 473int i =0, j =0; 474 475if(!name) 476return NULL; 477 478while(name[i]) { 479if((name[j++] = name[i++]) =='/') 480while(name[i] =='/') 481 i++; 482} 483 name[j] ='\0'; 484return name; 485} 486 487static char*find_name_gnu(struct apply_state *state, 488const char*line, 489const char*def, 490int p_value) 491{ 492struct strbuf name = STRBUF_INIT; 493char*cp; 494 495/* 496 * Proposed "new-style" GNU patch/diff format; see 497 * http://marc.info/?l=git&m=112927316408690&w=2 498 */ 499if(unquote_c_style(&name, line, NULL)) { 500strbuf_release(&name); 501return NULL; 502} 503 504for(cp = name.buf; p_value; p_value--) { 505 cp =strchr(cp,'/'); 506if(!cp) { 507strbuf_release(&name); 508return NULL; 509} 510 cp++; 511} 512 513strbuf_remove(&name,0, cp - name.buf); 514if(state->root.len) 515strbuf_insert(&name,0, state->root.buf, state->root.len); 516returnsquash_slash(strbuf_detach(&name, NULL)); 517} 518 519static size_tsane_tz_len(const char*line,size_t len) 520{ 521const char*tz, *p; 522 523if(len <strlen(" +0500") || line[len-strlen(" +0500")] !=' ') 524return0; 525 tz = line + len -strlen(" +0500"); 526 527if(tz[1] !='+'&& tz[1] !='-') 528return0; 529 530for(p = tz +2; p != line + len; p++) 531if(!isdigit(*p)) 532return0; 533 534return line + len - tz; 535} 536 537static size_ttz_with_colon_len(const char*line,size_t len) 538{ 539const char*tz, *p; 540 541if(len <strlen(" +08:00") || line[len -strlen(":00")] !=':') 542return0; 543 tz = line + len -strlen(" +08:00"); 544 545if(tz[0] !=' '|| (tz[1] !='+'&& tz[1] !='-')) 546return0; 547 p = tz +2; 548if(!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 549!isdigit(*p++) || !isdigit(*p++)) 550return0; 551 552return line + len - tz; 553} 554 555static size_tdate_len(const char*line,size_t len) 556{ 557const char*date, *p; 558 559if(len <strlen("72-02-05") || line[len-strlen("-05")] !='-') 560return0; 561 p = date = line + len -strlen("72-02-05"); 562 563if(!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 564!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 565!isdigit(*p++) || !isdigit(*p++))/* Not a date. */ 566return0; 567 568if(date - line >=strlen("19") && 569isdigit(date[-1]) &&isdigit(date[-2]))/* 4-digit year */ 570 date -=strlen("19"); 571 572return line + len - date; 573} 574 575static size_tshort_time_len(const char*line,size_t len) 576{ 577const char*time, *p; 578 579if(len <strlen(" 07:01:32") || line[len-strlen(":32")] !=':') 580return0; 581 p = time = line + len -strlen(" 07:01:32"); 582 583/* Permit 1-digit hours? */ 584if(*p++ !=' '|| 585!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 586!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 587!isdigit(*p++) || !isdigit(*p++))/* Not a time. */ 588return0; 589 590return line + len - time; 591} 592 593static size_tfractional_time_len(const char*line,size_t len) 594{ 595const char*p; 596size_t n; 597 598/* Expected format: 19:41:17.620000023 */ 599if(!len || !isdigit(line[len -1])) 600return0; 601 p = line + len -1; 602 603/* Fractional seconds. */ 604while(p > line &&isdigit(*p)) 605 p--; 606if(*p !='.') 607return0; 608 609/* Hours, minutes, and whole seconds. */ 610 n =short_time_len(line, p - line); 611if(!n) 612return0; 613 614return line + len - p + n; 615} 616 617static size_ttrailing_spaces_len(const char*line,size_t len) 618{ 619const char*p; 620 621/* Expected format: ' ' x (1 or more) */ 622if(!len || line[len -1] !=' ') 623return0; 624 625 p = line + len; 626while(p != line) { 627 p--; 628if(*p !=' ') 629return line + len - (p +1); 630} 631 632/* All spaces! */ 633return len; 634} 635 636static size_tdiff_timestamp_len(const char*line,size_t len) 637{ 638const char*end = line + len; 639size_t n; 640 641/* 642 * Posix: 2010-07-05 19:41:17 643 * GNU: 2010-07-05 19:41:17.620000023 -0500 644 */ 645 646if(!isdigit(end[-1])) 647return0; 648 649 n =sane_tz_len(line, end - line); 650if(!n) 651 n =tz_with_colon_len(line, end - line); 652 end -= n; 653 654 n =short_time_len(line, end - line); 655if(!n) 656 n =fractional_time_len(line, end - line); 657 end -= n; 658 659 n =date_len(line, end - line); 660if(!n)/* No date. Too bad. */ 661return0; 662 end -= n; 663 664if(end == line)/* No space before date. */ 665return0; 666if(end[-1] =='\t') {/* Success! */ 667 end--; 668return line + len - end; 669} 670if(end[-1] !=' ')/* No space before date. */ 671return0; 672 673/* Whitespace damage. */ 674 end -=trailing_spaces_len(line, end - line); 675return line + len - end; 676} 677 678static char*find_name_common(struct apply_state *state, 679const char*line, 680const char*def, 681int p_value, 682const char*end, 683int terminate) 684{ 685int len; 686const char*start = NULL; 687 688if(p_value ==0) 689 start = line; 690while(line != end) { 691char c = *line; 692 693if(!end &&isspace(c)) { 694if(c =='\n') 695break; 696if(name_terminate(c, terminate)) 697break; 698} 699 line++; 700if(c =='/'&& !--p_value) 701 start = line; 702} 703if(!start) 704returnsquash_slash(xstrdup_or_null(def)); 705 len = line - start; 706if(!len) 707returnsquash_slash(xstrdup_or_null(def)); 708 709/* 710 * Generally we prefer the shorter name, especially 711 * if the other one is just a variation of that with 712 * something else tacked on to the end (ie "file.orig" 713 * or "file~"). 714 */ 715if(def) { 716int deflen =strlen(def); 717if(deflen < len && !strncmp(start, def, deflen)) 718returnsquash_slash(xstrdup(def)); 719} 720 721if(state->root.len) { 722char*ret =xstrfmt("%s%.*s", state->root.buf, len, start); 723returnsquash_slash(ret); 724} 725 726returnsquash_slash(xmemdupz(start, len)); 727} 728 729static char*find_name(struct apply_state *state, 730const char*line, 731char*def, 732int p_value, 733int terminate) 734{ 735if(*line =='"') { 736char*name =find_name_gnu(state, line, def, p_value); 737if(name) 738return name; 739} 740 741returnfind_name_common(state, line, def, p_value, NULL, terminate); 742} 743 744static char*find_name_traditional(struct apply_state *state, 745const char*line, 746char*def, 747int p_value) 748{ 749size_t len; 750size_t date_len; 751 752if(*line =='"') { 753char*name =find_name_gnu(state, line, def, p_value); 754if(name) 755return name; 756} 757 758 len =strchrnul(line,'\n') - line; 759 date_len =diff_timestamp_len(line, len); 760if(!date_len) 761returnfind_name_common(state, line, def, p_value, NULL, TERM_TAB); 762 len -= date_len; 763 764returnfind_name_common(state, line, def, p_value, line + len,0); 765} 766 767/* 768 * Given the string after "--- " or "+++ ", guess the appropriate 769 * p_value for the given patch. 770 */ 771static intguess_p_value(struct apply_state *state,const char*nameline) 772{ 773char*name, *cp; 774int val = -1; 775 776if(is_dev_null(nameline)) 777return-1; 778 name =find_name_traditional(state, nameline, NULL,0); 779if(!name) 780return-1; 781 cp =strchr(name,'/'); 782if(!cp) 783 val =0; 784else if(state->prefix) { 785/* 786 * Does it begin with "a/$our-prefix" and such? Then this is 787 * very likely to apply to our directory. 788 */ 789if(!strncmp(name, state->prefix, state->prefix_length)) 790 val =count_slashes(state->prefix); 791else{ 792 cp++; 793if(!strncmp(cp, state->prefix, state->prefix_length)) 794 val =count_slashes(state->prefix) +1; 795} 796} 797free(name); 798return val; 799} 800 801/* 802 * Does the ---/+++ line have the POSIX timestamp after the last HT? 803 * GNU diff puts epoch there to signal a creation/deletion event. Is 804 * this such a timestamp? 805 */ 806static inthas_epoch_timestamp(const char*nameline) 807{ 808/* 809 * We are only interested in epoch timestamp; any non-zero 810 * fraction cannot be one, hence "(\.0+)?" in the regexp below. 811 * For the same reason, the date must be either 1969-12-31 or 812 * 1970-01-01, and the seconds part must be "00". 813 */ 814const char stamp_regexp[] = 815"^(1969-12-31|1970-01-01)" 816" " 817"[0-2][0-9]:[0-5][0-9]:00(\\.0+)?" 818" " 819"([-+][0-2][0-9]:?[0-5][0-9])\n"; 820const char*timestamp = NULL, *cp, *colon; 821static regex_t *stamp; 822 regmatch_t m[10]; 823int zoneoffset; 824int hourminute; 825int status; 826 827for(cp = nameline; *cp !='\n'; cp++) { 828if(*cp =='\t') 829 timestamp = cp +1; 830} 831if(!timestamp) 832return0; 833if(!stamp) { 834 stamp =xmalloc(sizeof(*stamp)); 835if(regcomp(stamp, stamp_regexp, REG_EXTENDED)) { 836warning(_("Cannot prepare timestamp regexp%s"), 837 stamp_regexp); 838return0; 839} 840} 841 842 status =regexec(stamp, timestamp,ARRAY_SIZE(m), m,0); 843if(status) { 844if(status != REG_NOMATCH) 845warning(_("regexec returned%dfor input:%s"), 846 status, timestamp); 847return0; 848} 849 850 zoneoffset =strtol(timestamp + m[3].rm_so +1, (char**) &colon,10); 851if(*colon ==':') 852 zoneoffset = zoneoffset *60+strtol(colon +1, NULL,10); 853else 854 zoneoffset = (zoneoffset /100) *60+ (zoneoffset %100); 855if(timestamp[m[3].rm_so] =='-') 856 zoneoffset = -zoneoffset; 857 858/* 859 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31 860 * (west of GMT) or 1970-01-01 (east of GMT) 861 */ 862if((zoneoffset <0&&memcmp(timestamp,"1969-12-31",10)) || 863(0<= zoneoffset &&memcmp(timestamp,"1970-01-01",10))) 864return0; 865 866 hourminute = (strtol(timestamp +11, NULL,10) *60+ 867strtol(timestamp +14, NULL,10) - 868 zoneoffset); 869 870return((zoneoffset <0&& hourminute ==1440) || 871(0<= zoneoffset && !hourminute)); 872} 873 874/* 875 * Get the name etc info from the ---/+++ lines of a traditional patch header 876 * 877 * FIXME! The end-of-filename heuristics are kind of screwy. For existing 878 * files, we can happily check the index for a match, but for creating a 879 * new file we should try to match whatever "patch" does. I have no idea. 880 */ 881static intparse_traditional_patch(struct apply_state *state, 882const char*first, 883const char*second, 884struct patch *patch) 885{ 886char*name; 887 888 first +=4;/* skip "--- " */ 889 second +=4;/* skip "+++ " */ 890if(!state->p_value_known) { 891int p, q; 892 p =guess_p_value(state, first); 893 q =guess_p_value(state, second); 894if(p <0) p = q; 895if(0<= p && p == q) { 896 state->p_value = p; 897 state->p_value_known =1; 898} 899} 900if(is_dev_null(first)) { 901 patch->is_new =1; 902 patch->is_delete =0; 903 name =find_name_traditional(state, second, NULL, state->p_value); 904 patch->new_name = name; 905}else if(is_dev_null(second)) { 906 patch->is_new =0; 907 patch->is_delete =1; 908 name =find_name_traditional(state, first, NULL, state->p_value); 909 patch->old_name = name; 910}else{ 911char*first_name; 912 first_name =find_name_traditional(state, first, NULL, state->p_value); 913 name =find_name_traditional(state, second, first_name, state->p_value); 914free(first_name); 915if(has_epoch_timestamp(first)) { 916 patch->is_new =1; 917 patch->is_delete =0; 918 patch->new_name = name; 919}else if(has_epoch_timestamp(second)) { 920 patch->is_new =0; 921 patch->is_delete =1; 922 patch->old_name = name; 923}else{ 924 patch->old_name = name; 925 patch->new_name =xstrdup_or_null(name); 926} 927} 928if(!name) 929returnerror(_("unable to find filename in patch at line%d"), state->linenr); 930 931return0; 932} 933 934static intgitdiff_hdrend(struct apply_state *state, 935const char*line, 936struct patch *patch) 937{ 938return1; 939} 940 941/* 942 * We're anal about diff header consistency, to make 943 * sure that we don't end up having strange ambiguous 944 * patches floating around. 945 * 946 * As a result, gitdiff_{old|new}name() will check 947 * their names against any previous information, just 948 * to make sure.. 949 */ 950#define DIFF_OLD_NAME 0 951#define DIFF_NEW_NAME 1 952 953static intgitdiff_verify_name(struct apply_state *state, 954const char*line, 955int isnull, 956char**name, 957int side) 958{ 959if(!*name && !isnull) { 960*name =find_name(state, line, NULL, state->p_value, TERM_TAB); 961return0; 962} 963 964if(*name) { 965char*another; 966if(isnull) 967returnerror(_("git apply: bad git-diff - expected /dev/null, got%son line%d"), 968*name, state->linenr); 969 another =find_name(state, line, NULL, state->p_value, TERM_TAB); 970if(!another ||strcmp(another, *name)) { 971free(another); 972returnerror((side == DIFF_NEW_NAME) ? 973_("git apply: bad git-diff - inconsistent new filename on line%d") : 974_("git apply: bad git-diff - inconsistent old filename on line%d"), state->linenr); 975} 976free(another); 977}else{ 978if(!starts_with(line,"/dev/null\n")) 979returnerror(_("git apply: bad git-diff - expected /dev/null on line%d"), state->linenr); 980} 981 982return0; 983} 984 985static intgitdiff_oldname(struct apply_state *state, 986const char*line, 987struct patch *patch) 988{ 989returngitdiff_verify_name(state, line, 990 patch->is_new, &patch->old_name, 991 DIFF_OLD_NAME); 992} 993 994static intgitdiff_newname(struct apply_state *state, 995const char*line, 996struct patch *patch) 997{ 998returngitdiff_verify_name(state, line, 999 patch->is_delete, &patch->new_name,1000 DIFF_NEW_NAME);1001}10021003static intparse_mode_line(const char*line,int linenr,unsigned int*mode)1004{1005char*end;1006*mode =strtoul(line, &end,8);1007if(end == line || !isspace(*end))1008returnerror(_("invalid mode on line%d:%s"), linenr, line);1009return0;1010}10111012static intgitdiff_oldmode(struct apply_state *state,1013const char*line,1014struct patch *patch)1015{1016returnparse_mode_line(line, state->linenr, &patch->old_mode);1017}10181019static intgitdiff_newmode(struct apply_state *state,1020const char*line,1021struct patch *patch)1022{1023returnparse_mode_line(line, state->linenr, &patch->new_mode);1024}10251026static intgitdiff_delete(struct apply_state *state,1027const char*line,1028struct patch *patch)1029{1030 patch->is_delete =1;1031free(patch->old_name);1032 patch->old_name =xstrdup_or_null(patch->def_name);1033returngitdiff_oldmode(state, line, patch);1034}10351036static intgitdiff_newfile(struct apply_state *state,1037const char*line,1038struct patch *patch)1039{1040 patch->is_new =1;1041free(patch->new_name);1042 patch->new_name =xstrdup_or_null(patch->def_name);1043returngitdiff_newmode(state, line, patch);1044}10451046static intgitdiff_copysrc(struct apply_state *state,1047const char*line,1048struct patch *patch)1049{1050 patch->is_copy =1;1051free(patch->old_name);1052 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1053return0;1054}10551056static intgitdiff_copydst(struct apply_state *state,1057const char*line,1058struct patch *patch)1059{1060 patch->is_copy =1;1061free(patch->new_name);1062 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1063return0;1064}10651066static intgitdiff_renamesrc(struct apply_state *state,1067const char*line,1068struct patch *patch)1069{1070 patch->is_rename =1;1071free(patch->old_name);1072 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1073return0;1074}10751076static intgitdiff_renamedst(struct apply_state *state,1077const char*line,1078struct patch *patch)1079{1080 patch->is_rename =1;1081free(patch->new_name);1082 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1083return0;1084}10851086static intgitdiff_similarity(struct apply_state *state,1087const char*line,1088struct patch *patch)1089{1090unsigned long val =strtoul(line, NULL,10);1091if(val <=100)1092 patch->score = val;1093return0;1094}10951096static intgitdiff_dissimilarity(struct apply_state *state,1097const char*line,1098struct patch *patch)1099{1100unsigned long val =strtoul(line, NULL,10);1101if(val <=100)1102 patch->score = val;1103return0;1104}11051106static intgitdiff_index(struct apply_state *state,1107const char*line,1108struct patch *patch)1109{1110/*1111 * index line is N hexadecimal, "..", N hexadecimal,1112 * and optional space with octal mode.1113 */1114const char*ptr, *eol;1115int len;11161117 ptr =strchr(line,'.');1118if(!ptr || ptr[1] !='.'||40< ptr - line)1119return0;1120 len = ptr - line;1121memcpy(patch->old_sha1_prefix, line, len);1122 patch->old_sha1_prefix[len] =0;11231124 line = ptr +2;1125 ptr =strchr(line,' ');1126 eol =strchrnul(line,'\n');11271128if(!ptr || eol < ptr)1129 ptr = eol;1130 len = ptr - line;11311132if(40< len)1133return0;1134memcpy(patch->new_sha1_prefix, line, len);1135 patch->new_sha1_prefix[len] =0;1136if(*ptr ==' ')1137returngitdiff_oldmode(state, ptr +1, patch);1138return0;1139}11401141/*1142 * This is normal for a diff that doesn't change anything: we'll fall through1143 * into the next diff. Tell the parser to break out.1144 */1145static intgitdiff_unrecognized(struct apply_state *state,1146const char*line,1147struct patch *patch)1148{1149return1;1150}11511152/*1153 * Skip p_value leading components from "line"; as we do not accept1154 * absolute paths, return NULL in that case.1155 */1156static const char*skip_tree_prefix(struct apply_state *state,1157const char*line,1158int llen)1159{1160int nslash;1161int i;11621163if(!state->p_value)1164return(llen && line[0] =='/') ? NULL : line;11651166 nslash = state->p_value;1167for(i =0; i < llen; i++) {1168int ch = line[i];1169if(ch =='/'&& --nslash <=0)1170return(i ==0) ? NULL : &line[i +1];1171}1172return NULL;1173}11741175/*1176 * This is to extract the same name that appears on "diff --git"1177 * line. We do not find and return anything if it is a rename1178 * patch, and it is OK because we will find the name elsewhere.1179 * We need to reliably find name only when it is mode-change only,1180 * creation or deletion of an empty file. In any of these cases,1181 * both sides are the same name under a/ and b/ respectively.1182 */1183static char*git_header_name(struct apply_state *state,1184const char*line,1185int llen)1186{1187const char*name;1188const char*second = NULL;1189size_t len, line_len;11901191 line +=strlen("diff --git ");1192 llen -=strlen("diff --git ");11931194if(*line =='"') {1195const char*cp;1196struct strbuf first = STRBUF_INIT;1197struct strbuf sp = STRBUF_INIT;11981199if(unquote_c_style(&first, line, &second))1200goto free_and_fail1;12011202/* strip the a/b prefix including trailing slash */1203 cp =skip_tree_prefix(state, first.buf, first.len);1204if(!cp)1205goto free_and_fail1;1206strbuf_remove(&first,0, cp - first.buf);12071208/*1209 * second points at one past closing dq of name.1210 * find the second name.1211 */1212while((second < line + llen) &&isspace(*second))1213 second++;12141215if(line + llen <= second)1216goto free_and_fail1;1217if(*second =='"') {1218if(unquote_c_style(&sp, second, NULL))1219goto free_and_fail1;1220 cp =skip_tree_prefix(state, sp.buf, sp.len);1221if(!cp)1222goto free_and_fail1;1223/* They must match, otherwise ignore */1224if(strcmp(cp, first.buf))1225goto free_and_fail1;1226strbuf_release(&sp);1227returnstrbuf_detach(&first, NULL);1228}12291230/* unquoted second */1231 cp =skip_tree_prefix(state, second, line + llen - second);1232if(!cp)1233goto free_and_fail1;1234if(line + llen - cp != first.len ||1235memcmp(first.buf, cp, first.len))1236goto free_and_fail1;1237returnstrbuf_detach(&first, NULL);12381239 free_and_fail1:1240strbuf_release(&first);1241strbuf_release(&sp);1242return NULL;1243}12441245/* unquoted first name */1246 name =skip_tree_prefix(state, line, llen);1247if(!name)1248return NULL;12491250/*1251 * since the first name is unquoted, a dq if exists must be1252 * the beginning of the second name.1253 */1254for(second = name; second < line + llen; second++) {1255if(*second =='"') {1256struct strbuf sp = STRBUF_INIT;1257const char*np;12581259if(unquote_c_style(&sp, second, NULL))1260goto free_and_fail2;12611262 np =skip_tree_prefix(state, sp.buf, sp.len);1263if(!np)1264goto free_and_fail2;12651266 len = sp.buf + sp.len - np;1267if(len < second - name &&1268!strncmp(np, name, len) &&1269isspace(name[len])) {1270/* Good */1271strbuf_remove(&sp,0, np - sp.buf);1272returnstrbuf_detach(&sp, NULL);1273}12741275 free_and_fail2:1276strbuf_release(&sp);1277return NULL;1278}1279}12801281/*1282 * Accept a name only if it shows up twice, exactly the same1283 * form.1284 */1285 second =strchr(name,'\n');1286if(!second)1287return NULL;1288 line_len = second - name;1289for(len =0; ; len++) {1290switch(name[len]) {1291default:1292continue;1293case'\n':1294return NULL;1295case'\t':case' ':1296/*1297 * Is this the separator between the preimage1298 * and the postimage pathname? Again, we are1299 * only interested in the case where there is1300 * no rename, as this is only to set def_name1301 * and a rename patch has the names elsewhere1302 * in an unambiguous form.1303 */1304if(!name[len +1])1305return NULL;/* no postimage name */1306 second =skip_tree_prefix(state, name + len +1,1307 line_len - (len +1));1308if(!second)1309return NULL;1310/*1311 * Does len bytes starting at "name" and "second"1312 * (that are separated by one HT or SP we just1313 * found) exactly match?1314 */1315if(second[len] =='\n'&& !strncmp(name, second, len))1316returnxmemdupz(name, len);1317}1318}1319}13201321static intcheck_header_line(struct apply_state *state,struct patch *patch)1322{1323int extensions = (patch->is_delete ==1) + (patch->is_new ==1) +1324(patch->is_rename ==1) + (patch->is_copy ==1);1325if(extensions >1)1326returnerror(_("inconsistent header lines%dand%d"),1327 patch->extension_linenr, state->linenr);1328if(extensions && !patch->extension_linenr)1329 patch->extension_linenr = state->linenr;1330return0;1331}13321333/* Verify that we recognize the lines following a git header */1334static intparse_git_header(struct apply_state *state,1335const char*line,1336int len,1337unsigned int size,1338struct patch *patch)1339{1340unsigned long offset;13411342/* A git diff has explicit new/delete information, so we don't guess */1343 patch->is_new =0;1344 patch->is_delete =0;13451346/*1347 * Some things may not have the old name in the1348 * rest of the headers anywhere (pure mode changes,1349 * or removing or adding empty files), so we get1350 * the default name from the header.1351 */1352 patch->def_name =git_header_name(state, line, len);1353if(patch->def_name && state->root.len) {1354char*s =xstrfmt("%s%s", state->root.buf, patch->def_name);1355free(patch->def_name);1356 patch->def_name = s;1357}13581359 line += len;1360 size -= len;1361 state->linenr++;1362for(offset = len ; size >0; offset += len, size -= len, line += len, state->linenr++) {1363static const struct opentry {1364const char*str;1365int(*fn)(struct apply_state *,const char*,struct patch *);1366} optable[] = {1367{"@@ -", gitdiff_hdrend },1368{"--- ", gitdiff_oldname },1369{"+++ ", gitdiff_newname },1370{"old mode ", gitdiff_oldmode },1371{"new mode ", gitdiff_newmode },1372{"deleted file mode ", gitdiff_delete },1373{"new file mode ", gitdiff_newfile },1374{"copy from ", gitdiff_copysrc },1375{"copy to ", gitdiff_copydst },1376{"rename old ", gitdiff_renamesrc },1377{"rename new ", gitdiff_renamedst },1378{"rename from ", gitdiff_renamesrc },1379{"rename to ", gitdiff_renamedst },1380{"similarity index ", gitdiff_similarity },1381{"dissimilarity index ", gitdiff_dissimilarity },1382{"index ", gitdiff_index },1383{"", gitdiff_unrecognized },1384};1385int i;13861387 len =linelen(line, size);1388if(!len || line[len-1] !='\n')1389break;1390for(i =0; i <ARRAY_SIZE(optable); i++) {1391const struct opentry *p = optable + i;1392int oplen =strlen(p->str);1393int res;1394if(len < oplen ||memcmp(p->str, line, oplen))1395continue;1396 res = p->fn(state, line + oplen, patch);1397if(res <0)1398return-1;1399if(check_header_line(state, patch))1400return-1;1401if(res >0)1402return offset;1403break;1404}1405}14061407return offset;1408}14091410static intparse_num(const char*line,unsigned long*p)1411{1412char*ptr;14131414if(!isdigit(*line))1415return0;1416*p =strtoul(line, &ptr,10);1417return ptr - line;1418}14191420static intparse_range(const char*line,int len,int offset,const char*expect,1421unsigned long*p1,unsigned long*p2)1422{1423int digits, ex;14241425if(offset <0|| offset >= len)1426return-1;1427 line += offset;1428 len -= offset;14291430 digits =parse_num(line, p1);1431if(!digits)1432return-1;14331434 offset += digits;1435 line += digits;1436 len -= digits;14371438*p2 =1;1439if(*line ==',') {1440 digits =parse_num(line+1, p2);1441if(!digits)1442return-1;14431444 offset += digits+1;1445 line += digits+1;1446 len -= digits+1;1447}14481449 ex =strlen(expect);1450if(ex > len)1451return-1;1452if(memcmp(line, expect, ex))1453return-1;14541455return offset + ex;1456}14571458static voidrecount_diff(const char*line,int size,struct fragment *fragment)1459{1460int oldlines =0, newlines =0, ret =0;14611462if(size <1) {1463warning("recount: ignore empty hunk");1464return;1465}14661467for(;;) {1468int len =linelen(line, size);1469 size -= len;1470 line += len;14711472if(size <1)1473break;14741475switch(*line) {1476case' ':case'\n':1477 newlines++;1478/* fall through */1479case'-':1480 oldlines++;1481continue;1482case'+':1483 newlines++;1484continue;1485case'\\':1486continue;1487case'@':1488 ret = size <3|| !starts_with(line,"@@ ");1489break;1490case'd':1491 ret = size <5|| !starts_with(line,"diff ");1492break;1493default:1494 ret = -1;1495break;1496}1497if(ret) {1498warning(_("recount: unexpected line: %.*s"),1499(int)linelen(line, size), line);1500return;1501}1502break;1503}1504 fragment->oldlines = oldlines;1505 fragment->newlines = newlines;1506}15071508/*1509 * Parse a unified diff fragment header of the1510 * form "@@ -a,b +c,d @@"1511 */1512static intparse_fragment_header(const char*line,int len,struct fragment *fragment)1513{1514int offset;15151516if(!len || line[len-1] !='\n')1517return-1;15181519/* Figure out the number of lines in a fragment */1520 offset =parse_range(line, len,4," +", &fragment->oldpos, &fragment->oldlines);1521 offset =parse_range(line, len, offset," @@", &fragment->newpos, &fragment->newlines);15221523return offset;1524}15251526/*1527 * Find file diff header1528 *1529 * Returns:1530 * -1 if no header was found1531 * -128 in case of error1532 * the size of the header in bytes (called "offset") otherwise1533 */1534static intfind_header(struct apply_state *state,1535const char*line,1536unsigned long size,1537int*hdrsize,1538struct patch *patch)1539{1540unsigned long offset, len;15411542 patch->is_toplevel_relative =0;1543 patch->is_rename = patch->is_copy =0;1544 patch->is_new = patch->is_delete = -1;1545 patch->old_mode = patch->new_mode =0;1546 patch->old_name = patch->new_name = NULL;1547for(offset =0; size >0; offset += len, size -= len, line += len, state->linenr++) {1548unsigned long nextlen;15491550 len =linelen(line, size);1551if(!len)1552break;15531554/* Testing this early allows us to take a few shortcuts.. */1555if(len <6)1556continue;15571558/*1559 * Make sure we don't find any unconnected patch fragments.1560 * That's a sign that we didn't find a header, and that a1561 * patch has become corrupted/broken up.1562 */1563if(!memcmp("@@ -", line,4)) {1564struct fragment dummy;1565if(parse_fragment_header(line, len, &dummy) <0)1566continue;1567error(_("patch fragment without header at line%d: %.*s"),1568 state->linenr, (int)len-1, line);1569return-128;1570}15711572if(size < len +6)1573break;15741575/*1576 * Git patch? It might not have a real patch, just a rename1577 * or mode change, so we handle that specially1578 */1579if(!memcmp("diff --git ", line,11)) {1580int git_hdr_len =parse_git_header(state, line, len, size, patch);1581if(git_hdr_len <0)1582return-128;1583if(git_hdr_len <= len)1584continue;1585if(!patch->old_name && !patch->new_name) {1586if(!patch->def_name) {1587error(Q_("git diff header lacks filename information when removing "1588"%dleading pathname component (line%d)",1589"git diff header lacks filename information when removing "1590"%dleading pathname components (line%d)",1591 state->p_value),1592 state->p_value, state->linenr);1593return-128;1594}1595 patch->old_name =xstrdup(patch->def_name);1596 patch->new_name =xstrdup(patch->def_name);1597}1598if((!patch->new_name && !patch->is_delete) ||1599(!patch->old_name && !patch->is_new)) {1600error(_("git diff header lacks filename information "1601"(line%d)"), state->linenr);1602return-128;1603}1604 patch->is_toplevel_relative =1;1605*hdrsize = git_hdr_len;1606return offset;1607}16081609/* --- followed by +++ ? */1610if(memcmp("--- ", line,4) ||memcmp("+++ ", line + len,4))1611continue;16121613/*1614 * We only accept unified patches, so we want it to1615 * at least have "@@ -a,b +c,d @@\n", which is 14 chars1616 * minimum ("@@ -0,0 +1 @@\n" is the shortest).1617 */1618 nextlen =linelen(line + len, size - len);1619if(size < nextlen +14||memcmp("@@ -", line + len + nextlen,4))1620continue;16211622/* Ok, we'll consider it a patch */1623if(parse_traditional_patch(state, line, line+len, patch))1624return-128;1625*hdrsize = len + nextlen;1626 state->linenr +=2;1627return offset;1628}1629return-1;1630}16311632static voidrecord_ws_error(struct apply_state *state,1633unsigned result,1634const char*line,1635int len,1636int linenr)1637{1638char*err;16391640if(!result)1641return;16421643 state->whitespace_error++;1644if(state->squelch_whitespace_errors &&1645 state->squelch_whitespace_errors < state->whitespace_error)1646return;16471648 err =whitespace_error_string(result);1649if(state->apply_verbosity > verbosity_silent)1650fprintf(stderr,"%s:%d:%s.\n%.*s\n",1651 state->patch_input_file, linenr, err, len, line);1652free(err);1653}16541655static voidcheck_whitespace(struct apply_state *state,1656const char*line,1657int len,1658unsigned ws_rule)1659{1660unsigned result =ws_check(line +1, len -1, ws_rule);16611662record_ws_error(state, result, line +1, len -2, state->linenr);1663}16641665/*1666 * Parse a unified diff. Note that this really needs to parse each1667 * fragment separately, since the only way to know the difference1668 * between a "---" that is part of a patch, and a "---" that starts1669 * the next patch is to look at the line counts..1670 */1671static intparse_fragment(struct apply_state *state,1672const char*line,1673unsigned long size,1674struct patch *patch,1675struct fragment *fragment)1676{1677int added, deleted;1678int len =linelen(line, size), offset;1679unsigned long oldlines, newlines;1680unsigned long leading, trailing;16811682 offset =parse_fragment_header(line, len, fragment);1683if(offset <0)1684return-1;1685if(offset >0&& patch->recount)1686recount_diff(line + offset, size - offset, fragment);1687 oldlines = fragment->oldlines;1688 newlines = fragment->newlines;1689 leading =0;1690 trailing =0;16911692/* Parse the thing.. */1693 line += len;1694 size -= len;1695 state->linenr++;1696 added = deleted =0;1697for(offset = len;16980< size;1699 offset += len, size -= len, line += len, state->linenr++) {1700if(!oldlines && !newlines)1701break;1702 len =linelen(line, size);1703if(!len || line[len-1] !='\n')1704return-1;1705switch(*line) {1706default:1707return-1;1708case'\n':/* newer GNU diff, an empty context line */1709case' ':1710 oldlines--;1711 newlines--;1712if(!deleted && !added)1713 leading++;1714 trailing++;1715if(!state->apply_in_reverse &&1716 state->ws_error_action == correct_ws_error)1717check_whitespace(state, line, len, patch->ws_rule);1718break;1719case'-':1720if(state->apply_in_reverse &&1721 state->ws_error_action != nowarn_ws_error)1722check_whitespace(state, line, len, patch->ws_rule);1723 deleted++;1724 oldlines--;1725 trailing =0;1726break;1727case'+':1728if(!state->apply_in_reverse &&1729 state->ws_error_action != nowarn_ws_error)1730check_whitespace(state, line, len, patch->ws_rule);1731 added++;1732 newlines--;1733 trailing =0;1734break;17351736/*1737 * We allow "\ No newline at end of file". Depending1738 * on locale settings when the patch was produced we1739 * don't know what this line looks like. The only1740 * thing we do know is that it begins with "\ ".1741 * Checking for 12 is just for sanity check -- any1742 * l10n of "\ No newline..." is at least that long.1743 */1744case'\\':1745if(len <12||memcmp(line,"\\",2))1746return-1;1747break;1748}1749}1750if(oldlines || newlines)1751return-1;1752if(!deleted && !added)1753return-1;17541755 fragment->leading = leading;1756 fragment->trailing = trailing;17571758/*1759 * If a fragment ends with an incomplete line, we failed to include1760 * it in the above loop because we hit oldlines == newlines == 01761 * before seeing it.1762 */1763if(12< size && !memcmp(line,"\\",2))1764 offset +=linelen(line, size);17651766 patch->lines_added += added;1767 patch->lines_deleted += deleted;17681769if(0< patch->is_new && oldlines)1770returnerror(_("new file depends on old contents"));1771if(0< patch->is_delete && newlines)1772returnerror(_("deleted file still has contents"));1773return offset;1774}17751776/*1777 * We have seen "diff --git a/... b/..." header (or a traditional patch1778 * header). Read hunks that belong to this patch into fragments and hang1779 * them to the given patch structure.1780 *1781 * The (fragment->patch, fragment->size) pair points into the memory given1782 * by the caller, not a copy, when we return.1783 *1784 * Returns:1785 * -1 in case of error,1786 * the number of bytes in the patch otherwise.1787 */1788static intparse_single_patch(struct apply_state *state,1789const char*line,1790unsigned long size,1791struct patch *patch)1792{1793unsigned long offset =0;1794unsigned long oldlines =0, newlines =0, context =0;1795struct fragment **fragp = &patch->fragments;17961797while(size >4&& !memcmp(line,"@@ -",4)) {1798struct fragment *fragment;1799int len;18001801 fragment =xcalloc(1,sizeof(*fragment));1802 fragment->linenr = state->linenr;1803 len =parse_fragment(state, line, size, patch, fragment);1804if(len <=0) {1805free(fragment);1806returnerror(_("corrupt patch at line%d"), state->linenr);1807}1808 fragment->patch = line;1809 fragment->size = len;1810 oldlines += fragment->oldlines;1811 newlines += fragment->newlines;1812 context += fragment->leading + fragment->trailing;18131814*fragp = fragment;1815 fragp = &fragment->next;18161817 offset += len;1818 line += len;1819 size -= len;1820}18211822/*1823 * If something was removed (i.e. we have old-lines) it cannot1824 * be creation, and if something was added it cannot be1825 * deletion. However, the reverse is not true; --unified=01826 * patches that only add are not necessarily creation even1827 * though they do not have any old lines, and ones that only1828 * delete are not necessarily deletion.1829 *1830 * Unfortunately, a real creation/deletion patch do _not_ have1831 * any context line by definition, so we cannot safely tell it1832 * apart with --unified=0 insanity. At least if the patch has1833 * more than one hunk it is not creation or deletion.1834 */1835if(patch->is_new <0&&1836(oldlines || (patch->fragments && patch->fragments->next)))1837 patch->is_new =0;1838if(patch->is_delete <0&&1839(newlines || (patch->fragments && patch->fragments->next)))1840 patch->is_delete =0;18411842if(0< patch->is_new && oldlines)1843returnerror(_("new file%sdepends on old contents"), patch->new_name);1844if(0< patch->is_delete && newlines)1845returnerror(_("deleted file%sstill has contents"), patch->old_name);1846if(!patch->is_delete && !newlines && context && state->apply_verbosity > verbosity_silent)1847fprintf_ln(stderr,1848_("** warning: "1849"file%sbecomes empty but is not deleted"),1850 patch->new_name);18511852return offset;1853}18541855staticinlineintmetadata_changes(struct patch *patch)1856{1857return patch->is_rename >0||1858 patch->is_copy >0||1859 patch->is_new >0||1860 patch->is_delete ||1861(patch->old_mode && patch->new_mode &&1862 patch->old_mode != patch->new_mode);1863}18641865static char*inflate_it(const void*data,unsigned long size,1866unsigned long inflated_size)1867{1868 git_zstream stream;1869void*out;1870int st;18711872memset(&stream,0,sizeof(stream));18731874 stream.next_in = (unsigned char*)data;1875 stream.avail_in = size;1876 stream.next_out = out =xmalloc(inflated_size);1877 stream.avail_out = inflated_size;1878git_inflate_init(&stream);1879 st =git_inflate(&stream, Z_FINISH);1880git_inflate_end(&stream);1881if((st != Z_STREAM_END) || stream.total_out != inflated_size) {1882free(out);1883return NULL;1884}1885return out;1886}18871888/*1889 * Read a binary hunk and return a new fragment; fragment->patch1890 * points at an allocated memory that the caller must free, so1891 * it is marked as "->free_patch = 1".1892 */1893static struct fragment *parse_binary_hunk(struct apply_state *state,1894char**buf_p,1895unsigned long*sz_p,1896int*status_p,1897int*used_p)1898{1899/*1900 * Expect a line that begins with binary patch method ("literal"1901 * or "delta"), followed by the length of data before deflating.1902 * a sequence of 'length-byte' followed by base-85 encoded data1903 * should follow, terminated by a newline.1904 *1905 * Each 5-byte sequence of base-85 encodes up to 4 bytes,1906 * and we would limit the patch line to 66 characters,1907 * so one line can fit up to 13 groups that would decode1908 * to 52 bytes max. The length byte 'A'-'Z' corresponds1909 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.1910 */1911int llen, used;1912unsigned long size = *sz_p;1913char*buffer = *buf_p;1914int patch_method;1915unsigned long origlen;1916char*data = NULL;1917int hunk_size =0;1918struct fragment *frag;19191920 llen =linelen(buffer, size);1921 used = llen;19221923*status_p =0;19241925if(starts_with(buffer,"delta ")) {1926 patch_method = BINARY_DELTA_DEFLATED;1927 origlen =strtoul(buffer +6, NULL,10);1928}1929else if(starts_with(buffer,"literal ")) {1930 patch_method = BINARY_LITERAL_DEFLATED;1931 origlen =strtoul(buffer +8, NULL,10);1932}1933else1934return NULL;19351936 state->linenr++;1937 buffer += llen;1938while(1) {1939int byte_length, max_byte_length, newsize;1940 llen =linelen(buffer, size);1941 used += llen;1942 state->linenr++;1943if(llen ==1) {1944/* consume the blank line */1945 buffer++;1946 size--;1947break;1948}1949/*1950 * Minimum line is "A00000\n" which is 7-byte long,1951 * and the line length must be multiple of 5 plus 2.1952 */1953if((llen <7) || (llen-2) %5)1954goto corrupt;1955 max_byte_length = (llen -2) /5*4;1956 byte_length = *buffer;1957if('A'<= byte_length && byte_length <='Z')1958 byte_length = byte_length -'A'+1;1959else if('a'<= byte_length && byte_length <='z')1960 byte_length = byte_length -'a'+27;1961else1962goto corrupt;1963/* if the input length was not multiple of 4, we would1964 * have filler at the end but the filler should never1965 * exceed 3 bytes1966 */1967if(max_byte_length < byte_length ||1968 byte_length <= max_byte_length -4)1969goto corrupt;1970 newsize = hunk_size + byte_length;1971 data =xrealloc(data, newsize);1972if(decode_85(data + hunk_size, buffer +1, byte_length))1973goto corrupt;1974 hunk_size = newsize;1975 buffer += llen;1976 size -= llen;1977}19781979 frag =xcalloc(1,sizeof(*frag));1980 frag->patch =inflate_it(data, hunk_size, origlen);1981 frag->free_patch =1;1982if(!frag->patch)1983goto corrupt;1984free(data);1985 frag->size = origlen;1986*buf_p = buffer;1987*sz_p = size;1988*used_p = used;1989 frag->binary_patch_method = patch_method;1990return frag;19911992 corrupt:1993free(data);1994*status_p = -1;1995error(_("corrupt binary patch at line%d: %.*s"),1996 state->linenr-1, llen-1, buffer);1997return NULL;1998}19992000/*2001 * Returns:2002 * -1 in case of error,2003 * the length of the parsed binary patch otherwise2004 */2005static intparse_binary(struct apply_state *state,2006char*buffer,2007unsigned long size,2008struct patch *patch)2009{2010/*2011 * We have read "GIT binary patch\n"; what follows is a line2012 * that says the patch method (currently, either "literal" or2013 * "delta") and the length of data before deflating; a2014 * sequence of 'length-byte' followed by base-85 encoded data2015 * follows.2016 *2017 * When a binary patch is reversible, there is another binary2018 * hunk in the same format, starting with patch method (either2019 * "literal" or "delta") with the length of data, and a sequence2020 * of length-byte + base-85 encoded data, terminated with another2021 * empty line. This data, when applied to the postimage, produces2022 * the preimage.2023 */2024struct fragment *forward;2025struct fragment *reverse;2026int status;2027int used, used_1;20282029 forward =parse_binary_hunk(state, &buffer, &size, &status, &used);2030if(!forward && !status)2031/* there has to be one hunk (forward hunk) */2032returnerror(_("unrecognized binary patch at line%d"), state->linenr-1);2033if(status)2034/* otherwise we already gave an error message */2035return status;20362037 reverse =parse_binary_hunk(state, &buffer, &size, &status, &used_1);2038if(reverse)2039 used += used_1;2040else if(status) {2041/*2042 * Not having reverse hunk is not an error, but having2043 * a corrupt reverse hunk is.2044 */2045free((void*) forward->patch);2046free(forward);2047return status;2048}2049 forward->next = reverse;2050 patch->fragments = forward;2051 patch->is_binary =1;2052return used;2053}20542055static voidprefix_one(struct apply_state *state,char**name)2056{2057char*old_name = *name;2058if(!old_name)2059return;2060*name =prefix_filename(state->prefix, *name);2061free(old_name);2062}20632064static voidprefix_patch(struct apply_state *state,struct patch *p)2065{2066if(!state->prefix || p->is_toplevel_relative)2067return;2068prefix_one(state, &p->new_name);2069prefix_one(state, &p->old_name);2070}20712072/*2073 * include/exclude2074 */20752076static voidadd_name_limit(struct apply_state *state,2077const char*name,2078int exclude)2079{2080struct string_list_item *it;20812082 it =string_list_append(&state->limit_by_name, name);2083 it->util = exclude ? NULL : (void*)1;2084}20852086static intuse_patch(struct apply_state *state,struct patch *p)2087{2088const char*pathname = p->new_name ? p->new_name : p->old_name;2089int i;20902091/* Paths outside are not touched regardless of "--include" */2092if(0< state->prefix_length) {2093int pathlen =strlen(pathname);2094if(pathlen <= state->prefix_length ||2095memcmp(state->prefix, pathname, state->prefix_length))2096return0;2097}20982099/* See if it matches any of exclude/include rule */2100for(i =0; i < state->limit_by_name.nr; i++) {2101struct string_list_item *it = &state->limit_by_name.items[i];2102if(!wildmatch(it->string, pathname,0))2103return(it->util != NULL);2104}21052106/*2107 * If we had any include, a path that does not match any rule is2108 * not used. Otherwise, we saw bunch of exclude rules (or none)2109 * and such a path is used.2110 */2111return!state->has_include;2112}21132114/*2115 * Read the patch text in "buffer" that extends for "size" bytes; stop2116 * reading after seeing a single patch (i.e. changes to a single file).2117 * Create fragments (i.e. patch hunks) and hang them to the given patch.2118 *2119 * Returns:2120 * -1 if no header was found or parse_binary() failed,2121 * -128 on another error,2122 * the number of bytes consumed otherwise,2123 * so that the caller can call us again for the next patch.2124 */2125static intparse_chunk(struct apply_state *state,char*buffer,unsigned long size,struct patch *patch)2126{2127int hdrsize, patchsize;2128int offset =find_header(state, buffer, size, &hdrsize, patch);21292130if(offset <0)2131return offset;21322133prefix_patch(state, patch);21342135if(!use_patch(state, patch))2136 patch->ws_rule =0;2137else2138 patch->ws_rule =whitespace_rule(patch->new_name2139? patch->new_name2140: patch->old_name);21412142 patchsize =parse_single_patch(state,2143 buffer + offset + hdrsize,2144 size - offset - hdrsize,2145 patch);21462147if(patchsize <0)2148return-128;21492150if(!patchsize) {2151static const char git_binary[] ="GIT binary patch\n";2152int hd = hdrsize + offset;2153unsigned long llen =linelen(buffer + hd, size - hd);21542155if(llen ==sizeof(git_binary) -1&&2156!memcmp(git_binary, buffer + hd, llen)) {2157int used;2158 state->linenr++;2159 used =parse_binary(state, buffer + hd + llen,2160 size - hd - llen, patch);2161if(used <0)2162return-1;2163if(used)2164 patchsize = used + llen;2165else2166 patchsize =0;2167}2168else if(!memcmp(" differ\n", buffer + hd + llen -8,8)) {2169static const char*binhdr[] = {2170"Binary files ",2171"Files ",2172 NULL,2173};2174int i;2175for(i =0; binhdr[i]; i++) {2176int len =strlen(binhdr[i]);2177if(len < size - hd &&2178!memcmp(binhdr[i], buffer + hd, len)) {2179 state->linenr++;2180 patch->is_binary =1;2181 patchsize = llen;2182break;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 */2191if((state->apply || state->check) &&2192(!patch->is_binary && !metadata_changes(patch))) {2193error(_("patch with only garbage at line%d"), state->linenr);2194return-128;2195}2196}21972198return offset + hdrsize + patchsize;2199}22002201static voidreverse_patches(struct patch *p)2202{2203for(; p; p = p->next) {2204struct fragment *frag = p->fragments;22052206SWAP(p->new_name, p->old_name);2207SWAP(p->new_mode, p->old_mode);2208SWAP(p->is_new, p->is_delete);2209SWAP(p->lines_added, p->lines_deleted);2210SWAP(p->old_sha1_prefix, p->new_sha1_prefix);22112212for(; frag; frag = frag->next) {2213SWAP(frag->newpos, frag->oldpos);2214SWAP(frag->newlines, frag->oldlines);2215}2216}2217}22182219static const char pluses[] =2220"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";2221static const char minuses[]=2222"----------------------------------------------------------------------";22232224static voidshow_stats(struct apply_state *state,struct patch *patch)2225{2226struct strbuf qname = STRBUF_INIT;2227char*cp = patch->new_name ? patch->new_name : patch->old_name;2228int max, add, del;22292230quote_c_style(cp, &qname, NULL,0);22312232/*2233 * "scale" the filename2234 */2235 max = state->max_len;2236if(max >50)2237 max =50;22382239if(qname.len > max) {2240 cp =strchr(qname.buf + qname.len +3- max,'/');2241if(!cp)2242 cp = qname.buf + qname.len +3- max;2243strbuf_splice(&qname,0, cp - qname.buf,"...",3);2244}22452246if(patch->is_binary) {2247printf(" %-*s | Bin\n", max, qname.buf);2248strbuf_release(&qname);2249return;2250}22512252printf(" %-*s |", max, qname.buf);2253strbuf_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;22612262if(state->max_change >0) {2263int 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}2267printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,2268 add, pluses, del, minuses);2269}22702271static intread_old_data(struct stat *st,const char*path,struct strbuf *buf)2272{2273switch(st->st_mode & S_IFMT) {2274case S_IFLNK:2275if(strbuf_readlink(buf, path, st->st_size) <0)2276returnerror(_("unable to read symlink%s"), path);2277return0;2278case S_IFREG:2279if(strbuf_read_file(buf, path, st->st_size) != st->st_size)2280returnerror(_("unable to open or read%s"), path);2281convert_to_git(&the_index, path, buf->buf, buf->len, buf,0);2282return0;2283default:2284return-1;2285}2286}22872288/*2289 * Update the preimage, and the common lines in postimage,2290 * from buffer buf of length len. If postlen is 0 the postimage2291 * is updated in place, otherwise it's updated on a new buffer2292 * of length postlen2293 */22942295static voidupdate_pre_post_images(struct image *preimage,2296struct image *postimage,2297char*buf,2298size_t len,size_t postlen)2299{2300int i, ctx, reduced;2301char*new, *old, *fixed;2302struct image fixed_preimage;23032304/*2305 * Update the preimage with whitespace fixes. Note that we2306 * are not losing preimage->buf -- apply_one_fragment() will2307 * free "oldlines".2308 */2309prepare_image(&fixed_preimage, buf, len,1);2310assert(postlen2311? fixed_preimage.nr == preimage->nr2312: fixed_preimage.nr <= preimage->nr);2313for(i =0; i < fixed_preimage.nr; i++)2314 fixed_preimage.line[i].flag = preimage->line[i].flag;2315free(preimage->line_allocated);2316*preimage = fixed_preimage;23172318/*2319 * Adjust the common context lines in postimage. This can be2320 * done in-place when we are shrinking it with whitespace2321 * fixing, but needs a new buffer when ignoring whitespace or2322 * expanding leading tabs to spaces.2323 *2324 * We trust the caller to tell us if the update can be done2325 * in place (postlen==0) or not.2326 */2327 old = postimage->buf;2328if(postlen)2329new= postimage->buf =xmalloc(postlen);2330else2331new= old;2332 fixed = preimage->buf;23332334for(i = reduced = ctx =0; i < postimage->nr; i++) {2335size_t l_len = postimage->line[i].len;2336if(!(postimage->line[i].flag & LINE_COMMON)) {2337/* an added line -- no counterparts in preimage */2338memmove(new, old, l_len);2339 old += l_len;2340new+= l_len;2341continue;2342}23432344/* a common context -- skip it in the original postimage */2345 old += l_len;23462347/* and find the corresponding one in the fixed preimage */2348while(ctx < preimage->nr &&2349!(preimage->line[ctx].flag & LINE_COMMON)) {2350 fixed += preimage->line[ctx].len;2351 ctx++;2352}23532354/*2355 * preimage is expected to run out, if the caller2356 * fixed addition of trailing blank lines.2357 */2358if(preimage->nr <= ctx) {2359 reduced++;2360continue;2361}23622363/* and copy it in, while fixing the line length */2364 l_len = preimage->line[ctx].len;2365memcpy(new, fixed, l_len);2366new+= l_len;2367 fixed += l_len;2368 postimage->line[i].len = l_len;2369 ctx++;2370}23712372if(postlen2373? postlen <new- postimage->buf2374: postimage->len <new- postimage->buf)2375die("BUG: caller miscounted postlen: asked%d, orig =%d, used =%d",2376(int)postlen, (int) postimage->len, (int)(new- postimage->buf));23772378/* Fix the length of the whole thing */2379 postimage->len =new- postimage->buf;2380 postimage->nr -= reduced;2381}23822383static intline_by_line_fuzzy_match(struct image *img,2384struct image *preimage,2385struct image *postimage,2386unsigned longtry,2387int try_lno,2388int preimage_limit)2389{2390int i;2391size_t imgoff =0;2392size_t preoff =0;2393size_t postlen = postimage->len;2394size_t extra_chars;2395char*buf;2396char*preimage_eof;2397char*preimage_end;2398struct strbuf fixed;2399char*fixed_buf;2400size_t fixed_len;24012402for(i =0; i < preimage_limit; i++) {2403size_t prelen = preimage->line[i].len;2404size_t imglen = img->line[try_lno+i].len;24052406if(!fuzzy_matchlines(img->buf +try+ imgoff, imglen,2407 preimage->buf + preoff, prelen))2408return0;2409if(preimage->line[i].flag & LINE_COMMON)2410 postlen += imglen - prelen;2411 imgoff += imglen;2412 preoff += prelen;2413}24142415/*2416 * Ok, the preimage matches with whitespace fuzz.2417 *2418 * imgoff now holds the true length of the target that2419 * matches the preimage before the end of the file.2420 *2421 * Count the number of characters in the preimage that fall2422 * beyond the end of the file and make sure that all of them2423 * are whitespace characters. (This can only happen if2424 * we are removing blank lines at the end of the file.)2425 */2426 buf = preimage_eof = preimage->buf + preoff;2427for( ; i < preimage->nr; i++)2428 preoff += preimage->line[i].len;2429 preimage_end = preimage->buf + preoff;2430for( ; buf < preimage_end; buf++)2431if(!isspace(*buf))2432return0;24332434/*2435 * Update the preimage and the common postimage context2436 * lines to use the same whitespace as the target.2437 * If whitespace is missing in the target (i.e.2438 * if the preimage extends beyond the end of the file),2439 * use the whitespace from the preimage.2440 */2441 extra_chars = preimage_end - preimage_eof;2442strbuf_init(&fixed, imgoff + extra_chars);2443strbuf_add(&fixed, img->buf +try, imgoff);2444strbuf_add(&fixed, preimage_eof, extra_chars);2445 fixed_buf =strbuf_detach(&fixed, &fixed_len);2446update_pre_post_images(preimage, postimage,2447 fixed_buf, fixed_len, postlen);2448return1;2449}24502451static intmatch_fragment(struct apply_state *state,2452struct image *img,2453struct image *preimage,2454struct image *postimage,2455unsigned longtry,2456int try_lno,2457unsigned ws_rule,2458int match_beginning,int match_end)2459{2460int i;2461char*fixed_buf, *buf, *orig, *target;2462struct strbuf fixed;2463size_t fixed_len, postlen;2464int preimage_limit;24652466if(preimage->nr + try_lno <= img->nr) {2467/*2468 * The hunk falls within the boundaries of img.2469 */2470 preimage_limit = preimage->nr;2471if(match_end && (preimage->nr + try_lno != img->nr))2472return0;2473}else if(state->ws_error_action == correct_ws_error &&2474(ws_rule & WS_BLANK_AT_EOF)) {2475/*2476 * This hunk extends beyond the end of img, and we are2477 * removing blank lines at the end of the file. This2478 * many lines from the beginning of the preimage must2479 * match with img, and the remainder of the preimage2480 * must be blank.2481 */2482 preimage_limit = img->nr - try_lno;2483}else{2484/*2485 * The hunk extends beyond the end of the img and2486 * we are not removing blanks at the end, so we2487 * should reject the hunk at this position.2488 */2489return0;2490}24912492if(match_beginning && try_lno)2493return0;24942495/* Quick hash check */2496for(i =0; i < preimage_limit; i++)2497if((img->line[try_lno + i].flag & LINE_PATCHED) ||2498(preimage->line[i].hash != img->line[try_lno + i].hash))2499return0;25002501if(preimage_limit == preimage->nr) {2502/*2503 * Do we have an exact match? If we were told to match2504 * at the end, size must be exactly at try+fragsize,2505 * otherwise try+fragsize must be still within the preimage,2506 * and either case, the old piece should match the preimage2507 * exactly.2508 */2509if((match_end2510? (try+ preimage->len == img->len)2511: (try+ preimage->len <= img->len)) &&2512!memcmp(img->buf +try, preimage->buf, preimage->len))2513return1;2514}else{2515/*2516 * The preimage extends beyond the end of img, so2517 * there cannot be an exact match.2518 *2519 * There must be one non-blank context line that match2520 * a line before the end of img.2521 */2522char*buf_end;25232524 buf = preimage->buf;2525 buf_end = buf;2526for(i =0; i < preimage_limit; i++)2527 buf_end += preimage->line[i].len;25282529for( ; buf < buf_end; buf++)2530if(!isspace(*buf))2531break;2532if(buf == buf_end)2533return0;2534}25352536/*2537 * No exact match. If we are ignoring whitespace, run a line-by-line2538 * fuzzy matching. We collect all the line length information because2539 * we need it to adjust whitespace if we match.2540 */2541if(state->ws_ignore_action == ignore_ws_change)2542returnline_by_line_fuzzy_match(img, preimage, postimage,2543try, try_lno, preimage_limit);25442545if(state->ws_error_action != correct_ws_error)2546return0;25472548/*2549 * The hunk does not apply byte-by-byte, but the hash says2550 * it might with whitespace fuzz. We weren't asked to2551 * ignore whitespace, we were asked to correct whitespace2552 * errors, so let's try matching after whitespace correction.2553 *2554 * While checking the preimage against the target, whitespace2555 * errors in both fixed, we count how large the corresponding2556 * postimage needs to be. The postimage prepared by2557 * apply_one_fragment() has whitespace errors fixed on added2558 * lines already, but the common lines were propagated as-is,2559 * which may become longer when their whitespace errors are2560 * fixed.2561 */25622563/* First count added lines in postimage */2564 postlen =0;2565for(i =0; i < postimage->nr; i++) {2566if(!(postimage->line[i].flag & LINE_COMMON))2567 postlen += postimage->line[i].len;2568}25692570/*2571 * The preimage may extend beyond the end of the file,2572 * but in this loop we will only handle the part of the2573 * preimage that falls within the file.2574 */2575strbuf_init(&fixed, preimage->len +1);2576 orig = preimage->buf;2577 target = img->buf +try;2578for(i =0; i < preimage_limit; i++) {2579size_t oldlen = preimage->line[i].len;2580size_t tgtlen = img->line[try_lno + i].len;2581size_t fixstart = fixed.len;2582struct strbuf tgtfix;2583int match;25842585/* Try fixing the line in the preimage */2586ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);25872588/* Try fixing the line in the target */2589strbuf_init(&tgtfix, tgtlen);2590ws_fix_copy(&tgtfix, target, tgtlen, ws_rule, NULL);25912592/*2593 * If they match, either the preimage was based on2594 * a version before our tree fixed whitespace breakage,2595 * or we are lacking a whitespace-fix patch the tree2596 * the preimage was based on already had (i.e. target2597 * has whitespace breakage, the preimage doesn't).2598 * In either case, we are fixing the whitespace breakages2599 * so we might as well take the fix together with their2600 * real change.2601 */2602 match = (tgtfix.len == fixed.len - fixstart &&2603!memcmp(tgtfix.buf, fixed.buf + fixstart,2604 fixed.len - fixstart));26052606/* Add the length if this is common with the postimage */2607if(preimage->line[i].flag & LINE_COMMON)2608 postlen += tgtfix.len;26092610strbuf_release(&tgtfix);2611if(!match)2612goto unmatch_exit;26132614 orig += oldlen;2615 target += tgtlen;2616}261726182619/*2620 * Now handle the lines in the preimage that falls beyond the2621 * end of the file (if any). They will only match if they are2622 * empty or only contain whitespace (if WS_BLANK_AT_EOL is2623 * false).2624 */2625for( ; i < preimage->nr; i++) {2626size_t fixstart = fixed.len;/* start of the fixed preimage */2627size_t oldlen = preimage->line[i].len;2628int j;26292630/* Try fixing the line in the preimage */2631ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);26322633for(j = fixstart; j < fixed.len; j++)2634if(!isspace(fixed.buf[j]))2635goto unmatch_exit;26362637 orig += oldlen;2638}26392640/*2641 * Yes, the preimage is based on an older version that still2642 * has whitespace breakages unfixed, and fixing them makes the2643 * hunk match. Update the context lines in the postimage.2644 */2645 fixed_buf =strbuf_detach(&fixed, &fixed_len);2646if(postlen < postimage->len)2647 postlen =0;2648update_pre_post_images(preimage, postimage,2649 fixed_buf, fixed_len, postlen);2650return1;26512652 unmatch_exit:2653strbuf_release(&fixed);2654return0;2655}26562657static intfind_pos(struct apply_state *state,2658struct image *img,2659struct image *preimage,2660struct image *postimage,2661int line,2662unsigned ws_rule,2663int match_beginning,int match_end)2664{2665int i;2666unsigned long backwards, forwards,try;2667int backwards_lno, forwards_lno, try_lno;26682669/*2670 * If match_beginning or match_end is specified, there is no2671 * point starting from a wrong line that will never match and2672 * wander around and wait for a match at the specified end.2673 */2674if(match_beginning)2675 line =0;2676else if(match_end)2677 line = img->nr - preimage->nr;26782679/*2680 * Because the comparison is unsigned, the following test2681 * will also take care of a negative line number that can2682 * result when match_end and preimage is larger than the target.2683 */2684if((size_t) line > img->nr)2685 line = img->nr;26862687try=0;2688for(i =0; i < line; i++)2689try+= img->line[i].len;26902691/*2692 * There's probably some smart way to do this, but I'll leave2693 * that to the smart and beautiful people. I'm simple and stupid.2694 */2695 backwards =try;2696 backwards_lno = line;2697 forwards =try;2698 forwards_lno = line;2699 try_lno = line;27002701for(i =0; ; i++) {2702if(match_fragment(state, img, preimage, postimage,2703try, try_lno, ws_rule,2704 match_beginning, match_end))2705return try_lno;27062707 again:2708if(backwards_lno ==0&& forwards_lno == img->nr)2709break;27102711if(i &1) {2712if(backwards_lno ==0) {2713 i++;2714goto again;2715}2716 backwards_lno--;2717 backwards -= img->line[backwards_lno].len;2718try= backwards;2719 try_lno = backwards_lno;2720}else{2721if(forwards_lno == img->nr) {2722 i++;2723goto again;2724}2725 forwards += img->line[forwards_lno].len;2726 forwards_lno++;2727try= forwards;2728 try_lno = forwards_lno;2729}27302731}2732return-1;2733}27342735static voidremove_first_line(struct image *img)2736{2737 img->buf += img->line[0].len;2738 img->len -= img->line[0].len;2739 img->line++;2740 img->nr--;2741}27422743static voidremove_last_line(struct image *img)2744{2745 img->len -= img->line[--img->nr].len;2746}27472748/*2749 * The change from "preimage" and "postimage" has been found to2750 * apply at applied_pos (counts in line numbers) in "img".2751 * Update "img" to remove "preimage" and replace it with "postimage".2752 */2753static voidupdate_image(struct apply_state *state,2754struct image *img,2755int applied_pos,2756struct image *preimage,2757struct image *postimage)2758{2759/*2760 * remove the copy of preimage at offset in img2761 * and replace it with postimage2762 */2763int i, nr;2764size_t remove_count, insert_count, applied_at =0;2765char*result;2766int preimage_limit;27672768/*2769 * If we are removing blank lines at the end of img,2770 * the preimage may extend beyond the end.2771 * If that is the case, we must be careful only to2772 * remove the part of the preimage that falls within2773 * the boundaries of img. Initialize preimage_limit2774 * to the number of lines in the preimage that falls2775 * within the boundaries.2776 */2777 preimage_limit = preimage->nr;2778if(preimage_limit > img->nr - applied_pos)2779 preimage_limit = img->nr - applied_pos;27802781for(i =0; i < applied_pos; i++)2782 applied_at += img->line[i].len;27832784 remove_count =0;2785for(i =0; i < preimage_limit; i++)2786 remove_count += img->line[applied_pos + i].len;2787 insert_count = postimage->len;27882789/* Adjust the contents */2790 result =xmalloc(st_add3(st_sub(img->len, remove_count), insert_count,1));2791memcpy(result, img->buf, applied_at);2792memcpy(result + applied_at, postimage->buf, postimage->len);2793memcpy(result + applied_at + postimage->len,2794 img->buf + (applied_at + remove_count),2795 img->len - (applied_at + remove_count));2796free(img->buf);2797 img->buf = result;2798 img->len += insert_count - remove_count;2799 result[img->len] ='\0';28002801/* Adjust the line table */2802 nr = img->nr + postimage->nr - preimage_limit;2803if(preimage_limit < postimage->nr) {2804/*2805 * NOTE: this knows that we never call remove_first_line()2806 * on anything other than pre/post image.2807 */2808REALLOC_ARRAY(img->line, nr);2809 img->line_allocated = img->line;2810}2811if(preimage_limit != postimage->nr)2812memmove(img->line + applied_pos + postimage->nr,2813 img->line + applied_pos + preimage_limit,2814(img->nr - (applied_pos + preimage_limit)) *2815sizeof(*img->line));2816memcpy(img->line + applied_pos,2817 postimage->line,2818 postimage->nr *sizeof(*img->line));2819if(!state->allow_overlap)2820for(i =0; i < postimage->nr; i++)2821 img->line[applied_pos + i].flag |= LINE_PATCHED;2822 img->nr = nr;2823}28242825/*2826 * Use the patch-hunk text in "frag" to prepare two images (preimage and2827 * postimage) for the hunk. Find lines that match "preimage" in "img" and2828 * replace the part of "img" with "postimage" text.2829 */2830static intapply_one_fragment(struct apply_state *state,2831struct image *img,struct fragment *frag,2832int inaccurate_eof,unsigned ws_rule,2833int nth_fragment)2834{2835int match_beginning, match_end;2836const char*patch = frag->patch;2837int size = frag->size;2838char*old, *oldlines;2839struct strbuf newlines;2840int new_blank_lines_at_end =0;2841int found_new_blank_lines_at_end =0;2842int hunk_linenr = frag->linenr;2843unsigned long leading, trailing;2844int pos, applied_pos;2845struct image preimage;2846struct image postimage;28472848memset(&preimage,0,sizeof(preimage));2849memset(&postimage,0,sizeof(postimage));2850 oldlines =xmalloc(size);2851strbuf_init(&newlines, size);28522853 old = oldlines;2854while(size >0) {2855char first;2856int len =linelen(patch, size);2857int plen;2858int added_blank_line =0;2859int is_blank_context =0;2860size_t start;28612862if(!len)2863break;28642865/*2866 * "plen" is how much of the line we should use for2867 * the actual patch data. Normally we just remove the2868 * first character on the line, but if the line is2869 * followed by "\ No newline", then we also remove the2870 * last one (which is the newline, of course).2871 */2872 plen = len -1;2873if(len < size && patch[len] =='\\')2874 plen--;2875 first = *patch;2876if(state->apply_in_reverse) {2877if(first =='-')2878 first ='+';2879else if(first =='+')2880 first ='-';2881}28822883switch(first) {2884case'\n':2885/* Newer GNU diff, empty context line */2886if(plen <0)2887/* ... followed by '\No newline'; nothing */2888break;2889*old++ ='\n';2890strbuf_addch(&newlines,'\n');2891add_line_info(&preimage,"\n",1, LINE_COMMON);2892add_line_info(&postimage,"\n",1, LINE_COMMON);2893 is_blank_context =1;2894break;2895case' ':2896if(plen && (ws_rule & WS_BLANK_AT_EOF) &&2897ws_blank_line(patch +1, plen, ws_rule))2898 is_blank_context =1;2899case'-':2900memcpy(old, patch +1, plen);2901add_line_info(&preimage, old, plen,2902(first ==' '? LINE_COMMON :0));2903 old += plen;2904if(first =='-')2905break;2906/* Fall-through for ' ' */2907case'+':2908/* --no-add does not add new lines */2909if(first =='+'&& state->no_add)2910break;29112912 start = newlines.len;2913if(first !='+'||2914!state->whitespace_error ||2915 state->ws_error_action != correct_ws_error) {2916strbuf_add(&newlines, patch +1, plen);2917}2918else{2919ws_fix_copy(&newlines, patch +1, plen, ws_rule, &state->applied_after_fixing_ws);2920}2921add_line_info(&postimage, newlines.buf + start, newlines.len - start,2922(first =='+'?0: LINE_COMMON));2923if(first =='+'&&2924(ws_rule & WS_BLANK_AT_EOF) &&2925ws_blank_line(patch +1, plen, ws_rule))2926 added_blank_line =1;2927break;2928case'@':case'\\':2929/* Ignore it, we already handled it */2930break;2931default:2932if(state->apply_verbosity > verbosity_normal)2933error(_("invalid start of line: '%c'"), first);2934 applied_pos = -1;2935goto out;2936}2937if(added_blank_line) {2938if(!new_blank_lines_at_end)2939 found_new_blank_lines_at_end = hunk_linenr;2940 new_blank_lines_at_end++;2941}2942else if(is_blank_context)2943;2944else2945 new_blank_lines_at_end =0;2946 patch += len;2947 size -= len;2948 hunk_linenr++;2949}2950if(inaccurate_eof &&2951 old > oldlines && old[-1] =='\n'&&2952 newlines.len >0&& newlines.buf[newlines.len -1] =='\n') {2953 old--;2954strbuf_setlen(&newlines, newlines.len -1);2955}29562957 leading = frag->leading;2958 trailing = frag->trailing;29592960/*2961 * A hunk to change lines at the beginning would begin with2962 * @@ -1,L +N,M @@2963 * but we need to be careful. -U0 that inserts before the second2964 * line also has this pattern.2965 *2966 * And a hunk to add to an empty file would begin with2967 * @@ -0,0 +N,M @@2968 *2969 * In other words, a hunk that is (frag->oldpos <= 1) with or2970 * without leading context must match at the beginning.2971 */2972 match_beginning = (!frag->oldpos ||2973(frag->oldpos ==1&& !state->unidiff_zero));29742975/*2976 * A hunk without trailing lines must match at the end.2977 * However, we simply cannot tell if a hunk must match end2978 * from the lack of trailing lines if the patch was generated2979 * with unidiff without any context.2980 */2981 match_end = !state->unidiff_zero && !trailing;29822983 pos = frag->newpos ? (frag->newpos -1) :0;2984 preimage.buf = oldlines;2985 preimage.len = old - oldlines;2986 postimage.buf = newlines.buf;2987 postimage.len = newlines.len;2988 preimage.line = preimage.line_allocated;2989 postimage.line = postimage.line_allocated;29902991for(;;) {29922993 applied_pos =find_pos(state, img, &preimage, &postimage, pos,2994 ws_rule, match_beginning, match_end);29952996if(applied_pos >=0)2997break;29982999/* Am I at my context limits? */3000if((leading <= state->p_context) && (trailing <= state->p_context))3001break;3002if(match_beginning || match_end) {3003 match_beginning = match_end =0;3004continue;3005}30063007/*3008 * Reduce the number of context lines; reduce both3009 * leading and trailing if they are equal otherwise3010 * just reduce the larger context.3011 */3012if(leading >= trailing) {3013remove_first_line(&preimage);3014remove_first_line(&postimage);3015 pos--;3016 leading--;3017}3018if(trailing > leading) {3019remove_last_line(&preimage);3020remove_last_line(&postimage);3021 trailing--;3022}3023}30243025if(applied_pos >=0) {3026if(new_blank_lines_at_end &&3027 preimage.nr + applied_pos >= img->nr &&3028(ws_rule & WS_BLANK_AT_EOF) &&3029 state->ws_error_action != nowarn_ws_error) {3030record_ws_error(state, WS_BLANK_AT_EOF,"+",1,3031 found_new_blank_lines_at_end);3032if(state->ws_error_action == correct_ws_error) {3033while(new_blank_lines_at_end--)3034remove_last_line(&postimage);3035}3036/*3037 * We would want to prevent write_out_results()3038 * from taking place in apply_patch() that follows3039 * the callchain led us here, which is:3040 * apply_patch->check_patch_list->check_patch->3041 * apply_data->apply_fragments->apply_one_fragment3042 */3043if(state->ws_error_action == die_on_ws_error)3044 state->apply =0;3045}30463047if(state->apply_verbosity > verbosity_normal && applied_pos != pos) {3048int offset = applied_pos - pos;3049if(state->apply_in_reverse)3050 offset =0- offset;3051fprintf_ln(stderr,3052Q_("Hunk #%dsucceeded at%d(offset%dline).",3053"Hunk #%dsucceeded at%d(offset%dlines).",3054 offset),3055 nth_fragment, applied_pos +1, offset);3056}30573058/*3059 * Warn if it was necessary to reduce the number3060 * of context lines.3061 */3062if((leading != frag->leading ||3063 trailing != frag->trailing) && state->apply_verbosity > verbosity_silent)3064fprintf_ln(stderr,_("Context reduced to (%ld/%ld)"3065" to apply fragment at%d"),3066 leading, trailing, applied_pos+1);3067update_image(state, img, applied_pos, &preimage, &postimage);3068}else{3069if(state->apply_verbosity > verbosity_normal)3070error(_("while searching for:\n%.*s"),3071(int)(old - oldlines), oldlines);3072}30733074out:3075free(oldlines);3076strbuf_release(&newlines);3077free(preimage.line_allocated);3078free(postimage.line_allocated);30793080return(applied_pos <0);3081}30823083static intapply_binary_fragment(struct apply_state *state,3084struct image *img,3085struct patch *patch)3086{3087struct fragment *fragment = patch->fragments;3088unsigned long len;3089void*dst;30903091if(!fragment)3092returnerror(_("missing binary patch data for '%s'"),3093 patch->new_name ?3094 patch->new_name :3095 patch->old_name);30963097/* Binary patch is irreversible without the optional second hunk */3098if(state->apply_in_reverse) {3099if(!fragment->next)3100returnerror(_("cannot reverse-apply a binary patch "3101"without the reverse hunk to '%s'"),3102 patch->new_name3103? patch->new_name : patch->old_name);3104 fragment = fragment->next;3105}3106switch(fragment->binary_patch_method) {3107case BINARY_DELTA_DEFLATED:3108 dst =patch_delta(img->buf, img->len, fragment->patch,3109 fragment->size, &len);3110if(!dst)3111return-1;3112clear_image(img);3113 img->buf = dst;3114 img->len = len;3115return0;3116case BINARY_LITERAL_DEFLATED:3117clear_image(img);3118 img->len = fragment->size;3119 img->buf =xmemdupz(fragment->patch, img->len);3120return0;3121}3122return-1;3123}31243125/*3126 * Replace "img" with the result of applying the binary patch.3127 * The binary patch data itself in patch->fragment is still kept3128 * but the preimage prepared by the caller in "img" is freed here3129 * or in the helper function apply_binary_fragment() this calls.3130 */3131static intapply_binary(struct apply_state *state,3132struct image *img,3133struct patch *patch)3134{3135const char*name = patch->old_name ? patch->old_name : patch->new_name;3136struct object_id oid;31373138/*3139 * For safety, we require patch index line to contain3140 * full 40-byte textual SHA1 for old and new, at least for now.3141 */3142if(strlen(patch->old_sha1_prefix) !=40||3143strlen(patch->new_sha1_prefix) !=40||3144get_oid_hex(patch->old_sha1_prefix, &oid) ||3145get_oid_hex(patch->new_sha1_prefix, &oid))3146returnerror(_("cannot apply binary patch to '%s' "3147"without full index line"), name);31483149if(patch->old_name) {3150/*3151 * See if the old one matches what the patch3152 * applies to.3153 */3154hash_sha1_file(img->buf, img->len, blob_type, oid.hash);3155if(strcmp(oid_to_hex(&oid), patch->old_sha1_prefix))3156returnerror(_("the patch applies to '%s' (%s), "3157"which does not match the "3158"current contents."),3159 name,oid_to_hex(&oid));3160}3161else{3162/* Otherwise, the old one must be empty. */3163if(img->len)3164returnerror(_("the patch applies to an empty "3165"'%s' but it is not empty"), name);3166}31673168get_oid_hex(patch->new_sha1_prefix, &oid);3169if(is_null_oid(&oid)) {3170clear_image(img);3171return0;/* deletion patch */3172}31733174if(has_sha1_file(oid.hash)) {3175/* We already have the postimage */3176enum object_type type;3177unsigned long size;3178char*result;31793180 result =read_sha1_file(oid.hash, &type, &size);3181if(!result)3182returnerror(_("the necessary postimage%sfor "3183"'%s' cannot be read"),3184 patch->new_sha1_prefix, name);3185clear_image(img);3186 img->buf = result;3187 img->len = size;3188}else{3189/*3190 * We have verified buf matches the preimage;3191 * apply the patch data to it, which is stored3192 * in the patch->fragments->{patch,size}.3193 */3194if(apply_binary_fragment(state, img, patch))3195returnerror(_("binary patch does not apply to '%s'"),3196 name);31973198/* verify that the result matches */3199hash_sha1_file(img->buf, img->len, blob_type, oid.hash);3200if(strcmp(oid_to_hex(&oid), patch->new_sha1_prefix))3201returnerror(_("binary patch to '%s' creates incorrect result (expecting%s, got%s)"),3202 name, patch->new_sha1_prefix,oid_to_hex(&oid));3203}32043205return0;3206}32073208static intapply_fragments(struct apply_state *state,struct image *img,struct patch *patch)3209{3210struct fragment *frag = patch->fragments;3211const char*name = patch->old_name ? patch->old_name : patch->new_name;3212unsigned ws_rule = patch->ws_rule;3213unsigned inaccurate_eof = patch->inaccurate_eof;3214int nth =0;32153216if(patch->is_binary)3217returnapply_binary(state, img, patch);32183219while(frag) {3220 nth++;3221if(apply_one_fragment(state, img, frag, inaccurate_eof, ws_rule, nth)) {3222error(_("patch failed:%s:%ld"), name, frag->oldpos);3223if(!state->apply_with_reject)3224return-1;3225 frag->rejected =1;3226}3227 frag = frag->next;3228}3229return0;3230}32313232static intread_blob_object(struct strbuf *buf,const struct object_id *oid,unsigned mode)3233{3234if(S_ISGITLINK(mode)) {3235strbuf_grow(buf,100);3236strbuf_addf(buf,"Subproject commit%s\n",oid_to_hex(oid));3237}else{3238enum object_type type;3239unsigned long sz;3240char*result;32413242 result =read_sha1_file(oid->hash, &type, &sz);3243if(!result)3244return-1;3245/* XXX read_sha1_file NUL-terminates */3246strbuf_attach(buf, result, sz, sz +1);3247}3248return0;3249}32503251static intread_file_or_gitlink(const struct cache_entry *ce,struct strbuf *buf)3252{3253if(!ce)3254return0;3255returnread_blob_object(buf, &ce->oid, ce->ce_mode);3256}32573258static struct patch *in_fn_table(struct apply_state *state,const char*name)3259{3260struct string_list_item *item;32613262if(name == NULL)3263return NULL;32643265 item =string_list_lookup(&state->fn_table, name);3266if(item != NULL)3267return(struct patch *)item->util;32683269return NULL;3270}32713272/*3273 * item->util in the filename table records the status of the path.3274 * Usually it points at a patch (whose result records the contents3275 * of it after applying it), but it could be PATH_WAS_DELETED for a3276 * path that a previously applied patch has already removed, or3277 * PATH_TO_BE_DELETED for a path that a later patch would remove.3278 *3279 * The latter is needed to deal with a case where two paths A and B3280 * are swapped by first renaming A to B and then renaming B to A;3281 * moving A to B should not be prevented due to presence of B as we3282 * will remove it in a later patch.3283 */3284#define PATH_TO_BE_DELETED ((struct patch *) -2)3285#define PATH_WAS_DELETED ((struct patch *) -1)32863287static intto_be_deleted(struct patch *patch)3288{3289return patch == PATH_TO_BE_DELETED;3290}32913292static intwas_deleted(struct patch *patch)3293{3294return patch == PATH_WAS_DELETED;3295}32963297static voidadd_to_fn_table(struct apply_state *state,struct patch *patch)3298{3299struct string_list_item *item;33003301/*3302 * Always add new_name unless patch is a deletion3303 * This should cover the cases for normal diffs,3304 * file creations and copies3305 */3306if(patch->new_name != NULL) {3307 item =string_list_insert(&state->fn_table, patch->new_name);3308 item->util = patch;3309}33103311/*3312 * store a failure on rename/deletion cases because3313 * later chunks shouldn't patch old names3314 */3315if((patch->new_name == NULL) || (patch->is_rename)) {3316 item =string_list_insert(&state->fn_table, patch->old_name);3317 item->util = PATH_WAS_DELETED;3318}3319}33203321static voidprepare_fn_table(struct apply_state *state,struct patch *patch)3322{3323/*3324 * store information about incoming file deletion3325 */3326while(patch) {3327if((patch->new_name == NULL) || (patch->is_rename)) {3328struct string_list_item *item;3329 item =string_list_insert(&state->fn_table, patch->old_name);3330 item->util = PATH_TO_BE_DELETED;3331}3332 patch = patch->next;3333}3334}33353336static intcheckout_target(struct index_state *istate,3337struct cache_entry *ce,struct stat *st)3338{3339struct checkout costate = CHECKOUT_INIT;33403341 costate.refresh_cache =1;3342 costate.istate = istate;3343if(checkout_entry(ce, &costate, NULL) ||lstat(ce->name, st))3344returnerror(_("cannot checkout%s"), ce->name);3345return0;3346}33473348static struct patch *previous_patch(struct apply_state *state,3349struct patch *patch,3350int*gone)3351{3352struct patch *previous;33533354*gone =0;3355if(patch->is_copy || patch->is_rename)3356return NULL;/* "git" patches do not depend on the order */33573358 previous =in_fn_table(state, patch->old_name);3359if(!previous)3360return NULL;33613362if(to_be_deleted(previous))3363return NULL;/* the deletion hasn't happened yet */33643365if(was_deleted(previous))3366*gone =1;33673368return previous;3369}33703371static intverify_index_match(const struct cache_entry *ce,struct stat *st)3372{3373if(S_ISGITLINK(ce->ce_mode)) {3374if(!S_ISDIR(st->st_mode))3375return-1;3376return0;3377}3378returnce_match_stat(ce, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);3379}33803381#define SUBMODULE_PATCH_WITHOUT_INDEX 133823383static intload_patch_target(struct apply_state *state,3384struct strbuf *buf,3385const struct cache_entry *ce,3386struct stat *st,3387const char*name,3388unsigned expected_mode)3389{3390if(state->cached || state->check_index) {3391if(read_file_or_gitlink(ce, buf))3392returnerror(_("failed to read%s"), name);3393}else if(name) {3394if(S_ISGITLINK(expected_mode)) {3395if(ce)3396returnread_file_or_gitlink(ce, buf);3397else3398return SUBMODULE_PATCH_WITHOUT_INDEX;3399}else if(has_symlink_leading_path(name,strlen(name))) {3400returnerror(_("reading from '%s' beyond a symbolic link"), name);3401}else{3402if(read_old_data(st, name, buf))3403returnerror(_("failed to read%s"), name);3404}3405}3406return0;3407}34083409/*3410 * We are about to apply "patch"; populate the "image" with the3411 * current version we have, from the working tree or from the index,3412 * depending on the situation e.g. --cached/--index. If we are3413 * applying a non-git patch that incrementally updates the tree,3414 * we read from the result of a previous diff.3415 */3416static intload_preimage(struct apply_state *state,3417struct image *image,3418struct patch *patch,struct stat *st,3419const struct cache_entry *ce)3420{3421struct strbuf buf = STRBUF_INIT;3422size_t len;3423char*img;3424struct patch *previous;3425int status;34263427 previous =previous_patch(state, patch, &status);3428if(status)3429returnerror(_("path%shas been renamed/deleted"),3430 patch->old_name);3431if(previous) {3432/* We have a patched copy in memory; use that. */3433strbuf_add(&buf, previous->result, previous->resultsize);3434}else{3435 status =load_patch_target(state, &buf, ce, st,3436 patch->old_name, patch->old_mode);3437if(status <0)3438return status;3439else if(status == SUBMODULE_PATCH_WITHOUT_INDEX) {3440/*3441 * There is no way to apply subproject3442 * patch without looking at the index.3443 * NEEDSWORK: shouldn't this be flagged3444 * as an error???3445 */3446free_fragment_list(patch->fragments);3447 patch->fragments = NULL;3448}else if(status) {3449returnerror(_("failed to read%s"), patch->old_name);3450}3451}34523453 img =strbuf_detach(&buf, &len);3454prepare_image(image, img, len, !patch->is_binary);3455return0;3456}34573458static intthree_way_merge(struct image *image,3459char*path,3460const struct object_id *base,3461const struct object_id *ours,3462const struct object_id *theirs)3463{3464 mmfile_t base_file, our_file, their_file;3465 mmbuffer_t result = { NULL };3466int status;34673468read_mmblob(&base_file, base);3469read_mmblob(&our_file, ours);3470read_mmblob(&their_file, theirs);3471 status =ll_merge(&result, path,3472&base_file,"base",3473&our_file,"ours",3474&their_file,"theirs", NULL);3475free(base_file.ptr);3476free(our_file.ptr);3477free(their_file.ptr);3478if(status <0|| !result.ptr) {3479free(result.ptr);3480return-1;3481}3482clear_image(image);3483 image->buf = result.ptr;3484 image->len = result.size;34853486return status;3487}34883489/*3490 * When directly falling back to add/add three-way merge, we read from3491 * the current contents of the new_name. In no cases other than that3492 * this function will be called.3493 */3494static intload_current(struct apply_state *state,3495struct image *image,3496struct patch *patch)3497{3498struct strbuf buf = STRBUF_INIT;3499int status, pos;3500size_t len;3501char*img;3502struct stat st;3503struct cache_entry *ce;3504char*name = patch->new_name;3505unsigned mode = patch->new_mode;35063507if(!patch->is_new)3508die("BUG: patch to%sis not a creation", patch->old_name);35093510 pos =cache_name_pos(name,strlen(name));3511if(pos <0)3512returnerror(_("%s: does not exist in index"), name);3513 ce = active_cache[pos];3514if(lstat(name, &st)) {3515if(errno != ENOENT)3516returnerror_errno("%s", name);3517if(checkout_target(&the_index, ce, &st))3518return-1;3519}3520if(verify_index_match(ce, &st))3521returnerror(_("%s: does not match index"), name);35223523 status =load_patch_target(state, &buf, ce, &st, name, mode);3524if(status <0)3525return status;3526else if(status)3527return-1;3528 img =strbuf_detach(&buf, &len);3529prepare_image(image, img, len, !patch->is_binary);3530return0;3531}35323533static inttry_threeway(struct apply_state *state,3534struct image *image,3535struct patch *patch,3536struct stat *st,3537const struct cache_entry *ce)3538{3539struct object_id pre_oid, post_oid, our_oid;3540struct strbuf buf = STRBUF_INIT;3541size_t len;3542int status;3543char*img;3544struct image tmp_image;35453546/* No point falling back to 3-way merge in these cases */3547if(patch->is_delete ||3548S_ISGITLINK(patch->old_mode) ||S_ISGITLINK(patch->new_mode))3549return-1;35503551/* Preimage the patch was prepared for */3552if(patch->is_new)3553write_sha1_file("",0, blob_type, pre_oid.hash);3554else if(get_sha1(patch->old_sha1_prefix, pre_oid.hash) ||3555read_blob_object(&buf, &pre_oid, patch->old_mode))3556returnerror(_("repository lacks the necessary blob to fall back on 3-way merge."));35573558if(state->apply_verbosity > verbosity_silent)3559fprintf(stderr,_("Falling back to three-way merge...\n"));35603561 img =strbuf_detach(&buf, &len);3562prepare_image(&tmp_image, img, len,1);3563/* Apply the patch to get the post image */3564if(apply_fragments(state, &tmp_image, patch) <0) {3565clear_image(&tmp_image);3566return-1;3567}3568/* post_oid is theirs */3569write_sha1_file(tmp_image.buf, tmp_image.len, blob_type, post_oid.hash);3570clear_image(&tmp_image);35713572/* our_oid is ours */3573if(patch->is_new) {3574if(load_current(state, &tmp_image, patch))3575returnerror(_("cannot read the current contents of '%s'"),3576 patch->new_name);3577}else{3578if(load_preimage(state, &tmp_image, patch, st, ce))3579returnerror(_("cannot read the current contents of '%s'"),3580 patch->old_name);3581}3582write_sha1_file(tmp_image.buf, tmp_image.len, blob_type, our_oid.hash);3583clear_image(&tmp_image);35843585/* in-core three-way merge between post and our using pre as base */3586 status =three_way_merge(image, patch->new_name,3587&pre_oid, &our_oid, &post_oid);3588if(status <0) {3589if(state->apply_verbosity > verbosity_silent)3590fprintf(stderr,3591_("Failed to fall back on three-way merge...\n"));3592return status;3593}35943595if(status) {3596 patch->conflicted_threeway =1;3597if(patch->is_new)3598oidclr(&patch->threeway_stage[0]);3599else3600oidcpy(&patch->threeway_stage[0], &pre_oid);3601oidcpy(&patch->threeway_stage[1], &our_oid);3602oidcpy(&patch->threeway_stage[2], &post_oid);3603if(state->apply_verbosity > verbosity_silent)3604fprintf(stderr,3605_("Applied patch to '%s' with conflicts.\n"),3606 patch->new_name);3607}else{3608if(state->apply_verbosity > verbosity_silent)3609fprintf(stderr,3610_("Applied patch to '%s' cleanly.\n"),3611 patch->new_name);3612}3613return0;3614}36153616static intapply_data(struct apply_state *state,struct patch *patch,3617struct stat *st,const struct cache_entry *ce)3618{3619struct image image;36203621if(load_preimage(state, &image, patch, st, ce) <0)3622return-1;36233624if(patch->direct_to_threeway ||3625apply_fragments(state, &image, patch) <0) {3626/* Note: with --reject, apply_fragments() returns 0 */3627if(!state->threeway ||try_threeway(state, &image, patch, st, ce) <0)3628return-1;3629}3630 patch->result = image.buf;3631 patch->resultsize = image.len;3632add_to_fn_table(state, patch);3633free(image.line_allocated);36343635if(0< patch->is_delete && patch->resultsize)3636returnerror(_("removal patch leaves file contents"));36373638return0;3639}36403641/*3642 * If "patch" that we are looking at modifies or deletes what we have,3643 * we would want it not to lose any local modification we have, either3644 * in the working tree or in the index.3645 *3646 * This also decides if a non-git patch is a creation patch or a3647 * modification to an existing empty file. We do not check the state3648 * of the current tree for a creation patch in this function; the caller3649 * check_patch() separately makes sure (and errors out otherwise) that3650 * the path the patch creates does not exist in the current tree.3651 */3652static intcheck_preimage(struct apply_state *state,3653struct patch *patch,3654struct cache_entry **ce,3655struct stat *st)3656{3657const char*old_name = patch->old_name;3658struct patch *previous = NULL;3659int stat_ret =0, status;3660unsigned st_mode =0;36613662if(!old_name)3663return0;36643665assert(patch->is_new <=0);3666 previous =previous_patch(state, patch, &status);36673668if(status)3669returnerror(_("path%shas been renamed/deleted"), old_name);3670if(previous) {3671 st_mode = previous->new_mode;3672}else if(!state->cached) {3673 stat_ret =lstat(old_name, st);3674if(stat_ret && errno != ENOENT)3675returnerror_errno("%s", old_name);3676}36773678if(state->check_index && !previous) {3679int pos =cache_name_pos(old_name,strlen(old_name));3680if(pos <0) {3681if(patch->is_new <0)3682goto is_new;3683returnerror(_("%s: does not exist in index"), old_name);3684}3685*ce = active_cache[pos];3686if(stat_ret <0) {3687if(checkout_target(&the_index, *ce, st))3688return-1;3689}3690if(!state->cached &&verify_index_match(*ce, st))3691returnerror(_("%s: does not match index"), old_name);3692if(state->cached)3693 st_mode = (*ce)->ce_mode;3694}else if(stat_ret <0) {3695if(patch->is_new <0)3696goto is_new;3697returnerror_errno("%s", old_name);3698}36993700if(!state->cached && !previous)3701 st_mode =ce_mode_from_stat(*ce, st->st_mode);37023703if(patch->is_new <0)3704 patch->is_new =0;3705if(!patch->old_mode)3706 patch->old_mode = st_mode;3707if((st_mode ^ patch->old_mode) & S_IFMT)3708returnerror(_("%s: wrong type"), old_name);3709if(st_mode != patch->old_mode)3710warning(_("%shas type%o, expected%o"),3711 old_name, st_mode, patch->old_mode);3712if(!patch->new_mode && !patch->is_delete)3713 patch->new_mode = st_mode;3714return0;37153716 is_new:3717 patch->is_new =1;3718 patch->is_delete =0;3719FREE_AND_NULL(patch->old_name);3720return0;3721}372237233724#define EXISTS_IN_INDEX 13725#define EXISTS_IN_WORKTREE 237263727static intcheck_to_create(struct apply_state *state,3728const char*new_name,3729int ok_if_exists)3730{3731struct stat nst;37323733if(state->check_index &&3734cache_name_pos(new_name,strlen(new_name)) >=0&&3735!ok_if_exists)3736return EXISTS_IN_INDEX;3737if(state->cached)3738return0;37393740if(!lstat(new_name, &nst)) {3741if(S_ISDIR(nst.st_mode) || ok_if_exists)3742return0;3743/*3744 * A leading component of new_name might be a symlink3745 * that is going to be removed with this patch, but3746 * still pointing at somewhere that has the path.3747 * In such a case, path "new_name" does not exist as3748 * far as git is concerned.3749 */3750if(has_symlink_leading_path(new_name,strlen(new_name)))3751return0;37523753return EXISTS_IN_WORKTREE;3754}else if(!is_missing_file_error(errno)) {3755returnerror_errno("%s", new_name);3756}3757return0;3758}37593760static uintptr_tregister_symlink_changes(struct apply_state *state,3761const char*path,3762uintptr_t what)3763{3764struct string_list_item *ent;37653766 ent =string_list_lookup(&state->symlink_changes, path);3767if(!ent) {3768 ent =string_list_insert(&state->symlink_changes, path);3769 ent->util = (void*)0;3770}3771 ent->util = (void*)(what | ((uintptr_t)ent->util));3772return(uintptr_t)ent->util;3773}37743775static uintptr_tcheck_symlink_changes(struct apply_state *state,const char*path)3776{3777struct string_list_item *ent;37783779 ent =string_list_lookup(&state->symlink_changes, path);3780if(!ent)3781return0;3782return(uintptr_t)ent->util;3783}37843785static voidprepare_symlink_changes(struct apply_state *state,struct patch *patch)3786{3787for( ; patch; patch = patch->next) {3788if((patch->old_name &&S_ISLNK(patch->old_mode)) &&3789(patch->is_rename || patch->is_delete))3790/* the symlink at patch->old_name is removed */3791register_symlink_changes(state, patch->old_name, APPLY_SYMLINK_GOES_AWAY);37923793if(patch->new_name &&S_ISLNK(patch->new_mode))3794/* the symlink at patch->new_name is created or remains */3795register_symlink_changes(state, patch->new_name, APPLY_SYMLINK_IN_RESULT);3796}3797}37983799static intpath_is_beyond_symlink_1(struct apply_state *state,struct strbuf *name)3800{3801do{3802unsigned int change;38033804while(--name->len && name->buf[name->len] !='/')3805;/* scan backwards */3806if(!name->len)3807break;3808 name->buf[name->len] ='\0';3809 change =check_symlink_changes(state, name->buf);3810if(change & APPLY_SYMLINK_IN_RESULT)3811return1;3812if(change & APPLY_SYMLINK_GOES_AWAY)3813/*3814 * This cannot be "return 0", because we may3815 * see a new one created at a higher level.3816 */3817continue;38183819/* otherwise, check the preimage */3820if(state->check_index) {3821struct cache_entry *ce;38223823 ce =cache_file_exists(name->buf, name->len, ignore_case);3824if(ce &&S_ISLNK(ce->ce_mode))3825return1;3826}else{3827struct stat st;3828if(!lstat(name->buf, &st) &&S_ISLNK(st.st_mode))3829return1;3830}3831}while(1);3832return0;3833}38343835static intpath_is_beyond_symlink(struct apply_state *state,const char*name_)3836{3837int ret;3838struct strbuf name = STRBUF_INIT;38393840assert(*name_ !='\0');3841strbuf_addstr(&name, name_);3842 ret =path_is_beyond_symlink_1(state, &name);3843strbuf_release(&name);38443845return ret;3846}38473848static intcheck_unsafe_path(struct patch *patch)3849{3850const char*old_name = NULL;3851const char*new_name = NULL;3852if(patch->is_delete)3853 old_name = patch->old_name;3854else if(!patch->is_new && !patch->is_copy)3855 old_name = patch->old_name;3856if(!patch->is_delete)3857 new_name = patch->new_name;38583859if(old_name && !verify_path(old_name))3860returnerror(_("invalid path '%s'"), old_name);3861if(new_name && !verify_path(new_name))3862returnerror(_("invalid path '%s'"), new_name);3863return0;3864}38653866/*3867 * Check and apply the patch in-core; leave the result in patch->result3868 * for the caller to write it out to the final destination.3869 */3870static intcheck_patch(struct apply_state *state,struct patch *patch)3871{3872struct stat st;3873const char*old_name = patch->old_name;3874const char*new_name = patch->new_name;3875const char*name = old_name ? old_name : new_name;3876struct cache_entry *ce = NULL;3877struct patch *tpatch;3878int ok_if_exists;3879int status;38803881 patch->rejected =1;/* we will drop this after we succeed */38823883 status =check_preimage(state, patch, &ce, &st);3884if(status)3885return status;3886 old_name = patch->old_name;38873888/*3889 * A type-change diff is always split into a patch to delete3890 * old, immediately followed by a patch to create new (see3891 * diff.c::run_diff()); in such a case it is Ok that the entry3892 * to be deleted by the previous patch is still in the working3893 * tree and in the index.3894 *3895 * A patch to swap-rename between A and B would first rename A3896 * to B and then rename B to A. While applying the first one,3897 * the presence of B should not stop A from getting renamed to3898 * B; ask to_be_deleted() about the later rename. Removal of3899 * B and rename from A to B is handled the same way by asking3900 * was_deleted().3901 */3902if((tpatch =in_fn_table(state, new_name)) &&3903(was_deleted(tpatch) ||to_be_deleted(tpatch)))3904 ok_if_exists =1;3905else3906 ok_if_exists =0;39073908if(new_name &&3909((0< patch->is_new) || patch->is_rename || patch->is_copy)) {3910int err =check_to_create(state, new_name, ok_if_exists);39113912if(err && state->threeway) {3913 patch->direct_to_threeway =1;3914}else switch(err) {3915case0:3916break;/* happy */3917case EXISTS_IN_INDEX:3918returnerror(_("%s: already exists in index"), new_name);3919break;3920case EXISTS_IN_WORKTREE:3921returnerror(_("%s: already exists in working directory"),3922 new_name);3923default:3924return err;3925}39263927if(!patch->new_mode) {3928if(0< patch->is_new)3929 patch->new_mode = S_IFREG |0644;3930else3931 patch->new_mode = patch->old_mode;3932}3933}39343935if(new_name && old_name) {3936int same = !strcmp(old_name, new_name);3937if(!patch->new_mode)3938 patch->new_mode = patch->old_mode;3939if((patch->old_mode ^ patch->new_mode) & S_IFMT) {3940if(same)3941returnerror(_("new mode (%o) of%sdoes not "3942"match old mode (%o)"),3943 patch->new_mode, new_name,3944 patch->old_mode);3945else3946returnerror(_("new mode (%o) of%sdoes not "3947"match old mode (%o) of%s"),3948 patch->new_mode, new_name,3949 patch->old_mode, old_name);3950}3951}39523953if(!state->unsafe_paths &&check_unsafe_path(patch))3954return-128;39553956/*3957 * An attempt to read from or delete a path that is beyond a3958 * symbolic link will be prevented by load_patch_target() that3959 * is called at the beginning of apply_data() so we do not3960 * have to worry about a patch marked with "is_delete" bit3961 * here. We however need to make sure that the patch result3962 * is not deposited to a path that is beyond a symbolic link3963 * here.3964 */3965if(!patch->is_delete &&path_is_beyond_symlink(state, patch->new_name))3966returnerror(_("affected file '%s' is beyond a symbolic link"),3967 patch->new_name);39683969if(apply_data(state, patch, &st, ce) <0)3970returnerror(_("%s: patch does not apply"), name);3971 patch->rejected =0;3972return0;3973}39743975static intcheck_patch_list(struct apply_state *state,struct patch *patch)3976{3977int err =0;39783979prepare_symlink_changes(state, patch);3980prepare_fn_table(state, patch);3981while(patch) {3982int res;3983if(state->apply_verbosity > verbosity_normal)3984say_patch_name(stderr,3985_("Checking patch%s..."), patch);3986 res =check_patch(state, patch);3987if(res == -128)3988return-128;3989 err |= res;3990 patch = patch->next;3991}3992return err;3993}39943995static intread_apply_cache(struct apply_state *state)3996{3997if(state->index_file)3998returnread_cache_from(state->index_file);3999else4000returnread_cache();4001}40024003/* This function tries to read the object name from the current index */4004static intget_current_oid(struct apply_state *state,const char*path,4005struct object_id *oid)4006{4007int pos;40084009if(read_apply_cache(state) <0)4010return-1;4011 pos =cache_name_pos(path,strlen(path));4012if(pos <0)4013return-1;4014oidcpy(oid, &active_cache[pos]->oid);4015return0;4016}40174018static intpreimage_oid_in_gitlink_patch(struct patch *p,struct object_id *oid)4019{4020/*4021 * A usable gitlink patch has only one fragment (hunk) that looks like:4022 * @@ -1 +1 @@4023 * -Subproject commit <old sha1>4024 * +Subproject commit <new sha1>4025 * or4026 * @@ -1 +0,0 @@4027 * -Subproject commit <old sha1>4028 * for a removal patch.4029 */4030struct fragment *hunk = p->fragments;4031static const char heading[] ="-Subproject commit ";4032char*preimage;40334034if(/* does the patch have only one hunk? */4035 hunk && !hunk->next &&4036/* is its preimage one line? */4037 hunk->oldpos ==1&& hunk->oldlines ==1&&4038/* does preimage begin with the heading? */4039(preimage =memchr(hunk->patch,'\n', hunk->size)) != NULL &&4040starts_with(++preimage, heading) &&4041/* does it record full SHA-1? */4042!get_oid_hex(preimage +sizeof(heading) -1, oid) &&4043 preimage[sizeof(heading) + GIT_SHA1_HEXSZ -1] =='\n'&&4044/* does the abbreviated name on the index line agree with it? */4045starts_with(preimage +sizeof(heading) -1, p->old_sha1_prefix))4046return0;/* it all looks fine */40474048/* we may have full object name on the index line */4049returnget_oid_hex(p->old_sha1_prefix, oid);4050}40514052/* Build an index that contains the just the files needed for a 3way merge */4053static intbuild_fake_ancestor(struct apply_state *state,struct patch *list)4054{4055struct patch *patch;4056struct index_state result = { NULL };4057static struct lock_file lock;4058int res;40594060/* Once we start supporting the reverse patch, it may be4061 * worth showing the new sha1 prefix, but until then...4062 */4063for(patch = list; patch; patch = patch->next) {4064struct object_id oid;4065struct cache_entry *ce;4066const char*name;40674068 name = patch->old_name ? patch->old_name : patch->new_name;4069if(0< patch->is_new)4070continue;40714072if(S_ISGITLINK(patch->old_mode)) {4073if(!preimage_oid_in_gitlink_patch(patch, &oid))4074;/* ok, the textual part looks sane */4075else4076returnerror(_("sha1 information is lacking or "4077"useless for submodule%s"), name);4078}else if(!get_sha1_blob(patch->old_sha1_prefix, oid.hash)) {4079;/* ok */4080}else if(!patch->lines_added && !patch->lines_deleted) {4081/* mode-only change: update the current */4082if(get_current_oid(state, patch->old_name, &oid))4083returnerror(_("mode change for%s, which is not "4084"in current HEAD"), name);4085}else4086returnerror(_("sha1 information is lacking or useless "4087"(%s)."), name);40884089 ce =make_cache_entry(patch->old_mode, oid.hash, name,0,0);4090if(!ce)4091returnerror(_("make_cache_entry failed for path '%s'"),4092 name);4093if(add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD)) {4094free(ce);4095returnerror(_("could not add%sto temporary index"),4096 name);4097}4098}40994100hold_lock_file_for_update(&lock, state->fake_ancestor, LOCK_DIE_ON_ERROR);4101 res =write_locked_index(&result, &lock, COMMIT_LOCK);4102discard_index(&result);41034104if(res)4105returnerror(_("could not write temporary index to%s"),4106 state->fake_ancestor);41074108return0;4109}41104111static voidstat_patch_list(struct apply_state *state,struct patch *patch)4112{4113int files, adds, dels;41144115for(files = adds = dels =0; patch ; patch = patch->next) {4116 files++;4117 adds += patch->lines_added;4118 dels += patch->lines_deleted;4119show_stats(state, patch);4120}41214122print_stat_summary(stdout, files, adds, dels);4123}41244125static voidnumstat_patch_list(struct apply_state *state,4126struct patch *patch)4127{4128for( ; patch; patch = patch->next) {4129const char*name;4130 name = patch->new_name ? patch->new_name : patch->old_name;4131if(patch->is_binary)4132printf("-\t-\t");4133else4134printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);4135write_name_quoted(name, stdout, state->line_termination);4136}4137}41384139static voidshow_file_mode_name(const char*newdelete,unsigned int mode,const char*name)4140{4141if(mode)4142printf("%smode%06o%s\n", newdelete, mode, name);4143else4144printf("%s %s\n", newdelete, name);4145}41464147static voidshow_mode_change(struct patch *p,int show_name)4148{4149if(p->old_mode && p->new_mode && p->old_mode != p->new_mode) {4150if(show_name)4151printf(" mode change%06o =>%06o%s\n",4152 p->old_mode, p->new_mode, p->new_name);4153else4154printf(" mode change%06o =>%06o\n",4155 p->old_mode, p->new_mode);4156}4157}41584159static voidshow_rename_copy(struct patch *p)4160{4161const char*renamecopy = p->is_rename ?"rename":"copy";4162const char*old, *new;41634164/* Find common prefix */4165 old = p->old_name;4166new= p->new_name;4167while(1) {4168const char*slash_old, *slash_new;4169 slash_old =strchr(old,'/');4170 slash_new =strchr(new,'/');4171if(!slash_old ||4172!slash_new ||4173 slash_old - old != slash_new -new||4174memcmp(old,new, slash_new -new))4175break;4176 old = slash_old +1;4177new= slash_new +1;4178}4179/* p->old_name thru old is the common prefix, and old and new4180 * through the end of names are renames4181 */4182if(old != p->old_name)4183printf("%s%.*s{%s=>%s} (%d%%)\n", renamecopy,4184(int)(old - p->old_name), p->old_name,4185 old,new, p->score);4186else4187printf("%s %s=>%s(%d%%)\n", renamecopy,4188 p->old_name, p->new_name, p->score);4189show_mode_change(p,0);4190}41914192static voidsummary_patch_list(struct patch *patch)4193{4194struct patch *p;41954196for(p = patch; p; p = p->next) {4197if(p->is_new)4198show_file_mode_name("create", p->new_mode, p->new_name);4199else if(p->is_delete)4200show_file_mode_name("delete", p->old_mode, p->old_name);4201else{4202if(p->is_rename || p->is_copy)4203show_rename_copy(p);4204else{4205if(p->score) {4206printf(" rewrite%s(%d%%)\n",4207 p->new_name, p->score);4208show_mode_change(p,0);4209}4210else4211show_mode_change(p,1);4212}4213}4214}4215}42164217static voidpatch_stats(struct apply_state *state,struct patch *patch)4218{4219int lines = patch->lines_added + patch->lines_deleted;42204221if(lines > state->max_change)4222 state->max_change = lines;4223if(patch->old_name) {4224int len =quote_c_style(patch->old_name, NULL, NULL,0);4225if(!len)4226 len =strlen(patch->old_name);4227if(len > state->max_len)4228 state->max_len = len;4229}4230if(patch->new_name) {4231int len =quote_c_style(patch->new_name, NULL, NULL,0);4232if(!len)4233 len =strlen(patch->new_name);4234if(len > state->max_len)4235 state->max_len = len;4236}4237}42384239static intremove_file(struct apply_state *state,struct patch *patch,int rmdir_empty)4240{4241if(state->update_index) {4242if(remove_file_from_cache(patch->old_name) <0)4243returnerror(_("unable to remove%sfrom index"), patch->old_name);4244}4245if(!state->cached) {4246if(!remove_or_warn(patch->old_mode, patch->old_name) && rmdir_empty) {4247remove_path(patch->old_name);4248}4249}4250return0;4251}42524253static intadd_index_file(struct apply_state *state,4254const char*path,4255unsigned mode,4256void*buf,4257unsigned long size)4258{4259struct stat st;4260struct cache_entry *ce;4261int namelen =strlen(path);4262unsigned ce_size =cache_entry_size(namelen);42634264if(!state->update_index)4265return0;42664267 ce =xcalloc(1, ce_size);4268memcpy(ce->name, path, namelen);4269 ce->ce_mode =create_ce_mode(mode);4270 ce->ce_flags =create_ce_flags(0);4271 ce->ce_namelen = namelen;4272if(S_ISGITLINK(mode)) {4273const char*s;42744275if(!skip_prefix(buf,"Subproject commit ", &s) ||4276get_oid_hex(s, &ce->oid)) {4277free(ce);4278returnerror(_("corrupt patch for submodule%s"), path);4279}4280}else{4281if(!state->cached) {4282if(lstat(path, &st) <0) {4283free(ce);4284returnerror_errno(_("unable to stat newly "4285"created file '%s'"),4286 path);4287}4288fill_stat_cache_info(ce, &st);4289}4290if(write_sha1_file(buf, size, blob_type, ce->oid.hash) <0) {4291free(ce);4292returnerror(_("unable to create backing store "4293"for newly created file%s"), path);4294}4295}4296if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4297free(ce);4298returnerror(_("unable to add cache entry for%s"), path);4299}43004301return0;4302}43034304/*4305 * Returns:4306 * -1 if an unrecoverable error happened4307 * 0 if everything went well4308 * 1 if a recoverable error happened4309 */4310static inttry_create_file(const char*path,unsigned int mode,const char*buf,unsigned long size)4311{4312int fd, res;4313struct strbuf nbuf = STRBUF_INIT;43144315if(S_ISGITLINK(mode)) {4316struct stat st;4317if(!lstat(path, &st) &&S_ISDIR(st.st_mode))4318return0;4319return!!mkdir(path,0777);4320}43214322if(has_symlinks &&S_ISLNK(mode))4323/* Although buf:size is counted string, it also is NUL4324 * terminated.4325 */4326return!!symlink(buf, path);43274328 fd =open(path, O_CREAT | O_EXCL | O_WRONLY, (mode &0100) ?0777:0666);4329if(fd <0)4330return1;43314332if(convert_to_working_tree(path, buf, size, &nbuf)) {4333 size = nbuf.len;4334 buf = nbuf.buf;4335}43364337 res =write_in_full(fd, buf, size) <0;4338if(res)4339error_errno(_("failed to write to '%s'"), path);4340strbuf_release(&nbuf);43414342if(close(fd) <0&& !res)4343returnerror_errno(_("closing file '%s'"), path);43444345return res ? -1:0;4346}43474348/*4349 * We optimistically assume that the directories exist,4350 * which is true 99% of the time anyway. If they don't,4351 * we create them and try again.4352 *4353 * Returns:4354 * -1 on error4355 * 0 otherwise4356 */4357static intcreate_one_file(struct apply_state *state,4358char*path,4359unsigned mode,4360const char*buf,4361unsigned long size)4362{4363int res;43644365if(state->cached)4366return0;43674368 res =try_create_file(path, mode, buf, size);4369if(res <0)4370return-1;4371if(!res)4372return0;43734374if(errno == ENOENT) {4375if(safe_create_leading_directories(path))4376return0;4377 res =try_create_file(path, mode, buf, size);4378if(res <0)4379return-1;4380if(!res)4381return0;4382}43834384if(errno == EEXIST || errno == EACCES) {4385/* We may be trying to create a file where a directory4386 * used to be.4387 */4388struct stat st;4389if(!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))4390 errno = EEXIST;4391}43924393if(errno == EEXIST) {4394unsigned int nr =getpid();43954396for(;;) {4397char newpath[PATH_MAX];4398mksnpath(newpath,sizeof(newpath),"%s~%u", path, nr);4399 res =try_create_file(newpath, mode, buf, size);4400if(res <0)4401return-1;4402if(!res) {4403if(!rename(newpath, path))4404return0;4405unlink_or_warn(newpath);4406break;4407}4408if(errno != EEXIST)4409break;4410++nr;4411}4412}4413returnerror_errno(_("unable to write file '%s' mode%o"),4414 path, mode);4415}44164417static intadd_conflicted_stages_file(struct apply_state *state,4418struct patch *patch)4419{4420int stage, namelen;4421unsigned ce_size, mode;4422struct cache_entry *ce;44234424if(!state->update_index)4425return0;4426 namelen =strlen(patch->new_name);4427 ce_size =cache_entry_size(namelen);4428 mode = patch->new_mode ? patch->new_mode : (S_IFREG |0644);44294430remove_file_from_cache(patch->new_name);4431for(stage =1; stage <4; stage++) {4432if(is_null_oid(&patch->threeway_stage[stage -1]))4433continue;4434 ce =xcalloc(1, ce_size);4435memcpy(ce->name, patch->new_name, namelen);4436 ce->ce_mode =create_ce_mode(mode);4437 ce->ce_flags =create_ce_flags(stage);4438 ce->ce_namelen = namelen;4439oidcpy(&ce->oid, &patch->threeway_stage[stage -1]);4440if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4441free(ce);4442returnerror(_("unable to add cache entry for%s"),4443 patch->new_name);4444}4445}44464447return0;4448}44494450static intcreate_file(struct apply_state *state,struct patch *patch)4451{4452char*path = patch->new_name;4453unsigned mode = patch->new_mode;4454unsigned long size = patch->resultsize;4455char*buf = patch->result;44564457if(!mode)4458 mode = S_IFREG |0644;4459if(create_one_file(state, path, mode, buf, size))4460return-1;44614462if(patch->conflicted_threeway)4463returnadd_conflicted_stages_file(state, patch);4464else4465returnadd_index_file(state, path, mode, buf, size);4466}44674468/* phase zero is to remove, phase one is to create */4469static intwrite_out_one_result(struct apply_state *state,4470struct patch *patch,4471int phase)4472{4473if(patch->is_delete >0) {4474if(phase ==0)4475returnremove_file(state, patch,1);4476return0;4477}4478if(patch->is_new >0|| patch->is_copy) {4479if(phase ==1)4480returncreate_file(state, patch);4481return0;4482}4483/*4484 * Rename or modification boils down to the same4485 * thing: remove the old, write the new4486 */4487if(phase ==0)4488returnremove_file(state, patch, patch->is_rename);4489if(phase ==1)4490returncreate_file(state, patch);4491return0;4492}44934494static intwrite_out_one_reject(struct apply_state *state,struct patch *patch)4495{4496FILE*rej;4497char namebuf[PATH_MAX];4498struct fragment *frag;4499int cnt =0;4500struct strbuf sb = STRBUF_INIT;45014502for(cnt =0, frag = patch->fragments; frag; frag = frag->next) {4503if(!frag->rejected)4504continue;4505 cnt++;4506}45074508if(!cnt) {4509if(state->apply_verbosity > verbosity_normal)4510say_patch_name(stderr,4511_("Applied patch%scleanly."), patch);4512return0;4513}45144515/* This should not happen, because a removal patch that leaves4516 * contents are marked "rejected" at the patch level.4517 */4518if(!patch->new_name)4519die(_("internal error"));45204521/* Say this even without --verbose */4522strbuf_addf(&sb,Q_("Applying patch %%swith%dreject...",4523"Applying patch %%swith%drejects...",4524 cnt),4525 cnt);4526if(state->apply_verbosity > verbosity_silent)4527say_patch_name(stderr, sb.buf, patch);4528strbuf_release(&sb);45294530 cnt =strlen(patch->new_name);4531if(ARRAY_SIZE(namebuf) <= cnt +5) {4532 cnt =ARRAY_SIZE(namebuf) -5;4533warning(_("truncating .rej filename to %.*s.rej"),4534 cnt -1, patch->new_name);4535}4536memcpy(namebuf, patch->new_name, cnt);4537memcpy(namebuf + cnt,".rej",5);45384539 rej =fopen(namebuf,"w");4540if(!rej)4541returnerror_errno(_("cannot open%s"), namebuf);45424543/* Normal git tools never deal with .rej, so do not pretend4544 * this is a git patch by saying --git or giving extended4545 * headers. While at it, maybe please "kompare" that wants4546 * the trailing TAB and some garbage at the end of line ;-).4547 */4548fprintf(rej,"diff a/%sb/%s\t(rejected hunks)\n",4549 patch->new_name, patch->new_name);4550for(cnt =1, frag = patch->fragments;4551 frag;4552 cnt++, frag = frag->next) {4553if(!frag->rejected) {4554if(state->apply_verbosity > verbosity_silent)4555fprintf_ln(stderr,_("Hunk #%dapplied cleanly."), cnt);4556continue;4557}4558if(state->apply_verbosity > verbosity_silent)4559fprintf_ln(stderr,_("Rejected hunk #%d."), cnt);4560fprintf(rej,"%.*s", frag->size, frag->patch);4561if(frag->patch[frag->size-1] !='\n')4562fputc('\n', rej);4563}4564fclose(rej);4565return-1;4566}45674568/*4569 * Returns:4570 * -1 if an error happened4571 * 0 if the patch applied cleanly4572 * 1 if the patch did not apply cleanly4573 */4574static intwrite_out_results(struct apply_state *state,struct patch *list)4575{4576int phase;4577int errs =0;4578struct patch *l;4579struct string_list cpath = STRING_LIST_INIT_DUP;45804581for(phase =0; phase <2; phase++) {4582 l = list;4583while(l) {4584if(l->rejected)4585 errs =1;4586else{4587if(write_out_one_result(state, l, phase)) {4588string_list_clear(&cpath,0);4589return-1;4590}4591if(phase ==1) {4592if(write_out_one_reject(state, l))4593 errs =1;4594if(l->conflicted_threeway) {4595string_list_append(&cpath, l->new_name);4596 errs =1;4597}4598}4599}4600 l = l->next;4601}4602}46034604if(cpath.nr) {4605struct string_list_item *item;46064607string_list_sort(&cpath);4608if(state->apply_verbosity > verbosity_silent) {4609for_each_string_list_item(item, &cpath)4610fprintf(stderr,"U%s\n", item->string);4611}4612string_list_clear(&cpath,0);46134614rerere(0);4615}46164617return errs;4618}46194620/*4621 * Try to apply a patch.4622 *4623 * Returns:4624 * -128 if a bad error happened (like patch unreadable)4625 * -1 if patch did not apply and user cannot deal with it4626 * 0 if the patch applied4627 * 1 if the patch did not apply but user might fix it4628 */4629static intapply_patch(struct apply_state *state,4630int fd,4631const char*filename,4632int options)4633{4634size_t offset;4635struct strbuf buf = STRBUF_INIT;/* owns the patch text */4636struct patch *list = NULL, **listp = &list;4637int skipped_patch =0;4638int res =0;46394640 state->patch_input_file = filename;4641if(read_patch_file(&buf, fd) <0)4642return-128;4643 offset =0;4644while(offset < buf.len) {4645struct patch *patch;4646int nr;46474648 patch =xcalloc(1,sizeof(*patch));4649 patch->inaccurate_eof = !!(options & APPLY_OPT_INACCURATE_EOF);4650 patch->recount = !!(options & APPLY_OPT_RECOUNT);4651 nr =parse_chunk(state, buf.buf + offset, buf.len - offset, patch);4652if(nr <0) {4653free_patch(patch);4654if(nr == -128) {4655 res = -128;4656goto end;4657}4658break;4659}4660if(state->apply_in_reverse)4661reverse_patches(patch);4662if(use_patch(state, patch)) {4663patch_stats(state, patch);4664*listp = patch;4665 listp = &patch->next;4666}4667else{4668if(state->apply_verbosity > verbosity_normal)4669say_patch_name(stderr,_("Skipped patch '%s'."), patch);4670free_patch(patch);4671 skipped_patch++;4672}4673 offset += nr;4674}46754676if(!list && !skipped_patch) {4677error(_("unrecognized input"));4678 res = -128;4679goto end;4680}46814682if(state->whitespace_error && (state->ws_error_action == die_on_ws_error))4683 state->apply =0;46844685 state->update_index = state->check_index && state->apply;4686if(state->update_index && state->newfd <0) {4687if(state->index_file)4688 state->newfd =hold_lock_file_for_update(state->lock_file,4689 state->index_file,4690 LOCK_DIE_ON_ERROR);4691else4692 state->newfd =hold_locked_index(state->lock_file, LOCK_DIE_ON_ERROR);4693}46944695if(state->check_index &&read_apply_cache(state) <0) {4696error(_("unable to read index file"));4697 res = -128;4698goto end;4699}47004701if(state->check || state->apply) {4702int r =check_patch_list(state, list);4703if(r == -128) {4704 res = -128;4705goto end;4706}4707if(r <0&& !state->apply_with_reject) {4708 res = -1;4709goto end;4710}4711}47124713if(state->apply) {4714int write_res =write_out_results(state, list);4715if(write_res <0) {4716 res = -128;4717goto end;4718}4719if(write_res >0) {4720/* with --3way, we still need to write the index out */4721 res = state->apply_with_reject ? -1:1;4722goto end;4723}4724}47254726if(state->fake_ancestor &&4727build_fake_ancestor(state, list)) {4728 res = -128;4729goto end;4730}47314732if(state->diffstat && state->apply_verbosity > verbosity_silent)4733stat_patch_list(state, list);47344735if(state->numstat && state->apply_verbosity > verbosity_silent)4736numstat_patch_list(state, list);47374738if(state->summary && state->apply_verbosity > verbosity_silent)4739summary_patch_list(list);47404741end:4742free_patch_list(list);4743strbuf_release(&buf);4744string_list_clear(&state->fn_table,0);4745return res;4746}47474748static intapply_option_parse_exclude(const struct option *opt,4749const char*arg,int unset)4750{4751struct apply_state *state = opt->value;4752add_name_limit(state, arg,1);4753return0;4754}47554756static intapply_option_parse_include(const struct option *opt,4757const char*arg,int unset)4758{4759struct apply_state *state = opt->value;4760add_name_limit(state, arg,0);4761 state->has_include =1;4762return0;4763}47644765static intapply_option_parse_p(const struct option *opt,4766const char*arg,4767int unset)4768{4769struct apply_state *state = opt->value;4770 state->p_value =atoi(arg);4771 state->p_value_known =1;4772return0;4773}47744775static intapply_option_parse_space_change(const struct option *opt,4776const char*arg,int unset)4777{4778struct apply_state *state = opt->value;4779if(unset)4780 state->ws_ignore_action = ignore_ws_none;4781else4782 state->ws_ignore_action = ignore_ws_change;4783return0;4784}47854786static intapply_option_parse_whitespace(const struct option *opt,4787const char*arg,int unset)4788{4789struct apply_state *state = opt->value;4790 state->whitespace_option = arg;4791if(parse_whitespace_option(state, arg))4792exit(1);4793return0;4794}47954796static intapply_option_parse_directory(const struct option *opt,4797const char*arg,int unset)4798{4799struct apply_state *state = opt->value;4800strbuf_reset(&state->root);4801strbuf_addstr(&state->root, arg);4802strbuf_complete(&state->root,'/');4803return0;4804}48054806intapply_all_patches(struct apply_state *state,4807int argc,4808const char**argv,4809int options)4810{4811int i;4812int res;4813int errs =0;4814int read_stdin =1;48154816for(i =0; i < argc; i++) {4817const char*arg = argv[i];4818char*to_free = NULL;4819int fd;48204821if(!strcmp(arg,"-")) {4822 res =apply_patch(state,0,"<stdin>", options);4823if(res <0)4824goto end;4825 errs |= res;4826 read_stdin =0;4827continue;4828}else4829 arg = to_free =prefix_filename(state->prefix, arg);48304831 fd =open(arg, O_RDONLY);4832if(fd <0) {4833error(_("can't open patch '%s':%s"), arg,strerror(errno));4834 res = -128;4835free(to_free);4836goto end;4837}4838 read_stdin =0;4839set_default_whitespace_mode(state);4840 res =apply_patch(state, fd, arg, options);4841close(fd);4842free(to_free);4843if(res <0)4844goto end;4845 errs |= res;4846}4847set_default_whitespace_mode(state);4848if(read_stdin) {4849 res =apply_patch(state,0,"<stdin>", options);4850if(res <0)4851goto end;4852 errs |= res;4853}48544855if(state->whitespace_error) {4856if(state->squelch_whitespace_errors &&4857 state->squelch_whitespace_errors < state->whitespace_error) {4858int squelched =4859 state->whitespace_error - state->squelch_whitespace_errors;4860warning(Q_("squelched%dwhitespace error",4861"squelched%dwhitespace errors",4862 squelched),4863 squelched);4864}4865if(state->ws_error_action == die_on_ws_error) {4866error(Q_("%dline adds whitespace errors.",4867"%dlines add whitespace errors.",4868 state->whitespace_error),4869 state->whitespace_error);4870 res = -128;4871goto end;4872}4873if(state->applied_after_fixing_ws && state->apply)4874warning(Q_("%dline applied after"4875" fixing whitespace errors.",4876"%dlines applied after"4877" fixing whitespace errors.",4878 state->applied_after_fixing_ws),4879 state->applied_after_fixing_ws);4880else if(state->whitespace_error)4881warning(Q_("%dline adds whitespace errors.",4882"%dlines add whitespace errors.",4883 state->whitespace_error),4884 state->whitespace_error);4885}48864887if(state->update_index) {4888 res =write_locked_index(&the_index, state->lock_file, COMMIT_LOCK);4889if(res) {4890error(_("Unable to write new index file"));4891 res = -128;4892goto end;4893}4894 state->newfd = -1;4895}48964897 res = !!errs;48984899end:4900if(state->newfd >=0) {4901rollback_lock_file(state->lock_file);4902 state->newfd = -1;4903}49044905if(state->apply_verbosity <= verbosity_silent) {4906set_error_routine(state->saved_error_routine);4907set_warn_routine(state->saved_warn_routine);4908}49094910if(res > -1)4911return res;4912return(res == -1?1:128);4913}49144915intapply_parse_options(int argc,const char**argv,4916struct apply_state *state,4917int*force_apply,int*options,4918const char*const*apply_usage)4919{4920struct option builtin_apply_options[] = {4921{ OPTION_CALLBACK,0,"exclude", state,N_("path"),4922N_("don't apply changes matching the given path"),49230, apply_option_parse_exclude },4924{ OPTION_CALLBACK,0,"include", state,N_("path"),4925N_("apply changes matching the given path"),49260, apply_option_parse_include },4927{ OPTION_CALLBACK,'p', NULL, state,N_("num"),4928N_("remove <num> leading slashes from traditional diff paths"),49290, apply_option_parse_p },4930OPT_BOOL(0,"no-add", &state->no_add,4931N_("ignore additions made by the patch")),4932OPT_BOOL(0,"stat", &state->diffstat,4933N_("instead of applying the patch, output diffstat for the input")),4934OPT_NOOP_NOARG(0,"allow-binary-replacement"),4935OPT_NOOP_NOARG(0,"binary"),4936OPT_BOOL(0,"numstat", &state->numstat,4937N_("show number of added and deleted lines in decimal notation")),4938OPT_BOOL(0,"summary", &state->summary,4939N_("instead of applying the patch, output a summary for the input")),4940OPT_BOOL(0,"check", &state->check,4941N_("instead of applying the patch, see if the patch is applicable")),4942OPT_BOOL(0,"index", &state->check_index,4943N_("make sure the patch is applicable to the current index")),4944OPT_BOOL(0,"cached", &state->cached,4945N_("apply a patch without touching the working tree")),4946OPT_BOOL(0,"unsafe-paths", &state->unsafe_paths,4947N_("accept a patch that touches outside the working area")),4948OPT_BOOL(0,"apply", force_apply,4949N_("also apply the patch (use with --stat/--summary/--check)")),4950OPT_BOOL('3',"3way", &state->threeway,4951N_("attempt three-way merge if a patch does not apply")),4952OPT_FILENAME(0,"build-fake-ancestor", &state->fake_ancestor,4953N_("build a temporary index based on embedded index information")),4954/* Think twice before adding "--nul" synonym to this */4955OPT_SET_INT('z', NULL, &state->line_termination,4956N_("paths are separated with NUL character"),'\0'),4957OPT_INTEGER('C', NULL, &state->p_context,4958N_("ensure at least <n> lines of context match")),4959{ OPTION_CALLBACK,0,"whitespace", state,N_("action"),4960N_("detect new or modified lines that have whitespace errors"),49610, apply_option_parse_whitespace },4962{ OPTION_CALLBACK,0,"ignore-space-change", state, NULL,4963N_("ignore changes in whitespace when finding context"),4964 PARSE_OPT_NOARG, apply_option_parse_space_change },4965{ OPTION_CALLBACK,0,"ignore-whitespace", state, NULL,4966N_("ignore changes in whitespace when finding context"),4967 PARSE_OPT_NOARG, apply_option_parse_space_change },4968OPT_BOOL('R',"reverse", &state->apply_in_reverse,4969N_("apply the patch in reverse")),4970OPT_BOOL(0,"unidiff-zero", &state->unidiff_zero,4971N_("don't expect at least one line of context")),4972OPT_BOOL(0,"reject", &state->apply_with_reject,4973N_("leave the rejected hunks in corresponding *.rej files")),4974OPT_BOOL(0,"allow-overlap", &state->allow_overlap,4975N_("allow overlapping hunks")),4976OPT__VERBOSE(&state->apply_verbosity,N_("be verbose")),4977OPT_BIT(0,"inaccurate-eof", options,4978N_("tolerate incorrectly detected missing new-line at the end of file"),4979 APPLY_OPT_INACCURATE_EOF),4980OPT_BIT(0,"recount", options,4981N_("do not trust the line counts in the hunk headers"),4982 APPLY_OPT_RECOUNT),4983{ OPTION_CALLBACK,0,"directory", state,N_("root"),4984N_("prepend <root> to all filenames"),49850, apply_option_parse_directory },4986OPT_END()4987};49884989returnparse_options(argc, argv, state->prefix, builtin_apply_options, apply_usage,0);4990}