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"blob.h" 12#include"delta.h" 13#include"diff.h" 14#include"dir.h" 15#include"xdiff-interface.h" 16#include"ll-merge.h" 17#include"lockfile.h" 18#include"parse-options.h" 19#include"quote.h" 20#include"rerere.h" 21#include"apply.h" 22 23static voidgit_apply_config(void) 24{ 25git_config_get_string_const("apply.whitespace", &apply_default_whitespace); 26git_config_get_string_const("apply.ignorewhitespace", &apply_default_ignorewhitespace); 27git_config(git_default_config, NULL); 28} 29 30static intparse_whitespace_option(struct apply_state *state,const char*option) 31{ 32if(!option) { 33 state->ws_error_action = warn_on_ws_error; 34return0; 35} 36if(!strcmp(option,"warn")) { 37 state->ws_error_action = warn_on_ws_error; 38return0; 39} 40if(!strcmp(option,"nowarn")) { 41 state->ws_error_action = nowarn_ws_error; 42return0; 43} 44if(!strcmp(option,"error")) { 45 state->ws_error_action = die_on_ws_error; 46return0; 47} 48if(!strcmp(option,"error-all")) { 49 state->ws_error_action = die_on_ws_error; 50 state->squelch_whitespace_errors =0; 51return0; 52} 53if(!strcmp(option,"strip") || !strcmp(option,"fix")) { 54 state->ws_error_action = correct_ws_error; 55return0; 56} 57returnerror(_("unrecognized whitespace option '%s'"), option); 58} 59 60static intparse_ignorewhitespace_option(struct apply_state *state, 61const char*option) 62{ 63if(!option || !strcmp(option,"no") || 64!strcmp(option,"false") || !strcmp(option,"never") || 65!strcmp(option,"none")) { 66 state->ws_ignore_action = ignore_ws_none; 67return0; 68} 69if(!strcmp(option,"change")) { 70 state->ws_ignore_action = ignore_ws_change; 71return0; 72} 73returnerror(_("unrecognized whitespace ignore option '%s'"), option); 74} 75 76intinit_apply_state(struct apply_state *state, 77const char*prefix, 78struct lock_file *lock_file) 79{ 80memset(state,0,sizeof(*state)); 81 state->prefix = prefix; 82 state->prefix_length = state->prefix ?strlen(state->prefix) :0; 83 state->lock_file = lock_file; 84 state->newfd = -1; 85 state->apply =1; 86 state->line_termination ='\n'; 87 state->p_value =1; 88 state->p_context = UINT_MAX; 89 state->squelch_whitespace_errors =5; 90 state->ws_error_action = warn_on_ws_error; 91 state->ws_ignore_action = ignore_ws_none; 92 state->linenr =1; 93string_list_init(&state->fn_table,0); 94string_list_init(&state->limit_by_name,0); 95string_list_init(&state->symlink_changes,0); 96strbuf_init(&state->root,0); 97 98git_apply_config(); 99if(apply_default_whitespace &&parse_whitespace_option(state, apply_default_whitespace)) 100return-1; 101if(apply_default_ignorewhitespace &&parse_ignorewhitespace_option(state, apply_default_ignorewhitespace)) 102return-1; 103return0; 104} 105 106voidclear_apply_state(struct apply_state *state) 107{ 108string_list_clear(&state->limit_by_name,0); 109string_list_clear(&state->symlink_changes,0); 110strbuf_release(&state->root); 111 112/* &state->fn_table is cleared at the end of apply_patch() */ 113} 114 115static voidmute_routine(const char*msg,va_list params) 116{ 117/* do nothing */ 118} 119 120intcheck_apply_state(struct apply_state *state,int force_apply) 121{ 122int is_not_gitdir = !startup_info->have_repository; 123 124if(state->apply_with_reject && state->threeway) 125returnerror(_("--reject and --3way cannot be used together.")); 126if(state->cached && state->threeway) 127returnerror(_("--cached and --3way cannot be used together.")); 128if(state->threeway) { 129if(is_not_gitdir) 130returnerror(_("--3way outside a repository")); 131 state->check_index =1; 132} 133if(state->apply_with_reject) { 134 state->apply =1; 135if(state->apply_verbosity == verbosity_normal) 136 state->apply_verbosity = verbosity_verbose; 137} 138if(!force_apply && (state->diffstat || state->numstat || state->summary || state->check || state->fake_ancestor)) 139 state->apply =0; 140if(state->check_index && is_not_gitdir) 141returnerror(_("--index outside a repository")); 142if(state->cached) { 143if(is_not_gitdir) 144returnerror(_("--cached outside a repository")); 145 state->check_index =1; 146} 147if(state->check_index) 148 state->unsafe_paths =0; 149if(!state->lock_file) 150returnerror("BUG: state->lock_file should not be NULL"); 151 152if(state->apply_verbosity <= verbosity_silent) { 153 state->saved_error_routine =get_error_routine(); 154 state->saved_warn_routine =get_warn_routine(); 155set_error_routine(mute_routine); 156set_warn_routine(mute_routine); 157} 158 159return0; 160} 161 162static voidset_default_whitespace_mode(struct apply_state *state) 163{ 164if(!state->whitespace_option && !apply_default_whitespace) 165 state->ws_error_action = (state->apply ? warn_on_ws_error : nowarn_ws_error); 166} 167 168/* 169 * This represents one "hunk" from a patch, starting with 170 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The 171 * patch text is pointed at by patch, and its byte length 172 * is stored in size. leading and trailing are the number 173 * of context lines. 174 */ 175struct fragment { 176unsigned long leading, trailing; 177unsigned long oldpos, oldlines; 178unsigned long newpos, newlines; 179/* 180 * 'patch' is usually borrowed from buf in apply_patch(), 181 * but some codepaths store an allocated buffer. 182 */ 183const char*patch; 184unsigned free_patch:1, 185 rejected:1; 186int size; 187int linenr; 188struct fragment *next; 189}; 190 191/* 192 * When dealing with a binary patch, we reuse "leading" field 193 * to store the type of the binary hunk, either deflated "delta" 194 * or deflated "literal". 195 */ 196#define binary_patch_method leading 197#define BINARY_DELTA_DEFLATED 1 198#define BINARY_LITERAL_DEFLATED 2 199 200/* 201 * This represents a "patch" to a file, both metainfo changes 202 * such as creation/deletion, filemode and content changes represented 203 * as a series of fragments. 204 */ 205struct patch { 206char*new_name, *old_name, *def_name; 207unsigned int old_mode, new_mode; 208int is_new, is_delete;/* -1 = unknown, 0 = false, 1 = true */ 209int rejected; 210unsigned ws_rule; 211int lines_added, lines_deleted; 212int score; 213unsigned int is_toplevel_relative:1; 214unsigned int inaccurate_eof:1; 215unsigned int is_binary:1; 216unsigned int is_copy:1; 217unsigned int is_rename:1; 218unsigned int recount:1; 219unsigned int conflicted_threeway:1; 220unsigned int direct_to_threeway:1; 221struct fragment *fragments; 222char*result; 223size_t resultsize; 224char old_sha1_prefix[41]; 225char new_sha1_prefix[41]; 226struct patch *next; 227 228/* three-way fallback result */ 229struct object_id threeway_stage[3]; 230}; 231 232static voidfree_fragment_list(struct fragment *list) 233{ 234while(list) { 235struct fragment *next = list->next; 236if(list->free_patch) 237free((char*)list->patch); 238free(list); 239 list = next; 240} 241} 242 243static voidfree_patch(struct patch *patch) 244{ 245free_fragment_list(patch->fragments); 246free(patch->def_name); 247free(patch->old_name); 248free(patch->new_name); 249free(patch->result); 250free(patch); 251} 252 253static voidfree_patch_list(struct patch *list) 254{ 255while(list) { 256struct patch *next = list->next; 257free_patch(list); 258 list = next; 259} 260} 261 262/* 263 * A line in a file, len-bytes long (includes the terminating LF, 264 * except for an incomplete line at the end if the file ends with 265 * one), and its contents hashes to 'hash'. 266 */ 267struct line { 268size_t len; 269unsigned hash :24; 270unsigned flag :8; 271#define LINE_COMMON 1 272#define LINE_PATCHED 2 273}; 274 275/* 276 * This represents a "file", which is an array of "lines". 277 */ 278struct image { 279char*buf; 280size_t len; 281size_t nr; 282size_t alloc; 283struct line *line_allocated; 284struct line *line; 285}; 286 287static uint32_thash_line(const char*cp,size_t len) 288{ 289size_t i; 290uint32_t h; 291for(i =0, h =0; i < len; i++) { 292if(!isspace(cp[i])) { 293 h = h *3+ (cp[i] &0xff); 294} 295} 296return h; 297} 298 299/* 300 * Compare lines s1 of length n1 and s2 of length n2, ignoring 301 * whitespace difference. Returns 1 if they match, 0 otherwise 302 */ 303static intfuzzy_matchlines(const char*s1,size_t n1, 304const char*s2,size_t n2) 305{ 306const char*end1 = s1 + n1; 307const char*end2 = s2 + n2; 308 309/* ignore line endings */ 310while(s1 < end1 && (end1[-1] =='\r'|| end1[-1] =='\n')) 311 end1--; 312while(s2 < end2 && (end2[-1] =='\r'|| end2[-1] =='\n')) 313 end2--; 314 315while(s1 < end1 && s2 < end2) { 316if(isspace(*s1)) { 317/* 318 * Skip whitespace. We check on both buffers 319 * because we don't want "a b" to match "ab". 320 */ 321if(!isspace(*s2)) 322return0; 323while(s1 < end1 &&isspace(*s1)) 324 s1++; 325while(s2 < end2 &&isspace(*s2)) 326 s2++; 327}else if(*s1++ != *s2++) 328return0; 329} 330 331/* If we reached the end on one side only, lines don't match. */ 332return s1 == end1 && s2 == end2; 333} 334 335static voidadd_line_info(struct image *img,const char*bol,size_t len,unsigned flag) 336{ 337ALLOC_GROW(img->line_allocated, img->nr +1, img->alloc); 338 img->line_allocated[img->nr].len = len; 339 img->line_allocated[img->nr].hash =hash_line(bol, len); 340 img->line_allocated[img->nr].flag = flag; 341 img->nr++; 342} 343 344/* 345 * "buf" has the file contents to be patched (read from various sources). 346 * attach it to "image" and add line-based index to it. 347 * "image" now owns the "buf". 348 */ 349static voidprepare_image(struct image *image,char*buf,size_t len, 350int prepare_linetable) 351{ 352const char*cp, *ep; 353 354memset(image,0,sizeof(*image)); 355 image->buf = buf; 356 image->len = len; 357 358if(!prepare_linetable) 359return; 360 361 ep = image->buf + image->len; 362 cp = image->buf; 363while(cp < ep) { 364const char*next; 365for(next = cp; next < ep && *next !='\n'; next++) 366; 367if(next < ep) 368 next++; 369add_line_info(image, cp, next - cp,0); 370 cp = next; 371} 372 image->line = image->line_allocated; 373} 374 375static voidclear_image(struct image *image) 376{ 377free(image->buf); 378free(image->line_allocated); 379memset(image,0,sizeof(*image)); 380} 381 382/* fmt must contain _one_ %s and no other substitution */ 383static voidsay_patch_name(FILE*output,const char*fmt,struct patch *patch) 384{ 385struct strbuf sb = STRBUF_INIT; 386 387if(patch->old_name && patch->new_name && 388strcmp(patch->old_name, patch->new_name)) { 389quote_c_style(patch->old_name, &sb, NULL,0); 390strbuf_addstr(&sb," => "); 391quote_c_style(patch->new_name, &sb, NULL,0); 392}else{ 393const char*n = patch->new_name; 394if(!n) 395 n = patch->old_name; 396quote_c_style(n, &sb, NULL,0); 397} 398fprintf(output, fmt, sb.buf); 399fputc('\n', output); 400strbuf_release(&sb); 401} 402 403#define SLOP (16) 404 405static intread_patch_file(struct strbuf *sb,int fd) 406{ 407if(strbuf_read(sb, fd,0) <0) 408returnerror_errno("git apply: failed to read"); 409 410/* 411 * Make sure that we have some slop in the buffer 412 * so that we can do speculative "memcmp" etc, and 413 * see to it that it is NUL-filled. 414 */ 415strbuf_grow(sb, SLOP); 416memset(sb->buf + sb->len,0, SLOP); 417return0; 418} 419 420static unsigned longlinelen(const char*buffer,unsigned long size) 421{ 422unsigned long len =0; 423while(size--) { 424 len++; 425if(*buffer++ =='\n') 426break; 427} 428return len; 429} 430 431static intis_dev_null(const char*str) 432{ 433returnskip_prefix(str,"/dev/null", &str) &&isspace(*str); 434} 435 436#define TERM_SPACE 1 437#define TERM_TAB 2 438 439static intname_terminate(int c,int terminate) 440{ 441if(c ==' '&& !(terminate & TERM_SPACE)) 442return0; 443if(c =='\t'&& !(terminate & TERM_TAB)) 444return0; 445 446return1; 447} 448 449/* remove double slashes to make --index work with such filenames */ 450static char*squash_slash(char*name) 451{ 452int i =0, j =0; 453 454if(!name) 455return NULL; 456 457while(name[i]) { 458if((name[j++] = name[i++]) =='/') 459while(name[i] =='/') 460 i++; 461} 462 name[j] ='\0'; 463return name; 464} 465 466static char*find_name_gnu(struct apply_state *state, 467const char*line, 468const char*def, 469int p_value) 470{ 471struct strbuf name = STRBUF_INIT; 472char*cp; 473 474/* 475 * Proposed "new-style" GNU patch/diff format; see 476 * http://marc.info/?l=git&m=112927316408690&w=2 477 */ 478if(unquote_c_style(&name, line, NULL)) { 479strbuf_release(&name); 480return NULL; 481} 482 483for(cp = name.buf; p_value; p_value--) { 484 cp =strchr(cp,'/'); 485if(!cp) { 486strbuf_release(&name); 487return NULL; 488} 489 cp++; 490} 491 492strbuf_remove(&name,0, cp - name.buf); 493if(state->root.len) 494strbuf_insert(&name,0, state->root.buf, state->root.len); 495returnsquash_slash(strbuf_detach(&name, NULL)); 496} 497 498static size_tsane_tz_len(const char*line,size_t len) 499{ 500const char*tz, *p; 501 502if(len <strlen(" +0500") || line[len-strlen(" +0500")] !=' ') 503return0; 504 tz = line + len -strlen(" +0500"); 505 506if(tz[1] !='+'&& tz[1] !='-') 507return0; 508 509for(p = tz +2; p != line + len; p++) 510if(!isdigit(*p)) 511return0; 512 513return line + len - tz; 514} 515 516static size_ttz_with_colon_len(const char*line,size_t len) 517{ 518const char*tz, *p; 519 520if(len <strlen(" +08:00") || line[len -strlen(":00")] !=':') 521return0; 522 tz = line + len -strlen(" +08:00"); 523 524if(tz[0] !=' '|| (tz[1] !='+'&& tz[1] !='-')) 525return0; 526 p = tz +2; 527if(!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 528!isdigit(*p++) || !isdigit(*p++)) 529return0; 530 531return line + len - tz; 532} 533 534static size_tdate_len(const char*line,size_t len) 535{ 536const char*date, *p; 537 538if(len <strlen("72-02-05") || line[len-strlen("-05")] !='-') 539return0; 540 p = date = line + len -strlen("72-02-05"); 541 542if(!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 543!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 544!isdigit(*p++) || !isdigit(*p++))/* Not a date. */ 545return0; 546 547if(date - line >=strlen("19") && 548isdigit(date[-1]) &&isdigit(date[-2]))/* 4-digit year */ 549 date -=strlen("19"); 550 551return line + len - date; 552} 553 554static size_tshort_time_len(const char*line,size_t len) 555{ 556const char*time, *p; 557 558if(len <strlen(" 07:01:32") || line[len-strlen(":32")] !=':') 559return0; 560 p = time = line + len -strlen(" 07:01:32"); 561 562/* Permit 1-digit hours? */ 563if(*p++ !=' '|| 564!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 565!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 566!isdigit(*p++) || !isdigit(*p++))/* Not a time. */ 567return0; 568 569return line + len - time; 570} 571 572static size_tfractional_time_len(const char*line,size_t len) 573{ 574const char*p; 575size_t n; 576 577/* Expected format: 19:41:17.620000023 */ 578if(!len || !isdigit(line[len -1])) 579return0; 580 p = line + len -1; 581 582/* Fractional seconds. */ 583while(p > line &&isdigit(*p)) 584 p--; 585if(*p !='.') 586return0; 587 588/* Hours, minutes, and whole seconds. */ 589 n =short_time_len(line, p - line); 590if(!n) 591return0; 592 593return line + len - p + n; 594} 595 596static size_ttrailing_spaces_len(const char*line,size_t len) 597{ 598const char*p; 599 600/* Expected format: ' ' x (1 or more) */ 601if(!len || line[len -1] !=' ') 602return0; 603 604 p = line + len; 605while(p != line) { 606 p--; 607if(*p !=' ') 608return line + len - (p +1); 609} 610 611/* All spaces! */ 612return len; 613} 614 615static size_tdiff_timestamp_len(const char*line,size_t len) 616{ 617const char*end = line + len; 618size_t n; 619 620/* 621 * Posix: 2010-07-05 19:41:17 622 * GNU: 2010-07-05 19:41:17.620000023 -0500 623 */ 624 625if(!isdigit(end[-1])) 626return0; 627 628 n =sane_tz_len(line, end - line); 629if(!n) 630 n =tz_with_colon_len(line, end - line); 631 end -= n; 632 633 n =short_time_len(line, end - line); 634if(!n) 635 n =fractional_time_len(line, end - line); 636 end -= n; 637 638 n =date_len(line, end - line); 639if(!n)/* No date. Too bad. */ 640return0; 641 end -= n; 642 643if(end == line)/* No space before date. */ 644return0; 645if(end[-1] =='\t') {/* Success! */ 646 end--; 647return line + len - end; 648} 649if(end[-1] !=' ')/* No space before date. */ 650return0; 651 652/* Whitespace damage. */ 653 end -=trailing_spaces_len(line, end - line); 654return line + len - end; 655} 656 657static char*find_name_common(struct apply_state *state, 658const char*line, 659const char*def, 660int p_value, 661const char*end, 662int terminate) 663{ 664int len; 665const char*start = NULL; 666 667if(p_value ==0) 668 start = line; 669while(line != end) { 670char c = *line; 671 672if(!end &&isspace(c)) { 673if(c =='\n') 674break; 675if(name_terminate(c, terminate)) 676break; 677} 678 line++; 679if(c =='/'&& !--p_value) 680 start = line; 681} 682if(!start) 683returnsquash_slash(xstrdup_or_null(def)); 684 len = line - start; 685if(!len) 686returnsquash_slash(xstrdup_or_null(def)); 687 688/* 689 * Generally we prefer the shorter name, especially 690 * if the other one is just a variation of that with 691 * something else tacked on to the end (ie "file.orig" 692 * or "file~"). 693 */ 694if(def) { 695int deflen =strlen(def); 696if(deflen < len && !strncmp(start, def, deflen)) 697returnsquash_slash(xstrdup(def)); 698} 699 700if(state->root.len) { 701char*ret =xstrfmt("%s%.*s", state->root.buf, len, start); 702returnsquash_slash(ret); 703} 704 705returnsquash_slash(xmemdupz(start, len)); 706} 707 708static char*find_name(struct apply_state *state, 709const char*line, 710char*def, 711int p_value, 712int terminate) 713{ 714if(*line =='"') { 715char*name =find_name_gnu(state, line, def, p_value); 716if(name) 717return name; 718} 719 720returnfind_name_common(state, line, def, p_value, NULL, terminate); 721} 722 723static char*find_name_traditional(struct apply_state *state, 724const char*line, 725char*def, 726int p_value) 727{ 728size_t len; 729size_t date_len; 730 731if(*line =='"') { 732char*name =find_name_gnu(state, line, def, p_value); 733if(name) 734return name; 735} 736 737 len =strchrnul(line,'\n') - line; 738 date_len =diff_timestamp_len(line, len); 739if(!date_len) 740returnfind_name_common(state, line, def, p_value, NULL, TERM_TAB); 741 len -= date_len; 742 743returnfind_name_common(state, line, def, p_value, line + len,0); 744} 745 746static intcount_slashes(const char*cp) 747{ 748int cnt =0; 749char ch; 750 751while((ch = *cp++)) 752if(ch =='/') 753 cnt++; 754return cnt; 755} 756 757/* 758 * Given the string after "--- " or "+++ ", guess the appropriate 759 * p_value for the given patch. 760 */ 761static intguess_p_value(struct apply_state *state,const char*nameline) 762{ 763char*name, *cp; 764int val = -1; 765 766if(is_dev_null(nameline)) 767return-1; 768 name =find_name_traditional(state, nameline, NULL,0); 769if(!name) 770return-1; 771 cp =strchr(name,'/'); 772if(!cp) 773 val =0; 774else if(state->prefix) { 775/* 776 * Does it begin with "a/$our-prefix" and such? Then this is 777 * very likely to apply to our directory. 778 */ 779if(!strncmp(name, state->prefix, state->prefix_length)) 780 val =count_slashes(state->prefix); 781else{ 782 cp++; 783if(!strncmp(cp, state->prefix, state->prefix_length)) 784 val =count_slashes(state->prefix) +1; 785} 786} 787free(name); 788return val; 789} 790 791/* 792 * Does the ---/+++ line have the POSIX timestamp after the last HT? 793 * GNU diff puts epoch there to signal a creation/deletion event. Is 794 * this such a timestamp? 795 */ 796static inthas_epoch_timestamp(const char*nameline) 797{ 798/* 799 * We are only interested in epoch timestamp; any non-zero 800 * fraction cannot be one, hence "(\.0+)?" in the regexp below. 801 * For the same reason, the date must be either 1969-12-31 or 802 * 1970-01-01, and the seconds part must be "00". 803 */ 804const char stamp_regexp[] = 805"^(1969-12-31|1970-01-01)" 806" " 807"[0-2][0-9]:[0-5][0-9]:00(\\.0+)?" 808" " 809"([-+][0-2][0-9]:?[0-5][0-9])\n"; 810const char*timestamp = NULL, *cp, *colon; 811static regex_t *stamp; 812 regmatch_t m[10]; 813int zoneoffset; 814int hourminute; 815int status; 816 817for(cp = nameline; *cp !='\n'; cp++) { 818if(*cp =='\t') 819 timestamp = cp +1; 820} 821if(!timestamp) 822return0; 823if(!stamp) { 824 stamp =xmalloc(sizeof(*stamp)); 825if(regcomp(stamp, stamp_regexp, REG_EXTENDED)) { 826warning(_("Cannot prepare timestamp regexp%s"), 827 stamp_regexp); 828return0; 829} 830} 831 832 status =regexec(stamp, timestamp,ARRAY_SIZE(m), m,0); 833if(status) { 834if(status != REG_NOMATCH) 835warning(_("regexec returned%dfor input:%s"), 836 status, timestamp); 837return0; 838} 839 840 zoneoffset =strtol(timestamp + m[3].rm_so +1, (char**) &colon,10); 841if(*colon ==':') 842 zoneoffset = zoneoffset *60+strtol(colon +1, NULL,10); 843else 844 zoneoffset = (zoneoffset /100) *60+ (zoneoffset %100); 845if(timestamp[m[3].rm_so] =='-') 846 zoneoffset = -zoneoffset; 847 848/* 849 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31 850 * (west of GMT) or 1970-01-01 (east of GMT) 851 */ 852if((zoneoffset <0&&memcmp(timestamp,"1969-12-31",10)) || 853(0<= zoneoffset &&memcmp(timestamp,"1970-01-01",10))) 854return0; 855 856 hourminute = (strtol(timestamp +11, NULL,10) *60+ 857strtol(timestamp +14, NULL,10) - 858 zoneoffset); 859 860return((zoneoffset <0&& hourminute ==1440) || 861(0<= zoneoffset && !hourminute)); 862} 863 864/* 865 * Get the name etc info from the ---/+++ lines of a traditional patch header 866 * 867 * FIXME! The end-of-filename heuristics are kind of screwy. For existing 868 * files, we can happily check the index for a match, but for creating a 869 * new file we should try to match whatever "patch" does. I have no idea. 870 */ 871static intparse_traditional_patch(struct apply_state *state, 872const char*first, 873const char*second, 874struct patch *patch) 875{ 876char*name; 877 878 first +=4;/* skip "--- " */ 879 second +=4;/* skip "+++ " */ 880if(!state->p_value_known) { 881int p, q; 882 p =guess_p_value(state, first); 883 q =guess_p_value(state, second); 884if(p <0) p = q; 885if(0<= p && p == q) { 886 state->p_value = p; 887 state->p_value_known =1; 888} 889} 890if(is_dev_null(first)) { 891 patch->is_new =1; 892 patch->is_delete =0; 893 name =find_name_traditional(state, second, NULL, state->p_value); 894 patch->new_name = name; 895}else if(is_dev_null(second)) { 896 patch->is_new =0; 897 patch->is_delete =1; 898 name =find_name_traditional(state, first, NULL, state->p_value); 899 patch->old_name = name; 900}else{ 901char*first_name; 902 first_name =find_name_traditional(state, first, NULL, state->p_value); 903 name =find_name_traditional(state, second, first_name, state->p_value); 904free(first_name); 905if(has_epoch_timestamp(first)) { 906 patch->is_new =1; 907 patch->is_delete =0; 908 patch->new_name = name; 909}else if(has_epoch_timestamp(second)) { 910 patch->is_new =0; 911 patch->is_delete =1; 912 patch->old_name = name; 913}else{ 914 patch->old_name = name; 915 patch->new_name =xstrdup_or_null(name); 916} 917} 918if(!name) 919returnerror(_("unable to find filename in patch at line%d"), state->linenr); 920 921return0; 922} 923 924static intgitdiff_hdrend(struct apply_state *state, 925const char*line, 926struct patch *patch) 927{ 928return1; 929} 930 931/* 932 * We're anal about diff header consistency, to make 933 * sure that we don't end up having strange ambiguous 934 * patches floating around. 935 * 936 * As a result, gitdiff_{old|new}name() will check 937 * their names against any previous information, just 938 * to make sure.. 939 */ 940#define DIFF_OLD_NAME 0 941#define DIFF_NEW_NAME 1 942 943static intgitdiff_verify_name(struct apply_state *state, 944const char*line, 945int isnull, 946char**name, 947int side) 948{ 949if(!*name && !isnull) { 950*name =find_name(state, line, NULL, state->p_value, TERM_TAB); 951return0; 952} 953 954if(*name) { 955int len =strlen(*name); 956char*another; 957if(isnull) 958returnerror(_("git apply: bad git-diff - expected /dev/null, got%son line%d"), 959*name, state->linenr); 960 another =find_name(state, line, NULL, state->p_value, TERM_TAB); 961if(!another ||memcmp(another, *name, len +1)) { 962free(another); 963returnerror((side == DIFF_NEW_NAME) ? 964_("git apply: bad git-diff - inconsistent new filename on line%d") : 965_("git apply: bad git-diff - inconsistent old filename on line%d"), state->linenr); 966} 967free(another); 968}else{ 969/* expect "/dev/null" */ 970if(memcmp("/dev/null", line,9) || line[9] !='\n') 971returnerror(_("git apply: bad git-diff - expected /dev/null on line%d"), state->linenr); 972} 973 974return0; 975} 976 977static intgitdiff_oldname(struct apply_state *state, 978const char*line, 979struct patch *patch) 980{ 981returngitdiff_verify_name(state, line, 982 patch->is_new, &patch->old_name, 983 DIFF_OLD_NAME); 984} 985 986static intgitdiff_newname(struct apply_state *state, 987const char*line, 988struct patch *patch) 989{ 990returngitdiff_verify_name(state, line, 991 patch->is_delete, &patch->new_name, 992 DIFF_NEW_NAME); 993} 994 995static intgitdiff_oldmode(struct apply_state *state, 996const char*line, 997struct patch *patch) 998{ 999 patch->old_mode =strtoul(line, NULL,8);1000return0;1001}10021003static intgitdiff_newmode(struct apply_state *state,1004const char*line,1005struct patch *patch)1006{1007 patch->new_mode =strtoul(line, NULL,8);1008return0;1009}10101011static intgitdiff_delete(struct apply_state *state,1012const char*line,1013struct patch *patch)1014{1015 patch->is_delete =1;1016free(patch->old_name);1017 patch->old_name =xstrdup_or_null(patch->def_name);1018returngitdiff_oldmode(state, line, patch);1019}10201021static intgitdiff_newfile(struct apply_state *state,1022const char*line,1023struct patch *patch)1024{1025 patch->is_new =1;1026free(patch->new_name);1027 patch->new_name =xstrdup_or_null(patch->def_name);1028returngitdiff_newmode(state, line, patch);1029}10301031static intgitdiff_copysrc(struct apply_state *state,1032const char*line,1033struct patch *patch)1034{1035 patch->is_copy =1;1036free(patch->old_name);1037 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1038return0;1039}10401041static intgitdiff_copydst(struct apply_state *state,1042const char*line,1043struct patch *patch)1044{1045 patch->is_copy =1;1046free(patch->new_name);1047 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1048return0;1049}10501051static intgitdiff_renamesrc(struct apply_state *state,1052const char*line,1053struct patch *patch)1054{1055 patch->is_rename =1;1056free(patch->old_name);1057 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1058return0;1059}10601061static intgitdiff_renamedst(struct apply_state *state,1062const char*line,1063struct patch *patch)1064{1065 patch->is_rename =1;1066free(patch->new_name);1067 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1068return0;1069}10701071static intgitdiff_similarity(struct apply_state *state,1072const char*line,1073struct patch *patch)1074{1075unsigned long val =strtoul(line, NULL,10);1076if(val <=100)1077 patch->score = val;1078return0;1079}10801081static intgitdiff_dissimilarity(struct apply_state *state,1082const char*line,1083struct patch *patch)1084{1085unsigned long val =strtoul(line, NULL,10);1086if(val <=100)1087 patch->score = val;1088return0;1089}10901091static intgitdiff_index(struct apply_state *state,1092const char*line,1093struct patch *patch)1094{1095/*1096 * index line is N hexadecimal, "..", N hexadecimal,1097 * and optional space with octal mode.1098 */1099const char*ptr, *eol;1100int len;11011102 ptr =strchr(line,'.');1103if(!ptr || ptr[1] !='.'||40< ptr - line)1104return0;1105 len = ptr - line;1106memcpy(patch->old_sha1_prefix, line, len);1107 patch->old_sha1_prefix[len] =0;11081109 line = ptr +2;1110 ptr =strchr(line,' ');1111 eol =strchrnul(line,'\n');11121113if(!ptr || eol < ptr)1114 ptr = eol;1115 len = ptr - line;11161117if(40< len)1118return0;1119memcpy(patch->new_sha1_prefix, line, len);1120 patch->new_sha1_prefix[len] =0;1121if(*ptr ==' ')1122 patch->old_mode =strtoul(ptr+1, NULL,8);1123return0;1124}11251126/*1127 * This is normal for a diff that doesn't change anything: we'll fall through1128 * into the next diff. Tell the parser to break out.1129 */1130static intgitdiff_unrecognized(struct apply_state *state,1131const char*line,1132struct patch *patch)1133{1134return1;1135}11361137/*1138 * Skip p_value leading components from "line"; as we do not accept1139 * absolute paths, return NULL in that case.1140 */1141static const char*skip_tree_prefix(struct apply_state *state,1142const char*line,1143int llen)1144{1145int nslash;1146int i;11471148if(!state->p_value)1149return(llen && line[0] =='/') ? NULL : line;11501151 nslash = state->p_value;1152for(i =0; i < llen; i++) {1153int ch = line[i];1154if(ch =='/'&& --nslash <=0)1155return(i ==0) ? NULL : &line[i +1];1156}1157return NULL;1158}11591160/*1161 * This is to extract the same name that appears on "diff --git"1162 * line. We do not find and return anything if it is a rename1163 * patch, and it is OK because we will find the name elsewhere.1164 * We need to reliably find name only when it is mode-change only,1165 * creation or deletion of an empty file. In any of these cases,1166 * both sides are the same name under a/ and b/ respectively.1167 */1168static char*git_header_name(struct apply_state *state,1169const char*line,1170int llen)1171{1172const char*name;1173const char*second = NULL;1174size_t len, line_len;11751176 line +=strlen("diff --git ");1177 llen -=strlen("diff --git ");11781179if(*line =='"') {1180const char*cp;1181struct strbuf first = STRBUF_INIT;1182struct strbuf sp = STRBUF_INIT;11831184if(unquote_c_style(&first, line, &second))1185goto free_and_fail1;11861187/* strip the a/b prefix including trailing slash */1188 cp =skip_tree_prefix(state, first.buf, first.len);1189if(!cp)1190goto free_and_fail1;1191strbuf_remove(&first,0, cp - first.buf);11921193/*1194 * second points at one past closing dq of name.1195 * find the second name.1196 */1197while((second < line + llen) &&isspace(*second))1198 second++;11991200if(line + llen <= second)1201goto free_and_fail1;1202if(*second =='"') {1203if(unquote_c_style(&sp, second, NULL))1204goto free_and_fail1;1205 cp =skip_tree_prefix(state, sp.buf, sp.len);1206if(!cp)1207goto free_and_fail1;1208/* They must match, otherwise ignore */1209if(strcmp(cp, first.buf))1210goto free_and_fail1;1211strbuf_release(&sp);1212returnstrbuf_detach(&first, NULL);1213}12141215/* unquoted second */1216 cp =skip_tree_prefix(state, second, line + llen - second);1217if(!cp)1218goto free_and_fail1;1219if(line + llen - cp != first.len ||1220memcmp(first.buf, cp, first.len))1221goto free_and_fail1;1222returnstrbuf_detach(&first, NULL);12231224 free_and_fail1:1225strbuf_release(&first);1226strbuf_release(&sp);1227return NULL;1228}12291230/* unquoted first name */1231 name =skip_tree_prefix(state, line, llen);1232if(!name)1233return NULL;12341235/*1236 * since the first name is unquoted, a dq if exists must be1237 * the beginning of the second name.1238 */1239for(second = name; second < line + llen; second++) {1240if(*second =='"') {1241struct strbuf sp = STRBUF_INIT;1242const char*np;12431244if(unquote_c_style(&sp, second, NULL))1245goto free_and_fail2;12461247 np =skip_tree_prefix(state, sp.buf, sp.len);1248if(!np)1249goto free_and_fail2;12501251 len = sp.buf + sp.len - np;1252if(len < second - name &&1253!strncmp(np, name, len) &&1254isspace(name[len])) {1255/* Good */1256strbuf_remove(&sp,0, np - sp.buf);1257returnstrbuf_detach(&sp, NULL);1258}12591260 free_and_fail2:1261strbuf_release(&sp);1262return NULL;1263}1264}12651266/*1267 * Accept a name only if it shows up twice, exactly the same1268 * form.1269 */1270 second =strchr(name,'\n');1271if(!second)1272return NULL;1273 line_len = second - name;1274for(len =0; ; len++) {1275switch(name[len]) {1276default:1277continue;1278case'\n':1279return NULL;1280case'\t':case' ':1281/*1282 * Is this the separator between the preimage1283 * and the postimage pathname? Again, we are1284 * only interested in the case where there is1285 * no rename, as this is only to set def_name1286 * and a rename patch has the names elsewhere1287 * in an unambiguous form.1288 */1289if(!name[len +1])1290return NULL;/* no postimage name */1291 second =skip_tree_prefix(state, name + len +1,1292 line_len - (len +1));1293if(!second)1294return NULL;1295/*1296 * Does len bytes starting at "name" and "second"1297 * (that are separated by one HT or SP we just1298 * found) exactly match?1299 */1300if(second[len] =='\n'&& !strncmp(name, second, len))1301returnxmemdupz(name, len);1302}1303}1304}13051306/* Verify that we recognize the lines following a git header */1307static intparse_git_header(struct apply_state *state,1308const char*line,1309int len,1310unsigned int size,1311struct patch *patch)1312{1313unsigned long offset;13141315/* A git diff has explicit new/delete information, so we don't guess */1316 patch->is_new =0;1317 patch->is_delete =0;13181319/*1320 * Some things may not have the old name in the1321 * rest of the headers anywhere (pure mode changes,1322 * or removing or adding empty files), so we get1323 * the default name from the header.1324 */1325 patch->def_name =git_header_name(state, line, len);1326if(patch->def_name && state->root.len) {1327char*s =xstrfmt("%s%s", state->root.buf, patch->def_name);1328free(patch->def_name);1329 patch->def_name = s;1330}13311332 line += len;1333 size -= len;1334 state->linenr++;1335for(offset = len ; size >0; offset += len, size -= len, line += len, state->linenr++) {1336static const struct opentry {1337const char*str;1338int(*fn)(struct apply_state *,const char*,struct patch *);1339} optable[] = {1340{"@@ -", gitdiff_hdrend },1341{"--- ", gitdiff_oldname },1342{"+++ ", gitdiff_newname },1343{"old mode ", gitdiff_oldmode },1344{"new mode ", gitdiff_newmode },1345{"deleted file mode ", gitdiff_delete },1346{"new file mode ", gitdiff_newfile },1347{"copy from ", gitdiff_copysrc },1348{"copy to ", gitdiff_copydst },1349{"rename old ", gitdiff_renamesrc },1350{"rename new ", gitdiff_renamedst },1351{"rename from ", gitdiff_renamesrc },1352{"rename to ", gitdiff_renamedst },1353{"similarity index ", gitdiff_similarity },1354{"dissimilarity index ", gitdiff_dissimilarity },1355{"index ", gitdiff_index },1356{"", gitdiff_unrecognized },1357};1358int i;13591360 len =linelen(line, size);1361if(!len || line[len-1] !='\n')1362break;1363for(i =0; i <ARRAY_SIZE(optable); i++) {1364const struct opentry *p = optable + i;1365int oplen =strlen(p->str);1366int res;1367if(len < oplen ||memcmp(p->str, line, oplen))1368continue;1369 res = p->fn(state, line + oplen, patch);1370if(res <0)1371return-1;1372if(res >0)1373return offset;1374break;1375}1376}13771378return offset;1379}13801381static intparse_num(const char*line,unsigned long*p)1382{1383char*ptr;13841385if(!isdigit(*line))1386return0;1387*p =strtoul(line, &ptr,10);1388return ptr - line;1389}13901391static intparse_range(const char*line,int len,int offset,const char*expect,1392unsigned long*p1,unsigned long*p2)1393{1394int digits, ex;13951396if(offset <0|| offset >= len)1397return-1;1398 line += offset;1399 len -= offset;14001401 digits =parse_num(line, p1);1402if(!digits)1403return-1;14041405 offset += digits;1406 line += digits;1407 len -= digits;14081409*p2 =1;1410if(*line ==',') {1411 digits =parse_num(line+1, p2);1412if(!digits)1413return-1;14141415 offset += digits+1;1416 line += digits+1;1417 len -= digits+1;1418}14191420 ex =strlen(expect);1421if(ex > len)1422return-1;1423if(memcmp(line, expect, ex))1424return-1;14251426return offset + ex;1427}14281429static voidrecount_diff(const char*line,int size,struct fragment *fragment)1430{1431int oldlines =0, newlines =0, ret =0;14321433if(size <1) {1434warning("recount: ignore empty hunk");1435return;1436}14371438for(;;) {1439int len =linelen(line, size);1440 size -= len;1441 line += len;14421443if(size <1)1444break;14451446switch(*line) {1447case' ':case'\n':1448 newlines++;1449/* fall through */1450case'-':1451 oldlines++;1452continue;1453case'+':1454 newlines++;1455continue;1456case'\\':1457continue;1458case'@':1459 ret = size <3|| !starts_with(line,"@@ ");1460break;1461case'd':1462 ret = size <5|| !starts_with(line,"diff ");1463break;1464default:1465 ret = -1;1466break;1467}1468if(ret) {1469warning(_("recount: unexpected line: %.*s"),1470(int)linelen(line, size), line);1471return;1472}1473break;1474}1475 fragment->oldlines = oldlines;1476 fragment->newlines = newlines;1477}14781479/*1480 * Parse a unified diff fragment header of the1481 * form "@@ -a,b +c,d @@"1482 */1483static intparse_fragment_header(const char*line,int len,struct fragment *fragment)1484{1485int offset;14861487if(!len || line[len-1] !='\n')1488return-1;14891490/* Figure out the number of lines in a fragment */1491 offset =parse_range(line, len,4," +", &fragment->oldpos, &fragment->oldlines);1492 offset =parse_range(line, len, offset," @@", &fragment->newpos, &fragment->newlines);14931494return offset;1495}14961497/*1498 * Find file diff header1499 *1500 * Returns:1501 * -1 if no header was found1502 * -128 in case of error1503 * the size of the header in bytes (called "offset") otherwise1504 */1505static intfind_header(struct apply_state *state,1506const char*line,1507unsigned long size,1508int*hdrsize,1509struct patch *patch)1510{1511unsigned long offset, len;15121513 patch->is_toplevel_relative =0;1514 patch->is_rename = patch->is_copy =0;1515 patch->is_new = patch->is_delete = -1;1516 patch->old_mode = patch->new_mode =0;1517 patch->old_name = patch->new_name = NULL;1518for(offset =0; size >0; offset += len, size -= len, line += len, state->linenr++) {1519unsigned long nextlen;15201521 len =linelen(line, size);1522if(!len)1523break;15241525/* Testing this early allows us to take a few shortcuts.. */1526if(len <6)1527continue;15281529/*1530 * Make sure we don't find any unconnected patch fragments.1531 * That's a sign that we didn't find a header, and that a1532 * patch has become corrupted/broken up.1533 */1534if(!memcmp("@@ -", line,4)) {1535struct fragment dummy;1536if(parse_fragment_header(line, len, &dummy) <0)1537continue;1538error(_("patch fragment without header at line%d: %.*s"),1539 state->linenr, (int)len-1, line);1540return-128;1541}15421543if(size < len +6)1544break;15451546/*1547 * Git patch? It might not have a real patch, just a rename1548 * or mode change, so we handle that specially1549 */1550if(!memcmp("diff --git ", line,11)) {1551int git_hdr_len =parse_git_header(state, line, len, size, patch);1552if(git_hdr_len <0)1553return-128;1554if(git_hdr_len <= len)1555continue;1556if(!patch->old_name && !patch->new_name) {1557if(!patch->def_name) {1558error(Q_("git diff header lacks filename information when removing "1559"%dleading pathname component (line%d)",1560"git diff header lacks filename information when removing "1561"%dleading pathname components (line%d)",1562 state->p_value),1563 state->p_value, state->linenr);1564return-128;1565}1566 patch->old_name =xstrdup(patch->def_name);1567 patch->new_name =xstrdup(patch->def_name);1568}1569if(!patch->is_delete && !patch->new_name) {1570error(_("git diff header lacks filename information "1571"(line%d)"), state->linenr);1572return-128;1573}1574 patch->is_toplevel_relative =1;1575*hdrsize = git_hdr_len;1576return offset;1577}15781579/* --- followed by +++ ? */1580if(memcmp("--- ", line,4) ||memcmp("+++ ", line + len,4))1581continue;15821583/*1584 * We only accept unified patches, so we want it to1585 * at least have "@@ -a,b +c,d @@\n", which is 14 chars1586 * minimum ("@@ -0,0 +1 @@\n" is the shortest).1587 */1588 nextlen =linelen(line + len, size - len);1589if(size < nextlen +14||memcmp("@@ -", line + len + nextlen,4))1590continue;15911592/* Ok, we'll consider it a patch */1593if(parse_traditional_patch(state, line, line+len, patch))1594return-128;1595*hdrsize = len + nextlen;1596 state->linenr +=2;1597return offset;1598}1599return-1;1600}16011602static voidrecord_ws_error(struct apply_state *state,1603unsigned result,1604const char*line,1605int len,1606int linenr)1607{1608char*err;16091610if(!result)1611return;16121613 state->whitespace_error++;1614if(state->squelch_whitespace_errors &&1615 state->squelch_whitespace_errors < state->whitespace_error)1616return;16171618 err =whitespace_error_string(result);1619if(state->apply_verbosity > verbosity_silent)1620fprintf(stderr,"%s:%d:%s.\n%.*s\n",1621 state->patch_input_file, linenr, err, len, line);1622free(err);1623}16241625static voidcheck_whitespace(struct apply_state *state,1626const char*line,1627int len,1628unsigned ws_rule)1629{1630unsigned result =ws_check(line +1, len -1, ws_rule);16311632record_ws_error(state, result, line +1, len -2, state->linenr);1633}16341635/*1636 * Parse a unified diff. Note that this really needs to parse each1637 * fragment separately, since the only way to know the difference1638 * between a "---" that is part of a patch, and a "---" that starts1639 * the next patch is to look at the line counts..1640 */1641static intparse_fragment(struct apply_state *state,1642const char*line,1643unsigned long size,1644struct patch *patch,1645struct fragment *fragment)1646{1647int added, deleted;1648int len =linelen(line, size), offset;1649unsigned long oldlines, newlines;1650unsigned long leading, trailing;16511652 offset =parse_fragment_header(line, len, fragment);1653if(offset <0)1654return-1;1655if(offset >0&& patch->recount)1656recount_diff(line + offset, size - offset, fragment);1657 oldlines = fragment->oldlines;1658 newlines = fragment->newlines;1659 leading =0;1660 trailing =0;16611662/* Parse the thing.. */1663 line += len;1664 size -= len;1665 state->linenr++;1666 added = deleted =0;1667for(offset = len;16680< size;1669 offset += len, size -= len, line += len, state->linenr++) {1670if(!oldlines && !newlines)1671break;1672 len =linelen(line, size);1673if(!len || line[len-1] !='\n')1674return-1;1675switch(*line) {1676default:1677return-1;1678case'\n':/* newer GNU diff, an empty context line */1679case' ':1680 oldlines--;1681 newlines--;1682if(!deleted && !added)1683 leading++;1684 trailing++;1685if(!state->apply_in_reverse &&1686 state->ws_error_action == correct_ws_error)1687check_whitespace(state, line, len, patch->ws_rule);1688break;1689case'-':1690if(state->apply_in_reverse &&1691 state->ws_error_action != nowarn_ws_error)1692check_whitespace(state, line, len, patch->ws_rule);1693 deleted++;1694 oldlines--;1695 trailing =0;1696break;1697case'+':1698if(!state->apply_in_reverse &&1699 state->ws_error_action != nowarn_ws_error)1700check_whitespace(state, line, len, patch->ws_rule);1701 added++;1702 newlines--;1703 trailing =0;1704break;17051706/*1707 * We allow "\ No newline at end of file". Depending1708 * on locale settings when the patch was produced we1709 * don't know what this line looks like. The only1710 * thing we do know is that it begins with "\ ".1711 * Checking for 12 is just for sanity check -- any1712 * l10n of "\ No newline..." is at least that long.1713 */1714case'\\':1715if(len <12||memcmp(line,"\\",2))1716return-1;1717break;1718}1719}1720if(oldlines || newlines)1721return-1;1722if(!deleted && !added)1723return-1;17241725 fragment->leading = leading;1726 fragment->trailing = trailing;17271728/*1729 * If a fragment ends with an incomplete line, we failed to include1730 * it in the above loop because we hit oldlines == newlines == 01731 * before seeing it.1732 */1733if(12< size && !memcmp(line,"\\",2))1734 offset +=linelen(line, size);17351736 patch->lines_added += added;1737 patch->lines_deleted += deleted;17381739if(0< patch->is_new && oldlines)1740returnerror(_("new file depends on old contents"));1741if(0< patch->is_delete && newlines)1742returnerror(_("deleted file still has contents"));1743return offset;1744}17451746/*1747 * We have seen "diff --git a/... b/..." header (or a traditional patch1748 * header). Read hunks that belong to this patch into fragments and hang1749 * them to the given patch structure.1750 *1751 * The (fragment->patch, fragment->size) pair points into the memory given1752 * by the caller, not a copy, when we return.1753 *1754 * Returns:1755 * -1 in case of error,1756 * the number of bytes in the patch otherwise.1757 */1758static intparse_single_patch(struct apply_state *state,1759const char*line,1760unsigned long size,1761struct patch *patch)1762{1763unsigned long offset =0;1764unsigned long oldlines =0, newlines =0, context =0;1765struct fragment **fragp = &patch->fragments;17661767while(size >4&& !memcmp(line,"@@ -",4)) {1768struct fragment *fragment;1769int len;17701771 fragment =xcalloc(1,sizeof(*fragment));1772 fragment->linenr = state->linenr;1773 len =parse_fragment(state, line, size, patch, fragment);1774if(len <=0) {1775free(fragment);1776returnerror(_("corrupt patch at line%d"), state->linenr);1777}1778 fragment->patch = line;1779 fragment->size = len;1780 oldlines += fragment->oldlines;1781 newlines += fragment->newlines;1782 context += fragment->leading + fragment->trailing;17831784*fragp = fragment;1785 fragp = &fragment->next;17861787 offset += len;1788 line += len;1789 size -= len;1790}17911792/*1793 * If something was removed (i.e. we have old-lines) it cannot1794 * be creation, and if something was added it cannot be1795 * deletion. However, the reverse is not true; --unified=01796 * patches that only add are not necessarily creation even1797 * though they do not have any old lines, and ones that only1798 * delete are not necessarily deletion.1799 *1800 * Unfortunately, a real creation/deletion patch do _not_ have1801 * any context line by definition, so we cannot safely tell it1802 * apart with --unified=0 insanity. At least if the patch has1803 * more than one hunk it is not creation or deletion.1804 */1805if(patch->is_new <0&&1806(oldlines || (patch->fragments && patch->fragments->next)))1807 patch->is_new =0;1808if(patch->is_delete <0&&1809(newlines || (patch->fragments && patch->fragments->next)))1810 patch->is_delete =0;18111812if(0< patch->is_new && oldlines)1813returnerror(_("new file%sdepends on old contents"), patch->new_name);1814if(0< patch->is_delete && newlines)1815returnerror(_("deleted file%sstill has contents"), patch->old_name);1816if(!patch->is_delete && !newlines && context && state->apply_verbosity > verbosity_silent)1817fprintf_ln(stderr,1818_("** warning: "1819"file%sbecomes empty but is not deleted"),1820 patch->new_name);18211822return offset;1823}18241825staticinlineintmetadata_changes(struct patch *patch)1826{1827return patch->is_rename >0||1828 patch->is_copy >0||1829 patch->is_new >0||1830 patch->is_delete ||1831(patch->old_mode && patch->new_mode &&1832 patch->old_mode != patch->new_mode);1833}18341835static char*inflate_it(const void*data,unsigned long size,1836unsigned long inflated_size)1837{1838 git_zstream stream;1839void*out;1840int st;18411842memset(&stream,0,sizeof(stream));18431844 stream.next_in = (unsigned char*)data;1845 stream.avail_in = size;1846 stream.next_out = out =xmalloc(inflated_size);1847 stream.avail_out = inflated_size;1848git_inflate_init(&stream);1849 st =git_inflate(&stream, Z_FINISH);1850git_inflate_end(&stream);1851if((st != Z_STREAM_END) || stream.total_out != inflated_size) {1852free(out);1853return NULL;1854}1855return out;1856}18571858/*1859 * Read a binary hunk and return a new fragment; fragment->patch1860 * points at an allocated memory that the caller must free, so1861 * it is marked as "->free_patch = 1".1862 */1863static struct fragment *parse_binary_hunk(struct apply_state *state,1864char**buf_p,1865unsigned long*sz_p,1866int*status_p,1867int*used_p)1868{1869/*1870 * Expect a line that begins with binary patch method ("literal"1871 * or "delta"), followed by the length of data before deflating.1872 * a sequence of 'length-byte' followed by base-85 encoded data1873 * should follow, terminated by a newline.1874 *1875 * Each 5-byte sequence of base-85 encodes up to 4 bytes,1876 * and we would limit the patch line to 66 characters,1877 * so one line can fit up to 13 groups that would decode1878 * to 52 bytes max. The length byte 'A'-'Z' corresponds1879 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.1880 */1881int llen, used;1882unsigned long size = *sz_p;1883char*buffer = *buf_p;1884int patch_method;1885unsigned long origlen;1886char*data = NULL;1887int hunk_size =0;1888struct fragment *frag;18891890 llen =linelen(buffer, size);1891 used = llen;18921893*status_p =0;18941895if(starts_with(buffer,"delta ")) {1896 patch_method = BINARY_DELTA_DEFLATED;1897 origlen =strtoul(buffer +6, NULL,10);1898}1899else if(starts_with(buffer,"literal ")) {1900 patch_method = BINARY_LITERAL_DEFLATED;1901 origlen =strtoul(buffer +8, NULL,10);1902}1903else1904return NULL;19051906 state->linenr++;1907 buffer += llen;1908while(1) {1909int byte_length, max_byte_length, newsize;1910 llen =linelen(buffer, size);1911 used += llen;1912 state->linenr++;1913if(llen ==1) {1914/* consume the blank line */1915 buffer++;1916 size--;1917break;1918}1919/*1920 * Minimum line is "A00000\n" which is 7-byte long,1921 * and the line length must be multiple of 5 plus 2.1922 */1923if((llen <7) || (llen-2) %5)1924goto corrupt;1925 max_byte_length = (llen -2) /5*4;1926 byte_length = *buffer;1927if('A'<= byte_length && byte_length <='Z')1928 byte_length = byte_length -'A'+1;1929else if('a'<= byte_length && byte_length <='z')1930 byte_length = byte_length -'a'+27;1931else1932goto corrupt;1933/* if the input length was not multiple of 4, we would1934 * have filler at the end but the filler should never1935 * exceed 3 bytes1936 */1937if(max_byte_length < byte_length ||1938 byte_length <= max_byte_length -4)1939goto corrupt;1940 newsize = hunk_size + byte_length;1941 data =xrealloc(data, newsize);1942if(decode_85(data + hunk_size, buffer +1, byte_length))1943goto corrupt;1944 hunk_size = newsize;1945 buffer += llen;1946 size -= llen;1947}19481949 frag =xcalloc(1,sizeof(*frag));1950 frag->patch =inflate_it(data, hunk_size, origlen);1951 frag->free_patch =1;1952if(!frag->patch)1953goto corrupt;1954free(data);1955 frag->size = origlen;1956*buf_p = buffer;1957*sz_p = size;1958*used_p = used;1959 frag->binary_patch_method = patch_method;1960return frag;19611962 corrupt:1963free(data);1964*status_p = -1;1965error(_("corrupt binary patch at line%d: %.*s"),1966 state->linenr-1, llen-1, buffer);1967return NULL;1968}19691970/*1971 * Returns:1972 * -1 in case of error,1973 * the length of the parsed binary patch otherwise1974 */1975static intparse_binary(struct apply_state *state,1976char*buffer,1977unsigned long size,1978struct patch *patch)1979{1980/*1981 * We have read "GIT binary patch\n"; what follows is a line1982 * that says the patch method (currently, either "literal" or1983 * "delta") and the length of data before deflating; a1984 * sequence of 'length-byte' followed by base-85 encoded data1985 * follows.1986 *1987 * When a binary patch is reversible, there is another binary1988 * hunk in the same format, starting with patch method (either1989 * "literal" or "delta") with the length of data, and a sequence1990 * of length-byte + base-85 encoded data, terminated with another1991 * empty line. This data, when applied to the postimage, produces1992 * the preimage.1993 */1994struct fragment *forward;1995struct fragment *reverse;1996int status;1997int used, used_1;19981999 forward =parse_binary_hunk(state, &buffer, &size, &status, &used);2000if(!forward && !status)2001/* there has to be one hunk (forward hunk) */2002returnerror(_("unrecognized binary patch at line%d"), state->linenr-1);2003if(status)2004/* otherwise we already gave an error message */2005return status;20062007 reverse =parse_binary_hunk(state, &buffer, &size, &status, &used_1);2008if(reverse)2009 used += used_1;2010else if(status) {2011/*2012 * Not having reverse hunk is not an error, but having2013 * a corrupt reverse hunk is.2014 */2015free((void*) forward->patch);2016free(forward);2017return status;2018}2019 forward->next = reverse;2020 patch->fragments = forward;2021 patch->is_binary =1;2022return used;2023}20242025static voidprefix_one(struct apply_state *state,char**name)2026{2027char*old_name = *name;2028if(!old_name)2029return;2030*name =xstrdup(prefix_filename(state->prefix, state->prefix_length, *name));2031free(old_name);2032}20332034static voidprefix_patch(struct apply_state *state,struct patch *p)2035{2036if(!state->prefix || p->is_toplevel_relative)2037return;2038prefix_one(state, &p->new_name);2039prefix_one(state, &p->old_name);2040}20412042/*2043 * include/exclude2044 */20452046static voidadd_name_limit(struct apply_state *state,2047const char*name,2048int exclude)2049{2050struct string_list_item *it;20512052 it =string_list_append(&state->limit_by_name, name);2053 it->util = exclude ? NULL : (void*)1;2054}20552056static intuse_patch(struct apply_state *state,struct patch *p)2057{2058const char*pathname = p->new_name ? p->new_name : p->old_name;2059int i;20602061/* Paths outside are not touched regardless of "--include" */2062if(0< state->prefix_length) {2063int pathlen =strlen(pathname);2064if(pathlen <= state->prefix_length ||2065memcmp(state->prefix, pathname, state->prefix_length))2066return0;2067}20682069/* See if it matches any of exclude/include rule */2070for(i =0; i < state->limit_by_name.nr; i++) {2071struct string_list_item *it = &state->limit_by_name.items[i];2072if(!wildmatch(it->string, pathname,0, NULL))2073return(it->util != NULL);2074}20752076/*2077 * If we had any include, a path that does not match any rule is2078 * not used. Otherwise, we saw bunch of exclude rules (or none)2079 * and such a path is used.2080 */2081return!state->has_include;2082}20832084/*2085 * Read the patch text in "buffer" that extends for "size" bytes; stop2086 * reading after seeing a single patch (i.e. changes to a single file).2087 * Create fragments (i.e. patch hunks) and hang them to the given patch.2088 *2089 * Returns:2090 * -1 if no header was found or parse_binary() failed,2091 * -128 on another error,2092 * the number of bytes consumed otherwise,2093 * so that the caller can call us again for the next patch.2094 */2095static intparse_chunk(struct apply_state *state,char*buffer,unsigned long size,struct patch *patch)2096{2097int hdrsize, patchsize;2098int offset =find_header(state, buffer, size, &hdrsize, patch);20992100if(offset <0)2101return offset;21022103prefix_patch(state, patch);21042105if(!use_patch(state, patch))2106 patch->ws_rule =0;2107else2108 patch->ws_rule =whitespace_rule(patch->new_name2109? patch->new_name2110: patch->old_name);21112112 patchsize =parse_single_patch(state,2113 buffer + offset + hdrsize,2114 size - offset - hdrsize,2115 patch);21162117if(patchsize <0)2118return-128;21192120if(!patchsize) {2121static const char git_binary[] ="GIT binary patch\n";2122int hd = hdrsize + offset;2123unsigned long llen =linelen(buffer + hd, size - hd);21242125if(llen ==sizeof(git_binary) -1&&2126!memcmp(git_binary, buffer + hd, llen)) {2127int used;2128 state->linenr++;2129 used =parse_binary(state, buffer + hd + llen,2130 size - hd - llen, patch);2131if(used <0)2132return-1;2133if(used)2134 patchsize = used + llen;2135else2136 patchsize =0;2137}2138else if(!memcmp(" differ\n", buffer + hd + llen -8,8)) {2139static const char*binhdr[] = {2140"Binary files ",2141"Files ",2142 NULL,2143};2144int i;2145for(i =0; binhdr[i]; i++) {2146int len =strlen(binhdr[i]);2147if(len < size - hd &&2148!memcmp(binhdr[i], buffer + hd, len)) {2149 state->linenr++;2150 patch->is_binary =1;2151 patchsize = llen;2152break;2153}2154}2155}21562157/* Empty patch cannot be applied if it is a text patch2158 * without metadata change. A binary patch appears2159 * empty to us here.2160 */2161if((state->apply || state->check) &&2162(!patch->is_binary && !metadata_changes(patch))) {2163error(_("patch with only garbage at line%d"), state->linenr);2164return-128;2165}2166}21672168return offset + hdrsize + patchsize;2169}21702171#define swap(a,b) myswap((a),(b),sizeof(a))21722173#define myswap(a, b, size) do { \2174 unsigned char mytmp[size]; \2175 memcpy(mytmp, &a, size); \2176 memcpy(&a, &b, size); \2177 memcpy(&b, mytmp, size); \2178} while (0)21792180static voidreverse_patches(struct patch *p)2181{2182for(; p; p = p->next) {2183struct fragment *frag = p->fragments;21842185swap(p->new_name, p->old_name);2186swap(p->new_mode, p->old_mode);2187swap(p->is_new, p->is_delete);2188swap(p->lines_added, p->lines_deleted);2189swap(p->old_sha1_prefix, p->new_sha1_prefix);21902191for(; frag; frag = frag->next) {2192swap(frag->newpos, frag->oldpos);2193swap(frag->newlines, frag->oldlines);2194}2195}2196}21972198static const char pluses[] =2199"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";2200static const char minuses[]=2201"----------------------------------------------------------------------";22022203static voidshow_stats(struct apply_state *state,struct patch *patch)2204{2205struct strbuf qname = STRBUF_INIT;2206char*cp = patch->new_name ? patch->new_name : patch->old_name;2207int max, add, del;22082209quote_c_style(cp, &qname, NULL,0);22102211/*2212 * "scale" the filename2213 */2214 max = state->max_len;2215if(max >50)2216 max =50;22172218if(qname.len > max) {2219 cp =strchr(qname.buf + qname.len +3- max,'/');2220if(!cp)2221 cp = qname.buf + qname.len +3- max;2222strbuf_splice(&qname,0, cp - qname.buf,"...",3);2223}22242225if(patch->is_binary) {2226printf(" %-*s | Bin\n", max, qname.buf);2227strbuf_release(&qname);2228return;2229}22302231printf(" %-*s |", max, qname.buf);2232strbuf_release(&qname);22332234/*2235 * scale the add/delete2236 */2237 max = max + state->max_change >70?70- max : state->max_change;2238 add = patch->lines_added;2239 del = patch->lines_deleted;22402241if(state->max_change >0) {2242int total = ((add + del) * max + state->max_change /2) / state->max_change;2243 add = (add * max + state->max_change /2) / state->max_change;2244 del = total - add;2245}2246printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,2247 add, pluses, del, minuses);2248}22492250static intread_old_data(struct stat *st,const char*path,struct strbuf *buf)2251{2252switch(st->st_mode & S_IFMT) {2253case S_IFLNK:2254if(strbuf_readlink(buf, path, st->st_size) <0)2255returnerror(_("unable to read symlink%s"), path);2256return0;2257case S_IFREG:2258if(strbuf_read_file(buf, path, st->st_size) != st->st_size)2259returnerror(_("unable to open or read%s"), path);2260convert_to_git(path, buf->buf, buf->len, buf,0);2261return0;2262default:2263return-1;2264}2265}22662267/*2268 * Update the preimage, and the common lines in postimage,2269 * from buffer buf of length len. If postlen is 0 the postimage2270 * is updated in place, otherwise it's updated on a new buffer2271 * of length postlen2272 */22732274static voidupdate_pre_post_images(struct image *preimage,2275struct image *postimage,2276char*buf,2277size_t len,size_t postlen)2278{2279int i, ctx, reduced;2280char*new, *old, *fixed;2281struct image fixed_preimage;22822283/*2284 * Update the preimage with whitespace fixes. Note that we2285 * are not losing preimage->buf -- apply_one_fragment() will2286 * free "oldlines".2287 */2288prepare_image(&fixed_preimage, buf, len,1);2289assert(postlen2290? fixed_preimage.nr == preimage->nr2291: fixed_preimage.nr <= preimage->nr);2292for(i =0; i < fixed_preimage.nr; i++)2293 fixed_preimage.line[i].flag = preimage->line[i].flag;2294free(preimage->line_allocated);2295*preimage = fixed_preimage;22962297/*2298 * Adjust the common context lines in postimage. This can be2299 * done in-place when we are shrinking it with whitespace2300 * fixing, but needs a new buffer when ignoring whitespace or2301 * expanding leading tabs to spaces.2302 *2303 * We trust the caller to tell us if the update can be done2304 * in place (postlen==0) or not.2305 */2306 old = postimage->buf;2307if(postlen)2308new= postimage->buf =xmalloc(postlen);2309else2310new= old;2311 fixed = preimage->buf;23122313for(i = reduced = ctx =0; i < postimage->nr; i++) {2314size_t l_len = postimage->line[i].len;2315if(!(postimage->line[i].flag & LINE_COMMON)) {2316/* an added line -- no counterparts in preimage */2317memmove(new, old, l_len);2318 old += l_len;2319new+= l_len;2320continue;2321}23222323/* a common context -- skip it in the original postimage */2324 old += l_len;23252326/* and find the corresponding one in the fixed preimage */2327while(ctx < preimage->nr &&2328!(preimage->line[ctx].flag & LINE_COMMON)) {2329 fixed += preimage->line[ctx].len;2330 ctx++;2331}23322333/*2334 * preimage is expected to run out, if the caller2335 * fixed addition of trailing blank lines.2336 */2337if(preimage->nr <= ctx) {2338 reduced++;2339continue;2340}23412342/* and copy it in, while fixing the line length */2343 l_len = preimage->line[ctx].len;2344memcpy(new, fixed, l_len);2345new+= l_len;2346 fixed += l_len;2347 postimage->line[i].len = l_len;2348 ctx++;2349}23502351if(postlen2352? postlen <new- postimage->buf2353: postimage->len <new- postimage->buf)2354die("BUG: caller miscounted postlen: asked%d, orig =%d, used =%d",2355(int)postlen, (int) postimage->len, (int)(new- postimage->buf));23562357/* Fix the length of the whole thing */2358 postimage->len =new- postimage->buf;2359 postimage->nr -= reduced;2360}23612362static intline_by_line_fuzzy_match(struct image *img,2363struct image *preimage,2364struct image *postimage,2365unsigned longtry,2366int try_lno,2367int preimage_limit)2368{2369int i;2370size_t imgoff =0;2371size_t preoff =0;2372size_t postlen = postimage->len;2373size_t extra_chars;2374char*buf;2375char*preimage_eof;2376char*preimage_end;2377struct strbuf fixed;2378char*fixed_buf;2379size_t fixed_len;23802381for(i =0; i < preimage_limit; i++) {2382size_t prelen = preimage->line[i].len;2383size_t imglen = img->line[try_lno+i].len;23842385if(!fuzzy_matchlines(img->buf +try+ imgoff, imglen,2386 preimage->buf + preoff, prelen))2387return0;2388if(preimage->line[i].flag & LINE_COMMON)2389 postlen += imglen - prelen;2390 imgoff += imglen;2391 preoff += prelen;2392}23932394/*2395 * Ok, the preimage matches with whitespace fuzz.2396 *2397 * imgoff now holds the true length of the target that2398 * matches the preimage before the end of the file.2399 *2400 * Count the number of characters in the preimage that fall2401 * beyond the end of the file and make sure that all of them2402 * are whitespace characters. (This can only happen if2403 * we are removing blank lines at the end of the file.)2404 */2405 buf = preimage_eof = preimage->buf + preoff;2406for( ; i < preimage->nr; i++)2407 preoff += preimage->line[i].len;2408 preimage_end = preimage->buf + preoff;2409for( ; buf < preimage_end; buf++)2410if(!isspace(*buf))2411return0;24122413/*2414 * Update the preimage and the common postimage context2415 * lines to use the same whitespace as the target.2416 * If whitespace is missing in the target (i.e.2417 * if the preimage extends beyond the end of the file),2418 * use the whitespace from the preimage.2419 */2420 extra_chars = preimage_end - preimage_eof;2421strbuf_init(&fixed, imgoff + extra_chars);2422strbuf_add(&fixed, img->buf +try, imgoff);2423strbuf_add(&fixed, preimage_eof, extra_chars);2424 fixed_buf =strbuf_detach(&fixed, &fixed_len);2425update_pre_post_images(preimage, postimage,2426 fixed_buf, fixed_len, postlen);2427return1;2428}24292430static intmatch_fragment(struct apply_state *state,2431struct image *img,2432struct image *preimage,2433struct image *postimage,2434unsigned longtry,2435int try_lno,2436unsigned ws_rule,2437int match_beginning,int match_end)2438{2439int i;2440char*fixed_buf, *buf, *orig, *target;2441struct strbuf fixed;2442size_t fixed_len, postlen;2443int preimage_limit;24442445if(preimage->nr + try_lno <= img->nr) {2446/*2447 * The hunk falls within the boundaries of img.2448 */2449 preimage_limit = preimage->nr;2450if(match_end && (preimage->nr + try_lno != img->nr))2451return0;2452}else if(state->ws_error_action == correct_ws_error &&2453(ws_rule & WS_BLANK_AT_EOF)) {2454/*2455 * This hunk extends beyond the end of img, and we are2456 * removing blank lines at the end of the file. This2457 * many lines from the beginning of the preimage must2458 * match with img, and the remainder of the preimage2459 * must be blank.2460 */2461 preimage_limit = img->nr - try_lno;2462}else{2463/*2464 * The hunk extends beyond the end of the img and2465 * we are not removing blanks at the end, so we2466 * should reject the hunk at this position.2467 */2468return0;2469}24702471if(match_beginning && try_lno)2472return0;24732474/* Quick hash check */2475for(i =0; i < preimage_limit; i++)2476if((img->line[try_lno + i].flag & LINE_PATCHED) ||2477(preimage->line[i].hash != img->line[try_lno + i].hash))2478return0;24792480if(preimage_limit == preimage->nr) {2481/*2482 * Do we have an exact match? If we were told to match2483 * at the end, size must be exactly at try+fragsize,2484 * otherwise try+fragsize must be still within the preimage,2485 * and either case, the old piece should match the preimage2486 * exactly.2487 */2488if((match_end2489? (try+ preimage->len == img->len)2490: (try+ preimage->len <= img->len)) &&2491!memcmp(img->buf +try, preimage->buf, preimage->len))2492return1;2493}else{2494/*2495 * The preimage extends beyond the end of img, so2496 * there cannot be an exact match.2497 *2498 * There must be one non-blank context line that match2499 * a line before the end of img.2500 */2501char*buf_end;25022503 buf = preimage->buf;2504 buf_end = buf;2505for(i =0; i < preimage_limit; i++)2506 buf_end += preimage->line[i].len;25072508for( ; buf < buf_end; buf++)2509if(!isspace(*buf))2510break;2511if(buf == buf_end)2512return0;2513}25142515/*2516 * No exact match. If we are ignoring whitespace, run a line-by-line2517 * fuzzy matching. We collect all the line length information because2518 * we need it to adjust whitespace if we match.2519 */2520if(state->ws_ignore_action == ignore_ws_change)2521returnline_by_line_fuzzy_match(img, preimage, postimage,2522try, try_lno, preimage_limit);25232524if(state->ws_error_action != correct_ws_error)2525return0;25262527/*2528 * The hunk does not apply byte-by-byte, but the hash says2529 * it might with whitespace fuzz. We weren't asked to2530 * ignore whitespace, we were asked to correct whitespace2531 * errors, so let's try matching after whitespace correction.2532 *2533 * While checking the preimage against the target, whitespace2534 * errors in both fixed, we count how large the corresponding2535 * postimage needs to be. The postimage prepared by2536 * apply_one_fragment() has whitespace errors fixed on added2537 * lines already, but the common lines were propagated as-is,2538 * which may become longer when their whitespace errors are2539 * fixed.2540 */25412542/* First count added lines in postimage */2543 postlen =0;2544for(i =0; i < postimage->nr; i++) {2545if(!(postimage->line[i].flag & LINE_COMMON))2546 postlen += postimage->line[i].len;2547}25482549/*2550 * The preimage may extend beyond the end of the file,2551 * but in this loop we will only handle the part of the2552 * preimage that falls within the file.2553 */2554strbuf_init(&fixed, preimage->len +1);2555 orig = preimage->buf;2556 target = img->buf +try;2557for(i =0; i < preimage_limit; i++) {2558size_t oldlen = preimage->line[i].len;2559size_t tgtlen = img->line[try_lno + i].len;2560size_t fixstart = fixed.len;2561struct strbuf tgtfix;2562int match;25632564/* Try fixing the line in the preimage */2565ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);25662567/* Try fixing the line in the target */2568strbuf_init(&tgtfix, tgtlen);2569ws_fix_copy(&tgtfix, target, tgtlen, ws_rule, NULL);25702571/*2572 * If they match, either the preimage was based on2573 * a version before our tree fixed whitespace breakage,2574 * or we are lacking a whitespace-fix patch the tree2575 * the preimage was based on already had (i.e. target2576 * has whitespace breakage, the preimage doesn't).2577 * In either case, we are fixing the whitespace breakages2578 * so we might as well take the fix together with their2579 * real change.2580 */2581 match = (tgtfix.len == fixed.len - fixstart &&2582!memcmp(tgtfix.buf, fixed.buf + fixstart,2583 fixed.len - fixstart));25842585/* Add the length if this is common with the postimage */2586if(preimage->line[i].flag & LINE_COMMON)2587 postlen += tgtfix.len;25882589strbuf_release(&tgtfix);2590if(!match)2591goto unmatch_exit;25922593 orig += oldlen;2594 target += tgtlen;2595}259625972598/*2599 * Now handle the lines in the preimage that falls beyond the2600 * end of the file (if any). They will only match if they are2601 * empty or only contain whitespace (if WS_BLANK_AT_EOL is2602 * false).2603 */2604for( ; i < preimage->nr; i++) {2605size_t fixstart = fixed.len;/* start of the fixed preimage */2606size_t oldlen = preimage->line[i].len;2607int j;26082609/* Try fixing the line in the preimage */2610ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);26112612for(j = fixstart; j < fixed.len; j++)2613if(!isspace(fixed.buf[j]))2614goto unmatch_exit;26152616 orig += oldlen;2617}26182619/*2620 * Yes, the preimage is based on an older version that still2621 * has whitespace breakages unfixed, and fixing them makes the2622 * hunk match. Update the context lines in the postimage.2623 */2624 fixed_buf =strbuf_detach(&fixed, &fixed_len);2625if(postlen < postimage->len)2626 postlen =0;2627update_pre_post_images(preimage, postimage,2628 fixed_buf, fixed_len, postlen);2629return1;26302631 unmatch_exit:2632strbuf_release(&fixed);2633return0;2634}26352636static intfind_pos(struct apply_state *state,2637struct image *img,2638struct image *preimage,2639struct image *postimage,2640int line,2641unsigned ws_rule,2642int match_beginning,int match_end)2643{2644int i;2645unsigned long backwards, forwards,try;2646int backwards_lno, forwards_lno, try_lno;26472648/*2649 * If match_beginning or match_end is specified, there is no2650 * point starting from a wrong line that will never match and2651 * wander around and wait for a match at the specified end.2652 */2653if(match_beginning)2654 line =0;2655else if(match_end)2656 line = img->nr - preimage->nr;26572658/*2659 * Because the comparison is unsigned, the following test2660 * will also take care of a negative line number that can2661 * result when match_end and preimage is larger than the target.2662 */2663if((size_t) line > img->nr)2664 line = img->nr;26652666try=0;2667for(i =0; i < line; i++)2668try+= img->line[i].len;26692670/*2671 * There's probably some smart way to do this, but I'll leave2672 * that to the smart and beautiful people. I'm simple and stupid.2673 */2674 backwards =try;2675 backwards_lno = line;2676 forwards =try;2677 forwards_lno = line;2678 try_lno = line;26792680for(i =0; ; i++) {2681if(match_fragment(state, img, preimage, postimage,2682try, try_lno, ws_rule,2683 match_beginning, match_end))2684return try_lno;26852686 again:2687if(backwards_lno ==0&& forwards_lno == img->nr)2688break;26892690if(i &1) {2691if(backwards_lno ==0) {2692 i++;2693goto again;2694}2695 backwards_lno--;2696 backwards -= img->line[backwards_lno].len;2697try= backwards;2698 try_lno = backwards_lno;2699}else{2700if(forwards_lno == img->nr) {2701 i++;2702goto again;2703}2704 forwards += img->line[forwards_lno].len;2705 forwards_lno++;2706try= forwards;2707 try_lno = forwards_lno;2708}27092710}2711return-1;2712}27132714static voidremove_first_line(struct image *img)2715{2716 img->buf += img->line[0].len;2717 img->len -= img->line[0].len;2718 img->line++;2719 img->nr--;2720}27212722static voidremove_last_line(struct image *img)2723{2724 img->len -= img->line[--img->nr].len;2725}27262727/*2728 * The change from "preimage" and "postimage" has been found to2729 * apply at applied_pos (counts in line numbers) in "img".2730 * Update "img" to remove "preimage" and replace it with "postimage".2731 */2732static voidupdate_image(struct apply_state *state,2733struct image *img,2734int applied_pos,2735struct image *preimage,2736struct image *postimage)2737{2738/*2739 * remove the copy of preimage at offset in img2740 * and replace it with postimage2741 */2742int i, nr;2743size_t remove_count, insert_count, applied_at =0;2744char*result;2745int preimage_limit;27462747/*2748 * If we are removing blank lines at the end of img,2749 * the preimage may extend beyond the end.2750 * If that is the case, we must be careful only to2751 * remove the part of the preimage that falls within2752 * the boundaries of img. Initialize preimage_limit2753 * to the number of lines in the preimage that falls2754 * within the boundaries.2755 */2756 preimage_limit = preimage->nr;2757if(preimage_limit > img->nr - applied_pos)2758 preimage_limit = img->nr - applied_pos;27592760for(i =0; i < applied_pos; i++)2761 applied_at += img->line[i].len;27622763 remove_count =0;2764for(i =0; i < preimage_limit; i++)2765 remove_count += img->line[applied_pos + i].len;2766 insert_count = postimage->len;27672768/* Adjust the contents */2769 result =xmalloc(st_add3(st_sub(img->len, remove_count), insert_count,1));2770memcpy(result, img->buf, applied_at);2771memcpy(result + applied_at, postimage->buf, postimage->len);2772memcpy(result + applied_at + postimage->len,2773 img->buf + (applied_at + remove_count),2774 img->len - (applied_at + remove_count));2775free(img->buf);2776 img->buf = result;2777 img->len += insert_count - remove_count;2778 result[img->len] ='\0';27792780/* Adjust the line table */2781 nr = img->nr + postimage->nr - preimage_limit;2782if(preimage_limit < postimage->nr) {2783/*2784 * NOTE: this knows that we never call remove_first_line()2785 * on anything other than pre/post image.2786 */2787REALLOC_ARRAY(img->line, nr);2788 img->line_allocated = img->line;2789}2790if(preimage_limit != postimage->nr)2791memmove(img->line + applied_pos + postimage->nr,2792 img->line + applied_pos + preimage_limit,2793(img->nr - (applied_pos + preimage_limit)) *2794sizeof(*img->line));2795memcpy(img->line + applied_pos,2796 postimage->line,2797 postimage->nr *sizeof(*img->line));2798if(!state->allow_overlap)2799for(i =0; i < postimage->nr; i++)2800 img->line[applied_pos + i].flag |= LINE_PATCHED;2801 img->nr = nr;2802}28032804/*2805 * Use the patch-hunk text in "frag" to prepare two images (preimage and2806 * postimage) for the hunk. Find lines that match "preimage" in "img" and2807 * replace the part of "img" with "postimage" text.2808 */2809static intapply_one_fragment(struct apply_state *state,2810struct image *img,struct fragment *frag,2811int inaccurate_eof,unsigned ws_rule,2812int nth_fragment)2813{2814int match_beginning, match_end;2815const char*patch = frag->patch;2816int size = frag->size;2817char*old, *oldlines;2818struct strbuf newlines;2819int new_blank_lines_at_end =0;2820int found_new_blank_lines_at_end =0;2821int hunk_linenr = frag->linenr;2822unsigned long leading, trailing;2823int pos, applied_pos;2824struct image preimage;2825struct image postimage;28262827memset(&preimage,0,sizeof(preimage));2828memset(&postimage,0,sizeof(postimage));2829 oldlines =xmalloc(size);2830strbuf_init(&newlines, size);28312832 old = oldlines;2833while(size >0) {2834char first;2835int len =linelen(patch, size);2836int plen;2837int added_blank_line =0;2838int is_blank_context =0;2839size_t start;28402841if(!len)2842break;28432844/*2845 * "plen" is how much of the line we should use for2846 * the actual patch data. Normally we just remove the2847 * first character on the line, but if the line is2848 * followed by "\ No newline", then we also remove the2849 * last one (which is the newline, of course).2850 */2851 plen = len -1;2852if(len < size && patch[len] =='\\')2853 plen--;2854 first = *patch;2855if(state->apply_in_reverse) {2856if(first =='-')2857 first ='+';2858else if(first =='+')2859 first ='-';2860}28612862switch(first) {2863case'\n':2864/* Newer GNU diff, empty context line */2865if(plen <0)2866/* ... followed by '\No newline'; nothing */2867break;2868*old++ ='\n';2869strbuf_addch(&newlines,'\n');2870add_line_info(&preimage,"\n",1, LINE_COMMON);2871add_line_info(&postimage,"\n",1, LINE_COMMON);2872 is_blank_context =1;2873break;2874case' ':2875if(plen && (ws_rule & WS_BLANK_AT_EOF) &&2876ws_blank_line(patch +1, plen, ws_rule))2877 is_blank_context =1;2878case'-':2879memcpy(old, patch +1, plen);2880add_line_info(&preimage, old, plen,2881(first ==' '? LINE_COMMON :0));2882 old += plen;2883if(first =='-')2884break;2885/* Fall-through for ' ' */2886case'+':2887/* --no-add does not add new lines */2888if(first =='+'&& state->no_add)2889break;28902891 start = newlines.len;2892if(first !='+'||2893!state->whitespace_error ||2894 state->ws_error_action != correct_ws_error) {2895strbuf_add(&newlines, patch +1, plen);2896}2897else{2898ws_fix_copy(&newlines, patch +1, plen, ws_rule, &state->applied_after_fixing_ws);2899}2900add_line_info(&postimage, newlines.buf + start, newlines.len - start,2901(first =='+'?0: LINE_COMMON));2902if(first =='+'&&2903(ws_rule & WS_BLANK_AT_EOF) &&2904ws_blank_line(patch +1, plen, ws_rule))2905 added_blank_line =1;2906break;2907case'@':case'\\':2908/* Ignore it, we already handled it */2909break;2910default:2911if(state->apply_verbosity > verbosity_normal)2912error(_("invalid start of line: '%c'"), first);2913 applied_pos = -1;2914goto out;2915}2916if(added_blank_line) {2917if(!new_blank_lines_at_end)2918 found_new_blank_lines_at_end = hunk_linenr;2919 new_blank_lines_at_end++;2920}2921else if(is_blank_context)2922;2923else2924 new_blank_lines_at_end =0;2925 patch += len;2926 size -= len;2927 hunk_linenr++;2928}2929if(inaccurate_eof &&2930 old > oldlines && old[-1] =='\n'&&2931 newlines.len >0&& newlines.buf[newlines.len -1] =='\n') {2932 old--;2933strbuf_setlen(&newlines, newlines.len -1);2934}29352936 leading = frag->leading;2937 trailing = frag->trailing;29382939/*2940 * A hunk to change lines at the beginning would begin with2941 * @@ -1,L +N,M @@2942 * but we need to be careful. -U0 that inserts before the second2943 * line also has this pattern.2944 *2945 * And a hunk to add to an empty file would begin with2946 * @@ -0,0 +N,M @@2947 *2948 * In other words, a hunk that is (frag->oldpos <= 1) with or2949 * without leading context must match at the beginning.2950 */2951 match_beginning = (!frag->oldpos ||2952(frag->oldpos ==1&& !state->unidiff_zero));29532954/*2955 * A hunk without trailing lines must match at the end.2956 * However, we simply cannot tell if a hunk must match end2957 * from the lack of trailing lines if the patch was generated2958 * with unidiff without any context.2959 */2960 match_end = !state->unidiff_zero && !trailing;29612962 pos = frag->newpos ? (frag->newpos -1) :0;2963 preimage.buf = oldlines;2964 preimage.len = old - oldlines;2965 postimage.buf = newlines.buf;2966 postimage.len = newlines.len;2967 preimage.line = preimage.line_allocated;2968 postimage.line = postimage.line_allocated;29692970for(;;) {29712972 applied_pos =find_pos(state, img, &preimage, &postimage, pos,2973 ws_rule, match_beginning, match_end);29742975if(applied_pos >=0)2976break;29772978/* Am I at my context limits? */2979if((leading <= state->p_context) && (trailing <= state->p_context))2980break;2981if(match_beginning || match_end) {2982 match_beginning = match_end =0;2983continue;2984}29852986/*2987 * Reduce the number of context lines; reduce both2988 * leading and trailing if they are equal otherwise2989 * just reduce the larger context.2990 */2991if(leading >= trailing) {2992remove_first_line(&preimage);2993remove_first_line(&postimage);2994 pos--;2995 leading--;2996}2997if(trailing > leading) {2998remove_last_line(&preimage);2999remove_last_line(&postimage);3000 trailing--;3001}3002}30033004if(applied_pos >=0) {3005if(new_blank_lines_at_end &&3006 preimage.nr + applied_pos >= img->nr &&3007(ws_rule & WS_BLANK_AT_EOF) &&3008 state->ws_error_action != nowarn_ws_error) {3009record_ws_error(state, WS_BLANK_AT_EOF,"+",1,3010 found_new_blank_lines_at_end);3011if(state->ws_error_action == correct_ws_error) {3012while(new_blank_lines_at_end--)3013remove_last_line(&postimage);3014}3015/*3016 * We would want to prevent write_out_results()3017 * from taking place in apply_patch() that follows3018 * the callchain led us here, which is:3019 * apply_patch->check_patch_list->check_patch->3020 * apply_data->apply_fragments->apply_one_fragment3021 */3022if(state->ws_error_action == die_on_ws_error)3023 state->apply =0;3024}30253026if(state->apply_verbosity > verbosity_normal && applied_pos != pos) {3027int offset = applied_pos - pos;3028if(state->apply_in_reverse)3029 offset =0- offset;3030fprintf_ln(stderr,3031Q_("Hunk #%dsucceeded at%d(offset%dline).",3032"Hunk #%dsucceeded at%d(offset%dlines).",3033 offset),3034 nth_fragment, applied_pos +1, offset);3035}30363037/*3038 * Warn if it was necessary to reduce the number3039 * of context lines.3040 */3041if((leading != frag->leading ||3042 trailing != frag->trailing) && state->apply_verbosity > verbosity_silent)3043fprintf_ln(stderr,_("Context reduced to (%ld/%ld)"3044" to apply fragment at%d"),3045 leading, trailing, applied_pos+1);3046update_image(state, img, applied_pos, &preimage, &postimage);3047}else{3048if(state->apply_verbosity > verbosity_normal)3049error(_("while searching for:\n%.*s"),3050(int)(old - oldlines), oldlines);3051}30523053out:3054free(oldlines);3055strbuf_release(&newlines);3056free(preimage.line_allocated);3057free(postimage.line_allocated);30583059return(applied_pos <0);3060}30613062static intapply_binary_fragment(struct apply_state *state,3063struct image *img,3064struct patch *patch)3065{3066struct fragment *fragment = patch->fragments;3067unsigned long len;3068void*dst;30693070if(!fragment)3071returnerror(_("missing binary patch data for '%s'"),3072 patch->new_name ?3073 patch->new_name :3074 patch->old_name);30753076/* Binary patch is irreversible without the optional second hunk */3077if(state->apply_in_reverse) {3078if(!fragment->next)3079returnerror(_("cannot reverse-apply a binary patch "3080"without the reverse hunk to '%s'"),3081 patch->new_name3082? patch->new_name : patch->old_name);3083 fragment = fragment->next;3084}3085switch(fragment->binary_patch_method) {3086case BINARY_DELTA_DEFLATED:3087 dst =patch_delta(img->buf, img->len, fragment->patch,3088 fragment->size, &len);3089if(!dst)3090return-1;3091clear_image(img);3092 img->buf = dst;3093 img->len = len;3094return0;3095case BINARY_LITERAL_DEFLATED:3096clear_image(img);3097 img->len = fragment->size;3098 img->buf =xmemdupz(fragment->patch, img->len);3099return0;3100}3101return-1;3102}31033104/*3105 * Replace "img" with the result of applying the binary patch.3106 * The binary patch data itself in patch->fragment is still kept3107 * but the preimage prepared by the caller in "img" is freed here3108 * or in the helper function apply_binary_fragment() this calls.3109 */3110static intapply_binary(struct apply_state *state,3111struct image *img,3112struct patch *patch)3113{3114const char*name = patch->old_name ? patch->old_name : patch->new_name;3115struct object_id oid;31163117/*3118 * For safety, we require patch index line to contain3119 * full 40-byte textual SHA1 for old and new, at least for now.3120 */3121if(strlen(patch->old_sha1_prefix) !=40||3122strlen(patch->new_sha1_prefix) !=40||3123get_oid_hex(patch->old_sha1_prefix, &oid) ||3124get_oid_hex(patch->new_sha1_prefix, &oid))3125returnerror(_("cannot apply binary patch to '%s' "3126"without full index line"), name);31273128if(patch->old_name) {3129/*3130 * See if the old one matches what the patch3131 * applies to.3132 */3133hash_sha1_file(img->buf, img->len, blob_type, oid.hash);3134if(strcmp(oid_to_hex(&oid), patch->old_sha1_prefix))3135returnerror(_("the patch applies to '%s' (%s), "3136"which does not match the "3137"current contents."),3138 name,oid_to_hex(&oid));3139}3140else{3141/* Otherwise, the old one must be empty. */3142if(img->len)3143returnerror(_("the patch applies to an empty "3144"'%s' but it is not empty"), name);3145}31463147get_oid_hex(patch->new_sha1_prefix, &oid);3148if(is_null_oid(&oid)) {3149clear_image(img);3150return0;/* deletion patch */3151}31523153if(has_sha1_file(oid.hash)) {3154/* We already have the postimage */3155enum object_type type;3156unsigned long size;3157char*result;31583159 result =read_sha1_file(oid.hash, &type, &size);3160if(!result)3161returnerror(_("the necessary postimage%sfor "3162"'%s' cannot be read"),3163 patch->new_sha1_prefix, name);3164clear_image(img);3165 img->buf = result;3166 img->len = size;3167}else{3168/*3169 * We have verified buf matches the preimage;3170 * apply the patch data to it, which is stored3171 * in the patch->fragments->{patch,size}.3172 */3173if(apply_binary_fragment(state, img, patch))3174returnerror(_("binary patch does not apply to '%s'"),3175 name);31763177/* verify that the result matches */3178hash_sha1_file(img->buf, img->len, blob_type, oid.hash);3179if(strcmp(oid_to_hex(&oid), patch->new_sha1_prefix))3180returnerror(_("binary patch to '%s' creates incorrect result (expecting%s, got%s)"),3181 name, patch->new_sha1_prefix,oid_to_hex(&oid));3182}31833184return0;3185}31863187static intapply_fragments(struct apply_state *state,struct image *img,struct patch *patch)3188{3189struct fragment *frag = patch->fragments;3190const char*name = patch->old_name ? patch->old_name : patch->new_name;3191unsigned ws_rule = patch->ws_rule;3192unsigned inaccurate_eof = patch->inaccurate_eof;3193int nth =0;31943195if(patch->is_binary)3196returnapply_binary(state, img, patch);31973198while(frag) {3199 nth++;3200if(apply_one_fragment(state, img, frag, inaccurate_eof, ws_rule, nth)) {3201error(_("patch failed:%s:%ld"), name, frag->oldpos);3202if(!state->apply_with_reject)3203return-1;3204 frag->rejected =1;3205}3206 frag = frag->next;3207}3208return0;3209}32103211static intread_blob_object(struct strbuf *buf,const struct object_id *oid,unsigned mode)3212{3213if(S_ISGITLINK(mode)) {3214strbuf_grow(buf,100);3215strbuf_addf(buf,"Subproject commit%s\n",oid_to_hex(oid));3216}else{3217enum object_type type;3218unsigned long sz;3219char*result;32203221 result =read_sha1_file(oid->hash, &type, &sz);3222if(!result)3223return-1;3224/* XXX read_sha1_file NUL-terminates */3225strbuf_attach(buf, result, sz, sz +1);3226}3227return0;3228}32293230static intread_file_or_gitlink(const struct cache_entry *ce,struct strbuf *buf)3231{3232if(!ce)3233return0;3234returnread_blob_object(buf, &ce->oid, ce->ce_mode);3235}32363237static struct patch *in_fn_table(struct apply_state *state,const char*name)3238{3239struct string_list_item *item;32403241if(name == NULL)3242return NULL;32433244 item =string_list_lookup(&state->fn_table, name);3245if(item != NULL)3246return(struct patch *)item->util;32473248return NULL;3249}32503251/*3252 * item->util in the filename table records the status of the path.3253 * Usually it points at a patch (whose result records the contents3254 * of it after applying it), but it could be PATH_WAS_DELETED for a3255 * path that a previously applied patch has already removed, or3256 * PATH_TO_BE_DELETED for a path that a later patch would remove.3257 *3258 * The latter is needed to deal with a case where two paths A and B3259 * are swapped by first renaming A to B and then renaming B to A;3260 * moving A to B should not be prevented due to presence of B as we3261 * will remove it in a later patch.3262 */3263#define PATH_TO_BE_DELETED ((struct patch *) -2)3264#define PATH_WAS_DELETED ((struct patch *) -1)32653266static intto_be_deleted(struct patch *patch)3267{3268return patch == PATH_TO_BE_DELETED;3269}32703271static intwas_deleted(struct patch *patch)3272{3273return patch == PATH_WAS_DELETED;3274}32753276static voidadd_to_fn_table(struct apply_state *state,struct patch *patch)3277{3278struct string_list_item *item;32793280/*3281 * Always add new_name unless patch is a deletion3282 * This should cover the cases for normal diffs,3283 * file creations and copies3284 */3285if(patch->new_name != NULL) {3286 item =string_list_insert(&state->fn_table, patch->new_name);3287 item->util = patch;3288}32893290/*3291 * store a failure on rename/deletion cases because3292 * later chunks shouldn't patch old names3293 */3294if((patch->new_name == NULL) || (patch->is_rename)) {3295 item =string_list_insert(&state->fn_table, patch->old_name);3296 item->util = PATH_WAS_DELETED;3297}3298}32993300static voidprepare_fn_table(struct apply_state *state,struct patch *patch)3301{3302/*3303 * store information about incoming file deletion3304 */3305while(patch) {3306if((patch->new_name == NULL) || (patch->is_rename)) {3307struct string_list_item *item;3308 item =string_list_insert(&state->fn_table, patch->old_name);3309 item->util = PATH_TO_BE_DELETED;3310}3311 patch = patch->next;3312}3313}33143315static intcheckout_target(struct index_state *istate,3316struct cache_entry *ce,struct stat *st)3317{3318struct checkout costate = CHECKOUT_INIT;33193320 costate.refresh_cache =1;3321 costate.istate = istate;3322if(checkout_entry(ce, &costate, NULL) ||lstat(ce->name, st))3323returnerror(_("cannot checkout%s"), ce->name);3324return0;3325}33263327static struct patch *previous_patch(struct apply_state *state,3328struct patch *patch,3329int*gone)3330{3331struct patch *previous;33323333*gone =0;3334if(patch->is_copy || patch->is_rename)3335return NULL;/* "git" patches do not depend on the order */33363337 previous =in_fn_table(state, patch->old_name);3338if(!previous)3339return NULL;33403341if(to_be_deleted(previous))3342return NULL;/* the deletion hasn't happened yet */33433344if(was_deleted(previous))3345*gone =1;33463347return previous;3348}33493350static intverify_index_match(const struct cache_entry *ce,struct stat *st)3351{3352if(S_ISGITLINK(ce->ce_mode)) {3353if(!S_ISDIR(st->st_mode))3354return-1;3355return0;3356}3357returnce_match_stat(ce, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);3358}33593360#define SUBMODULE_PATCH_WITHOUT_INDEX 133613362static intload_patch_target(struct apply_state *state,3363struct strbuf *buf,3364const struct cache_entry *ce,3365struct stat *st,3366const char*name,3367unsigned expected_mode)3368{3369if(state->cached || state->check_index) {3370if(read_file_or_gitlink(ce, buf))3371returnerror(_("failed to read%s"), name);3372}else if(name) {3373if(S_ISGITLINK(expected_mode)) {3374if(ce)3375returnread_file_or_gitlink(ce, buf);3376else3377return SUBMODULE_PATCH_WITHOUT_INDEX;3378}else if(has_symlink_leading_path(name,strlen(name))) {3379returnerror(_("reading from '%s' beyond a symbolic link"), name);3380}else{3381if(read_old_data(st, name, buf))3382returnerror(_("failed to read%s"), name);3383}3384}3385return0;3386}33873388/*3389 * We are about to apply "patch"; populate the "image" with the3390 * current version we have, from the working tree or from the index,3391 * depending on the situation e.g. --cached/--index. If we are3392 * applying a non-git patch that incrementally updates the tree,3393 * we read from the result of a previous diff.3394 */3395static intload_preimage(struct apply_state *state,3396struct image *image,3397struct patch *patch,struct stat *st,3398const struct cache_entry *ce)3399{3400struct strbuf buf = STRBUF_INIT;3401size_t len;3402char*img;3403struct patch *previous;3404int status;34053406 previous =previous_patch(state, patch, &status);3407if(status)3408returnerror(_("path%shas been renamed/deleted"),3409 patch->old_name);3410if(previous) {3411/* We have a patched copy in memory; use that. */3412strbuf_add(&buf, previous->result, previous->resultsize);3413}else{3414 status =load_patch_target(state, &buf, ce, st,3415 patch->old_name, patch->old_mode);3416if(status <0)3417return status;3418else if(status == SUBMODULE_PATCH_WITHOUT_INDEX) {3419/*3420 * There is no way to apply subproject3421 * patch without looking at the index.3422 * NEEDSWORK: shouldn't this be flagged3423 * as an error???3424 */3425free_fragment_list(patch->fragments);3426 patch->fragments = NULL;3427}else if(status) {3428returnerror(_("failed to read%s"), patch->old_name);3429}3430}34313432 img =strbuf_detach(&buf, &len);3433prepare_image(image, img, len, !patch->is_binary);3434return0;3435}34363437static intthree_way_merge(struct image *image,3438char*path,3439const struct object_id *base,3440const struct object_id *ours,3441const struct object_id *theirs)3442{3443 mmfile_t base_file, our_file, their_file;3444 mmbuffer_t result = { NULL };3445int status;34463447read_mmblob(&base_file, base);3448read_mmblob(&our_file, ours);3449read_mmblob(&their_file, theirs);3450 status =ll_merge(&result, path,3451&base_file,"base",3452&our_file,"ours",3453&their_file,"theirs", NULL);3454free(base_file.ptr);3455free(our_file.ptr);3456free(their_file.ptr);3457if(status <0|| !result.ptr) {3458free(result.ptr);3459return-1;3460}3461clear_image(image);3462 image->buf = result.ptr;3463 image->len = result.size;34643465return status;3466}34673468/*3469 * When directly falling back to add/add three-way merge, we read from3470 * the current contents of the new_name. In no cases other than that3471 * this function will be called.3472 */3473static intload_current(struct apply_state *state,3474struct image *image,3475struct patch *patch)3476{3477struct strbuf buf = STRBUF_INIT;3478int status, pos;3479size_t len;3480char*img;3481struct stat st;3482struct cache_entry *ce;3483char*name = patch->new_name;3484unsigned mode = patch->new_mode;34853486if(!patch->is_new)3487die("BUG: patch to%sis not a creation", patch->old_name);34883489 pos =cache_name_pos(name,strlen(name));3490if(pos <0)3491returnerror(_("%s: does not exist in index"), name);3492 ce = active_cache[pos];3493if(lstat(name, &st)) {3494if(errno != ENOENT)3495returnerror_errno("%s", name);3496if(checkout_target(&the_index, ce, &st))3497return-1;3498}3499if(verify_index_match(ce, &st))3500returnerror(_("%s: does not match index"), name);35013502 status =load_patch_target(state, &buf, ce, &st, name, mode);3503if(status <0)3504return status;3505else if(status)3506return-1;3507 img =strbuf_detach(&buf, &len);3508prepare_image(image, img, len, !patch->is_binary);3509return0;3510}35113512static inttry_threeway(struct apply_state *state,3513struct image *image,3514struct patch *patch,3515struct stat *st,3516const struct cache_entry *ce)3517{3518struct object_id pre_oid, post_oid, our_oid;3519struct strbuf buf = STRBUF_INIT;3520size_t len;3521int status;3522char*img;3523struct image tmp_image;35243525/* No point falling back to 3-way merge in these cases */3526if(patch->is_delete ||3527S_ISGITLINK(patch->old_mode) ||S_ISGITLINK(patch->new_mode))3528return-1;35293530/* Preimage the patch was prepared for */3531if(patch->is_new)3532write_sha1_file("",0, blob_type, pre_oid.hash);3533else if(get_sha1(patch->old_sha1_prefix, pre_oid.hash) ||3534read_blob_object(&buf, &pre_oid, patch->old_mode))3535returnerror(_("repository lacks the necessary blob to fall back on 3-way merge."));35363537if(state->apply_verbosity > verbosity_silent)3538fprintf(stderr,_("Falling back to three-way merge...\n"));35393540 img =strbuf_detach(&buf, &len);3541prepare_image(&tmp_image, img, len,1);3542/* Apply the patch to get the post image */3543if(apply_fragments(state, &tmp_image, patch) <0) {3544clear_image(&tmp_image);3545return-1;3546}3547/* post_oid is theirs */3548write_sha1_file(tmp_image.buf, tmp_image.len, blob_type, post_oid.hash);3549clear_image(&tmp_image);35503551/* our_oid is ours */3552if(patch->is_new) {3553if(load_current(state, &tmp_image, patch))3554returnerror(_("cannot read the current contents of '%s'"),3555 patch->new_name);3556}else{3557if(load_preimage(state, &tmp_image, patch, st, ce))3558returnerror(_("cannot read the current contents of '%s'"),3559 patch->old_name);3560}3561write_sha1_file(tmp_image.buf, tmp_image.len, blob_type, our_oid.hash);3562clear_image(&tmp_image);35633564/* in-core three-way merge between post and our using pre as base */3565 status =three_way_merge(image, patch->new_name,3566&pre_oid, &our_oid, &post_oid);3567if(status <0) {3568if(state->apply_verbosity > verbosity_silent)3569fprintf(stderr,3570_("Failed to fall back on three-way merge...\n"));3571return status;3572}35733574if(status) {3575 patch->conflicted_threeway =1;3576if(patch->is_new)3577oidclr(&patch->threeway_stage[0]);3578else3579oidcpy(&patch->threeway_stage[0], &pre_oid);3580oidcpy(&patch->threeway_stage[1], &our_oid);3581oidcpy(&patch->threeway_stage[2], &post_oid);3582if(state->apply_verbosity > verbosity_silent)3583fprintf(stderr,3584_("Applied patch to '%s' with conflicts.\n"),3585 patch->new_name);3586}else{3587if(state->apply_verbosity > verbosity_silent)3588fprintf(stderr,3589_("Applied patch to '%s' cleanly.\n"),3590 patch->new_name);3591}3592return0;3593}35943595static intapply_data(struct apply_state *state,struct patch *patch,3596struct stat *st,const struct cache_entry *ce)3597{3598struct image image;35993600if(load_preimage(state, &image, patch, st, ce) <0)3601return-1;36023603if(patch->direct_to_threeway ||3604apply_fragments(state, &image, patch) <0) {3605/* Note: with --reject, apply_fragments() returns 0 */3606if(!state->threeway ||try_threeway(state, &image, patch, st, ce) <0)3607return-1;3608}3609 patch->result = image.buf;3610 patch->resultsize = image.len;3611add_to_fn_table(state, patch);3612free(image.line_allocated);36133614if(0< patch->is_delete && patch->resultsize)3615returnerror(_("removal patch leaves file contents"));36163617return0;3618}36193620/*3621 * If "patch" that we are looking at modifies or deletes what we have,3622 * we would want it not to lose any local modification we have, either3623 * in the working tree or in the index.3624 *3625 * This also decides if a non-git patch is a creation patch or a3626 * modification to an existing empty file. We do not check the state3627 * of the current tree for a creation patch in this function; the caller3628 * check_patch() separately makes sure (and errors out otherwise) that3629 * the path the patch creates does not exist in the current tree.3630 */3631static intcheck_preimage(struct apply_state *state,3632struct patch *patch,3633struct cache_entry **ce,3634struct stat *st)3635{3636const char*old_name = patch->old_name;3637struct patch *previous = NULL;3638int stat_ret =0, status;3639unsigned st_mode =0;36403641if(!old_name)3642return0;36433644assert(patch->is_new <=0);3645 previous =previous_patch(state, patch, &status);36463647if(status)3648returnerror(_("path%shas been renamed/deleted"), old_name);3649if(previous) {3650 st_mode = previous->new_mode;3651}else if(!state->cached) {3652 stat_ret =lstat(old_name, st);3653if(stat_ret && errno != ENOENT)3654returnerror_errno("%s", old_name);3655}36563657if(state->check_index && !previous) {3658int pos =cache_name_pos(old_name,strlen(old_name));3659if(pos <0) {3660if(patch->is_new <0)3661goto is_new;3662returnerror(_("%s: does not exist in index"), old_name);3663}3664*ce = active_cache[pos];3665if(stat_ret <0) {3666if(checkout_target(&the_index, *ce, st))3667return-1;3668}3669if(!state->cached &&verify_index_match(*ce, st))3670returnerror(_("%s: does not match index"), old_name);3671if(state->cached)3672 st_mode = (*ce)->ce_mode;3673}else if(stat_ret <0) {3674if(patch->is_new <0)3675goto is_new;3676returnerror_errno("%s", old_name);3677}36783679if(!state->cached && !previous)3680 st_mode =ce_mode_from_stat(*ce, st->st_mode);36813682if(patch->is_new <0)3683 patch->is_new =0;3684if(!patch->old_mode)3685 patch->old_mode = st_mode;3686if((st_mode ^ patch->old_mode) & S_IFMT)3687returnerror(_("%s: wrong type"), old_name);3688if(st_mode != patch->old_mode)3689warning(_("%shas type%o, expected%o"),3690 old_name, st_mode, patch->old_mode);3691if(!patch->new_mode && !patch->is_delete)3692 patch->new_mode = st_mode;3693return0;36943695 is_new:3696 patch->is_new =1;3697 patch->is_delete =0;3698free(patch->old_name);3699 patch->old_name = NULL;3700return0;3701}370237033704#define EXISTS_IN_INDEX 13705#define EXISTS_IN_WORKTREE 237063707static intcheck_to_create(struct apply_state *state,3708const char*new_name,3709int ok_if_exists)3710{3711struct stat nst;37123713if(state->check_index &&3714cache_name_pos(new_name,strlen(new_name)) >=0&&3715!ok_if_exists)3716return EXISTS_IN_INDEX;3717if(state->cached)3718return0;37193720if(!lstat(new_name, &nst)) {3721if(S_ISDIR(nst.st_mode) || ok_if_exists)3722return0;3723/*3724 * A leading component of new_name might be a symlink3725 * that is going to be removed with this patch, but3726 * still pointing at somewhere that has the path.3727 * In such a case, path "new_name" does not exist as3728 * far as git is concerned.3729 */3730if(has_symlink_leading_path(new_name,strlen(new_name)))3731return0;37323733return EXISTS_IN_WORKTREE;3734}else if((errno != ENOENT) && (errno != ENOTDIR)) {3735returnerror_errno("%s", new_name);3736}3737return0;3738}37393740static uintptr_tregister_symlink_changes(struct apply_state *state,3741const char*path,3742uintptr_t what)3743{3744struct string_list_item *ent;37453746 ent =string_list_lookup(&state->symlink_changes, path);3747if(!ent) {3748 ent =string_list_insert(&state->symlink_changes, path);3749 ent->util = (void*)0;3750}3751 ent->util = (void*)(what | ((uintptr_t)ent->util));3752return(uintptr_t)ent->util;3753}37543755static uintptr_tcheck_symlink_changes(struct apply_state *state,const char*path)3756{3757struct string_list_item *ent;37583759 ent =string_list_lookup(&state->symlink_changes, path);3760if(!ent)3761return0;3762return(uintptr_t)ent->util;3763}37643765static voidprepare_symlink_changes(struct apply_state *state,struct patch *patch)3766{3767for( ; patch; patch = patch->next) {3768if((patch->old_name &&S_ISLNK(patch->old_mode)) &&3769(patch->is_rename || patch->is_delete))3770/* the symlink at patch->old_name is removed */3771register_symlink_changes(state, patch->old_name, APPLY_SYMLINK_GOES_AWAY);37723773if(patch->new_name &&S_ISLNK(patch->new_mode))3774/* the symlink at patch->new_name is created or remains */3775register_symlink_changes(state, patch->new_name, APPLY_SYMLINK_IN_RESULT);3776}3777}37783779static intpath_is_beyond_symlink_1(struct apply_state *state,struct strbuf *name)3780{3781do{3782unsigned int change;37833784while(--name->len && name->buf[name->len] !='/')3785;/* scan backwards */3786if(!name->len)3787break;3788 name->buf[name->len] ='\0';3789 change =check_symlink_changes(state, name->buf);3790if(change & APPLY_SYMLINK_IN_RESULT)3791return1;3792if(change & APPLY_SYMLINK_GOES_AWAY)3793/*3794 * This cannot be "return 0", because we may3795 * see a new one created at a higher level.3796 */3797continue;37983799/* otherwise, check the preimage */3800if(state->check_index) {3801struct cache_entry *ce;38023803 ce =cache_file_exists(name->buf, name->len, ignore_case);3804if(ce &&S_ISLNK(ce->ce_mode))3805return1;3806}else{3807struct stat st;3808if(!lstat(name->buf, &st) &&S_ISLNK(st.st_mode))3809return1;3810}3811}while(1);3812return0;3813}38143815static intpath_is_beyond_symlink(struct apply_state *state,const char*name_)3816{3817int ret;3818struct strbuf name = STRBUF_INIT;38193820assert(*name_ !='\0');3821strbuf_addstr(&name, name_);3822 ret =path_is_beyond_symlink_1(state, &name);3823strbuf_release(&name);38243825return ret;3826}38273828static intcheck_unsafe_path(struct patch *patch)3829{3830const char*old_name = NULL;3831const char*new_name = NULL;3832if(patch->is_delete)3833 old_name = patch->old_name;3834else if(!patch->is_new && !patch->is_copy)3835 old_name = patch->old_name;3836if(!patch->is_delete)3837 new_name = patch->new_name;38383839if(old_name && !verify_path(old_name))3840returnerror(_("invalid path '%s'"), old_name);3841if(new_name && !verify_path(new_name))3842returnerror(_("invalid path '%s'"), new_name);3843return0;3844}38453846/*3847 * Check and apply the patch in-core; leave the result in patch->result3848 * for the caller to write it out to the final destination.3849 */3850static intcheck_patch(struct apply_state *state,struct patch *patch)3851{3852struct stat st;3853const char*old_name = patch->old_name;3854const char*new_name = patch->new_name;3855const char*name = old_name ? old_name : new_name;3856struct cache_entry *ce = NULL;3857struct patch *tpatch;3858int ok_if_exists;3859int status;38603861 patch->rejected =1;/* we will drop this after we succeed */38623863 status =check_preimage(state, patch, &ce, &st);3864if(status)3865return status;3866 old_name = patch->old_name;38673868/*3869 * A type-change diff is always split into a patch to delete3870 * old, immediately followed by a patch to create new (see3871 * diff.c::run_diff()); in such a case it is Ok that the entry3872 * to be deleted by the previous patch is still in the working3873 * tree and in the index.3874 *3875 * A patch to swap-rename between A and B would first rename A3876 * to B and then rename B to A. While applying the first one,3877 * the presence of B should not stop A from getting renamed to3878 * B; ask to_be_deleted() about the later rename. Removal of3879 * B and rename from A to B is handled the same way by asking3880 * was_deleted().3881 */3882if((tpatch =in_fn_table(state, new_name)) &&3883(was_deleted(tpatch) ||to_be_deleted(tpatch)))3884 ok_if_exists =1;3885else3886 ok_if_exists =0;38873888if(new_name &&3889((0< patch->is_new) || patch->is_rename || patch->is_copy)) {3890int err =check_to_create(state, new_name, ok_if_exists);38913892if(err && state->threeway) {3893 patch->direct_to_threeway =1;3894}else switch(err) {3895case0:3896break;/* happy */3897case EXISTS_IN_INDEX:3898returnerror(_("%s: already exists in index"), new_name);3899break;3900case EXISTS_IN_WORKTREE:3901returnerror(_("%s: already exists in working directory"),3902 new_name);3903default:3904return err;3905}39063907if(!patch->new_mode) {3908if(0< patch->is_new)3909 patch->new_mode = S_IFREG |0644;3910else3911 patch->new_mode = patch->old_mode;3912}3913}39143915if(new_name && old_name) {3916int same = !strcmp(old_name, new_name);3917if(!patch->new_mode)3918 patch->new_mode = patch->old_mode;3919if((patch->old_mode ^ patch->new_mode) & S_IFMT) {3920if(same)3921returnerror(_("new mode (%o) of%sdoes not "3922"match old mode (%o)"),3923 patch->new_mode, new_name,3924 patch->old_mode);3925else3926returnerror(_("new mode (%o) of%sdoes not "3927"match old mode (%o) of%s"),3928 patch->new_mode, new_name,3929 patch->old_mode, old_name);3930}3931}39323933if(!state->unsafe_paths &&check_unsafe_path(patch))3934return-128;39353936/*3937 * An attempt to read from or delete a path that is beyond a3938 * symbolic link will be prevented by load_patch_target() that3939 * is called at the beginning of apply_data() so we do not3940 * have to worry about a patch marked with "is_delete" bit3941 * here. We however need to make sure that the patch result3942 * is not deposited to a path that is beyond a symbolic link3943 * here.3944 */3945if(!patch->is_delete &&path_is_beyond_symlink(state, patch->new_name))3946returnerror(_("affected file '%s' is beyond a symbolic link"),3947 patch->new_name);39483949if(apply_data(state, patch, &st, ce) <0)3950returnerror(_("%s: patch does not apply"), name);3951 patch->rejected =0;3952return0;3953}39543955static intcheck_patch_list(struct apply_state *state,struct patch *patch)3956{3957int err =0;39583959prepare_symlink_changes(state, patch);3960prepare_fn_table(state, patch);3961while(patch) {3962int res;3963if(state->apply_verbosity > verbosity_normal)3964say_patch_name(stderr,3965_("Checking patch%s..."), patch);3966 res =check_patch(state, patch);3967if(res == -128)3968return-128;3969 err |= res;3970 patch = patch->next;3971}3972return err;3973}39743975static intread_apply_cache(struct apply_state *state)3976{3977if(state->index_file)3978returnread_cache_from(state->index_file);3979else3980returnread_cache();3981}39823983/* This function tries to read the object name from the current index */3984static intget_current_oid(struct apply_state *state,const char*path,3985struct object_id *oid)3986{3987int pos;39883989if(read_apply_cache(state) <0)3990return-1;3991 pos =cache_name_pos(path,strlen(path));3992if(pos <0)3993return-1;3994oidcpy(oid, &active_cache[pos]->oid);3995return0;3996}39973998static intpreimage_oid_in_gitlink_patch(struct patch *p,struct object_id *oid)3999{4000/*4001 * A usable gitlink patch has only one fragment (hunk) that looks like:4002 * @@ -1 +1 @@4003 * -Subproject commit <old sha1>4004 * +Subproject commit <new sha1>4005 * or4006 * @@ -1 +0,0 @@4007 * -Subproject commit <old sha1>4008 * for a removal patch.4009 */4010struct fragment *hunk = p->fragments;4011static const char heading[] ="-Subproject commit ";4012char*preimage;40134014if(/* does the patch have only one hunk? */4015 hunk && !hunk->next &&4016/* is its preimage one line? */4017 hunk->oldpos ==1&& hunk->oldlines ==1&&4018/* does preimage begin with the heading? */4019(preimage =memchr(hunk->patch,'\n', hunk->size)) != NULL &&4020starts_with(++preimage, heading) &&4021/* does it record full SHA-1? */4022!get_oid_hex(preimage +sizeof(heading) -1, oid) &&4023 preimage[sizeof(heading) + GIT_SHA1_HEXSZ -1] =='\n'&&4024/* does the abbreviated name on the index line agree with it? */4025starts_with(preimage +sizeof(heading) -1, p->old_sha1_prefix))4026return0;/* it all looks fine */40274028/* we may have full object name on the index line */4029returnget_oid_hex(p->old_sha1_prefix, oid);4030}40314032/* Build an index that contains the just the files needed for a 3way merge */4033static intbuild_fake_ancestor(struct apply_state *state,struct patch *list)4034{4035struct patch *patch;4036struct index_state result = { NULL };4037static struct lock_file lock;4038int res;40394040/* Once we start supporting the reverse patch, it may be4041 * worth showing the new sha1 prefix, but until then...4042 */4043for(patch = list; patch; patch = patch->next) {4044struct object_id oid;4045struct cache_entry *ce;4046const char*name;40474048 name = patch->old_name ? patch->old_name : patch->new_name;4049if(0< patch->is_new)4050continue;40514052if(S_ISGITLINK(patch->old_mode)) {4053if(!preimage_oid_in_gitlink_patch(patch, &oid))4054;/* ok, the textual part looks sane */4055else4056returnerror(_("sha1 information is lacking or "4057"useless for submodule%s"), name);4058}else if(!get_sha1_blob(patch->old_sha1_prefix, oid.hash)) {4059;/* ok */4060}else if(!patch->lines_added && !patch->lines_deleted) {4061/* mode-only change: update the current */4062if(get_current_oid(state, patch->old_name, &oid))4063returnerror(_("mode change for%s, which is not "4064"in current HEAD"), name);4065}else4066returnerror(_("sha1 information is lacking or useless "4067"(%s)."), name);40684069 ce =make_cache_entry(patch->old_mode, oid.hash, name,0,0);4070if(!ce)4071returnerror(_("make_cache_entry failed for path '%s'"),4072 name);4073if(add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD)) {4074free(ce);4075returnerror(_("could not add%sto temporary index"),4076 name);4077}4078}40794080hold_lock_file_for_update(&lock, state->fake_ancestor, LOCK_DIE_ON_ERROR);4081 res =write_locked_index(&result, &lock, COMMIT_LOCK);4082discard_index(&result);40834084if(res)4085returnerror(_("could not write temporary index to%s"),4086 state->fake_ancestor);40874088return0;4089}40904091static voidstat_patch_list(struct apply_state *state,struct patch *patch)4092{4093int files, adds, dels;40944095for(files = adds = dels =0; patch ; patch = patch->next) {4096 files++;4097 adds += patch->lines_added;4098 dels += patch->lines_deleted;4099show_stats(state, patch);4100}41014102print_stat_summary(stdout, files, adds, dels);4103}41044105static voidnumstat_patch_list(struct apply_state *state,4106struct patch *patch)4107{4108for( ; patch; patch = patch->next) {4109const char*name;4110 name = patch->new_name ? patch->new_name : patch->old_name;4111if(patch->is_binary)4112printf("-\t-\t");4113else4114printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);4115write_name_quoted(name, stdout, state->line_termination);4116}4117}41184119static voidshow_file_mode_name(const char*newdelete,unsigned int mode,const char*name)4120{4121if(mode)4122printf("%smode%06o%s\n", newdelete, mode, name);4123else4124printf("%s %s\n", newdelete, name);4125}41264127static voidshow_mode_change(struct patch *p,int show_name)4128{4129if(p->old_mode && p->new_mode && p->old_mode != p->new_mode) {4130if(show_name)4131printf(" mode change%06o =>%06o%s\n",4132 p->old_mode, p->new_mode, p->new_name);4133else4134printf(" mode change%06o =>%06o\n",4135 p->old_mode, p->new_mode);4136}4137}41384139static voidshow_rename_copy(struct patch *p)4140{4141const char*renamecopy = p->is_rename ?"rename":"copy";4142const char*old, *new;41434144/* Find common prefix */4145 old = p->old_name;4146new= p->new_name;4147while(1) {4148const char*slash_old, *slash_new;4149 slash_old =strchr(old,'/');4150 slash_new =strchr(new,'/');4151if(!slash_old ||4152!slash_new ||4153 slash_old - old != slash_new -new||4154memcmp(old,new, slash_new -new))4155break;4156 old = slash_old +1;4157new= slash_new +1;4158}4159/* p->old_name thru old is the common prefix, and old and new4160 * through the end of names are renames4161 */4162if(old != p->old_name)4163printf("%s%.*s{%s=>%s} (%d%%)\n", renamecopy,4164(int)(old - p->old_name), p->old_name,4165 old,new, p->score);4166else4167printf("%s %s=>%s(%d%%)\n", renamecopy,4168 p->old_name, p->new_name, p->score);4169show_mode_change(p,0);4170}41714172static voidsummary_patch_list(struct patch *patch)4173{4174struct patch *p;41754176for(p = patch; p; p = p->next) {4177if(p->is_new)4178show_file_mode_name("create", p->new_mode, p->new_name);4179else if(p->is_delete)4180show_file_mode_name("delete", p->old_mode, p->old_name);4181else{4182if(p->is_rename || p->is_copy)4183show_rename_copy(p);4184else{4185if(p->score) {4186printf(" rewrite%s(%d%%)\n",4187 p->new_name, p->score);4188show_mode_change(p,0);4189}4190else4191show_mode_change(p,1);4192}4193}4194}4195}41964197static voidpatch_stats(struct apply_state *state,struct patch *patch)4198{4199int lines = patch->lines_added + patch->lines_deleted;42004201if(lines > state->max_change)4202 state->max_change = lines;4203if(patch->old_name) {4204int len =quote_c_style(patch->old_name, NULL, NULL,0);4205if(!len)4206 len =strlen(patch->old_name);4207if(len > state->max_len)4208 state->max_len = len;4209}4210if(patch->new_name) {4211int len =quote_c_style(patch->new_name, NULL, NULL,0);4212if(!len)4213 len =strlen(patch->new_name);4214if(len > state->max_len)4215 state->max_len = len;4216}4217}42184219static intremove_file(struct apply_state *state,struct patch *patch,int rmdir_empty)4220{4221if(state->update_index) {4222if(remove_file_from_cache(patch->old_name) <0)4223returnerror(_("unable to remove%sfrom index"), patch->old_name);4224}4225if(!state->cached) {4226if(!remove_or_warn(patch->old_mode, patch->old_name) && rmdir_empty) {4227remove_path(patch->old_name);4228}4229}4230return0;4231}42324233static intadd_index_file(struct apply_state *state,4234const char*path,4235unsigned mode,4236void*buf,4237unsigned long size)4238{4239struct stat st;4240struct cache_entry *ce;4241int namelen =strlen(path);4242unsigned ce_size =cache_entry_size(namelen);42434244if(!state->update_index)4245return0;42464247 ce =xcalloc(1, ce_size);4248memcpy(ce->name, path, namelen);4249 ce->ce_mode =create_ce_mode(mode);4250 ce->ce_flags =create_ce_flags(0);4251 ce->ce_namelen = namelen;4252if(S_ISGITLINK(mode)) {4253const char*s;42544255if(!skip_prefix(buf,"Subproject commit ", &s) ||4256get_oid_hex(s, &ce->oid)) {4257free(ce);4258returnerror(_("corrupt patch for submodule%s"), path);4259}4260}else{4261if(!state->cached) {4262if(lstat(path, &st) <0) {4263free(ce);4264returnerror_errno(_("unable to stat newly "4265"created file '%s'"),4266 path);4267}4268fill_stat_cache_info(ce, &st);4269}4270if(write_sha1_file(buf, size, blob_type, ce->oid.hash) <0) {4271free(ce);4272returnerror(_("unable to create backing store "4273"for newly created file%s"), path);4274}4275}4276if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4277free(ce);4278returnerror(_("unable to add cache entry for%s"), path);4279}42804281return0;4282}42834284/*4285 * Returns:4286 * -1 if an unrecoverable error happened4287 * 0 if everything went well4288 * 1 if a recoverable error happened4289 */4290static inttry_create_file(const char*path,unsigned int mode,const char*buf,unsigned long size)4291{4292int fd, res;4293struct strbuf nbuf = STRBUF_INIT;42944295if(S_ISGITLINK(mode)) {4296struct stat st;4297if(!lstat(path, &st) &&S_ISDIR(st.st_mode))4298return0;4299return!!mkdir(path,0777);4300}43014302if(has_symlinks &&S_ISLNK(mode))4303/* Although buf:size is counted string, it also is NUL4304 * terminated.4305 */4306return!!symlink(buf, path);43074308 fd =open(path, O_CREAT | O_EXCL | O_WRONLY, (mode &0100) ?0777:0666);4309if(fd <0)4310return1;43114312if(convert_to_working_tree(path, buf, size, &nbuf)) {4313 size = nbuf.len;4314 buf = nbuf.buf;4315}43164317 res =write_in_full(fd, buf, size) <0;4318if(res)4319error_errno(_("failed to write to '%s'"), path);4320strbuf_release(&nbuf);43214322if(close(fd) <0&& !res)4323returnerror_errno(_("closing file '%s'"), path);43244325return res ? -1:0;4326}43274328/*4329 * We optimistically assume that the directories exist,4330 * which is true 99% of the time anyway. If they don't,4331 * we create them and try again.4332 *4333 * Returns:4334 * -1 on error4335 * 0 otherwise4336 */4337static intcreate_one_file(struct apply_state *state,4338char*path,4339unsigned mode,4340const char*buf,4341unsigned long size)4342{4343int res;43444345if(state->cached)4346return0;43474348 res =try_create_file(path, mode, buf, size);4349if(res <0)4350return-1;4351if(!res)4352return0;43534354if(errno == ENOENT) {4355if(safe_create_leading_directories(path))4356return0;4357 res =try_create_file(path, mode, buf, size);4358if(res <0)4359return-1;4360if(!res)4361return0;4362}43634364if(errno == EEXIST || errno == EACCES) {4365/* We may be trying to create a file where a directory4366 * used to be.4367 */4368struct stat st;4369if(!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))4370 errno = EEXIST;4371}43724373if(errno == EEXIST) {4374unsigned int nr =getpid();43754376for(;;) {4377char newpath[PATH_MAX];4378mksnpath(newpath,sizeof(newpath),"%s~%u", path, nr);4379 res =try_create_file(newpath, mode, buf, size);4380if(res <0)4381return-1;4382if(!res) {4383if(!rename(newpath, path))4384return0;4385unlink_or_warn(newpath);4386break;4387}4388if(errno != EEXIST)4389break;4390++nr;4391}4392}4393returnerror_errno(_("unable to write file '%s' mode%o"),4394 path, mode);4395}43964397static intadd_conflicted_stages_file(struct apply_state *state,4398struct patch *patch)4399{4400int stage, namelen;4401unsigned ce_size, mode;4402struct cache_entry *ce;44034404if(!state->update_index)4405return0;4406 namelen =strlen(patch->new_name);4407 ce_size =cache_entry_size(namelen);4408 mode = patch->new_mode ? patch->new_mode : (S_IFREG |0644);44094410remove_file_from_cache(patch->new_name);4411for(stage =1; stage <4; stage++) {4412if(is_null_oid(&patch->threeway_stage[stage -1]))4413continue;4414 ce =xcalloc(1, ce_size);4415memcpy(ce->name, patch->new_name, namelen);4416 ce->ce_mode =create_ce_mode(mode);4417 ce->ce_flags =create_ce_flags(stage);4418 ce->ce_namelen = namelen;4419oidcpy(&ce->oid, &patch->threeway_stage[stage -1]);4420if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4421free(ce);4422returnerror(_("unable to add cache entry for%s"),4423 patch->new_name);4424}4425}44264427return0;4428}44294430static intcreate_file(struct apply_state *state,struct patch *patch)4431{4432char*path = patch->new_name;4433unsigned mode = patch->new_mode;4434unsigned long size = patch->resultsize;4435char*buf = patch->result;44364437if(!mode)4438 mode = S_IFREG |0644;4439if(create_one_file(state, path, mode, buf, size))4440return-1;44414442if(patch->conflicted_threeway)4443returnadd_conflicted_stages_file(state, patch);4444else4445returnadd_index_file(state, path, mode, buf, size);4446}44474448/* phase zero is to remove, phase one is to create */4449static intwrite_out_one_result(struct apply_state *state,4450struct patch *patch,4451int phase)4452{4453if(patch->is_delete >0) {4454if(phase ==0)4455returnremove_file(state, patch,1);4456return0;4457}4458if(patch->is_new >0|| patch->is_copy) {4459if(phase ==1)4460returncreate_file(state, patch);4461return0;4462}4463/*4464 * Rename or modification boils down to the same4465 * thing: remove the old, write the new4466 */4467if(phase ==0)4468returnremove_file(state, patch, patch->is_rename);4469if(phase ==1)4470returncreate_file(state, patch);4471return0;4472}44734474static intwrite_out_one_reject(struct apply_state *state,struct patch *patch)4475{4476FILE*rej;4477char namebuf[PATH_MAX];4478struct fragment *frag;4479int cnt =0;4480struct strbuf sb = STRBUF_INIT;44814482for(cnt =0, frag = patch->fragments; frag; frag = frag->next) {4483if(!frag->rejected)4484continue;4485 cnt++;4486}44874488if(!cnt) {4489if(state->apply_verbosity > verbosity_normal)4490say_patch_name(stderr,4491_("Applied patch%scleanly."), patch);4492return0;4493}44944495/* This should not happen, because a removal patch that leaves4496 * contents are marked "rejected" at the patch level.4497 */4498if(!patch->new_name)4499die(_("internal error"));45004501/* Say this even without --verbose */4502strbuf_addf(&sb,Q_("Applying patch %%swith%dreject...",4503"Applying patch %%swith%drejects...",4504 cnt),4505 cnt);4506if(state->apply_verbosity > verbosity_silent)4507say_patch_name(stderr, sb.buf, patch);4508strbuf_release(&sb);45094510 cnt =strlen(patch->new_name);4511if(ARRAY_SIZE(namebuf) <= cnt +5) {4512 cnt =ARRAY_SIZE(namebuf) -5;4513warning(_("truncating .rej filename to %.*s.rej"),4514 cnt -1, patch->new_name);4515}4516memcpy(namebuf, patch->new_name, cnt);4517memcpy(namebuf + cnt,".rej",5);45184519 rej =fopen(namebuf,"w");4520if(!rej)4521returnerror_errno(_("cannot open%s"), namebuf);45224523/* Normal git tools never deal with .rej, so do not pretend4524 * this is a git patch by saying --git or giving extended4525 * headers. While at it, maybe please "kompare" that wants4526 * the trailing TAB and some garbage at the end of line ;-).4527 */4528fprintf(rej,"diff a/%sb/%s\t(rejected hunks)\n",4529 patch->new_name, patch->new_name);4530for(cnt =1, frag = patch->fragments;4531 frag;4532 cnt++, frag = frag->next) {4533if(!frag->rejected) {4534if(state->apply_verbosity > verbosity_silent)4535fprintf_ln(stderr,_("Hunk #%dapplied cleanly."), cnt);4536continue;4537}4538if(state->apply_verbosity > verbosity_silent)4539fprintf_ln(stderr,_("Rejected hunk #%d."), cnt);4540fprintf(rej,"%.*s", frag->size, frag->patch);4541if(frag->patch[frag->size-1] !='\n')4542fputc('\n', rej);4543}4544fclose(rej);4545return-1;4546}45474548/*4549 * Returns:4550 * -1 if an error happened4551 * 0 if the patch applied cleanly4552 * 1 if the patch did not apply cleanly4553 */4554static intwrite_out_results(struct apply_state *state,struct patch *list)4555{4556int phase;4557int errs =0;4558struct patch *l;4559struct string_list cpath = STRING_LIST_INIT_DUP;45604561for(phase =0; phase <2; phase++) {4562 l = list;4563while(l) {4564if(l->rejected)4565 errs =1;4566else{4567if(write_out_one_result(state, l, phase)) {4568string_list_clear(&cpath,0);4569return-1;4570}4571if(phase ==1) {4572if(write_out_one_reject(state, l))4573 errs =1;4574if(l->conflicted_threeway) {4575string_list_append(&cpath, l->new_name);4576 errs =1;4577}4578}4579}4580 l = l->next;4581}4582}45834584if(cpath.nr) {4585struct string_list_item *item;45864587string_list_sort(&cpath);4588if(state->apply_verbosity > verbosity_silent) {4589for_each_string_list_item(item, &cpath)4590fprintf(stderr,"U%s\n", item->string);4591}4592string_list_clear(&cpath,0);45934594rerere(0);4595}45964597return errs;4598}45994600/*4601 * Try to apply a patch.4602 *4603 * Returns:4604 * -128 if a bad error happened (like patch unreadable)4605 * -1 if patch did not apply and user cannot deal with it4606 * 0 if the patch applied4607 * 1 if the patch did not apply but user might fix it4608 */4609static intapply_patch(struct apply_state *state,4610int fd,4611const char*filename,4612int options)4613{4614size_t offset;4615struct strbuf buf = STRBUF_INIT;/* owns the patch text */4616struct patch *list = NULL, **listp = &list;4617int skipped_patch =0;4618int res =0;46194620 state->patch_input_file = filename;4621if(read_patch_file(&buf, fd) <0)4622return-128;4623 offset =0;4624while(offset < buf.len) {4625struct patch *patch;4626int nr;46274628 patch =xcalloc(1,sizeof(*patch));4629 patch->inaccurate_eof = !!(options & APPLY_OPT_INACCURATE_EOF);4630 patch->recount = !!(options & APPLY_OPT_RECOUNT);4631 nr =parse_chunk(state, buf.buf + offset, buf.len - offset, patch);4632if(nr <0) {4633free_patch(patch);4634if(nr == -128) {4635 res = -128;4636goto end;4637}4638break;4639}4640if(state->apply_in_reverse)4641reverse_patches(patch);4642if(use_patch(state, patch)) {4643patch_stats(state, patch);4644*listp = patch;4645 listp = &patch->next;4646}4647else{4648if(state->apply_verbosity > verbosity_normal)4649say_patch_name(stderr,_("Skipped patch '%s'."), patch);4650free_patch(patch);4651 skipped_patch++;4652}4653 offset += nr;4654}46554656if(!list && !skipped_patch) {4657error(_("unrecognized input"));4658 res = -128;4659goto end;4660}46614662if(state->whitespace_error && (state->ws_error_action == die_on_ws_error))4663 state->apply =0;46644665 state->update_index = state->check_index && state->apply;4666if(state->update_index && state->newfd <0) {4667if(state->index_file)4668 state->newfd =hold_lock_file_for_update(state->lock_file,4669 state->index_file,4670 LOCK_DIE_ON_ERROR);4671else4672 state->newfd =hold_locked_index(state->lock_file,1);4673}46744675if(state->check_index &&read_apply_cache(state) <0) {4676error(_("unable to read index file"));4677 res = -128;4678goto end;4679}46804681if(state->check || state->apply) {4682int r =check_patch_list(state, list);4683if(r == -128) {4684 res = -128;4685goto end;4686}4687if(r <0&& !state->apply_with_reject) {4688 res = -1;4689goto end;4690}4691}46924693if(state->apply) {4694int write_res =write_out_results(state, list);4695if(write_res <0) {4696 res = -128;4697goto end;4698}4699if(write_res >0) {4700/* with --3way, we still need to write the index out */4701 res = state->apply_with_reject ? -1:1;4702goto end;4703}4704}47054706if(state->fake_ancestor &&4707build_fake_ancestor(state, list)) {4708 res = -128;4709goto end;4710}47114712if(state->diffstat && state->apply_verbosity > verbosity_silent)4713stat_patch_list(state, list);47144715if(state->numstat && state->apply_verbosity > verbosity_silent)4716numstat_patch_list(state, list);47174718if(state->summary && state->apply_verbosity > verbosity_silent)4719summary_patch_list(list);47204721end:4722free_patch_list(list);4723strbuf_release(&buf);4724string_list_clear(&state->fn_table,0);4725return res;4726}47274728static intapply_option_parse_exclude(const struct option *opt,4729const char*arg,int unset)4730{4731struct apply_state *state = opt->value;4732add_name_limit(state, arg,1);4733return0;4734}47354736static intapply_option_parse_include(const struct option *opt,4737const char*arg,int unset)4738{4739struct apply_state *state = opt->value;4740add_name_limit(state, arg,0);4741 state->has_include =1;4742return0;4743}47444745static intapply_option_parse_p(const struct option *opt,4746const char*arg,4747int unset)4748{4749struct apply_state *state = opt->value;4750 state->p_value =atoi(arg);4751 state->p_value_known =1;4752return0;4753}47544755static intapply_option_parse_space_change(const struct option *opt,4756const char*arg,int unset)4757{4758struct apply_state *state = opt->value;4759if(unset)4760 state->ws_ignore_action = ignore_ws_none;4761else4762 state->ws_ignore_action = ignore_ws_change;4763return0;4764}47654766static intapply_option_parse_whitespace(const struct option *opt,4767const char*arg,int unset)4768{4769struct apply_state *state = opt->value;4770 state->whitespace_option = arg;4771if(parse_whitespace_option(state, arg))4772exit(1);4773return0;4774}47754776static intapply_option_parse_directory(const struct option *opt,4777const char*arg,int unset)4778{4779struct apply_state *state = opt->value;4780strbuf_reset(&state->root);4781strbuf_addstr(&state->root, arg);4782strbuf_complete(&state->root,'/');4783return0;4784}47854786intapply_all_patches(struct apply_state *state,4787int argc,4788const char**argv,4789int options)4790{4791int i;4792int res;4793int errs =0;4794int read_stdin =1;47954796for(i =0; i < argc; i++) {4797const char*arg = argv[i];4798int fd;47994800if(!strcmp(arg,"-")) {4801 res =apply_patch(state,0,"<stdin>", options);4802if(res <0)4803goto end;4804 errs |= res;4805 read_stdin =0;4806continue;4807}else if(0< state->prefix_length)4808 arg =prefix_filename(state->prefix,4809 state->prefix_length,4810 arg);48114812 fd =open(arg, O_RDONLY);4813if(fd <0) {4814error(_("can't open patch '%s':%s"), arg,strerror(errno));4815 res = -128;4816goto end;4817}4818 read_stdin =0;4819set_default_whitespace_mode(state);4820 res =apply_patch(state, fd, arg, options);4821close(fd);4822if(res <0)4823goto end;4824 errs |= res;4825}4826set_default_whitespace_mode(state);4827if(read_stdin) {4828 res =apply_patch(state,0,"<stdin>", options);4829if(res <0)4830goto end;4831 errs |= res;4832}48334834if(state->whitespace_error) {4835if(state->squelch_whitespace_errors &&4836 state->squelch_whitespace_errors < state->whitespace_error) {4837int squelched =4838 state->whitespace_error - state->squelch_whitespace_errors;4839warning(Q_("squelched%dwhitespace error",4840"squelched%dwhitespace errors",4841 squelched),4842 squelched);4843}4844if(state->ws_error_action == die_on_ws_error) {4845error(Q_("%dline adds whitespace errors.",4846"%dlines add whitespace errors.",4847 state->whitespace_error),4848 state->whitespace_error);4849 res = -128;4850goto end;4851}4852if(state->applied_after_fixing_ws && state->apply)4853warning(Q_("%dline applied after"4854" fixing whitespace errors.",4855"%dlines applied after"4856" fixing whitespace errors.",4857 state->applied_after_fixing_ws),4858 state->applied_after_fixing_ws);4859else if(state->whitespace_error)4860warning(Q_("%dline adds whitespace errors.",4861"%dlines add whitespace errors.",4862 state->whitespace_error),4863 state->whitespace_error);4864}48654866if(state->update_index) {4867 res =write_locked_index(&the_index, state->lock_file, COMMIT_LOCK);4868if(res) {4869error(_("Unable to write new index file"));4870 res = -128;4871goto end;4872}4873 state->newfd = -1;4874}48754876 res = !!errs;48774878end:4879if(state->newfd >=0) {4880rollback_lock_file(state->lock_file);4881 state->newfd = -1;4882}48834884if(state->apply_verbosity <= verbosity_silent) {4885set_error_routine(state->saved_error_routine);4886set_warn_routine(state->saved_warn_routine);4887}48884889if(res > -1)4890return res;4891return(res == -1?1:128);4892}48934894intapply_parse_options(int argc,const char**argv,4895struct apply_state *state,4896int*force_apply,int*options,4897const char*const*apply_usage)4898{4899struct option builtin_apply_options[] = {4900{ OPTION_CALLBACK,0,"exclude", state,N_("path"),4901N_("don't apply changes matching the given path"),49020, apply_option_parse_exclude },4903{ OPTION_CALLBACK,0,"include", state,N_("path"),4904N_("apply changes matching the given path"),49050, apply_option_parse_include },4906{ OPTION_CALLBACK,'p', NULL, state,N_("num"),4907N_("remove <num> leading slashes from traditional diff paths"),49080, apply_option_parse_p },4909OPT_BOOL(0,"no-add", &state->no_add,4910N_("ignore additions made by the patch")),4911OPT_BOOL(0,"stat", &state->diffstat,4912N_("instead of applying the patch, output diffstat for the input")),4913OPT_NOOP_NOARG(0,"allow-binary-replacement"),4914OPT_NOOP_NOARG(0,"binary"),4915OPT_BOOL(0,"numstat", &state->numstat,4916N_("show number of added and deleted lines in decimal notation")),4917OPT_BOOL(0,"summary", &state->summary,4918N_("instead of applying the patch, output a summary for the input")),4919OPT_BOOL(0,"check", &state->check,4920N_("instead of applying the patch, see if the patch is applicable")),4921OPT_BOOL(0,"index", &state->check_index,4922N_("make sure the patch is applicable to the current index")),4923OPT_BOOL(0,"cached", &state->cached,4924N_("apply a patch without touching the working tree")),4925OPT_BOOL(0,"unsafe-paths", &state->unsafe_paths,4926N_("accept a patch that touches outside the working area")),4927OPT_BOOL(0,"apply", force_apply,4928N_("also apply the patch (use with --stat/--summary/--check)")),4929OPT_BOOL('3',"3way", &state->threeway,4930N_("attempt three-way merge if a patch does not apply")),4931OPT_FILENAME(0,"build-fake-ancestor", &state->fake_ancestor,4932N_("build a temporary index based on embedded index information")),4933/* Think twice before adding "--nul" synonym to this */4934OPT_SET_INT('z', NULL, &state->line_termination,4935N_("paths are separated with NUL character"),'\0'),4936OPT_INTEGER('C', NULL, &state->p_context,4937N_("ensure at least <n> lines of context match")),4938{ OPTION_CALLBACK,0,"whitespace", state,N_("action"),4939N_("detect new or modified lines that have whitespace errors"),49400, apply_option_parse_whitespace },4941{ OPTION_CALLBACK,0,"ignore-space-change", state, NULL,4942N_("ignore changes in whitespace when finding context"),4943 PARSE_OPT_NOARG, apply_option_parse_space_change },4944{ OPTION_CALLBACK,0,"ignore-whitespace", state, NULL,4945N_("ignore changes in whitespace when finding context"),4946 PARSE_OPT_NOARG, apply_option_parse_space_change },4947OPT_BOOL('R',"reverse", &state->apply_in_reverse,4948N_("apply the patch in reverse")),4949OPT_BOOL(0,"unidiff-zero", &state->unidiff_zero,4950N_("don't expect at least one line of context")),4951OPT_BOOL(0,"reject", &state->apply_with_reject,4952N_("leave the rejected hunks in corresponding *.rej files")),4953OPT_BOOL(0,"allow-overlap", &state->allow_overlap,4954N_("allow overlapping hunks")),4955OPT__VERBOSE(&state->apply_verbosity,N_("be verbose")),4956OPT_BIT(0,"inaccurate-eof", options,4957N_("tolerate incorrectly detected missing new-line at the end of file"),4958 APPLY_OPT_INACCURATE_EOF),4959OPT_BIT(0,"recount", options,4960N_("do not trust the line counts in the hunk headers"),4961 APPLY_OPT_RECOUNT),4962{ OPTION_CALLBACK,0,"directory", state,N_("root"),4963N_("prepend <root> to all filenames"),49640, apply_option_parse_directory },4965OPT_END()4966};49674968returnparse_options(argc, argv, state->prefix, builtin_apply_options, apply_usage,0);4969}