1/* 2 * apply.c 3 * 4 * Copyright (C) Linus Torvalds, 2005 5 * 6 * This applies patches on top of some (arbitrary) version of the SCM. 7 * 8 */ 9 10#include"cache.h" 11#include"config.h" 12#include"blob.h" 13#include"delta.h" 14#include"diff.h" 15#include"dir.h" 16#include"xdiff-interface.h" 17#include"ll-merge.h" 18#include"lockfile.h" 19#include"parse-options.h" 20#include"quote.h" 21#include"rerere.h" 22#include"apply.h" 23 24static voidgit_apply_config(void) 25{ 26git_config_get_string_const("apply.whitespace", &apply_default_whitespace); 27git_config_get_string_const("apply.ignorewhitespace", &apply_default_ignorewhitespace); 28git_config(git_default_config, NULL); 29} 30 31static intparse_whitespace_option(struct apply_state *state,const char*option) 32{ 33if(!option) { 34 state->ws_error_action = warn_on_ws_error; 35return0; 36} 37if(!strcmp(option,"warn")) { 38 state->ws_error_action = warn_on_ws_error; 39return0; 40} 41if(!strcmp(option,"nowarn")) { 42 state->ws_error_action = nowarn_ws_error; 43return0; 44} 45if(!strcmp(option,"error")) { 46 state->ws_error_action = die_on_ws_error; 47return0; 48} 49if(!strcmp(option,"error-all")) { 50 state->ws_error_action = die_on_ws_error; 51 state->squelch_whitespace_errors =0; 52return0; 53} 54if(!strcmp(option,"strip") || !strcmp(option,"fix")) { 55 state->ws_error_action = correct_ws_error; 56return0; 57} 58returnerror(_("unrecognized whitespace option '%s'"), option); 59} 60 61static intparse_ignorewhitespace_option(struct apply_state *state, 62const char*option) 63{ 64if(!option || !strcmp(option,"no") || 65!strcmp(option,"false") || !strcmp(option,"never") || 66!strcmp(option,"none")) { 67 state->ws_ignore_action = ignore_ws_none; 68return0; 69} 70if(!strcmp(option,"change")) { 71 state->ws_ignore_action = ignore_ws_change; 72return0; 73} 74returnerror(_("unrecognized whitespace ignore option '%s'"), option); 75} 76 77intinit_apply_state(struct apply_state *state, 78const char*prefix, 79struct lock_file *lock_file) 80{ 81memset(state,0,sizeof(*state)); 82 state->prefix = prefix; 83 state->lock_file = lock_file; 84 state->newfd = -1; 85 state->apply =1; 86 state->line_termination ='\n'; 87 state->p_value =1; 88 state->p_context = UINT_MAX; 89 state->squelch_whitespace_errors =5; 90 state->ws_error_action = warn_on_ws_error; 91 state->ws_ignore_action = ignore_ws_none; 92 state->linenr =1; 93string_list_init(&state->fn_table,0); 94string_list_init(&state->limit_by_name,0); 95string_list_init(&state->symlink_changes,0); 96strbuf_init(&state->root,0); 97 98git_apply_config(); 99if(apply_default_whitespace &&parse_whitespace_option(state, apply_default_whitespace)) 100return-1; 101if(apply_default_ignorewhitespace &&parse_ignorewhitespace_option(state, apply_default_ignorewhitespace)) 102return-1; 103return0; 104} 105 106voidclear_apply_state(struct apply_state *state) 107{ 108string_list_clear(&state->limit_by_name,0); 109string_list_clear(&state->symlink_changes,0); 110strbuf_release(&state->root); 111 112/* &state->fn_table is cleared at the end of apply_patch() */ 113} 114 115static voidmute_routine(const char*msg,va_list params) 116{ 117/* do nothing */ 118} 119 120intcheck_apply_state(struct apply_state *state,int force_apply) 121{ 122int is_not_gitdir = !startup_info->have_repository; 123 124if(state->apply_with_reject && state->threeway) 125returnerror(_("--reject and --3way cannot be used together.")); 126if(state->cached && state->threeway) 127returnerror(_("--cached and --3way cannot be used together.")); 128if(state->threeway) { 129if(is_not_gitdir) 130returnerror(_("--3way outside a repository")); 131 state->check_index =1; 132} 133if(state->apply_with_reject) { 134 state->apply =1; 135if(state->apply_verbosity == verbosity_normal) 136 state->apply_verbosity = verbosity_verbose; 137} 138if(!force_apply && (state->diffstat || state->numstat || state->summary || state->check || state->fake_ancestor)) 139 state->apply =0; 140if(state->check_index && is_not_gitdir) 141returnerror(_("--index outside a repository")); 142if(state->cached) { 143if(is_not_gitdir) 144returnerror(_("--cached outside a repository")); 145 state->check_index =1; 146} 147if(state->check_index) 148 state->unsafe_paths =0; 149if(!state->lock_file) 150returnerror("BUG: state->lock_file should not be NULL"); 151 152if(state->apply_verbosity <= verbosity_silent) { 153 state->saved_error_routine =get_error_routine(); 154 state->saved_warn_routine =get_warn_routine(); 155set_error_routine(mute_routine); 156set_warn_routine(mute_routine); 157} 158 159return0; 160} 161 162static voidset_default_whitespace_mode(struct apply_state *state) 163{ 164if(!state->whitespace_option && !apply_default_whitespace) 165 state->ws_error_action = (state->apply ? warn_on_ws_error : nowarn_ws_error); 166} 167 168/* 169 * This represents one "hunk" from a patch, starting with 170 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The 171 * patch text is pointed at by patch, and its byte length 172 * is stored in size. leading and trailing are the number 173 * of context lines. 174 */ 175struct fragment { 176unsigned long leading, trailing; 177unsigned long oldpos, oldlines; 178unsigned long newpos, newlines; 179/* 180 * 'patch' is usually borrowed from buf in apply_patch(), 181 * but some codepaths store an allocated buffer. 182 */ 183const char*patch; 184unsigned free_patch:1, 185 rejected:1; 186int size; 187int linenr; 188struct fragment *next; 189}; 190 191/* 192 * When dealing with a binary patch, we reuse "leading" field 193 * to store the type of the binary hunk, either deflated "delta" 194 * or deflated "literal". 195 */ 196#define binary_patch_method leading 197#define BINARY_DELTA_DEFLATED 1 198#define BINARY_LITERAL_DEFLATED 2 199 200/* 201 * This represents a "patch" to a file, both metainfo changes 202 * such as creation/deletion, filemode and content changes represented 203 * as a series of fragments. 204 */ 205struct patch { 206char*new_name, *old_name, *def_name; 207unsigned int old_mode, new_mode; 208int is_new, is_delete;/* -1 = unknown, 0 = false, 1 = true */ 209int rejected; 210unsigned ws_rule; 211int lines_added, lines_deleted; 212int score; 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_sha1_prefix[41]; 227char new_sha1_prefix[41]; 228struct patch *next; 229 230/* three-way fallback result */ 231struct object_id threeway_stage[3]; 232}; 233 234static voidfree_fragment_list(struct fragment *list) 235{ 236while(list) { 237struct fragment *next = list->next; 238if(list->free_patch) 239free((char*)list->patch); 240free(list); 241 list = next; 242} 243} 244 245static voidfree_patch(struct patch *patch) 246{ 247free_fragment_list(patch->fragments); 248free(patch->def_name); 249free(patch->old_name); 250free(patch->new_name); 251free(patch->result); 252free(patch); 253} 254 255static voidfree_patch_list(struct patch *list) 256{ 257while(list) { 258struct patch *next = list->next; 259free_patch(list); 260 list = next; 261} 262} 263 264/* 265 * A line in a file, len-bytes long (includes the terminating LF, 266 * except for an incomplete line at the end if the file ends with 267 * one), and its contents hashes to 'hash'. 268 */ 269struct line { 270size_t len; 271unsigned hash :24; 272unsigned flag :8; 273#define LINE_COMMON 1 274#define LINE_PATCHED 2 275}; 276 277/* 278 * This represents a "file", which is an array of "lines". 279 */ 280struct image { 281char*buf; 282size_t len; 283size_t nr; 284size_t alloc; 285struct line *line_allocated; 286struct line *line; 287}; 288 289static uint32_thash_line(const char*cp,size_t len) 290{ 291size_t i; 292uint32_t h; 293for(i =0, h =0; i < len; i++) { 294if(!isspace(cp[i])) { 295 h = h *3+ (cp[i] &0xff); 296} 297} 298return h; 299} 300 301/* 302 * Compare lines s1 of length n1 and s2 of length n2, ignoring 303 * whitespace difference. Returns 1 if they match, 0 otherwise 304 */ 305static intfuzzy_matchlines(const char*s1,size_t n1, 306const char*s2,size_t n2) 307{ 308const char*last1 = s1 + n1 -1; 309const char*last2 = s2 + n2 -1; 310int result =0; 311 312/* ignore line endings */ 313while((*last1 =='\r') || (*last1 =='\n')) 314 last1--; 315while((*last2 =='\r') || (*last2 =='\n')) 316 last2--; 317 318/* skip leading whitespaces, if both begin with whitespace */ 319if(s1 <= last1 && s2 <= last2 &&isspace(*s1) &&isspace(*s2)) { 320while(isspace(*s1) && (s1 <= last1)) 321 s1++; 322while(isspace(*s2) && (s2 <= last2)) 323 s2++; 324} 325/* early return if both lines are empty */ 326if((s1 > last1) && (s2 > last2)) 327return1; 328while(!result) { 329 result = *s1++ - *s2++; 330/* 331 * Skip whitespace inside. We check for whitespace on 332 * both buffers because we don't want "a b" to match 333 * "ab" 334 */ 335if(isspace(*s1) &&isspace(*s2)) { 336while(isspace(*s1) && s1 <= last1) 337 s1++; 338while(isspace(*s2) && s2 <= last2) 339 s2++; 340} 341/* 342 * If we reached the end on one side only, 343 * lines don't match 344 */ 345if( 346((s2 > last2) && (s1 <= last1)) || 347((s1 > last1) && (s2 <= last2))) 348return0; 349if((s1 > last1) && (s2 > last2)) 350break; 351} 352 353return!result; 354} 355 356static voidadd_line_info(struct image *img,const char*bol,size_t len,unsigned flag) 357{ 358ALLOC_GROW(img->line_allocated, img->nr +1, img->alloc); 359 img->line_allocated[img->nr].len = len; 360 img->line_allocated[img->nr].hash =hash_line(bol, len); 361 img->line_allocated[img->nr].flag = flag; 362 img->nr++; 363} 364 365/* 366 * "buf" has the file contents to be patched (read from various sources). 367 * attach it to "image" and add line-based index to it. 368 * "image" now owns the "buf". 369 */ 370static voidprepare_image(struct image *image,char*buf,size_t len, 371int prepare_linetable) 372{ 373const char*cp, *ep; 374 375memset(image,0,sizeof(*image)); 376 image->buf = buf; 377 image->len = len; 378 379if(!prepare_linetable) 380return; 381 382 ep = image->buf + image->len; 383 cp = image->buf; 384while(cp < ep) { 385const char*next; 386for(next = cp; next < ep && *next !='\n'; next++) 387; 388if(next < ep) 389 next++; 390add_line_info(image, cp, next - cp,0); 391 cp = next; 392} 393 image->line = image->line_allocated; 394} 395 396static voidclear_image(struct image *image) 397{ 398free(image->buf); 399free(image->line_allocated); 400memset(image,0,sizeof(*image)); 401} 402 403/* fmt must contain _one_ %s and no other substitution */ 404static voidsay_patch_name(FILE*output,const char*fmt,struct patch *patch) 405{ 406struct strbuf sb = STRBUF_INIT; 407 408if(patch->old_name && patch->new_name && 409strcmp(patch->old_name, patch->new_name)) { 410quote_c_style(patch->old_name, &sb, NULL,0); 411strbuf_addstr(&sb," => "); 412quote_c_style(patch->new_name, &sb, NULL,0); 413}else{ 414const char*n = patch->new_name; 415if(!n) 416 n = patch->old_name; 417quote_c_style(n, &sb, NULL,0); 418} 419fprintf(output, fmt, sb.buf); 420fputc('\n', output); 421strbuf_release(&sb); 422} 423 424#define SLOP (16) 425 426static intread_patch_file(struct strbuf *sb,int fd) 427{ 428if(strbuf_read(sb, fd,0) <0) 429returnerror_errno("git apply: failed to read"); 430 431/* 432 * Make sure that we have some slop in the buffer 433 * so that we can do speculative "memcmp" etc, and 434 * see to it that it is NUL-filled. 435 */ 436strbuf_grow(sb, SLOP); 437memset(sb->buf + sb->len,0, SLOP); 438return0; 439} 440 441static unsigned longlinelen(const char*buffer,unsigned long size) 442{ 443unsigned long len =0; 444while(size--) { 445 len++; 446if(*buffer++ =='\n') 447break; 448} 449return len; 450} 451 452static intis_dev_null(const char*str) 453{ 454returnskip_prefix(str,"/dev/null", &str) &&isspace(*str); 455} 456 457#define TERM_SPACE 1 458#define TERM_TAB 2 459 460static intname_terminate(int c,int terminate) 461{ 462if(c ==' '&& !(terminate & TERM_SPACE)) 463return0; 464if(c =='\t'&& !(terminate & TERM_TAB)) 465return0; 466 467return1; 468} 469 470/* remove double slashes to make --index work with such filenames */ 471static char*squash_slash(char*name) 472{ 473int i =0, j =0; 474 475if(!name) 476return NULL; 477 478while(name[i]) { 479if((name[j++] = name[i++]) =='/') 480while(name[i] =='/') 481 i++; 482} 483 name[j] ='\0'; 484return name; 485} 486 487static char*find_name_gnu(struct apply_state *state, 488const char*line, 489const char*def, 490int p_value) 491{ 492struct strbuf name = STRBUF_INIT; 493char*cp; 494 495/* 496 * Proposed "new-style" GNU patch/diff format; see 497 * http://marc.info/?l=git&m=112927316408690&w=2 498 */ 499if(unquote_c_style(&name, line, NULL)) { 500strbuf_release(&name); 501return NULL; 502} 503 504for(cp = name.buf; p_value; p_value--) { 505 cp =strchr(cp,'/'); 506if(!cp) { 507strbuf_release(&name); 508return NULL; 509} 510 cp++; 511} 512 513strbuf_remove(&name,0, cp - name.buf); 514if(state->root.len) 515strbuf_insert(&name,0, state->root.buf, state->root.len); 516returnsquash_slash(strbuf_detach(&name, NULL)); 517} 518 519static size_tsane_tz_len(const char*line,size_t len) 520{ 521const char*tz, *p; 522 523if(len <strlen(" +0500") || line[len-strlen(" +0500")] !=' ') 524return0; 525 tz = line + len -strlen(" +0500"); 526 527if(tz[1] !='+'&& tz[1] !='-') 528return0; 529 530for(p = tz +2; p != line + len; p++) 531if(!isdigit(*p)) 532return0; 533 534return line + len - tz; 535} 536 537static size_ttz_with_colon_len(const char*line,size_t len) 538{ 539const char*tz, *p; 540 541if(len <strlen(" +08:00") || line[len -strlen(":00")] !=':') 542return0; 543 tz = line + len -strlen(" +08:00"); 544 545if(tz[0] !=' '|| (tz[1] !='+'&& tz[1] !='-')) 546return0; 547 p = tz +2; 548if(!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 549!isdigit(*p++) || !isdigit(*p++)) 550return0; 551 552return line + len - tz; 553} 554 555static size_tdate_len(const char*line,size_t len) 556{ 557const char*date, *p; 558 559if(len <strlen("72-02-05") || line[len-strlen("-05")] !='-') 560return0; 561 p = date = line + len -strlen("72-02-05"); 562 563if(!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 564!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 565!isdigit(*p++) || !isdigit(*p++))/* Not a date. */ 566return0; 567 568if(date - line >=strlen("19") && 569isdigit(date[-1]) &&isdigit(date[-2]))/* 4-digit year */ 570 date -=strlen("19"); 571 572return line + len - date; 573} 574 575static size_tshort_time_len(const char*line,size_t len) 576{ 577const char*time, *p; 578 579if(len <strlen(" 07:01:32") || line[len-strlen(":32")] !=':') 580return0; 581 p = time = line + len -strlen(" 07:01:32"); 582 583/* Permit 1-digit hours? */ 584if(*p++ !=' '|| 585!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 586!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 587!isdigit(*p++) || !isdigit(*p++))/* Not a time. */ 588return0; 589 590return line + len - time; 591} 592 593static size_tfractional_time_len(const char*line,size_t len) 594{ 595const char*p; 596size_t n; 597 598/* Expected format: 19:41:17.620000023 */ 599if(!len || !isdigit(line[len -1])) 600return0; 601 p = line + len -1; 602 603/* Fractional seconds. */ 604while(p > line &&isdigit(*p)) 605 p--; 606if(*p !='.') 607return0; 608 609/* Hours, minutes, and whole seconds. */ 610 n =short_time_len(line, p - line); 611if(!n) 612return0; 613 614return line + len - p + n; 615} 616 617static size_ttrailing_spaces_len(const char*line,size_t len) 618{ 619const char*p; 620 621/* Expected format: ' ' x (1 or more) */ 622if(!len || line[len -1] !=' ') 623return0; 624 625 p = line + len; 626while(p != line) { 627 p--; 628if(*p !=' ') 629return line + len - (p +1); 630} 631 632/* All spaces! */ 633return len; 634} 635 636static size_tdiff_timestamp_len(const char*line,size_t len) 637{ 638const char*end = line + len; 639size_t n; 640 641/* 642 * Posix: 2010-07-05 19:41:17 643 * GNU: 2010-07-05 19:41:17.620000023 -0500 644 */ 645 646if(!isdigit(end[-1])) 647return0; 648 649 n =sane_tz_len(line, end - line); 650if(!n) 651 n =tz_with_colon_len(line, end - line); 652 end -= n; 653 654 n =short_time_len(line, end - line); 655if(!n) 656 n =fractional_time_len(line, end - line); 657 end -= n; 658 659 n =date_len(line, end - line); 660if(!n)/* No date. Too bad. */ 661return0; 662 end -= n; 663 664if(end == line)/* No space before date. */ 665return0; 666if(end[-1] =='\t') {/* Success! */ 667 end--; 668return line + len - end; 669} 670if(end[-1] !=' ')/* No space before date. */ 671return0; 672 673/* Whitespace damage. */ 674 end -=trailing_spaces_len(line, end - line); 675return line + len - end; 676} 677 678static char*find_name_common(struct apply_state *state, 679const char*line, 680const char*def, 681int p_value, 682const char*end, 683int terminate) 684{ 685int len; 686const char*start = NULL; 687 688if(p_value ==0) 689 start = line; 690while(line != end) { 691char c = *line; 692 693if(!end &&isspace(c)) { 694if(c =='\n') 695break; 696if(name_terminate(c, terminate)) 697break; 698} 699 line++; 700if(c =='/'&& !--p_value) 701 start = line; 702} 703if(!start) 704returnsquash_slash(xstrdup_or_null(def)); 705 len = line - start; 706if(!len) 707returnsquash_slash(xstrdup_or_null(def)); 708 709/* 710 * Generally we prefer the shorter name, especially 711 * if the other one is just a variation of that with 712 * something else tacked on to the end (ie "file.orig" 713 * or "file~"). 714 */ 715if(def) { 716int deflen =strlen(def); 717if(deflen < len && !strncmp(start, def, deflen)) 718returnsquash_slash(xstrdup(def)); 719} 720 721if(state->root.len) { 722char*ret =xstrfmt("%s%.*s", state->root.buf, len, start); 723returnsquash_slash(ret); 724} 725 726returnsquash_slash(xmemdupz(start, len)); 727} 728 729static char*find_name(struct apply_state *state, 730const char*line, 731char*def, 732int p_value, 733int terminate) 734{ 735if(*line =='"') { 736char*name =find_name_gnu(state, line, def, p_value); 737if(name) 738return name; 739} 740 741returnfind_name_common(state, line, def, p_value, NULL, terminate); 742} 743 744static char*find_name_traditional(struct apply_state *state, 745const char*line, 746char*def, 747int p_value) 748{ 749size_t len; 750size_t date_len; 751 752if(*line =='"') { 753char*name =find_name_gnu(state, line, def, p_value); 754if(name) 755return name; 756} 757 758 len =strchrnul(line,'\n') - line; 759 date_len =diff_timestamp_len(line, len); 760if(!date_len) 761returnfind_name_common(state, line, def, p_value, NULL, TERM_TAB); 762 len -= date_len; 763 764returnfind_name_common(state, line, def, p_value, line + len,0); 765} 766 767/* 768 * Given the string after "--- " or "+++ ", guess the appropriate 769 * p_value for the given patch. 770 */ 771static intguess_p_value(struct apply_state *state,const char*nameline) 772{ 773char*name, *cp; 774int val = -1; 775 776if(is_dev_null(nameline)) 777return-1; 778 name =find_name_traditional(state, nameline, NULL,0); 779if(!name) 780return-1; 781 cp =strchr(name,'/'); 782if(!cp) 783 val =0; 784else if(state->prefix) { 785/* 786 * Does it begin with "a/$our-prefix" and such? Then this is 787 * very likely to apply to our directory. 788 */ 789if(starts_with(name, state->prefix)) 790 val =count_slashes(state->prefix); 791else{ 792 cp++; 793if(starts_with(cp, state->prefix)) 794 val =count_slashes(state->prefix) +1; 795} 796} 797free(name); 798return val; 799} 800 801/* 802 * Does the ---/+++ line have the POSIX timestamp after the last HT? 803 * GNU diff puts epoch there to signal a creation/deletion event. Is 804 * this such a timestamp? 805 */ 806static inthas_epoch_timestamp(const char*nameline) 807{ 808/* 809 * We are only interested in epoch timestamp; any non-zero 810 * fraction cannot be one, hence "(\.0+)?" in the regexp below. 811 * For the same reason, the date must be either 1969-12-31 or 812 * 1970-01-01, and the seconds part must be "00". 813 */ 814const char stamp_regexp[] = 815"^(1969-12-31|1970-01-01)" 816" " 817"[0-2][0-9]:[0-5][0-9]:00(\\.0+)?" 818" " 819"([-+][0-2][0-9]:?[0-5][0-9])\n"; 820const char*timestamp = NULL, *cp, *colon; 821static regex_t *stamp; 822 regmatch_t m[10]; 823int zoneoffset; 824int hourminute; 825int status; 826 827for(cp = nameline; *cp !='\n'; cp++) { 828if(*cp =='\t') 829 timestamp = cp +1; 830} 831if(!timestamp) 832return0; 833if(!stamp) { 834 stamp =xmalloc(sizeof(*stamp)); 835if(regcomp(stamp, stamp_regexp, REG_EXTENDED)) { 836warning(_("Cannot prepare timestamp regexp%s"), 837 stamp_regexp); 838return0; 839} 840} 841 842 status =regexec(stamp, timestamp,ARRAY_SIZE(m), m,0); 843if(status) { 844if(status != REG_NOMATCH) 845warning(_("regexec returned%dfor input:%s"), 846 status, timestamp); 847return0; 848} 849 850 zoneoffset =strtol(timestamp + m[3].rm_so +1, (char**) &colon,10); 851if(*colon ==':') 852 zoneoffset = zoneoffset *60+strtol(colon +1, NULL,10); 853else 854 zoneoffset = (zoneoffset /100) *60+ (zoneoffset %100); 855if(timestamp[m[3].rm_so] =='-') 856 zoneoffset = -zoneoffset; 857 858/* 859 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31 860 * (west of GMT) or 1970-01-01 (east of GMT) 861 */ 862if((zoneoffset <0&&memcmp(timestamp,"1969-12-31",10)) || 863(0<= zoneoffset &&memcmp(timestamp,"1970-01-01",10))) 864return0; 865 866 hourminute = (strtol(timestamp +11, NULL,10) *60+ 867strtol(timestamp +14, NULL,10) - 868 zoneoffset); 869 870return((zoneoffset <0&& hourminute ==1440) || 871(0<= zoneoffset && !hourminute)); 872} 873 874/* 875 * Get the name etc info from the ---/+++ lines of a traditional patch header 876 * 877 * FIXME! The end-of-filename heuristics are kind of screwy. For existing 878 * files, we can happily check the index for a match, but for creating a 879 * new file we should try to match whatever "patch" does. I have no idea. 880 */ 881static intparse_traditional_patch(struct apply_state *state, 882const char*first, 883const char*second, 884struct patch *patch) 885{ 886char*name; 887 888 first +=4;/* skip "--- " */ 889 second +=4;/* skip "+++ " */ 890if(!state->p_value_known) { 891int p, q; 892 p =guess_p_value(state, first); 893 q =guess_p_value(state, second); 894if(p <0) p = q; 895if(0<= p && p == q) { 896 state->p_value = p; 897 state->p_value_known =1; 898} 899} 900if(is_dev_null(first)) { 901 patch->is_new =1; 902 patch->is_delete =0; 903 name =find_name_traditional(state, second, NULL, state->p_value); 904 patch->new_name = name; 905}else if(is_dev_null(second)) { 906 patch->is_new =0; 907 patch->is_delete =1; 908 name =find_name_traditional(state, first, NULL, state->p_value); 909 patch->old_name = name; 910}else{ 911char*first_name; 912 first_name =find_name_traditional(state, first, NULL, state->p_value); 913 name =find_name_traditional(state, second, first_name, state->p_value); 914free(first_name); 915if(has_epoch_timestamp(first)) { 916 patch->is_new =1; 917 patch->is_delete =0; 918 patch->new_name = name; 919}else if(has_epoch_timestamp(second)) { 920 patch->is_new =0; 921 patch->is_delete =1; 922 patch->old_name = name; 923}else{ 924 patch->old_name = name; 925 patch->new_name =xstrdup_or_null(name); 926} 927} 928if(!name) 929returnerror(_("unable to find filename in patch at line%d"), state->linenr); 930 931return0; 932} 933 934static intgitdiff_hdrend(struct apply_state *state, 935const char*line, 936struct patch *patch) 937{ 938return1; 939} 940 941/* 942 * We're anal about diff header consistency, to make 943 * sure that we don't end up having strange ambiguous 944 * patches floating around. 945 * 946 * As a result, gitdiff_{old|new}name() will check 947 * their names against any previous information, just 948 * to make sure.. 949 */ 950#define DIFF_OLD_NAME 0 951#define DIFF_NEW_NAME 1 952 953static intgitdiff_verify_name(struct apply_state *state, 954const char*line, 955int isnull, 956char**name, 957int side) 958{ 959if(!*name && !isnull) { 960*name =find_name(state, line, NULL, state->p_value, TERM_TAB); 961return0; 962} 963 964if(*name) { 965char*another; 966if(isnull) 967returnerror(_("git apply: bad git-diff - expected /dev/null, got%son line%d"), 968*name, state->linenr); 969 another =find_name(state, line, NULL, state->p_value, TERM_TAB); 970if(!another ||strcmp(another, *name)) { 971free(another); 972returnerror((side == DIFF_NEW_NAME) ? 973_("git apply: bad git-diff - inconsistent new filename on line%d") : 974_("git apply: bad git-diff - inconsistent old filename on line%d"), state->linenr); 975} 976free(another); 977}else{ 978if(!starts_with(line,"/dev/null\n")) 979returnerror(_("git apply: bad git-diff - expected /dev/null on line%d"), state->linenr); 980} 981 982return0; 983} 984 985static intgitdiff_oldname(struct apply_state *state, 986const char*line, 987struct patch *patch) 988{ 989returngitdiff_verify_name(state, line, 990 patch->is_new, &patch->old_name, 991 DIFF_OLD_NAME); 992} 993 994static intgitdiff_newname(struct apply_state *state, 995const char*line, 996struct patch *patch) 997{ 998returngitdiff_verify_name(state, line, 999 patch->is_delete, &patch->new_name,1000 DIFF_NEW_NAME);1001}10021003static intparse_mode_line(const char*line,int linenr,unsigned int*mode)1004{1005char*end;1006*mode =strtoul(line, &end,8);1007if(end == line || !isspace(*end))1008returnerror(_("invalid mode on line%d:%s"), linenr, line);1009return0;1010}10111012static intgitdiff_oldmode(struct apply_state *state,1013const char*line,1014struct patch *patch)1015{1016returnparse_mode_line(line, state->linenr, &patch->old_mode);1017}10181019static intgitdiff_newmode(struct apply_state *state,1020const char*line,1021struct patch *patch)1022{1023returnparse_mode_line(line, state->linenr, &patch->new_mode);1024}10251026static intgitdiff_delete(struct apply_state *state,1027const char*line,1028struct patch *patch)1029{1030 patch->is_delete =1;1031free(patch->old_name);1032 patch->old_name =xstrdup_or_null(patch->def_name);1033returngitdiff_oldmode(state, line, patch);1034}10351036static intgitdiff_newfile(struct apply_state *state,1037const char*line,1038struct patch *patch)1039{1040 patch->is_new =1;1041free(patch->new_name);1042 patch->new_name =xstrdup_or_null(patch->def_name);1043returngitdiff_newmode(state, line, patch);1044}10451046static intgitdiff_copysrc(struct apply_state *state,1047const char*line,1048struct patch *patch)1049{1050 patch->is_copy =1;1051free(patch->old_name);1052 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1053return0;1054}10551056static intgitdiff_copydst(struct apply_state *state,1057const char*line,1058struct patch *patch)1059{1060 patch->is_copy =1;1061free(patch->new_name);1062 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1063return0;1064}10651066static intgitdiff_renamesrc(struct apply_state *state,1067const char*line,1068struct patch *patch)1069{1070 patch->is_rename =1;1071free(patch->old_name);1072 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1073return0;1074}10751076static intgitdiff_renamedst(struct apply_state *state,1077const char*line,1078struct patch *patch)1079{1080 patch->is_rename =1;1081free(patch->new_name);1082 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1083return0;1084}10851086static intgitdiff_similarity(struct apply_state *state,1087const char*line,1088struct patch *patch)1089{1090unsigned long val =strtoul(line, NULL,10);1091if(val <=100)1092 patch->score = val;1093return0;1094}10951096static intgitdiff_dissimilarity(struct apply_state *state,1097const char*line,1098struct patch *patch)1099{1100unsigned long val =strtoul(line, NULL,10);1101if(val <=100)1102 patch->score = val;1103return0;1104}11051106static intgitdiff_index(struct apply_state *state,1107const char*line,1108struct patch *patch)1109{1110/*1111 * index line is N hexadecimal, "..", N hexadecimal,1112 * and optional space with octal mode.1113 */1114const char*ptr, *eol;1115int len;11161117 ptr =strchr(line,'.');1118if(!ptr || ptr[1] !='.'||40< ptr - line)1119return0;1120 len = ptr - line;1121memcpy(patch->old_sha1_prefix, line, len);1122 patch->old_sha1_prefix[len] =0;11231124 line = ptr +2;1125 ptr =strchr(line,' ');1126 eol =strchrnul(line,'\n');11271128if(!ptr || eol < ptr)1129 ptr = eol;1130 len = ptr - line;11311132if(40< len)1133return0;1134memcpy(patch->new_sha1_prefix, line, len);1135 patch->new_sha1_prefix[len] =0;1136if(*ptr ==' ')1137returngitdiff_oldmode(state, ptr +1, patch);1138return0;1139}11401141/*1142 * This is normal for a diff that doesn't change anything: we'll fall through1143 * into the next diff. Tell the parser to break out.1144 */1145static intgitdiff_unrecognized(struct apply_state *state,1146const char*line,1147struct patch *patch)1148{1149return1;1150}11511152/*1153 * Skip p_value leading components from "line"; as we do not accept1154 * absolute paths, return NULL in that case.1155 */1156static const char*skip_tree_prefix(struct apply_state *state,1157const char*line,1158int llen)1159{1160int nslash;1161int i;11621163if(!state->p_value)1164return(llen && line[0] =='/') ? NULL : line;11651166 nslash = state->p_value;1167for(i =0; i < llen; i++) {1168int ch = line[i];1169if(ch =='/'&& --nslash <=0)1170return(i ==0) ? NULL : &line[i +1];1171}1172return NULL;1173}11741175/*1176 * This is to extract the same name that appears on "diff --git"1177 * line. We do not find and return anything if it is a rename1178 * patch, and it is OK because we will find the name elsewhere.1179 * We need to reliably find name only when it is mode-change only,1180 * creation or deletion of an empty file. In any of these cases,1181 * both sides are the same name under a/ and b/ respectively.1182 */1183static char*git_header_name(struct apply_state *state,1184const char*line,1185int llen)1186{1187const char*name;1188const char*second = NULL;1189size_t len, line_len;11901191 line +=strlen("diff --git ");1192 llen -=strlen("diff --git ");11931194if(*line =='"') {1195const char*cp;1196struct strbuf first = STRBUF_INIT;1197struct strbuf sp = STRBUF_INIT;11981199if(unquote_c_style(&first, line, &second))1200goto free_and_fail1;12011202/* strip the a/b prefix including trailing slash */1203 cp =skip_tree_prefix(state, first.buf, first.len);1204if(!cp)1205goto free_and_fail1;1206strbuf_remove(&first,0, cp - first.buf);12071208/*1209 * second points at one past closing dq of name.1210 * find the second name.1211 */1212while((second < line + llen) &&isspace(*second))1213 second++;12141215if(line + llen <= second)1216goto free_and_fail1;1217if(*second =='"') {1218if(unquote_c_style(&sp, second, NULL))1219goto free_and_fail1;1220 cp =skip_tree_prefix(state, sp.buf, sp.len);1221if(!cp)1222goto free_and_fail1;1223/* They must match, otherwise ignore */1224if(strcmp(cp, first.buf))1225goto free_and_fail1;1226strbuf_release(&sp);1227returnstrbuf_detach(&first, NULL);1228}12291230/* unquoted second */1231 cp =skip_tree_prefix(state, second, line + llen - second);1232if(!cp)1233goto free_and_fail1;1234if(line + llen - cp != first.len ||1235memcmp(first.buf, cp, first.len))1236goto free_and_fail1;1237returnstrbuf_detach(&first, NULL);12381239 free_and_fail1:1240strbuf_release(&first);1241strbuf_release(&sp);1242return NULL;1243}12441245/* unquoted first name */1246 name =skip_tree_prefix(state, line, llen);1247if(!name)1248return NULL;12491250/*1251 * since the first name is unquoted, a dq if exists must be1252 * the beginning of the second name.1253 */1254for(second = name; second < line + llen; second++) {1255if(*second =='"') {1256struct strbuf sp = STRBUF_INIT;1257const char*np;12581259if(unquote_c_style(&sp, second, NULL))1260goto free_and_fail2;12611262 np =skip_tree_prefix(state, sp.buf, sp.len);1263if(!np)1264goto free_and_fail2;12651266 len = sp.buf + sp.len - np;1267if(len < second - name &&1268!strncmp(np, name, len) &&1269isspace(name[len])) {1270/* Good */1271strbuf_remove(&sp,0, np - sp.buf);1272returnstrbuf_detach(&sp, NULL);1273}12741275 free_and_fail2:1276strbuf_release(&sp);1277return NULL;1278}1279}12801281/*1282 * Accept a name only if it shows up twice, exactly the same1283 * form.1284 */1285 second =strchr(name,'\n');1286if(!second)1287return NULL;1288 line_len = second - name;1289for(len =0; ; len++) {1290switch(name[len]) {1291default:1292continue;1293case'\n':1294return NULL;1295case'\t':case' ':1296/*1297 * Is this the separator between the preimage1298 * and the postimage pathname? Again, we are1299 * only interested in the case where there is1300 * no rename, as this is only to set def_name1301 * and a rename patch has the names elsewhere1302 * in an unambiguous form.1303 */1304if(!name[len +1])1305return NULL;/* no postimage name */1306 second =skip_tree_prefix(state, name + len +1,1307 line_len - (len +1));1308if(!second)1309return NULL;1310/*1311 * Does len bytes starting at "name" and "second"1312 * (that are separated by one HT or SP we just1313 * found) exactly match?1314 */1315if(second[len] =='\n'&& !strncmp(name, second, len))1316returnxmemdupz(name, len);1317}1318}1319}13201321static intcheck_header_line(struct apply_state *state,struct patch *patch)1322{1323int extensions = (patch->is_delete ==1) + (patch->is_new ==1) +1324(patch->is_rename ==1) + (patch->is_copy ==1);1325if(extensions >1)1326returnerror(_("inconsistent header lines%dand%d"),1327 patch->extension_linenr, state->linenr);1328if(extensions && !patch->extension_linenr)1329 patch->extension_linenr = state->linenr;1330return0;1331}13321333/* Verify that we recognize the lines following a git header */1334static intparse_git_header(struct apply_state *state,1335const char*line,1336int len,1337unsigned int size,1338struct patch *patch)1339{1340unsigned long offset;13411342/* A git diff has explicit new/delete information, so we don't guess */1343 patch->is_new =0;1344 patch->is_delete =0;13451346/*1347 * Some things may not have the old name in the1348 * rest of the headers anywhere (pure mode changes,1349 * or removing or adding empty files), so we get1350 * the default name from the header.1351 */1352 patch->def_name =git_header_name(state, line, len);1353if(patch->def_name && state->root.len) {1354char*s =xstrfmt("%s%s", state->root.buf, patch->def_name);1355free(patch->def_name);1356 patch->def_name = s;1357}13581359 line += len;1360 size -= len;1361 state->linenr++;1362for(offset = len ; size >0; offset += len, size -= len, line += len, state->linenr++) {1363static const struct opentry {1364const char*str;1365int(*fn)(struct apply_state *,const char*,struct patch *);1366} optable[] = {1367{"@@ -", gitdiff_hdrend },1368{"--- ", gitdiff_oldname },1369{"+++ ", gitdiff_newname },1370{"old mode ", gitdiff_oldmode },1371{"new mode ", gitdiff_newmode },1372{"deleted file mode ", gitdiff_delete },1373{"new file mode ", gitdiff_newfile },1374{"copy from ", gitdiff_copysrc },1375{"copy to ", gitdiff_copydst },1376{"rename old ", gitdiff_renamesrc },1377{"rename new ", gitdiff_renamedst },1378{"rename from ", gitdiff_renamesrc },1379{"rename to ", gitdiff_renamedst },1380{"similarity index ", gitdiff_similarity },1381{"dissimilarity index ", gitdiff_dissimilarity },1382{"index ", gitdiff_index },1383{"", gitdiff_unrecognized },1384};1385int i;13861387 len =linelen(line, size);1388if(!len || line[len-1] !='\n')1389break;1390for(i =0; i <ARRAY_SIZE(optable); i++) {1391const struct opentry *p = optable + i;1392int oplen =strlen(p->str);1393int res;1394if(len < oplen ||memcmp(p->str, line, oplen))1395continue;1396 res = p->fn(state, line + oplen, patch);1397if(res <0)1398return-1;1399if(check_header_line(state, patch))1400return-1;1401if(res >0)1402return offset;1403break;1404}1405}14061407return offset;1408}14091410static intparse_num(const char*line,unsigned long*p)1411{1412char*ptr;14131414if(!isdigit(*line))1415return0;1416*p =strtoul(line, &ptr,10);1417return ptr - line;1418}14191420static intparse_range(const char*line,int len,int offset,const char*expect,1421unsigned long*p1,unsigned long*p2)1422{1423int digits, ex;14241425if(offset <0|| offset >= len)1426return-1;1427 line += offset;1428 len -= offset;14291430 digits =parse_num(line, p1);1431if(!digits)1432return-1;14331434 offset += digits;1435 line += digits;1436 len -= digits;14371438*p2 =1;1439if(*line ==',') {1440 digits =parse_num(line+1, p2);1441if(!digits)1442return-1;14431444 offset += digits+1;1445 line += digits+1;1446 len -= digits+1;1447}14481449 ex =strlen(expect);1450if(ex > len)1451return-1;1452if(memcmp(line, expect, ex))1453return-1;14541455return offset + ex;1456}14571458static voidrecount_diff(const char*line,int size,struct fragment *fragment)1459{1460int oldlines =0, newlines =0, ret =0;14611462if(size <1) {1463warning("recount: ignore empty hunk");1464return;1465}14661467for(;;) {1468int len =linelen(line, size);1469 size -= len;1470 line += len;14711472if(size <1)1473break;14741475switch(*line) {1476case' ':case'\n':1477 newlines++;1478/* fall through */1479case'-':1480 oldlines++;1481continue;1482case'+':1483 newlines++;1484continue;1485case'\\':1486continue;1487case'@':1488 ret = size <3|| !starts_with(line,"@@ ");1489break;1490case'd':1491 ret = size <5|| !starts_with(line,"diff ");1492break;1493default:1494 ret = -1;1495break;1496}1497if(ret) {1498warning(_("recount: unexpected line: %.*s"),1499(int)linelen(line, size), line);1500return;1501}1502break;1503}1504 fragment->oldlines = oldlines;1505 fragment->newlines = newlines;1506}15071508/*1509 * Parse a unified diff fragment header of the1510 * form "@@ -a,b +c,d @@"1511 */1512static intparse_fragment_header(const char*line,int len,struct fragment *fragment)1513{1514int offset;15151516if(!len || line[len-1] !='\n')1517return-1;15181519/* Figure out the number of lines in a fragment */1520 offset =parse_range(line, len,4," +", &fragment->oldpos, &fragment->oldlines);1521 offset =parse_range(line, len, offset," @@", &fragment->newpos, &fragment->newlines);15221523return offset;1524}15251526/*1527 * Find file diff header1528 *1529 * Returns:1530 * -1 if no header was found1531 * -128 in case of error1532 * the size of the header in bytes (called "offset") otherwise1533 */1534static intfind_header(struct apply_state *state,1535const char*line,1536unsigned long size,1537int*hdrsize,1538struct patch *patch)1539{1540unsigned long offset, len;15411542 patch->is_toplevel_relative =0;1543 patch->is_rename = patch->is_copy =0;1544 patch->is_new = patch->is_delete = -1;1545 patch->old_mode = patch->new_mode =0;1546 patch->old_name = patch->new_name = NULL;1547for(offset =0; size >0; offset += len, size -= len, line += len, state->linenr++) {1548unsigned long nextlen;15491550 len =linelen(line, size);1551if(!len)1552break;15531554/* Testing this early allows us to take a few shortcuts.. */1555if(len <6)1556continue;15571558/*1559 * Make sure we don't find any unconnected patch fragments.1560 * That's a sign that we didn't find a header, and that a1561 * patch has become corrupted/broken up.1562 */1563if(!memcmp("@@ -", line,4)) {1564struct fragment dummy;1565if(parse_fragment_header(line, len, &dummy) <0)1566continue;1567error(_("patch fragment without header at line%d: %.*s"),1568 state->linenr, (int)len-1, line);1569return-128;1570}15711572if(size < len +6)1573break;15741575/*1576 * Git patch? It might not have a real patch, just a rename1577 * or mode change, so we handle that specially1578 */1579if(!memcmp("diff --git ", line,11)) {1580int git_hdr_len =parse_git_header(state, line, len, size, patch);1581if(git_hdr_len <0)1582return-128;1583if(git_hdr_len <= len)1584continue;1585if(!patch->old_name && !patch->new_name) {1586if(!patch->def_name) {1587error(Q_("git diff header lacks filename information when removing "1588"%dleading pathname component (line%d)",1589"git diff header lacks filename information when removing "1590"%dleading pathname components (line%d)",1591 state->p_value),1592 state->p_value, state->linenr);1593return-128;1594}1595 patch->old_name =xstrdup(patch->def_name);1596 patch->new_name =xstrdup(patch->def_name);1597}1598if((!patch->new_name && !patch->is_delete) ||1599(!patch->old_name && !patch->is_new)) {1600error(_("git diff header lacks filename information "1601"(line%d)"), state->linenr);1602return-128;1603}1604 patch->is_toplevel_relative =1;1605*hdrsize = git_hdr_len;1606return offset;1607}16081609/* --- followed by +++ ? */1610if(memcmp("--- ", line,4) ||memcmp("+++ ", line + len,4))1611continue;16121613/*1614 * We only accept unified patches, so we want it to1615 * at least have "@@ -a,b +c,d @@\n", which is 14 chars1616 * minimum ("@@ -0,0 +1 @@\n" is the shortest).1617 */1618 nextlen =linelen(line + len, size - len);1619if(size < nextlen +14||memcmp("@@ -", line + len + nextlen,4))1620continue;16211622/* Ok, we'll consider it a patch */1623if(parse_traditional_patch(state, line, line+len, patch))1624return-128;1625*hdrsize = len + nextlen;1626 state->linenr +=2;1627return offset;1628}1629return-1;1630}16311632static voidrecord_ws_error(struct apply_state *state,1633unsigned result,1634const char*line,1635int len,1636int linenr)1637{1638char*err;16391640if(!result)1641return;16421643 state->whitespace_error++;1644if(state->squelch_whitespace_errors &&1645 state->squelch_whitespace_errors < state->whitespace_error)1646return;16471648 err =whitespace_error_string(result);1649if(state->apply_verbosity > verbosity_silent)1650fprintf(stderr,"%s:%d:%s.\n%.*s\n",1651 state->patch_input_file, linenr, err, len, line);1652free(err);1653}16541655static voidcheck_whitespace(struct apply_state *state,1656const char*line,1657int len,1658unsigned ws_rule)1659{1660unsigned result =ws_check(line +1, len -1, ws_rule);16611662record_ws_error(state, result, line +1, len -2, state->linenr);1663}16641665/*1666 * Check if the patch has context lines with CRLF or1667 * the patch wants to remove lines with CRLF.1668 */1669static voidcheck_old_for_crlf(struct patch *patch,const char*line,int len)1670{1671if(len >=2&& line[len-1] =='\n'&& line[len-2] =='\r') {1672 patch->ws_rule |= WS_CR_AT_EOL;1673 patch->crlf_in_old =1;1674}1675}167616771678/*1679 * Parse a unified diff. Note that this really needs to parse each1680 * fragment separately, since the only way to know the difference1681 * between a "---" that is part of a patch, and a "---" that starts1682 * the next patch is to look at the line counts..1683 */1684static intparse_fragment(struct apply_state *state,1685const char*line,1686unsigned long size,1687struct patch *patch,1688struct fragment *fragment)1689{1690int added, deleted;1691int len =linelen(line, size), offset;1692unsigned long oldlines, newlines;1693unsigned long leading, trailing;16941695 offset =parse_fragment_header(line, len, fragment);1696if(offset <0)1697return-1;1698if(offset >0&& patch->recount)1699recount_diff(line + offset, size - offset, fragment);1700 oldlines = fragment->oldlines;1701 newlines = fragment->newlines;1702 leading =0;1703 trailing =0;17041705/* Parse the thing.. */1706 line += len;1707 size -= len;1708 state->linenr++;1709 added = deleted =0;1710for(offset = len;17110< size;1712 offset += len, size -= len, line += len, state->linenr++) {1713if(!oldlines && !newlines)1714break;1715 len =linelen(line, size);1716if(!len || line[len-1] !='\n')1717return-1;1718switch(*line) {1719default:1720return-1;1721case'\n':/* newer GNU diff, an empty context line */1722case' ':1723 oldlines--;1724 newlines--;1725if(!deleted && !added)1726 leading++;1727 trailing++;1728check_old_for_crlf(patch, line, len);1729if(!state->apply_in_reverse &&1730 state->ws_error_action == correct_ws_error)1731check_whitespace(state, line, len, patch->ws_rule);1732break;1733case'-':1734if(!state->apply_in_reverse)1735check_old_for_crlf(patch, line, len);1736if(state->apply_in_reverse &&1737 state->ws_error_action != nowarn_ws_error)1738check_whitespace(state, line, len, patch->ws_rule);1739 deleted++;1740 oldlines--;1741 trailing =0;1742break;1743case'+':1744if(state->apply_in_reverse)1745check_old_for_crlf(patch, line, len);1746if(!state->apply_in_reverse &&1747 state->ws_error_action != nowarn_ws_error)1748check_whitespace(state, line, len, patch->ws_rule);1749 added++;1750 newlines--;1751 trailing =0;1752break;17531754/*1755 * We allow "\ No newline at end of file". Depending1756 * on locale settings when the patch was produced we1757 * don't know what this line looks like. The only1758 * thing we do know is that it begins with "\ ".1759 * Checking for 12 is just for sanity check -- any1760 * l10n of "\ No newline..." is at least that long.1761 */1762case'\\':1763if(len <12||memcmp(line,"\\",2))1764return-1;1765break;1766}1767}1768if(oldlines || newlines)1769return-1;1770if(!deleted && !added)1771return-1;17721773 fragment->leading = leading;1774 fragment->trailing = trailing;17751776/*1777 * If a fragment ends with an incomplete line, we failed to include1778 * it in the above loop because we hit oldlines == newlines == 01779 * before seeing it.1780 */1781if(12< size && !memcmp(line,"\\",2))1782 offset +=linelen(line, size);17831784 patch->lines_added += added;1785 patch->lines_deleted += deleted;17861787if(0< patch->is_new && oldlines)1788returnerror(_("new file depends on old contents"));1789if(0< patch->is_delete && newlines)1790returnerror(_("deleted file still has contents"));1791return offset;1792}17931794/*1795 * We have seen "diff --git a/... b/..." header (or a traditional patch1796 * header). Read hunks that belong to this patch into fragments and hang1797 * them to the given patch structure.1798 *1799 * The (fragment->patch, fragment->size) pair points into the memory given1800 * by the caller, not a copy, when we return.1801 *1802 * Returns:1803 * -1 in case of error,1804 * the number of bytes in the patch otherwise.1805 */1806static intparse_single_patch(struct apply_state *state,1807const char*line,1808unsigned long size,1809struct patch *patch)1810{1811unsigned long offset =0;1812unsigned long oldlines =0, newlines =0, context =0;1813struct fragment **fragp = &patch->fragments;18141815while(size >4&& !memcmp(line,"@@ -",4)) {1816struct fragment *fragment;1817int len;18181819 fragment =xcalloc(1,sizeof(*fragment));1820 fragment->linenr = state->linenr;1821 len =parse_fragment(state, line, size, patch, fragment);1822if(len <=0) {1823free(fragment);1824returnerror(_("corrupt patch at line%d"), state->linenr);1825}1826 fragment->patch = line;1827 fragment->size = len;1828 oldlines += fragment->oldlines;1829 newlines += fragment->newlines;1830 context += fragment->leading + fragment->trailing;18311832*fragp = fragment;1833 fragp = &fragment->next;18341835 offset += len;1836 line += len;1837 size -= len;1838}18391840/*1841 * If something was removed (i.e. we have old-lines) it cannot1842 * be creation, and if something was added it cannot be1843 * deletion. However, the reverse is not true; --unified=01844 * patches that only add are not necessarily creation even1845 * though they do not have any old lines, and ones that only1846 * delete are not necessarily deletion.1847 *1848 * Unfortunately, a real creation/deletion patch do _not_ have1849 * any context line by definition, so we cannot safely tell it1850 * apart with --unified=0 insanity. At least if the patch has1851 * more than one hunk it is not creation or deletion.1852 */1853if(patch->is_new <0&&1854(oldlines || (patch->fragments && patch->fragments->next)))1855 patch->is_new =0;1856if(patch->is_delete <0&&1857(newlines || (patch->fragments && patch->fragments->next)))1858 patch->is_delete =0;18591860if(0< patch->is_new && oldlines)1861returnerror(_("new file%sdepends on old contents"), patch->new_name);1862if(0< patch->is_delete && newlines)1863returnerror(_("deleted file%sstill has contents"), patch->old_name);1864if(!patch->is_delete && !newlines && context && state->apply_verbosity > verbosity_silent)1865fprintf_ln(stderr,1866_("** warning: "1867"file%sbecomes empty but is not deleted"),1868 patch->new_name);18691870return offset;1871}18721873staticinlineintmetadata_changes(struct patch *patch)1874{1875return patch->is_rename >0||1876 patch->is_copy >0||1877 patch->is_new >0||1878 patch->is_delete ||1879(patch->old_mode && patch->new_mode &&1880 patch->old_mode != patch->new_mode);1881}18821883static char*inflate_it(const void*data,unsigned long size,1884unsigned long inflated_size)1885{1886 git_zstream stream;1887void*out;1888int st;18891890memset(&stream,0,sizeof(stream));18911892 stream.next_in = (unsigned char*)data;1893 stream.avail_in = size;1894 stream.next_out = out =xmalloc(inflated_size);1895 stream.avail_out = inflated_size;1896git_inflate_init(&stream);1897 st =git_inflate(&stream, Z_FINISH);1898git_inflate_end(&stream);1899if((st != Z_STREAM_END) || stream.total_out != inflated_size) {1900free(out);1901return NULL;1902}1903return out;1904}19051906/*1907 * Read a binary hunk and return a new fragment; fragment->patch1908 * points at an allocated memory that the caller must free, so1909 * it is marked as "->free_patch = 1".1910 */1911static struct fragment *parse_binary_hunk(struct apply_state *state,1912char**buf_p,1913unsigned long*sz_p,1914int*status_p,1915int*used_p)1916{1917/*1918 * Expect a line that begins with binary patch method ("literal"1919 * or "delta"), followed by the length of data before deflating.1920 * a sequence of 'length-byte' followed by base-85 encoded data1921 * should follow, terminated by a newline.1922 *1923 * Each 5-byte sequence of base-85 encodes up to 4 bytes,1924 * and we would limit the patch line to 66 characters,1925 * so one line can fit up to 13 groups that would decode1926 * to 52 bytes max. The length byte 'A'-'Z' corresponds1927 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.1928 */1929int llen, used;1930unsigned long size = *sz_p;1931char*buffer = *buf_p;1932int patch_method;1933unsigned long origlen;1934char*data = NULL;1935int hunk_size =0;1936struct fragment *frag;19371938 llen =linelen(buffer, size);1939 used = llen;19401941*status_p =0;19421943if(starts_with(buffer,"delta ")) {1944 patch_method = BINARY_DELTA_DEFLATED;1945 origlen =strtoul(buffer +6, NULL,10);1946}1947else if(starts_with(buffer,"literal ")) {1948 patch_method = BINARY_LITERAL_DEFLATED;1949 origlen =strtoul(buffer +8, NULL,10);1950}1951else1952return NULL;19531954 state->linenr++;1955 buffer += llen;1956while(1) {1957int byte_length, max_byte_length, newsize;1958 llen =linelen(buffer, size);1959 used += llen;1960 state->linenr++;1961if(llen ==1) {1962/* consume the blank line */1963 buffer++;1964 size--;1965break;1966}1967/*1968 * Minimum line is "A00000\n" which is 7-byte long,1969 * and the line length must be multiple of 5 plus 2.1970 */1971if((llen <7) || (llen-2) %5)1972goto corrupt;1973 max_byte_length = (llen -2) /5*4;1974 byte_length = *buffer;1975if('A'<= byte_length && byte_length <='Z')1976 byte_length = byte_length -'A'+1;1977else if('a'<= byte_length && byte_length <='z')1978 byte_length = byte_length -'a'+27;1979else1980goto corrupt;1981/* if the input length was not multiple of 4, we would1982 * have filler at the end but the filler should never1983 * exceed 3 bytes1984 */1985if(max_byte_length < byte_length ||1986 byte_length <= max_byte_length -4)1987goto corrupt;1988 newsize = hunk_size + byte_length;1989 data =xrealloc(data, newsize);1990if(decode_85(data + hunk_size, buffer +1, byte_length))1991goto corrupt;1992 hunk_size = newsize;1993 buffer += llen;1994 size -= llen;1995}19961997 frag =xcalloc(1,sizeof(*frag));1998 frag->patch =inflate_it(data, hunk_size, origlen);1999 frag->free_patch =1;2000if(!frag->patch)2001goto corrupt;2002free(data);2003 frag->size = origlen;2004*buf_p = buffer;2005*sz_p = size;2006*used_p = used;2007 frag->binary_patch_method = patch_method;2008return frag;20092010 corrupt:2011free(data);2012*status_p = -1;2013error(_("corrupt binary patch at line%d: %.*s"),2014 state->linenr-1, llen-1, buffer);2015return NULL;2016}20172018/*2019 * Returns:2020 * -1 in case of error,2021 * the length of the parsed binary patch otherwise2022 */2023static intparse_binary(struct apply_state *state,2024char*buffer,2025unsigned long size,2026struct patch *patch)2027{2028/*2029 * We have read "GIT binary patch\n"; what follows is a line2030 * that says the patch method (currently, either "literal" or2031 * "delta") and the length of data before deflating; a2032 * sequence of 'length-byte' followed by base-85 encoded data2033 * follows.2034 *2035 * When a binary patch is reversible, there is another binary2036 * hunk in the same format, starting with patch method (either2037 * "literal" or "delta") with the length of data, and a sequence2038 * of length-byte + base-85 encoded data, terminated with another2039 * empty line. This data, when applied to the postimage, produces2040 * the preimage.2041 */2042struct fragment *forward;2043struct fragment *reverse;2044int status;2045int used, used_1;20462047 forward =parse_binary_hunk(state, &buffer, &size, &status, &used);2048if(!forward && !status)2049/* there has to be one hunk (forward hunk) */2050returnerror(_("unrecognized binary patch at line%d"), state->linenr-1);2051if(status)2052/* otherwise we already gave an error message */2053return status;20542055 reverse =parse_binary_hunk(state, &buffer, &size, &status, &used_1);2056if(reverse)2057 used += used_1;2058else if(status) {2059/*2060 * Not having reverse hunk is not an error, but having2061 * a corrupt reverse hunk is.2062 */2063free((void*) forward->patch);2064free(forward);2065return status;2066}2067 forward->next = reverse;2068 patch->fragments = forward;2069 patch->is_binary =1;2070return used;2071}20722073static voidprefix_one(struct apply_state *state,char**name)2074{2075char*old_name = *name;2076if(!old_name)2077return;2078*name =prefix_filename(state->prefix, *name);2079free(old_name);2080}20812082static voidprefix_patch(struct apply_state *state,struct patch *p)2083{2084if(!state->prefix || p->is_toplevel_relative)2085return;2086prefix_one(state, &p->new_name);2087prefix_one(state, &p->old_name);2088}20892090/*2091 * include/exclude2092 */20932094static voidadd_name_limit(struct apply_state *state,2095const char*name,2096int exclude)2097{2098struct string_list_item *it;20992100 it =string_list_append(&state->limit_by_name, name);2101 it->util = exclude ? NULL : (void*)1;2102}21032104static intuse_patch(struct apply_state *state,struct patch *p)2105{2106const char*pathname = p->new_name ? p->new_name : p->old_name;2107int i;21082109/* Paths outside are not touched regardless of "--include" */2110if(state->prefix && *state->prefix) {2111const char*rest;2112if(!skip_prefix(pathname, state->prefix, &rest) || !*rest)2113return0;2114}21152116/* See if it matches any of exclude/include rule */2117for(i =0; i < state->limit_by_name.nr; i++) {2118struct string_list_item *it = &state->limit_by_name.items[i];2119if(!wildmatch(it->string, pathname,0))2120return(it->util != NULL);2121}21222123/*2124 * If we had any include, a path that does not match any rule is2125 * not used. Otherwise, we saw bunch of exclude rules (or none)2126 * and such a path is used.2127 */2128return!state->has_include;2129}21302131/*2132 * Read the patch text in "buffer" that extends for "size" bytes; stop2133 * reading after seeing a single patch (i.e. changes to a single file).2134 * Create fragments (i.e. patch hunks) and hang them to the given patch.2135 *2136 * Returns:2137 * -1 if no header was found or parse_binary() failed,2138 * -128 on another error,2139 * the number of bytes consumed otherwise,2140 * so that the caller can call us again for the next patch.2141 */2142static intparse_chunk(struct apply_state *state,char*buffer,unsigned long size,struct patch *patch)2143{2144int hdrsize, patchsize;2145int offset =find_header(state, buffer, size, &hdrsize, patch);21462147if(offset <0)2148return offset;21492150prefix_patch(state, patch);21512152if(!use_patch(state, patch))2153 patch->ws_rule =0;2154else2155 patch->ws_rule =whitespace_rule(patch->new_name2156? patch->new_name2157: patch->old_name);21582159 patchsize =parse_single_patch(state,2160 buffer + offset + hdrsize,2161 size - offset - hdrsize,2162 patch);21632164if(patchsize <0)2165return-128;21662167if(!patchsize) {2168static const char git_binary[] ="GIT binary patch\n";2169int hd = hdrsize + offset;2170unsigned long llen =linelen(buffer + hd, size - hd);21712172if(llen ==sizeof(git_binary) -1&&2173!memcmp(git_binary, buffer + hd, llen)) {2174int used;2175 state->linenr++;2176 used =parse_binary(state, buffer + hd + llen,2177 size - hd - llen, patch);2178if(used <0)2179return-1;2180if(used)2181 patchsize = used + llen;2182else2183 patchsize =0;2184}2185else if(!memcmp(" differ\n", buffer + hd + llen -8,8)) {2186static const char*binhdr[] = {2187"Binary files ",2188"Files ",2189 NULL,2190};2191int i;2192for(i =0; binhdr[i]; i++) {2193int len =strlen(binhdr[i]);2194if(len < size - hd &&2195!memcmp(binhdr[i], buffer + hd, len)) {2196 state->linenr++;2197 patch->is_binary =1;2198 patchsize = llen;2199break;2200}2201}2202}22032204/* Empty patch cannot be applied if it is a text patch2205 * without metadata change. A binary patch appears2206 * empty to us here.2207 */2208if((state->apply || state->check) &&2209(!patch->is_binary && !metadata_changes(patch))) {2210error(_("patch with only garbage at line%d"), state->linenr);2211return-128;2212}2213}22142215return offset + hdrsize + patchsize;2216}22172218static voidreverse_patches(struct patch *p)2219{2220for(; p; p = p->next) {2221struct fragment *frag = p->fragments;22222223SWAP(p->new_name, p->old_name);2224SWAP(p->new_mode, p->old_mode);2225SWAP(p->is_new, p->is_delete);2226SWAP(p->lines_added, p->lines_deleted);2227SWAP(p->old_sha1_prefix, p->new_sha1_prefix);22282229for(; frag; frag = frag->next) {2230SWAP(frag->newpos, frag->oldpos);2231SWAP(frag->newlines, frag->oldlines);2232}2233}2234}22352236static const char pluses[] =2237"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";2238static const char minuses[]=2239"----------------------------------------------------------------------";22402241static voidshow_stats(struct apply_state *state,struct patch *patch)2242{2243struct strbuf qname = STRBUF_INIT;2244char*cp = patch->new_name ? patch->new_name : patch->old_name;2245int max, add, del;22462247quote_c_style(cp, &qname, NULL,0);22482249/*2250 * "scale" the filename2251 */2252 max = state->max_len;2253if(max >50)2254 max =50;22552256if(qname.len > max) {2257 cp =strchr(qname.buf + qname.len +3- max,'/');2258if(!cp)2259 cp = qname.buf + qname.len +3- max;2260strbuf_splice(&qname,0, cp - qname.buf,"...",3);2261}22622263if(patch->is_binary) {2264printf(" %-*s | Bin\n", max, qname.buf);2265strbuf_release(&qname);2266return;2267}22682269printf(" %-*s |", max, qname.buf);2270strbuf_release(&qname);22712272/*2273 * scale the add/delete2274 */2275 max = max + state->max_change >70?70- max : state->max_change;2276 add = patch->lines_added;2277 del = patch->lines_deleted;22782279if(state->max_change >0) {2280int total = ((add + del) * max + state->max_change /2) / state->max_change;2281 add = (add * max + state->max_change /2) / state->max_change;2282 del = total - add;2283}2284printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,2285 add, pluses, del, minuses);2286}22872288static intread_old_data(struct stat *st,struct patch *patch,2289const char*path,struct strbuf *buf)2290{2291enum safe_crlf safe_crlf = patch->crlf_in_old ?2292 SAFE_CRLF_KEEP_CRLF : SAFE_CRLF_RENORMALIZE;2293switch(st->st_mode & S_IFMT) {2294case S_IFLNK:2295if(strbuf_readlink(buf, path, st->st_size) <0)2296returnerror(_("unable to read symlink%s"), path);2297return0;2298case S_IFREG:2299if(strbuf_read_file(buf, path, st->st_size) != st->st_size)2300returnerror(_("unable to open or read%s"), path);2301/*2302 * "git apply" without "--index/--cached" should never look2303 * at the index; the target file may not have been added to2304 * the index yet, and we may not even be in any Git repository.2305 * Pass NULL to convert_to_git() to stress this; the function2306 * should never look at the index when explicit crlf option2307 * is given.2308 */2309convert_to_git(NULL, path, buf->buf, buf->len, buf, safe_crlf);2310return0;2311default:2312return-1;2313}2314}23152316/*2317 * Update the preimage, and the common lines in postimage,2318 * from buffer buf of length len. If postlen is 0 the postimage2319 * is updated in place, otherwise it's updated on a new buffer2320 * of length postlen2321 */23222323static voidupdate_pre_post_images(struct image *preimage,2324struct image *postimage,2325char*buf,2326size_t len,size_t postlen)2327{2328int i, ctx, reduced;2329char*new, *old, *fixed;2330struct image fixed_preimage;23312332/*2333 * Update the preimage with whitespace fixes. Note that we2334 * are not losing preimage->buf -- apply_one_fragment() will2335 * free "oldlines".2336 */2337prepare_image(&fixed_preimage, buf, len,1);2338assert(postlen2339? fixed_preimage.nr == preimage->nr2340: fixed_preimage.nr <= preimage->nr);2341for(i =0; i < fixed_preimage.nr; i++)2342 fixed_preimage.line[i].flag = preimage->line[i].flag;2343free(preimage->line_allocated);2344*preimage = fixed_preimage;23452346/*2347 * Adjust the common context lines in postimage. This can be2348 * done in-place when we are shrinking it with whitespace2349 * fixing, but needs a new buffer when ignoring whitespace or2350 * expanding leading tabs to spaces.2351 *2352 * We trust the caller to tell us if the update can be done2353 * in place (postlen==0) or not.2354 */2355 old = postimage->buf;2356if(postlen)2357new= postimage->buf =xmalloc(postlen);2358else2359new= old;2360 fixed = preimage->buf;23612362for(i = reduced = ctx =0; i < postimage->nr; i++) {2363size_t l_len = postimage->line[i].len;2364if(!(postimage->line[i].flag & LINE_COMMON)) {2365/* an added line -- no counterparts in preimage */2366memmove(new, old, l_len);2367 old += l_len;2368new+= l_len;2369continue;2370}23712372/* a common context -- skip it in the original postimage */2373 old += l_len;23742375/* and find the corresponding one in the fixed preimage */2376while(ctx < preimage->nr &&2377!(preimage->line[ctx].flag & LINE_COMMON)) {2378 fixed += preimage->line[ctx].len;2379 ctx++;2380}23812382/*2383 * preimage is expected to run out, if the caller2384 * fixed addition of trailing blank lines.2385 */2386if(preimage->nr <= ctx) {2387 reduced++;2388continue;2389}23902391/* and copy it in, while fixing the line length */2392 l_len = preimage->line[ctx].len;2393memcpy(new, fixed, l_len);2394new+= l_len;2395 fixed += l_len;2396 postimage->line[i].len = l_len;2397 ctx++;2398}23992400if(postlen2401? postlen <new- postimage->buf2402: postimage->len <new- postimage->buf)2403die("BUG: caller miscounted postlen: asked%d, orig =%d, used =%d",2404(int)postlen, (int) postimage->len, (int)(new- postimage->buf));24052406/* Fix the length of the whole thing */2407 postimage->len =new- postimage->buf;2408 postimage->nr -= reduced;2409}24102411static intline_by_line_fuzzy_match(struct image *img,2412struct image *preimage,2413struct image *postimage,2414unsigned longtry,2415int try_lno,2416int preimage_limit)2417{2418int i;2419size_t imgoff =0;2420size_t preoff =0;2421size_t postlen = postimage->len;2422size_t extra_chars;2423char*buf;2424char*preimage_eof;2425char*preimage_end;2426struct strbuf fixed;2427char*fixed_buf;2428size_t fixed_len;24292430for(i =0; i < preimage_limit; i++) {2431size_t prelen = preimage->line[i].len;2432size_t imglen = img->line[try_lno+i].len;24332434if(!fuzzy_matchlines(img->buf +try+ imgoff, imglen,2435 preimage->buf + preoff, prelen))2436return0;2437if(preimage->line[i].flag & LINE_COMMON)2438 postlen += imglen - prelen;2439 imgoff += imglen;2440 preoff += prelen;2441}24422443/*2444 * Ok, the preimage matches with whitespace fuzz.2445 *2446 * imgoff now holds the true length of the target that2447 * matches the preimage before the end of the file.2448 *2449 * Count the number of characters in the preimage that fall2450 * beyond the end of the file and make sure that all of them2451 * are whitespace characters. (This can only happen if2452 * we are removing blank lines at the end of the file.)2453 */2454 buf = preimage_eof = preimage->buf + preoff;2455for( ; i < preimage->nr; i++)2456 preoff += preimage->line[i].len;2457 preimage_end = preimage->buf + preoff;2458for( ; buf < preimage_end; buf++)2459if(!isspace(*buf))2460return0;24612462/*2463 * Update the preimage and the common postimage context2464 * lines to use the same whitespace as the target.2465 * If whitespace is missing in the target (i.e.2466 * if the preimage extends beyond the end of the file),2467 * use the whitespace from the preimage.2468 */2469 extra_chars = preimage_end - preimage_eof;2470strbuf_init(&fixed, imgoff + extra_chars);2471strbuf_add(&fixed, img->buf +try, imgoff);2472strbuf_add(&fixed, preimage_eof, extra_chars);2473 fixed_buf =strbuf_detach(&fixed, &fixed_len);2474update_pre_post_images(preimage, postimage,2475 fixed_buf, fixed_len, postlen);2476return1;2477}24782479static intmatch_fragment(struct apply_state *state,2480struct image *img,2481struct image *preimage,2482struct image *postimage,2483unsigned longtry,2484int try_lno,2485unsigned ws_rule,2486int match_beginning,int match_end)2487{2488int i;2489char*fixed_buf, *buf, *orig, *target;2490struct strbuf fixed;2491size_t fixed_len, postlen;2492int preimage_limit;24932494if(preimage->nr + try_lno <= img->nr) {2495/*2496 * The hunk falls within the boundaries of img.2497 */2498 preimage_limit = preimage->nr;2499if(match_end && (preimage->nr + try_lno != img->nr))2500return0;2501}else if(state->ws_error_action == correct_ws_error &&2502(ws_rule & WS_BLANK_AT_EOF)) {2503/*2504 * This hunk extends beyond the end of img, and we are2505 * removing blank lines at the end of the file. This2506 * many lines from the beginning of the preimage must2507 * match with img, and the remainder of the preimage2508 * must be blank.2509 */2510 preimage_limit = img->nr - try_lno;2511}else{2512/*2513 * The hunk extends beyond the end of the img and2514 * we are not removing blanks at the end, so we2515 * should reject the hunk at this position.2516 */2517return0;2518}25192520if(match_beginning && try_lno)2521return0;25222523/* Quick hash check */2524for(i =0; i < preimage_limit; i++)2525if((img->line[try_lno + i].flag & LINE_PATCHED) ||2526(preimage->line[i].hash != img->line[try_lno + i].hash))2527return0;25282529if(preimage_limit == preimage->nr) {2530/*2531 * Do we have an exact match? If we were told to match2532 * at the end, size must be exactly at try+fragsize,2533 * otherwise try+fragsize must be still within the preimage,2534 * and either case, the old piece should match the preimage2535 * exactly.2536 */2537if((match_end2538? (try+ preimage->len == img->len)2539: (try+ preimage->len <= img->len)) &&2540!memcmp(img->buf +try, preimage->buf, preimage->len))2541return1;2542}else{2543/*2544 * The preimage extends beyond the end of img, so2545 * there cannot be an exact match.2546 *2547 * There must be one non-blank context line that match2548 * a line before the end of img.2549 */2550char*buf_end;25512552 buf = preimage->buf;2553 buf_end = buf;2554for(i =0; i < preimage_limit; i++)2555 buf_end += preimage->line[i].len;25562557for( ; buf < buf_end; buf++)2558if(!isspace(*buf))2559break;2560if(buf == buf_end)2561return0;2562}25632564/*2565 * No exact match. If we are ignoring whitespace, run a line-by-line2566 * fuzzy matching. We collect all the line length information because2567 * we need it to adjust whitespace if we match.2568 */2569if(state->ws_ignore_action == ignore_ws_change)2570returnline_by_line_fuzzy_match(img, preimage, postimage,2571try, try_lno, preimage_limit);25722573if(state->ws_error_action != correct_ws_error)2574return0;25752576/*2577 * The hunk does not apply byte-by-byte, but the hash says2578 * it might with whitespace fuzz. We weren't asked to2579 * ignore whitespace, we were asked to correct whitespace2580 * errors, so let's try matching after whitespace correction.2581 *2582 * While checking the preimage against the target, whitespace2583 * errors in both fixed, we count how large the corresponding2584 * postimage needs to be. The postimage prepared by2585 * apply_one_fragment() has whitespace errors fixed on added2586 * lines already, but the common lines were propagated as-is,2587 * which may become longer when their whitespace errors are2588 * fixed.2589 */25902591/* First count added lines in postimage */2592 postlen =0;2593for(i =0; i < postimage->nr; i++) {2594if(!(postimage->line[i].flag & LINE_COMMON))2595 postlen += postimage->line[i].len;2596}25972598/*2599 * The preimage may extend beyond the end of the file,2600 * but in this loop we will only handle the part of the2601 * preimage that falls within the file.2602 */2603strbuf_init(&fixed, preimage->len +1);2604 orig = preimage->buf;2605 target = img->buf +try;2606for(i =0; i < preimage_limit; i++) {2607size_t oldlen = preimage->line[i].len;2608size_t tgtlen = img->line[try_lno + i].len;2609size_t fixstart = fixed.len;2610struct strbuf tgtfix;2611int match;26122613/* Try fixing the line in the preimage */2614ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);26152616/* Try fixing the line in the target */2617strbuf_init(&tgtfix, tgtlen);2618ws_fix_copy(&tgtfix, target, tgtlen, ws_rule, NULL);26192620/*2621 * If they match, either the preimage was based on2622 * a version before our tree fixed whitespace breakage,2623 * or we are lacking a whitespace-fix patch the tree2624 * the preimage was based on already had (i.e. target2625 * has whitespace breakage, the preimage doesn't).2626 * In either case, we are fixing the whitespace breakages2627 * so we might as well take the fix together with their2628 * real change.2629 */2630 match = (tgtfix.len == fixed.len - fixstart &&2631!memcmp(tgtfix.buf, fixed.buf + fixstart,2632 fixed.len - fixstart));26332634/* Add the length if this is common with the postimage */2635if(preimage->line[i].flag & LINE_COMMON)2636 postlen += tgtfix.len;26372638strbuf_release(&tgtfix);2639if(!match)2640goto unmatch_exit;26412642 orig += oldlen;2643 target += tgtlen;2644}264526462647/*2648 * Now handle the lines in the preimage that falls beyond the2649 * end of the file (if any). They will only match if they are2650 * empty or only contain whitespace (if WS_BLANK_AT_EOL is2651 * false).2652 */2653for( ; i < preimage->nr; i++) {2654size_t fixstart = fixed.len;/* start of the fixed preimage */2655size_t oldlen = preimage->line[i].len;2656int j;26572658/* Try fixing the line in the preimage */2659ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);26602661for(j = fixstart; j < fixed.len; j++)2662if(!isspace(fixed.buf[j]))2663goto unmatch_exit;26642665 orig += oldlen;2666}26672668/*2669 * Yes, the preimage is based on an older version that still2670 * has whitespace breakages unfixed, and fixing them makes the2671 * hunk match. Update the context lines in the postimage.2672 */2673 fixed_buf =strbuf_detach(&fixed, &fixed_len);2674if(postlen < postimage->len)2675 postlen =0;2676update_pre_post_images(preimage, postimage,2677 fixed_buf, fixed_len, postlen);2678return1;26792680 unmatch_exit:2681strbuf_release(&fixed);2682return0;2683}26842685static intfind_pos(struct apply_state *state,2686struct image *img,2687struct image *preimage,2688struct image *postimage,2689int line,2690unsigned ws_rule,2691int match_beginning,int match_end)2692{2693int i;2694unsigned long backwards, forwards,try;2695int backwards_lno, forwards_lno, try_lno;26962697/*2698 * If match_beginning or match_end is specified, there is no2699 * point starting from a wrong line that will never match and2700 * wander around and wait for a match at the specified end.2701 */2702if(match_beginning)2703 line =0;2704else if(match_end)2705 line = img->nr - preimage->nr;27062707/*2708 * Because the comparison is unsigned, the following test2709 * will also take care of a negative line number that can2710 * result when match_end and preimage is larger than the target.2711 */2712if((size_t) line > img->nr)2713 line = img->nr;27142715try=0;2716for(i =0; i < line; i++)2717try+= img->line[i].len;27182719/*2720 * There's probably some smart way to do this, but I'll leave2721 * that to the smart and beautiful people. I'm simple and stupid.2722 */2723 backwards =try;2724 backwards_lno = line;2725 forwards =try;2726 forwards_lno = line;2727 try_lno = line;27282729for(i =0; ; i++) {2730if(match_fragment(state, img, preimage, postimage,2731try, try_lno, ws_rule,2732 match_beginning, match_end))2733return try_lno;27342735 again:2736if(backwards_lno ==0&& forwards_lno == img->nr)2737break;27382739if(i &1) {2740if(backwards_lno ==0) {2741 i++;2742goto again;2743}2744 backwards_lno--;2745 backwards -= img->line[backwards_lno].len;2746try= backwards;2747 try_lno = backwards_lno;2748}else{2749if(forwards_lno == img->nr) {2750 i++;2751goto again;2752}2753 forwards += img->line[forwards_lno].len;2754 forwards_lno++;2755try= forwards;2756 try_lno = forwards_lno;2757}27582759}2760return-1;2761}27622763static voidremove_first_line(struct image *img)2764{2765 img->buf += img->line[0].len;2766 img->len -= img->line[0].len;2767 img->line++;2768 img->nr--;2769}27702771static voidremove_last_line(struct image *img)2772{2773 img->len -= img->line[--img->nr].len;2774}27752776/*2777 * The change from "preimage" and "postimage" has been found to2778 * apply at applied_pos (counts in line numbers) in "img".2779 * Update "img" to remove "preimage" and replace it with "postimage".2780 */2781static voidupdate_image(struct apply_state *state,2782struct image *img,2783int applied_pos,2784struct image *preimage,2785struct image *postimage)2786{2787/*2788 * remove the copy of preimage at offset in img2789 * and replace it with postimage2790 */2791int i, nr;2792size_t remove_count, insert_count, applied_at =0;2793char*result;2794int preimage_limit;27952796/*2797 * If we are removing blank lines at the end of img,2798 * the preimage may extend beyond the end.2799 * If that is the case, we must be careful only to2800 * remove the part of the preimage that falls within2801 * the boundaries of img. Initialize preimage_limit2802 * to the number of lines in the preimage that falls2803 * within the boundaries.2804 */2805 preimage_limit = preimage->nr;2806if(preimage_limit > img->nr - applied_pos)2807 preimage_limit = img->nr - applied_pos;28082809for(i =0; i < applied_pos; i++)2810 applied_at += img->line[i].len;28112812 remove_count =0;2813for(i =0; i < preimage_limit; i++)2814 remove_count += img->line[applied_pos + i].len;2815 insert_count = postimage->len;28162817/* Adjust the contents */2818 result =xmalloc(st_add3(st_sub(img->len, remove_count), insert_count,1));2819memcpy(result, img->buf, applied_at);2820memcpy(result + applied_at, postimage->buf, postimage->len);2821memcpy(result + applied_at + postimage->len,2822 img->buf + (applied_at + remove_count),2823 img->len - (applied_at + remove_count));2824free(img->buf);2825 img->buf = result;2826 img->len += insert_count - remove_count;2827 result[img->len] ='\0';28282829/* Adjust the line table */2830 nr = img->nr + postimage->nr - preimage_limit;2831if(preimage_limit < postimage->nr) {2832/*2833 * NOTE: this knows that we never call remove_first_line()2834 * on anything other than pre/post image.2835 */2836REALLOC_ARRAY(img->line, nr);2837 img->line_allocated = img->line;2838}2839if(preimage_limit != postimage->nr)2840MOVE_ARRAY(img->line + applied_pos + postimage->nr,2841 img->line + applied_pos + preimage_limit,2842 img->nr - (applied_pos + preimage_limit));2843COPY_ARRAY(img->line + applied_pos, postimage->line, postimage->nr);2844if(!state->allow_overlap)2845for(i =0; i < postimage->nr; i++)2846 img->line[applied_pos + i].flag |= LINE_PATCHED;2847 img->nr = nr;2848}28492850/*2851 * Use the patch-hunk text in "frag" to prepare two images (preimage and2852 * postimage) for the hunk. Find lines that match "preimage" in "img" and2853 * replace the part of "img" with "postimage" text.2854 */2855static intapply_one_fragment(struct apply_state *state,2856struct image *img,struct fragment *frag,2857int inaccurate_eof,unsigned ws_rule,2858int nth_fragment)2859{2860int match_beginning, match_end;2861const char*patch = frag->patch;2862int size = frag->size;2863char*old, *oldlines;2864struct strbuf newlines;2865int new_blank_lines_at_end =0;2866int found_new_blank_lines_at_end =0;2867int hunk_linenr = frag->linenr;2868unsigned long leading, trailing;2869int pos, applied_pos;2870struct image preimage;2871struct image postimage;28722873memset(&preimage,0,sizeof(preimage));2874memset(&postimage,0,sizeof(postimage));2875 oldlines =xmalloc(size);2876strbuf_init(&newlines, size);28772878 old = oldlines;2879while(size >0) {2880char first;2881int len =linelen(patch, size);2882int plen;2883int added_blank_line =0;2884int is_blank_context =0;2885size_t start;28862887if(!len)2888break;28892890/*2891 * "plen" is how much of the line we should use for2892 * the actual patch data. Normally we just remove the2893 * first character on the line, but if the line is2894 * followed by "\ No newline", then we also remove the2895 * last one (which is the newline, of course).2896 */2897 plen = len -1;2898if(len < size && patch[len] =='\\')2899 plen--;2900 first = *patch;2901if(state->apply_in_reverse) {2902if(first =='-')2903 first ='+';2904else if(first =='+')2905 first ='-';2906}29072908switch(first) {2909case'\n':2910/* Newer GNU diff, empty context line */2911if(plen <0)2912/* ... followed by '\No newline'; nothing */2913break;2914*old++ ='\n';2915strbuf_addch(&newlines,'\n');2916add_line_info(&preimage,"\n",1, LINE_COMMON);2917add_line_info(&postimage,"\n",1, LINE_COMMON);2918 is_blank_context =1;2919break;2920case' ':2921if(plen && (ws_rule & WS_BLANK_AT_EOF) &&2922ws_blank_line(patch +1, plen, ws_rule))2923 is_blank_context =1;2924case'-':2925memcpy(old, patch +1, plen);2926add_line_info(&preimage, old, plen,2927(first ==' '? LINE_COMMON :0));2928 old += plen;2929if(first =='-')2930break;2931/* Fall-through for ' ' */2932case'+':2933/* --no-add does not add new lines */2934if(first =='+'&& state->no_add)2935break;29362937 start = newlines.len;2938if(first !='+'||2939!state->whitespace_error ||2940 state->ws_error_action != correct_ws_error) {2941strbuf_add(&newlines, patch +1, plen);2942}2943else{2944ws_fix_copy(&newlines, patch +1, plen, ws_rule, &state->applied_after_fixing_ws);2945}2946add_line_info(&postimage, newlines.buf + start, newlines.len - start,2947(first =='+'?0: LINE_COMMON));2948if(first =='+'&&2949(ws_rule & WS_BLANK_AT_EOF) &&2950ws_blank_line(patch +1, plen, ws_rule))2951 added_blank_line =1;2952break;2953case'@':case'\\':2954/* Ignore it, we already handled it */2955break;2956default:2957if(state->apply_verbosity > verbosity_normal)2958error(_("invalid start of line: '%c'"), first);2959 applied_pos = -1;2960goto out;2961}2962if(added_blank_line) {2963if(!new_blank_lines_at_end)2964 found_new_blank_lines_at_end = hunk_linenr;2965 new_blank_lines_at_end++;2966}2967else if(is_blank_context)2968;2969else2970 new_blank_lines_at_end =0;2971 patch += len;2972 size -= len;2973 hunk_linenr++;2974}2975if(inaccurate_eof &&2976 old > oldlines && old[-1] =='\n'&&2977 newlines.len >0&& newlines.buf[newlines.len -1] =='\n') {2978 old--;2979strbuf_setlen(&newlines, newlines.len -1);2980}29812982 leading = frag->leading;2983 trailing = frag->trailing;29842985/*2986 * A hunk to change lines at the beginning would begin with2987 * @@ -1,L +N,M @@2988 * but we need to be careful. -U0 that inserts before the second2989 * line also has this pattern.2990 *2991 * And a hunk to add to an empty file would begin with2992 * @@ -0,0 +N,M @@2993 *2994 * In other words, a hunk that is (frag->oldpos <= 1) with or2995 * without leading context must match at the beginning.2996 */2997 match_beginning = (!frag->oldpos ||2998(frag->oldpos ==1&& !state->unidiff_zero));29993000/*3001 * A hunk without trailing lines must match at the end.3002 * However, we simply cannot tell if a hunk must match end3003 * from the lack of trailing lines if the patch was generated3004 * with unidiff without any context.3005 */3006 match_end = !state->unidiff_zero && !trailing;30073008 pos = frag->newpos ? (frag->newpos -1) :0;3009 preimage.buf = oldlines;3010 preimage.len = old - oldlines;3011 postimage.buf = newlines.buf;3012 postimage.len = newlines.len;3013 preimage.line = preimage.line_allocated;3014 postimage.line = postimage.line_allocated;30153016for(;;) {30173018 applied_pos =find_pos(state, img, &preimage, &postimage, pos,3019 ws_rule, match_beginning, match_end);30203021if(applied_pos >=0)3022break;30233024/* Am I at my context limits? */3025if((leading <= state->p_context) && (trailing <= state->p_context))3026break;3027if(match_beginning || match_end) {3028 match_beginning = match_end =0;3029continue;3030}30313032/*3033 * Reduce the number of context lines; reduce both3034 * leading and trailing if they are equal otherwise3035 * just reduce the larger context.3036 */3037if(leading >= trailing) {3038remove_first_line(&preimage);3039remove_first_line(&postimage);3040 pos--;3041 leading--;3042}3043if(trailing > leading) {3044remove_last_line(&preimage);3045remove_last_line(&postimage);3046 trailing--;3047}3048}30493050if(applied_pos >=0) {3051if(new_blank_lines_at_end &&3052 preimage.nr + applied_pos >= img->nr &&3053(ws_rule & WS_BLANK_AT_EOF) &&3054 state->ws_error_action != nowarn_ws_error) {3055record_ws_error(state, WS_BLANK_AT_EOF,"+",1,3056 found_new_blank_lines_at_end);3057if(state->ws_error_action == correct_ws_error) {3058while(new_blank_lines_at_end--)3059remove_last_line(&postimage);3060}3061/*3062 * We would want to prevent write_out_results()3063 * from taking place in apply_patch() that follows3064 * the callchain led us here, which is:3065 * apply_patch->check_patch_list->check_patch->3066 * apply_data->apply_fragments->apply_one_fragment3067 */3068if(state->ws_error_action == die_on_ws_error)3069 state->apply =0;3070}30713072if(state->apply_verbosity > verbosity_normal && applied_pos != pos) {3073int offset = applied_pos - pos;3074if(state->apply_in_reverse)3075 offset =0- offset;3076fprintf_ln(stderr,3077Q_("Hunk #%dsucceeded at%d(offset%dline).",3078"Hunk #%dsucceeded at%d(offset%dlines).",3079 offset),3080 nth_fragment, applied_pos +1, offset);3081}30823083/*3084 * Warn if it was necessary to reduce the number3085 * of context lines.3086 */3087if((leading != frag->leading ||3088 trailing != frag->trailing) && state->apply_verbosity > verbosity_silent)3089fprintf_ln(stderr,_("Context reduced to (%ld/%ld)"3090" to apply fragment at%d"),3091 leading, trailing, applied_pos+1);3092update_image(state, img, applied_pos, &preimage, &postimage);3093}else{3094if(state->apply_verbosity > verbosity_normal)3095error(_("while searching for:\n%.*s"),3096(int)(old - oldlines), oldlines);3097}30983099out:3100free(oldlines);3101strbuf_release(&newlines);3102free(preimage.line_allocated);3103free(postimage.line_allocated);31043105return(applied_pos <0);3106}31073108static intapply_binary_fragment(struct apply_state *state,3109struct image *img,3110struct patch *patch)3111{3112struct fragment *fragment = patch->fragments;3113unsigned long len;3114void*dst;31153116if(!fragment)3117returnerror(_("missing binary patch data for '%s'"),3118 patch->new_name ?3119 patch->new_name :3120 patch->old_name);31213122/* Binary patch is irreversible without the optional second hunk */3123if(state->apply_in_reverse) {3124if(!fragment->next)3125returnerror(_("cannot reverse-apply a binary patch "3126"without the reverse hunk to '%s'"),3127 patch->new_name3128? patch->new_name : patch->old_name);3129 fragment = fragment->next;3130}3131switch(fragment->binary_patch_method) {3132case BINARY_DELTA_DEFLATED:3133 dst =patch_delta(img->buf, img->len, fragment->patch,3134 fragment->size, &len);3135if(!dst)3136return-1;3137clear_image(img);3138 img->buf = dst;3139 img->len = len;3140return0;3141case BINARY_LITERAL_DEFLATED:3142clear_image(img);3143 img->len = fragment->size;3144 img->buf =xmemdupz(fragment->patch, img->len);3145return0;3146}3147return-1;3148}31493150/*3151 * Replace "img" with the result of applying the binary patch.3152 * The binary patch data itself in patch->fragment is still kept3153 * but the preimage prepared by the caller in "img" is freed here3154 * or in the helper function apply_binary_fragment() this calls.3155 */3156static intapply_binary(struct apply_state *state,3157struct image *img,3158struct patch *patch)3159{3160const char*name = patch->old_name ? patch->old_name : patch->new_name;3161struct object_id oid;31623163/*3164 * For safety, we require patch index line to contain3165 * full 40-byte textual SHA1 for old and new, at least for now.3166 */3167if(strlen(patch->old_sha1_prefix) !=40||3168strlen(patch->new_sha1_prefix) !=40||3169get_oid_hex(patch->old_sha1_prefix, &oid) ||3170get_oid_hex(patch->new_sha1_prefix, &oid))3171returnerror(_("cannot apply binary patch to '%s' "3172"without full index line"), name);31733174if(patch->old_name) {3175/*3176 * See if the old one matches what the patch3177 * applies to.3178 */3179hash_sha1_file(img->buf, img->len, blob_type, oid.hash);3180if(strcmp(oid_to_hex(&oid), patch->old_sha1_prefix))3181returnerror(_("the patch applies to '%s' (%s), "3182"which does not match the "3183"current contents."),3184 name,oid_to_hex(&oid));3185}3186else{3187/* Otherwise, the old one must be empty. */3188if(img->len)3189returnerror(_("the patch applies to an empty "3190"'%s' but it is not empty"), name);3191}31923193get_oid_hex(patch->new_sha1_prefix, &oid);3194if(is_null_oid(&oid)) {3195clear_image(img);3196return0;/* deletion patch */3197}31983199if(has_sha1_file(oid.hash)) {3200/* We already have the postimage */3201enum object_type type;3202unsigned long size;3203char*result;32043205 result =read_sha1_file(oid.hash, &type, &size);3206if(!result)3207returnerror(_("the necessary postimage%sfor "3208"'%s' cannot be read"),3209 patch->new_sha1_prefix, name);3210clear_image(img);3211 img->buf = result;3212 img->len = size;3213}else{3214/*3215 * We have verified buf matches the preimage;3216 * apply the patch data to it, which is stored3217 * in the patch->fragments->{patch,size}.3218 */3219if(apply_binary_fragment(state, img, patch))3220returnerror(_("binary patch does not apply to '%s'"),3221 name);32223223/* verify that the result matches */3224hash_sha1_file(img->buf, img->len, blob_type, oid.hash);3225if(strcmp(oid_to_hex(&oid), patch->new_sha1_prefix))3226returnerror(_("binary patch to '%s' creates incorrect result (expecting%s, got%s)"),3227 name, patch->new_sha1_prefix,oid_to_hex(&oid));3228}32293230return0;3231}32323233static intapply_fragments(struct apply_state *state,struct image *img,struct patch *patch)3234{3235struct fragment *frag = patch->fragments;3236const char*name = patch->old_name ? patch->old_name : patch->new_name;3237unsigned ws_rule = patch->ws_rule;3238unsigned inaccurate_eof = patch->inaccurate_eof;3239int nth =0;32403241if(patch->is_binary)3242returnapply_binary(state, img, patch);32433244while(frag) {3245 nth++;3246if(apply_one_fragment(state, img, frag, inaccurate_eof, ws_rule, nth)) {3247error(_("patch failed:%s:%ld"), name, frag->oldpos);3248if(!state->apply_with_reject)3249return-1;3250 frag->rejected =1;3251}3252 frag = frag->next;3253}3254return0;3255}32563257static intread_blob_object(struct strbuf *buf,const struct object_id *oid,unsigned mode)3258{3259if(S_ISGITLINK(mode)) {3260strbuf_grow(buf,100);3261strbuf_addf(buf,"Subproject commit%s\n",oid_to_hex(oid));3262}else{3263enum object_type type;3264unsigned long sz;3265char*result;32663267 result =read_sha1_file(oid->hash, &type, &sz);3268if(!result)3269return-1;3270/* XXX read_sha1_file NUL-terminates */3271strbuf_attach(buf, result, sz, sz +1);3272}3273return0;3274}32753276static intread_file_or_gitlink(const struct cache_entry *ce,struct strbuf *buf)3277{3278if(!ce)3279return0;3280returnread_blob_object(buf, &ce->oid, ce->ce_mode);3281}32823283static struct patch *in_fn_table(struct apply_state *state,const char*name)3284{3285struct string_list_item *item;32863287if(name == NULL)3288return NULL;32893290 item =string_list_lookup(&state->fn_table, name);3291if(item != NULL)3292return(struct patch *)item->util;32933294return NULL;3295}32963297/*3298 * item->util in the filename table records the status of the path.3299 * Usually it points at a patch (whose result records the contents3300 * of it after applying it), but it could be PATH_WAS_DELETED for a3301 * path that a previously applied patch has already removed, or3302 * PATH_TO_BE_DELETED for a path that a later patch would remove.3303 *3304 * The latter is needed to deal with a case where two paths A and B3305 * are swapped by first renaming A to B and then renaming B to A;3306 * moving A to B should not be prevented due to presence of B as we3307 * will remove it in a later patch.3308 */3309#define PATH_TO_BE_DELETED ((struct patch *) -2)3310#define PATH_WAS_DELETED ((struct patch *) -1)33113312static intto_be_deleted(struct patch *patch)3313{3314return patch == PATH_TO_BE_DELETED;3315}33163317static intwas_deleted(struct patch *patch)3318{3319return patch == PATH_WAS_DELETED;3320}33213322static voidadd_to_fn_table(struct apply_state *state,struct patch *patch)3323{3324struct string_list_item *item;33253326/*3327 * Always add new_name unless patch is a deletion3328 * This should cover the cases for normal diffs,3329 * file creations and copies3330 */3331if(patch->new_name != NULL) {3332 item =string_list_insert(&state->fn_table, patch->new_name);3333 item->util = patch;3334}33353336/*3337 * store a failure on rename/deletion cases because3338 * later chunks shouldn't patch old names3339 */3340if((patch->new_name == NULL) || (patch->is_rename)) {3341 item =string_list_insert(&state->fn_table, patch->old_name);3342 item->util = PATH_WAS_DELETED;3343}3344}33453346static voidprepare_fn_table(struct apply_state *state,struct patch *patch)3347{3348/*3349 * store information about incoming file deletion3350 */3351while(patch) {3352if((patch->new_name == NULL) || (patch->is_rename)) {3353struct string_list_item *item;3354 item =string_list_insert(&state->fn_table, patch->old_name);3355 item->util = PATH_TO_BE_DELETED;3356}3357 patch = patch->next;3358}3359}33603361static intcheckout_target(struct index_state *istate,3362struct cache_entry *ce,struct stat *st)3363{3364struct checkout costate = CHECKOUT_INIT;33653366 costate.refresh_cache =1;3367 costate.istate = istate;3368if(checkout_entry(ce, &costate, NULL) ||lstat(ce->name, st))3369returnerror(_("cannot checkout%s"), ce->name);3370return0;3371}33723373static struct patch *previous_patch(struct apply_state *state,3374struct patch *patch,3375int*gone)3376{3377struct patch *previous;33783379*gone =0;3380if(patch->is_copy || patch->is_rename)3381return NULL;/* "git" patches do not depend on the order */33823383 previous =in_fn_table(state, patch->old_name);3384if(!previous)3385return NULL;33863387if(to_be_deleted(previous))3388return NULL;/* the deletion hasn't happened yet */33893390if(was_deleted(previous))3391*gone =1;33923393return previous;3394}33953396static intverify_index_match(const struct cache_entry *ce,struct stat *st)3397{3398if(S_ISGITLINK(ce->ce_mode)) {3399if(!S_ISDIR(st->st_mode))3400return-1;3401return0;3402}3403returnce_match_stat(ce, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);3404}34053406#define SUBMODULE_PATCH_WITHOUT_INDEX 134073408static intload_patch_target(struct apply_state *state,3409struct strbuf *buf,3410const struct cache_entry *ce,3411struct stat *st,3412struct patch *patch,3413const char*name,3414unsigned expected_mode)3415{3416if(state->cached || state->check_index) {3417if(read_file_or_gitlink(ce, buf))3418returnerror(_("failed to read%s"), name);3419}else if(name) {3420if(S_ISGITLINK(expected_mode)) {3421if(ce)3422returnread_file_or_gitlink(ce, buf);3423else3424return SUBMODULE_PATCH_WITHOUT_INDEX;3425}else if(has_symlink_leading_path(name,strlen(name))) {3426returnerror(_("reading from '%s' beyond a symbolic link"), name);3427}else{3428if(read_old_data(st, patch, name, buf))3429returnerror(_("failed to read%s"), name);3430}3431}3432return0;3433}34343435/*3436 * We are about to apply "patch"; populate the "image" with the3437 * current version we have, from the working tree or from the index,3438 * depending on the situation e.g. --cached/--index. If we are3439 * applying a non-git patch that incrementally updates the tree,3440 * we read from the result of a previous diff.3441 */3442static intload_preimage(struct apply_state *state,3443struct image *image,3444struct patch *patch,struct stat *st,3445const struct cache_entry *ce)3446{3447struct strbuf buf = STRBUF_INIT;3448size_t len;3449char*img;3450struct patch *previous;3451int status;34523453 previous =previous_patch(state, patch, &status);3454if(status)3455returnerror(_("path%shas been renamed/deleted"),3456 patch->old_name);3457if(previous) {3458/* We have a patched copy in memory; use that. */3459strbuf_add(&buf, previous->result, previous->resultsize);3460}else{3461 status =load_patch_target(state, &buf, ce, st, patch,3462 patch->old_name, patch->old_mode);3463if(status <0)3464return status;3465else if(status == SUBMODULE_PATCH_WITHOUT_INDEX) {3466/*3467 * There is no way to apply subproject3468 * patch without looking at the index.3469 * NEEDSWORK: shouldn't this be flagged3470 * as an error???3471 */3472free_fragment_list(patch->fragments);3473 patch->fragments = NULL;3474}else if(status) {3475returnerror(_("failed to read%s"), patch->old_name);3476}3477}34783479 img =strbuf_detach(&buf, &len);3480prepare_image(image, img, len, !patch->is_binary);3481return0;3482}34833484static intthree_way_merge(struct image *image,3485char*path,3486const struct object_id *base,3487const struct object_id *ours,3488const struct object_id *theirs)3489{3490 mmfile_t base_file, our_file, their_file;3491 mmbuffer_t result = { NULL };3492int status;34933494read_mmblob(&base_file, base);3495read_mmblob(&our_file, ours);3496read_mmblob(&their_file, theirs);3497 status =ll_merge(&result, path,3498&base_file,"base",3499&our_file,"ours",3500&their_file,"theirs", NULL);3501free(base_file.ptr);3502free(our_file.ptr);3503free(their_file.ptr);3504if(status <0|| !result.ptr) {3505free(result.ptr);3506return-1;3507}3508clear_image(image);3509 image->buf = result.ptr;3510 image->len = result.size;35113512return status;3513}35143515/*3516 * When directly falling back to add/add three-way merge, we read from3517 * the current contents of the new_name. In no cases other than that3518 * this function will be called.3519 */3520static intload_current(struct apply_state *state,3521struct image *image,3522struct patch *patch)3523{3524struct strbuf buf = STRBUF_INIT;3525int status, pos;3526size_t len;3527char*img;3528struct stat st;3529struct cache_entry *ce;3530char*name = patch->new_name;3531unsigned mode = patch->new_mode;35323533if(!patch->is_new)3534die("BUG: patch to%sis not a creation", patch->old_name);35353536 pos =cache_name_pos(name,strlen(name));3537if(pos <0)3538returnerror(_("%s: does not exist in index"), name);3539 ce = active_cache[pos];3540if(lstat(name, &st)) {3541if(errno != ENOENT)3542returnerror_errno("%s", name);3543if(checkout_target(&the_index, ce, &st))3544return-1;3545}3546if(verify_index_match(ce, &st))3547returnerror(_("%s: does not match index"), name);35483549 status =load_patch_target(state, &buf, ce, &st, patch, name, mode);3550if(status <0)3551return status;3552else if(status)3553return-1;3554 img =strbuf_detach(&buf, &len);3555prepare_image(image, img, len, !patch->is_binary);3556return0;3557}35583559static inttry_threeway(struct apply_state *state,3560struct image *image,3561struct patch *patch,3562struct stat *st,3563const struct cache_entry *ce)3564{3565struct object_id pre_oid, post_oid, our_oid;3566struct strbuf buf = STRBUF_INIT;3567size_t len;3568int status;3569char*img;3570struct image tmp_image;35713572/* No point falling back to 3-way merge in these cases */3573if(patch->is_delete ||3574S_ISGITLINK(patch->old_mode) ||S_ISGITLINK(patch->new_mode))3575return-1;35763577/* Preimage the patch was prepared for */3578if(patch->is_new)3579write_sha1_file("",0, blob_type, pre_oid.hash);3580else if(get_oid(patch->old_sha1_prefix, &pre_oid) ||3581read_blob_object(&buf, &pre_oid, patch->old_mode))3582returnerror(_("repository lacks the necessary blob to fall back on 3-way merge."));35833584if(state->apply_verbosity > verbosity_silent)3585fprintf(stderr,_("Falling back to three-way merge...\n"));35863587 img =strbuf_detach(&buf, &len);3588prepare_image(&tmp_image, img, len,1);3589/* Apply the patch to get the post image */3590if(apply_fragments(state, &tmp_image, patch) <0) {3591clear_image(&tmp_image);3592return-1;3593}3594/* post_oid is theirs */3595write_sha1_file(tmp_image.buf, tmp_image.len, blob_type, post_oid.hash);3596clear_image(&tmp_image);35973598/* our_oid is ours */3599if(patch->is_new) {3600if(load_current(state, &tmp_image, patch))3601returnerror(_("cannot read the current contents of '%s'"),3602 patch->new_name);3603}else{3604if(load_preimage(state, &tmp_image, patch, st, ce))3605returnerror(_("cannot read the current contents of '%s'"),3606 patch->old_name);3607}3608write_sha1_file(tmp_image.buf, tmp_image.len, blob_type, our_oid.hash);3609clear_image(&tmp_image);36103611/* in-core three-way merge between post and our using pre as base */3612 status =three_way_merge(image, patch->new_name,3613&pre_oid, &our_oid, &post_oid);3614if(status <0) {3615if(state->apply_verbosity > verbosity_silent)3616fprintf(stderr,3617_("Failed to fall back on three-way merge...\n"));3618return status;3619}36203621if(status) {3622 patch->conflicted_threeway =1;3623if(patch->is_new)3624oidclr(&patch->threeway_stage[0]);3625else3626oidcpy(&patch->threeway_stage[0], &pre_oid);3627oidcpy(&patch->threeway_stage[1], &our_oid);3628oidcpy(&patch->threeway_stage[2], &post_oid);3629if(state->apply_verbosity > verbosity_silent)3630fprintf(stderr,3631_("Applied patch to '%s' with conflicts.\n"),3632 patch->new_name);3633}else{3634if(state->apply_verbosity > verbosity_silent)3635fprintf(stderr,3636_("Applied patch to '%s' cleanly.\n"),3637 patch->new_name);3638}3639return0;3640}36413642static intapply_data(struct apply_state *state,struct patch *patch,3643struct stat *st,const struct cache_entry *ce)3644{3645struct image image;36463647if(load_preimage(state, &image, patch, st, ce) <0)3648return-1;36493650if(patch->direct_to_threeway ||3651apply_fragments(state, &image, patch) <0) {3652/* Note: with --reject, apply_fragments() returns 0 */3653if(!state->threeway ||try_threeway(state, &image, patch, st, ce) <0)3654return-1;3655}3656 patch->result = image.buf;3657 patch->resultsize = image.len;3658add_to_fn_table(state, patch);3659free(image.line_allocated);36603661if(0< patch->is_delete && patch->resultsize)3662returnerror(_("removal patch leaves file contents"));36633664return0;3665}36663667/*3668 * If "patch" that we are looking at modifies or deletes what we have,3669 * we would want it not to lose any local modification we have, either3670 * in the working tree or in the index.3671 *3672 * This also decides if a non-git patch is a creation patch or a3673 * modification to an existing empty file. We do not check the state3674 * of the current tree for a creation patch in this function; the caller3675 * check_patch() separately makes sure (and errors out otherwise) that3676 * the path the patch creates does not exist in the current tree.3677 */3678static intcheck_preimage(struct apply_state *state,3679struct patch *patch,3680struct cache_entry **ce,3681struct stat *st)3682{3683const char*old_name = patch->old_name;3684struct patch *previous = NULL;3685int stat_ret =0, status;3686unsigned st_mode =0;36873688if(!old_name)3689return0;36903691assert(patch->is_new <=0);3692 previous =previous_patch(state, patch, &status);36933694if(status)3695returnerror(_("path%shas been renamed/deleted"), old_name);3696if(previous) {3697 st_mode = previous->new_mode;3698}else if(!state->cached) {3699 stat_ret =lstat(old_name, st);3700if(stat_ret && errno != ENOENT)3701returnerror_errno("%s", old_name);3702}37033704if(state->check_index && !previous) {3705int pos =cache_name_pos(old_name,strlen(old_name));3706if(pos <0) {3707if(patch->is_new <0)3708goto is_new;3709returnerror(_("%s: does not exist in index"), old_name);3710}3711*ce = active_cache[pos];3712if(stat_ret <0) {3713if(checkout_target(&the_index, *ce, st))3714return-1;3715}3716if(!state->cached &&verify_index_match(*ce, st))3717returnerror(_("%s: does not match index"), old_name);3718if(state->cached)3719 st_mode = (*ce)->ce_mode;3720}else if(stat_ret <0) {3721if(patch->is_new <0)3722goto is_new;3723returnerror_errno("%s", old_name);3724}37253726if(!state->cached && !previous)3727 st_mode =ce_mode_from_stat(*ce, st->st_mode);37283729if(patch->is_new <0)3730 patch->is_new =0;3731if(!patch->old_mode)3732 patch->old_mode = st_mode;3733if((st_mode ^ patch->old_mode) & S_IFMT)3734returnerror(_("%s: wrong type"), old_name);3735if(st_mode != patch->old_mode)3736warning(_("%shas type%o, expected%o"),3737 old_name, st_mode, patch->old_mode);3738if(!patch->new_mode && !patch->is_delete)3739 patch->new_mode = st_mode;3740return0;37413742 is_new:3743 patch->is_new =1;3744 patch->is_delete =0;3745FREE_AND_NULL(patch->old_name);3746return0;3747}374837493750#define EXISTS_IN_INDEX 13751#define EXISTS_IN_WORKTREE 237523753static intcheck_to_create(struct apply_state *state,3754const char*new_name,3755int ok_if_exists)3756{3757struct stat nst;37583759if(state->check_index &&3760cache_name_pos(new_name,strlen(new_name)) >=0&&3761!ok_if_exists)3762return EXISTS_IN_INDEX;3763if(state->cached)3764return0;37653766if(!lstat(new_name, &nst)) {3767if(S_ISDIR(nst.st_mode) || ok_if_exists)3768return0;3769/*3770 * A leading component of new_name might be a symlink3771 * that is going to be removed with this patch, but3772 * still pointing at somewhere that has the path.3773 * In such a case, path "new_name" does not exist as3774 * far as git is concerned.3775 */3776if(has_symlink_leading_path(new_name,strlen(new_name)))3777return0;37783779return EXISTS_IN_WORKTREE;3780}else if(!is_missing_file_error(errno)) {3781returnerror_errno("%s", new_name);3782}3783return0;3784}37853786static uintptr_tregister_symlink_changes(struct apply_state *state,3787const char*path,3788uintptr_t what)3789{3790struct string_list_item *ent;37913792 ent =string_list_lookup(&state->symlink_changes, path);3793if(!ent) {3794 ent =string_list_insert(&state->symlink_changes, path);3795 ent->util = (void*)0;3796}3797 ent->util = (void*)(what | ((uintptr_t)ent->util));3798return(uintptr_t)ent->util;3799}38003801static uintptr_tcheck_symlink_changes(struct apply_state *state,const char*path)3802{3803struct string_list_item *ent;38043805 ent =string_list_lookup(&state->symlink_changes, path);3806if(!ent)3807return0;3808return(uintptr_t)ent->util;3809}38103811static voidprepare_symlink_changes(struct apply_state *state,struct patch *patch)3812{3813for( ; patch; patch = patch->next) {3814if((patch->old_name &&S_ISLNK(patch->old_mode)) &&3815(patch->is_rename || patch->is_delete))3816/* the symlink at patch->old_name is removed */3817register_symlink_changes(state, patch->old_name, APPLY_SYMLINK_GOES_AWAY);38183819if(patch->new_name &&S_ISLNK(patch->new_mode))3820/* the symlink at patch->new_name is created or remains */3821register_symlink_changes(state, patch->new_name, APPLY_SYMLINK_IN_RESULT);3822}3823}38243825static intpath_is_beyond_symlink_1(struct apply_state *state,struct strbuf *name)3826{3827do{3828unsigned int change;38293830while(--name->len && name->buf[name->len] !='/')3831;/* scan backwards */3832if(!name->len)3833break;3834 name->buf[name->len] ='\0';3835 change =check_symlink_changes(state, name->buf);3836if(change & APPLY_SYMLINK_IN_RESULT)3837return1;3838if(change & APPLY_SYMLINK_GOES_AWAY)3839/*3840 * This cannot be "return 0", because we may3841 * see a new one created at a higher level.3842 */3843continue;38443845/* otherwise, check the preimage */3846if(state->check_index) {3847struct cache_entry *ce;38483849 ce =cache_file_exists(name->buf, name->len, ignore_case);3850if(ce &&S_ISLNK(ce->ce_mode))3851return1;3852}else{3853struct stat st;3854if(!lstat(name->buf, &st) &&S_ISLNK(st.st_mode))3855return1;3856}3857}while(1);3858return0;3859}38603861static intpath_is_beyond_symlink(struct apply_state *state,const char*name_)3862{3863int ret;3864struct strbuf name = STRBUF_INIT;38653866assert(*name_ !='\0');3867strbuf_addstr(&name, name_);3868 ret =path_is_beyond_symlink_1(state, &name);3869strbuf_release(&name);38703871return ret;3872}38733874static intcheck_unsafe_path(struct patch *patch)3875{3876const char*old_name = NULL;3877const char*new_name = NULL;3878if(patch->is_delete)3879 old_name = patch->old_name;3880else if(!patch->is_new && !patch->is_copy)3881 old_name = patch->old_name;3882if(!patch->is_delete)3883 new_name = patch->new_name;38843885if(old_name && !verify_path(old_name))3886returnerror(_("invalid path '%s'"), old_name);3887if(new_name && !verify_path(new_name))3888returnerror(_("invalid path '%s'"), new_name);3889return0;3890}38913892/*3893 * Check and apply the patch in-core; leave the result in patch->result3894 * for the caller to write it out to the final destination.3895 */3896static intcheck_patch(struct apply_state *state,struct patch *patch)3897{3898struct stat st;3899const char*old_name = patch->old_name;3900const char*new_name = patch->new_name;3901const char*name = old_name ? old_name : new_name;3902struct cache_entry *ce = NULL;3903struct patch *tpatch;3904int ok_if_exists;3905int status;39063907 patch->rejected =1;/* we will drop this after we succeed */39083909 status =check_preimage(state, patch, &ce, &st);3910if(status)3911return status;3912 old_name = patch->old_name;39133914/*3915 * A type-change diff is always split into a patch to delete3916 * old, immediately followed by a patch to create new (see3917 * diff.c::run_diff()); in such a case it is Ok that the entry3918 * to be deleted by the previous patch is still in the working3919 * tree and in the index.3920 *3921 * A patch to swap-rename between A and B would first rename A3922 * to B and then rename B to A. While applying the first one,3923 * the presence of B should not stop A from getting renamed to3924 * B; ask to_be_deleted() about the later rename. Removal of3925 * B and rename from A to B is handled the same way by asking3926 * was_deleted().3927 */3928if((tpatch =in_fn_table(state, new_name)) &&3929(was_deleted(tpatch) ||to_be_deleted(tpatch)))3930 ok_if_exists =1;3931else3932 ok_if_exists =0;39333934if(new_name &&3935((0< patch->is_new) || patch->is_rename || patch->is_copy)) {3936int err =check_to_create(state, new_name, ok_if_exists);39373938if(err && state->threeway) {3939 patch->direct_to_threeway =1;3940}else switch(err) {3941case0:3942break;/* happy */3943case EXISTS_IN_INDEX:3944returnerror(_("%s: already exists in index"), new_name);3945break;3946case EXISTS_IN_WORKTREE:3947returnerror(_("%s: already exists in working directory"),3948 new_name);3949default:3950return err;3951}39523953if(!patch->new_mode) {3954if(0< patch->is_new)3955 patch->new_mode = S_IFREG |0644;3956else3957 patch->new_mode = patch->old_mode;3958}3959}39603961if(new_name && old_name) {3962int same = !strcmp(old_name, new_name);3963if(!patch->new_mode)3964 patch->new_mode = patch->old_mode;3965if((patch->old_mode ^ patch->new_mode) & S_IFMT) {3966if(same)3967returnerror(_("new mode (%o) of%sdoes not "3968"match old mode (%o)"),3969 patch->new_mode, new_name,3970 patch->old_mode);3971else3972returnerror(_("new mode (%o) of%sdoes not "3973"match old mode (%o) of%s"),3974 patch->new_mode, new_name,3975 patch->old_mode, old_name);3976}3977}39783979if(!state->unsafe_paths &&check_unsafe_path(patch))3980return-128;39813982/*3983 * An attempt to read from or delete a path that is beyond a3984 * symbolic link will be prevented by load_patch_target() that3985 * is called at the beginning of apply_data() so we do not3986 * have to worry about a patch marked with "is_delete" bit3987 * here. We however need to make sure that the patch result3988 * is not deposited to a path that is beyond a symbolic link3989 * here.3990 */3991if(!patch->is_delete &&path_is_beyond_symlink(state, patch->new_name))3992returnerror(_("affected file '%s' is beyond a symbolic link"),3993 patch->new_name);39943995if(apply_data(state, patch, &st, ce) <0)3996returnerror(_("%s: patch does not apply"), name);3997 patch->rejected =0;3998return0;3999}40004001static intcheck_patch_list(struct apply_state *state,struct patch *patch)4002{4003int err =0;40044005prepare_symlink_changes(state, patch);4006prepare_fn_table(state, patch);4007while(patch) {4008int res;4009if(state->apply_verbosity > verbosity_normal)4010say_patch_name(stderr,4011_("Checking patch%s..."), patch);4012 res =check_patch(state, patch);4013if(res == -128)4014return-128;4015 err |= res;4016 patch = patch->next;4017}4018return err;4019}40204021static intread_apply_cache(struct apply_state *state)4022{4023if(state->index_file)4024returnread_cache_from(state->index_file);4025else4026returnread_cache();4027}40284029/* This function tries to read the object name from the current index */4030static intget_current_oid(struct apply_state *state,const char*path,4031struct object_id *oid)4032{4033int pos;40344035if(read_apply_cache(state) <0)4036return-1;4037 pos =cache_name_pos(path,strlen(path));4038if(pos <0)4039return-1;4040oidcpy(oid, &active_cache[pos]->oid);4041return0;4042}40434044static intpreimage_oid_in_gitlink_patch(struct patch *p,struct object_id *oid)4045{4046/*4047 * A usable gitlink patch has only one fragment (hunk) that looks like:4048 * @@ -1 +1 @@4049 * -Subproject commit <old sha1>4050 * +Subproject commit <new sha1>4051 * or4052 * @@ -1 +0,0 @@4053 * -Subproject commit <old sha1>4054 * for a removal patch.4055 */4056struct fragment *hunk = p->fragments;4057static const char heading[] ="-Subproject commit ";4058char*preimage;40594060if(/* does the patch have only one hunk? */4061 hunk && !hunk->next &&4062/* is its preimage one line? */4063 hunk->oldpos ==1&& hunk->oldlines ==1&&4064/* does preimage begin with the heading? */4065(preimage =memchr(hunk->patch,'\n', hunk->size)) != NULL &&4066starts_with(++preimage, heading) &&4067/* does it record full SHA-1? */4068!get_oid_hex(preimage +sizeof(heading) -1, oid) &&4069 preimage[sizeof(heading) + GIT_SHA1_HEXSZ -1] =='\n'&&4070/* does the abbreviated name on the index line agree with it? */4071starts_with(preimage +sizeof(heading) -1, p->old_sha1_prefix))4072return0;/* it all looks fine */40734074/* we may have full object name on the index line */4075returnget_oid_hex(p->old_sha1_prefix, oid);4076}40774078/* Build an index that contains the just the files needed for a 3way merge */4079static intbuild_fake_ancestor(struct apply_state *state,struct patch *list)4080{4081struct patch *patch;4082struct index_state result = { NULL };4083static struct lock_file lock;4084int res;40854086/* Once we start supporting the reverse patch, it may be4087 * worth showing the new sha1 prefix, but until then...4088 */4089for(patch = list; patch; patch = patch->next) {4090struct object_id oid;4091struct cache_entry *ce;4092const char*name;40934094 name = patch->old_name ? patch->old_name : patch->new_name;4095if(0< patch->is_new)4096continue;40974098if(S_ISGITLINK(patch->old_mode)) {4099if(!preimage_oid_in_gitlink_patch(patch, &oid))4100;/* ok, the textual part looks sane */4101else4102returnerror(_("sha1 information is lacking or "4103"useless for submodule%s"), name);4104}else if(!get_oid_blob(patch->old_sha1_prefix, &oid)) {4105;/* ok */4106}else if(!patch->lines_added && !patch->lines_deleted) {4107/* mode-only change: update the current */4108if(get_current_oid(state, patch->old_name, &oid))4109returnerror(_("mode change for%s, which is not "4110"in current HEAD"), name);4111}else4112returnerror(_("sha1 information is lacking or useless "4113"(%s)."), name);41144115 ce =make_cache_entry(patch->old_mode, oid.hash, name,0,0);4116if(!ce)4117returnerror(_("make_cache_entry failed for path '%s'"),4118 name);4119if(add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD)) {4120free(ce);4121returnerror(_("could not add%sto temporary index"),4122 name);4123}4124}41254126hold_lock_file_for_update(&lock, state->fake_ancestor, LOCK_DIE_ON_ERROR);4127 res =write_locked_index(&result, &lock, COMMIT_LOCK);4128discard_index(&result);41294130if(res)4131returnerror(_("could not write temporary index to%s"),4132 state->fake_ancestor);41334134return0;4135}41364137static voidstat_patch_list(struct apply_state *state,struct patch *patch)4138{4139int files, adds, dels;41404141for(files = adds = dels =0; patch ; patch = patch->next) {4142 files++;4143 adds += patch->lines_added;4144 dels += patch->lines_deleted;4145show_stats(state, patch);4146}41474148print_stat_summary(stdout, files, adds, dels);4149}41504151static voidnumstat_patch_list(struct apply_state *state,4152struct patch *patch)4153{4154for( ; patch; patch = patch->next) {4155const char*name;4156 name = patch->new_name ? patch->new_name : patch->old_name;4157if(patch->is_binary)4158printf("-\t-\t");4159else4160printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);4161write_name_quoted(name, stdout, state->line_termination);4162}4163}41644165static voidshow_file_mode_name(const char*newdelete,unsigned int mode,const char*name)4166{4167if(mode)4168printf("%smode%06o%s\n", newdelete, mode, name);4169else4170printf("%s %s\n", newdelete, name);4171}41724173static voidshow_mode_change(struct patch *p,int show_name)4174{4175if(p->old_mode && p->new_mode && p->old_mode != p->new_mode) {4176if(show_name)4177printf(" mode change%06o =>%06o%s\n",4178 p->old_mode, p->new_mode, p->new_name);4179else4180printf(" mode change%06o =>%06o\n",4181 p->old_mode, p->new_mode);4182}4183}41844185static voidshow_rename_copy(struct patch *p)4186{4187const char*renamecopy = p->is_rename ?"rename":"copy";4188const char*old, *new;41894190/* Find common prefix */4191 old = p->old_name;4192new= p->new_name;4193while(1) {4194const char*slash_old, *slash_new;4195 slash_old =strchr(old,'/');4196 slash_new =strchr(new,'/');4197if(!slash_old ||4198!slash_new ||4199 slash_old - old != slash_new -new||4200memcmp(old,new, slash_new -new))4201break;4202 old = slash_old +1;4203new= slash_new +1;4204}4205/* p->old_name thru old is the common prefix, and old and new4206 * through the end of names are renames4207 */4208if(old != p->old_name)4209printf("%s%.*s{%s=>%s} (%d%%)\n", renamecopy,4210(int)(old - p->old_name), p->old_name,4211 old,new, p->score);4212else4213printf("%s %s=>%s(%d%%)\n", renamecopy,4214 p->old_name, p->new_name, p->score);4215show_mode_change(p,0);4216}42174218static voidsummary_patch_list(struct patch *patch)4219{4220struct patch *p;42214222for(p = patch; p; p = p->next) {4223if(p->is_new)4224show_file_mode_name("create", p->new_mode, p->new_name);4225else if(p->is_delete)4226show_file_mode_name("delete", p->old_mode, p->old_name);4227else{4228if(p->is_rename || p->is_copy)4229show_rename_copy(p);4230else{4231if(p->score) {4232printf(" rewrite%s(%d%%)\n",4233 p->new_name, p->score);4234show_mode_change(p,0);4235}4236else4237show_mode_change(p,1);4238}4239}4240}4241}42424243static voidpatch_stats(struct apply_state *state,struct patch *patch)4244{4245int lines = patch->lines_added + patch->lines_deleted;42464247if(lines > state->max_change)4248 state->max_change = lines;4249if(patch->old_name) {4250int len =quote_c_style(patch->old_name, NULL, NULL,0);4251if(!len)4252 len =strlen(patch->old_name);4253if(len > state->max_len)4254 state->max_len = len;4255}4256if(patch->new_name) {4257int len =quote_c_style(patch->new_name, NULL, NULL,0);4258if(!len)4259 len =strlen(patch->new_name);4260if(len > state->max_len)4261 state->max_len = len;4262}4263}42644265static intremove_file(struct apply_state *state,struct patch *patch,int rmdir_empty)4266{4267if(state->update_index) {4268if(remove_file_from_cache(patch->old_name) <0)4269returnerror(_("unable to remove%sfrom index"), patch->old_name);4270}4271if(!state->cached) {4272if(!remove_or_warn(patch->old_mode, patch->old_name) && rmdir_empty) {4273remove_path(patch->old_name);4274}4275}4276return0;4277}42784279static intadd_index_file(struct apply_state *state,4280const char*path,4281unsigned mode,4282void*buf,4283unsigned long size)4284{4285struct stat st;4286struct cache_entry *ce;4287int namelen =strlen(path);4288unsigned ce_size =cache_entry_size(namelen);42894290if(!state->update_index)4291return0;42924293 ce =xcalloc(1, ce_size);4294memcpy(ce->name, path, namelen);4295 ce->ce_mode =create_ce_mode(mode);4296 ce->ce_flags =create_ce_flags(0);4297 ce->ce_namelen = namelen;4298if(S_ISGITLINK(mode)) {4299const char*s;43004301if(!skip_prefix(buf,"Subproject commit ", &s) ||4302get_oid_hex(s, &ce->oid)) {4303free(ce);4304returnerror(_("corrupt patch for submodule%s"), path);4305}4306}else{4307if(!state->cached) {4308if(lstat(path, &st) <0) {4309free(ce);4310returnerror_errno(_("unable to stat newly "4311"created file '%s'"),4312 path);4313}4314fill_stat_cache_info(ce, &st);4315}4316if(write_sha1_file(buf, size, blob_type, ce->oid.hash) <0) {4317free(ce);4318returnerror(_("unable to create backing store "4319"for newly created file%s"), path);4320}4321}4322if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4323free(ce);4324returnerror(_("unable to add cache entry for%s"), path);4325}43264327return0;4328}43294330/*4331 * Returns:4332 * -1 if an unrecoverable error happened4333 * 0 if everything went well4334 * 1 if a recoverable error happened4335 */4336static inttry_create_file(const char*path,unsigned int mode,const char*buf,unsigned long size)4337{4338int fd, res;4339struct strbuf nbuf = STRBUF_INIT;43404341if(S_ISGITLINK(mode)) {4342struct stat st;4343if(!lstat(path, &st) &&S_ISDIR(st.st_mode))4344return0;4345return!!mkdir(path,0777);4346}43474348if(has_symlinks &&S_ISLNK(mode))4349/* Although buf:size is counted string, it also is NUL4350 * terminated.4351 */4352return!!symlink(buf, path);43534354 fd =open(path, O_CREAT | O_EXCL | O_WRONLY, (mode &0100) ?0777:0666);4355if(fd <0)4356return1;43574358if(convert_to_working_tree(path, buf, size, &nbuf)) {4359 size = nbuf.len;4360 buf = nbuf.buf;4361}43624363 res =write_in_full(fd, buf, size) <0;4364if(res)4365error_errno(_("failed to write to '%s'"), path);4366strbuf_release(&nbuf);43674368if(close(fd) <0&& !res)4369returnerror_errno(_("closing file '%s'"), path);43704371return res ? -1:0;4372}43734374/*4375 * We optimistically assume that the directories exist,4376 * which is true 99% of the time anyway. If they don't,4377 * we create them and try again.4378 *4379 * Returns:4380 * -1 on error4381 * 0 otherwise4382 */4383static intcreate_one_file(struct apply_state *state,4384char*path,4385unsigned mode,4386const char*buf,4387unsigned long size)4388{4389int res;43904391if(state->cached)4392return0;43934394 res =try_create_file(path, mode, buf, size);4395if(res <0)4396return-1;4397if(!res)4398return0;43994400if(errno == ENOENT) {4401if(safe_create_leading_directories(path))4402return0;4403 res =try_create_file(path, mode, buf, size);4404if(res <0)4405return-1;4406if(!res)4407return0;4408}44094410if(errno == EEXIST || errno == EACCES) {4411/* We may be trying to create a file where a directory4412 * used to be.4413 */4414struct stat st;4415if(!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))4416 errno = EEXIST;4417}44184419if(errno == EEXIST) {4420unsigned int nr =getpid();44214422for(;;) {4423char newpath[PATH_MAX];4424mksnpath(newpath,sizeof(newpath),"%s~%u", path, nr);4425 res =try_create_file(newpath, mode, buf, size);4426if(res <0)4427return-1;4428if(!res) {4429if(!rename(newpath, path))4430return0;4431unlink_or_warn(newpath);4432break;4433}4434if(errno != EEXIST)4435break;4436++nr;4437}4438}4439returnerror_errno(_("unable to write file '%s' mode%o"),4440 path, mode);4441}44424443static intadd_conflicted_stages_file(struct apply_state *state,4444struct patch *patch)4445{4446int stage, namelen;4447unsigned ce_size, mode;4448struct cache_entry *ce;44494450if(!state->update_index)4451return0;4452 namelen =strlen(patch->new_name);4453 ce_size =cache_entry_size(namelen);4454 mode = patch->new_mode ? patch->new_mode : (S_IFREG |0644);44554456remove_file_from_cache(patch->new_name);4457for(stage =1; stage <4; stage++) {4458if(is_null_oid(&patch->threeway_stage[stage -1]))4459continue;4460 ce =xcalloc(1, ce_size);4461memcpy(ce->name, patch->new_name, namelen);4462 ce->ce_mode =create_ce_mode(mode);4463 ce->ce_flags =create_ce_flags(stage);4464 ce->ce_namelen = namelen;4465oidcpy(&ce->oid, &patch->threeway_stage[stage -1]);4466if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4467free(ce);4468returnerror(_("unable to add cache entry for%s"),4469 patch->new_name);4470}4471}44724473return0;4474}44754476static intcreate_file(struct apply_state *state,struct patch *patch)4477{4478char*path = patch->new_name;4479unsigned mode = patch->new_mode;4480unsigned long size = patch->resultsize;4481char*buf = patch->result;44824483if(!mode)4484 mode = S_IFREG |0644;4485if(create_one_file(state, path, mode, buf, size))4486return-1;44874488if(patch->conflicted_threeway)4489returnadd_conflicted_stages_file(state, patch);4490else4491returnadd_index_file(state, path, mode, buf, size);4492}44934494/* phase zero is to remove, phase one is to create */4495static intwrite_out_one_result(struct apply_state *state,4496struct patch *patch,4497int phase)4498{4499if(patch->is_delete >0) {4500if(phase ==0)4501returnremove_file(state, patch,1);4502return0;4503}4504if(patch->is_new >0|| patch->is_copy) {4505if(phase ==1)4506returncreate_file(state, patch);4507return0;4508}4509/*4510 * Rename or modification boils down to the same4511 * thing: remove the old, write the new4512 */4513if(phase ==0)4514returnremove_file(state, patch, patch->is_rename);4515if(phase ==1)4516returncreate_file(state, patch);4517return0;4518}45194520static intwrite_out_one_reject(struct apply_state *state,struct patch *patch)4521{4522FILE*rej;4523char namebuf[PATH_MAX];4524struct fragment *frag;4525int cnt =0;4526struct strbuf sb = STRBUF_INIT;45274528for(cnt =0, frag = patch->fragments; frag; frag = frag->next) {4529if(!frag->rejected)4530continue;4531 cnt++;4532}45334534if(!cnt) {4535if(state->apply_verbosity > verbosity_normal)4536say_patch_name(stderr,4537_("Applied patch%scleanly."), patch);4538return0;4539}45404541/* This should not happen, because a removal patch that leaves4542 * contents are marked "rejected" at the patch level.4543 */4544if(!patch->new_name)4545die(_("internal error"));45464547/* Say this even without --verbose */4548strbuf_addf(&sb,Q_("Applying patch %%swith%dreject...",4549"Applying patch %%swith%drejects...",4550 cnt),4551 cnt);4552if(state->apply_verbosity > verbosity_silent)4553say_patch_name(stderr, sb.buf, patch);4554strbuf_release(&sb);45554556 cnt =strlen(patch->new_name);4557if(ARRAY_SIZE(namebuf) <= cnt +5) {4558 cnt =ARRAY_SIZE(namebuf) -5;4559warning(_("truncating .rej filename to %.*s.rej"),4560 cnt -1, patch->new_name);4561}4562memcpy(namebuf, patch->new_name, cnt);4563memcpy(namebuf + cnt,".rej",5);45644565 rej =fopen(namebuf,"w");4566if(!rej)4567returnerror_errno(_("cannot open%s"), namebuf);45684569/* Normal git tools never deal with .rej, so do not pretend4570 * this is a git patch by saying --git or giving extended4571 * headers. While at it, maybe please "kompare" that wants4572 * the trailing TAB and some garbage at the end of line ;-).4573 */4574fprintf(rej,"diff a/%sb/%s\t(rejected hunks)\n",4575 patch->new_name, patch->new_name);4576for(cnt =1, frag = patch->fragments;4577 frag;4578 cnt++, frag = frag->next) {4579if(!frag->rejected) {4580if(state->apply_verbosity > verbosity_silent)4581fprintf_ln(stderr,_("Hunk #%dapplied cleanly."), cnt);4582continue;4583}4584if(state->apply_verbosity > verbosity_silent)4585fprintf_ln(stderr,_("Rejected hunk #%d."), cnt);4586fprintf(rej,"%.*s", frag->size, frag->patch);4587if(frag->patch[frag->size-1] !='\n')4588fputc('\n', rej);4589}4590fclose(rej);4591return-1;4592}45934594/*4595 * Returns:4596 * -1 if an error happened4597 * 0 if the patch applied cleanly4598 * 1 if the patch did not apply cleanly4599 */4600static intwrite_out_results(struct apply_state *state,struct patch *list)4601{4602int phase;4603int errs =0;4604struct patch *l;4605struct string_list cpath = STRING_LIST_INIT_DUP;46064607for(phase =0; phase <2; phase++) {4608 l = list;4609while(l) {4610if(l->rejected)4611 errs =1;4612else{4613if(write_out_one_result(state, l, phase)) {4614string_list_clear(&cpath,0);4615return-1;4616}4617if(phase ==1) {4618if(write_out_one_reject(state, l))4619 errs =1;4620if(l->conflicted_threeway) {4621string_list_append(&cpath, l->new_name);4622 errs =1;4623}4624}4625}4626 l = l->next;4627}4628}46294630if(cpath.nr) {4631struct string_list_item *item;46324633string_list_sort(&cpath);4634if(state->apply_verbosity > verbosity_silent) {4635for_each_string_list_item(item, &cpath)4636fprintf(stderr,"U%s\n", item->string);4637}4638string_list_clear(&cpath,0);46394640rerere(0);4641}46424643return errs;4644}46454646/*4647 * Try to apply a patch.4648 *4649 * Returns:4650 * -128 if a bad error happened (like patch unreadable)4651 * -1 if patch did not apply and user cannot deal with it4652 * 0 if the patch applied4653 * 1 if the patch did not apply but user might fix it4654 */4655static intapply_patch(struct apply_state *state,4656int fd,4657const char*filename,4658int options)4659{4660size_t offset;4661struct strbuf buf = STRBUF_INIT;/* owns the patch text */4662struct patch *list = NULL, **listp = &list;4663int skipped_patch =0;4664int res =0;46654666 state->patch_input_file = filename;4667if(read_patch_file(&buf, fd) <0)4668return-128;4669 offset =0;4670while(offset < buf.len) {4671struct patch *patch;4672int nr;46734674 patch =xcalloc(1,sizeof(*patch));4675 patch->inaccurate_eof = !!(options & APPLY_OPT_INACCURATE_EOF);4676 patch->recount = !!(options & APPLY_OPT_RECOUNT);4677 nr =parse_chunk(state, buf.buf + offset, buf.len - offset, patch);4678if(nr <0) {4679free_patch(patch);4680if(nr == -128) {4681 res = -128;4682goto end;4683}4684break;4685}4686if(state->apply_in_reverse)4687reverse_patches(patch);4688if(use_patch(state, patch)) {4689patch_stats(state, patch);4690*listp = patch;4691 listp = &patch->next;4692}4693else{4694if(state->apply_verbosity > verbosity_normal)4695say_patch_name(stderr,_("Skipped patch '%s'."), patch);4696free_patch(patch);4697 skipped_patch++;4698}4699 offset += nr;4700}47014702if(!list && !skipped_patch) {4703error(_("unrecognized input"));4704 res = -128;4705goto end;4706}47074708if(state->whitespace_error && (state->ws_error_action == die_on_ws_error))4709 state->apply =0;47104711 state->update_index = state->check_index && state->apply;4712if(state->update_index && state->newfd <0) {4713if(state->index_file)4714 state->newfd =hold_lock_file_for_update(state->lock_file,4715 state->index_file,4716 LOCK_DIE_ON_ERROR);4717else4718 state->newfd =hold_locked_index(state->lock_file, LOCK_DIE_ON_ERROR);4719}47204721if(state->check_index &&read_apply_cache(state) <0) {4722error(_("unable to read index file"));4723 res = -128;4724goto end;4725}47264727if(state->check || state->apply) {4728int r =check_patch_list(state, list);4729if(r == -128) {4730 res = -128;4731goto end;4732}4733if(r <0&& !state->apply_with_reject) {4734 res = -1;4735goto end;4736}4737}47384739if(state->apply) {4740int write_res =write_out_results(state, list);4741if(write_res <0) {4742 res = -128;4743goto end;4744}4745if(write_res >0) {4746/* with --3way, we still need to write the index out */4747 res = state->apply_with_reject ? -1:1;4748goto end;4749}4750}47514752if(state->fake_ancestor &&4753build_fake_ancestor(state, list)) {4754 res = -128;4755goto end;4756}47574758if(state->diffstat && state->apply_verbosity > verbosity_silent)4759stat_patch_list(state, list);47604761if(state->numstat && state->apply_verbosity > verbosity_silent)4762numstat_patch_list(state, list);47634764if(state->summary && state->apply_verbosity > verbosity_silent)4765summary_patch_list(list);47664767end:4768free_patch_list(list);4769strbuf_release(&buf);4770string_list_clear(&state->fn_table,0);4771return res;4772}47734774static intapply_option_parse_exclude(const struct option *opt,4775const char*arg,int unset)4776{4777struct apply_state *state = opt->value;4778add_name_limit(state, arg,1);4779return0;4780}47814782static intapply_option_parse_include(const struct option *opt,4783const char*arg,int unset)4784{4785struct apply_state *state = opt->value;4786add_name_limit(state, arg,0);4787 state->has_include =1;4788return0;4789}47904791static intapply_option_parse_p(const struct option *opt,4792const char*arg,4793int unset)4794{4795struct apply_state *state = opt->value;4796 state->p_value =atoi(arg);4797 state->p_value_known =1;4798return0;4799}48004801static intapply_option_parse_space_change(const struct option *opt,4802const char*arg,int unset)4803{4804struct apply_state *state = opt->value;4805if(unset)4806 state->ws_ignore_action = ignore_ws_none;4807else4808 state->ws_ignore_action = ignore_ws_change;4809return0;4810}48114812static intapply_option_parse_whitespace(const struct option *opt,4813const char*arg,int unset)4814{4815struct apply_state *state = opt->value;4816 state->whitespace_option = arg;4817if(parse_whitespace_option(state, arg))4818exit(1);4819return0;4820}48214822static intapply_option_parse_directory(const struct option *opt,4823const char*arg,int unset)4824{4825struct apply_state *state = opt->value;4826strbuf_reset(&state->root);4827strbuf_addstr(&state->root, arg);4828strbuf_complete(&state->root,'/');4829return0;4830}48314832intapply_all_patches(struct apply_state *state,4833int argc,4834const char**argv,4835int options)4836{4837int i;4838int res;4839int errs =0;4840int read_stdin =1;48414842for(i =0; i < argc; i++) {4843const char*arg = argv[i];4844char*to_free = NULL;4845int fd;48464847if(!strcmp(arg,"-")) {4848 res =apply_patch(state,0,"<stdin>", options);4849if(res <0)4850goto end;4851 errs |= res;4852 read_stdin =0;4853continue;4854}else4855 arg = to_free =prefix_filename(state->prefix, arg);48564857 fd =open(arg, O_RDONLY);4858if(fd <0) {4859error(_("can't open patch '%s':%s"), arg,strerror(errno));4860 res = -128;4861free(to_free);4862goto end;4863}4864 read_stdin =0;4865set_default_whitespace_mode(state);4866 res =apply_patch(state, fd, arg, options);4867close(fd);4868free(to_free);4869if(res <0)4870goto end;4871 errs |= res;4872}4873set_default_whitespace_mode(state);4874if(read_stdin) {4875 res =apply_patch(state,0,"<stdin>", options);4876if(res <0)4877goto end;4878 errs |= res;4879}48804881if(state->whitespace_error) {4882if(state->squelch_whitespace_errors &&4883 state->squelch_whitespace_errors < state->whitespace_error) {4884int squelched =4885 state->whitespace_error - state->squelch_whitespace_errors;4886warning(Q_("squelched%dwhitespace error",4887"squelched%dwhitespace errors",4888 squelched),4889 squelched);4890}4891if(state->ws_error_action == die_on_ws_error) {4892error(Q_("%dline adds whitespace errors.",4893"%dlines add whitespace errors.",4894 state->whitespace_error),4895 state->whitespace_error);4896 res = -128;4897goto end;4898}4899if(state->applied_after_fixing_ws && state->apply)4900warning(Q_("%dline applied after"4901" fixing whitespace errors.",4902"%dlines applied after"4903" fixing whitespace errors.",4904 state->applied_after_fixing_ws),4905 state->applied_after_fixing_ws);4906else if(state->whitespace_error)4907warning(Q_("%dline adds whitespace errors.",4908"%dlines add whitespace errors.",4909 state->whitespace_error),4910 state->whitespace_error);4911}49124913if(state->update_index) {4914 res =write_locked_index(&the_index, state->lock_file, COMMIT_LOCK);4915if(res) {4916error(_("Unable to write new index file"));4917 res = -128;4918goto end;4919}4920 state->newfd = -1;4921}49224923 res = !!errs;49244925end:4926if(state->newfd >=0) {4927rollback_lock_file(state->lock_file);4928 state->newfd = -1;4929}49304931if(state->apply_verbosity <= verbosity_silent) {4932set_error_routine(state->saved_error_routine);4933set_warn_routine(state->saved_warn_routine);4934}49354936if(res > -1)4937return res;4938return(res == -1?1:128);4939}49404941intapply_parse_options(int argc,const char**argv,4942struct apply_state *state,4943int*force_apply,int*options,4944const char*const*apply_usage)4945{4946struct option builtin_apply_options[] = {4947{ OPTION_CALLBACK,0,"exclude", state,N_("path"),4948N_("don't apply changes matching the given path"),49490, apply_option_parse_exclude },4950{ OPTION_CALLBACK,0,"include", state,N_("path"),4951N_("apply changes matching the given path"),49520, apply_option_parse_include },4953{ OPTION_CALLBACK,'p', NULL, state,N_("num"),4954N_("remove <num> leading slashes from traditional diff paths"),49550, apply_option_parse_p },4956OPT_BOOL(0,"no-add", &state->no_add,4957N_("ignore additions made by the patch")),4958OPT_BOOL(0,"stat", &state->diffstat,4959N_("instead of applying the patch, output diffstat for the input")),4960OPT_NOOP_NOARG(0,"allow-binary-replacement"),4961OPT_NOOP_NOARG(0,"binary"),4962OPT_BOOL(0,"numstat", &state->numstat,4963N_("show number of added and deleted lines in decimal notation")),4964OPT_BOOL(0,"summary", &state->summary,4965N_("instead of applying the patch, output a summary for the input")),4966OPT_BOOL(0,"check", &state->check,4967N_("instead of applying the patch, see if the patch is applicable")),4968OPT_BOOL(0,"index", &state->check_index,4969N_("make sure the patch is applicable to the current index")),4970OPT_BOOL(0,"cached", &state->cached,4971N_("apply a patch without touching the working tree")),4972OPT_BOOL(0,"unsafe-paths", &state->unsafe_paths,4973N_("accept a patch that touches outside the working area")),4974OPT_BOOL(0,"apply", force_apply,4975N_("also apply the patch (use with --stat/--summary/--check)")),4976OPT_BOOL('3',"3way", &state->threeway,4977N_("attempt three-way merge if a patch does not apply")),4978OPT_FILENAME(0,"build-fake-ancestor", &state->fake_ancestor,4979N_("build a temporary index based on embedded index information")),4980/* Think twice before adding "--nul" synonym to this */4981OPT_SET_INT('z', NULL, &state->line_termination,4982N_("paths are separated with NUL character"),'\0'),4983OPT_INTEGER('C', NULL, &state->p_context,4984N_("ensure at least <n> lines of context match")),4985{ OPTION_CALLBACK,0,"whitespace", state,N_("action"),4986N_("detect new or modified lines that have whitespace errors"),49870, apply_option_parse_whitespace },4988{ OPTION_CALLBACK,0,"ignore-space-change", state, NULL,4989N_("ignore changes in whitespace when finding context"),4990 PARSE_OPT_NOARG, apply_option_parse_space_change },4991{ OPTION_CALLBACK,0,"ignore-whitespace", state, NULL,4992N_("ignore changes in whitespace when finding context"),4993 PARSE_OPT_NOARG, apply_option_parse_space_change },4994OPT_BOOL('R',"reverse", &state->apply_in_reverse,4995N_("apply the patch in reverse")),4996OPT_BOOL(0,"unidiff-zero", &state->unidiff_zero,4997N_("don't expect at least one line of context")),4998OPT_BOOL(0,"reject", &state->apply_with_reject,4999N_("leave the rejected hunks in corresponding *.rej files")),5000OPT_BOOL(0,"allow-overlap", &state->allow_overlap,5001N_("allow overlapping hunks")),5002OPT__VERBOSE(&state->apply_verbosity,N_("be verbose")),5003OPT_BIT(0,"inaccurate-eof", options,5004N_("tolerate incorrectly detected missing new-line at the end of file"),5005 APPLY_OPT_INACCURATE_EOF),5006OPT_BIT(0,"recount", options,5007N_("do not trust the line counts in the hunk headers"),5008 APPLY_OPT_RECOUNT),5009{ OPTION_CALLBACK,0,"directory", state,N_("root"),5010N_("prepend <root> to all filenames"),50110, apply_option_parse_directory },5012OPT_END()5013};50145015returnparse_options(argc, argv, state->prefix, builtin_apply_options, apply_usage,0);5016}