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*end1 = s1 + n1; 309const char*end2 = s2 + n2; 310 311/* ignore line endings */ 312while(s1 < end1 && (end1[-1] =='\r'|| end1[-1] =='\n')) 313 end1--; 314while(s2 < end2 && (end2[-1] =='\r'|| end2[-1] =='\n')) 315 end2--; 316 317while(s1 < end1 && s2 < end2) { 318if(isspace(*s1)) { 319/* 320 * Skip whitespace. We check on both buffers 321 * because we don't want "a b" to match "ab". 322 */ 323if(!isspace(*s2)) 324return0; 325while(s1 < end1 &&isspace(*s1)) 326 s1++; 327while(s2 < end2 &&isspace(*s2)) 328 s2++; 329}else if(*s1++ != *s2++) 330return0; 331} 332 333/* If we reached the end on one side only, lines don't match. */ 334return s1 == end1 && s2 == end2; 335} 336 337static voidadd_line_info(struct image *img,const char*bol,size_t len,unsigned flag) 338{ 339ALLOC_GROW(img->line_allocated, img->nr +1, img->alloc); 340 img->line_allocated[img->nr].len = len; 341 img->line_allocated[img->nr].hash =hash_line(bol, len); 342 img->line_allocated[img->nr].flag = flag; 343 img->nr++; 344} 345 346/* 347 * "buf" has the file contents to be patched (read from various sources). 348 * attach it to "image" and add line-based index to it. 349 * "image" now owns the "buf". 350 */ 351static voidprepare_image(struct image *image,char*buf,size_t len, 352int prepare_linetable) 353{ 354const char*cp, *ep; 355 356memset(image,0,sizeof(*image)); 357 image->buf = buf; 358 image->len = len; 359 360if(!prepare_linetable) 361return; 362 363 ep = image->buf + image->len; 364 cp = image->buf; 365while(cp < ep) { 366const char*next; 367for(next = cp; next < ep && *next !='\n'; next++) 368; 369if(next < ep) 370 next++; 371add_line_info(image, cp, next - cp,0); 372 cp = next; 373} 374 image->line = image->line_allocated; 375} 376 377static voidclear_image(struct image *image) 378{ 379free(image->buf); 380free(image->line_allocated); 381memset(image,0,sizeof(*image)); 382} 383 384/* fmt must contain _one_ %s and no other substitution */ 385static voidsay_patch_name(FILE*output,const char*fmt,struct patch *patch) 386{ 387struct strbuf sb = STRBUF_INIT; 388 389if(patch->old_name && patch->new_name && 390strcmp(patch->old_name, patch->new_name)) { 391quote_c_style(patch->old_name, &sb, NULL,0); 392strbuf_addstr(&sb," => "); 393quote_c_style(patch->new_name, &sb, NULL,0); 394}else{ 395const char*n = patch->new_name; 396if(!n) 397 n = patch->old_name; 398quote_c_style(n, &sb, NULL,0); 399} 400fprintf(output, fmt, sb.buf); 401fputc('\n', output); 402strbuf_release(&sb); 403} 404 405#define SLOP (16) 406 407static intread_patch_file(struct strbuf *sb,int fd) 408{ 409if(strbuf_read(sb, fd,0) <0) 410returnerror_errno("git apply: failed to read"); 411 412/* 413 * Make sure that we have some slop in the buffer 414 * so that we can do speculative "memcmp" etc, and 415 * see to it that it is NUL-filled. 416 */ 417strbuf_grow(sb, SLOP); 418memset(sb->buf + sb->len,0, SLOP); 419return0; 420} 421 422static unsigned longlinelen(const char*buffer,unsigned long size) 423{ 424unsigned long len =0; 425while(size--) { 426 len++; 427if(*buffer++ =='\n') 428break; 429} 430return len; 431} 432 433static intis_dev_null(const char*str) 434{ 435returnskip_prefix(str,"/dev/null", &str) &&isspace(*str); 436} 437 438#define TERM_SPACE 1 439#define TERM_TAB 2 440 441static intname_terminate(int c,int terminate) 442{ 443if(c ==' '&& !(terminate & TERM_SPACE)) 444return0; 445if(c =='\t'&& !(terminate & TERM_TAB)) 446return0; 447 448return1; 449} 450 451/* remove double slashes to make --index work with such filenames */ 452static char*squash_slash(char*name) 453{ 454int i =0, j =0; 455 456if(!name) 457return NULL; 458 459while(name[i]) { 460if((name[j++] = name[i++]) =='/') 461while(name[i] =='/') 462 i++; 463} 464 name[j] ='\0'; 465return name; 466} 467 468static char*find_name_gnu(struct apply_state *state, 469const char*line, 470const char*def, 471int p_value) 472{ 473struct strbuf name = STRBUF_INIT; 474char*cp; 475 476/* 477 * Proposed "new-style" GNU patch/diff format; see 478 * http://marc.info/?l=git&m=112927316408690&w=2 479 */ 480if(unquote_c_style(&name, line, NULL)) { 481strbuf_release(&name); 482return NULL; 483} 484 485for(cp = name.buf; p_value; p_value--) { 486 cp =strchr(cp,'/'); 487if(!cp) { 488strbuf_release(&name); 489return NULL; 490} 491 cp++; 492} 493 494strbuf_remove(&name,0, cp - name.buf); 495if(state->root.len) 496strbuf_insert(&name,0, state->root.buf, state->root.len); 497returnsquash_slash(strbuf_detach(&name, NULL)); 498} 499 500static size_tsane_tz_len(const char*line,size_t len) 501{ 502const char*tz, *p; 503 504if(len <strlen(" +0500") || line[len-strlen(" +0500")] !=' ') 505return0; 506 tz = line + len -strlen(" +0500"); 507 508if(tz[1] !='+'&& tz[1] !='-') 509return0; 510 511for(p = tz +2; p != line + len; p++) 512if(!isdigit(*p)) 513return0; 514 515return line + len - tz; 516} 517 518static size_ttz_with_colon_len(const char*line,size_t len) 519{ 520const char*tz, *p; 521 522if(len <strlen(" +08:00") || line[len -strlen(":00")] !=':') 523return0; 524 tz = line + len -strlen(" +08:00"); 525 526if(tz[0] !=' '|| (tz[1] !='+'&& tz[1] !='-')) 527return0; 528 p = tz +2; 529if(!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 530!isdigit(*p++) || !isdigit(*p++)) 531return0; 532 533return line + len - tz; 534} 535 536static size_tdate_len(const char*line,size_t len) 537{ 538const char*date, *p; 539 540if(len <strlen("72-02-05") || line[len-strlen("-05")] !='-') 541return0; 542 p = date = line + len -strlen("72-02-05"); 543 544if(!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 545!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 546!isdigit(*p++) || !isdigit(*p++))/* Not a date. */ 547return0; 548 549if(date - line >=strlen("19") && 550isdigit(date[-1]) &&isdigit(date[-2]))/* 4-digit year */ 551 date -=strlen("19"); 552 553return line + len - date; 554} 555 556static size_tshort_time_len(const char*line,size_t len) 557{ 558const char*time, *p; 559 560if(len <strlen(" 07:01:32") || line[len-strlen(":32")] !=':') 561return0; 562 p = time = line + len -strlen(" 07:01:32"); 563 564/* Permit 1-digit hours? */ 565if(*p++ !=' '|| 566!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 567!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 568!isdigit(*p++) || !isdigit(*p++))/* Not a time. */ 569return0; 570 571return line + len - time; 572} 573 574static size_tfractional_time_len(const char*line,size_t len) 575{ 576const char*p; 577size_t n; 578 579/* Expected format: 19:41:17.620000023 */ 580if(!len || !isdigit(line[len -1])) 581return0; 582 p = line + len -1; 583 584/* Fractional seconds. */ 585while(p > line &&isdigit(*p)) 586 p--; 587if(*p !='.') 588return0; 589 590/* Hours, minutes, and whole seconds. */ 591 n =short_time_len(line, p - line); 592if(!n) 593return0; 594 595return line + len - p + n; 596} 597 598static size_ttrailing_spaces_len(const char*line,size_t len) 599{ 600const char*p; 601 602/* Expected format: ' ' x (1 or more) */ 603if(!len || line[len -1] !=' ') 604return0; 605 606 p = line + len; 607while(p != line) { 608 p--; 609if(*p !=' ') 610return line + len - (p +1); 611} 612 613/* All spaces! */ 614return len; 615} 616 617static size_tdiff_timestamp_len(const char*line,size_t len) 618{ 619const char*end = line + len; 620size_t n; 621 622/* 623 * Posix: 2010-07-05 19:41:17 624 * GNU: 2010-07-05 19:41:17.620000023 -0500 625 */ 626 627if(!isdigit(end[-1])) 628return0; 629 630 n =sane_tz_len(line, end - line); 631if(!n) 632 n =tz_with_colon_len(line, end - line); 633 end -= n; 634 635 n =short_time_len(line, end - line); 636if(!n) 637 n =fractional_time_len(line, end - line); 638 end -= n; 639 640 n =date_len(line, end - line); 641if(!n)/* No date. Too bad. */ 642return0; 643 end -= n; 644 645if(end == line)/* No space before date. */ 646return0; 647if(end[-1] =='\t') {/* Success! */ 648 end--; 649return line + len - end; 650} 651if(end[-1] !=' ')/* No space before date. */ 652return0; 653 654/* Whitespace damage. */ 655 end -=trailing_spaces_len(line, end - line); 656return line + len - end; 657} 658 659static char*find_name_common(struct apply_state *state, 660const char*line, 661const char*def, 662int p_value, 663const char*end, 664int terminate) 665{ 666int len; 667const char*start = NULL; 668 669if(p_value ==0) 670 start = line; 671while(line != end) { 672char c = *line; 673 674if(!end &&isspace(c)) { 675if(c =='\n') 676break; 677if(name_terminate(c, terminate)) 678break; 679} 680 line++; 681if(c =='/'&& !--p_value) 682 start = line; 683} 684if(!start) 685returnsquash_slash(xstrdup_or_null(def)); 686 len = line - start; 687if(!len) 688returnsquash_slash(xstrdup_or_null(def)); 689 690/* 691 * Generally we prefer the shorter name, especially 692 * if the other one is just a variation of that with 693 * something else tacked on to the end (ie "file.orig" 694 * or "file~"). 695 */ 696if(def) { 697int deflen =strlen(def); 698if(deflen < len && !strncmp(start, def, deflen)) 699returnsquash_slash(xstrdup(def)); 700} 701 702if(state->root.len) { 703char*ret =xstrfmt("%s%.*s", state->root.buf, len, start); 704returnsquash_slash(ret); 705} 706 707returnsquash_slash(xmemdupz(start, len)); 708} 709 710static char*find_name(struct apply_state *state, 711const char*line, 712char*def, 713int p_value, 714int terminate) 715{ 716if(*line =='"') { 717char*name =find_name_gnu(state, line, def, p_value); 718if(name) 719return name; 720} 721 722returnfind_name_common(state, line, def, p_value, NULL, terminate); 723} 724 725static char*find_name_traditional(struct apply_state *state, 726const char*line, 727char*def, 728int p_value) 729{ 730size_t len; 731size_t date_len; 732 733if(*line =='"') { 734char*name =find_name_gnu(state, line, def, p_value); 735if(name) 736return name; 737} 738 739 len =strchrnul(line,'\n') - line; 740 date_len =diff_timestamp_len(line, len); 741if(!date_len) 742returnfind_name_common(state, line, def, p_value, NULL, TERM_TAB); 743 len -= date_len; 744 745returnfind_name_common(state, line, def, p_value, line + len,0); 746} 747 748/* 749 * Given the string after "--- " or "+++ ", guess the appropriate 750 * p_value for the given patch. 751 */ 752static intguess_p_value(struct apply_state *state,const char*nameline) 753{ 754char*name, *cp; 755int val = -1; 756 757if(is_dev_null(nameline)) 758return-1; 759 name =find_name_traditional(state, nameline, NULL,0); 760if(!name) 761return-1; 762 cp =strchr(name,'/'); 763if(!cp) 764 val =0; 765else if(state->prefix) { 766/* 767 * Does it begin with "a/$our-prefix" and such? Then this is 768 * very likely to apply to our directory. 769 */ 770if(starts_with(name, state->prefix)) 771 val =count_slashes(state->prefix); 772else{ 773 cp++; 774if(starts_with(cp, state->prefix)) 775 val =count_slashes(state->prefix) +1; 776} 777} 778free(name); 779return val; 780} 781 782/* 783 * Does the ---/+++ line have the POSIX timestamp after the last HT? 784 * GNU diff puts epoch there to signal a creation/deletion event. Is 785 * this such a timestamp? 786 */ 787static inthas_epoch_timestamp(const char*nameline) 788{ 789/* 790 * We are only interested in epoch timestamp; any non-zero 791 * fraction cannot be one, hence "(\.0+)?" in the regexp below. 792 * For the same reason, the date must be either 1969-12-31 or 793 * 1970-01-01, and the seconds part must be "00". 794 */ 795const char stamp_regexp[] = 796"^[0-2][0-9]:([0-5][0-9]):00(\\.0+)?" 797" " 798"([-+][0-2][0-9]:?[0-5][0-9])\n"; 799const char*timestamp = NULL, *cp, *colon; 800static regex_t *stamp; 801 regmatch_t m[10]; 802int zoneoffset, epoch_hour, hour, minute; 803int status; 804 805for(cp = nameline; *cp !='\n'; cp++) { 806if(*cp =='\t') 807 timestamp = cp +1; 808} 809if(!timestamp) 810return0; 811 812/* 813 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31 814 * (west of GMT) or 1970-01-01 (east of GMT) 815 */ 816if(skip_prefix(timestamp,"1969-12-31 ", ×tamp)) 817 epoch_hour =24; 818else if(skip_prefix(timestamp,"1970-01-01 ", ×tamp)) 819 epoch_hour =0; 820else 821return0; 822 823if(!stamp) { 824 stamp =xmalloc(sizeof(*stamp)); 825if(regcomp(stamp, stamp_regexp, REG_EXTENDED)) { 826warning(_("Cannot prepare timestamp regexp%s"), 827 stamp_regexp); 828return0; 829} 830} 831 832 status =regexec(stamp, timestamp,ARRAY_SIZE(m), m,0); 833if(status) { 834if(status != REG_NOMATCH) 835warning(_("regexec returned%dfor input:%s"), 836 status, timestamp); 837return0; 838} 839 840 hour =strtol(timestamp, NULL,10); 841 minute =strtol(timestamp + m[1].rm_so, NULL,10); 842 843 zoneoffset =strtol(timestamp + m[3].rm_so +1, (char**) &colon,10); 844if(*colon ==':') 845 zoneoffset = zoneoffset *60+strtol(colon +1, NULL,10); 846else 847 zoneoffset = (zoneoffset /100) *60+ (zoneoffset %100); 848if(timestamp[m[3].rm_so] =='-') 849 zoneoffset = -zoneoffset; 850 851return hour *60+ minute - zoneoffset == epoch_hour *60; 852} 853 854/* 855 * Get the name etc info from the ---/+++ lines of a traditional patch header 856 * 857 * FIXME! The end-of-filename heuristics are kind of screwy. For existing 858 * files, we can happily check the index for a match, but for creating a 859 * new file we should try to match whatever "patch" does. I have no idea. 860 */ 861static intparse_traditional_patch(struct apply_state *state, 862const char*first, 863const char*second, 864struct patch *patch) 865{ 866char*name; 867 868 first +=4;/* skip "--- " */ 869 second +=4;/* skip "+++ " */ 870if(!state->p_value_known) { 871int p, q; 872 p =guess_p_value(state, first); 873 q =guess_p_value(state, second); 874if(p <0) p = q; 875if(0<= p && p == q) { 876 state->p_value = p; 877 state->p_value_known =1; 878} 879} 880if(is_dev_null(first)) { 881 patch->is_new =1; 882 patch->is_delete =0; 883 name =find_name_traditional(state, second, NULL, state->p_value); 884 patch->new_name = name; 885}else if(is_dev_null(second)) { 886 patch->is_new =0; 887 patch->is_delete =1; 888 name =find_name_traditional(state, first, NULL, state->p_value); 889 patch->old_name = name; 890}else{ 891char*first_name; 892 first_name =find_name_traditional(state, first, NULL, state->p_value); 893 name =find_name_traditional(state, second, first_name, state->p_value); 894free(first_name); 895if(has_epoch_timestamp(first)) { 896 patch->is_new =1; 897 patch->is_delete =0; 898 patch->new_name = name; 899}else if(has_epoch_timestamp(second)) { 900 patch->is_new =0; 901 patch->is_delete =1; 902 patch->old_name = name; 903}else{ 904 patch->old_name = name; 905 patch->new_name =xstrdup_or_null(name); 906} 907} 908if(!name) 909returnerror(_("unable to find filename in patch at line%d"), state->linenr); 910 911return0; 912} 913 914static intgitdiff_hdrend(struct apply_state *state, 915const char*line, 916struct patch *patch) 917{ 918return1; 919} 920 921/* 922 * We're anal about diff header consistency, to make 923 * sure that we don't end up having strange ambiguous 924 * patches floating around. 925 * 926 * As a result, gitdiff_{old|new}name() will check 927 * their names against any previous information, just 928 * to make sure.. 929 */ 930#define DIFF_OLD_NAME 0 931#define DIFF_NEW_NAME 1 932 933static intgitdiff_verify_name(struct apply_state *state, 934const char*line, 935int isnull, 936char**name, 937int side) 938{ 939if(!*name && !isnull) { 940*name =find_name(state, line, NULL, state->p_value, TERM_TAB); 941return0; 942} 943 944if(*name) { 945char*another; 946if(isnull) 947returnerror(_("git apply: bad git-diff - expected /dev/null, got%son line%d"), 948*name, state->linenr); 949 another =find_name(state, line, NULL, state->p_value, TERM_TAB); 950if(!another ||strcmp(another, *name)) { 951free(another); 952returnerror((side == DIFF_NEW_NAME) ? 953_("git apply: bad git-diff - inconsistent new filename on line%d") : 954_("git apply: bad git-diff - inconsistent old filename on line%d"), state->linenr); 955} 956free(another); 957}else{ 958if(!starts_with(line,"/dev/null\n")) 959returnerror(_("git apply: bad git-diff - expected /dev/null on line%d"), state->linenr); 960} 961 962return0; 963} 964 965static intgitdiff_oldname(struct apply_state *state, 966const char*line, 967struct patch *patch) 968{ 969returngitdiff_verify_name(state, line, 970 patch->is_new, &patch->old_name, 971 DIFF_OLD_NAME); 972} 973 974static intgitdiff_newname(struct apply_state *state, 975const char*line, 976struct patch *patch) 977{ 978returngitdiff_verify_name(state, line, 979 patch->is_delete, &patch->new_name, 980 DIFF_NEW_NAME); 981} 982 983static intparse_mode_line(const char*line,int linenr,unsigned int*mode) 984{ 985char*end; 986*mode =strtoul(line, &end,8); 987if(end == line || !isspace(*end)) 988returnerror(_("invalid mode on line%d:%s"), linenr, line); 989return0; 990} 991 992static intgitdiff_oldmode(struct apply_state *state, 993const char*line, 994struct patch *patch) 995{ 996returnparse_mode_line(line, state->linenr, &patch->old_mode); 997} 998 999static intgitdiff_newmode(struct apply_state *state,1000const char*line,1001struct patch *patch)1002{1003returnparse_mode_line(line, state->linenr, &patch->new_mode);1004}10051006static intgitdiff_delete(struct apply_state *state,1007const char*line,1008struct patch *patch)1009{1010 patch->is_delete =1;1011free(patch->old_name);1012 patch->old_name =xstrdup_or_null(patch->def_name);1013returngitdiff_oldmode(state, line, patch);1014}10151016static intgitdiff_newfile(struct apply_state *state,1017const char*line,1018struct patch *patch)1019{1020 patch->is_new =1;1021free(patch->new_name);1022 patch->new_name =xstrdup_or_null(patch->def_name);1023returngitdiff_newmode(state, line, patch);1024}10251026static intgitdiff_copysrc(struct apply_state *state,1027const char*line,1028struct patch *patch)1029{1030 patch->is_copy =1;1031free(patch->old_name);1032 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1033return0;1034}10351036static intgitdiff_copydst(struct apply_state *state,1037const char*line,1038struct patch *patch)1039{1040 patch->is_copy =1;1041free(patch->new_name);1042 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1043return0;1044}10451046static intgitdiff_renamesrc(struct apply_state *state,1047const char*line,1048struct patch *patch)1049{1050 patch->is_rename =1;1051free(patch->old_name);1052 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1053return0;1054}10551056static intgitdiff_renamedst(struct apply_state *state,1057const char*line,1058struct patch *patch)1059{1060 patch->is_rename =1;1061free(patch->new_name);1062 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1063return0;1064}10651066static intgitdiff_similarity(struct apply_state *state,1067const char*line,1068struct patch *patch)1069{1070unsigned long val =strtoul(line, NULL,10);1071if(val <=100)1072 patch->score = val;1073return0;1074}10751076static intgitdiff_dissimilarity(struct apply_state *state,1077const char*line,1078struct patch *patch)1079{1080unsigned long val =strtoul(line, NULL,10);1081if(val <=100)1082 patch->score = val;1083return0;1084}10851086static intgitdiff_index(struct apply_state *state,1087const char*line,1088struct patch *patch)1089{1090/*1091 * index line is N hexadecimal, "..", N hexadecimal,1092 * and optional space with octal mode.1093 */1094const char*ptr, *eol;1095int len;10961097 ptr =strchr(line,'.');1098if(!ptr || ptr[1] !='.'||40< ptr - line)1099return0;1100 len = ptr - line;1101memcpy(patch->old_sha1_prefix, line, len);1102 patch->old_sha1_prefix[len] =0;11031104 line = ptr +2;1105 ptr =strchr(line,' ');1106 eol =strchrnul(line,'\n');11071108if(!ptr || eol < ptr)1109 ptr = eol;1110 len = ptr - line;11111112if(40< len)1113return0;1114memcpy(patch->new_sha1_prefix, line, len);1115 patch->new_sha1_prefix[len] =0;1116if(*ptr ==' ')1117returngitdiff_oldmode(state, ptr +1, patch);1118return0;1119}11201121/*1122 * This is normal for a diff that doesn't change anything: we'll fall through1123 * into the next diff. Tell the parser to break out.1124 */1125static intgitdiff_unrecognized(struct apply_state *state,1126const char*line,1127struct patch *patch)1128{1129return1;1130}11311132/*1133 * Skip p_value leading components from "line"; as we do not accept1134 * absolute paths, return NULL in that case.1135 */1136static const char*skip_tree_prefix(struct apply_state *state,1137const char*line,1138int llen)1139{1140int nslash;1141int i;11421143if(!state->p_value)1144return(llen && line[0] =='/') ? NULL : line;11451146 nslash = state->p_value;1147for(i =0; i < llen; i++) {1148int ch = line[i];1149if(ch =='/'&& --nslash <=0)1150return(i ==0) ? NULL : &line[i +1];1151}1152return NULL;1153}11541155/*1156 * This is to extract the same name that appears on "diff --git"1157 * line. We do not find and return anything if it is a rename1158 * patch, and it is OK because we will find the name elsewhere.1159 * We need to reliably find name only when it is mode-change only,1160 * creation or deletion of an empty file. In any of these cases,1161 * both sides are the same name under a/ and b/ respectively.1162 */1163static char*git_header_name(struct apply_state *state,1164const char*line,1165int llen)1166{1167const char*name;1168const char*second = NULL;1169size_t len, line_len;11701171 line +=strlen("diff --git ");1172 llen -=strlen("diff --git ");11731174if(*line =='"') {1175const char*cp;1176struct strbuf first = STRBUF_INIT;1177struct strbuf sp = STRBUF_INIT;11781179if(unquote_c_style(&first, line, &second))1180goto free_and_fail1;11811182/* strip the a/b prefix including trailing slash */1183 cp =skip_tree_prefix(state, first.buf, first.len);1184if(!cp)1185goto free_and_fail1;1186strbuf_remove(&first,0, cp - first.buf);11871188/*1189 * second points at one past closing dq of name.1190 * find the second name.1191 */1192while((second < line + llen) &&isspace(*second))1193 second++;11941195if(line + llen <= second)1196goto free_and_fail1;1197if(*second =='"') {1198if(unquote_c_style(&sp, second, NULL))1199goto free_and_fail1;1200 cp =skip_tree_prefix(state, sp.buf, sp.len);1201if(!cp)1202goto free_and_fail1;1203/* They must match, otherwise ignore */1204if(strcmp(cp, first.buf))1205goto free_and_fail1;1206strbuf_release(&sp);1207returnstrbuf_detach(&first, NULL);1208}12091210/* unquoted second */1211 cp =skip_tree_prefix(state, second, line + llen - second);1212if(!cp)1213goto free_and_fail1;1214if(line + llen - cp != first.len ||1215memcmp(first.buf, cp, first.len))1216goto free_and_fail1;1217returnstrbuf_detach(&first, NULL);12181219 free_and_fail1:1220strbuf_release(&first);1221strbuf_release(&sp);1222return NULL;1223}12241225/* unquoted first name */1226 name =skip_tree_prefix(state, line, llen);1227if(!name)1228return NULL;12291230/*1231 * since the first name is unquoted, a dq if exists must be1232 * the beginning of the second name.1233 */1234for(second = name; second < line + llen; second++) {1235if(*second =='"') {1236struct strbuf sp = STRBUF_INIT;1237const char*np;12381239if(unquote_c_style(&sp, second, NULL))1240goto free_and_fail2;12411242 np =skip_tree_prefix(state, sp.buf, sp.len);1243if(!np)1244goto free_and_fail2;12451246 len = sp.buf + sp.len - np;1247if(len < second - name &&1248!strncmp(np, name, len) &&1249isspace(name[len])) {1250/* Good */1251strbuf_remove(&sp,0, np - sp.buf);1252returnstrbuf_detach(&sp, NULL);1253}12541255 free_and_fail2:1256strbuf_release(&sp);1257return NULL;1258}1259}12601261/*1262 * Accept a name only if it shows up twice, exactly the same1263 * form.1264 */1265 second =strchr(name,'\n');1266if(!second)1267return NULL;1268 line_len = second - name;1269for(len =0; ; len++) {1270switch(name[len]) {1271default:1272continue;1273case'\n':1274return NULL;1275case'\t':case' ':1276/*1277 * Is this the separator between the preimage1278 * and the postimage pathname? Again, we are1279 * only interested in the case where there is1280 * no rename, as this is only to set def_name1281 * and a rename patch has the names elsewhere1282 * in an unambiguous form.1283 */1284if(!name[len +1])1285return NULL;/* no postimage name */1286 second =skip_tree_prefix(state, name + len +1,1287 line_len - (len +1));1288if(!second)1289return NULL;1290/*1291 * Does len bytes starting at "name" and "second"1292 * (that are separated by one HT or SP we just1293 * found) exactly match?1294 */1295if(second[len] =='\n'&& !strncmp(name, second, len))1296returnxmemdupz(name, len);1297}1298}1299}13001301static intcheck_header_line(struct apply_state *state,struct patch *patch)1302{1303int extensions = (patch->is_delete ==1) + (patch->is_new ==1) +1304(patch->is_rename ==1) + (patch->is_copy ==1);1305if(extensions >1)1306returnerror(_("inconsistent header lines%dand%d"),1307 patch->extension_linenr, state->linenr);1308if(extensions && !patch->extension_linenr)1309 patch->extension_linenr = state->linenr;1310return0;1311}13121313/* Verify that we recognize the lines following a git header */1314static intparse_git_header(struct apply_state *state,1315const char*line,1316int len,1317unsigned int size,1318struct patch *patch)1319{1320unsigned long offset;13211322/* A git diff has explicit new/delete information, so we don't guess */1323 patch->is_new =0;1324 patch->is_delete =0;13251326/*1327 * Some things may not have the old name in the1328 * rest of the headers anywhere (pure mode changes,1329 * or removing or adding empty files), so we get1330 * the default name from the header.1331 */1332 patch->def_name =git_header_name(state, line, len);1333if(patch->def_name && state->root.len) {1334char*s =xstrfmt("%s%s", state->root.buf, patch->def_name);1335free(patch->def_name);1336 patch->def_name = s;1337}13381339 line += len;1340 size -= len;1341 state->linenr++;1342for(offset = len ; size >0; offset += len, size -= len, line += len, state->linenr++) {1343static const struct opentry {1344const char*str;1345int(*fn)(struct apply_state *,const char*,struct patch *);1346} optable[] = {1347{"@@ -", gitdiff_hdrend },1348{"--- ", gitdiff_oldname },1349{"+++ ", gitdiff_newname },1350{"old mode ", gitdiff_oldmode },1351{"new mode ", gitdiff_newmode },1352{"deleted file mode ", gitdiff_delete },1353{"new file mode ", gitdiff_newfile },1354{"copy from ", gitdiff_copysrc },1355{"copy to ", gitdiff_copydst },1356{"rename old ", gitdiff_renamesrc },1357{"rename new ", gitdiff_renamedst },1358{"rename from ", gitdiff_renamesrc },1359{"rename to ", gitdiff_renamedst },1360{"similarity index ", gitdiff_similarity },1361{"dissimilarity index ", gitdiff_dissimilarity },1362{"index ", gitdiff_index },1363{"", gitdiff_unrecognized },1364};1365int i;13661367 len =linelen(line, size);1368if(!len || line[len-1] !='\n')1369break;1370for(i =0; i <ARRAY_SIZE(optable); i++) {1371const struct opentry *p = optable + i;1372int oplen =strlen(p->str);1373int res;1374if(len < oplen ||memcmp(p->str, line, oplen))1375continue;1376 res = p->fn(state, line + oplen, patch);1377if(res <0)1378return-1;1379if(check_header_line(state, patch))1380return-1;1381if(res >0)1382return offset;1383break;1384}1385}13861387return offset;1388}13891390static intparse_num(const char*line,unsigned long*p)1391{1392char*ptr;13931394if(!isdigit(*line))1395return0;1396*p =strtoul(line, &ptr,10);1397return ptr - line;1398}13991400static intparse_range(const char*line,int len,int offset,const char*expect,1401unsigned long*p1,unsigned long*p2)1402{1403int digits, ex;14041405if(offset <0|| offset >= len)1406return-1;1407 line += offset;1408 len -= offset;14091410 digits =parse_num(line, p1);1411if(!digits)1412return-1;14131414 offset += digits;1415 line += digits;1416 len -= digits;14171418*p2 =1;1419if(*line ==',') {1420 digits =parse_num(line+1, p2);1421if(!digits)1422return-1;14231424 offset += digits+1;1425 line += digits+1;1426 len -= digits+1;1427}14281429 ex =strlen(expect);1430if(ex > len)1431return-1;1432if(memcmp(line, expect, ex))1433return-1;14341435return offset + ex;1436}14371438static voidrecount_diff(const char*line,int size,struct fragment *fragment)1439{1440int oldlines =0, newlines =0, ret =0;14411442if(size <1) {1443warning("recount: ignore empty hunk");1444return;1445}14461447for(;;) {1448int len =linelen(line, size);1449 size -= len;1450 line += len;14511452if(size <1)1453break;14541455switch(*line) {1456case' ':case'\n':1457 newlines++;1458/* fall through */1459case'-':1460 oldlines++;1461continue;1462case'+':1463 newlines++;1464continue;1465case'\\':1466continue;1467case'@':1468 ret = size <3|| !starts_with(line,"@@ ");1469break;1470case'd':1471 ret = size <5|| !starts_with(line,"diff ");1472break;1473default:1474 ret = -1;1475break;1476}1477if(ret) {1478warning(_("recount: unexpected line: %.*s"),1479(int)linelen(line, size), line);1480return;1481}1482break;1483}1484 fragment->oldlines = oldlines;1485 fragment->newlines = newlines;1486}14871488/*1489 * Parse a unified diff fragment header of the1490 * form "@@ -a,b +c,d @@"1491 */1492static intparse_fragment_header(const char*line,int len,struct fragment *fragment)1493{1494int offset;14951496if(!len || line[len-1] !='\n')1497return-1;14981499/* Figure out the number of lines in a fragment */1500 offset =parse_range(line, len,4," +", &fragment->oldpos, &fragment->oldlines);1501 offset =parse_range(line, len, offset," @@", &fragment->newpos, &fragment->newlines);15021503return offset;1504}15051506/*1507 * Find file diff header1508 *1509 * Returns:1510 * -1 if no header was found1511 * -128 in case of error1512 * the size of the header in bytes (called "offset") otherwise1513 */1514static intfind_header(struct apply_state *state,1515const char*line,1516unsigned long size,1517int*hdrsize,1518struct patch *patch)1519{1520unsigned long offset, len;15211522 patch->is_toplevel_relative =0;1523 patch->is_rename = patch->is_copy =0;1524 patch->is_new = patch->is_delete = -1;1525 patch->old_mode = patch->new_mode =0;1526 patch->old_name = patch->new_name = NULL;1527for(offset =0; size >0; offset += len, size -= len, line += len, state->linenr++) {1528unsigned long nextlen;15291530 len =linelen(line, size);1531if(!len)1532break;15331534/* Testing this early allows us to take a few shortcuts.. */1535if(len <6)1536continue;15371538/*1539 * Make sure we don't find any unconnected patch fragments.1540 * That's a sign that we didn't find a header, and that a1541 * patch has become corrupted/broken up.1542 */1543if(!memcmp("@@ -", line,4)) {1544struct fragment dummy;1545if(parse_fragment_header(line, len, &dummy) <0)1546continue;1547error(_("patch fragment without header at line%d: %.*s"),1548 state->linenr, (int)len-1, line);1549return-128;1550}15511552if(size < len +6)1553break;15541555/*1556 * Git patch? It might not have a real patch, just a rename1557 * or mode change, so we handle that specially1558 */1559if(!memcmp("diff --git ", line,11)) {1560int git_hdr_len =parse_git_header(state, line, len, size, patch);1561if(git_hdr_len <0)1562return-128;1563if(git_hdr_len <= len)1564continue;1565if(!patch->old_name && !patch->new_name) {1566if(!patch->def_name) {1567error(Q_("git diff header lacks filename information when removing "1568"%dleading pathname component (line%d)",1569"git diff header lacks filename information when removing "1570"%dleading pathname components (line%d)",1571 state->p_value),1572 state->p_value, state->linenr);1573return-128;1574}1575 patch->old_name =xstrdup(patch->def_name);1576 patch->new_name =xstrdup(patch->def_name);1577}1578if((!patch->new_name && !patch->is_delete) ||1579(!patch->old_name && !patch->is_new)) {1580error(_("git diff header lacks filename information "1581"(line%d)"), state->linenr);1582return-128;1583}1584 patch->is_toplevel_relative =1;1585*hdrsize = git_hdr_len;1586return offset;1587}15881589/* --- followed by +++ ? */1590if(memcmp("--- ", line,4) ||memcmp("+++ ", line + len,4))1591continue;15921593/*1594 * We only accept unified patches, so we want it to1595 * at least have "@@ -a,b +c,d @@\n", which is 14 chars1596 * minimum ("@@ -0,0 +1 @@\n" is the shortest).1597 */1598 nextlen =linelen(line + len, size - len);1599if(size < nextlen +14||memcmp("@@ -", line + len + nextlen,4))1600continue;16011602/* Ok, we'll consider it a patch */1603if(parse_traditional_patch(state, line, line+len, patch))1604return-128;1605*hdrsize = len + nextlen;1606 state->linenr +=2;1607return offset;1608}1609return-1;1610}16111612static voidrecord_ws_error(struct apply_state *state,1613unsigned result,1614const char*line,1615int len,1616int linenr)1617{1618char*err;16191620if(!result)1621return;16221623 state->whitespace_error++;1624if(state->squelch_whitespace_errors &&1625 state->squelch_whitespace_errors < state->whitespace_error)1626return;16271628 err =whitespace_error_string(result);1629if(state->apply_verbosity > verbosity_silent)1630fprintf(stderr,"%s:%d:%s.\n%.*s\n",1631 state->patch_input_file, linenr, err, len, line);1632free(err);1633}16341635static voidcheck_whitespace(struct apply_state *state,1636const char*line,1637int len,1638unsigned ws_rule)1639{1640unsigned result =ws_check(line +1, len -1, ws_rule);16411642record_ws_error(state, result, line +1, len -2, state->linenr);1643}16441645/*1646 * Check if the patch has context lines with CRLF or1647 * the patch wants to remove lines with CRLF.1648 */1649static voidcheck_old_for_crlf(struct patch *patch,const char*line,int len)1650{1651if(len >=2&& line[len-1] =='\n'&& line[len-2] =='\r') {1652 patch->ws_rule |= WS_CR_AT_EOL;1653 patch->crlf_in_old =1;1654}1655}165616571658/*1659 * Parse a unified diff. Note that this really needs to parse each1660 * fragment separately, since the only way to know the difference1661 * between a "---" that is part of a patch, and a "---" that starts1662 * the next patch is to look at the line counts..1663 */1664static intparse_fragment(struct apply_state *state,1665const char*line,1666unsigned long size,1667struct patch *patch,1668struct fragment *fragment)1669{1670int added, deleted;1671int len =linelen(line, size), offset;1672unsigned long oldlines, newlines;1673unsigned long leading, trailing;16741675 offset =parse_fragment_header(line, len, fragment);1676if(offset <0)1677return-1;1678if(offset >0&& patch->recount)1679recount_diff(line + offset, size - offset, fragment);1680 oldlines = fragment->oldlines;1681 newlines = fragment->newlines;1682 leading =0;1683 trailing =0;16841685/* Parse the thing.. */1686 line += len;1687 size -= len;1688 state->linenr++;1689 added = deleted =0;1690for(offset = len;16910< size;1692 offset += len, size -= len, line += len, state->linenr++) {1693if(!oldlines && !newlines)1694break;1695 len =linelen(line, size);1696if(!len || line[len-1] !='\n')1697return-1;1698switch(*line) {1699default:1700return-1;1701case'\n':/* newer GNU diff, an empty context line */1702case' ':1703 oldlines--;1704 newlines--;1705if(!deleted && !added)1706 leading++;1707 trailing++;1708check_old_for_crlf(patch, line, len);1709if(!state->apply_in_reverse &&1710 state->ws_error_action == correct_ws_error)1711check_whitespace(state, line, len, patch->ws_rule);1712break;1713case'-':1714if(!state->apply_in_reverse)1715check_old_for_crlf(patch, line, len);1716if(state->apply_in_reverse &&1717 state->ws_error_action != nowarn_ws_error)1718check_whitespace(state, line, len, patch->ws_rule);1719 deleted++;1720 oldlines--;1721 trailing =0;1722break;1723case'+':1724if(state->apply_in_reverse)1725check_old_for_crlf(patch, line, len);1726if(!state->apply_in_reverse &&1727 state->ws_error_action != nowarn_ws_error)1728check_whitespace(state, line, len, patch->ws_rule);1729 added++;1730 newlines--;1731 trailing =0;1732break;17331734/*1735 * We allow "\ No newline at end of file". Depending1736 * on locale settings when the patch was produced we1737 * don't know what this line looks like. The only1738 * thing we do know is that it begins with "\ ".1739 * Checking for 12 is just for sanity check -- any1740 * l10n of "\ No newline..." is at least that long.1741 */1742case'\\':1743if(len <12||memcmp(line,"\\",2))1744return-1;1745break;1746}1747}1748if(oldlines || newlines)1749return-1;1750if(!deleted && !added)1751return-1;17521753 fragment->leading = leading;1754 fragment->trailing = trailing;17551756/*1757 * If a fragment ends with an incomplete line, we failed to include1758 * it in the above loop because we hit oldlines == newlines == 01759 * before seeing it.1760 */1761if(12< size && !memcmp(line,"\\",2))1762 offset +=linelen(line, size);17631764 patch->lines_added += added;1765 patch->lines_deleted += deleted;17661767if(0< patch->is_new && oldlines)1768returnerror(_("new file depends on old contents"));1769if(0< patch->is_delete && newlines)1770returnerror(_("deleted file still has contents"));1771return offset;1772}17731774/*1775 * We have seen "diff --git a/... b/..." header (or a traditional patch1776 * header). Read hunks that belong to this patch into fragments and hang1777 * them to the given patch structure.1778 *1779 * The (fragment->patch, fragment->size) pair points into the memory given1780 * by the caller, not a copy, when we return.1781 *1782 * Returns:1783 * -1 in case of error,1784 * the number of bytes in the patch otherwise.1785 */1786static intparse_single_patch(struct apply_state *state,1787const char*line,1788unsigned long size,1789struct patch *patch)1790{1791unsigned long offset =0;1792unsigned long oldlines =0, newlines =0, context =0;1793struct fragment **fragp = &patch->fragments;17941795while(size >4&& !memcmp(line,"@@ -",4)) {1796struct fragment *fragment;1797int len;17981799 fragment =xcalloc(1,sizeof(*fragment));1800 fragment->linenr = state->linenr;1801 len =parse_fragment(state, line, size, patch, fragment);1802if(len <=0) {1803free(fragment);1804returnerror(_("corrupt patch at line%d"), state->linenr);1805}1806 fragment->patch = line;1807 fragment->size = len;1808 oldlines += fragment->oldlines;1809 newlines += fragment->newlines;1810 context += fragment->leading + fragment->trailing;18111812*fragp = fragment;1813 fragp = &fragment->next;18141815 offset += len;1816 line += len;1817 size -= len;1818}18191820/*1821 * If something was removed (i.e. we have old-lines) it cannot1822 * be creation, and if something was added it cannot be1823 * deletion. However, the reverse is not true; --unified=01824 * patches that only add are not necessarily creation even1825 * though they do not have any old lines, and ones that only1826 * delete are not necessarily deletion.1827 *1828 * Unfortunately, a real creation/deletion patch do _not_ have1829 * any context line by definition, so we cannot safely tell it1830 * apart with --unified=0 insanity. At least if the patch has1831 * more than one hunk it is not creation or deletion.1832 */1833if(patch->is_new <0&&1834(oldlines || (patch->fragments && patch->fragments->next)))1835 patch->is_new =0;1836if(patch->is_delete <0&&1837(newlines || (patch->fragments && patch->fragments->next)))1838 patch->is_delete =0;18391840if(0< patch->is_new && oldlines)1841returnerror(_("new file%sdepends on old contents"), patch->new_name);1842if(0< patch->is_delete && newlines)1843returnerror(_("deleted file%sstill has contents"), patch->old_name);1844if(!patch->is_delete && !newlines && context && state->apply_verbosity > verbosity_silent)1845fprintf_ln(stderr,1846_("** warning: "1847"file%sbecomes empty but is not deleted"),1848 patch->new_name);18491850return offset;1851}18521853staticinlineintmetadata_changes(struct patch *patch)1854{1855return patch->is_rename >0||1856 patch->is_copy >0||1857 patch->is_new >0||1858 patch->is_delete ||1859(patch->old_mode && patch->new_mode &&1860 patch->old_mode != patch->new_mode);1861}18621863static char*inflate_it(const void*data,unsigned long size,1864unsigned long inflated_size)1865{1866 git_zstream stream;1867void*out;1868int st;18691870memset(&stream,0,sizeof(stream));18711872 stream.next_in = (unsigned char*)data;1873 stream.avail_in = size;1874 stream.next_out = out =xmalloc(inflated_size);1875 stream.avail_out = inflated_size;1876git_inflate_init(&stream);1877 st =git_inflate(&stream, Z_FINISH);1878git_inflate_end(&stream);1879if((st != Z_STREAM_END) || stream.total_out != inflated_size) {1880free(out);1881return NULL;1882}1883return out;1884}18851886/*1887 * Read a binary hunk and return a new fragment; fragment->patch1888 * points at an allocated memory that the caller must free, so1889 * it is marked as "->free_patch = 1".1890 */1891static struct fragment *parse_binary_hunk(struct apply_state *state,1892char**buf_p,1893unsigned long*sz_p,1894int*status_p,1895int*used_p)1896{1897/*1898 * Expect a line that begins with binary patch method ("literal"1899 * or "delta"), followed by the length of data before deflating.1900 * a sequence of 'length-byte' followed by base-85 encoded data1901 * should follow, terminated by a newline.1902 *1903 * Each 5-byte sequence of base-85 encodes up to 4 bytes,1904 * and we would limit the patch line to 66 characters,1905 * so one line can fit up to 13 groups that would decode1906 * to 52 bytes max. The length byte 'A'-'Z' corresponds1907 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.1908 */1909int llen, used;1910unsigned long size = *sz_p;1911char*buffer = *buf_p;1912int patch_method;1913unsigned long origlen;1914char*data = NULL;1915int hunk_size =0;1916struct fragment *frag;19171918 llen =linelen(buffer, size);1919 used = llen;19201921*status_p =0;19221923if(starts_with(buffer,"delta ")) {1924 patch_method = BINARY_DELTA_DEFLATED;1925 origlen =strtoul(buffer +6, NULL,10);1926}1927else if(starts_with(buffer,"literal ")) {1928 patch_method = BINARY_LITERAL_DEFLATED;1929 origlen =strtoul(buffer +8, NULL,10);1930}1931else1932return NULL;19331934 state->linenr++;1935 buffer += llen;1936while(1) {1937int byte_length, max_byte_length, newsize;1938 llen =linelen(buffer, size);1939 used += llen;1940 state->linenr++;1941if(llen ==1) {1942/* consume the blank line */1943 buffer++;1944 size--;1945break;1946}1947/*1948 * Minimum line is "A00000\n" which is 7-byte long,1949 * and the line length must be multiple of 5 plus 2.1950 */1951if((llen <7) || (llen-2) %5)1952goto corrupt;1953 max_byte_length = (llen -2) /5*4;1954 byte_length = *buffer;1955if('A'<= byte_length && byte_length <='Z')1956 byte_length = byte_length -'A'+1;1957else if('a'<= byte_length && byte_length <='z')1958 byte_length = byte_length -'a'+27;1959else1960goto corrupt;1961/* if the input length was not multiple of 4, we would1962 * have filler at the end but the filler should never1963 * exceed 3 bytes1964 */1965if(max_byte_length < byte_length ||1966 byte_length <= max_byte_length -4)1967goto corrupt;1968 newsize = hunk_size + byte_length;1969 data =xrealloc(data, newsize);1970if(decode_85(data + hunk_size, buffer +1, byte_length))1971goto corrupt;1972 hunk_size = newsize;1973 buffer += llen;1974 size -= llen;1975}19761977 frag =xcalloc(1,sizeof(*frag));1978 frag->patch =inflate_it(data, hunk_size, origlen);1979 frag->free_patch =1;1980if(!frag->patch)1981goto corrupt;1982free(data);1983 frag->size = origlen;1984*buf_p = buffer;1985*sz_p = size;1986*used_p = used;1987 frag->binary_patch_method = patch_method;1988return frag;19891990 corrupt:1991free(data);1992*status_p = -1;1993error(_("corrupt binary patch at line%d: %.*s"),1994 state->linenr-1, llen-1, buffer);1995return NULL;1996}19971998/*1999 * Returns:2000 * -1 in case of error,2001 * the length of the parsed binary patch otherwise2002 */2003static intparse_binary(struct apply_state *state,2004char*buffer,2005unsigned long size,2006struct patch *patch)2007{2008/*2009 * We have read "GIT binary patch\n"; what follows is a line2010 * that says the patch method (currently, either "literal" or2011 * "delta") and the length of data before deflating; a2012 * sequence of 'length-byte' followed by base-85 encoded data2013 * follows.2014 *2015 * When a binary patch is reversible, there is another binary2016 * hunk in the same format, starting with patch method (either2017 * "literal" or "delta") with the length of data, and a sequence2018 * of length-byte + base-85 encoded data, terminated with another2019 * empty line. This data, when applied to the postimage, produces2020 * the preimage.2021 */2022struct fragment *forward;2023struct fragment *reverse;2024int status;2025int used, used_1;20262027 forward =parse_binary_hunk(state, &buffer, &size, &status, &used);2028if(!forward && !status)2029/* there has to be one hunk (forward hunk) */2030returnerror(_("unrecognized binary patch at line%d"), state->linenr-1);2031if(status)2032/* otherwise we already gave an error message */2033return status;20342035 reverse =parse_binary_hunk(state, &buffer, &size, &status, &used_1);2036if(reverse)2037 used += used_1;2038else if(status) {2039/*2040 * Not having reverse hunk is not an error, but having2041 * a corrupt reverse hunk is.2042 */2043free((void*) forward->patch);2044free(forward);2045return status;2046}2047 forward->next = reverse;2048 patch->fragments = forward;2049 patch->is_binary =1;2050return used;2051}20522053static voidprefix_one(struct apply_state *state,char**name)2054{2055char*old_name = *name;2056if(!old_name)2057return;2058*name =prefix_filename(state->prefix, *name);2059free(old_name);2060}20612062static voidprefix_patch(struct apply_state *state,struct patch *p)2063{2064if(!state->prefix || p->is_toplevel_relative)2065return;2066prefix_one(state, &p->new_name);2067prefix_one(state, &p->old_name);2068}20692070/*2071 * include/exclude2072 */20732074static voidadd_name_limit(struct apply_state *state,2075const char*name,2076int exclude)2077{2078struct string_list_item *it;20792080 it =string_list_append(&state->limit_by_name, name);2081 it->util = exclude ? NULL : (void*)1;2082}20832084static intuse_patch(struct apply_state *state,struct patch *p)2085{2086const char*pathname = p->new_name ? p->new_name : p->old_name;2087int i;20882089/* Paths outside are not touched regardless of "--include" */2090if(state->prefix && *state->prefix) {2091const char*rest;2092if(!skip_prefix(pathname, state->prefix, &rest) || !*rest)2093return0;2094}20952096/* See if it matches any of exclude/include rule */2097for(i =0; i < state->limit_by_name.nr; i++) {2098struct string_list_item *it = &state->limit_by_name.items[i];2099if(!wildmatch(it->string, pathname,0))2100return(it->util != NULL);2101}21022103/*2104 * If we had any include, a path that does not match any rule is2105 * not used. Otherwise, we saw bunch of exclude rules (or none)2106 * and such a path is used.2107 */2108return!state->has_include;2109}21102111/*2112 * Read the patch text in "buffer" that extends for "size" bytes; stop2113 * reading after seeing a single patch (i.e. changes to a single file).2114 * Create fragments (i.e. patch hunks) and hang them to the given patch.2115 *2116 * Returns:2117 * -1 if no header was found or parse_binary() failed,2118 * -128 on another error,2119 * the number of bytes consumed otherwise,2120 * so that the caller can call us again for the next patch.2121 */2122static intparse_chunk(struct apply_state *state,char*buffer,unsigned long size,struct patch *patch)2123{2124int hdrsize, patchsize;2125int offset =find_header(state, buffer, size, &hdrsize, patch);21262127if(offset <0)2128return offset;21292130prefix_patch(state, patch);21312132if(!use_patch(state, patch))2133 patch->ws_rule =0;2134else2135 patch->ws_rule =whitespace_rule(patch->new_name2136? patch->new_name2137: patch->old_name);21382139 patchsize =parse_single_patch(state,2140 buffer + offset + hdrsize,2141 size - offset - hdrsize,2142 patch);21432144if(patchsize <0)2145return-128;21462147if(!patchsize) {2148static const char git_binary[] ="GIT binary patch\n";2149int hd = hdrsize + offset;2150unsigned long llen =linelen(buffer + hd, size - hd);21512152if(llen ==sizeof(git_binary) -1&&2153!memcmp(git_binary, buffer + hd, llen)) {2154int used;2155 state->linenr++;2156 used =parse_binary(state, buffer + hd + llen,2157 size - hd - llen, patch);2158if(used <0)2159return-1;2160if(used)2161 patchsize = used + llen;2162else2163 patchsize =0;2164}2165else if(!memcmp(" differ\n", buffer + hd + llen -8,8)) {2166static const char*binhdr[] = {2167"Binary files ",2168"Files ",2169 NULL,2170};2171int i;2172for(i =0; binhdr[i]; i++) {2173int len =strlen(binhdr[i]);2174if(len < size - hd &&2175!memcmp(binhdr[i], buffer + hd, len)) {2176 state->linenr++;2177 patch->is_binary =1;2178 patchsize = llen;2179break;2180}2181}2182}21832184/* Empty patch cannot be applied if it is a text patch2185 * without metadata change. A binary patch appears2186 * empty to us here.2187 */2188if((state->apply || state->check) &&2189(!patch->is_binary && !metadata_changes(patch))) {2190error(_("patch with only garbage at line%d"), state->linenr);2191return-128;2192}2193}21942195return offset + hdrsize + patchsize;2196}21972198static voidreverse_patches(struct patch *p)2199{2200for(; p; p = p->next) {2201struct fragment *frag = p->fragments;22022203SWAP(p->new_name, p->old_name);2204SWAP(p->new_mode, p->old_mode);2205SWAP(p->is_new, p->is_delete);2206SWAP(p->lines_added, p->lines_deleted);2207SWAP(p->old_sha1_prefix, p->new_sha1_prefix);22082209for(; frag; frag = frag->next) {2210SWAP(frag->newpos, frag->oldpos);2211SWAP(frag->newlines, frag->oldlines);2212}2213}2214}22152216static const char pluses[] =2217"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";2218static const char minuses[]=2219"----------------------------------------------------------------------";22202221static voidshow_stats(struct apply_state *state,struct patch *patch)2222{2223struct strbuf qname = STRBUF_INIT;2224char*cp = patch->new_name ? patch->new_name : patch->old_name;2225int max, add, del;22262227quote_c_style(cp, &qname, NULL,0);22282229/*2230 * "scale" the filename2231 */2232 max = state->max_len;2233if(max >50)2234 max =50;22352236if(qname.len > max) {2237 cp =strchr(qname.buf + qname.len +3- max,'/');2238if(!cp)2239 cp = qname.buf + qname.len +3- max;2240strbuf_splice(&qname,0, cp - qname.buf,"...",3);2241}22422243if(patch->is_binary) {2244printf(" %-*s | Bin\n", max, qname.buf);2245strbuf_release(&qname);2246return;2247}22482249printf(" %-*s |", max, qname.buf);2250strbuf_release(&qname);22512252/*2253 * scale the add/delete2254 */2255 max = max + state->max_change >70?70- max : state->max_change;2256 add = patch->lines_added;2257 del = patch->lines_deleted;22582259if(state->max_change >0) {2260int total = ((add + del) * max + state->max_change /2) / state->max_change;2261 add = (add * max + state->max_change /2) / state->max_change;2262 del = total - add;2263}2264printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,2265 add, pluses, del, minuses);2266}22672268static intread_old_data(struct stat *st,struct patch *patch,2269const char*path,struct strbuf *buf)2270{2271enum safe_crlf safe_crlf = patch->crlf_in_old ?2272 SAFE_CRLF_KEEP_CRLF : SAFE_CRLF_RENORMALIZE;2273switch(st->st_mode & S_IFMT) {2274case S_IFLNK:2275if(strbuf_readlink(buf, path, st->st_size) <0)2276returnerror(_("unable to read symlink%s"), path);2277return0;2278case S_IFREG:2279if(strbuf_read_file(buf, path, st->st_size) != st->st_size)2280returnerror(_("unable to open or read%s"), path);2281/*2282 * "git apply" without "--index/--cached" should never look2283 * at the index; the target file may not have been added to2284 * the index yet, and we may not even be in any Git repository.2285 * Pass NULL to convert_to_git() to stress this; the function2286 * should never look at the index when explicit crlf option2287 * is given.2288 */2289convert_to_git(NULL, path, buf->buf, buf->len, buf, safe_crlf);2290return0;2291default:2292return-1;2293}2294}22952296/*2297 * Update the preimage, and the common lines in postimage,2298 * from buffer buf of length len. If postlen is 0 the postimage2299 * is updated in place, otherwise it's updated on a new buffer2300 * of length postlen2301 */23022303static voidupdate_pre_post_images(struct image *preimage,2304struct image *postimage,2305char*buf,2306size_t len,size_t postlen)2307{2308int i, ctx, reduced;2309char*new, *old, *fixed;2310struct image fixed_preimage;23112312/*2313 * Update the preimage with whitespace fixes. Note that we2314 * are not losing preimage->buf -- apply_one_fragment() will2315 * free "oldlines".2316 */2317prepare_image(&fixed_preimage, buf, len,1);2318assert(postlen2319? fixed_preimage.nr == preimage->nr2320: fixed_preimage.nr <= preimage->nr);2321for(i =0; i < fixed_preimage.nr; i++)2322 fixed_preimage.line[i].flag = preimage->line[i].flag;2323free(preimage->line_allocated);2324*preimage = fixed_preimage;23252326/*2327 * Adjust the common context lines in postimage. This can be2328 * done in-place when we are shrinking it with whitespace2329 * fixing, but needs a new buffer when ignoring whitespace or2330 * expanding leading tabs to spaces.2331 *2332 * We trust the caller to tell us if the update can be done2333 * in place (postlen==0) or not.2334 */2335 old = postimage->buf;2336if(postlen)2337new= postimage->buf =xmalloc(postlen);2338else2339new= old;2340 fixed = preimage->buf;23412342for(i = reduced = ctx =0; i < postimage->nr; i++) {2343size_t l_len = postimage->line[i].len;2344if(!(postimage->line[i].flag & LINE_COMMON)) {2345/* an added line -- no counterparts in preimage */2346memmove(new, old, l_len);2347 old += l_len;2348new+= l_len;2349continue;2350}23512352/* a common context -- skip it in the original postimage */2353 old += l_len;23542355/* and find the corresponding one in the fixed preimage */2356while(ctx < preimage->nr &&2357!(preimage->line[ctx].flag & LINE_COMMON)) {2358 fixed += preimage->line[ctx].len;2359 ctx++;2360}23612362/*2363 * preimage is expected to run out, if the caller2364 * fixed addition of trailing blank lines.2365 */2366if(preimage->nr <= ctx) {2367 reduced++;2368continue;2369}23702371/* and copy it in, while fixing the line length */2372 l_len = preimage->line[ctx].len;2373memcpy(new, fixed, l_len);2374new+= l_len;2375 fixed += l_len;2376 postimage->line[i].len = l_len;2377 ctx++;2378}23792380if(postlen2381? postlen <new- postimage->buf2382: postimage->len <new- postimage->buf)2383die("BUG: caller miscounted postlen: asked%d, orig =%d, used =%d",2384(int)postlen, (int) postimage->len, (int)(new- postimage->buf));23852386/* Fix the length of the whole thing */2387 postimage->len =new- postimage->buf;2388 postimage->nr -= reduced;2389}23902391static intline_by_line_fuzzy_match(struct image *img,2392struct image *preimage,2393struct image *postimage,2394unsigned longtry,2395int try_lno,2396int preimage_limit)2397{2398int i;2399size_t imgoff =0;2400size_t preoff =0;2401size_t postlen = postimage->len;2402size_t extra_chars;2403char*buf;2404char*preimage_eof;2405char*preimage_end;2406struct strbuf fixed;2407char*fixed_buf;2408size_t fixed_len;24092410for(i =0; i < preimage_limit; i++) {2411size_t prelen = preimage->line[i].len;2412size_t imglen = img->line[try_lno+i].len;24132414if(!fuzzy_matchlines(img->buf +try+ imgoff, imglen,2415 preimage->buf + preoff, prelen))2416return0;2417if(preimage->line[i].flag & LINE_COMMON)2418 postlen += imglen - prelen;2419 imgoff += imglen;2420 preoff += prelen;2421}24222423/*2424 * Ok, the preimage matches with whitespace fuzz.2425 *2426 * imgoff now holds the true length of the target that2427 * matches the preimage before the end of the file.2428 *2429 * Count the number of characters in the preimage that fall2430 * beyond the end of the file and make sure that all of them2431 * are whitespace characters. (This can only happen if2432 * we are removing blank lines at the end of the file.)2433 */2434 buf = preimage_eof = preimage->buf + preoff;2435for( ; i < preimage->nr; i++)2436 preoff += preimage->line[i].len;2437 preimage_end = preimage->buf + preoff;2438for( ; buf < preimage_end; buf++)2439if(!isspace(*buf))2440return0;24412442/*2443 * Update the preimage and the common postimage context2444 * lines to use the same whitespace as the target.2445 * If whitespace is missing in the target (i.e.2446 * if the preimage extends beyond the end of the file),2447 * use the whitespace from the preimage.2448 */2449 extra_chars = preimage_end - preimage_eof;2450strbuf_init(&fixed, imgoff + extra_chars);2451strbuf_add(&fixed, img->buf +try, imgoff);2452strbuf_add(&fixed, preimage_eof, extra_chars);2453 fixed_buf =strbuf_detach(&fixed, &fixed_len);2454update_pre_post_images(preimage, postimage,2455 fixed_buf, fixed_len, postlen);2456return1;2457}24582459static intmatch_fragment(struct apply_state *state,2460struct image *img,2461struct image *preimage,2462struct image *postimage,2463unsigned longtry,2464int try_lno,2465unsigned ws_rule,2466int match_beginning,int match_end)2467{2468int i;2469char*fixed_buf, *buf, *orig, *target;2470struct strbuf fixed;2471size_t fixed_len, postlen;2472int preimage_limit;24732474if(preimage->nr + try_lno <= img->nr) {2475/*2476 * The hunk falls within the boundaries of img.2477 */2478 preimage_limit = preimage->nr;2479if(match_end && (preimage->nr + try_lno != img->nr))2480return0;2481}else if(state->ws_error_action == correct_ws_error &&2482(ws_rule & WS_BLANK_AT_EOF)) {2483/*2484 * This hunk extends beyond the end of img, and we are2485 * removing blank lines at the end of the file. This2486 * many lines from the beginning of the preimage must2487 * match with img, and the remainder of the preimage2488 * must be blank.2489 */2490 preimage_limit = img->nr - try_lno;2491}else{2492/*2493 * The hunk extends beyond the end of the img and2494 * we are not removing blanks at the end, so we2495 * should reject the hunk at this position.2496 */2497return0;2498}24992500if(match_beginning && try_lno)2501return0;25022503/* Quick hash check */2504for(i =0; i < preimage_limit; i++)2505if((img->line[try_lno + i].flag & LINE_PATCHED) ||2506(preimage->line[i].hash != img->line[try_lno + i].hash))2507return0;25082509if(preimage_limit == preimage->nr) {2510/*2511 * Do we have an exact match? If we were told to match2512 * at the end, size must be exactly at try+fragsize,2513 * otherwise try+fragsize must be still within the preimage,2514 * and either case, the old piece should match the preimage2515 * exactly.2516 */2517if((match_end2518? (try+ preimage->len == img->len)2519: (try+ preimage->len <= img->len)) &&2520!memcmp(img->buf +try, preimage->buf, preimage->len))2521return1;2522}else{2523/*2524 * The preimage extends beyond the end of img, so2525 * there cannot be an exact match.2526 *2527 * There must be one non-blank context line that match2528 * a line before the end of img.2529 */2530char*buf_end;25312532 buf = preimage->buf;2533 buf_end = buf;2534for(i =0; i < preimage_limit; i++)2535 buf_end += preimage->line[i].len;25362537for( ; buf < buf_end; buf++)2538if(!isspace(*buf))2539break;2540if(buf == buf_end)2541return0;2542}25432544/*2545 * No exact match. If we are ignoring whitespace, run a line-by-line2546 * fuzzy matching. We collect all the line length information because2547 * we need it to adjust whitespace if we match.2548 */2549if(state->ws_ignore_action == ignore_ws_change)2550returnline_by_line_fuzzy_match(img, preimage, postimage,2551try, try_lno, preimage_limit);25522553if(state->ws_error_action != correct_ws_error)2554return0;25552556/*2557 * The hunk does not apply byte-by-byte, but the hash says2558 * it might with whitespace fuzz. We weren't asked to2559 * ignore whitespace, we were asked to correct whitespace2560 * errors, so let's try matching after whitespace correction.2561 *2562 * While checking the preimage against the target, whitespace2563 * errors in both fixed, we count how large the corresponding2564 * postimage needs to be. The postimage prepared by2565 * apply_one_fragment() has whitespace errors fixed on added2566 * lines already, but the common lines were propagated as-is,2567 * which may become longer when their whitespace errors are2568 * fixed.2569 */25702571/* First count added lines in postimage */2572 postlen =0;2573for(i =0; i < postimage->nr; i++) {2574if(!(postimage->line[i].flag & LINE_COMMON))2575 postlen += postimage->line[i].len;2576}25772578/*2579 * The preimage may extend beyond the end of the file,2580 * but in this loop we will only handle the part of the2581 * preimage that falls within the file.2582 */2583strbuf_init(&fixed, preimage->len +1);2584 orig = preimage->buf;2585 target = img->buf +try;2586for(i =0; i < preimage_limit; i++) {2587size_t oldlen = preimage->line[i].len;2588size_t tgtlen = img->line[try_lno + i].len;2589size_t fixstart = fixed.len;2590struct strbuf tgtfix;2591int match;25922593/* Try fixing the line in the preimage */2594ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);25952596/* Try fixing the line in the target */2597strbuf_init(&tgtfix, tgtlen);2598ws_fix_copy(&tgtfix, target, tgtlen, ws_rule, NULL);25992600/*2601 * If they match, either the preimage was based on2602 * a version before our tree fixed whitespace breakage,2603 * or we are lacking a whitespace-fix patch the tree2604 * the preimage was based on already had (i.e. target2605 * has whitespace breakage, the preimage doesn't).2606 * In either case, we are fixing the whitespace breakages2607 * so we might as well take the fix together with their2608 * real change.2609 */2610 match = (tgtfix.len == fixed.len - fixstart &&2611!memcmp(tgtfix.buf, fixed.buf + fixstart,2612 fixed.len - fixstart));26132614/* Add the length if this is common with the postimage */2615if(preimage->line[i].flag & LINE_COMMON)2616 postlen += tgtfix.len;26172618strbuf_release(&tgtfix);2619if(!match)2620goto unmatch_exit;26212622 orig += oldlen;2623 target += tgtlen;2624}262526262627/*2628 * Now handle the lines in the preimage that falls beyond the2629 * end of the file (if any). They will only match if they are2630 * empty or only contain whitespace (if WS_BLANK_AT_EOL is2631 * false).2632 */2633for( ; i < preimage->nr; i++) {2634size_t fixstart = fixed.len;/* start of the fixed preimage */2635size_t oldlen = preimage->line[i].len;2636int j;26372638/* Try fixing the line in the preimage */2639ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);26402641for(j = fixstart; j < fixed.len; j++)2642if(!isspace(fixed.buf[j]))2643goto unmatch_exit;26442645 orig += oldlen;2646}26472648/*2649 * Yes, the preimage is based on an older version that still2650 * has whitespace breakages unfixed, and fixing them makes the2651 * hunk match. Update the context lines in the postimage.2652 */2653 fixed_buf =strbuf_detach(&fixed, &fixed_len);2654if(postlen < postimage->len)2655 postlen =0;2656update_pre_post_images(preimage, postimage,2657 fixed_buf, fixed_len, postlen);2658return1;26592660 unmatch_exit:2661strbuf_release(&fixed);2662return0;2663}26642665static intfind_pos(struct apply_state *state,2666struct image *img,2667struct image *preimage,2668struct image *postimage,2669int line,2670unsigned ws_rule,2671int match_beginning,int match_end)2672{2673int i;2674unsigned long backwards, forwards,try;2675int backwards_lno, forwards_lno, try_lno;26762677/*2678 * If match_beginning or match_end is specified, there is no2679 * point starting from a wrong line that will never match and2680 * wander around and wait for a match at the specified end.2681 */2682if(match_beginning)2683 line =0;2684else if(match_end)2685 line = img->nr - preimage->nr;26862687/*2688 * Because the comparison is unsigned, the following test2689 * will also take care of a negative line number that can2690 * result when match_end and preimage is larger than the target.2691 */2692if((size_t) line > img->nr)2693 line = img->nr;26942695try=0;2696for(i =0; i < line; i++)2697try+= img->line[i].len;26982699/*2700 * There's probably some smart way to do this, but I'll leave2701 * that to the smart and beautiful people. I'm simple and stupid.2702 */2703 backwards =try;2704 backwards_lno = line;2705 forwards =try;2706 forwards_lno = line;2707 try_lno = line;27082709for(i =0; ; i++) {2710if(match_fragment(state, img, preimage, postimage,2711try, try_lno, ws_rule,2712 match_beginning, match_end))2713return try_lno;27142715 again:2716if(backwards_lno ==0&& forwards_lno == img->nr)2717break;27182719if(i &1) {2720if(backwards_lno ==0) {2721 i++;2722goto again;2723}2724 backwards_lno--;2725 backwards -= img->line[backwards_lno].len;2726try= backwards;2727 try_lno = backwards_lno;2728}else{2729if(forwards_lno == img->nr) {2730 i++;2731goto again;2732}2733 forwards += img->line[forwards_lno].len;2734 forwards_lno++;2735try= forwards;2736 try_lno = forwards_lno;2737}27382739}2740return-1;2741}27422743static voidremove_first_line(struct image *img)2744{2745 img->buf += img->line[0].len;2746 img->len -= img->line[0].len;2747 img->line++;2748 img->nr--;2749}27502751static voidremove_last_line(struct image *img)2752{2753 img->len -= img->line[--img->nr].len;2754}27552756/*2757 * The change from "preimage" and "postimage" has been found to2758 * apply at applied_pos (counts in line numbers) in "img".2759 * Update "img" to remove "preimage" and replace it with "postimage".2760 */2761static voidupdate_image(struct apply_state *state,2762struct image *img,2763int applied_pos,2764struct image *preimage,2765struct image *postimage)2766{2767/*2768 * remove the copy of preimage at offset in img2769 * and replace it with postimage2770 */2771int i, nr;2772size_t remove_count, insert_count, applied_at =0;2773char*result;2774int preimage_limit;27752776/*2777 * If we are removing blank lines at the end of img,2778 * the preimage may extend beyond the end.2779 * If that is the case, we must be careful only to2780 * remove the part of the preimage that falls within2781 * the boundaries of img. Initialize preimage_limit2782 * to the number of lines in the preimage that falls2783 * within the boundaries.2784 */2785 preimage_limit = preimage->nr;2786if(preimage_limit > img->nr - applied_pos)2787 preimage_limit = img->nr - applied_pos;27882789for(i =0; i < applied_pos; i++)2790 applied_at += img->line[i].len;27912792 remove_count =0;2793for(i =0; i < preimage_limit; i++)2794 remove_count += img->line[applied_pos + i].len;2795 insert_count = postimage->len;27962797/* Adjust the contents */2798 result =xmalloc(st_add3(st_sub(img->len, remove_count), insert_count,1));2799memcpy(result, img->buf, applied_at);2800memcpy(result + applied_at, postimage->buf, postimage->len);2801memcpy(result + applied_at + postimage->len,2802 img->buf + (applied_at + remove_count),2803 img->len - (applied_at + remove_count));2804free(img->buf);2805 img->buf = result;2806 img->len += insert_count - remove_count;2807 result[img->len] ='\0';28082809/* Adjust the line table */2810 nr = img->nr + postimage->nr - preimage_limit;2811if(preimage_limit < postimage->nr) {2812/*2813 * NOTE: this knows that we never call remove_first_line()2814 * on anything other than pre/post image.2815 */2816REALLOC_ARRAY(img->line, nr);2817 img->line_allocated = img->line;2818}2819if(preimage_limit != postimage->nr)2820MOVE_ARRAY(img->line + applied_pos + postimage->nr,2821 img->line + applied_pos + preimage_limit,2822 img->nr - (applied_pos + preimage_limit));2823COPY_ARRAY(img->line + applied_pos, postimage->line, postimage->nr);2824if(!state->allow_overlap)2825for(i =0; i < postimage->nr; i++)2826 img->line[applied_pos + i].flag |= LINE_PATCHED;2827 img->nr = nr;2828}28292830/*2831 * Use the patch-hunk text in "frag" to prepare two images (preimage and2832 * postimage) for the hunk. Find lines that match "preimage" in "img" and2833 * replace the part of "img" with "postimage" text.2834 */2835static intapply_one_fragment(struct apply_state *state,2836struct image *img,struct fragment *frag,2837int inaccurate_eof,unsigned ws_rule,2838int nth_fragment)2839{2840int match_beginning, match_end;2841const char*patch = frag->patch;2842int size = frag->size;2843char*old, *oldlines;2844struct strbuf newlines;2845int new_blank_lines_at_end =0;2846int found_new_blank_lines_at_end =0;2847int hunk_linenr = frag->linenr;2848unsigned long leading, trailing;2849int pos, applied_pos;2850struct image preimage;2851struct image postimage;28522853memset(&preimage,0,sizeof(preimage));2854memset(&postimage,0,sizeof(postimage));2855 oldlines =xmalloc(size);2856strbuf_init(&newlines, size);28572858 old = oldlines;2859while(size >0) {2860char first;2861int len =linelen(patch, size);2862int plen;2863int added_blank_line =0;2864int is_blank_context =0;2865size_t start;28662867if(!len)2868break;28692870/*2871 * "plen" is how much of the line we should use for2872 * the actual patch data. Normally we just remove the2873 * first character on the line, but if the line is2874 * followed by "\ No newline", then we also remove the2875 * last one (which is the newline, of course).2876 */2877 plen = len -1;2878if(len < size && patch[len] =='\\')2879 plen--;2880 first = *patch;2881if(state->apply_in_reverse) {2882if(first =='-')2883 first ='+';2884else if(first =='+')2885 first ='-';2886}28872888switch(first) {2889case'\n':2890/* Newer GNU diff, empty context line */2891if(plen <0)2892/* ... followed by '\No newline'; nothing */2893break;2894*old++ ='\n';2895strbuf_addch(&newlines,'\n');2896add_line_info(&preimage,"\n",1, LINE_COMMON);2897add_line_info(&postimage,"\n",1, LINE_COMMON);2898 is_blank_context =1;2899break;2900case' ':2901if(plen && (ws_rule & WS_BLANK_AT_EOF) &&2902ws_blank_line(patch +1, plen, ws_rule))2903 is_blank_context =1;2904/* fallthrough */2905case'-':2906memcpy(old, patch +1, plen);2907add_line_info(&preimage, old, plen,2908(first ==' '? LINE_COMMON :0));2909 old += plen;2910if(first =='-')2911break;2912/* fallthrough */2913case'+':2914/* --no-add does not add new lines */2915if(first =='+'&& state->no_add)2916break;29172918 start = newlines.len;2919if(first !='+'||2920!state->whitespace_error ||2921 state->ws_error_action != correct_ws_error) {2922strbuf_add(&newlines, patch +1, plen);2923}2924else{2925ws_fix_copy(&newlines, patch +1, plen, ws_rule, &state->applied_after_fixing_ws);2926}2927add_line_info(&postimage, newlines.buf + start, newlines.len - start,2928(first =='+'?0: LINE_COMMON));2929if(first =='+'&&2930(ws_rule & WS_BLANK_AT_EOF) &&2931ws_blank_line(patch +1, plen, ws_rule))2932 added_blank_line =1;2933break;2934case'@':case'\\':2935/* Ignore it, we already handled it */2936break;2937default:2938if(state->apply_verbosity > verbosity_normal)2939error(_("invalid start of line: '%c'"), first);2940 applied_pos = -1;2941goto out;2942}2943if(added_blank_line) {2944if(!new_blank_lines_at_end)2945 found_new_blank_lines_at_end = hunk_linenr;2946 new_blank_lines_at_end++;2947}2948else if(is_blank_context)2949;2950else2951 new_blank_lines_at_end =0;2952 patch += len;2953 size -= len;2954 hunk_linenr++;2955}2956if(inaccurate_eof &&2957 old > oldlines && old[-1] =='\n'&&2958 newlines.len >0&& newlines.buf[newlines.len -1] =='\n') {2959 old--;2960strbuf_setlen(&newlines, newlines.len -1);2961 preimage.line_allocated[preimage.nr -1].len--;2962 postimage.line_allocated[postimage.nr -1].len--;2963}29642965 leading = frag->leading;2966 trailing = frag->trailing;29672968/*2969 * A hunk to change lines at the beginning would begin with2970 * @@ -1,L +N,M @@2971 * but we need to be careful. -U0 that inserts before the second2972 * line also has this pattern.2973 *2974 * And a hunk to add to an empty file would begin with2975 * @@ -0,0 +N,M @@2976 *2977 * In other words, a hunk that is (frag->oldpos <= 1) with or2978 * without leading context must match at the beginning.2979 */2980 match_beginning = (!frag->oldpos ||2981(frag->oldpos ==1&& !state->unidiff_zero));29822983/*2984 * A hunk without trailing lines must match at the end.2985 * However, we simply cannot tell if a hunk must match end2986 * from the lack of trailing lines if the patch was generated2987 * with unidiff without any context.2988 */2989 match_end = !state->unidiff_zero && !trailing;29902991 pos = frag->newpos ? (frag->newpos -1) :0;2992 preimage.buf = oldlines;2993 preimage.len = old - oldlines;2994 postimage.buf = newlines.buf;2995 postimage.len = newlines.len;2996 preimage.line = preimage.line_allocated;2997 postimage.line = postimage.line_allocated;29982999for(;;) {30003001 applied_pos =find_pos(state, img, &preimage, &postimage, pos,3002 ws_rule, match_beginning, match_end);30033004if(applied_pos >=0)3005break;30063007/* Am I at my context limits? */3008if((leading <= state->p_context) && (trailing <= state->p_context))3009break;3010if(match_beginning || match_end) {3011 match_beginning = match_end =0;3012continue;3013}30143015/*3016 * Reduce the number of context lines; reduce both3017 * leading and trailing if they are equal otherwise3018 * just reduce the larger context.3019 */3020if(leading >= trailing) {3021remove_first_line(&preimage);3022remove_first_line(&postimage);3023 pos--;3024 leading--;3025}3026if(trailing > leading) {3027remove_last_line(&preimage);3028remove_last_line(&postimage);3029 trailing--;3030}3031}30323033if(applied_pos >=0) {3034if(new_blank_lines_at_end &&3035 preimage.nr + applied_pos >= img->nr &&3036(ws_rule & WS_BLANK_AT_EOF) &&3037 state->ws_error_action != nowarn_ws_error) {3038record_ws_error(state, WS_BLANK_AT_EOF,"+",1,3039 found_new_blank_lines_at_end);3040if(state->ws_error_action == correct_ws_error) {3041while(new_blank_lines_at_end--)3042remove_last_line(&postimage);3043}3044/*3045 * We would want to prevent write_out_results()3046 * from taking place in apply_patch() that follows3047 * the callchain led us here, which is:3048 * apply_patch->check_patch_list->check_patch->3049 * apply_data->apply_fragments->apply_one_fragment3050 */3051if(state->ws_error_action == die_on_ws_error)3052 state->apply =0;3053}30543055if(state->apply_verbosity > verbosity_normal && applied_pos != pos) {3056int offset = applied_pos - pos;3057if(state->apply_in_reverse)3058 offset =0- offset;3059fprintf_ln(stderr,3060Q_("Hunk #%dsucceeded at%d(offset%dline).",3061"Hunk #%dsucceeded at%d(offset%dlines).",3062 offset),3063 nth_fragment, applied_pos +1, offset);3064}30653066/*3067 * Warn if it was necessary to reduce the number3068 * of context lines.3069 */3070if((leading != frag->leading ||3071 trailing != frag->trailing) && state->apply_verbosity > verbosity_silent)3072fprintf_ln(stderr,_("Context reduced to (%ld/%ld)"3073" to apply fragment at%d"),3074 leading, trailing, applied_pos+1);3075update_image(state, img, applied_pos, &preimage, &postimage);3076}else{3077if(state->apply_verbosity > verbosity_normal)3078error(_("while searching for:\n%.*s"),3079(int)(old - oldlines), oldlines);3080}30813082out:3083free(oldlines);3084strbuf_release(&newlines);3085free(preimage.line_allocated);3086free(postimage.line_allocated);30873088return(applied_pos <0);3089}30903091static intapply_binary_fragment(struct apply_state *state,3092struct image *img,3093struct patch *patch)3094{3095struct fragment *fragment = patch->fragments;3096unsigned long len;3097void*dst;30983099if(!fragment)3100returnerror(_("missing binary patch data for '%s'"),3101 patch->new_name ?3102 patch->new_name :3103 patch->old_name);31043105/* Binary patch is irreversible without the optional second hunk */3106if(state->apply_in_reverse) {3107if(!fragment->next)3108returnerror(_("cannot reverse-apply a binary patch "3109"without the reverse hunk to '%s'"),3110 patch->new_name3111? patch->new_name : patch->old_name);3112 fragment = fragment->next;3113}3114switch(fragment->binary_patch_method) {3115case BINARY_DELTA_DEFLATED:3116 dst =patch_delta(img->buf, img->len, fragment->patch,3117 fragment->size, &len);3118if(!dst)3119return-1;3120clear_image(img);3121 img->buf = dst;3122 img->len = len;3123return0;3124case BINARY_LITERAL_DEFLATED:3125clear_image(img);3126 img->len = fragment->size;3127 img->buf =xmemdupz(fragment->patch, img->len);3128return0;3129}3130return-1;3131}31323133/*3134 * Replace "img" with the result of applying the binary patch.3135 * The binary patch data itself in patch->fragment is still kept3136 * but the preimage prepared by the caller in "img" is freed here3137 * or in the helper function apply_binary_fragment() this calls.3138 */3139static intapply_binary(struct apply_state *state,3140struct image *img,3141struct patch *patch)3142{3143const char*name = patch->old_name ? patch->old_name : patch->new_name;3144struct object_id oid;31453146/*3147 * For safety, we require patch index line to contain3148 * full 40-byte textual SHA1 for old and new, at least for now.3149 */3150if(strlen(patch->old_sha1_prefix) !=40||3151strlen(patch->new_sha1_prefix) !=40||3152get_oid_hex(patch->old_sha1_prefix, &oid) ||3153get_oid_hex(patch->new_sha1_prefix, &oid))3154returnerror(_("cannot apply binary patch to '%s' "3155"without full index line"), name);31563157if(patch->old_name) {3158/*3159 * See if the old one matches what the patch3160 * applies to.3161 */3162hash_sha1_file(img->buf, img->len, blob_type, oid.hash);3163if(strcmp(oid_to_hex(&oid), patch->old_sha1_prefix))3164returnerror(_("the patch applies to '%s' (%s), "3165"which does not match the "3166"current contents."),3167 name,oid_to_hex(&oid));3168}3169else{3170/* Otherwise, the old one must be empty. */3171if(img->len)3172returnerror(_("the patch applies to an empty "3173"'%s' but it is not empty"), name);3174}31753176get_oid_hex(patch->new_sha1_prefix, &oid);3177if(is_null_oid(&oid)) {3178clear_image(img);3179return0;/* deletion patch */3180}31813182if(has_sha1_file(oid.hash)) {3183/* We already have the postimage */3184enum object_type type;3185unsigned long size;3186char*result;31873188 result =read_sha1_file(oid.hash, &type, &size);3189if(!result)3190returnerror(_("the necessary postimage%sfor "3191"'%s' cannot be read"),3192 patch->new_sha1_prefix, name);3193clear_image(img);3194 img->buf = result;3195 img->len = size;3196}else{3197/*3198 * We have verified buf matches the preimage;3199 * apply the patch data to it, which is stored3200 * in the patch->fragments->{patch,size}.3201 */3202if(apply_binary_fragment(state, img, patch))3203returnerror(_("binary patch does not apply to '%s'"),3204 name);32053206/* verify that the result matches */3207hash_sha1_file(img->buf, img->len, blob_type, oid.hash);3208if(strcmp(oid_to_hex(&oid), patch->new_sha1_prefix))3209returnerror(_("binary patch to '%s' creates incorrect result (expecting%s, got%s)"),3210 name, patch->new_sha1_prefix,oid_to_hex(&oid));3211}32123213return0;3214}32153216static intapply_fragments(struct apply_state *state,struct image *img,struct patch *patch)3217{3218struct fragment *frag = patch->fragments;3219const char*name = patch->old_name ? patch->old_name : patch->new_name;3220unsigned ws_rule = patch->ws_rule;3221unsigned inaccurate_eof = patch->inaccurate_eof;3222int nth =0;32233224if(patch->is_binary)3225returnapply_binary(state, img, patch);32263227while(frag) {3228 nth++;3229if(apply_one_fragment(state, img, frag, inaccurate_eof, ws_rule, nth)) {3230error(_("patch failed:%s:%ld"), name, frag->oldpos);3231if(!state->apply_with_reject)3232return-1;3233 frag->rejected =1;3234}3235 frag = frag->next;3236}3237return0;3238}32393240static intread_blob_object(struct strbuf *buf,const struct object_id *oid,unsigned mode)3241{3242if(S_ISGITLINK(mode)) {3243strbuf_grow(buf,100);3244strbuf_addf(buf,"Subproject commit%s\n",oid_to_hex(oid));3245}else{3246enum object_type type;3247unsigned long sz;3248char*result;32493250 result =read_sha1_file(oid->hash, &type, &sz);3251if(!result)3252return-1;3253/* XXX read_sha1_file NUL-terminates */3254strbuf_attach(buf, result, sz, sz +1);3255}3256return0;3257}32583259static intread_file_or_gitlink(const struct cache_entry *ce,struct strbuf *buf)3260{3261if(!ce)3262return0;3263returnread_blob_object(buf, &ce->oid, ce->ce_mode);3264}32653266static struct patch *in_fn_table(struct apply_state *state,const char*name)3267{3268struct string_list_item *item;32693270if(name == NULL)3271return NULL;32723273 item =string_list_lookup(&state->fn_table, name);3274if(item != NULL)3275return(struct patch *)item->util;32763277return NULL;3278}32793280/*3281 * item->util in the filename table records the status of the path.3282 * Usually it points at a patch (whose result records the contents3283 * of it after applying it), but it could be PATH_WAS_DELETED for a3284 * path that a previously applied patch has already removed, or3285 * PATH_TO_BE_DELETED for a path that a later patch would remove.3286 *3287 * The latter is needed to deal with a case where two paths A and B3288 * are swapped by first renaming A to B and then renaming B to A;3289 * moving A to B should not be prevented due to presence of B as we3290 * will remove it in a later patch.3291 */3292#define PATH_TO_BE_DELETED ((struct patch *) -2)3293#define PATH_WAS_DELETED ((struct patch *) -1)32943295static intto_be_deleted(struct patch *patch)3296{3297return patch == PATH_TO_BE_DELETED;3298}32993300static intwas_deleted(struct patch *patch)3301{3302return patch == PATH_WAS_DELETED;3303}33043305static voidadd_to_fn_table(struct apply_state *state,struct patch *patch)3306{3307struct string_list_item *item;33083309/*3310 * Always add new_name unless patch is a deletion3311 * This should cover the cases for normal diffs,3312 * file creations and copies3313 */3314if(patch->new_name != NULL) {3315 item =string_list_insert(&state->fn_table, patch->new_name);3316 item->util = patch;3317}33183319/*3320 * store a failure on rename/deletion cases because3321 * later chunks shouldn't patch old names3322 */3323if((patch->new_name == NULL) || (patch->is_rename)) {3324 item =string_list_insert(&state->fn_table, patch->old_name);3325 item->util = PATH_WAS_DELETED;3326}3327}33283329static voidprepare_fn_table(struct apply_state *state,struct patch *patch)3330{3331/*3332 * store information about incoming file deletion3333 */3334while(patch) {3335if((patch->new_name == NULL) || (patch->is_rename)) {3336struct string_list_item *item;3337 item =string_list_insert(&state->fn_table, patch->old_name);3338 item->util = PATH_TO_BE_DELETED;3339}3340 patch = patch->next;3341}3342}33433344static intcheckout_target(struct index_state *istate,3345struct cache_entry *ce,struct stat *st)3346{3347struct checkout costate = CHECKOUT_INIT;33483349 costate.refresh_cache =1;3350 costate.istate = istate;3351if(checkout_entry(ce, &costate, NULL) ||lstat(ce->name, st))3352returnerror(_("cannot checkout%s"), ce->name);3353return0;3354}33553356static struct patch *previous_patch(struct apply_state *state,3357struct patch *patch,3358int*gone)3359{3360struct patch *previous;33613362*gone =0;3363if(patch->is_copy || patch->is_rename)3364return NULL;/* "git" patches do not depend on the order */33653366 previous =in_fn_table(state, patch->old_name);3367if(!previous)3368return NULL;33693370if(to_be_deleted(previous))3371return NULL;/* the deletion hasn't happened yet */33723373if(was_deleted(previous))3374*gone =1;33753376return previous;3377}33783379static intverify_index_match(const struct cache_entry *ce,struct stat *st)3380{3381if(S_ISGITLINK(ce->ce_mode)) {3382if(!S_ISDIR(st->st_mode))3383return-1;3384return0;3385}3386returnce_match_stat(ce, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);3387}33883389#define SUBMODULE_PATCH_WITHOUT_INDEX 133903391static intload_patch_target(struct apply_state *state,3392struct strbuf *buf,3393const struct cache_entry *ce,3394struct stat *st,3395struct patch *patch,3396const char*name,3397unsigned expected_mode)3398{3399if(state->cached || state->check_index) {3400if(read_file_or_gitlink(ce, buf))3401returnerror(_("failed to read%s"), name);3402}else if(name) {3403if(S_ISGITLINK(expected_mode)) {3404if(ce)3405returnread_file_or_gitlink(ce, buf);3406else3407return SUBMODULE_PATCH_WITHOUT_INDEX;3408}else if(has_symlink_leading_path(name,strlen(name))) {3409returnerror(_("reading from '%s' beyond a symbolic link"), name);3410}else{3411if(read_old_data(st, patch, name, buf))3412returnerror(_("failed to read%s"), name);3413}3414}3415return0;3416}34173418/*3419 * We are about to apply "patch"; populate the "image" with the3420 * current version we have, from the working tree or from the index,3421 * depending on the situation e.g. --cached/--index. If we are3422 * applying a non-git patch that incrementally updates the tree,3423 * we read from the result of a previous diff.3424 */3425static intload_preimage(struct apply_state *state,3426struct image *image,3427struct patch *patch,struct stat *st,3428const struct cache_entry *ce)3429{3430struct strbuf buf = STRBUF_INIT;3431size_t len;3432char*img;3433struct patch *previous;3434int status;34353436 previous =previous_patch(state, patch, &status);3437if(status)3438returnerror(_("path%shas been renamed/deleted"),3439 patch->old_name);3440if(previous) {3441/* We have a patched copy in memory; use that. */3442strbuf_add(&buf, previous->result, previous->resultsize);3443}else{3444 status =load_patch_target(state, &buf, ce, st, patch,3445 patch->old_name, patch->old_mode);3446if(status <0)3447return status;3448else if(status == SUBMODULE_PATCH_WITHOUT_INDEX) {3449/*3450 * There is no way to apply subproject3451 * patch without looking at the index.3452 * NEEDSWORK: shouldn't this be flagged3453 * as an error???3454 */3455free_fragment_list(patch->fragments);3456 patch->fragments = NULL;3457}else if(status) {3458returnerror(_("failed to read%s"), patch->old_name);3459}3460}34613462 img =strbuf_detach(&buf, &len);3463prepare_image(image, img, len, !patch->is_binary);3464return0;3465}34663467static intthree_way_merge(struct image *image,3468char*path,3469const struct object_id *base,3470const struct object_id *ours,3471const struct object_id *theirs)3472{3473 mmfile_t base_file, our_file, their_file;3474 mmbuffer_t result = { NULL };3475int status;34763477read_mmblob(&base_file, base);3478read_mmblob(&our_file, ours);3479read_mmblob(&their_file, theirs);3480 status =ll_merge(&result, path,3481&base_file,"base",3482&our_file,"ours",3483&their_file,"theirs", NULL);3484free(base_file.ptr);3485free(our_file.ptr);3486free(their_file.ptr);3487if(status <0|| !result.ptr) {3488free(result.ptr);3489return-1;3490}3491clear_image(image);3492 image->buf = result.ptr;3493 image->len = result.size;34943495return status;3496}34973498/*3499 * When directly falling back to add/add three-way merge, we read from3500 * the current contents of the new_name. In no cases other than that3501 * this function will be called.3502 */3503static intload_current(struct apply_state *state,3504struct image *image,3505struct patch *patch)3506{3507struct strbuf buf = STRBUF_INIT;3508int status, pos;3509size_t len;3510char*img;3511struct stat st;3512struct cache_entry *ce;3513char*name = patch->new_name;3514unsigned mode = patch->new_mode;35153516if(!patch->is_new)3517die("BUG: patch to%sis not a creation", patch->old_name);35183519 pos =cache_name_pos(name,strlen(name));3520if(pos <0)3521returnerror(_("%s: does not exist in index"), name);3522 ce = active_cache[pos];3523if(lstat(name, &st)) {3524if(errno != ENOENT)3525returnerror_errno("%s", name);3526if(checkout_target(&the_index, ce, &st))3527return-1;3528}3529if(verify_index_match(ce, &st))3530returnerror(_("%s: does not match index"), name);35313532 status =load_patch_target(state, &buf, ce, &st, patch, name, mode);3533if(status <0)3534return status;3535else if(status)3536return-1;3537 img =strbuf_detach(&buf, &len);3538prepare_image(image, img, len, !patch->is_binary);3539return0;3540}35413542static inttry_threeway(struct apply_state *state,3543struct image *image,3544struct patch *patch,3545struct stat *st,3546const struct cache_entry *ce)3547{3548struct object_id pre_oid, post_oid, our_oid;3549struct strbuf buf = STRBUF_INIT;3550size_t len;3551int status;3552char*img;3553struct image tmp_image;35543555/* No point falling back to 3-way merge in these cases */3556if(patch->is_delete ||3557S_ISGITLINK(patch->old_mode) ||S_ISGITLINK(patch->new_mode))3558return-1;35593560/* Preimage the patch was prepared for */3561if(patch->is_new)3562write_sha1_file("",0, blob_type, pre_oid.hash);3563else if(get_oid(patch->old_sha1_prefix, &pre_oid) ||3564read_blob_object(&buf, &pre_oid, patch->old_mode))3565returnerror(_("repository lacks the necessary blob to fall back on 3-way merge."));35663567if(state->apply_verbosity > verbosity_silent)3568fprintf(stderr,_("Falling back to three-way merge...\n"));35693570 img =strbuf_detach(&buf, &len);3571prepare_image(&tmp_image, img, len,1);3572/* Apply the patch to get the post image */3573if(apply_fragments(state, &tmp_image, patch) <0) {3574clear_image(&tmp_image);3575return-1;3576}3577/* post_oid is theirs */3578write_sha1_file(tmp_image.buf, tmp_image.len, blob_type, post_oid.hash);3579clear_image(&tmp_image);35803581/* our_oid is ours */3582if(patch->is_new) {3583if(load_current(state, &tmp_image, patch))3584returnerror(_("cannot read the current contents of '%s'"),3585 patch->new_name);3586}else{3587if(load_preimage(state, &tmp_image, patch, st, ce))3588returnerror(_("cannot read the current contents of '%s'"),3589 patch->old_name);3590}3591write_sha1_file(tmp_image.buf, tmp_image.len, blob_type, our_oid.hash);3592clear_image(&tmp_image);35933594/* in-core three-way merge between post and our using pre as base */3595 status =three_way_merge(image, patch->new_name,3596&pre_oid, &our_oid, &post_oid);3597if(status <0) {3598if(state->apply_verbosity > verbosity_silent)3599fprintf(stderr,3600_("Failed to fall back on three-way merge...\n"));3601return status;3602}36033604if(status) {3605 patch->conflicted_threeway =1;3606if(patch->is_new)3607oidclr(&patch->threeway_stage[0]);3608else3609oidcpy(&patch->threeway_stage[0], &pre_oid);3610oidcpy(&patch->threeway_stage[1], &our_oid);3611oidcpy(&patch->threeway_stage[2], &post_oid);3612if(state->apply_verbosity > verbosity_silent)3613fprintf(stderr,3614_("Applied patch to '%s' with conflicts.\n"),3615 patch->new_name);3616}else{3617if(state->apply_verbosity > verbosity_silent)3618fprintf(stderr,3619_("Applied patch to '%s' cleanly.\n"),3620 patch->new_name);3621}3622return0;3623}36243625static intapply_data(struct apply_state *state,struct patch *patch,3626struct stat *st,const struct cache_entry *ce)3627{3628struct image image;36293630if(load_preimage(state, &image, patch, st, ce) <0)3631return-1;36323633if(patch->direct_to_threeway ||3634apply_fragments(state, &image, patch) <0) {3635/* Note: with --reject, apply_fragments() returns 0 */3636if(!state->threeway ||try_threeway(state, &image, patch, st, ce) <0)3637return-1;3638}3639 patch->result = image.buf;3640 patch->resultsize = image.len;3641add_to_fn_table(state, patch);3642free(image.line_allocated);36433644if(0< patch->is_delete && patch->resultsize)3645returnerror(_("removal patch leaves file contents"));36463647return0;3648}36493650/*3651 * If "patch" that we are looking at modifies or deletes what we have,3652 * we would want it not to lose any local modification we have, either3653 * in the working tree or in the index.3654 *3655 * This also decides if a non-git patch is a creation patch or a3656 * modification to an existing empty file. We do not check the state3657 * of the current tree for a creation patch in this function; the caller3658 * check_patch() separately makes sure (and errors out otherwise) that3659 * the path the patch creates does not exist in the current tree.3660 */3661static intcheck_preimage(struct apply_state *state,3662struct patch *patch,3663struct cache_entry **ce,3664struct stat *st)3665{3666const char*old_name = patch->old_name;3667struct patch *previous = NULL;3668int stat_ret =0, status;3669unsigned st_mode =0;36703671if(!old_name)3672return0;36733674assert(patch->is_new <=0);3675 previous =previous_patch(state, patch, &status);36763677if(status)3678returnerror(_("path%shas been renamed/deleted"), old_name);3679if(previous) {3680 st_mode = previous->new_mode;3681}else if(!state->cached) {3682 stat_ret =lstat(old_name, st);3683if(stat_ret && errno != ENOENT)3684returnerror_errno("%s", old_name);3685}36863687if(state->check_index && !previous) {3688int pos =cache_name_pos(old_name,strlen(old_name));3689if(pos <0) {3690if(patch->is_new <0)3691goto is_new;3692returnerror(_("%s: does not exist in index"), old_name);3693}3694*ce = active_cache[pos];3695if(stat_ret <0) {3696if(checkout_target(&the_index, *ce, st))3697return-1;3698}3699if(!state->cached &&verify_index_match(*ce, st))3700returnerror(_("%s: does not match index"), old_name);3701if(state->cached)3702 st_mode = (*ce)->ce_mode;3703}else if(stat_ret <0) {3704if(patch->is_new <0)3705goto is_new;3706returnerror_errno("%s", old_name);3707}37083709if(!state->cached && !previous)3710 st_mode =ce_mode_from_stat(*ce, st->st_mode);37113712if(patch->is_new <0)3713 patch->is_new =0;3714if(!patch->old_mode)3715 patch->old_mode = st_mode;3716if((st_mode ^ patch->old_mode) & S_IFMT)3717returnerror(_("%s: wrong type"), old_name);3718if(st_mode != patch->old_mode)3719warning(_("%shas type%o, expected%o"),3720 old_name, st_mode, patch->old_mode);3721if(!patch->new_mode && !patch->is_delete)3722 patch->new_mode = st_mode;3723return0;37243725 is_new:3726 patch->is_new =1;3727 patch->is_delete =0;3728FREE_AND_NULL(patch->old_name);3729return0;3730}373137323733#define EXISTS_IN_INDEX 13734#define EXISTS_IN_WORKTREE 237353736static intcheck_to_create(struct apply_state *state,3737const char*new_name,3738int ok_if_exists)3739{3740struct stat nst;37413742if(state->check_index &&3743cache_name_pos(new_name,strlen(new_name)) >=0&&3744!ok_if_exists)3745return EXISTS_IN_INDEX;3746if(state->cached)3747return0;37483749if(!lstat(new_name, &nst)) {3750if(S_ISDIR(nst.st_mode) || ok_if_exists)3751return0;3752/*3753 * A leading component of new_name might be a symlink3754 * that is going to be removed with this patch, but3755 * still pointing at somewhere that has the path.3756 * In such a case, path "new_name" does not exist as3757 * far as git is concerned.3758 */3759if(has_symlink_leading_path(new_name,strlen(new_name)))3760return0;37613762return EXISTS_IN_WORKTREE;3763}else if(!is_missing_file_error(errno)) {3764returnerror_errno("%s", new_name);3765}3766return0;3767}37683769static uintptr_tregister_symlink_changes(struct apply_state *state,3770const char*path,3771uintptr_t what)3772{3773struct string_list_item *ent;37743775 ent =string_list_lookup(&state->symlink_changes, path);3776if(!ent) {3777 ent =string_list_insert(&state->symlink_changes, path);3778 ent->util = (void*)0;3779}3780 ent->util = (void*)(what | ((uintptr_t)ent->util));3781return(uintptr_t)ent->util;3782}37833784static uintptr_tcheck_symlink_changes(struct apply_state *state,const char*path)3785{3786struct string_list_item *ent;37873788 ent =string_list_lookup(&state->symlink_changes, path);3789if(!ent)3790return0;3791return(uintptr_t)ent->util;3792}37933794static voidprepare_symlink_changes(struct apply_state *state,struct patch *patch)3795{3796for( ; patch; patch = patch->next) {3797if((patch->old_name &&S_ISLNK(patch->old_mode)) &&3798(patch->is_rename || patch->is_delete))3799/* the symlink at patch->old_name is removed */3800register_symlink_changes(state, patch->old_name, APPLY_SYMLINK_GOES_AWAY);38013802if(patch->new_name &&S_ISLNK(patch->new_mode))3803/* the symlink at patch->new_name is created or remains */3804register_symlink_changes(state, patch->new_name, APPLY_SYMLINK_IN_RESULT);3805}3806}38073808static intpath_is_beyond_symlink_1(struct apply_state *state,struct strbuf *name)3809{3810do{3811unsigned int change;38123813while(--name->len && name->buf[name->len] !='/')3814;/* scan backwards */3815if(!name->len)3816break;3817 name->buf[name->len] ='\0';3818 change =check_symlink_changes(state, name->buf);3819if(change & APPLY_SYMLINK_IN_RESULT)3820return1;3821if(change & APPLY_SYMLINK_GOES_AWAY)3822/*3823 * This cannot be "return 0", because we may3824 * see a new one created at a higher level.3825 */3826continue;38273828/* otherwise, check the preimage */3829if(state->check_index) {3830struct cache_entry *ce;38313832 ce =cache_file_exists(name->buf, name->len, ignore_case);3833if(ce &&S_ISLNK(ce->ce_mode))3834return1;3835}else{3836struct stat st;3837if(!lstat(name->buf, &st) &&S_ISLNK(st.st_mode))3838return1;3839}3840}while(1);3841return0;3842}38433844static intpath_is_beyond_symlink(struct apply_state *state,const char*name_)3845{3846int ret;3847struct strbuf name = STRBUF_INIT;38483849assert(*name_ !='\0');3850strbuf_addstr(&name, name_);3851 ret =path_is_beyond_symlink_1(state, &name);3852strbuf_release(&name);38533854return ret;3855}38563857static intcheck_unsafe_path(struct patch *patch)3858{3859const char*old_name = NULL;3860const char*new_name = NULL;3861if(patch->is_delete)3862 old_name = patch->old_name;3863else if(!patch->is_new && !patch->is_copy)3864 old_name = patch->old_name;3865if(!patch->is_delete)3866 new_name = patch->new_name;38673868if(old_name && !verify_path(old_name))3869returnerror(_("invalid path '%s'"), old_name);3870if(new_name && !verify_path(new_name))3871returnerror(_("invalid path '%s'"), new_name);3872return0;3873}38743875/*3876 * Check and apply the patch in-core; leave the result in patch->result3877 * for the caller to write it out to the final destination.3878 */3879static intcheck_patch(struct apply_state *state,struct patch *patch)3880{3881struct stat st;3882const char*old_name = patch->old_name;3883const char*new_name = patch->new_name;3884const char*name = old_name ? old_name : new_name;3885struct cache_entry *ce = NULL;3886struct patch *tpatch;3887int ok_if_exists;3888int status;38893890 patch->rejected =1;/* we will drop this after we succeed */38913892 status =check_preimage(state, patch, &ce, &st);3893if(status)3894return status;3895 old_name = patch->old_name;38963897/*3898 * A type-change diff is always split into a patch to delete3899 * old, immediately followed by a patch to create new (see3900 * diff.c::run_diff()); in such a case it is Ok that the entry3901 * to be deleted by the previous patch is still in the working3902 * tree and in the index.3903 *3904 * A patch to swap-rename between A and B would first rename A3905 * to B and then rename B to A. While applying the first one,3906 * the presence of B should not stop A from getting renamed to3907 * B; ask to_be_deleted() about the later rename. Removal of3908 * B and rename from A to B is handled the same way by asking3909 * was_deleted().3910 */3911if((tpatch =in_fn_table(state, new_name)) &&3912(was_deleted(tpatch) ||to_be_deleted(tpatch)))3913 ok_if_exists =1;3914else3915 ok_if_exists =0;39163917if(new_name &&3918((0< patch->is_new) || patch->is_rename || patch->is_copy)) {3919int err =check_to_create(state, new_name, ok_if_exists);39203921if(err && state->threeway) {3922 patch->direct_to_threeway =1;3923}else switch(err) {3924case0:3925break;/* happy */3926case EXISTS_IN_INDEX:3927returnerror(_("%s: already exists in index"), new_name);3928break;3929case EXISTS_IN_WORKTREE:3930returnerror(_("%s: already exists in working directory"),3931 new_name);3932default:3933return err;3934}39353936if(!patch->new_mode) {3937if(0< patch->is_new)3938 patch->new_mode = S_IFREG |0644;3939else3940 patch->new_mode = patch->old_mode;3941}3942}39433944if(new_name && old_name) {3945int same = !strcmp(old_name, new_name);3946if(!patch->new_mode)3947 patch->new_mode = patch->old_mode;3948if((patch->old_mode ^ patch->new_mode) & S_IFMT) {3949if(same)3950returnerror(_("new mode (%o) of%sdoes not "3951"match old mode (%o)"),3952 patch->new_mode, new_name,3953 patch->old_mode);3954else3955returnerror(_("new mode (%o) of%sdoes not "3956"match old mode (%o) of%s"),3957 patch->new_mode, new_name,3958 patch->old_mode, old_name);3959}3960}39613962if(!state->unsafe_paths &&check_unsafe_path(patch))3963return-128;39643965/*3966 * An attempt to read from or delete a path that is beyond a3967 * symbolic link will be prevented by load_patch_target() that3968 * is called at the beginning of apply_data() so we do not3969 * have to worry about a patch marked with "is_delete" bit3970 * here. We however need to make sure that the patch result3971 * is not deposited to a path that is beyond a symbolic link3972 * here.3973 */3974if(!patch->is_delete &&path_is_beyond_symlink(state, patch->new_name))3975returnerror(_("affected file '%s' is beyond a symbolic link"),3976 patch->new_name);39773978if(apply_data(state, patch, &st, ce) <0)3979returnerror(_("%s: patch does not apply"), name);3980 patch->rejected =0;3981return0;3982}39833984static intcheck_patch_list(struct apply_state *state,struct patch *patch)3985{3986int err =0;39873988prepare_symlink_changes(state, patch);3989prepare_fn_table(state, patch);3990while(patch) {3991int res;3992if(state->apply_verbosity > verbosity_normal)3993say_patch_name(stderr,3994_("Checking patch%s..."), patch);3995 res =check_patch(state, patch);3996if(res == -128)3997return-128;3998 err |= res;3999 patch = patch->next;4000}4001return err;4002}40034004static intread_apply_cache(struct apply_state *state)4005{4006if(state->index_file)4007returnread_cache_from(state->index_file);4008else4009returnread_cache();4010}40114012/* This function tries to read the object name from the current index */4013static intget_current_oid(struct apply_state *state,const char*path,4014struct object_id *oid)4015{4016int pos;40174018if(read_apply_cache(state) <0)4019return-1;4020 pos =cache_name_pos(path,strlen(path));4021if(pos <0)4022return-1;4023oidcpy(oid, &active_cache[pos]->oid);4024return0;4025}40264027static intpreimage_oid_in_gitlink_patch(struct patch *p,struct object_id *oid)4028{4029/*4030 * A usable gitlink patch has only one fragment (hunk) that looks like:4031 * @@ -1 +1 @@4032 * -Subproject commit <old sha1>4033 * +Subproject commit <new sha1>4034 * or4035 * @@ -1 +0,0 @@4036 * -Subproject commit <old sha1>4037 * for a removal patch.4038 */4039struct fragment *hunk = p->fragments;4040static const char heading[] ="-Subproject commit ";4041char*preimage;40424043if(/* does the patch have only one hunk? */4044 hunk && !hunk->next &&4045/* is its preimage one line? */4046 hunk->oldpos ==1&& hunk->oldlines ==1&&4047/* does preimage begin with the heading? */4048(preimage =memchr(hunk->patch,'\n', hunk->size)) != NULL &&4049starts_with(++preimage, heading) &&4050/* does it record full SHA-1? */4051!get_oid_hex(preimage +sizeof(heading) -1, oid) &&4052 preimage[sizeof(heading) + GIT_SHA1_HEXSZ -1] =='\n'&&4053/* does the abbreviated name on the index line agree with it? */4054starts_with(preimage +sizeof(heading) -1, p->old_sha1_prefix))4055return0;/* it all looks fine */40564057/* we may have full object name on the index line */4058returnget_oid_hex(p->old_sha1_prefix, oid);4059}40604061/* Build an index that contains the just the files needed for a 3way merge */4062static intbuild_fake_ancestor(struct apply_state *state,struct patch *list)4063{4064struct patch *patch;4065struct index_state result = { NULL };4066static struct lock_file lock;4067int res;40684069/* Once we start supporting the reverse patch, it may be4070 * worth showing the new sha1 prefix, but until then...4071 */4072for(patch = list; patch; patch = patch->next) {4073struct object_id oid;4074struct cache_entry *ce;4075const char*name;40764077 name = patch->old_name ? patch->old_name : patch->new_name;4078if(0< patch->is_new)4079continue;40804081if(S_ISGITLINK(patch->old_mode)) {4082if(!preimage_oid_in_gitlink_patch(patch, &oid))4083;/* ok, the textual part looks sane */4084else4085returnerror(_("sha1 information is lacking or "4086"useless for submodule%s"), name);4087}else if(!get_oid_blob(patch->old_sha1_prefix, &oid)) {4088;/* ok */4089}else if(!patch->lines_added && !patch->lines_deleted) {4090/* mode-only change: update the current */4091if(get_current_oid(state, patch->old_name, &oid))4092returnerror(_("mode change for%s, which is not "4093"in current HEAD"), name);4094}else4095returnerror(_("sha1 information is lacking or useless "4096"(%s)."), name);40974098 ce =make_cache_entry(patch->old_mode, oid.hash, name,0,0);4099if(!ce)4100returnerror(_("make_cache_entry failed for path '%s'"),4101 name);4102if(add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD)) {4103free(ce);4104returnerror(_("could not add%sto temporary index"),4105 name);4106}4107}41084109hold_lock_file_for_update(&lock, state->fake_ancestor, LOCK_DIE_ON_ERROR);4110 res =write_locked_index(&result, &lock, COMMIT_LOCK);4111discard_index(&result);41124113if(res)4114returnerror(_("could not write temporary index to%s"),4115 state->fake_ancestor);41164117return0;4118}41194120static voidstat_patch_list(struct apply_state *state,struct patch *patch)4121{4122int files, adds, dels;41234124for(files = adds = dels =0; patch ; patch = patch->next) {4125 files++;4126 adds += patch->lines_added;4127 dels += patch->lines_deleted;4128show_stats(state, patch);4129}41304131print_stat_summary(stdout, files, adds, dels);4132}41334134static voidnumstat_patch_list(struct apply_state *state,4135struct patch *patch)4136{4137for( ; patch; patch = patch->next) {4138const char*name;4139 name = patch->new_name ? patch->new_name : patch->old_name;4140if(patch->is_binary)4141printf("-\t-\t");4142else4143printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);4144write_name_quoted(name, stdout, state->line_termination);4145}4146}41474148static voidshow_file_mode_name(const char*newdelete,unsigned int mode,const char*name)4149{4150if(mode)4151printf("%smode%06o%s\n", newdelete, mode, name);4152else4153printf("%s %s\n", newdelete, name);4154}41554156static voidshow_mode_change(struct patch *p,int show_name)4157{4158if(p->old_mode && p->new_mode && p->old_mode != p->new_mode) {4159if(show_name)4160printf(" mode change%06o =>%06o%s\n",4161 p->old_mode, p->new_mode, p->new_name);4162else4163printf(" mode change%06o =>%06o\n",4164 p->old_mode, p->new_mode);4165}4166}41674168static voidshow_rename_copy(struct patch *p)4169{4170const char*renamecopy = p->is_rename ?"rename":"copy";4171const char*old, *new;41724173/* Find common prefix */4174 old = p->old_name;4175new= p->new_name;4176while(1) {4177const char*slash_old, *slash_new;4178 slash_old =strchr(old,'/');4179 slash_new =strchr(new,'/');4180if(!slash_old ||4181!slash_new ||4182 slash_old - old != slash_new -new||4183memcmp(old,new, slash_new -new))4184break;4185 old = slash_old +1;4186new= slash_new +1;4187}4188/* p->old_name thru old is the common prefix, and old and new4189 * through the end of names are renames4190 */4191if(old != p->old_name)4192printf("%s%.*s{%s=>%s} (%d%%)\n", renamecopy,4193(int)(old - p->old_name), p->old_name,4194 old,new, p->score);4195else4196printf("%s %s=>%s(%d%%)\n", renamecopy,4197 p->old_name, p->new_name, p->score);4198show_mode_change(p,0);4199}42004201static voidsummary_patch_list(struct patch *patch)4202{4203struct patch *p;42044205for(p = patch; p; p = p->next) {4206if(p->is_new)4207show_file_mode_name("create", p->new_mode, p->new_name);4208else if(p->is_delete)4209show_file_mode_name("delete", p->old_mode, p->old_name);4210else{4211if(p->is_rename || p->is_copy)4212show_rename_copy(p);4213else{4214if(p->score) {4215printf(" rewrite%s(%d%%)\n",4216 p->new_name, p->score);4217show_mode_change(p,0);4218}4219else4220show_mode_change(p,1);4221}4222}4223}4224}42254226static voidpatch_stats(struct apply_state *state,struct patch *patch)4227{4228int lines = patch->lines_added + patch->lines_deleted;42294230if(lines > state->max_change)4231 state->max_change = lines;4232if(patch->old_name) {4233int len =quote_c_style(patch->old_name, NULL, NULL,0);4234if(!len)4235 len =strlen(patch->old_name);4236if(len > state->max_len)4237 state->max_len = len;4238}4239if(patch->new_name) {4240int len =quote_c_style(patch->new_name, NULL, NULL,0);4241if(!len)4242 len =strlen(patch->new_name);4243if(len > state->max_len)4244 state->max_len = len;4245}4246}42474248static intremove_file(struct apply_state *state,struct patch *patch,int rmdir_empty)4249{4250if(state->update_index) {4251if(remove_file_from_cache(patch->old_name) <0)4252returnerror(_("unable to remove%sfrom index"), patch->old_name);4253}4254if(!state->cached) {4255if(!remove_or_warn(patch->old_mode, patch->old_name) && rmdir_empty) {4256remove_path(patch->old_name);4257}4258}4259return0;4260}42614262static intadd_index_file(struct apply_state *state,4263const char*path,4264unsigned mode,4265void*buf,4266unsigned long size)4267{4268struct stat st;4269struct cache_entry *ce;4270int namelen =strlen(path);4271unsigned ce_size =cache_entry_size(namelen);42724273if(!state->update_index)4274return0;42754276 ce =xcalloc(1, ce_size);4277memcpy(ce->name, path, namelen);4278 ce->ce_mode =create_ce_mode(mode);4279 ce->ce_flags =create_ce_flags(0);4280 ce->ce_namelen = namelen;4281if(S_ISGITLINK(mode)) {4282const char*s;42834284if(!skip_prefix(buf,"Subproject commit ", &s) ||4285get_oid_hex(s, &ce->oid)) {4286free(ce);4287returnerror(_("corrupt patch for submodule%s"), path);4288}4289}else{4290if(!state->cached) {4291if(lstat(path, &st) <0) {4292free(ce);4293returnerror_errno(_("unable to stat newly "4294"created file '%s'"),4295 path);4296}4297fill_stat_cache_info(ce, &st);4298}4299if(write_sha1_file(buf, size, blob_type, ce->oid.hash) <0) {4300free(ce);4301returnerror(_("unable to create backing store "4302"for newly created file%s"), path);4303}4304}4305if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4306free(ce);4307returnerror(_("unable to add cache entry for%s"), path);4308}43094310return0;4311}43124313/*4314 * Returns:4315 * -1 if an unrecoverable error happened4316 * 0 if everything went well4317 * 1 if a recoverable error happened4318 */4319static inttry_create_file(const char*path,unsigned int mode,const char*buf,unsigned long size)4320{4321int fd, res;4322struct strbuf nbuf = STRBUF_INIT;43234324if(S_ISGITLINK(mode)) {4325struct stat st;4326if(!lstat(path, &st) &&S_ISDIR(st.st_mode))4327return0;4328return!!mkdir(path,0777);4329}43304331if(has_symlinks &&S_ISLNK(mode))4332/* Although buf:size is counted string, it also is NUL4333 * terminated.4334 */4335return!!symlink(buf, path);43364337 fd =open(path, O_CREAT | O_EXCL | O_WRONLY, (mode &0100) ?0777:0666);4338if(fd <0)4339return1;43404341if(convert_to_working_tree(path, buf, size, &nbuf)) {4342 size = nbuf.len;4343 buf = nbuf.buf;4344}43454346 res =write_in_full(fd, buf, size) <0;4347if(res)4348error_errno(_("failed to write to '%s'"), path);4349strbuf_release(&nbuf);43504351if(close(fd) <0&& !res)4352returnerror_errno(_("closing file '%s'"), path);43534354return res ? -1:0;4355}43564357/*4358 * We optimistically assume that the directories exist,4359 * which is true 99% of the time anyway. If they don't,4360 * we create them and try again.4361 *4362 * Returns:4363 * -1 on error4364 * 0 otherwise4365 */4366static intcreate_one_file(struct apply_state *state,4367char*path,4368unsigned mode,4369const char*buf,4370unsigned long size)4371{4372int res;43734374if(state->cached)4375return0;43764377 res =try_create_file(path, mode, buf, size);4378if(res <0)4379return-1;4380if(!res)4381return0;43824383if(errno == ENOENT) {4384if(safe_create_leading_directories(path))4385return0;4386 res =try_create_file(path, mode, buf, size);4387if(res <0)4388return-1;4389if(!res)4390return0;4391}43924393if(errno == EEXIST || errno == EACCES) {4394/* We may be trying to create a file where a directory4395 * used to be.4396 */4397struct stat st;4398if(!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))4399 errno = EEXIST;4400}44014402if(errno == EEXIST) {4403unsigned int nr =getpid();44044405for(;;) {4406char newpath[PATH_MAX];4407mksnpath(newpath,sizeof(newpath),"%s~%u", path, nr);4408 res =try_create_file(newpath, mode, buf, size);4409if(res <0)4410return-1;4411if(!res) {4412if(!rename(newpath, path))4413return0;4414unlink_or_warn(newpath);4415break;4416}4417if(errno != EEXIST)4418break;4419++nr;4420}4421}4422returnerror_errno(_("unable to write file '%s' mode%o"),4423 path, mode);4424}44254426static intadd_conflicted_stages_file(struct apply_state *state,4427struct patch *patch)4428{4429int stage, namelen;4430unsigned ce_size, mode;4431struct cache_entry *ce;44324433if(!state->update_index)4434return0;4435 namelen =strlen(patch->new_name);4436 ce_size =cache_entry_size(namelen);4437 mode = patch->new_mode ? patch->new_mode : (S_IFREG |0644);44384439remove_file_from_cache(patch->new_name);4440for(stage =1; stage <4; stage++) {4441if(is_null_oid(&patch->threeway_stage[stage -1]))4442continue;4443 ce =xcalloc(1, ce_size);4444memcpy(ce->name, patch->new_name, namelen);4445 ce->ce_mode =create_ce_mode(mode);4446 ce->ce_flags =create_ce_flags(stage);4447 ce->ce_namelen = namelen;4448oidcpy(&ce->oid, &patch->threeway_stage[stage -1]);4449if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4450free(ce);4451returnerror(_("unable to add cache entry for%s"),4452 patch->new_name);4453}4454}44554456return0;4457}44584459static intcreate_file(struct apply_state *state,struct patch *patch)4460{4461char*path = patch->new_name;4462unsigned mode = patch->new_mode;4463unsigned long size = patch->resultsize;4464char*buf = patch->result;44654466if(!mode)4467 mode = S_IFREG |0644;4468if(create_one_file(state, path, mode, buf, size))4469return-1;44704471if(patch->conflicted_threeway)4472returnadd_conflicted_stages_file(state, patch);4473else4474returnadd_index_file(state, path, mode, buf, size);4475}44764477/* phase zero is to remove, phase one is to create */4478static intwrite_out_one_result(struct apply_state *state,4479struct patch *patch,4480int phase)4481{4482if(patch->is_delete >0) {4483if(phase ==0)4484returnremove_file(state, patch,1);4485return0;4486}4487if(patch->is_new >0|| patch->is_copy) {4488if(phase ==1)4489returncreate_file(state, patch);4490return0;4491}4492/*4493 * Rename or modification boils down to the same4494 * thing: remove the old, write the new4495 */4496if(phase ==0)4497returnremove_file(state, patch, patch->is_rename);4498if(phase ==1)4499returncreate_file(state, patch);4500return0;4501}45024503static intwrite_out_one_reject(struct apply_state *state,struct patch *patch)4504{4505FILE*rej;4506char namebuf[PATH_MAX];4507struct fragment *frag;4508int cnt =0;4509struct strbuf sb = STRBUF_INIT;45104511for(cnt =0, frag = patch->fragments; frag; frag = frag->next) {4512if(!frag->rejected)4513continue;4514 cnt++;4515}45164517if(!cnt) {4518if(state->apply_verbosity > verbosity_normal)4519say_patch_name(stderr,4520_("Applied patch%scleanly."), patch);4521return0;4522}45234524/* This should not happen, because a removal patch that leaves4525 * contents are marked "rejected" at the patch level.4526 */4527if(!patch->new_name)4528die(_("internal error"));45294530/* Say this even without --verbose */4531strbuf_addf(&sb,Q_("Applying patch %%swith%dreject...",4532"Applying patch %%swith%drejects...",4533 cnt),4534 cnt);4535if(state->apply_verbosity > verbosity_silent)4536say_patch_name(stderr, sb.buf, patch);4537strbuf_release(&sb);45384539 cnt =strlen(patch->new_name);4540if(ARRAY_SIZE(namebuf) <= cnt +5) {4541 cnt =ARRAY_SIZE(namebuf) -5;4542warning(_("truncating .rej filename to %.*s.rej"),4543 cnt -1, patch->new_name);4544}4545memcpy(namebuf, patch->new_name, cnt);4546memcpy(namebuf + cnt,".rej",5);45474548 rej =fopen(namebuf,"w");4549if(!rej)4550returnerror_errno(_("cannot open%s"), namebuf);45514552/* Normal git tools never deal with .rej, so do not pretend4553 * this is a git patch by saying --git or giving extended4554 * headers. While at it, maybe please "kompare" that wants4555 * the trailing TAB and some garbage at the end of line ;-).4556 */4557fprintf(rej,"diff a/%sb/%s\t(rejected hunks)\n",4558 patch->new_name, patch->new_name);4559for(cnt =1, frag = patch->fragments;4560 frag;4561 cnt++, frag = frag->next) {4562if(!frag->rejected) {4563if(state->apply_verbosity > verbosity_silent)4564fprintf_ln(stderr,_("Hunk #%dapplied cleanly."), cnt);4565continue;4566}4567if(state->apply_verbosity > verbosity_silent)4568fprintf_ln(stderr,_("Rejected hunk #%d."), cnt);4569fprintf(rej,"%.*s", frag->size, frag->patch);4570if(frag->patch[frag->size-1] !='\n')4571fputc('\n', rej);4572}4573fclose(rej);4574return-1;4575}45764577/*4578 * Returns:4579 * -1 if an error happened4580 * 0 if the patch applied cleanly4581 * 1 if the patch did not apply cleanly4582 */4583static intwrite_out_results(struct apply_state *state,struct patch *list)4584{4585int phase;4586int errs =0;4587struct patch *l;4588struct string_list cpath = STRING_LIST_INIT_DUP;45894590for(phase =0; phase <2; phase++) {4591 l = list;4592while(l) {4593if(l->rejected)4594 errs =1;4595else{4596if(write_out_one_result(state, l, phase)) {4597string_list_clear(&cpath,0);4598return-1;4599}4600if(phase ==1) {4601if(write_out_one_reject(state, l))4602 errs =1;4603if(l->conflicted_threeway) {4604string_list_append(&cpath, l->new_name);4605 errs =1;4606}4607}4608}4609 l = l->next;4610}4611}46124613if(cpath.nr) {4614struct string_list_item *item;46154616string_list_sort(&cpath);4617if(state->apply_verbosity > verbosity_silent) {4618for_each_string_list_item(item, &cpath)4619fprintf(stderr,"U%s\n", item->string);4620}4621string_list_clear(&cpath,0);46224623rerere(0);4624}46254626return errs;4627}46284629/*4630 * Try to apply a patch.4631 *4632 * Returns:4633 * -128 if a bad error happened (like patch unreadable)4634 * -1 if patch did not apply and user cannot deal with it4635 * 0 if the patch applied4636 * 1 if the patch did not apply but user might fix it4637 */4638static intapply_patch(struct apply_state *state,4639int fd,4640const char*filename,4641int options)4642{4643size_t offset;4644struct strbuf buf = STRBUF_INIT;/* owns the patch text */4645struct patch *list = NULL, **listp = &list;4646int skipped_patch =0;4647int res =0;46484649 state->patch_input_file = filename;4650if(read_patch_file(&buf, fd) <0)4651return-128;4652 offset =0;4653while(offset < buf.len) {4654struct patch *patch;4655int nr;46564657 patch =xcalloc(1,sizeof(*patch));4658 patch->inaccurate_eof = !!(options & APPLY_OPT_INACCURATE_EOF);4659 patch->recount = !!(options & APPLY_OPT_RECOUNT);4660 nr =parse_chunk(state, buf.buf + offset, buf.len - offset, patch);4661if(nr <0) {4662free_patch(patch);4663if(nr == -128) {4664 res = -128;4665goto end;4666}4667break;4668}4669if(state->apply_in_reverse)4670reverse_patches(patch);4671if(use_patch(state, patch)) {4672patch_stats(state, patch);4673*listp = patch;4674 listp = &patch->next;4675}4676else{4677if(state->apply_verbosity > verbosity_normal)4678say_patch_name(stderr,_("Skipped patch '%s'."), patch);4679free_patch(patch);4680 skipped_patch++;4681}4682 offset += nr;4683}46844685if(!list && !skipped_patch) {4686error(_("unrecognized input"));4687 res = -128;4688goto end;4689}46904691if(state->whitespace_error && (state->ws_error_action == die_on_ws_error))4692 state->apply =0;46934694 state->update_index = state->check_index && state->apply;4695if(state->update_index && state->newfd <0) {4696if(state->index_file)4697 state->newfd =hold_lock_file_for_update(state->lock_file,4698 state->index_file,4699 LOCK_DIE_ON_ERROR);4700else4701 state->newfd =hold_locked_index(state->lock_file, LOCK_DIE_ON_ERROR);4702}47034704if(state->check_index &&read_apply_cache(state) <0) {4705error(_("unable to read index file"));4706 res = -128;4707goto end;4708}47094710if(state->check || state->apply) {4711int r =check_patch_list(state, list);4712if(r == -128) {4713 res = -128;4714goto end;4715}4716if(r <0&& !state->apply_with_reject) {4717 res = -1;4718goto end;4719}4720}47214722if(state->apply) {4723int write_res =write_out_results(state, list);4724if(write_res <0) {4725 res = -128;4726goto end;4727}4728if(write_res >0) {4729/* with --3way, we still need to write the index out */4730 res = state->apply_with_reject ? -1:1;4731goto end;4732}4733}47344735if(state->fake_ancestor &&4736build_fake_ancestor(state, list)) {4737 res = -128;4738goto end;4739}47404741if(state->diffstat && state->apply_verbosity > verbosity_silent)4742stat_patch_list(state, list);47434744if(state->numstat && state->apply_verbosity > verbosity_silent)4745numstat_patch_list(state, list);47464747if(state->summary && state->apply_verbosity > verbosity_silent)4748summary_patch_list(list);47494750end:4751free_patch_list(list);4752strbuf_release(&buf);4753string_list_clear(&state->fn_table,0);4754return res;4755}47564757static intapply_option_parse_exclude(const struct option *opt,4758const char*arg,int unset)4759{4760struct apply_state *state = opt->value;4761add_name_limit(state, arg,1);4762return0;4763}47644765static intapply_option_parse_include(const struct option *opt,4766const char*arg,int unset)4767{4768struct apply_state *state = opt->value;4769add_name_limit(state, arg,0);4770 state->has_include =1;4771return0;4772}47734774static intapply_option_parse_p(const struct option *opt,4775const char*arg,4776int unset)4777{4778struct apply_state *state = opt->value;4779 state->p_value =atoi(arg);4780 state->p_value_known =1;4781return0;4782}47834784static intapply_option_parse_space_change(const struct option *opt,4785const char*arg,int unset)4786{4787struct apply_state *state = opt->value;4788if(unset)4789 state->ws_ignore_action = ignore_ws_none;4790else4791 state->ws_ignore_action = ignore_ws_change;4792return0;4793}47944795static intapply_option_parse_whitespace(const struct option *opt,4796const char*arg,int unset)4797{4798struct apply_state *state = opt->value;4799 state->whitespace_option = arg;4800if(parse_whitespace_option(state, arg))4801exit(1);4802return0;4803}48044805static intapply_option_parse_directory(const struct option *opt,4806const char*arg,int unset)4807{4808struct apply_state *state = opt->value;4809strbuf_reset(&state->root);4810strbuf_addstr(&state->root, arg);4811strbuf_complete(&state->root,'/');4812return0;4813}48144815intapply_all_patches(struct apply_state *state,4816int argc,4817const char**argv,4818int options)4819{4820int i;4821int res;4822int errs =0;4823int read_stdin =1;48244825for(i =0; i < argc; i++) {4826const char*arg = argv[i];4827char*to_free = NULL;4828int fd;48294830if(!strcmp(arg,"-")) {4831 res =apply_patch(state,0,"<stdin>", options);4832if(res <0)4833goto end;4834 errs |= res;4835 read_stdin =0;4836continue;4837}else4838 arg = to_free =prefix_filename(state->prefix, arg);48394840 fd =open(arg, O_RDONLY);4841if(fd <0) {4842error(_("can't open patch '%s':%s"), arg,strerror(errno));4843 res = -128;4844free(to_free);4845goto end;4846}4847 read_stdin =0;4848set_default_whitespace_mode(state);4849 res =apply_patch(state, fd, arg, options);4850close(fd);4851free(to_free);4852if(res <0)4853goto end;4854 errs |= res;4855}4856set_default_whitespace_mode(state);4857if(read_stdin) {4858 res =apply_patch(state,0,"<stdin>", options);4859if(res <0)4860goto end;4861 errs |= res;4862}48634864if(state->whitespace_error) {4865if(state->squelch_whitespace_errors &&4866 state->squelch_whitespace_errors < state->whitespace_error) {4867int squelched =4868 state->whitespace_error - state->squelch_whitespace_errors;4869warning(Q_("squelched%dwhitespace error",4870"squelched%dwhitespace errors",4871 squelched),4872 squelched);4873}4874if(state->ws_error_action == die_on_ws_error) {4875error(Q_("%dline adds whitespace errors.",4876"%dlines add whitespace errors.",4877 state->whitespace_error),4878 state->whitespace_error);4879 res = -128;4880goto end;4881}4882if(state->applied_after_fixing_ws && state->apply)4883warning(Q_("%dline applied after"4884" fixing whitespace errors.",4885"%dlines applied after"4886" fixing whitespace errors.",4887 state->applied_after_fixing_ws),4888 state->applied_after_fixing_ws);4889else if(state->whitespace_error)4890warning(Q_("%dline adds whitespace errors.",4891"%dlines add whitespace errors.",4892 state->whitespace_error),4893 state->whitespace_error);4894}48954896if(state->update_index) {4897 res =write_locked_index(&the_index, state->lock_file, COMMIT_LOCK);4898if(res) {4899error(_("Unable to write new index file"));4900 res = -128;4901goto end;4902}4903 state->newfd = -1;4904}49054906 res = !!errs;49074908end:4909if(state->newfd >=0) {4910rollback_lock_file(state->lock_file);4911 state->newfd = -1;4912}49134914if(state->apply_verbosity <= verbosity_silent) {4915set_error_routine(state->saved_error_routine);4916set_warn_routine(state->saved_warn_routine);4917}49184919if(res > -1)4920return res;4921return(res == -1?1:128);4922}49234924intapply_parse_options(int argc,const char**argv,4925struct apply_state *state,4926int*force_apply,int*options,4927const char*const*apply_usage)4928{4929struct option builtin_apply_options[] = {4930{ OPTION_CALLBACK,0,"exclude", state,N_("path"),4931N_("don't apply changes matching the given path"),49320, apply_option_parse_exclude },4933{ OPTION_CALLBACK,0,"include", state,N_("path"),4934N_("apply changes matching the given path"),49350, apply_option_parse_include },4936{ OPTION_CALLBACK,'p', NULL, state,N_("num"),4937N_("remove <num> leading slashes from traditional diff paths"),49380, apply_option_parse_p },4939OPT_BOOL(0,"no-add", &state->no_add,4940N_("ignore additions made by the patch")),4941OPT_BOOL(0,"stat", &state->diffstat,4942N_("instead of applying the patch, output diffstat for the input")),4943OPT_NOOP_NOARG(0,"allow-binary-replacement"),4944OPT_NOOP_NOARG(0,"binary"),4945OPT_BOOL(0,"numstat", &state->numstat,4946N_("show number of added and deleted lines in decimal notation")),4947OPT_BOOL(0,"summary", &state->summary,4948N_("instead of applying the patch, output a summary for the input")),4949OPT_BOOL(0,"check", &state->check,4950N_("instead of applying the patch, see if the patch is applicable")),4951OPT_BOOL(0,"index", &state->check_index,4952N_("make sure the patch is applicable to the current index")),4953OPT_BOOL(0,"cached", &state->cached,4954N_("apply a patch without touching the working tree")),4955OPT_BOOL(0,"unsafe-paths", &state->unsafe_paths,4956N_("accept a patch that touches outside the working area")),4957OPT_BOOL(0,"apply", force_apply,4958N_("also apply the patch (use with --stat/--summary/--check)")),4959OPT_BOOL('3',"3way", &state->threeway,4960N_("attempt three-way merge if a patch does not apply")),4961OPT_FILENAME(0,"build-fake-ancestor", &state->fake_ancestor,4962N_("build a temporary index based on embedded index information")),4963/* Think twice before adding "--nul" synonym to this */4964OPT_SET_INT('z', NULL, &state->line_termination,4965N_("paths are separated with NUL character"),'\0'),4966OPT_INTEGER('C', NULL, &state->p_context,4967N_("ensure at least <n> lines of context match")),4968{ OPTION_CALLBACK,0,"whitespace", state,N_("action"),4969N_("detect new or modified lines that have whitespace errors"),49700, apply_option_parse_whitespace },4971{ OPTION_CALLBACK,0,"ignore-space-change", state, NULL,4972N_("ignore changes in whitespace when finding context"),4973 PARSE_OPT_NOARG, apply_option_parse_space_change },4974{ OPTION_CALLBACK,0,"ignore-whitespace", state, NULL,4975N_("ignore changes in whitespace when finding context"),4976 PARSE_OPT_NOARG, apply_option_parse_space_change },4977OPT_BOOL('R',"reverse", &state->apply_in_reverse,4978N_("apply the patch in reverse")),4979OPT_BOOL(0,"unidiff-zero", &state->unidiff_zero,4980N_("don't expect at least one line of context")),4981OPT_BOOL(0,"reject", &state->apply_with_reject,4982N_("leave the rejected hunks in corresponding *.rej files")),4983OPT_BOOL(0,"allow-overlap", &state->allow_overlap,4984N_("allow overlapping hunks")),4985OPT__VERBOSE(&state->apply_verbosity,N_("be verbose")),4986OPT_BIT(0,"inaccurate-eof", options,4987N_("tolerate incorrectly detected missing new-line at the end of file"),4988 APPLY_OPT_INACCURATE_EOF),4989OPT_BIT(0,"recount", options,4990N_("do not trust the line counts in the hunk headers"),4991 APPLY_OPT_RECOUNT),4992{ OPTION_CALLBACK,0,"directory", state,N_("root"),4993N_("prepend <root> to all filenames"),49940, apply_option_parse_directory },4995OPT_END()4996};49974998returnparse_options(argc, argv, state->prefix, builtin_apply_options, apply_usage,0);4999}