1/* 2 * apply.c 3 * 4 * Copyright (C) Linus Torvalds, 2005 5 * 6 * This applies patches on top of some (arbitrary) version of the SCM. 7 * 8 */ 9 10#include"cache.h" 11#include"config.h" 12#include"object-store.h" 13#include"blob.h" 14#include"delta.h" 15#include"diff.h" 16#include"dir.h" 17#include"xdiff-interface.h" 18#include"ll-merge.h" 19#include"lockfile.h" 20#include"parse-options.h" 21#include"quote.h" 22#include"rerere.h" 23#include"apply.h" 24 25static voidgit_apply_config(void) 26{ 27git_config_get_string_const("apply.whitespace", &apply_default_whitespace); 28git_config_get_string_const("apply.ignorewhitespace", &apply_default_ignorewhitespace); 29git_config(git_default_config, NULL); 30} 31 32static intparse_whitespace_option(struct apply_state *state,const char*option) 33{ 34if(!option) { 35 state->ws_error_action = warn_on_ws_error; 36return0; 37} 38if(!strcmp(option,"warn")) { 39 state->ws_error_action = warn_on_ws_error; 40return0; 41} 42if(!strcmp(option,"nowarn")) { 43 state->ws_error_action = nowarn_ws_error; 44return0; 45} 46if(!strcmp(option,"error")) { 47 state->ws_error_action = die_on_ws_error; 48return0; 49} 50if(!strcmp(option,"error-all")) { 51 state->ws_error_action = die_on_ws_error; 52 state->squelch_whitespace_errors =0; 53return0; 54} 55if(!strcmp(option,"strip") || !strcmp(option,"fix")) { 56 state->ws_error_action = correct_ws_error; 57return0; 58} 59returnerror(_("unrecognized whitespace option '%s'"), option); 60} 61 62static intparse_ignorewhitespace_option(struct apply_state *state, 63const char*option) 64{ 65if(!option || !strcmp(option,"no") || 66!strcmp(option,"false") || !strcmp(option,"never") || 67!strcmp(option,"none")) { 68 state->ws_ignore_action = ignore_ws_none; 69return0; 70} 71if(!strcmp(option,"change")) { 72 state->ws_ignore_action = ignore_ws_change; 73return0; 74} 75returnerror(_("unrecognized whitespace ignore option '%s'"), option); 76} 77 78intinit_apply_state(struct apply_state *state, 79const char*prefix) 80{ 81memset(state,0,sizeof(*state)); 82 state->prefix = prefix; 83 state->apply =1; 84 state->line_termination ='\n'; 85 state->p_value =1; 86 state->p_context = UINT_MAX; 87 state->squelch_whitespace_errors =5; 88 state->ws_error_action = warn_on_ws_error; 89 state->ws_ignore_action = ignore_ws_none; 90 state->linenr =1; 91string_list_init(&state->fn_table,0); 92string_list_init(&state->limit_by_name,0); 93string_list_init(&state->symlink_changes,0); 94strbuf_init(&state->root,0); 95 96git_apply_config(); 97if(apply_default_whitespace &&parse_whitespace_option(state, apply_default_whitespace)) 98return-1; 99if(apply_default_ignorewhitespace &&parse_ignorewhitespace_option(state, apply_default_ignorewhitespace)) 100return-1; 101return0; 102} 103 104voidclear_apply_state(struct apply_state *state) 105{ 106string_list_clear(&state->limit_by_name,0); 107string_list_clear(&state->symlink_changes,0); 108strbuf_release(&state->root); 109 110/* &state->fn_table is cleared at the end of apply_patch() */ 111} 112 113static voidmute_routine(const char*msg,va_list params) 114{ 115/* do nothing */ 116} 117 118intcheck_apply_state(struct apply_state *state,int force_apply) 119{ 120int is_not_gitdir = !startup_info->have_repository; 121 122if(state->apply_with_reject && state->threeway) 123returnerror(_("--reject and --3way cannot be used together.")); 124if(state->cached && state->threeway) 125returnerror(_("--cached and --3way cannot be used together.")); 126if(state->threeway) { 127if(is_not_gitdir) 128returnerror(_("--3way outside a repository")); 129 state->check_index =1; 130} 131if(state->apply_with_reject) { 132 state->apply =1; 133if(state->apply_verbosity == verbosity_normal) 134 state->apply_verbosity = verbosity_verbose; 135} 136if(!force_apply && (state->diffstat || state->numstat || state->summary || state->check || state->fake_ancestor)) 137 state->apply =0; 138if(state->check_index && is_not_gitdir) 139returnerror(_("--index outside a repository")); 140if(state->cached) { 141if(is_not_gitdir) 142returnerror(_("--cached outside a repository")); 143 state->check_index =1; 144} 145if(state->ita_only && (state->check_index || is_not_gitdir)) 146 state->ita_only =0; 147if(state->check_index) 148 state->unsafe_paths =0; 149 150if(state->apply_verbosity <= verbosity_silent) { 151 state->saved_error_routine =get_error_routine(); 152 state->saved_warn_routine =get_warn_routine(); 153set_error_routine(mute_routine); 154set_warn_routine(mute_routine); 155} 156 157return0; 158} 159 160static voidset_default_whitespace_mode(struct apply_state *state) 161{ 162if(!state->whitespace_option && !apply_default_whitespace) 163 state->ws_error_action = (state->apply ? warn_on_ws_error : nowarn_ws_error); 164} 165 166/* 167 * This represents one "hunk" from a patch, starting with 168 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The 169 * patch text is pointed at by patch, and its byte length 170 * is stored in size. leading and trailing are the number 171 * of context lines. 172 */ 173struct fragment { 174unsigned long leading, trailing; 175unsigned long oldpos, oldlines; 176unsigned long newpos, newlines; 177/* 178 * 'patch' is usually borrowed from buf in apply_patch(), 179 * but some codepaths store an allocated buffer. 180 */ 181const char*patch; 182unsigned free_patch:1, 183 rejected:1; 184int size; 185int linenr; 186struct fragment *next; 187}; 188 189/* 190 * When dealing with a binary patch, we reuse "leading" field 191 * to store the type of the binary hunk, either deflated "delta" 192 * or deflated "literal". 193 */ 194#define binary_patch_method leading 195#define BINARY_DELTA_DEFLATED 1 196#define BINARY_LITERAL_DEFLATED 2 197 198/* 199 * This represents a "patch" to a file, both metainfo changes 200 * such as creation/deletion, filemode and content changes represented 201 * as a series of fragments. 202 */ 203struct patch { 204char*new_name, *old_name, *def_name; 205unsigned int old_mode, new_mode; 206int is_new, is_delete;/* -1 = unknown, 0 = false, 1 = true */ 207int rejected; 208unsigned ws_rule; 209int lines_added, lines_deleted; 210int score; 211int extension_linenr;/* first line specifying delete/new/rename/copy */ 212unsigned int is_toplevel_relative:1; 213unsigned int inaccurate_eof:1; 214unsigned int is_binary:1; 215unsigned int is_copy:1; 216unsigned int is_rename:1; 217unsigned int recount:1; 218unsigned int conflicted_threeway:1; 219unsigned int direct_to_threeway:1; 220unsigned int crlf_in_old:1; 221struct fragment *fragments; 222char*result; 223size_t resultsize; 224char old_sha1_prefix[41]; 225char new_sha1_prefix[41]; 226struct patch *next; 227 228/* three-way fallback result */ 229struct object_id threeway_stage[3]; 230}; 231 232static voidfree_fragment_list(struct fragment *list) 233{ 234while(list) { 235struct fragment *next = list->next; 236if(list->free_patch) 237free((char*)list->patch); 238free(list); 239 list = next; 240} 241} 242 243static voidfree_patch(struct patch *patch) 244{ 245free_fragment_list(patch->fragments); 246free(patch->def_name); 247free(patch->old_name); 248free(patch->new_name); 249free(patch->result); 250free(patch); 251} 252 253static voidfree_patch_list(struct patch *list) 254{ 255while(list) { 256struct patch *next = list->next; 257free_patch(list); 258 list = next; 259} 260} 261 262/* 263 * A line in a file, len-bytes long (includes the terminating LF, 264 * except for an incomplete line at the end if the file ends with 265 * one), and its contents hashes to 'hash'. 266 */ 267struct line { 268size_t len; 269unsigned hash :24; 270unsigned flag :8; 271#define LINE_COMMON 1 272#define LINE_PATCHED 2 273}; 274 275/* 276 * This represents a "file", which is an array of "lines". 277 */ 278struct image { 279char*buf; 280size_t len; 281size_t nr; 282size_t alloc; 283struct line *line_allocated; 284struct line *line; 285}; 286 287static uint32_thash_line(const char*cp,size_t len) 288{ 289size_t i; 290uint32_t h; 291for(i =0, h =0; i < len; i++) { 292if(!isspace(cp[i])) { 293 h = h *3+ (cp[i] &0xff); 294} 295} 296return h; 297} 298 299/* 300 * Compare lines s1 of length n1 and s2 of length n2, ignoring 301 * whitespace difference. Returns 1 if they match, 0 otherwise 302 */ 303static intfuzzy_matchlines(const char*s1,size_t n1, 304const char*s2,size_t n2) 305{ 306const char*end1 = s1 + n1; 307const char*end2 = s2 + n2; 308 309/* ignore line endings */ 310while(s1 < end1 && (end1[-1] =='\r'|| end1[-1] =='\n')) 311 end1--; 312while(s2 < end2 && (end2[-1] =='\r'|| end2[-1] =='\n')) 313 end2--; 314 315while(s1 < end1 && s2 < end2) { 316if(isspace(*s1)) { 317/* 318 * Skip whitespace. We check on both buffers 319 * because we don't want "a b" to match "ab". 320 */ 321if(!isspace(*s2)) 322return0; 323while(s1 < end1 &&isspace(*s1)) 324 s1++; 325while(s2 < end2 &&isspace(*s2)) 326 s2++; 327}else if(*s1++ != *s2++) 328return0; 329} 330 331/* If we reached the end on one side only, lines don't match. */ 332return s1 == end1 && s2 == end2; 333} 334 335static voidadd_line_info(struct image *img,const char*bol,size_t len,unsigned flag) 336{ 337ALLOC_GROW(img->line_allocated, img->nr +1, img->alloc); 338 img->line_allocated[img->nr].len = len; 339 img->line_allocated[img->nr].hash =hash_line(bol, len); 340 img->line_allocated[img->nr].flag = flag; 341 img->nr++; 342} 343 344/* 345 * "buf" has the file contents to be patched (read from various sources). 346 * attach it to "image" and add line-based index to it. 347 * "image" now owns the "buf". 348 */ 349static voidprepare_image(struct image *image,char*buf,size_t len, 350int prepare_linetable) 351{ 352const char*cp, *ep; 353 354memset(image,0,sizeof(*image)); 355 image->buf = buf; 356 image->len = len; 357 358if(!prepare_linetable) 359return; 360 361 ep = image->buf + image->len; 362 cp = image->buf; 363while(cp < ep) { 364const char*next; 365for(next = cp; next < ep && *next !='\n'; next++) 366; 367if(next < ep) 368 next++; 369add_line_info(image, cp, next - cp,0); 370 cp = next; 371} 372 image->line = image->line_allocated; 373} 374 375static voidclear_image(struct image *image) 376{ 377free(image->buf); 378free(image->line_allocated); 379memset(image,0,sizeof(*image)); 380} 381 382/* fmt must contain _one_ %s and no other substitution */ 383static voidsay_patch_name(FILE*output,const char*fmt,struct patch *patch) 384{ 385struct strbuf sb = STRBUF_INIT; 386 387if(patch->old_name && patch->new_name && 388strcmp(patch->old_name, patch->new_name)) { 389quote_c_style(patch->old_name, &sb, NULL,0); 390strbuf_addstr(&sb," => "); 391quote_c_style(patch->new_name, &sb, NULL,0); 392}else{ 393const char*n = patch->new_name; 394if(!n) 395 n = patch->old_name; 396quote_c_style(n, &sb, NULL,0); 397} 398fprintf(output, fmt, sb.buf); 399fputc('\n', output); 400strbuf_release(&sb); 401} 402 403#define SLOP (16) 404 405static intread_patch_file(struct strbuf *sb,int fd) 406{ 407if(strbuf_read(sb, fd,0) <0) 408returnerror_errno("git apply: failed to read"); 409 410/* 411 * Make sure that we have some slop in the buffer 412 * so that we can do speculative "memcmp" etc, and 413 * see to it that it is NUL-filled. 414 */ 415strbuf_grow(sb, SLOP); 416memset(sb->buf + sb->len,0, SLOP); 417return0; 418} 419 420static unsigned longlinelen(const char*buffer,unsigned long size) 421{ 422unsigned long len =0; 423while(size--) { 424 len++; 425if(*buffer++ =='\n') 426break; 427} 428return len; 429} 430 431static intis_dev_null(const char*str) 432{ 433returnskip_prefix(str,"/dev/null", &str) &&isspace(*str); 434} 435 436#define TERM_SPACE 1 437#define TERM_TAB 2 438 439static intname_terminate(int c,int terminate) 440{ 441if(c ==' '&& !(terminate & TERM_SPACE)) 442return0; 443if(c =='\t'&& !(terminate & TERM_TAB)) 444return0; 445 446return1; 447} 448 449/* remove double slashes to make --index work with such filenames */ 450static char*squash_slash(char*name) 451{ 452int i =0, j =0; 453 454if(!name) 455return NULL; 456 457while(name[i]) { 458if((name[j++] = name[i++]) =='/') 459while(name[i] =='/') 460 i++; 461} 462 name[j] ='\0'; 463return name; 464} 465 466static char*find_name_gnu(struct apply_state *state, 467const char*line, 468const char*def, 469int p_value) 470{ 471struct strbuf name = STRBUF_INIT; 472char*cp; 473 474/* 475 * Proposed "new-style" GNU patch/diff format; see 476 * http://marc.info/?l=git&m=112927316408690&w=2 477 */ 478if(unquote_c_style(&name, line, NULL)) { 479strbuf_release(&name); 480return NULL; 481} 482 483for(cp = name.buf; p_value; p_value--) { 484 cp =strchr(cp,'/'); 485if(!cp) { 486strbuf_release(&name); 487return NULL; 488} 489 cp++; 490} 491 492strbuf_remove(&name,0, cp - name.buf); 493if(state->root.len) 494strbuf_insert(&name,0, state->root.buf, state->root.len); 495returnsquash_slash(strbuf_detach(&name, NULL)); 496} 497 498static size_tsane_tz_len(const char*line,size_t len) 499{ 500const char*tz, *p; 501 502if(len <strlen(" +0500") || line[len-strlen(" +0500")] !=' ') 503return0; 504 tz = line + len -strlen(" +0500"); 505 506if(tz[1] !='+'&& tz[1] !='-') 507return0; 508 509for(p = tz +2; p != line + len; p++) 510if(!isdigit(*p)) 511return0; 512 513return line + len - tz; 514} 515 516static size_ttz_with_colon_len(const char*line,size_t len) 517{ 518const char*tz, *p; 519 520if(len <strlen(" +08:00") || line[len -strlen(":00")] !=':') 521return0; 522 tz = line + len -strlen(" +08:00"); 523 524if(tz[0] !=' '|| (tz[1] !='+'&& tz[1] !='-')) 525return0; 526 p = tz +2; 527if(!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 528!isdigit(*p++) || !isdigit(*p++)) 529return0; 530 531return line + len - tz; 532} 533 534static size_tdate_len(const char*line,size_t len) 535{ 536const char*date, *p; 537 538if(len <strlen("72-02-05") || line[len-strlen("-05")] !='-') 539return0; 540 p = date = line + len -strlen("72-02-05"); 541 542if(!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 543!isdigit(*p++) || !isdigit(*p++) || *p++ !='-'|| 544!isdigit(*p++) || !isdigit(*p++))/* Not a date. */ 545return0; 546 547if(date - line >=strlen("19") && 548isdigit(date[-1]) &&isdigit(date[-2]))/* 4-digit year */ 549 date -=strlen("19"); 550 551return line + len - date; 552} 553 554static size_tshort_time_len(const char*line,size_t len) 555{ 556const char*time, *p; 557 558if(len <strlen(" 07:01:32") || line[len-strlen(":32")] !=':') 559return0; 560 p = time = line + len -strlen(" 07:01:32"); 561 562/* Permit 1-digit hours? */ 563if(*p++ !=' '|| 564!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 565!isdigit(*p++) || !isdigit(*p++) || *p++ !=':'|| 566!isdigit(*p++) || !isdigit(*p++))/* Not a time. */ 567return0; 568 569return line + len - time; 570} 571 572static size_tfractional_time_len(const char*line,size_t len) 573{ 574const char*p; 575size_t n; 576 577/* Expected format: 19:41:17.620000023 */ 578if(!len || !isdigit(line[len -1])) 579return0; 580 p = line + len -1; 581 582/* Fractional seconds. */ 583while(p > line &&isdigit(*p)) 584 p--; 585if(*p !='.') 586return0; 587 588/* Hours, minutes, and whole seconds. */ 589 n =short_time_len(line, p - line); 590if(!n) 591return0; 592 593return line + len - p + n; 594} 595 596static size_ttrailing_spaces_len(const char*line,size_t len) 597{ 598const char*p; 599 600/* Expected format: ' ' x (1 or more) */ 601if(!len || line[len -1] !=' ') 602return0; 603 604 p = line + len; 605while(p != line) { 606 p--; 607if(*p !=' ') 608return line + len - (p +1); 609} 610 611/* All spaces! */ 612return len; 613} 614 615static size_tdiff_timestamp_len(const char*line,size_t len) 616{ 617const char*end = line + len; 618size_t n; 619 620/* 621 * Posix: 2010-07-05 19:41:17 622 * GNU: 2010-07-05 19:41:17.620000023 -0500 623 */ 624 625if(!isdigit(end[-1])) 626return0; 627 628 n =sane_tz_len(line, end - line); 629if(!n) 630 n =tz_with_colon_len(line, end - line); 631 end -= n; 632 633 n =short_time_len(line, end - line); 634if(!n) 635 n =fractional_time_len(line, end - line); 636 end -= n; 637 638 n =date_len(line, end - line); 639if(!n)/* No date. Too bad. */ 640return0; 641 end -= n; 642 643if(end == line)/* No space before date. */ 644return0; 645if(end[-1] =='\t') {/* Success! */ 646 end--; 647return line + len - end; 648} 649if(end[-1] !=' ')/* No space before date. */ 650return0; 651 652/* Whitespace damage. */ 653 end -=trailing_spaces_len(line, end - line); 654return line + len - end; 655} 656 657static char*find_name_common(struct apply_state *state, 658const char*line, 659const char*def, 660int p_value, 661const char*end, 662int terminate) 663{ 664int len; 665const char*start = NULL; 666 667if(p_value ==0) 668 start = line; 669while(line != end) { 670char c = *line; 671 672if(!end &&isspace(c)) { 673if(c =='\n') 674break; 675if(name_terminate(c, terminate)) 676break; 677} 678 line++; 679if(c =='/'&& !--p_value) 680 start = line; 681} 682if(!start) 683returnsquash_slash(xstrdup_or_null(def)); 684 len = line - start; 685if(!len) 686returnsquash_slash(xstrdup_or_null(def)); 687 688/* 689 * Generally we prefer the shorter name, especially 690 * if the other one is just a variation of that with 691 * something else tacked on to the end (ie "file.orig" 692 * or "file~"). 693 */ 694if(def) { 695int deflen =strlen(def); 696if(deflen < len && !strncmp(start, def, deflen)) 697returnsquash_slash(xstrdup(def)); 698} 699 700if(state->root.len) { 701char*ret =xstrfmt("%s%.*s", state->root.buf, len, start); 702returnsquash_slash(ret); 703} 704 705returnsquash_slash(xmemdupz(start, len)); 706} 707 708static char*find_name(struct apply_state *state, 709const char*line, 710char*def, 711int p_value, 712int terminate) 713{ 714if(*line =='"') { 715char*name =find_name_gnu(state, line, def, p_value); 716if(name) 717return name; 718} 719 720returnfind_name_common(state, line, def, p_value, NULL, terminate); 721} 722 723static char*find_name_traditional(struct apply_state *state, 724const char*line, 725char*def, 726int p_value) 727{ 728size_t len; 729size_t date_len; 730 731if(*line =='"') { 732char*name =find_name_gnu(state, line, def, p_value); 733if(name) 734return name; 735} 736 737 len =strchrnul(line,'\n') - line; 738 date_len =diff_timestamp_len(line, len); 739if(!date_len) 740returnfind_name_common(state, line, def, p_value, NULL, TERM_TAB); 741 len -= date_len; 742 743returnfind_name_common(state, line, def, p_value, line + len,0); 744} 745 746/* 747 * Given the string after "--- " or "+++ ", guess the appropriate 748 * p_value for the given patch. 749 */ 750static intguess_p_value(struct apply_state *state,const char*nameline) 751{ 752char*name, *cp; 753int val = -1; 754 755if(is_dev_null(nameline)) 756return-1; 757 name =find_name_traditional(state, nameline, NULL,0); 758if(!name) 759return-1; 760 cp =strchr(name,'/'); 761if(!cp) 762 val =0; 763else if(state->prefix) { 764/* 765 * Does it begin with "a/$our-prefix" and such? Then this is 766 * very likely to apply to our directory. 767 */ 768if(starts_with(name, state->prefix)) 769 val =count_slashes(state->prefix); 770else{ 771 cp++; 772if(starts_with(cp, state->prefix)) 773 val =count_slashes(state->prefix) +1; 774} 775} 776free(name); 777return val; 778} 779 780/* 781 * Does the ---/+++ line have the POSIX timestamp after the last HT? 782 * GNU diff puts epoch there to signal a creation/deletion event. Is 783 * this such a timestamp? 784 */ 785static inthas_epoch_timestamp(const char*nameline) 786{ 787/* 788 * We are only interested in epoch timestamp; any non-zero 789 * fraction cannot be one, hence "(\.0+)?" in the regexp below. 790 * For the same reason, the date must be either 1969-12-31 or 791 * 1970-01-01, and the seconds part must be "00". 792 */ 793const char stamp_regexp[] = 794"^[0-2][0-9]:([0-5][0-9]):00(\\.0+)?" 795" " 796"([-+][0-2][0-9]:?[0-5][0-9])\n"; 797const char*timestamp = NULL, *cp, *colon; 798static regex_t *stamp; 799 regmatch_t m[10]; 800int zoneoffset, epoch_hour, hour, minute; 801int status; 802 803for(cp = nameline; *cp !='\n'; cp++) { 804if(*cp =='\t') 805 timestamp = cp +1; 806} 807if(!timestamp) 808return0; 809 810/* 811 * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31 812 * (west of GMT) or 1970-01-01 (east of GMT) 813 */ 814if(skip_prefix(timestamp,"1969-12-31 ", ×tamp)) 815 epoch_hour =24; 816else if(skip_prefix(timestamp,"1970-01-01 ", ×tamp)) 817 epoch_hour =0; 818else 819return0; 820 821if(!stamp) { 822 stamp =xmalloc(sizeof(*stamp)); 823if(regcomp(stamp, stamp_regexp, REG_EXTENDED)) { 824warning(_("Cannot prepare timestamp regexp%s"), 825 stamp_regexp); 826return0; 827} 828} 829 830 status =regexec(stamp, timestamp,ARRAY_SIZE(m), m,0); 831if(status) { 832if(status != REG_NOMATCH) 833warning(_("regexec returned%dfor input:%s"), 834 status, timestamp); 835return0; 836} 837 838 hour =strtol(timestamp, NULL,10); 839 minute =strtol(timestamp + m[1].rm_so, NULL,10); 840 841 zoneoffset =strtol(timestamp + m[3].rm_so +1, (char**) &colon,10); 842if(*colon ==':') 843 zoneoffset = zoneoffset *60+strtol(colon +1, NULL,10); 844else 845 zoneoffset = (zoneoffset /100) *60+ (zoneoffset %100); 846if(timestamp[m[3].rm_so] =='-') 847 zoneoffset = -zoneoffset; 848 849return hour *60+ minute - zoneoffset == epoch_hour *60; 850} 851 852/* 853 * Get the name etc info from the ---/+++ lines of a traditional patch header 854 * 855 * FIXME! The end-of-filename heuristics are kind of screwy. For existing 856 * files, we can happily check the index for a match, but for creating a 857 * new file we should try to match whatever "patch" does. I have no idea. 858 */ 859static intparse_traditional_patch(struct apply_state *state, 860const char*first, 861const char*second, 862struct patch *patch) 863{ 864char*name; 865 866 first +=4;/* skip "--- " */ 867 second +=4;/* skip "+++ " */ 868if(!state->p_value_known) { 869int p, q; 870 p =guess_p_value(state, first); 871 q =guess_p_value(state, second); 872if(p <0) p = q; 873if(0<= p && p == q) { 874 state->p_value = p; 875 state->p_value_known =1; 876} 877} 878if(is_dev_null(first)) { 879 patch->is_new =1; 880 patch->is_delete =0; 881 name =find_name_traditional(state, second, NULL, state->p_value); 882 patch->new_name = name; 883}else if(is_dev_null(second)) { 884 patch->is_new =0; 885 patch->is_delete =1; 886 name =find_name_traditional(state, first, NULL, state->p_value); 887 patch->old_name = name; 888}else{ 889char*first_name; 890 first_name =find_name_traditional(state, first, NULL, state->p_value); 891 name =find_name_traditional(state, second, first_name, state->p_value); 892free(first_name); 893if(has_epoch_timestamp(first)) { 894 patch->is_new =1; 895 patch->is_delete =0; 896 patch->new_name = name; 897}else if(has_epoch_timestamp(second)) { 898 patch->is_new =0; 899 patch->is_delete =1; 900 patch->old_name = name; 901}else{ 902 patch->old_name = name; 903 patch->new_name =xstrdup_or_null(name); 904} 905} 906if(!name) 907returnerror(_("unable to find filename in patch at line%d"), state->linenr); 908 909return0; 910} 911 912static intgitdiff_hdrend(struct apply_state *state, 913const char*line, 914struct patch *patch) 915{ 916return1; 917} 918 919/* 920 * We're anal about diff header consistency, to make 921 * sure that we don't end up having strange ambiguous 922 * patches floating around. 923 * 924 * As a result, gitdiff_{old|new}name() will check 925 * their names against any previous information, just 926 * to make sure.. 927 */ 928#define DIFF_OLD_NAME 0 929#define DIFF_NEW_NAME 1 930 931static intgitdiff_verify_name(struct apply_state *state, 932const char*line, 933int isnull, 934char**name, 935int side) 936{ 937if(!*name && !isnull) { 938*name =find_name(state, line, NULL, state->p_value, TERM_TAB); 939return0; 940} 941 942if(*name) { 943char*another; 944if(isnull) 945returnerror(_("git apply: bad git-diff - expected /dev/null, got%son line%d"), 946*name, state->linenr); 947 another =find_name(state, line, NULL, state->p_value, TERM_TAB); 948if(!another ||strcmp(another, *name)) { 949free(another); 950returnerror((side == DIFF_NEW_NAME) ? 951_("git apply: bad git-diff - inconsistent new filename on line%d") : 952_("git apply: bad git-diff - inconsistent old filename on line%d"), state->linenr); 953} 954free(another); 955}else{ 956if(!is_dev_null(line)) 957returnerror(_("git apply: bad git-diff - expected /dev/null on line%d"), state->linenr); 958} 959 960return0; 961} 962 963static intgitdiff_oldname(struct apply_state *state, 964const char*line, 965struct patch *patch) 966{ 967returngitdiff_verify_name(state, line, 968 patch->is_new, &patch->old_name, 969 DIFF_OLD_NAME); 970} 971 972static intgitdiff_newname(struct apply_state *state, 973const char*line, 974struct patch *patch) 975{ 976returngitdiff_verify_name(state, line, 977 patch->is_delete, &patch->new_name, 978 DIFF_NEW_NAME); 979} 980 981static intparse_mode_line(const char*line,int linenr,unsigned int*mode) 982{ 983char*end; 984*mode =strtoul(line, &end,8); 985if(end == line || !isspace(*end)) 986returnerror(_("invalid mode on line%d:%s"), linenr, line); 987return0; 988} 989 990static intgitdiff_oldmode(struct apply_state *state, 991const char*line, 992struct patch *patch) 993{ 994returnparse_mode_line(line, state->linenr, &patch->old_mode); 995} 996 997static intgitdiff_newmode(struct apply_state *state, 998const char*line, 999struct patch *patch)1000{1001returnparse_mode_line(line, state->linenr, &patch->new_mode);1002}10031004static intgitdiff_delete(struct apply_state *state,1005const char*line,1006struct patch *patch)1007{1008 patch->is_delete =1;1009free(patch->old_name);1010 patch->old_name =xstrdup_or_null(patch->def_name);1011returngitdiff_oldmode(state, line, patch);1012}10131014static intgitdiff_newfile(struct apply_state *state,1015const char*line,1016struct patch *patch)1017{1018 patch->is_new =1;1019free(patch->new_name);1020 patch->new_name =xstrdup_or_null(patch->def_name);1021returngitdiff_newmode(state, line, patch);1022}10231024static intgitdiff_copysrc(struct apply_state *state,1025const char*line,1026struct patch *patch)1027{1028 patch->is_copy =1;1029free(patch->old_name);1030 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1031return0;1032}10331034static intgitdiff_copydst(struct apply_state *state,1035const char*line,1036struct patch *patch)1037{1038 patch->is_copy =1;1039free(patch->new_name);1040 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1041return0;1042}10431044static intgitdiff_renamesrc(struct apply_state *state,1045const char*line,1046struct patch *patch)1047{1048 patch->is_rename =1;1049free(patch->old_name);1050 patch->old_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1051return0;1052}10531054static intgitdiff_renamedst(struct apply_state *state,1055const char*line,1056struct patch *patch)1057{1058 patch->is_rename =1;1059free(patch->new_name);1060 patch->new_name =find_name(state, line, NULL, state->p_value ? state->p_value -1:0,0);1061return0;1062}10631064static intgitdiff_similarity(struct apply_state *state,1065const char*line,1066struct patch *patch)1067{1068unsigned long val =strtoul(line, NULL,10);1069if(val <=100)1070 patch->score = val;1071return0;1072}10731074static intgitdiff_dissimilarity(struct apply_state *state,1075const char*line,1076struct patch *patch)1077{1078unsigned long val =strtoul(line, NULL,10);1079if(val <=100)1080 patch->score = val;1081return0;1082}10831084static intgitdiff_index(struct apply_state *state,1085const char*line,1086struct patch *patch)1087{1088/*1089 * index line is N hexadecimal, "..", N hexadecimal,1090 * and optional space with octal mode.1091 */1092const char*ptr, *eol;1093int len;10941095 ptr =strchr(line,'.');1096if(!ptr || ptr[1] !='.'||40< ptr - line)1097return0;1098 len = ptr - line;1099memcpy(patch->old_sha1_prefix, line, len);1100 patch->old_sha1_prefix[len] =0;11011102 line = ptr +2;1103 ptr =strchr(line,' ');1104 eol =strchrnul(line,'\n');11051106if(!ptr || eol < ptr)1107 ptr = eol;1108 len = ptr - line;11091110if(40< len)1111return0;1112memcpy(patch->new_sha1_prefix, line, len);1113 patch->new_sha1_prefix[len] =0;1114if(*ptr ==' ')1115returngitdiff_oldmode(state, ptr +1, patch);1116return0;1117}11181119/*1120 * This is normal for a diff that doesn't change anything: we'll fall through1121 * into the next diff. Tell the parser to break out.1122 */1123static intgitdiff_unrecognized(struct apply_state *state,1124const char*line,1125struct patch *patch)1126{1127return1;1128}11291130/*1131 * Skip p_value leading components from "line"; as we do not accept1132 * absolute paths, return NULL in that case.1133 */1134static const char*skip_tree_prefix(struct apply_state *state,1135const char*line,1136int llen)1137{1138int nslash;1139int i;11401141if(!state->p_value)1142return(llen && line[0] =='/') ? NULL : line;11431144 nslash = state->p_value;1145for(i =0; i < llen; i++) {1146int ch = line[i];1147if(ch =='/'&& --nslash <=0)1148return(i ==0) ? NULL : &line[i +1];1149}1150return NULL;1151}11521153/*1154 * This is to extract the same name that appears on "diff --git"1155 * line. We do not find and return anything if it is a rename1156 * patch, and it is OK because we will find the name elsewhere.1157 * We need to reliably find name only when it is mode-change only,1158 * creation or deletion of an empty file. In any of these cases,1159 * both sides are the same name under a/ and b/ respectively.1160 */1161static char*git_header_name(struct apply_state *state,1162const char*line,1163int llen)1164{1165const char*name;1166const char*second = NULL;1167size_t len, line_len;11681169 line +=strlen("diff --git ");1170 llen -=strlen("diff --git ");11711172if(*line =='"') {1173const char*cp;1174struct strbuf first = STRBUF_INIT;1175struct strbuf sp = STRBUF_INIT;11761177if(unquote_c_style(&first, line, &second))1178goto free_and_fail1;11791180/* strip the a/b prefix including trailing slash */1181 cp =skip_tree_prefix(state, first.buf, first.len);1182if(!cp)1183goto free_and_fail1;1184strbuf_remove(&first,0, cp - first.buf);11851186/*1187 * second points at one past closing dq of name.1188 * find the second name.1189 */1190while((second < line + llen) &&isspace(*second))1191 second++;11921193if(line + llen <= second)1194goto free_and_fail1;1195if(*second =='"') {1196if(unquote_c_style(&sp, second, NULL))1197goto free_and_fail1;1198 cp =skip_tree_prefix(state, sp.buf, sp.len);1199if(!cp)1200goto free_and_fail1;1201/* They must match, otherwise ignore */1202if(strcmp(cp, first.buf))1203goto free_and_fail1;1204strbuf_release(&sp);1205returnstrbuf_detach(&first, NULL);1206}12071208/* unquoted second */1209 cp =skip_tree_prefix(state, second, line + llen - second);1210if(!cp)1211goto free_and_fail1;1212if(line + llen - cp != first.len ||1213memcmp(first.buf, cp, first.len))1214goto free_and_fail1;1215returnstrbuf_detach(&first, NULL);12161217 free_and_fail1:1218strbuf_release(&first);1219strbuf_release(&sp);1220return NULL;1221}12221223/* unquoted first name */1224 name =skip_tree_prefix(state, line, llen);1225if(!name)1226return NULL;12271228/*1229 * since the first name is unquoted, a dq if exists must be1230 * the beginning of the second name.1231 */1232for(second = name; second < line + llen; second++) {1233if(*second =='"') {1234struct strbuf sp = STRBUF_INIT;1235const char*np;12361237if(unquote_c_style(&sp, second, NULL))1238goto free_and_fail2;12391240 np =skip_tree_prefix(state, sp.buf, sp.len);1241if(!np)1242goto free_and_fail2;12431244 len = sp.buf + sp.len - np;1245if(len < second - name &&1246!strncmp(np, name, len) &&1247isspace(name[len])) {1248/* Good */1249strbuf_remove(&sp,0, np - sp.buf);1250returnstrbuf_detach(&sp, NULL);1251}12521253 free_and_fail2:1254strbuf_release(&sp);1255return NULL;1256}1257}12581259/*1260 * Accept a name only if it shows up twice, exactly the same1261 * form.1262 */1263 second =strchr(name,'\n');1264if(!second)1265return NULL;1266 line_len = second - name;1267for(len =0; ; len++) {1268switch(name[len]) {1269default:1270continue;1271case'\n':1272return NULL;1273case'\t':case' ':1274/*1275 * Is this the separator between the preimage1276 * and the postimage pathname? Again, we are1277 * only interested in the case where there is1278 * no rename, as this is only to set def_name1279 * and a rename patch has the names elsewhere1280 * in an unambiguous form.1281 */1282if(!name[len +1])1283return NULL;/* no postimage name */1284 second =skip_tree_prefix(state, name + len +1,1285 line_len - (len +1));1286if(!second)1287return NULL;1288/*1289 * Does len bytes starting at "name" and "second"1290 * (that are separated by one HT or SP we just1291 * found) exactly match?1292 */1293if(second[len] =='\n'&& !strncmp(name, second, len))1294returnxmemdupz(name, len);1295}1296}1297}12981299static intcheck_header_line(struct apply_state *state,struct patch *patch)1300{1301int extensions = (patch->is_delete ==1) + (patch->is_new ==1) +1302(patch->is_rename ==1) + (patch->is_copy ==1);1303if(extensions >1)1304returnerror(_("inconsistent header lines%dand%d"),1305 patch->extension_linenr, state->linenr);1306if(extensions && !patch->extension_linenr)1307 patch->extension_linenr = state->linenr;1308return0;1309}13101311/* Verify that we recognize the lines following a git header */1312static intparse_git_header(struct apply_state *state,1313const char*line,1314int len,1315unsigned int size,1316struct patch *patch)1317{1318unsigned long offset;13191320/* A git diff has explicit new/delete information, so we don't guess */1321 patch->is_new =0;1322 patch->is_delete =0;13231324/*1325 * Some things may not have the old name in the1326 * rest of the headers anywhere (pure mode changes,1327 * or removing or adding empty files), so we get1328 * the default name from the header.1329 */1330 patch->def_name =git_header_name(state, line, len);1331if(patch->def_name && state->root.len) {1332char*s =xstrfmt("%s%s", state->root.buf, patch->def_name);1333free(patch->def_name);1334 patch->def_name = s;1335}13361337 line += len;1338 size -= len;1339 state->linenr++;1340for(offset = len ; size >0; offset += len, size -= len, line += len, state->linenr++) {1341static const struct opentry {1342const char*str;1343int(*fn)(struct apply_state *,const char*,struct patch *);1344} optable[] = {1345{"@@ -", gitdiff_hdrend },1346{"--- ", gitdiff_oldname },1347{"+++ ", gitdiff_newname },1348{"old mode ", gitdiff_oldmode },1349{"new mode ", gitdiff_newmode },1350{"deleted file mode ", gitdiff_delete },1351{"new file mode ", gitdiff_newfile },1352{"copy from ", gitdiff_copysrc },1353{"copy to ", gitdiff_copydst },1354{"rename old ", gitdiff_renamesrc },1355{"rename new ", gitdiff_renamedst },1356{"rename from ", gitdiff_renamesrc },1357{"rename to ", gitdiff_renamedst },1358{"similarity index ", gitdiff_similarity },1359{"dissimilarity index ", gitdiff_dissimilarity },1360{"index ", gitdiff_index },1361{"", gitdiff_unrecognized },1362};1363int i;13641365 len =linelen(line, size);1366if(!len || line[len-1] !='\n')1367break;1368for(i =0; i <ARRAY_SIZE(optable); i++) {1369const struct opentry *p = optable + i;1370int oplen =strlen(p->str);1371int res;1372if(len < oplen ||memcmp(p->str, line, oplen))1373continue;1374 res = p->fn(state, line + oplen, patch);1375if(res <0)1376return-1;1377if(check_header_line(state, patch))1378return-1;1379if(res >0)1380return offset;1381break;1382}1383}13841385return offset;1386}13871388static intparse_num(const char*line,unsigned long*p)1389{1390char*ptr;13911392if(!isdigit(*line))1393return0;1394*p =strtoul(line, &ptr,10);1395return ptr - line;1396}13971398static intparse_range(const char*line,int len,int offset,const char*expect,1399unsigned long*p1,unsigned long*p2)1400{1401int digits, ex;14021403if(offset <0|| offset >= len)1404return-1;1405 line += offset;1406 len -= offset;14071408 digits =parse_num(line, p1);1409if(!digits)1410return-1;14111412 offset += digits;1413 line += digits;1414 len -= digits;14151416*p2 =1;1417if(*line ==',') {1418 digits =parse_num(line+1, p2);1419if(!digits)1420return-1;14211422 offset += digits+1;1423 line += digits+1;1424 len -= digits+1;1425}14261427 ex =strlen(expect);1428if(ex > len)1429return-1;1430if(memcmp(line, expect, ex))1431return-1;14321433return offset + ex;1434}14351436static voidrecount_diff(const char*line,int size,struct fragment *fragment)1437{1438int oldlines =0, newlines =0, ret =0;14391440if(size <1) {1441warning("recount: ignore empty hunk");1442return;1443}14441445for(;;) {1446int len =linelen(line, size);1447 size -= len;1448 line += len;14491450if(size <1)1451break;14521453switch(*line) {1454case' ':case'\n':1455 newlines++;1456/* fall through */1457case'-':1458 oldlines++;1459continue;1460case'+':1461 newlines++;1462continue;1463case'\\':1464continue;1465case'@':1466 ret = size <3|| !starts_with(line,"@@ ");1467break;1468case'd':1469 ret = size <5|| !starts_with(line,"diff ");1470break;1471default:1472 ret = -1;1473break;1474}1475if(ret) {1476warning(_("recount: unexpected line: %.*s"),1477(int)linelen(line, size), line);1478return;1479}1480break;1481}1482 fragment->oldlines = oldlines;1483 fragment->newlines = newlines;1484}14851486/*1487 * Parse a unified diff fragment header of the1488 * form "@@ -a,b +c,d @@"1489 */1490static intparse_fragment_header(const char*line,int len,struct fragment *fragment)1491{1492int offset;14931494if(!len || line[len-1] !='\n')1495return-1;14961497/* Figure out the number of lines in a fragment */1498 offset =parse_range(line, len,4," +", &fragment->oldpos, &fragment->oldlines);1499 offset =parse_range(line, len, offset," @@", &fragment->newpos, &fragment->newlines);15001501return offset;1502}15031504/*1505 * Find file diff header1506 *1507 * Returns:1508 * -1 if no header was found1509 * -128 in case of error1510 * the size of the header in bytes (called "offset") otherwise1511 */1512static intfind_header(struct apply_state *state,1513const char*line,1514unsigned long size,1515int*hdrsize,1516struct patch *patch)1517{1518unsigned long offset, len;15191520 patch->is_toplevel_relative =0;1521 patch->is_rename = patch->is_copy =0;1522 patch->is_new = patch->is_delete = -1;1523 patch->old_mode = patch->new_mode =0;1524 patch->old_name = patch->new_name = NULL;1525for(offset =0; size >0; offset += len, size -= len, line += len, state->linenr++) {1526unsigned long nextlen;15271528 len =linelen(line, size);1529if(!len)1530break;15311532/* Testing this early allows us to take a few shortcuts.. */1533if(len <6)1534continue;15351536/*1537 * Make sure we don't find any unconnected patch fragments.1538 * That's a sign that we didn't find a header, and that a1539 * patch has become corrupted/broken up.1540 */1541if(!memcmp("@@ -", line,4)) {1542struct fragment dummy;1543if(parse_fragment_header(line, len, &dummy) <0)1544continue;1545error(_("patch fragment without header at line%d: %.*s"),1546 state->linenr, (int)len-1, line);1547return-128;1548}15491550if(size < len +6)1551break;15521553/*1554 * Git patch? It might not have a real patch, just a rename1555 * or mode change, so we handle that specially1556 */1557if(!memcmp("diff --git ", line,11)) {1558int git_hdr_len =parse_git_header(state, line, len, size, patch);1559if(git_hdr_len <0)1560return-128;1561if(git_hdr_len <= len)1562continue;1563if(!patch->old_name && !patch->new_name) {1564if(!patch->def_name) {1565error(Q_("git diff header lacks filename information when removing "1566"%dleading pathname component (line%d)",1567"git diff header lacks filename information when removing "1568"%dleading pathname components (line%d)",1569 state->p_value),1570 state->p_value, state->linenr);1571return-128;1572}1573 patch->old_name =xstrdup(patch->def_name);1574 patch->new_name =xstrdup(patch->def_name);1575}1576if((!patch->new_name && !patch->is_delete) ||1577(!patch->old_name && !patch->is_new)) {1578error(_("git diff header lacks filename information "1579"(line%d)"), state->linenr);1580return-128;1581}1582 patch->is_toplevel_relative =1;1583*hdrsize = git_hdr_len;1584return offset;1585}15861587/* --- followed by +++ ? */1588if(memcmp("--- ", line,4) ||memcmp("+++ ", line + len,4))1589continue;15901591/*1592 * We only accept unified patches, so we want it to1593 * at least have "@@ -a,b +c,d @@\n", which is 14 chars1594 * minimum ("@@ -0,0 +1 @@\n" is the shortest).1595 */1596 nextlen =linelen(line + len, size - len);1597if(size < nextlen +14||memcmp("@@ -", line + len + nextlen,4))1598continue;15991600/* Ok, we'll consider it a patch */1601if(parse_traditional_patch(state, line, line+len, patch))1602return-128;1603*hdrsize = len + nextlen;1604 state->linenr +=2;1605return offset;1606}1607return-1;1608}16091610static voidrecord_ws_error(struct apply_state *state,1611unsigned result,1612const char*line,1613int len,1614int linenr)1615{1616char*err;16171618if(!result)1619return;16201621 state->whitespace_error++;1622if(state->squelch_whitespace_errors &&1623 state->squelch_whitespace_errors < state->whitespace_error)1624return;16251626 err =whitespace_error_string(result);1627if(state->apply_verbosity > verbosity_silent)1628fprintf(stderr,"%s:%d:%s.\n%.*s\n",1629 state->patch_input_file, linenr, err, len, line);1630free(err);1631}16321633static voidcheck_whitespace(struct apply_state *state,1634const char*line,1635int len,1636unsigned ws_rule)1637{1638unsigned result =ws_check(line +1, len -1, ws_rule);16391640record_ws_error(state, result, line +1, len -2, state->linenr);1641}16421643/*1644 * Check if the patch has context lines with CRLF or1645 * the patch wants to remove lines with CRLF.1646 */1647static voidcheck_old_for_crlf(struct patch *patch,const char*line,int len)1648{1649if(len >=2&& line[len-1] =='\n'&& line[len-2] =='\r') {1650 patch->ws_rule |= WS_CR_AT_EOL;1651 patch->crlf_in_old =1;1652}1653}165416551656/*1657 * Parse a unified diff. Note that this really needs to parse each1658 * fragment separately, since the only way to know the difference1659 * between a "---" that is part of a patch, and a "---" that starts1660 * the next patch is to look at the line counts..1661 */1662static intparse_fragment(struct apply_state *state,1663const char*line,1664unsigned long size,1665struct patch *patch,1666struct fragment *fragment)1667{1668int added, deleted;1669int len =linelen(line, size), offset;1670unsigned long oldlines, newlines;1671unsigned long leading, trailing;16721673 offset =parse_fragment_header(line, len, fragment);1674if(offset <0)1675return-1;1676if(offset >0&& patch->recount)1677recount_diff(line + offset, size - offset, fragment);1678 oldlines = fragment->oldlines;1679 newlines = fragment->newlines;1680 leading =0;1681 trailing =0;16821683/* Parse the thing.. */1684 line += len;1685 size -= len;1686 state->linenr++;1687 added = deleted =0;1688for(offset = len;16890< size;1690 offset += len, size -= len, line += len, state->linenr++) {1691if(!oldlines && !newlines)1692break;1693 len =linelen(line, size);1694if(!len || line[len-1] !='\n')1695return-1;1696switch(*line) {1697default:1698return-1;1699case'\n':/* newer GNU diff, an empty context line */1700case' ':1701 oldlines--;1702 newlines--;1703if(!deleted && !added)1704 leading++;1705 trailing++;1706check_old_for_crlf(patch, line, len);1707if(!state->apply_in_reverse &&1708 state->ws_error_action == correct_ws_error)1709check_whitespace(state, line, len, patch->ws_rule);1710break;1711case'-':1712if(!state->apply_in_reverse)1713check_old_for_crlf(patch, line, len);1714if(state->apply_in_reverse &&1715 state->ws_error_action != nowarn_ws_error)1716check_whitespace(state, line, len, patch->ws_rule);1717 deleted++;1718 oldlines--;1719 trailing =0;1720break;1721case'+':1722if(state->apply_in_reverse)1723check_old_for_crlf(patch, line, len);1724if(!state->apply_in_reverse &&1725 state->ws_error_action != nowarn_ws_error)1726check_whitespace(state, line, len, patch->ws_rule);1727 added++;1728 newlines--;1729 trailing =0;1730break;17311732/*1733 * We allow "\ No newline at end of file". Depending1734 * on locale settings when the patch was produced we1735 * don't know what this line looks like. The only1736 * thing we do know is that it begins with "\ ".1737 * Checking for 12 is just for sanity check -- any1738 * l10n of "\ No newline..." is at least that long.1739 */1740case'\\':1741if(len <12||memcmp(line,"\\",2))1742return-1;1743break;1744}1745}1746if(oldlines || newlines)1747return-1;1748if(!deleted && !added)1749return-1;17501751 fragment->leading = leading;1752 fragment->trailing = trailing;17531754/*1755 * If a fragment ends with an incomplete line, we failed to include1756 * it in the above loop because we hit oldlines == newlines == 01757 * before seeing it.1758 */1759if(12< size && !memcmp(line,"\\",2))1760 offset +=linelen(line, size);17611762 patch->lines_added += added;1763 patch->lines_deleted += deleted;17641765if(0< patch->is_new && oldlines)1766returnerror(_("new file depends on old contents"));1767if(0< patch->is_delete && newlines)1768returnerror(_("deleted file still has contents"));1769return offset;1770}17711772/*1773 * We have seen "diff --git a/... b/..." header (or a traditional patch1774 * header). Read hunks that belong to this patch into fragments and hang1775 * them to the given patch structure.1776 *1777 * The (fragment->patch, fragment->size) pair points into the memory given1778 * by the caller, not a copy, when we return.1779 *1780 * Returns:1781 * -1 in case of error,1782 * the number of bytes in the patch otherwise.1783 */1784static intparse_single_patch(struct apply_state *state,1785const char*line,1786unsigned long size,1787struct patch *patch)1788{1789unsigned long offset =0;1790unsigned long oldlines =0, newlines =0, context =0;1791struct fragment **fragp = &patch->fragments;17921793while(size >4&& !memcmp(line,"@@ -",4)) {1794struct fragment *fragment;1795int len;17961797 fragment =xcalloc(1,sizeof(*fragment));1798 fragment->linenr = state->linenr;1799 len =parse_fragment(state, line, size, patch, fragment);1800if(len <=0) {1801free(fragment);1802returnerror(_("corrupt patch at line%d"), state->linenr);1803}1804 fragment->patch = line;1805 fragment->size = len;1806 oldlines += fragment->oldlines;1807 newlines += fragment->newlines;1808 context += fragment->leading + fragment->trailing;18091810*fragp = fragment;1811 fragp = &fragment->next;18121813 offset += len;1814 line += len;1815 size -= len;1816}18171818/*1819 * If something was removed (i.e. we have old-lines) it cannot1820 * be creation, and if something was added it cannot be1821 * deletion. However, the reverse is not true; --unified=01822 * patches that only add are not necessarily creation even1823 * though they do not have any old lines, and ones that only1824 * delete are not necessarily deletion.1825 *1826 * Unfortunately, a real creation/deletion patch do _not_ have1827 * any context line by definition, so we cannot safely tell it1828 * apart with --unified=0 insanity. At least if the patch has1829 * more than one hunk it is not creation or deletion.1830 */1831if(patch->is_new <0&&1832(oldlines || (patch->fragments && patch->fragments->next)))1833 patch->is_new =0;1834if(patch->is_delete <0&&1835(newlines || (patch->fragments && patch->fragments->next)))1836 patch->is_delete =0;18371838if(0< patch->is_new && oldlines)1839returnerror(_("new file%sdepends on old contents"), patch->new_name);1840if(0< patch->is_delete && newlines)1841returnerror(_("deleted file%sstill has contents"), patch->old_name);1842if(!patch->is_delete && !newlines && context && state->apply_verbosity > verbosity_silent)1843fprintf_ln(stderr,1844_("** warning: "1845"file%sbecomes empty but is not deleted"),1846 patch->new_name);18471848return offset;1849}18501851staticinlineintmetadata_changes(struct patch *patch)1852{1853return patch->is_rename >0||1854 patch->is_copy >0||1855 patch->is_new >0||1856 patch->is_delete ||1857(patch->old_mode && patch->new_mode &&1858 patch->old_mode != patch->new_mode);1859}18601861static char*inflate_it(const void*data,unsigned long size,1862unsigned long inflated_size)1863{1864 git_zstream stream;1865void*out;1866int st;18671868memset(&stream,0,sizeof(stream));18691870 stream.next_in = (unsigned char*)data;1871 stream.avail_in = size;1872 stream.next_out = out =xmalloc(inflated_size);1873 stream.avail_out = inflated_size;1874git_inflate_init(&stream);1875 st =git_inflate(&stream, Z_FINISH);1876git_inflate_end(&stream);1877if((st != Z_STREAM_END) || stream.total_out != inflated_size) {1878free(out);1879return NULL;1880}1881return out;1882}18831884/*1885 * Read a binary hunk and return a new fragment; fragment->patch1886 * points at an allocated memory that the caller must free, so1887 * it is marked as "->free_patch = 1".1888 */1889static struct fragment *parse_binary_hunk(struct apply_state *state,1890char**buf_p,1891unsigned long*sz_p,1892int*status_p,1893int*used_p)1894{1895/*1896 * Expect a line that begins with binary patch method ("literal"1897 * or "delta"), followed by the length of data before deflating.1898 * a sequence of 'length-byte' followed by base-85 encoded data1899 * should follow, terminated by a newline.1900 *1901 * Each 5-byte sequence of base-85 encodes up to 4 bytes,1902 * and we would limit the patch line to 66 characters,1903 * so one line can fit up to 13 groups that would decode1904 * to 52 bytes max. The length byte 'A'-'Z' corresponds1905 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.1906 */1907int llen, used;1908unsigned long size = *sz_p;1909char*buffer = *buf_p;1910int patch_method;1911unsigned long origlen;1912char*data = NULL;1913int hunk_size =0;1914struct fragment *frag;19151916 llen =linelen(buffer, size);1917 used = llen;19181919*status_p =0;19201921if(starts_with(buffer,"delta ")) {1922 patch_method = BINARY_DELTA_DEFLATED;1923 origlen =strtoul(buffer +6, NULL,10);1924}1925else if(starts_with(buffer,"literal ")) {1926 patch_method = BINARY_LITERAL_DEFLATED;1927 origlen =strtoul(buffer +8, NULL,10);1928}1929else1930return NULL;19311932 state->linenr++;1933 buffer += llen;1934while(1) {1935int byte_length, max_byte_length, newsize;1936 llen =linelen(buffer, size);1937 used += llen;1938 state->linenr++;1939if(llen ==1) {1940/* consume the blank line */1941 buffer++;1942 size--;1943break;1944}1945/*1946 * Minimum line is "A00000\n" which is 7-byte long,1947 * and the line length must be multiple of 5 plus 2.1948 */1949if((llen <7) || (llen-2) %5)1950goto corrupt;1951 max_byte_length = (llen -2) /5*4;1952 byte_length = *buffer;1953if('A'<= byte_length && byte_length <='Z')1954 byte_length = byte_length -'A'+1;1955else if('a'<= byte_length && byte_length <='z')1956 byte_length = byte_length -'a'+27;1957else1958goto corrupt;1959/* if the input length was not multiple of 4, we would1960 * have filler at the end but the filler should never1961 * exceed 3 bytes1962 */1963if(max_byte_length < byte_length ||1964 byte_length <= max_byte_length -4)1965goto corrupt;1966 newsize = hunk_size + byte_length;1967 data =xrealloc(data, newsize);1968if(decode_85(data + hunk_size, buffer +1, byte_length))1969goto corrupt;1970 hunk_size = newsize;1971 buffer += llen;1972 size -= llen;1973}19741975 frag =xcalloc(1,sizeof(*frag));1976 frag->patch =inflate_it(data, hunk_size, origlen);1977 frag->free_patch =1;1978if(!frag->patch)1979goto corrupt;1980free(data);1981 frag->size = origlen;1982*buf_p = buffer;1983*sz_p = size;1984*used_p = used;1985 frag->binary_patch_method = patch_method;1986return frag;19871988 corrupt:1989free(data);1990*status_p = -1;1991error(_("corrupt binary patch at line%d: %.*s"),1992 state->linenr-1, llen-1, buffer);1993return NULL;1994}19951996/*1997 * Returns:1998 * -1 in case of error,1999 * the length of the parsed binary patch otherwise2000 */2001static intparse_binary(struct apply_state *state,2002char*buffer,2003unsigned long size,2004struct patch *patch)2005{2006/*2007 * We have read "GIT binary patch\n"; what follows is a line2008 * that says the patch method (currently, either "literal" or2009 * "delta") and the length of data before deflating; a2010 * sequence of 'length-byte' followed by base-85 encoded data2011 * follows.2012 *2013 * When a binary patch is reversible, there is another binary2014 * hunk in the same format, starting with patch method (either2015 * "literal" or "delta") with the length of data, and a sequence2016 * of length-byte + base-85 encoded data, terminated with another2017 * empty line. This data, when applied to the postimage, produces2018 * the preimage.2019 */2020struct fragment *forward;2021struct fragment *reverse;2022int status;2023int used, used_1;20242025 forward =parse_binary_hunk(state, &buffer, &size, &status, &used);2026if(!forward && !status)2027/* there has to be one hunk (forward hunk) */2028returnerror(_("unrecognized binary patch at line%d"), state->linenr-1);2029if(status)2030/* otherwise we already gave an error message */2031return status;20322033 reverse =parse_binary_hunk(state, &buffer, &size, &status, &used_1);2034if(reverse)2035 used += used_1;2036else if(status) {2037/*2038 * Not having reverse hunk is not an error, but having2039 * a corrupt reverse hunk is.2040 */2041free((void*) forward->patch);2042free(forward);2043return status;2044}2045 forward->next = reverse;2046 patch->fragments = forward;2047 patch->is_binary =1;2048return used;2049}20502051static voidprefix_one(struct apply_state *state,char**name)2052{2053char*old_name = *name;2054if(!old_name)2055return;2056*name =prefix_filename(state->prefix, *name);2057free(old_name);2058}20592060static voidprefix_patch(struct apply_state *state,struct patch *p)2061{2062if(!state->prefix || p->is_toplevel_relative)2063return;2064prefix_one(state, &p->new_name);2065prefix_one(state, &p->old_name);2066}20672068/*2069 * include/exclude2070 */20712072static voidadd_name_limit(struct apply_state *state,2073const char*name,2074int exclude)2075{2076struct string_list_item *it;20772078 it =string_list_append(&state->limit_by_name, name);2079 it->util = exclude ? NULL : (void*)1;2080}20812082static intuse_patch(struct apply_state *state,struct patch *p)2083{2084const char*pathname = p->new_name ? p->new_name : p->old_name;2085int i;20862087/* Paths outside are not touched regardless of "--include" */2088if(state->prefix && *state->prefix) {2089const char*rest;2090if(!skip_prefix(pathname, state->prefix, &rest) || !*rest)2091return0;2092}20932094/* See if it matches any of exclude/include rule */2095for(i =0; i < state->limit_by_name.nr; i++) {2096struct string_list_item *it = &state->limit_by_name.items[i];2097if(!wildmatch(it->string, pathname,0))2098return(it->util != NULL);2099}21002101/*2102 * If we had any include, a path that does not match any rule is2103 * not used. Otherwise, we saw bunch of exclude rules (or none)2104 * and such a path is used.2105 */2106return!state->has_include;2107}21082109/*2110 * Read the patch text in "buffer" that extends for "size" bytes; stop2111 * reading after seeing a single patch (i.e. changes to a single file).2112 * Create fragments (i.e. patch hunks) and hang them to the given patch.2113 *2114 * Returns:2115 * -1 if no header was found or parse_binary() failed,2116 * -128 on another error,2117 * the number of bytes consumed otherwise,2118 * so that the caller can call us again for the next patch.2119 */2120static intparse_chunk(struct apply_state *state,char*buffer,unsigned long size,struct patch *patch)2121{2122int hdrsize, patchsize;2123int offset =find_header(state, buffer, size, &hdrsize, patch);21242125if(offset <0)2126return offset;21272128prefix_patch(state, patch);21292130if(!use_patch(state, patch))2131 patch->ws_rule =0;2132else2133 patch->ws_rule =whitespace_rule(patch->new_name2134? patch->new_name2135: patch->old_name);21362137 patchsize =parse_single_patch(state,2138 buffer + offset + hdrsize,2139 size - offset - hdrsize,2140 patch);21412142if(patchsize <0)2143return-128;21442145if(!patchsize) {2146static const char git_binary[] ="GIT binary patch\n";2147int hd = hdrsize + offset;2148unsigned long llen =linelen(buffer + hd, size - hd);21492150if(llen ==sizeof(git_binary) -1&&2151!memcmp(git_binary, buffer + hd, llen)) {2152int used;2153 state->linenr++;2154 used =parse_binary(state, buffer + hd + llen,2155 size - hd - llen, patch);2156if(used <0)2157return-1;2158if(used)2159 patchsize = used + llen;2160else2161 patchsize =0;2162}2163else if(!memcmp(" differ\n", buffer + hd + llen -8,8)) {2164static const char*binhdr[] = {2165"Binary files ",2166"Files ",2167 NULL,2168};2169int i;2170for(i =0; binhdr[i]; i++) {2171int len =strlen(binhdr[i]);2172if(len < size - hd &&2173!memcmp(binhdr[i], buffer + hd, len)) {2174 state->linenr++;2175 patch->is_binary =1;2176 patchsize = llen;2177break;2178}2179}2180}21812182/* Empty patch cannot be applied if it is a text patch2183 * without metadata change. A binary patch appears2184 * empty to us here.2185 */2186if((state->apply || state->check) &&2187(!patch->is_binary && !metadata_changes(patch))) {2188error(_("patch with only garbage at line%d"), state->linenr);2189return-128;2190}2191}21922193return offset + hdrsize + patchsize;2194}21952196static voidreverse_patches(struct patch *p)2197{2198for(; p; p = p->next) {2199struct fragment *frag = p->fragments;22002201SWAP(p->new_name, p->old_name);2202SWAP(p->new_mode, p->old_mode);2203SWAP(p->is_new, p->is_delete);2204SWAP(p->lines_added, p->lines_deleted);2205SWAP(p->old_sha1_prefix, p->new_sha1_prefix);22062207for(; frag; frag = frag->next) {2208SWAP(frag->newpos, frag->oldpos);2209SWAP(frag->newlines, frag->oldlines);2210}2211}2212}22132214static const char pluses[] =2215"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";2216static const char minuses[]=2217"----------------------------------------------------------------------";22182219static voidshow_stats(struct apply_state *state,struct patch *patch)2220{2221struct strbuf qname = STRBUF_INIT;2222char*cp = patch->new_name ? patch->new_name : patch->old_name;2223int max, add, del;22242225quote_c_style(cp, &qname, NULL,0);22262227/*2228 * "scale" the filename2229 */2230 max = state->max_len;2231if(max >50)2232 max =50;22332234if(qname.len > max) {2235 cp =strchr(qname.buf + qname.len +3- max,'/');2236if(!cp)2237 cp = qname.buf + qname.len +3- max;2238strbuf_splice(&qname,0, cp - qname.buf,"...",3);2239}22402241if(patch->is_binary) {2242printf(" %-*s | Bin\n", max, qname.buf);2243strbuf_release(&qname);2244return;2245}22462247printf(" %-*s |", max, qname.buf);2248strbuf_release(&qname);22492250/*2251 * scale the add/delete2252 */2253 max = max + state->max_change >70?70- max : state->max_change;2254 add = patch->lines_added;2255 del = patch->lines_deleted;22562257if(state->max_change >0) {2258int total = ((add + del) * max + state->max_change /2) / state->max_change;2259 add = (add * max + state->max_change /2) / state->max_change;2260 del = total - add;2261}2262printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,2263 add, pluses, del, minuses);2264}22652266static intread_old_data(struct stat *st,struct patch *patch,2267const char*path,struct strbuf *buf)2268{2269int conv_flags = patch->crlf_in_old ?2270 CONV_EOL_KEEP_CRLF : CONV_EOL_RENORMALIZE;2271switch(st->st_mode & S_IFMT) {2272case S_IFLNK:2273if(strbuf_readlink(buf, path, st->st_size) <0)2274returnerror(_("unable to read symlink%s"), path);2275return0;2276case S_IFREG:2277if(strbuf_read_file(buf, path, st->st_size) != st->st_size)2278returnerror(_("unable to open or read%s"), path);2279/*2280 * "git apply" without "--index/--cached" should never look2281 * at the index; the target file may not have been added to2282 * the index yet, and we may not even be in any Git repository.2283 * Pass NULL to convert_to_git() to stress this; the function2284 * should never look at the index when explicit crlf option2285 * is given.2286 */2287convert_to_git(NULL, path, buf->buf, buf->len, buf, conv_flags);2288return0;2289default:2290return-1;2291}2292}22932294/*2295 * Update the preimage, and the common lines in postimage,2296 * from buffer buf of length len. If postlen is 0 the postimage2297 * is updated in place, otherwise it's updated on a new buffer2298 * of length postlen2299 */23002301static voidupdate_pre_post_images(struct image *preimage,2302struct image *postimage,2303char*buf,2304size_t len,size_t postlen)2305{2306int i, ctx, reduced;2307char*new_buf, *old_buf, *fixed;2308struct image fixed_preimage;23092310/*2311 * Update the preimage with whitespace fixes. Note that we2312 * are not losing preimage->buf -- apply_one_fragment() will2313 * free "oldlines".2314 */2315prepare_image(&fixed_preimage, buf, len,1);2316assert(postlen2317? fixed_preimage.nr == preimage->nr2318: fixed_preimage.nr <= preimage->nr);2319for(i =0; i < fixed_preimage.nr; i++)2320 fixed_preimage.line[i].flag = preimage->line[i].flag;2321free(preimage->line_allocated);2322*preimage = fixed_preimage;23232324/*2325 * Adjust the common context lines in postimage. This can be2326 * done in-place when we are shrinking it with whitespace2327 * fixing, but needs a new buffer when ignoring whitespace or2328 * expanding leading tabs to spaces.2329 *2330 * We trust the caller to tell us if the update can be done2331 * in place (postlen==0) or not.2332 */2333 old_buf = postimage->buf;2334if(postlen)2335 new_buf = postimage->buf =xmalloc(postlen);2336else2337 new_buf = old_buf;2338 fixed = preimage->buf;23392340for(i = reduced = ctx =0; i < postimage->nr; i++) {2341size_t l_len = postimage->line[i].len;2342if(!(postimage->line[i].flag & LINE_COMMON)) {2343/* an added line -- no counterparts in preimage */2344memmove(new_buf, old_buf, l_len);2345 old_buf += l_len;2346 new_buf += l_len;2347continue;2348}23492350/* a common context -- skip it in the original postimage */2351 old_buf += l_len;23522353/* and find the corresponding one in the fixed preimage */2354while(ctx < preimage->nr &&2355!(preimage->line[ctx].flag & LINE_COMMON)) {2356 fixed += preimage->line[ctx].len;2357 ctx++;2358}23592360/*2361 * preimage is expected to run out, if the caller2362 * fixed addition of trailing blank lines.2363 */2364if(preimage->nr <= ctx) {2365 reduced++;2366continue;2367}23682369/* and copy it in, while fixing the line length */2370 l_len = preimage->line[ctx].len;2371memcpy(new_buf, fixed, l_len);2372 new_buf += l_len;2373 fixed += l_len;2374 postimage->line[i].len = l_len;2375 ctx++;2376}23772378if(postlen2379? postlen < new_buf - postimage->buf2380: postimage->len < new_buf - postimage->buf)2381BUG("caller miscounted postlen: asked%d, orig =%d, used =%d",2382(int)postlen, (int) postimage->len, (int)(new_buf - postimage->buf));23832384/* Fix the length of the whole thing */2385 postimage->len = new_buf - postimage->buf;2386 postimage->nr -= reduced;2387}23882389static intline_by_line_fuzzy_match(struct image *img,2390struct image *preimage,2391struct image *postimage,2392unsigned long current,2393int current_lno,2394int preimage_limit)2395{2396int i;2397size_t imgoff =0;2398size_t preoff =0;2399size_t postlen = postimage->len;2400size_t extra_chars;2401char*buf;2402char*preimage_eof;2403char*preimage_end;2404struct strbuf fixed;2405char*fixed_buf;2406size_t fixed_len;24072408for(i =0; i < preimage_limit; i++) {2409size_t prelen = preimage->line[i].len;2410size_t imglen = img->line[current_lno+i].len;24112412if(!fuzzy_matchlines(img->buf + current + imgoff, imglen,2413 preimage->buf + preoff, prelen))2414return0;2415if(preimage->line[i].flag & LINE_COMMON)2416 postlen += imglen - prelen;2417 imgoff += imglen;2418 preoff += prelen;2419}24202421/*2422 * Ok, the preimage matches with whitespace fuzz.2423 *2424 * imgoff now holds the true length of the target that2425 * matches the preimage before the end of the file.2426 *2427 * Count the number of characters in the preimage that fall2428 * beyond the end of the file and make sure that all of them2429 * are whitespace characters. (This can only happen if2430 * we are removing blank lines at the end of the file.)2431 */2432 buf = preimage_eof = preimage->buf + preoff;2433for( ; i < preimage->nr; i++)2434 preoff += preimage->line[i].len;2435 preimage_end = preimage->buf + preoff;2436for( ; buf < preimage_end; buf++)2437if(!isspace(*buf))2438return0;24392440/*2441 * Update the preimage and the common postimage context2442 * lines to use the same whitespace as the target.2443 * If whitespace is missing in the target (i.e.2444 * if the preimage extends beyond the end of the file),2445 * use the whitespace from the preimage.2446 */2447 extra_chars = preimage_end - preimage_eof;2448strbuf_init(&fixed, imgoff + extra_chars);2449strbuf_add(&fixed, img->buf + current, imgoff);2450strbuf_add(&fixed, preimage_eof, extra_chars);2451 fixed_buf =strbuf_detach(&fixed, &fixed_len);2452update_pre_post_images(preimage, postimage,2453 fixed_buf, fixed_len, postlen);2454return1;2455}24562457static intmatch_fragment(struct apply_state *state,2458struct image *img,2459struct image *preimage,2460struct image *postimage,2461unsigned long current,2462int current_lno,2463unsigned ws_rule,2464int match_beginning,int match_end)2465{2466int i;2467char*fixed_buf, *buf, *orig, *target;2468struct strbuf fixed;2469size_t fixed_len, postlen;2470int preimage_limit;24712472if(preimage->nr + current_lno <= img->nr) {2473/*2474 * The hunk falls within the boundaries of img.2475 */2476 preimage_limit = preimage->nr;2477if(match_end && (preimage->nr + current_lno != img->nr))2478return0;2479}else if(state->ws_error_action == correct_ws_error &&2480(ws_rule & WS_BLANK_AT_EOF)) {2481/*2482 * This hunk extends beyond the end of img, and we are2483 * removing blank lines at the end of the file. This2484 * many lines from the beginning of the preimage must2485 * match with img, and the remainder of the preimage2486 * must be blank.2487 */2488 preimage_limit = img->nr - current_lno;2489}else{2490/*2491 * The hunk extends beyond the end of the img and2492 * we are not removing blanks at the end, so we2493 * should reject the hunk at this position.2494 */2495return0;2496}24972498if(match_beginning && current_lno)2499return0;25002501/* Quick hash check */2502for(i =0; i < preimage_limit; i++)2503if((img->line[current_lno + i].flag & LINE_PATCHED) ||2504(preimage->line[i].hash != img->line[current_lno + i].hash))2505return0;25062507if(preimage_limit == preimage->nr) {2508/*2509 * Do we have an exact match? If we were told to match2510 * at the end, size must be exactly at current+fragsize,2511 * otherwise current+fragsize must be still within the preimage,2512 * and either case, the old piece should match the preimage2513 * exactly.2514 */2515if((match_end2516? (current + preimage->len == img->len)2517: (current + preimage->len <= img->len)) &&2518!memcmp(img->buf + current, preimage->buf, preimage->len))2519return1;2520}else{2521/*2522 * The preimage extends beyond the end of img, so2523 * there cannot be an exact match.2524 *2525 * There must be one non-blank context line that match2526 * a line before the end of img.2527 */2528char*buf_end;25292530 buf = preimage->buf;2531 buf_end = buf;2532for(i =0; i < preimage_limit; i++)2533 buf_end += preimage->line[i].len;25342535for( ; buf < buf_end; buf++)2536if(!isspace(*buf))2537break;2538if(buf == buf_end)2539return0;2540}25412542/*2543 * No exact match. If we are ignoring whitespace, run a line-by-line2544 * fuzzy matching. We collect all the line length information because2545 * we need it to adjust whitespace if we match.2546 */2547if(state->ws_ignore_action == ignore_ws_change)2548returnline_by_line_fuzzy_match(img, preimage, postimage,2549 current, current_lno, preimage_limit);25502551if(state->ws_error_action != correct_ws_error)2552return0;25532554/*2555 * The hunk does not apply byte-by-byte, but the hash says2556 * it might with whitespace fuzz. We weren't asked to2557 * ignore whitespace, we were asked to correct whitespace2558 * errors, so let's try matching after whitespace correction.2559 *2560 * While checking the preimage against the target, whitespace2561 * errors in both fixed, we count how large the corresponding2562 * postimage needs to be. The postimage prepared by2563 * apply_one_fragment() has whitespace errors fixed on added2564 * lines already, but the common lines were propagated as-is,2565 * which may become longer when their whitespace errors are2566 * fixed.2567 */25682569/* First count added lines in postimage */2570 postlen =0;2571for(i =0; i < postimage->nr; i++) {2572if(!(postimage->line[i].flag & LINE_COMMON))2573 postlen += postimage->line[i].len;2574}25752576/*2577 * The preimage may extend beyond the end of the file,2578 * but in this loop we will only handle the part of the2579 * preimage that falls within the file.2580 */2581strbuf_init(&fixed, preimage->len +1);2582 orig = preimage->buf;2583 target = img->buf + current;2584for(i =0; i < preimage_limit; i++) {2585size_t oldlen = preimage->line[i].len;2586size_t tgtlen = img->line[current_lno + i].len;2587size_t fixstart = fixed.len;2588struct strbuf tgtfix;2589int match;25902591/* Try fixing the line in the preimage */2592ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);25932594/* Try fixing the line in the target */2595strbuf_init(&tgtfix, tgtlen);2596ws_fix_copy(&tgtfix, target, tgtlen, ws_rule, NULL);25972598/*2599 * If they match, either the preimage was based on2600 * a version before our tree fixed whitespace breakage,2601 * or we are lacking a whitespace-fix patch the tree2602 * the preimage was based on already had (i.e. target2603 * has whitespace breakage, the preimage doesn't).2604 * In either case, we are fixing the whitespace breakages2605 * so we might as well take the fix together with their2606 * real change.2607 */2608 match = (tgtfix.len == fixed.len - fixstart &&2609!memcmp(tgtfix.buf, fixed.buf + fixstart,2610 fixed.len - fixstart));26112612/* Add the length if this is common with the postimage */2613if(preimage->line[i].flag & LINE_COMMON)2614 postlen += tgtfix.len;26152616strbuf_release(&tgtfix);2617if(!match)2618goto unmatch_exit;26192620 orig += oldlen;2621 target += tgtlen;2622}262326242625/*2626 * Now handle the lines in the preimage that falls beyond the2627 * end of the file (if any). They will only match if they are2628 * empty or only contain whitespace (if WS_BLANK_AT_EOL is2629 * false).2630 */2631for( ; i < preimage->nr; i++) {2632size_t fixstart = fixed.len;/* start of the fixed preimage */2633size_t oldlen = preimage->line[i].len;2634int j;26352636/* Try fixing the line in the preimage */2637ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);26382639for(j = fixstart; j < fixed.len; j++)2640if(!isspace(fixed.buf[j]))2641goto unmatch_exit;26422643 orig += oldlen;2644}26452646/*2647 * Yes, the preimage is based on an older version that still2648 * has whitespace breakages unfixed, and fixing them makes the2649 * hunk match. Update the context lines in the postimage.2650 */2651 fixed_buf =strbuf_detach(&fixed, &fixed_len);2652if(postlen < postimage->len)2653 postlen =0;2654update_pre_post_images(preimage, postimage,2655 fixed_buf, fixed_len, postlen);2656return1;26572658 unmatch_exit:2659strbuf_release(&fixed);2660return0;2661}26622663static intfind_pos(struct apply_state *state,2664struct image *img,2665struct image *preimage,2666struct image *postimage,2667int line,2668unsigned ws_rule,2669int match_beginning,int match_end)2670{2671int i;2672unsigned long backwards, forwards, current;2673int backwards_lno, forwards_lno, current_lno;26742675/*2676 * If match_beginning or match_end is specified, there is no2677 * point starting from a wrong line that will never match and2678 * wander around and wait for a match at the specified end.2679 */2680if(match_beginning)2681 line =0;2682else if(match_end)2683 line = img->nr - preimage->nr;26842685/*2686 * Because the comparison is unsigned, the following test2687 * will also take care of a negative line number that can2688 * result when match_end and preimage is larger than the target.2689 */2690if((size_t) line > img->nr)2691 line = img->nr;26922693 current =0;2694for(i =0; i < line; i++)2695 current += img->line[i].len;26962697/*2698 * There's probably some smart way to do this, but I'll leave2699 * that to the smart and beautiful people. I'm simple and stupid.2700 */2701 backwards = current;2702 backwards_lno = line;2703 forwards = current;2704 forwards_lno = line;2705 current_lno = line;27062707for(i =0; ; i++) {2708if(match_fragment(state, img, preimage, postimage,2709 current, current_lno, ws_rule,2710 match_beginning, match_end))2711return current_lno;27122713 again:2714if(backwards_lno ==0&& forwards_lno == img->nr)2715break;27162717if(i &1) {2718if(backwards_lno ==0) {2719 i++;2720goto again;2721}2722 backwards_lno--;2723 backwards -= img->line[backwards_lno].len;2724 current = backwards;2725 current_lno = backwards_lno;2726}else{2727if(forwards_lno == img->nr) {2728 i++;2729goto again;2730}2731 forwards += img->line[forwards_lno].len;2732 forwards_lno++;2733 current = forwards;2734 current_lno = forwards_lno;2735}27362737}2738return-1;2739}27402741static voidremove_first_line(struct image *img)2742{2743 img->buf += img->line[0].len;2744 img->len -= img->line[0].len;2745 img->line++;2746 img->nr--;2747}27482749static voidremove_last_line(struct image *img)2750{2751 img->len -= img->line[--img->nr].len;2752}27532754/*2755 * The change from "preimage" and "postimage" has been found to2756 * apply at applied_pos (counts in line numbers) in "img".2757 * Update "img" to remove "preimage" and replace it with "postimage".2758 */2759static voidupdate_image(struct apply_state *state,2760struct image *img,2761int applied_pos,2762struct image *preimage,2763struct image *postimage)2764{2765/*2766 * remove the copy of preimage at offset in img2767 * and replace it with postimage2768 */2769int i, nr;2770size_t remove_count, insert_count, applied_at =0;2771char*result;2772int preimage_limit;27732774/*2775 * If we are removing blank lines at the end of img,2776 * the preimage may extend beyond the end.2777 * If that is the case, we must be careful only to2778 * remove the part of the preimage that falls within2779 * the boundaries of img. Initialize preimage_limit2780 * to the number of lines in the preimage that falls2781 * within the boundaries.2782 */2783 preimage_limit = preimage->nr;2784if(preimage_limit > img->nr - applied_pos)2785 preimage_limit = img->nr - applied_pos;27862787for(i =0; i < applied_pos; i++)2788 applied_at += img->line[i].len;27892790 remove_count =0;2791for(i =0; i < preimage_limit; i++)2792 remove_count += img->line[applied_pos + i].len;2793 insert_count = postimage->len;27942795/* Adjust the contents */2796 result =xmalloc(st_add3(st_sub(img->len, remove_count), insert_count,1));2797memcpy(result, img->buf, applied_at);2798memcpy(result + applied_at, postimage->buf, postimage->len);2799memcpy(result + applied_at + postimage->len,2800 img->buf + (applied_at + remove_count),2801 img->len - (applied_at + remove_count));2802free(img->buf);2803 img->buf = result;2804 img->len += insert_count - remove_count;2805 result[img->len] ='\0';28062807/* Adjust the line table */2808 nr = img->nr + postimage->nr - preimage_limit;2809if(preimage_limit < postimage->nr) {2810/*2811 * NOTE: this knows that we never call remove_first_line()2812 * on anything other than pre/post image.2813 */2814REALLOC_ARRAY(img->line, nr);2815 img->line_allocated = img->line;2816}2817if(preimage_limit != postimage->nr)2818MOVE_ARRAY(img->line + applied_pos + postimage->nr,2819 img->line + applied_pos + preimage_limit,2820 img->nr - (applied_pos + preimage_limit));2821COPY_ARRAY(img->line + applied_pos, postimage->line, postimage->nr);2822if(!state->allow_overlap)2823for(i =0; i < postimage->nr; i++)2824 img->line[applied_pos + i].flag |= LINE_PATCHED;2825 img->nr = nr;2826}28272828/*2829 * Use the patch-hunk text in "frag" to prepare two images (preimage and2830 * postimage) for the hunk. Find lines that match "preimage" in "img" and2831 * replace the part of "img" with "postimage" text.2832 */2833static intapply_one_fragment(struct apply_state *state,2834struct image *img,struct fragment *frag,2835int inaccurate_eof,unsigned ws_rule,2836int nth_fragment)2837{2838int match_beginning, match_end;2839const char*patch = frag->patch;2840int size = frag->size;2841char*old, *oldlines;2842struct strbuf newlines;2843int new_blank_lines_at_end =0;2844int found_new_blank_lines_at_end =0;2845int hunk_linenr = frag->linenr;2846unsigned long leading, trailing;2847int pos, applied_pos;2848struct image preimage;2849struct image postimage;28502851memset(&preimage,0,sizeof(preimage));2852memset(&postimage,0,sizeof(postimage));2853 oldlines =xmalloc(size);2854strbuf_init(&newlines, size);28552856 old = oldlines;2857while(size >0) {2858char first;2859int len =linelen(patch, size);2860int plen;2861int added_blank_line =0;2862int is_blank_context =0;2863size_t start;28642865if(!len)2866break;28672868/*2869 * "plen" is how much of the line we should use for2870 * the actual patch data. Normally we just remove the2871 * first character on the line, but if the line is2872 * followed by "\ No newline", then we also remove the2873 * last one (which is the newline, of course).2874 */2875 plen = len -1;2876if(len < size && patch[len] =='\\')2877 plen--;2878 first = *patch;2879if(state->apply_in_reverse) {2880if(first =='-')2881 first ='+';2882else if(first =='+')2883 first ='-';2884}28852886switch(first) {2887case'\n':2888/* Newer GNU diff, empty context line */2889if(plen <0)2890/* ... followed by '\No newline'; nothing */2891break;2892*old++ ='\n';2893strbuf_addch(&newlines,'\n');2894add_line_info(&preimage,"\n",1, LINE_COMMON);2895add_line_info(&postimage,"\n",1, LINE_COMMON);2896 is_blank_context =1;2897break;2898case' ':2899if(plen && (ws_rule & WS_BLANK_AT_EOF) &&2900ws_blank_line(patch +1, plen, ws_rule))2901 is_blank_context =1;2902/* fallthrough */2903case'-':2904memcpy(old, patch +1, plen);2905add_line_info(&preimage, old, plen,2906(first ==' '? LINE_COMMON :0));2907 old += plen;2908if(first =='-')2909break;2910/* fallthrough */2911case'+':2912/* --no-add does not add new lines */2913if(first =='+'&& state->no_add)2914break;29152916 start = newlines.len;2917if(first !='+'||2918!state->whitespace_error ||2919 state->ws_error_action != correct_ws_error) {2920strbuf_add(&newlines, patch +1, plen);2921}2922else{2923ws_fix_copy(&newlines, patch +1, plen, ws_rule, &state->applied_after_fixing_ws);2924}2925add_line_info(&postimage, newlines.buf + start, newlines.len - start,2926(first =='+'?0: LINE_COMMON));2927if(first =='+'&&2928(ws_rule & WS_BLANK_AT_EOF) &&2929ws_blank_line(patch +1, plen, ws_rule))2930 added_blank_line =1;2931break;2932case'@':case'\\':2933/* Ignore it, we already handled it */2934break;2935default:2936if(state->apply_verbosity > verbosity_normal)2937error(_("invalid start of line: '%c'"), first);2938 applied_pos = -1;2939goto out;2940}2941if(added_blank_line) {2942if(!new_blank_lines_at_end)2943 found_new_blank_lines_at_end = hunk_linenr;2944 new_blank_lines_at_end++;2945}2946else if(is_blank_context)2947;2948else2949 new_blank_lines_at_end =0;2950 patch += len;2951 size -= len;2952 hunk_linenr++;2953}2954if(inaccurate_eof &&2955 old > oldlines && old[-1] =='\n'&&2956 newlines.len >0&& newlines.buf[newlines.len -1] =='\n') {2957 old--;2958strbuf_setlen(&newlines, newlines.len -1);2959 preimage.line_allocated[preimage.nr -1].len--;2960 postimage.line_allocated[postimage.nr -1].len--;2961}29622963 leading = frag->leading;2964 trailing = frag->trailing;29652966/*2967 * A hunk to change lines at the beginning would begin with2968 * @@ -1,L +N,M @@2969 * but we need to be careful. -U0 that inserts before the second2970 * line also has this pattern.2971 *2972 * And a hunk to add to an empty file would begin with2973 * @@ -0,0 +N,M @@2974 *2975 * In other words, a hunk that is (frag->oldpos <= 1) with or2976 * without leading context must match at the beginning.2977 */2978 match_beginning = (!frag->oldpos ||2979(frag->oldpos ==1&& !state->unidiff_zero));29802981/*2982 * A hunk without trailing lines must match at the end.2983 * However, we simply cannot tell if a hunk must match end2984 * from the lack of trailing lines if the patch was generated2985 * with unidiff without any context.2986 */2987 match_end = !state->unidiff_zero && !trailing;29882989 pos = frag->newpos ? (frag->newpos -1) :0;2990 preimage.buf = oldlines;2991 preimage.len = old - oldlines;2992 postimage.buf = newlines.buf;2993 postimage.len = newlines.len;2994 preimage.line = preimage.line_allocated;2995 postimage.line = postimage.line_allocated;29962997for(;;) {29982999 applied_pos =find_pos(state, img, &preimage, &postimage, pos,3000 ws_rule, match_beginning, match_end);30013002if(applied_pos >=0)3003break;30043005/* Am I at my context limits? */3006if((leading <= state->p_context) && (trailing <= state->p_context))3007break;3008if(match_beginning || match_end) {3009 match_beginning = match_end =0;3010continue;3011}30123013/*3014 * Reduce the number of context lines; reduce both3015 * leading and trailing if they are equal otherwise3016 * just reduce the larger context.3017 */3018if(leading >= trailing) {3019remove_first_line(&preimage);3020remove_first_line(&postimage);3021 pos--;3022 leading--;3023}3024if(trailing > leading) {3025remove_last_line(&preimage);3026remove_last_line(&postimage);3027 trailing--;3028}3029}30303031if(applied_pos >=0) {3032if(new_blank_lines_at_end &&3033 preimage.nr + applied_pos >= img->nr &&3034(ws_rule & WS_BLANK_AT_EOF) &&3035 state->ws_error_action != nowarn_ws_error) {3036record_ws_error(state, WS_BLANK_AT_EOF,"+",1,3037 found_new_blank_lines_at_end);3038if(state->ws_error_action == correct_ws_error) {3039while(new_blank_lines_at_end--)3040remove_last_line(&postimage);3041}3042/*3043 * We would want to prevent write_out_results()3044 * from taking place in apply_patch() that follows3045 * the callchain led us here, which is:3046 * apply_patch->check_patch_list->check_patch->3047 * apply_data->apply_fragments->apply_one_fragment3048 */3049if(state->ws_error_action == die_on_ws_error)3050 state->apply =0;3051}30523053if(state->apply_verbosity > verbosity_normal && applied_pos != pos) {3054int offset = applied_pos - pos;3055if(state->apply_in_reverse)3056 offset =0- offset;3057fprintf_ln(stderr,3058Q_("Hunk #%dsucceeded at%d(offset%dline).",3059"Hunk #%dsucceeded at%d(offset%dlines).",3060 offset),3061 nth_fragment, applied_pos +1, offset);3062}30633064/*3065 * Warn if it was necessary to reduce the number3066 * of context lines.3067 */3068if((leading != frag->leading ||3069 trailing != frag->trailing) && state->apply_verbosity > verbosity_silent)3070fprintf_ln(stderr,_("Context reduced to (%ld/%ld)"3071" to apply fragment at%d"),3072 leading, trailing, applied_pos+1);3073update_image(state, img, applied_pos, &preimage, &postimage);3074}else{3075if(state->apply_verbosity > verbosity_normal)3076error(_("while searching for:\n%.*s"),3077(int)(old - oldlines), oldlines);3078}30793080out:3081free(oldlines);3082strbuf_release(&newlines);3083free(preimage.line_allocated);3084free(postimage.line_allocated);30853086return(applied_pos <0);3087}30883089static intapply_binary_fragment(struct apply_state *state,3090struct image *img,3091struct patch *patch)3092{3093struct fragment *fragment = patch->fragments;3094unsigned long len;3095void*dst;30963097if(!fragment)3098returnerror(_("missing binary patch data for '%s'"),3099 patch->new_name ?3100 patch->new_name :3101 patch->old_name);31023103/* Binary patch is irreversible without the optional second hunk */3104if(state->apply_in_reverse) {3105if(!fragment->next)3106returnerror(_("cannot reverse-apply a binary patch "3107"without the reverse hunk to '%s'"),3108 patch->new_name3109? patch->new_name : patch->old_name);3110 fragment = fragment->next;3111}3112switch(fragment->binary_patch_method) {3113case BINARY_DELTA_DEFLATED:3114 dst =patch_delta(img->buf, img->len, fragment->patch,3115 fragment->size, &len);3116if(!dst)3117return-1;3118clear_image(img);3119 img->buf = dst;3120 img->len = len;3121return0;3122case BINARY_LITERAL_DEFLATED:3123clear_image(img);3124 img->len = fragment->size;3125 img->buf =xmemdupz(fragment->patch, img->len);3126return0;3127}3128return-1;3129}31303131/*3132 * Replace "img" with the result of applying the binary patch.3133 * The binary patch data itself in patch->fragment is still kept3134 * but the preimage prepared by the caller in "img" is freed here3135 * or in the helper function apply_binary_fragment() this calls.3136 */3137static intapply_binary(struct apply_state *state,3138struct image *img,3139struct patch *patch)3140{3141const char*name = patch->old_name ? patch->old_name : patch->new_name;3142struct object_id oid;31433144/*3145 * For safety, we require patch index line to contain3146 * full 40-byte textual SHA1 for old and new, at least for now.3147 */3148if(strlen(patch->old_sha1_prefix) !=40||3149strlen(patch->new_sha1_prefix) !=40||3150get_oid_hex(patch->old_sha1_prefix, &oid) ||3151get_oid_hex(patch->new_sha1_prefix, &oid))3152returnerror(_("cannot apply binary patch to '%s' "3153"without full index line"), name);31543155if(patch->old_name) {3156/*3157 * See if the old one matches what the patch3158 * applies to.3159 */3160hash_object_file(img->buf, img->len, blob_type, &oid);3161if(strcmp(oid_to_hex(&oid), patch->old_sha1_prefix))3162returnerror(_("the patch applies to '%s' (%s), "3163"which does not match the "3164"current contents."),3165 name,oid_to_hex(&oid));3166}3167else{3168/* Otherwise, the old one must be empty. */3169if(img->len)3170returnerror(_("the patch applies to an empty "3171"'%s' but it is not empty"), name);3172}31733174get_oid_hex(patch->new_sha1_prefix, &oid);3175if(is_null_oid(&oid)) {3176clear_image(img);3177return0;/* deletion patch */3178}31793180if(has_sha1_file(oid.hash)) {3181/* We already have the postimage */3182enum object_type type;3183unsigned long size;3184char*result;31853186 result =read_object_file(&oid, &type, &size);3187if(!result)3188returnerror(_("the necessary postimage%sfor "3189"'%s' cannot be read"),3190 patch->new_sha1_prefix, name);3191clear_image(img);3192 img->buf = result;3193 img->len = size;3194}else{3195/*3196 * We have verified buf matches the preimage;3197 * apply the patch data to it, which is stored3198 * in the patch->fragments->{patch,size}.3199 */3200if(apply_binary_fragment(state, img, patch))3201returnerror(_("binary patch does not apply to '%s'"),3202 name);32033204/* verify that the result matches */3205hash_object_file(img->buf, img->len, blob_type, &oid);3206if(strcmp(oid_to_hex(&oid), patch->new_sha1_prefix))3207returnerror(_("binary patch to '%s' creates incorrect result (expecting%s, got%s)"),3208 name, patch->new_sha1_prefix,oid_to_hex(&oid));3209}32103211return0;3212}32133214static intapply_fragments(struct apply_state *state,struct image *img,struct patch *patch)3215{3216struct fragment *frag = patch->fragments;3217const char*name = patch->old_name ? patch->old_name : patch->new_name;3218unsigned ws_rule = patch->ws_rule;3219unsigned inaccurate_eof = patch->inaccurate_eof;3220int nth =0;32213222if(patch->is_binary)3223returnapply_binary(state, img, patch);32243225while(frag) {3226 nth++;3227if(apply_one_fragment(state, img, frag, inaccurate_eof, ws_rule, nth)) {3228error(_("patch failed:%s:%ld"), name, frag->oldpos);3229if(!state->apply_with_reject)3230return-1;3231 frag->rejected =1;3232}3233 frag = frag->next;3234}3235return0;3236}32373238static intread_blob_object(struct strbuf *buf,const struct object_id *oid,unsigned mode)3239{3240if(S_ISGITLINK(mode)) {3241strbuf_grow(buf,100);3242strbuf_addf(buf,"Subproject commit%s\n",oid_to_hex(oid));3243}else{3244enum object_type type;3245unsigned long sz;3246char*result;32473248 result =read_object_file(oid, &type, &sz);3249if(!result)3250return-1;3251/* XXX read_sha1_file NUL-terminates */3252strbuf_attach(buf, result, sz, sz +1);3253}3254return0;3255}32563257static intread_file_or_gitlink(const struct cache_entry *ce,struct strbuf *buf)3258{3259if(!ce)3260return0;3261returnread_blob_object(buf, &ce->oid, ce->ce_mode);3262}32633264static struct patch *in_fn_table(struct apply_state *state,const char*name)3265{3266struct string_list_item *item;32673268if(name == NULL)3269return NULL;32703271 item =string_list_lookup(&state->fn_table, name);3272if(item != NULL)3273return(struct patch *)item->util;32743275return NULL;3276}32773278/*3279 * item->util in the filename table records the status of the path.3280 * Usually it points at a patch (whose result records the contents3281 * of it after applying it), but it could be PATH_WAS_DELETED for a3282 * path that a previously applied patch has already removed, or3283 * PATH_TO_BE_DELETED for a path that a later patch would remove.3284 *3285 * The latter is needed to deal with a case where two paths A and B3286 * are swapped by first renaming A to B and then renaming B to A;3287 * moving A to B should not be prevented due to presence of B as we3288 * will remove it in a later patch.3289 */3290#define PATH_TO_BE_DELETED ((struct patch *) -2)3291#define PATH_WAS_DELETED ((struct patch *) -1)32923293static intto_be_deleted(struct patch *patch)3294{3295return patch == PATH_TO_BE_DELETED;3296}32973298static intwas_deleted(struct patch *patch)3299{3300return patch == PATH_WAS_DELETED;3301}33023303static voidadd_to_fn_table(struct apply_state *state,struct patch *patch)3304{3305struct string_list_item *item;33063307/*3308 * Always add new_name unless patch is a deletion3309 * This should cover the cases for normal diffs,3310 * file creations and copies3311 */3312if(patch->new_name != NULL) {3313 item =string_list_insert(&state->fn_table, patch->new_name);3314 item->util = patch;3315}33163317/*3318 * store a failure on rename/deletion cases because3319 * later chunks shouldn't patch old names3320 */3321if((patch->new_name == NULL) || (patch->is_rename)) {3322 item =string_list_insert(&state->fn_table, patch->old_name);3323 item->util = PATH_WAS_DELETED;3324}3325}33263327static voidprepare_fn_table(struct apply_state *state,struct patch *patch)3328{3329/*3330 * store information about incoming file deletion3331 */3332while(patch) {3333if((patch->new_name == NULL) || (patch->is_rename)) {3334struct string_list_item *item;3335 item =string_list_insert(&state->fn_table, patch->old_name);3336 item->util = PATH_TO_BE_DELETED;3337}3338 patch = patch->next;3339}3340}33413342static intcheckout_target(struct index_state *istate,3343struct cache_entry *ce,struct stat *st)3344{3345struct checkout costate = CHECKOUT_INIT;33463347 costate.refresh_cache =1;3348 costate.istate = istate;3349if(checkout_entry(ce, &costate, NULL) ||lstat(ce->name, st))3350returnerror(_("cannot checkout%s"), ce->name);3351return0;3352}33533354static struct patch *previous_patch(struct apply_state *state,3355struct patch *patch,3356int*gone)3357{3358struct patch *previous;33593360*gone =0;3361if(patch->is_copy || patch->is_rename)3362return NULL;/* "git" patches do not depend on the order */33633364 previous =in_fn_table(state, patch->old_name);3365if(!previous)3366return NULL;33673368if(to_be_deleted(previous))3369return NULL;/* the deletion hasn't happened yet */33703371if(was_deleted(previous))3372*gone =1;33733374return previous;3375}33763377static intverify_index_match(const struct cache_entry *ce,struct stat *st)3378{3379if(S_ISGITLINK(ce->ce_mode)) {3380if(!S_ISDIR(st->st_mode))3381return-1;3382return0;3383}3384returnce_match_stat(ce, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);3385}33863387#define SUBMODULE_PATCH_WITHOUT_INDEX 133883389static intload_patch_target(struct apply_state *state,3390struct strbuf *buf,3391const struct cache_entry *ce,3392struct stat *st,3393struct patch *patch,3394const char*name,3395unsigned expected_mode)3396{3397if(state->cached || state->check_index) {3398if(read_file_or_gitlink(ce, buf))3399returnerror(_("failed to read%s"), name);3400}else if(name) {3401if(S_ISGITLINK(expected_mode)) {3402if(ce)3403returnread_file_or_gitlink(ce, buf);3404else3405return SUBMODULE_PATCH_WITHOUT_INDEX;3406}else if(has_symlink_leading_path(name,strlen(name))) {3407returnerror(_("reading from '%s' beyond a symbolic link"), name);3408}else{3409if(read_old_data(st, patch, name, buf))3410returnerror(_("failed to read%s"), name);3411}3412}3413return0;3414}34153416/*3417 * We are about to apply "patch"; populate the "image" with the3418 * current version we have, from the working tree or from the index,3419 * depending on the situation e.g. --cached/--index. If we are3420 * applying a non-git patch that incrementally updates the tree,3421 * we read from the result of a previous diff.3422 */3423static intload_preimage(struct apply_state *state,3424struct image *image,3425struct patch *patch,struct stat *st,3426const struct cache_entry *ce)3427{3428struct strbuf buf = STRBUF_INIT;3429size_t len;3430char*img;3431struct patch *previous;3432int status;34333434 previous =previous_patch(state, patch, &status);3435if(status)3436returnerror(_("path%shas been renamed/deleted"),3437 patch->old_name);3438if(previous) {3439/* We have a patched copy in memory; use that. */3440strbuf_add(&buf, previous->result, previous->resultsize);3441}else{3442 status =load_patch_target(state, &buf, ce, st, patch,3443 patch->old_name, patch->old_mode);3444if(status <0)3445return status;3446else if(status == SUBMODULE_PATCH_WITHOUT_INDEX) {3447/*3448 * There is no way to apply subproject3449 * patch without looking at the index.3450 * NEEDSWORK: shouldn't this be flagged3451 * as an error???3452 */3453free_fragment_list(patch->fragments);3454 patch->fragments = NULL;3455}else if(status) {3456returnerror(_("failed to read%s"), patch->old_name);3457}3458}34593460 img =strbuf_detach(&buf, &len);3461prepare_image(image, img, len, !patch->is_binary);3462return0;3463}34643465static intthree_way_merge(struct image *image,3466char*path,3467const struct object_id *base,3468const struct object_id *ours,3469const struct object_id *theirs)3470{3471 mmfile_t base_file, our_file, their_file;3472 mmbuffer_t result = { NULL };3473int status;34743475read_mmblob(&base_file, base);3476read_mmblob(&our_file, ours);3477read_mmblob(&their_file, theirs);3478 status =ll_merge(&result, path,3479&base_file,"base",3480&our_file,"ours",3481&their_file,"theirs", NULL);3482free(base_file.ptr);3483free(our_file.ptr);3484free(their_file.ptr);3485if(status <0|| !result.ptr) {3486free(result.ptr);3487return-1;3488}3489clear_image(image);3490 image->buf = result.ptr;3491 image->len = result.size;34923493return status;3494}34953496/*3497 * When directly falling back to add/add three-way merge, we read from3498 * the current contents of the new_name. In no cases other than that3499 * this function will be called.3500 */3501static intload_current(struct apply_state *state,3502struct image *image,3503struct patch *patch)3504{3505struct strbuf buf = STRBUF_INIT;3506int status, pos;3507size_t len;3508char*img;3509struct stat st;3510struct cache_entry *ce;3511char*name = patch->new_name;3512unsigned mode = patch->new_mode;35133514if(!patch->is_new)3515BUG("patch to%sis not a creation", patch->old_name);35163517 pos =cache_name_pos(name,strlen(name));3518if(pos <0)3519returnerror(_("%s: does not exist in index"), name);3520 ce = active_cache[pos];3521if(lstat(name, &st)) {3522if(errno != ENOENT)3523returnerror_errno("%s", name);3524if(checkout_target(&the_index, ce, &st))3525return-1;3526}3527if(verify_index_match(ce, &st))3528returnerror(_("%s: does not match index"), name);35293530 status =load_patch_target(state, &buf, ce, &st, patch, name, mode);3531if(status <0)3532return status;3533else if(status)3534return-1;3535 img =strbuf_detach(&buf, &len);3536prepare_image(image, img, len, !patch->is_binary);3537return0;3538}35393540static inttry_threeway(struct apply_state *state,3541struct image *image,3542struct patch *patch,3543struct stat *st,3544const struct cache_entry *ce)3545{3546struct object_id pre_oid, post_oid, our_oid;3547struct strbuf buf = STRBUF_INIT;3548size_t len;3549int status;3550char*img;3551struct image tmp_image;35523553/* No point falling back to 3-way merge in these cases */3554if(patch->is_delete ||3555S_ISGITLINK(patch->old_mode) ||S_ISGITLINK(patch->new_mode))3556return-1;35573558/* Preimage the patch was prepared for */3559if(patch->is_new)3560write_object_file("",0, blob_type, &pre_oid);3561else if(get_oid(patch->old_sha1_prefix, &pre_oid) ||3562read_blob_object(&buf, &pre_oid, patch->old_mode))3563returnerror(_("repository lacks the necessary blob to fall back on 3-way merge."));35643565if(state->apply_verbosity > verbosity_silent)3566fprintf(stderr,_("Falling back to three-way merge...\n"));35673568 img =strbuf_detach(&buf, &len);3569prepare_image(&tmp_image, img, len,1);3570/* Apply the patch to get the post image */3571if(apply_fragments(state, &tmp_image, patch) <0) {3572clear_image(&tmp_image);3573return-1;3574}3575/* post_oid is theirs */3576write_object_file(tmp_image.buf, tmp_image.len, blob_type, &post_oid);3577clear_image(&tmp_image);35783579/* our_oid is ours */3580if(patch->is_new) {3581if(load_current(state, &tmp_image, patch))3582returnerror(_("cannot read the current contents of '%s'"),3583 patch->new_name);3584}else{3585if(load_preimage(state, &tmp_image, patch, st, ce))3586returnerror(_("cannot read the current contents of '%s'"),3587 patch->old_name);3588}3589write_object_file(tmp_image.buf, tmp_image.len, blob_type, &our_oid);3590clear_image(&tmp_image);35913592/* in-core three-way merge between post and our using pre as base */3593 status =three_way_merge(image, patch->new_name,3594&pre_oid, &our_oid, &post_oid);3595if(status <0) {3596if(state->apply_verbosity > verbosity_silent)3597fprintf(stderr,3598_("Failed to fall back on three-way merge...\n"));3599return status;3600}36013602if(status) {3603 patch->conflicted_threeway =1;3604if(patch->is_new)3605oidclr(&patch->threeway_stage[0]);3606else3607oidcpy(&patch->threeway_stage[0], &pre_oid);3608oidcpy(&patch->threeway_stage[1], &our_oid);3609oidcpy(&patch->threeway_stage[2], &post_oid);3610if(state->apply_verbosity > verbosity_silent)3611fprintf(stderr,3612_("Applied patch to '%s' with conflicts.\n"),3613 patch->new_name);3614}else{3615if(state->apply_verbosity > verbosity_silent)3616fprintf(stderr,3617_("Applied patch to '%s' cleanly.\n"),3618 patch->new_name);3619}3620return0;3621}36223623static intapply_data(struct apply_state *state,struct patch *patch,3624struct stat *st,const struct cache_entry *ce)3625{3626struct image image;36273628if(load_preimage(state, &image, patch, st, ce) <0)3629return-1;36303631if(patch->direct_to_threeway ||3632apply_fragments(state, &image, patch) <0) {3633/* Note: with --reject, apply_fragments() returns 0 */3634if(!state->threeway ||try_threeway(state, &image, patch, st, ce) <0)3635return-1;3636}3637 patch->result = image.buf;3638 patch->resultsize = image.len;3639add_to_fn_table(state, patch);3640free(image.line_allocated);36413642if(0< patch->is_delete && patch->resultsize)3643returnerror(_("removal patch leaves file contents"));36443645return0;3646}36473648/*3649 * If "patch" that we are looking at modifies or deletes what we have,3650 * we would want it not to lose any local modification we have, either3651 * in the working tree or in the index.3652 *3653 * This also decides if a non-git patch is a creation patch or a3654 * modification to an existing empty file. We do not check the state3655 * of the current tree for a creation patch in this function; the caller3656 * check_patch() separately makes sure (and errors out otherwise) that3657 * the path the patch creates does not exist in the current tree.3658 */3659static intcheck_preimage(struct apply_state *state,3660struct patch *patch,3661struct cache_entry **ce,3662struct stat *st)3663{3664const char*old_name = patch->old_name;3665struct patch *previous = NULL;3666int stat_ret =0, status;3667unsigned st_mode =0;36683669if(!old_name)3670return0;36713672assert(patch->is_new <=0);3673 previous =previous_patch(state, patch, &status);36743675if(status)3676returnerror(_("path%shas been renamed/deleted"), old_name);3677if(previous) {3678 st_mode = previous->new_mode;3679}else if(!state->cached) {3680 stat_ret =lstat(old_name, st);3681if(stat_ret && errno != ENOENT)3682returnerror_errno("%s", old_name);3683}36843685if(state->check_index && !previous) {3686int pos =cache_name_pos(old_name,strlen(old_name));3687if(pos <0) {3688if(patch->is_new <0)3689goto is_new;3690returnerror(_("%s: does not exist in index"), old_name);3691}3692*ce = active_cache[pos];3693if(stat_ret <0) {3694if(checkout_target(&the_index, *ce, st))3695return-1;3696}3697if(!state->cached &&verify_index_match(*ce, st))3698returnerror(_("%s: does not match index"), old_name);3699if(state->cached)3700 st_mode = (*ce)->ce_mode;3701}else if(stat_ret <0) {3702if(patch->is_new <0)3703goto is_new;3704returnerror_errno("%s", old_name);3705}37063707if(!state->cached && !previous)3708 st_mode =ce_mode_from_stat(*ce, st->st_mode);37093710if(patch->is_new <0)3711 patch->is_new =0;3712if(!patch->old_mode)3713 patch->old_mode = st_mode;3714if((st_mode ^ patch->old_mode) & S_IFMT)3715returnerror(_("%s: wrong type"), old_name);3716if(st_mode != patch->old_mode)3717warning(_("%shas type%o, expected%o"),3718 old_name, st_mode, patch->old_mode);3719if(!patch->new_mode && !patch->is_delete)3720 patch->new_mode = st_mode;3721return0;37223723 is_new:3724 patch->is_new =1;3725 patch->is_delete =0;3726FREE_AND_NULL(patch->old_name);3727return0;3728}372937303731#define EXISTS_IN_INDEX 13732#define EXISTS_IN_WORKTREE 237333734static intcheck_to_create(struct apply_state *state,3735const char*new_name,3736int ok_if_exists)3737{3738struct stat nst;37393740if(state->check_index &&3741cache_name_pos(new_name,strlen(new_name)) >=0&&3742!ok_if_exists)3743return EXISTS_IN_INDEX;3744if(state->cached)3745return0;37463747if(!lstat(new_name, &nst)) {3748if(S_ISDIR(nst.st_mode) || ok_if_exists)3749return0;3750/*3751 * A leading component of new_name might be a symlink3752 * that is going to be removed with this patch, but3753 * still pointing at somewhere that has the path.3754 * In such a case, path "new_name" does not exist as3755 * far as git is concerned.3756 */3757if(has_symlink_leading_path(new_name,strlen(new_name)))3758return0;37593760return EXISTS_IN_WORKTREE;3761}else if(!is_missing_file_error(errno)) {3762returnerror_errno("%s", new_name);3763}3764return0;3765}37663767static uintptr_tregister_symlink_changes(struct apply_state *state,3768const char*path,3769uintptr_t what)3770{3771struct string_list_item *ent;37723773 ent =string_list_lookup(&state->symlink_changes, path);3774if(!ent) {3775 ent =string_list_insert(&state->symlink_changes, path);3776 ent->util = (void*)0;3777}3778 ent->util = (void*)(what | ((uintptr_t)ent->util));3779return(uintptr_t)ent->util;3780}37813782static uintptr_tcheck_symlink_changes(struct apply_state *state,const char*path)3783{3784struct string_list_item *ent;37853786 ent =string_list_lookup(&state->symlink_changes, path);3787if(!ent)3788return0;3789return(uintptr_t)ent->util;3790}37913792static voidprepare_symlink_changes(struct apply_state *state,struct patch *patch)3793{3794for( ; patch; patch = patch->next) {3795if((patch->old_name &&S_ISLNK(patch->old_mode)) &&3796(patch->is_rename || patch->is_delete))3797/* the symlink at patch->old_name is removed */3798register_symlink_changes(state, patch->old_name, APPLY_SYMLINK_GOES_AWAY);37993800if(patch->new_name &&S_ISLNK(patch->new_mode))3801/* the symlink at patch->new_name is created or remains */3802register_symlink_changes(state, patch->new_name, APPLY_SYMLINK_IN_RESULT);3803}3804}38053806static intpath_is_beyond_symlink_1(struct apply_state *state,struct strbuf *name)3807{3808do{3809unsigned int change;38103811while(--name->len && name->buf[name->len] !='/')3812;/* scan backwards */3813if(!name->len)3814break;3815 name->buf[name->len] ='\0';3816 change =check_symlink_changes(state, name->buf);3817if(change & APPLY_SYMLINK_IN_RESULT)3818return1;3819if(change & APPLY_SYMLINK_GOES_AWAY)3820/*3821 * This cannot be "return 0", because we may3822 * see a new one created at a higher level.3823 */3824continue;38253826/* otherwise, check the preimage */3827if(state->check_index) {3828struct cache_entry *ce;38293830 ce =cache_file_exists(name->buf, name->len, ignore_case);3831if(ce &&S_ISLNK(ce->ce_mode))3832return1;3833}else{3834struct stat st;3835if(!lstat(name->buf, &st) &&S_ISLNK(st.st_mode))3836return1;3837}3838}while(1);3839return0;3840}38413842static intpath_is_beyond_symlink(struct apply_state *state,const char*name_)3843{3844int ret;3845struct strbuf name = STRBUF_INIT;38463847assert(*name_ !='\0');3848strbuf_addstr(&name, name_);3849 ret =path_is_beyond_symlink_1(state, &name);3850strbuf_release(&name);38513852return ret;3853}38543855static intcheck_unsafe_path(struct patch *patch)3856{3857const char*old_name = NULL;3858const char*new_name = NULL;3859if(patch->is_delete)3860 old_name = patch->old_name;3861else if(!patch->is_new && !patch->is_copy)3862 old_name = patch->old_name;3863if(!patch->is_delete)3864 new_name = patch->new_name;38653866if(old_name && !verify_path(old_name, patch->old_mode))3867returnerror(_("invalid path '%s'"), old_name);3868if(new_name && !verify_path(new_name, patch->new_mode))3869returnerror(_("invalid path '%s'"), new_name);3870return0;3871}38723873/*3874 * Check and apply the patch in-core; leave the result in patch->result3875 * for the caller to write it out to the final destination.3876 */3877static intcheck_patch(struct apply_state *state,struct patch *patch)3878{3879struct stat st;3880const char*old_name = patch->old_name;3881const char*new_name = patch->new_name;3882const char*name = old_name ? old_name : new_name;3883struct cache_entry *ce = NULL;3884struct patch *tpatch;3885int ok_if_exists;3886int status;38873888 patch->rejected =1;/* we will drop this after we succeed */38893890 status =check_preimage(state, patch, &ce, &st);3891if(status)3892return status;3893 old_name = patch->old_name;38943895/*3896 * A type-change diff is always split into a patch to delete3897 * old, immediately followed by a patch to create new (see3898 * diff.c::run_diff()); in such a case it is Ok that the entry3899 * to be deleted by the previous patch is still in the working3900 * tree and in the index.3901 *3902 * A patch to swap-rename between A and B would first rename A3903 * to B and then rename B to A. While applying the first one,3904 * the presence of B should not stop A from getting renamed to3905 * B; ask to_be_deleted() about the later rename. Removal of3906 * B and rename from A to B is handled the same way by asking3907 * was_deleted().3908 */3909if((tpatch =in_fn_table(state, new_name)) &&3910(was_deleted(tpatch) ||to_be_deleted(tpatch)))3911 ok_if_exists =1;3912else3913 ok_if_exists =0;39143915if(new_name &&3916((0< patch->is_new) || patch->is_rename || patch->is_copy)) {3917int err =check_to_create(state, new_name, ok_if_exists);39183919if(err && state->threeway) {3920 patch->direct_to_threeway =1;3921}else switch(err) {3922case0:3923break;/* happy */3924case EXISTS_IN_INDEX:3925returnerror(_("%s: already exists in index"), new_name);3926break;3927case EXISTS_IN_WORKTREE:3928returnerror(_("%s: already exists in working directory"),3929 new_name);3930default:3931return err;3932}39333934if(!patch->new_mode) {3935if(0< patch->is_new)3936 patch->new_mode = S_IFREG |0644;3937else3938 patch->new_mode = patch->old_mode;3939}3940}39413942if(new_name && old_name) {3943int same = !strcmp(old_name, new_name);3944if(!patch->new_mode)3945 patch->new_mode = patch->old_mode;3946if((patch->old_mode ^ patch->new_mode) & S_IFMT) {3947if(same)3948returnerror(_("new mode (%o) of%sdoes not "3949"match old mode (%o)"),3950 patch->new_mode, new_name,3951 patch->old_mode);3952else3953returnerror(_("new mode (%o) of%sdoes not "3954"match old mode (%o) of%s"),3955 patch->new_mode, new_name,3956 patch->old_mode, old_name);3957}3958}39593960if(!state->unsafe_paths &&check_unsafe_path(patch))3961return-128;39623963/*3964 * An attempt to read from or delete a path that is beyond a3965 * symbolic link will be prevented by load_patch_target() that3966 * is called at the beginning of apply_data() so we do not3967 * have to worry about a patch marked with "is_delete" bit3968 * here. We however need to make sure that the patch result3969 * is not deposited to a path that is beyond a symbolic link3970 * here.3971 */3972if(!patch->is_delete &&path_is_beyond_symlink(state, patch->new_name))3973returnerror(_("affected file '%s' is beyond a symbolic link"),3974 patch->new_name);39753976if(apply_data(state, patch, &st, ce) <0)3977returnerror(_("%s: patch does not apply"), name);3978 patch->rejected =0;3979return0;3980}39813982static intcheck_patch_list(struct apply_state *state,struct patch *patch)3983{3984int err =0;39853986prepare_symlink_changes(state, patch);3987prepare_fn_table(state, patch);3988while(patch) {3989int res;3990if(state->apply_verbosity > verbosity_normal)3991say_patch_name(stderr,3992_("Checking patch%s..."), patch);3993 res =check_patch(state, patch);3994if(res == -128)3995return-128;3996 err |= res;3997 patch = patch->next;3998}3999return err;4000}40014002static intread_apply_cache(struct apply_state *state)4003{4004if(state->index_file)4005returnread_cache_from(state->index_file);4006else4007returnread_cache();4008}40094010/* This function tries to read the object name from the current index */4011static intget_current_oid(struct apply_state *state,const char*path,4012struct object_id *oid)4013{4014int pos;40154016if(read_apply_cache(state) <0)4017return-1;4018 pos =cache_name_pos(path,strlen(path));4019if(pos <0)4020return-1;4021oidcpy(oid, &active_cache[pos]->oid);4022return0;4023}40244025static intpreimage_oid_in_gitlink_patch(struct patch *p,struct object_id *oid)4026{4027/*4028 * A usable gitlink patch has only one fragment (hunk) that looks like:4029 * @@ -1 +1 @@4030 * -Subproject commit <old sha1>4031 * +Subproject commit <new sha1>4032 * or4033 * @@ -1 +0,0 @@4034 * -Subproject commit <old sha1>4035 * for a removal patch.4036 */4037struct fragment *hunk = p->fragments;4038static const char heading[] ="-Subproject commit ";4039char*preimage;40404041if(/* does the patch have only one hunk? */4042 hunk && !hunk->next &&4043/* is its preimage one line? */4044 hunk->oldpos ==1&& hunk->oldlines ==1&&4045/* does preimage begin with the heading? */4046(preimage =memchr(hunk->patch,'\n', hunk->size)) != NULL &&4047starts_with(++preimage, heading) &&4048/* does it record full SHA-1? */4049!get_oid_hex(preimage +sizeof(heading) -1, oid) &&4050 preimage[sizeof(heading) + GIT_SHA1_HEXSZ -1] =='\n'&&4051/* does the abbreviated name on the index line agree with it? */4052starts_with(preimage +sizeof(heading) -1, p->old_sha1_prefix))4053return0;/* it all looks fine */40544055/* we may have full object name on the index line */4056returnget_oid_hex(p->old_sha1_prefix, oid);4057}40584059/* Build an index that contains the just the files needed for a 3way merge */4060static intbuild_fake_ancestor(struct apply_state *state,struct patch *list)4061{4062struct patch *patch;4063struct index_state result = { NULL };4064struct lock_file lock = LOCK_INIT;4065int res;40664067/* Once we start supporting the reverse patch, it may be4068 * worth showing the new sha1 prefix, but until then...4069 */4070for(patch = list; patch; patch = patch->next) {4071struct object_id oid;4072struct cache_entry *ce;4073const char*name;40744075 name = patch->old_name ? patch->old_name : patch->new_name;4076if(0< patch->is_new)4077continue;40784079if(S_ISGITLINK(patch->old_mode)) {4080if(!preimage_oid_in_gitlink_patch(patch, &oid))4081;/* ok, the textual part looks sane */4082else4083returnerror(_("sha1 information is lacking or "4084"useless for submodule%s"), name);4085}else if(!get_oid_blob(patch->old_sha1_prefix, &oid)) {4086;/* ok */4087}else if(!patch->lines_added && !patch->lines_deleted) {4088/* mode-only change: update the current */4089if(get_current_oid(state, patch->old_name, &oid))4090returnerror(_("mode change for%s, which is not "4091"in current HEAD"), name);4092}else4093returnerror(_("sha1 information is lacking or useless "4094"(%s)."), name);40954096 ce =make_cache_entry(patch->old_mode, oid.hash, name,0,0);4097if(!ce)4098returnerror(_("make_cache_entry failed for path '%s'"),4099 name);4100if(add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD)) {4101free(ce);4102returnerror(_("could not add%sto temporary index"),4103 name);4104}4105}41064107hold_lock_file_for_update(&lock, state->fake_ancestor, LOCK_DIE_ON_ERROR);4108 res =write_locked_index(&result, &lock, COMMIT_LOCK);4109discard_index(&result);41104111if(res)4112returnerror(_("could not write temporary index to%s"),4113 state->fake_ancestor);41144115return0;4116}41174118static voidstat_patch_list(struct apply_state *state,struct patch *patch)4119{4120int files, adds, dels;41214122for(files = adds = dels =0; patch ; patch = patch->next) {4123 files++;4124 adds += patch->lines_added;4125 dels += patch->lines_deleted;4126show_stats(state, patch);4127}41284129print_stat_summary(stdout, files, adds, dels);4130}41314132static voidnumstat_patch_list(struct apply_state *state,4133struct patch *patch)4134{4135for( ; patch; patch = patch->next) {4136const char*name;4137 name = patch->new_name ? patch->new_name : patch->old_name;4138if(patch->is_binary)4139printf("-\t-\t");4140else4141printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);4142write_name_quoted(name, stdout, state->line_termination);4143}4144}41454146static voidshow_file_mode_name(const char*newdelete,unsigned int mode,const char*name)4147{4148if(mode)4149printf("%smode%06o%s\n", newdelete, mode, name);4150else4151printf("%s %s\n", newdelete, name);4152}41534154static voidshow_mode_change(struct patch *p,int show_name)4155{4156if(p->old_mode && p->new_mode && p->old_mode != p->new_mode) {4157if(show_name)4158printf(" mode change%06o =>%06o%s\n",4159 p->old_mode, p->new_mode, p->new_name);4160else4161printf(" mode change%06o =>%06o\n",4162 p->old_mode, p->new_mode);4163}4164}41654166static voidshow_rename_copy(struct patch *p)4167{4168const char*renamecopy = p->is_rename ?"rename":"copy";4169const char*old_name, *new_name;41704171/* Find common prefix */4172 old_name = p->old_name;4173 new_name = p->new_name;4174while(1) {4175const char*slash_old, *slash_new;4176 slash_old =strchr(old_name,'/');4177 slash_new =strchr(new_name,'/');4178if(!slash_old ||4179!slash_new ||4180 slash_old - old_name != slash_new - new_name ||4181memcmp(old_name, new_name, slash_new - new_name))4182break;4183 old_name = slash_old +1;4184 new_name = slash_new +1;4185}4186/* p->old_name thru old_name is the common prefix, and old_name and new_name4187 * through the end of names are renames4188 */4189if(old_name != p->old_name)4190printf("%s%.*s{%s=>%s} (%d%%)\n", renamecopy,4191(int)(old_name - p->old_name), p->old_name,4192 old_name, new_name, p->score);4193else4194printf("%s %s=>%s(%d%%)\n", renamecopy,4195 p->old_name, p->new_name, p->score);4196show_mode_change(p,0);4197}41984199static voidsummary_patch_list(struct patch *patch)4200{4201struct patch *p;42024203for(p = patch; p; p = p->next) {4204if(p->is_new)4205show_file_mode_name("create", p->new_mode, p->new_name);4206else if(p->is_delete)4207show_file_mode_name("delete", p->old_mode, p->old_name);4208else{4209if(p->is_rename || p->is_copy)4210show_rename_copy(p);4211else{4212if(p->score) {4213printf(" rewrite%s(%d%%)\n",4214 p->new_name, p->score);4215show_mode_change(p,0);4216}4217else4218show_mode_change(p,1);4219}4220}4221}4222}42234224static voidpatch_stats(struct apply_state *state,struct patch *patch)4225{4226int lines = patch->lines_added + patch->lines_deleted;42274228if(lines > state->max_change)4229 state->max_change = lines;4230if(patch->old_name) {4231int len =quote_c_style(patch->old_name, NULL, NULL,0);4232if(!len)4233 len =strlen(patch->old_name);4234if(len > state->max_len)4235 state->max_len = len;4236}4237if(patch->new_name) {4238int len =quote_c_style(patch->new_name, NULL, NULL,0);4239if(!len)4240 len =strlen(patch->new_name);4241if(len > state->max_len)4242 state->max_len = len;4243}4244}42454246static intremove_file(struct apply_state *state,struct patch *patch,int rmdir_empty)4247{4248if(state->update_index && !state->ita_only) {4249if(remove_file_from_cache(patch->old_name) <0)4250returnerror(_("unable to remove%sfrom index"), patch->old_name);4251}4252if(!state->cached) {4253if(!remove_or_warn(patch->old_mode, patch->old_name) && rmdir_empty) {4254remove_path(patch->old_name);4255}4256}4257return0;4258}42594260static intadd_index_file(struct apply_state *state,4261const char*path,4262unsigned mode,4263void*buf,4264unsigned long size)4265{4266struct stat st;4267struct cache_entry *ce;4268int namelen =strlen(path);4269unsigned ce_size =cache_entry_size(namelen);42704271 ce =xcalloc(1, ce_size);4272memcpy(ce->name, path, namelen);4273 ce->ce_mode =create_ce_mode(mode);4274 ce->ce_flags =create_ce_flags(0);4275 ce->ce_namelen = namelen;4276if(state->ita_only) {4277 ce->ce_flags |= CE_INTENT_TO_ADD;4278set_object_name_for_intent_to_add_entry(ce);4279}else if(S_ISGITLINK(mode)) {4280const char*s;42814282if(!skip_prefix(buf,"Subproject commit ", &s) ||4283get_oid_hex(s, &ce->oid)) {4284free(ce);4285returnerror(_("corrupt patch for submodule%s"), path);4286}4287}else{4288if(!state->cached) {4289if(lstat(path, &st) <0) {4290free(ce);4291returnerror_errno(_("unable to stat newly "4292"created file '%s'"),4293 path);4294}4295fill_stat_cache_info(ce, &st);4296}4297if(write_object_file(buf, size, blob_type, &ce->oid) <0) {4298free(ce);4299returnerror(_("unable to create backing store "4300"for newly created file%s"), path);4301}4302}4303if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4304free(ce);4305returnerror(_("unable to add cache entry for%s"), path);4306}43074308return0;4309}43104311/*4312 * Returns:4313 * -1 if an unrecoverable error happened4314 * 0 if everything went well4315 * 1 if a recoverable error happened4316 */4317static inttry_create_file(const char*path,unsigned int mode,const char*buf,unsigned long size)4318{4319int fd, res;4320struct strbuf nbuf = STRBUF_INIT;43214322if(S_ISGITLINK(mode)) {4323struct stat st;4324if(!lstat(path, &st) &&S_ISDIR(st.st_mode))4325return0;4326return!!mkdir(path,0777);4327}43284329if(has_symlinks &&S_ISLNK(mode))4330/* Although buf:size is counted string, it also is NUL4331 * terminated.4332 */4333return!!symlink(buf, path);43344335 fd =open(path, O_CREAT | O_EXCL | O_WRONLY, (mode &0100) ?0777:0666);4336if(fd <0)4337return1;43384339if(convert_to_working_tree(path, buf, size, &nbuf)) {4340 size = nbuf.len;4341 buf = nbuf.buf;4342}43434344 res =write_in_full(fd, buf, size) <0;4345if(res)4346error_errno(_("failed to write to '%s'"), path);4347strbuf_release(&nbuf);43484349if(close(fd) <0&& !res)4350returnerror_errno(_("closing file '%s'"), path);43514352return res ? -1:0;4353}43544355/*4356 * We optimistically assume that the directories exist,4357 * which is true 99% of the time anyway. If they don't,4358 * we create them and try again.4359 *4360 * Returns:4361 * -1 on error4362 * 0 otherwise4363 */4364static intcreate_one_file(struct apply_state *state,4365char*path,4366unsigned mode,4367const char*buf,4368unsigned long size)4369{4370int res;43714372if(state->cached)4373return0;43744375 res =try_create_file(path, mode, buf, size);4376if(res <0)4377return-1;4378if(!res)4379return0;43804381if(errno == ENOENT) {4382if(safe_create_leading_directories(path))4383return0;4384 res =try_create_file(path, mode, buf, size);4385if(res <0)4386return-1;4387if(!res)4388return0;4389}43904391if(errno == EEXIST || errno == EACCES) {4392/* We may be trying to create a file where a directory4393 * used to be.4394 */4395struct stat st;4396if(!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))4397 errno = EEXIST;4398}43994400if(errno == EEXIST) {4401unsigned int nr =getpid();44024403for(;;) {4404char newpath[PATH_MAX];4405mksnpath(newpath,sizeof(newpath),"%s~%u", path, nr);4406 res =try_create_file(newpath, mode, buf, size);4407if(res <0)4408return-1;4409if(!res) {4410if(!rename(newpath, path))4411return0;4412unlink_or_warn(newpath);4413break;4414}4415if(errno != EEXIST)4416break;4417++nr;4418}4419}4420returnerror_errno(_("unable to write file '%s' mode%o"),4421 path, mode);4422}44234424static intadd_conflicted_stages_file(struct apply_state *state,4425struct patch *patch)4426{4427int stage, namelen;4428unsigned ce_size, mode;4429struct cache_entry *ce;44304431if(!state->update_index)4432return0;4433 namelen =strlen(patch->new_name);4434 ce_size =cache_entry_size(namelen);4435 mode = patch->new_mode ? patch->new_mode : (S_IFREG |0644);44364437remove_file_from_cache(patch->new_name);4438for(stage =1; stage <4; stage++) {4439if(is_null_oid(&patch->threeway_stage[stage -1]))4440continue;4441 ce =xcalloc(1, ce_size);4442memcpy(ce->name, patch->new_name, namelen);4443 ce->ce_mode =create_ce_mode(mode);4444 ce->ce_flags =create_ce_flags(stage);4445 ce->ce_namelen = namelen;4446oidcpy(&ce->oid, &patch->threeway_stage[stage -1]);4447if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0) {4448free(ce);4449returnerror(_("unable to add cache entry for%s"),4450 patch->new_name);4451}4452}44534454return0;4455}44564457static intcreate_file(struct apply_state *state,struct patch *patch)4458{4459char*path = patch->new_name;4460unsigned mode = patch->new_mode;4461unsigned long size = patch->resultsize;4462char*buf = patch->result;44634464if(!mode)4465 mode = S_IFREG |0644;4466if(create_one_file(state, path, mode, buf, size))4467return-1;44684469if(patch->conflicted_threeway)4470returnadd_conflicted_stages_file(state, patch);4471else if(state->update_index)4472returnadd_index_file(state, path, mode, buf, size);4473return0;4474}44754476/* phase zero is to remove, phase one is to create */4477static intwrite_out_one_result(struct apply_state *state,4478struct patch *patch,4479int phase)4480{4481if(patch->is_delete >0) {4482if(phase ==0)4483returnremove_file(state, patch,1);4484return0;4485}4486if(patch->is_new >0|| patch->is_copy) {4487if(phase ==1)4488returncreate_file(state, patch);4489return0;4490}4491/*4492 * Rename or modification boils down to the same4493 * thing: remove the old, write the new4494 */4495if(phase ==0)4496returnremove_file(state, patch, patch->is_rename);4497if(phase ==1)4498returncreate_file(state, patch);4499return0;4500}45014502static intwrite_out_one_reject(struct apply_state *state,struct patch *patch)4503{4504FILE*rej;4505char namebuf[PATH_MAX];4506struct fragment *frag;4507int cnt =0;4508struct strbuf sb = STRBUF_INIT;45094510for(cnt =0, frag = patch->fragments; frag; frag = frag->next) {4511if(!frag->rejected)4512continue;4513 cnt++;4514}45154516if(!cnt) {4517if(state->apply_verbosity > verbosity_normal)4518say_patch_name(stderr,4519_("Applied patch%scleanly."), patch);4520return0;4521}45224523/* This should not happen, because a removal patch that leaves4524 * contents are marked "rejected" at the patch level.4525 */4526if(!patch->new_name)4527die(_("internal error"));45284529/* Say this even without --verbose */4530strbuf_addf(&sb,Q_("Applying patch %%swith%dreject...",4531"Applying patch %%swith%drejects...",4532 cnt),4533 cnt);4534if(state->apply_verbosity > verbosity_silent)4535say_patch_name(stderr, sb.buf, patch);4536strbuf_release(&sb);45374538 cnt =strlen(patch->new_name);4539if(ARRAY_SIZE(namebuf) <= cnt +5) {4540 cnt =ARRAY_SIZE(namebuf) -5;4541warning(_("truncating .rej filename to %.*s.rej"),4542 cnt -1, patch->new_name);4543}4544memcpy(namebuf, patch->new_name, cnt);4545memcpy(namebuf + cnt,".rej",5);45464547 rej =fopen(namebuf,"w");4548if(!rej)4549returnerror_errno(_("cannot open%s"), namebuf);45504551/* Normal git tools never deal with .rej, so do not pretend4552 * this is a git patch by saying --git or giving extended4553 * headers. While at it, maybe please "kompare" that wants4554 * the trailing TAB and some garbage at the end of line ;-).4555 */4556fprintf(rej,"diff a/%sb/%s\t(rejected hunks)\n",4557 patch->new_name, patch->new_name);4558for(cnt =1, frag = patch->fragments;4559 frag;4560 cnt++, frag = frag->next) {4561if(!frag->rejected) {4562if(state->apply_verbosity > verbosity_silent)4563fprintf_ln(stderr,_("Hunk #%dapplied cleanly."), cnt);4564continue;4565}4566if(state->apply_verbosity > verbosity_silent)4567fprintf_ln(stderr,_("Rejected hunk #%d."), cnt);4568fprintf(rej,"%.*s", frag->size, frag->patch);4569if(frag->patch[frag->size-1] !='\n')4570fputc('\n', rej);4571}4572fclose(rej);4573return-1;4574}45754576/*4577 * Returns:4578 * -1 if an error happened4579 * 0 if the patch applied cleanly4580 * 1 if the patch did not apply cleanly4581 */4582static intwrite_out_results(struct apply_state *state,struct patch *list)4583{4584int phase;4585int errs =0;4586struct patch *l;4587struct string_list cpath = STRING_LIST_INIT_DUP;45884589for(phase =0; phase <2; phase++) {4590 l = list;4591while(l) {4592if(l->rejected)4593 errs =1;4594else{4595if(write_out_one_result(state, l, phase)) {4596string_list_clear(&cpath,0);4597return-1;4598}4599if(phase ==1) {4600if(write_out_one_reject(state, l))4601 errs =1;4602if(l->conflicted_threeway) {4603string_list_append(&cpath, l->new_name);4604 errs =1;4605}4606}4607}4608 l = l->next;4609}4610}46114612if(cpath.nr) {4613struct string_list_item *item;46144615string_list_sort(&cpath);4616if(state->apply_verbosity > verbosity_silent) {4617for_each_string_list_item(item, &cpath)4618fprintf(stderr,"U%s\n", item->string);4619}4620string_list_clear(&cpath,0);46214622rerere(0);4623}46244625return errs;4626}46274628/*4629 * Try to apply a patch.4630 *4631 * Returns:4632 * -128 if a bad error happened (like patch unreadable)4633 * -1 if patch did not apply and user cannot deal with it4634 * 0 if the patch applied4635 * 1 if the patch did not apply but user might fix it4636 */4637static intapply_patch(struct apply_state *state,4638int fd,4639const char*filename,4640int options)4641{4642size_t offset;4643struct strbuf buf = STRBUF_INIT;/* owns the patch text */4644struct patch *list = NULL, **listp = &list;4645int skipped_patch =0;4646int res =0;46474648 state->patch_input_file = filename;4649if(read_patch_file(&buf, fd) <0)4650return-128;4651 offset =0;4652while(offset < buf.len) {4653struct patch *patch;4654int nr;46554656 patch =xcalloc(1,sizeof(*patch));4657 patch->inaccurate_eof = !!(options & APPLY_OPT_INACCURATE_EOF);4658 patch->recount = !!(options & APPLY_OPT_RECOUNT);4659 nr =parse_chunk(state, buf.buf + offset, buf.len - offset, patch);4660if(nr <0) {4661free_patch(patch);4662if(nr == -128) {4663 res = -128;4664goto end;4665}4666break;4667}4668if(state->apply_in_reverse)4669reverse_patches(patch);4670if(use_patch(state, patch)) {4671patch_stats(state, patch);4672*listp = patch;4673 listp = &patch->next;4674}4675else{4676if(state->apply_verbosity > verbosity_normal)4677say_patch_name(stderr,_("Skipped patch '%s'."), patch);4678free_patch(patch);4679 skipped_patch++;4680}4681 offset += nr;4682}46834684if(!list && !skipped_patch) {4685error(_("unrecognized input"));4686 res = -128;4687goto end;4688}46894690if(state->whitespace_error && (state->ws_error_action == die_on_ws_error))4691 state->apply =0;46924693 state->update_index = (state->check_index || state->ita_only) && state->apply;4694if(state->update_index && !is_lock_file_locked(&state->lock_file)) {4695if(state->index_file)4696hold_lock_file_for_update(&state->lock_file,4697 state->index_file,4698 LOCK_DIE_ON_ERROR);4699else4700hold_locked_index(&state->lock_file, LOCK_DIE_ON_ERROR);4701}47024703if(state->check_index &&read_apply_cache(state) <0) {4704error(_("unable to read index file"));4705 res = -128;4706goto end;4707}47084709if(state->check || state->apply) {4710int r =check_patch_list(state, list);4711if(r == -128) {4712 res = -128;4713goto end;4714}4715if(r <0&& !state->apply_with_reject) {4716 res = -1;4717goto end;4718}4719}47204721if(state->apply) {4722int write_res =write_out_results(state, list);4723if(write_res <0) {4724 res = -128;4725goto end;4726}4727if(write_res >0) {4728/* with --3way, we still need to write the index out */4729 res = state->apply_with_reject ? -1:1;4730goto end;4731}4732}47334734if(state->fake_ancestor &&4735build_fake_ancestor(state, list)) {4736 res = -128;4737goto end;4738}47394740if(state->diffstat && state->apply_verbosity > verbosity_silent)4741stat_patch_list(state, list);47424743if(state->numstat && state->apply_verbosity > verbosity_silent)4744numstat_patch_list(state, list);47454746if(state->summary && state->apply_verbosity > verbosity_silent)4747summary_patch_list(list);47484749end:4750free_patch_list(list);4751strbuf_release(&buf);4752string_list_clear(&state->fn_table,0);4753return res;4754}47554756static intapply_option_parse_exclude(const struct option *opt,4757const char*arg,int unset)4758{4759struct apply_state *state = opt->value;4760add_name_limit(state, arg,1);4761return0;4762}47634764static intapply_option_parse_include(const struct option *opt,4765const char*arg,int unset)4766{4767struct apply_state *state = opt->value;4768add_name_limit(state, arg,0);4769 state->has_include =1;4770return0;4771}47724773static intapply_option_parse_p(const struct option *opt,4774const char*arg,4775int unset)4776{4777struct apply_state *state = opt->value;4778 state->p_value =atoi(arg);4779 state->p_value_known =1;4780return0;4781}47824783static intapply_option_parse_space_change(const struct option *opt,4784const char*arg,int unset)4785{4786struct apply_state *state = opt->value;4787if(unset)4788 state->ws_ignore_action = ignore_ws_none;4789else4790 state->ws_ignore_action = ignore_ws_change;4791return0;4792}47934794static intapply_option_parse_whitespace(const struct option *opt,4795const char*arg,int unset)4796{4797struct apply_state *state = opt->value;4798 state->whitespace_option = arg;4799if(parse_whitespace_option(state, arg))4800exit(1);4801return0;4802}48034804static intapply_option_parse_directory(const struct option *opt,4805const char*arg,int unset)4806{4807struct apply_state *state = opt->value;4808strbuf_reset(&state->root);4809strbuf_addstr(&state->root, arg);4810strbuf_complete(&state->root,'/');4811return0;4812}48134814intapply_all_patches(struct apply_state *state,4815int argc,4816const char**argv,4817int options)4818{4819int i;4820int res;4821int errs =0;4822int read_stdin =1;48234824for(i =0; i < argc; i++) {4825const char*arg = argv[i];4826char*to_free = NULL;4827int fd;48284829if(!strcmp(arg,"-")) {4830 res =apply_patch(state,0,"<stdin>", options);4831if(res <0)4832goto end;4833 errs |= res;4834 read_stdin =0;4835continue;4836}else4837 arg = to_free =prefix_filename(state->prefix, arg);48384839 fd =open(arg, O_RDONLY);4840if(fd <0) {4841error(_("can't open patch '%s':%s"), arg,strerror(errno));4842 res = -128;4843free(to_free);4844goto end;4845}4846 read_stdin =0;4847set_default_whitespace_mode(state);4848 res =apply_patch(state, fd, arg, options);4849close(fd);4850free(to_free);4851if(res <0)4852goto end;4853 errs |= res;4854}4855set_default_whitespace_mode(state);4856if(read_stdin) {4857 res =apply_patch(state,0,"<stdin>", options);4858if(res <0)4859goto end;4860 errs |= res;4861}48624863if(state->whitespace_error) {4864if(state->squelch_whitespace_errors &&4865 state->squelch_whitespace_errors < state->whitespace_error) {4866int squelched =4867 state->whitespace_error - state->squelch_whitespace_errors;4868warning(Q_("squelched%dwhitespace error",4869"squelched%dwhitespace errors",4870 squelched),4871 squelched);4872}4873if(state->ws_error_action == die_on_ws_error) {4874error(Q_("%dline adds whitespace errors.",4875"%dlines add whitespace errors.",4876 state->whitespace_error),4877 state->whitespace_error);4878 res = -128;4879goto end;4880}4881if(state->applied_after_fixing_ws && state->apply)4882warning(Q_("%dline applied after"4883" fixing whitespace errors.",4884"%dlines applied after"4885" fixing whitespace errors.",4886 state->applied_after_fixing_ws),4887 state->applied_after_fixing_ws);4888else if(state->whitespace_error)4889warning(Q_("%dline adds whitespace errors.",4890"%dlines add whitespace errors.",4891 state->whitespace_error),4892 state->whitespace_error);4893}48944895if(state->update_index) {4896 res =write_locked_index(&the_index, &state->lock_file, COMMIT_LOCK);4897if(res) {4898error(_("Unable to write new index file"));4899 res = -128;4900goto end;4901}4902}49034904 res = !!errs;49054906end:4907rollback_lock_file(&state->lock_file);49084909if(state->apply_verbosity <= verbosity_silent) {4910set_error_routine(state->saved_error_routine);4911set_warn_routine(state->saved_warn_routine);4912}49134914if(res > -1)4915return res;4916return(res == -1?1:128);4917}49184919intapply_parse_options(int argc,const char**argv,4920struct apply_state *state,4921int*force_apply,int*options,4922const char*const*apply_usage)4923{4924struct option builtin_apply_options[] = {4925{ OPTION_CALLBACK,0,"exclude", state,N_("path"),4926N_("don't apply changes matching the given path"),49270, apply_option_parse_exclude },4928{ OPTION_CALLBACK,0,"include", state,N_("path"),4929N_("apply changes matching the given path"),49300, apply_option_parse_include },4931{ OPTION_CALLBACK,'p', NULL, state,N_("num"),4932N_("remove <num> leading slashes from traditional diff paths"),49330, apply_option_parse_p },4934OPT_BOOL(0,"no-add", &state->no_add,4935N_("ignore additions made by the patch")),4936OPT_BOOL(0,"stat", &state->diffstat,4937N_("instead of applying the patch, output diffstat for the input")),4938OPT_NOOP_NOARG(0,"allow-binary-replacement"),4939OPT_NOOP_NOARG(0,"binary"),4940OPT_BOOL(0,"numstat", &state->numstat,4941N_("show number of added and deleted lines in decimal notation")),4942OPT_BOOL(0,"summary", &state->summary,4943N_("instead of applying the patch, output a summary for the input")),4944OPT_BOOL(0,"check", &state->check,4945N_("instead of applying the patch, see if the patch is applicable")),4946OPT_BOOL(0,"index", &state->check_index,4947N_("make sure the patch is applicable to the current index")),4948OPT_BOOL('N',"intent-to-add", &state->ita_only,4949N_("mark new files with `git add --intent-to-add`")),4950OPT_BOOL(0,"cached", &state->cached,4951N_("apply a patch without touching the working tree")),4952OPT_BOOL_F(0,"unsafe-paths", &state->unsafe_paths,4953N_("accept a patch that touches outside the working area"),4954 PARSE_OPT_NOCOMPLETE),4955OPT_BOOL(0,"apply", force_apply,4956N_("also apply the patch (use with --stat/--summary/--check)")),4957OPT_BOOL('3',"3way", &state->threeway,4958N_("attempt three-way merge if a patch does not apply")),4959OPT_FILENAME(0,"build-fake-ancestor", &state->fake_ancestor,4960N_("build a temporary index based on embedded index information")),4961/* Think twice before adding "--nul" synonym to this */4962OPT_SET_INT('z', NULL, &state->line_termination,4963N_("paths are separated with NUL character"),'\0'),4964OPT_INTEGER('C', NULL, &state->p_context,4965N_("ensure at least <n> lines of context match")),4966{ OPTION_CALLBACK,0,"whitespace", state,N_("action"),4967N_("detect new or modified lines that have whitespace errors"),49680, apply_option_parse_whitespace },4969{ OPTION_CALLBACK,0,"ignore-space-change", state, NULL,4970N_("ignore changes in whitespace when finding context"),4971 PARSE_OPT_NOARG, apply_option_parse_space_change },4972{ OPTION_CALLBACK,0,"ignore-whitespace", state, NULL,4973N_("ignore changes in whitespace when finding context"),4974 PARSE_OPT_NOARG, apply_option_parse_space_change },4975OPT_BOOL('R',"reverse", &state->apply_in_reverse,4976N_("apply the patch in reverse")),4977OPT_BOOL(0,"unidiff-zero", &state->unidiff_zero,4978N_("don't expect at least one line of context")),4979OPT_BOOL(0,"reject", &state->apply_with_reject,4980N_("leave the rejected hunks in corresponding *.rej files")),4981OPT_BOOL(0,"allow-overlap", &state->allow_overlap,4982N_("allow overlapping hunks")),4983OPT__VERBOSE(&state->apply_verbosity,N_("be verbose")),4984OPT_BIT(0,"inaccurate-eof", options,4985N_("tolerate incorrectly detected missing new-line at the end of file"),4986 APPLY_OPT_INACCURATE_EOF),4987OPT_BIT(0,"recount", options,4988N_("do not trust the line counts in the hunk headers"),4989 APPLY_OPT_RECOUNT),4990{ OPTION_CALLBACK,0,"directory", state,N_("root"),4991N_("prepend <root> to all filenames"),49920, apply_option_parse_directory },4993OPT_END()4994};49954996returnparse_options(argc, argv, state->prefix, builtin_apply_options, apply_usage,0);4997}