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