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#include"cache.h" 10#include"cache-tree.h" 11#include"quote.h" 12#include"blob.h" 13#include"delta.h" 14#include"builtin.h" 15#include"string-list.h" 16#include"dir.h" 17 18/* 19 * --check turns on checking that the working tree matches the 20 * files that are being modified, but doesn't apply the patch 21 * --stat does just a diffstat, and doesn't actually apply 22 * --numstat does numeric diffstat, and doesn't actually apply 23 * --index-info shows the old and new index info for paths if available. 24 * --index updates the cache as well. 25 * --cached updates only the cache without ever touching the working tree. 26 */ 27static const char*prefix; 28static int prefix_length = -1; 29static int newfd = -1; 30 31static int unidiff_zero; 32static int p_value =1; 33static int p_value_known; 34static int check_index; 35static int update_index; 36static int cached; 37static int diffstat; 38static int numstat; 39static int summary; 40static int check; 41static int apply =1; 42static int apply_in_reverse; 43static int apply_with_reject; 44static int apply_verbosely; 45static int no_add; 46static const char*fake_ancestor; 47static int line_termination ='\n'; 48static unsigned long p_context = ULONG_MAX; 49static const char apply_usage[] = 50"git apply [--stat] [--numstat] [--summary] [--check] [--index] [--cached] [--apply] [--no-add] [--index-info] [--allow-binary-replacement] [--reverse] [--reject] [--verbose] [-z] [-pNUM] [-CNUM] [--whitespace=<nowarn|warn|fix|error|error-all>] <patch>..."; 51 52static enum ws_error_action { 53 nowarn_ws_error, 54 warn_on_ws_error, 55 die_on_ws_error, 56 correct_ws_error, 57} ws_error_action = warn_on_ws_error; 58static int whitespace_error; 59static int squelch_whitespace_errors =5; 60static int applied_after_fixing_ws; 61static const char*patch_input_file; 62static const char*root; 63static int root_len; 64 65static voidparse_whitespace_option(const char*option) 66{ 67if(!option) { 68 ws_error_action = warn_on_ws_error; 69return; 70} 71if(!strcmp(option,"warn")) { 72 ws_error_action = warn_on_ws_error; 73return; 74} 75if(!strcmp(option,"nowarn")) { 76 ws_error_action = nowarn_ws_error; 77return; 78} 79if(!strcmp(option,"error")) { 80 ws_error_action = die_on_ws_error; 81return; 82} 83if(!strcmp(option,"error-all")) { 84 ws_error_action = die_on_ws_error; 85 squelch_whitespace_errors =0; 86return; 87} 88if(!strcmp(option,"strip") || !strcmp(option,"fix")) { 89 ws_error_action = correct_ws_error; 90return; 91} 92die("unrecognized whitespace option '%s'", option); 93} 94 95static voidset_default_whitespace_mode(const char*whitespace_option) 96{ 97if(!whitespace_option && !apply_default_whitespace) 98 ws_error_action = (apply ? warn_on_ws_error : nowarn_ws_error); 99} 100 101/* 102 * For "diff-stat" like behaviour, we keep track of the biggest change 103 * we've seen, and the longest filename. That allows us to do simple 104 * scaling. 105 */ 106static int max_change, max_len; 107 108/* 109 * Various "current state", notably line numbers and what 110 * file (and how) we're patching right now.. The "is_xxxx" 111 * things are flags, where -1 means "don't know yet". 112 */ 113static int linenr =1; 114 115/* 116 * This represents one "hunk" from a patch, starting with 117 * "@@ -oldpos,oldlines +newpos,newlines @@" marker. The 118 * patch text is pointed at by patch, and its byte length 119 * is stored in size. leading and trailing are the number 120 * of context lines. 121 */ 122struct fragment { 123unsigned long leading, trailing; 124unsigned long oldpos, oldlines; 125unsigned long newpos, newlines; 126const char*patch; 127int size; 128int rejected; 129struct fragment *next; 130}; 131 132/* 133 * When dealing with a binary patch, we reuse "leading" field 134 * to store the type of the binary hunk, either deflated "delta" 135 * or deflated "literal". 136 */ 137#define binary_patch_method leading 138#define BINARY_DELTA_DEFLATED 1 139#define BINARY_LITERAL_DEFLATED 2 140 141/* 142 * This represents a "patch" to a file, both metainfo changes 143 * such as creation/deletion, filemode and content changes represented 144 * as a series of fragments. 145 */ 146struct patch { 147char*new_name, *old_name, *def_name; 148unsigned int old_mode, new_mode; 149int is_new, is_delete;/* -1 = unknown, 0 = false, 1 = true */ 150int rejected; 151unsigned ws_rule; 152unsigned long deflate_origlen; 153int lines_added, lines_deleted; 154int score; 155unsigned int is_toplevel_relative:1; 156unsigned int inaccurate_eof:1; 157unsigned int is_binary:1; 158unsigned int is_copy:1; 159unsigned int is_rename:1; 160unsigned int recount:1; 161struct fragment *fragments; 162char*result; 163size_t resultsize; 164char old_sha1_prefix[41]; 165char new_sha1_prefix[41]; 166struct patch *next; 167}; 168 169/* 170 * A line in a file, len-bytes long (includes the terminating LF, 171 * except for an incomplete line at the end if the file ends with 172 * one), and its contents hashes to 'hash'. 173 */ 174struct line { 175size_t len; 176unsigned hash :24; 177unsigned flag :8; 178#define LINE_COMMON 1 179}; 180 181/* 182 * This represents a "file", which is an array of "lines". 183 */ 184struct image { 185char*buf; 186size_t len; 187size_t nr; 188size_t alloc; 189struct line *line_allocated; 190struct line *line; 191}; 192 193/* 194 * Records filenames that have been touched, in order to handle 195 * the case where more than one patches touch the same file. 196 */ 197 198static struct string_list fn_table; 199 200static uint32_thash_line(const char*cp,size_t len) 201{ 202size_t i; 203uint32_t h; 204for(i =0, h =0; i < len; i++) { 205if(!isspace(cp[i])) { 206 h = h *3+ (cp[i] &0xff); 207} 208} 209return h; 210} 211 212static voidadd_line_info(struct image *img,const char*bol,size_t len,unsigned flag) 213{ 214ALLOC_GROW(img->line_allocated, img->nr +1, img->alloc); 215 img->line_allocated[img->nr].len = len; 216 img->line_allocated[img->nr].hash =hash_line(bol, len); 217 img->line_allocated[img->nr].flag = flag; 218 img->nr++; 219} 220 221static voidprepare_image(struct image *image,char*buf,size_t len, 222int prepare_linetable) 223{ 224const char*cp, *ep; 225 226memset(image,0,sizeof(*image)); 227 image->buf = buf; 228 image->len = len; 229 230if(!prepare_linetable) 231return; 232 233 ep = image->buf + image->len; 234 cp = image->buf; 235while(cp < ep) { 236const char*next; 237for(next = cp; next < ep && *next !='\n'; next++) 238; 239if(next < ep) 240 next++; 241add_line_info(image, cp, next - cp,0); 242 cp = next; 243} 244 image->line = image->line_allocated; 245} 246 247static voidclear_image(struct image *image) 248{ 249free(image->buf); 250 image->buf = NULL; 251 image->len =0; 252} 253 254static voidsay_patch_name(FILE*output,const char*pre, 255struct patch *patch,const char*post) 256{ 257fputs(pre, output); 258if(patch->old_name && patch->new_name && 259strcmp(patch->old_name, patch->new_name)) { 260quote_c_style(patch->old_name, NULL, output,0); 261fputs(" => ", output); 262quote_c_style(patch->new_name, NULL, output,0); 263}else{ 264const char*n = patch->new_name; 265if(!n) 266 n = patch->old_name; 267quote_c_style(n, NULL, output,0); 268} 269fputs(post, output); 270} 271 272#define CHUNKSIZE (8192) 273#define SLOP (16) 274 275static voidread_patch_file(struct strbuf *sb,int fd) 276{ 277if(strbuf_read(sb, fd,0) <0) 278die("git apply: read returned%s",strerror(errno)); 279 280/* 281 * Make sure that we have some slop in the buffer 282 * so that we can do speculative "memcmp" etc, and 283 * see to it that it is NUL-filled. 284 */ 285strbuf_grow(sb, SLOP); 286memset(sb->buf + sb->len,0, SLOP); 287} 288 289static unsigned longlinelen(const char*buffer,unsigned long size) 290{ 291unsigned long len =0; 292while(size--) { 293 len++; 294if(*buffer++ =='\n') 295break; 296} 297return len; 298} 299 300static intis_dev_null(const char*str) 301{ 302return!memcmp("/dev/null", str,9) &&isspace(str[9]); 303} 304 305#define TERM_SPACE 1 306#define TERM_TAB 2 307 308static intname_terminate(const char*name,int namelen,int c,int terminate) 309{ 310if(c ==' '&& !(terminate & TERM_SPACE)) 311return0; 312if(c =='\t'&& !(terminate & TERM_TAB)) 313return0; 314 315return1; 316} 317 318static char*find_name(const char*line,char*def,int p_value,int terminate) 319{ 320int len; 321const char*start = line; 322 323if(*line =='"') { 324struct strbuf name = STRBUF_INIT; 325 326/* 327 * Proposed "new-style" GNU patch/diff format; see 328 * http://marc.theaimsgroup.com/?l=git&m=112927316408690&w=2 329 */ 330if(!unquote_c_style(&name, line, NULL)) { 331char*cp; 332 333for(cp = name.buf; p_value; p_value--) { 334 cp =strchr(cp,'/'); 335if(!cp) 336break; 337 cp++; 338} 339if(cp) { 340/* name can later be freed, so we need 341 * to memmove, not just return cp 342 */ 343strbuf_remove(&name,0, cp - name.buf); 344free(def); 345if(root) 346strbuf_insert(&name,0, root, root_len); 347returnstrbuf_detach(&name, NULL); 348} 349} 350strbuf_release(&name); 351} 352 353for(;;) { 354char c = *line; 355 356if(isspace(c)) { 357if(c =='\n') 358break; 359if(name_terminate(start, line-start, c, terminate)) 360break; 361} 362 line++; 363if(c =='/'&& !--p_value) 364 start = line; 365} 366if(!start) 367return def; 368 len = line - start; 369if(!len) 370return def; 371 372/* 373 * Generally we prefer the shorter name, especially 374 * if the other one is just a variation of that with 375 * something else tacked on to the end (ie "file.orig" 376 * or "file~"). 377 */ 378if(def) { 379int deflen =strlen(def); 380if(deflen < len && !strncmp(start, def, deflen)) 381return def; 382free(def); 383} 384 385if(root) { 386char*ret =xmalloc(root_len + len +1); 387strcpy(ret, root); 388memcpy(ret + root_len, start, len); 389 ret[root_len + len] ='\0'; 390return ret; 391} 392 393returnxmemdupz(start, len); 394} 395 396static intcount_slashes(const char*cp) 397{ 398int cnt =0; 399char ch; 400 401while((ch = *cp++)) 402if(ch =='/') 403 cnt++; 404return cnt; 405} 406 407/* 408 * Given the string after "--- " or "+++ ", guess the appropriate 409 * p_value for the given patch. 410 */ 411static intguess_p_value(const char*nameline) 412{ 413char*name, *cp; 414int val = -1; 415 416if(is_dev_null(nameline)) 417return-1; 418 name =find_name(nameline, NULL,0, TERM_SPACE | TERM_TAB); 419if(!name) 420return-1; 421 cp =strchr(name,'/'); 422if(!cp) 423 val =0; 424else if(prefix) { 425/* 426 * Does it begin with "a/$our-prefix" and such? Then this is 427 * very likely to apply to our directory. 428 */ 429if(!strncmp(name, prefix, prefix_length)) 430 val =count_slashes(prefix); 431else{ 432 cp++; 433if(!strncmp(cp, prefix, prefix_length)) 434 val =count_slashes(prefix) +1; 435} 436} 437free(name); 438return val; 439} 440 441/* 442 * Get the name etc info from the ---/+++ lines of a traditional patch header 443 * 444 * FIXME! The end-of-filename heuristics are kind of screwy. For existing 445 * files, we can happily check the index for a match, but for creating a 446 * new file we should try to match whatever "patch" does. I have no idea. 447 */ 448static voidparse_traditional_patch(const char*first,const char*second,struct patch *patch) 449{ 450char*name; 451 452 first +=4;/* skip "--- " */ 453 second +=4;/* skip "+++ " */ 454if(!p_value_known) { 455int p, q; 456 p =guess_p_value(first); 457 q =guess_p_value(second); 458if(p <0) p = q; 459if(0<= p && p == q) { 460 p_value = p; 461 p_value_known =1; 462} 463} 464if(is_dev_null(first)) { 465 patch->is_new =1; 466 patch->is_delete =0; 467 name =find_name(second, NULL, p_value, TERM_SPACE | TERM_TAB); 468 patch->new_name = name; 469}else if(is_dev_null(second)) { 470 patch->is_new =0; 471 patch->is_delete =1; 472 name =find_name(first, NULL, p_value, TERM_SPACE | TERM_TAB); 473 patch->old_name = name; 474}else{ 475 name =find_name(first, NULL, p_value, TERM_SPACE | TERM_TAB); 476 name =find_name(second, name, p_value, TERM_SPACE | TERM_TAB); 477 patch->old_name = patch->new_name = name; 478} 479if(!name) 480die("unable to find filename in patch at line%d", linenr); 481} 482 483static intgitdiff_hdrend(const char*line,struct patch *patch) 484{ 485return-1; 486} 487 488/* 489 * We're anal about diff header consistency, to make 490 * sure that we don't end up having strange ambiguous 491 * patches floating around. 492 * 493 * As a result, gitdiff_{old|new}name() will check 494 * their names against any previous information, just 495 * to make sure.. 496 */ 497static char*gitdiff_verify_name(const char*line,int isnull,char*orig_name,const char*oldnew) 498{ 499if(!orig_name && !isnull) 500returnfind_name(line, NULL, p_value, TERM_TAB); 501 502if(orig_name) { 503int len; 504const char*name; 505char*another; 506 name = orig_name; 507 len =strlen(name); 508if(isnull) 509die("git apply: bad git-diff - expected /dev/null, got%son line%d", name, linenr); 510 another =find_name(line, NULL, p_value, TERM_TAB); 511if(!another ||memcmp(another, name, len)) 512die("git apply: bad git-diff - inconsistent%sfilename on line%d", oldnew, linenr); 513free(another); 514return orig_name; 515} 516else{ 517/* expect "/dev/null" */ 518if(memcmp("/dev/null", line,9) || line[9] !='\n') 519die("git apply: bad git-diff - expected /dev/null on line%d", linenr); 520return NULL; 521} 522} 523 524static intgitdiff_oldname(const char*line,struct patch *patch) 525{ 526 patch->old_name =gitdiff_verify_name(line, patch->is_new, patch->old_name,"old"); 527return0; 528} 529 530static intgitdiff_newname(const char*line,struct patch *patch) 531{ 532 patch->new_name =gitdiff_verify_name(line, patch->is_delete, patch->new_name,"new"); 533return0; 534} 535 536static intgitdiff_oldmode(const char*line,struct patch *patch) 537{ 538 patch->old_mode =strtoul(line, NULL,8); 539return0; 540} 541 542static intgitdiff_newmode(const char*line,struct patch *patch) 543{ 544 patch->new_mode =strtoul(line, NULL,8); 545return0; 546} 547 548static intgitdiff_delete(const char*line,struct patch *patch) 549{ 550 patch->is_delete =1; 551 patch->old_name = patch->def_name; 552returngitdiff_oldmode(line, patch); 553} 554 555static intgitdiff_newfile(const char*line,struct patch *patch) 556{ 557 patch->is_new =1; 558 patch->new_name = patch->def_name; 559returngitdiff_newmode(line, patch); 560} 561 562static intgitdiff_copysrc(const char*line,struct patch *patch) 563{ 564 patch->is_copy =1; 565 patch->old_name =find_name(line, NULL,0,0); 566return0; 567} 568 569static intgitdiff_copydst(const char*line,struct patch *patch) 570{ 571 patch->is_copy =1; 572 patch->new_name =find_name(line, NULL,0,0); 573return0; 574} 575 576static intgitdiff_renamesrc(const char*line,struct patch *patch) 577{ 578 patch->is_rename =1; 579 patch->old_name =find_name(line, NULL,0,0); 580return0; 581} 582 583static intgitdiff_renamedst(const char*line,struct patch *patch) 584{ 585 patch->is_rename =1; 586 patch->new_name =find_name(line, NULL,0,0); 587return0; 588} 589 590static intgitdiff_similarity(const char*line,struct patch *patch) 591{ 592if((patch->score =strtoul(line, NULL,10)) == ULONG_MAX) 593 patch->score =0; 594return0; 595} 596 597static intgitdiff_dissimilarity(const char*line,struct patch *patch) 598{ 599if((patch->score =strtoul(line, NULL,10)) == ULONG_MAX) 600 patch->score =0; 601return0; 602} 603 604static intgitdiff_index(const char*line,struct patch *patch) 605{ 606/* 607 * index line is N hexadecimal, "..", N hexadecimal, 608 * and optional space with octal mode. 609 */ 610const char*ptr, *eol; 611int len; 612 613 ptr =strchr(line,'.'); 614if(!ptr || ptr[1] !='.'||40< ptr - line) 615return0; 616 len = ptr - line; 617memcpy(patch->old_sha1_prefix, line, len); 618 patch->old_sha1_prefix[len] =0; 619 620 line = ptr +2; 621 ptr =strchr(line,' '); 622 eol =strchr(line,'\n'); 623 624if(!ptr || eol < ptr) 625 ptr = eol; 626 len = ptr - line; 627 628if(40< len) 629return0; 630memcpy(patch->new_sha1_prefix, line, len); 631 patch->new_sha1_prefix[len] =0; 632if(*ptr ==' ') 633 patch->new_mode = patch->old_mode =strtoul(ptr+1, NULL,8); 634return0; 635} 636 637/* 638 * This is normal for a diff that doesn't change anything: we'll fall through 639 * into the next diff. Tell the parser to break out. 640 */ 641static intgitdiff_unrecognized(const char*line,struct patch *patch) 642{ 643return-1; 644} 645 646static const char*stop_at_slash(const char*line,int llen) 647{ 648int i; 649 650for(i =0; i < llen; i++) { 651int ch = line[i]; 652if(ch =='/') 653return line + i; 654} 655return NULL; 656} 657 658/* 659 * This is to extract the same name that appears on "diff --git" 660 * line. We do not find and return anything if it is a rename 661 * patch, and it is OK because we will find the name elsewhere. 662 * We need to reliably find name only when it is mode-change only, 663 * creation or deletion of an empty file. In any of these cases, 664 * both sides are the same name under a/ and b/ respectively. 665 */ 666static char*git_header_name(char*line,int llen) 667{ 668const char*name; 669const char*second = NULL; 670size_t len; 671 672 line +=strlen("diff --git "); 673 llen -=strlen("diff --git "); 674 675if(*line =='"') { 676const char*cp; 677struct strbuf first = STRBUF_INIT; 678struct strbuf sp = STRBUF_INIT; 679 680if(unquote_c_style(&first, line, &second)) 681goto free_and_fail1; 682 683/* advance to the first slash */ 684 cp =stop_at_slash(first.buf, first.len); 685/* we do not accept absolute paths */ 686if(!cp || cp == first.buf) 687goto free_and_fail1; 688strbuf_remove(&first,0, cp +1- first.buf); 689 690/* 691 * second points at one past closing dq of name. 692 * find the second name. 693 */ 694while((second < line + llen) &&isspace(*second)) 695 second++; 696 697if(line + llen <= second) 698goto free_and_fail1; 699if(*second =='"') { 700if(unquote_c_style(&sp, second, NULL)) 701goto free_and_fail1; 702 cp =stop_at_slash(sp.buf, sp.len); 703if(!cp || cp == sp.buf) 704goto free_and_fail1; 705/* They must match, otherwise ignore */ 706if(strcmp(cp +1, first.buf)) 707goto free_and_fail1; 708strbuf_release(&sp); 709returnstrbuf_detach(&first, NULL); 710} 711 712/* unquoted second */ 713 cp =stop_at_slash(second, line + llen - second); 714if(!cp || cp == second) 715goto free_and_fail1; 716 cp++; 717if(line + llen - cp != first.len +1|| 718memcmp(first.buf, cp, first.len)) 719goto free_and_fail1; 720returnstrbuf_detach(&first, NULL); 721 722 free_and_fail1: 723strbuf_release(&first); 724strbuf_release(&sp); 725return NULL; 726} 727 728/* unquoted first name */ 729 name =stop_at_slash(line, llen); 730if(!name || name == line) 731return NULL; 732 name++; 733 734/* 735 * since the first name is unquoted, a dq if exists must be 736 * the beginning of the second name. 737 */ 738for(second = name; second < line + llen; second++) { 739if(*second =='"') { 740struct strbuf sp = STRBUF_INIT; 741const char*np; 742 743if(unquote_c_style(&sp, second, NULL)) 744goto free_and_fail2; 745 746 np =stop_at_slash(sp.buf, sp.len); 747if(!np || np == sp.buf) 748goto free_and_fail2; 749 np++; 750 751 len = sp.buf + sp.len - np; 752if(len < second - name && 753!strncmp(np, name, len) && 754isspace(name[len])) { 755/* Good */ 756strbuf_remove(&sp,0, np - sp.buf); 757returnstrbuf_detach(&sp, NULL); 758} 759 760 free_and_fail2: 761strbuf_release(&sp); 762return NULL; 763} 764} 765 766/* 767 * Accept a name only if it shows up twice, exactly the same 768 * form. 769 */ 770for(len =0; ; len++) { 771switch(name[len]) { 772default: 773continue; 774case'\n': 775return NULL; 776case'\t':case' ': 777 second = name+len; 778for(;;) { 779char c = *second++; 780if(c =='\n') 781return NULL; 782if(c =='/') 783break; 784} 785if(second[len] =='\n'&& !memcmp(name, second, len)) { 786returnxmemdupz(name, len); 787} 788} 789} 790} 791 792/* Verify that we recognize the lines following a git header */ 793static intparse_git_header(char*line,int len,unsigned int size,struct patch *patch) 794{ 795unsigned long offset; 796 797/* A git diff has explicit new/delete information, so we don't guess */ 798 patch->is_new =0; 799 patch->is_delete =0; 800 801/* 802 * Some things may not have the old name in the 803 * rest of the headers anywhere (pure mode changes, 804 * or removing or adding empty files), so we get 805 * the default name from the header. 806 */ 807 patch->def_name =git_header_name(line, len); 808if(patch->def_name && root) { 809char*s =xmalloc(root_len +strlen(patch->def_name) +1); 810strcpy(s, root); 811strcpy(s + root_len, patch->def_name); 812free(patch->def_name); 813 patch->def_name = s; 814} 815 816 line += len; 817 size -= len; 818 linenr++; 819for(offset = len ; size >0; offset += len, size -= len, line += len, linenr++) { 820static const struct opentry { 821const char*str; 822int(*fn)(const char*,struct patch *); 823} optable[] = { 824{"@@ -", gitdiff_hdrend }, 825{"--- ", gitdiff_oldname }, 826{"+++ ", gitdiff_newname }, 827{"old mode ", gitdiff_oldmode }, 828{"new mode ", gitdiff_newmode }, 829{"deleted file mode ", gitdiff_delete }, 830{"new file mode ", gitdiff_newfile }, 831{"copy from ", gitdiff_copysrc }, 832{"copy to ", gitdiff_copydst }, 833{"rename old ", gitdiff_renamesrc }, 834{"rename new ", gitdiff_renamedst }, 835{"rename from ", gitdiff_renamesrc }, 836{"rename to ", gitdiff_renamedst }, 837{"similarity index ", gitdiff_similarity }, 838{"dissimilarity index ", gitdiff_dissimilarity }, 839{"index ", gitdiff_index }, 840{"", gitdiff_unrecognized }, 841}; 842int i; 843 844 len =linelen(line, size); 845if(!len || line[len-1] !='\n') 846break; 847for(i =0; i <ARRAY_SIZE(optable); i++) { 848const struct opentry *p = optable + i; 849int oplen =strlen(p->str); 850if(len < oplen ||memcmp(p->str, line, oplen)) 851continue; 852if(p->fn(line + oplen, patch) <0) 853return offset; 854break; 855} 856} 857 858return offset; 859} 860 861static intparse_num(const char*line,unsigned long*p) 862{ 863char*ptr; 864 865if(!isdigit(*line)) 866return0; 867*p =strtoul(line, &ptr,10); 868return ptr - line; 869} 870 871static intparse_range(const char*line,int len,int offset,const char*expect, 872unsigned long*p1,unsigned long*p2) 873{ 874int digits, ex; 875 876if(offset <0|| offset >= len) 877return-1; 878 line += offset; 879 len -= offset; 880 881 digits =parse_num(line, p1); 882if(!digits) 883return-1; 884 885 offset += digits; 886 line += digits; 887 len -= digits; 888 889*p2 =1; 890if(*line ==',') { 891 digits =parse_num(line+1, p2); 892if(!digits) 893return-1; 894 895 offset += digits+1; 896 line += digits+1; 897 len -= digits+1; 898} 899 900 ex =strlen(expect); 901if(ex > len) 902return-1; 903if(memcmp(line, expect, ex)) 904return-1; 905 906return offset + ex; 907} 908 909static voidrecount_diff(char*line,int size,struct fragment *fragment) 910{ 911int oldlines =0, newlines =0, ret =0; 912 913if(size <1) { 914warning("recount: ignore empty hunk"); 915return; 916} 917 918for(;;) { 919int len =linelen(line, size); 920 size -= len; 921 line += len; 922 923if(size <1) 924break; 925 926switch(*line) { 927case' ':case'\n': 928 newlines++; 929/* fall through */ 930case'-': 931 oldlines++; 932continue; 933case'+': 934 newlines++; 935continue; 936case'\\': 937continue; 938case'@': 939 ret = size <3||prefixcmp(line,"@@ "); 940break; 941case'd': 942 ret = size <5||prefixcmp(line,"diff "); 943break; 944default: 945 ret = -1; 946break; 947} 948if(ret) { 949warning("recount: unexpected line: %.*s", 950(int)linelen(line, size), line); 951return; 952} 953break; 954} 955 fragment->oldlines = oldlines; 956 fragment->newlines = newlines; 957} 958 959/* 960 * Parse a unified diff fragment header of the 961 * form "@@ -a,b +c,d @@" 962 */ 963static intparse_fragment_header(char*line,int len,struct fragment *fragment) 964{ 965int offset; 966 967if(!len || line[len-1] !='\n') 968return-1; 969 970/* Figure out the number of lines in a fragment */ 971 offset =parse_range(line, len,4," +", &fragment->oldpos, &fragment->oldlines); 972 offset =parse_range(line, len, offset," @@", &fragment->newpos, &fragment->newlines); 973 974return offset; 975} 976 977static intfind_header(char*line,unsigned long size,int*hdrsize,struct patch *patch) 978{ 979unsigned long offset, len; 980 981 patch->is_toplevel_relative =0; 982 patch->is_rename = patch->is_copy =0; 983 patch->is_new = patch->is_delete = -1; 984 patch->old_mode = patch->new_mode =0; 985 patch->old_name = patch->new_name = NULL; 986for(offset =0; size >0; offset += len, size -= len, line += len, linenr++) { 987unsigned long nextlen; 988 989 len =linelen(line, size); 990if(!len) 991break; 992 993/* Testing this early allows us to take a few shortcuts.. */ 994if(len <6) 995continue; 996 997/* 998 * Make sure we don't find any unconnected patch fragments. 999 * That's a sign that we didn't find a header, and that a1000 * patch has become corrupted/broken up.1001 */1002if(!memcmp("@@ -", line,4)) {1003struct fragment dummy;1004if(parse_fragment_header(line, len, &dummy) <0)1005continue;1006die("patch fragment without header at line%d: %.*s",1007 linenr, (int)len-1, line);1008}10091010if(size < len +6)1011break;10121013/*1014 * Git patch? It might not have a real patch, just a rename1015 * or mode change, so we handle that specially1016 */1017if(!memcmp("diff --git ", line,11)) {1018int git_hdr_len =parse_git_header(line, len, size, patch);1019if(git_hdr_len <= len)1020continue;1021if(!patch->old_name && !patch->new_name) {1022if(!patch->def_name)1023die("git diff header lacks filename information (line%d)", linenr);1024 patch->old_name = patch->new_name = patch->def_name;1025}1026 patch->is_toplevel_relative =1;1027*hdrsize = git_hdr_len;1028return offset;1029}10301031/* --- followed by +++ ? */1032if(memcmp("--- ", line,4) ||memcmp("+++ ", line + len,4))1033continue;10341035/*1036 * We only accept unified patches, so we want it to1037 * at least have "@@ -a,b +c,d @@\n", which is 14 chars1038 * minimum ("@@ -0,0 +1 @@\n" is the shortest).1039 */1040 nextlen =linelen(line + len, size - len);1041if(size < nextlen +14||memcmp("@@ -", line + len + nextlen,4))1042continue;10431044/* Ok, we'll consider it a patch */1045parse_traditional_patch(line, line+len, patch);1046*hdrsize = len + nextlen;1047 linenr +=2;1048return offset;1049}1050return-1;1051}10521053static voidcheck_whitespace(const char*line,int len,unsigned ws_rule)1054{1055char*err;1056unsigned result =ws_check(line +1, len -1, ws_rule);1057if(!result)1058return;10591060 whitespace_error++;1061if(squelch_whitespace_errors &&1062 squelch_whitespace_errors < whitespace_error)1063;1064else{1065 err =whitespace_error_string(result);1066fprintf(stderr,"%s:%d:%s.\n%.*s\n",1067 patch_input_file, linenr, err, len -2, line +1);1068free(err);1069}1070}10711072/*1073 * Parse a unified diff. Note that this really needs to parse each1074 * fragment separately, since the only way to know the difference1075 * between a "---" that is part of a patch, and a "---" that starts1076 * the next patch is to look at the line counts..1077 */1078static intparse_fragment(char*line,unsigned long size,1079struct patch *patch,struct fragment *fragment)1080{1081int added, deleted;1082int len =linelen(line, size), offset;1083unsigned long oldlines, newlines;1084unsigned long leading, trailing;10851086 offset =parse_fragment_header(line, len, fragment);1087if(offset <0)1088return-1;1089if(offset >0&& patch->recount)1090recount_diff(line + offset, size - offset, fragment);1091 oldlines = fragment->oldlines;1092 newlines = fragment->newlines;1093 leading =0;1094 trailing =0;10951096/* Parse the thing.. */1097 line += len;1098 size -= len;1099 linenr++;1100 added = deleted =0;1101for(offset = len;11020< size;1103 offset += len, size -= len, line += len, linenr++) {1104if(!oldlines && !newlines)1105break;1106 len =linelen(line, size);1107if(!len || line[len-1] !='\n')1108return-1;1109switch(*line) {1110default:1111return-1;1112case'\n':/* newer GNU diff, an empty context line */1113case' ':1114 oldlines--;1115 newlines--;1116if(!deleted && !added)1117 leading++;1118 trailing++;1119break;1120case'-':1121if(apply_in_reverse &&1122 ws_error_action != nowarn_ws_error)1123check_whitespace(line, len, patch->ws_rule);1124 deleted++;1125 oldlines--;1126 trailing =0;1127break;1128case'+':1129if(!apply_in_reverse &&1130 ws_error_action != nowarn_ws_error)1131check_whitespace(line, len, patch->ws_rule);1132 added++;1133 newlines--;1134 trailing =0;1135break;11361137/*1138 * We allow "\ No newline at end of file". Depending1139 * on locale settings when the patch was produced we1140 * don't know what this line looks like. The only1141 * thing we do know is that it begins with "\ ".1142 * Checking for 12 is just for sanity check -- any1143 * l10n of "\ No newline..." is at least that long.1144 */1145case'\\':1146if(len <12||memcmp(line,"\\",2))1147return-1;1148break;1149}1150}1151if(oldlines || newlines)1152return-1;1153 fragment->leading = leading;1154 fragment->trailing = trailing;11551156/*1157 * If a fragment ends with an incomplete line, we failed to include1158 * it in the above loop because we hit oldlines == newlines == 01159 * before seeing it.1160 */1161if(12< size && !memcmp(line,"\\",2))1162 offset +=linelen(line, size);11631164 patch->lines_added += added;1165 patch->lines_deleted += deleted;11661167if(0< patch->is_new && oldlines)1168returnerror("new file depends on old contents");1169if(0< patch->is_delete && newlines)1170returnerror("deleted file still has contents");1171return offset;1172}11731174static intparse_single_patch(char*line,unsigned long size,struct patch *patch)1175{1176unsigned long offset =0;1177unsigned long oldlines =0, newlines =0, context =0;1178struct fragment **fragp = &patch->fragments;11791180while(size >4&& !memcmp(line,"@@ -",4)) {1181struct fragment *fragment;1182int len;11831184 fragment =xcalloc(1,sizeof(*fragment));1185 len =parse_fragment(line, size, patch, fragment);1186if(len <=0)1187die("corrupt patch at line%d", linenr);1188 fragment->patch = line;1189 fragment->size = len;1190 oldlines += fragment->oldlines;1191 newlines += fragment->newlines;1192 context += fragment->leading + fragment->trailing;11931194*fragp = fragment;1195 fragp = &fragment->next;11961197 offset += len;1198 line += len;1199 size -= len;1200}12011202/*1203 * If something was removed (i.e. we have old-lines) it cannot1204 * be creation, and if something was added it cannot be1205 * deletion. However, the reverse is not true; --unified=01206 * patches that only add are not necessarily creation even1207 * though they do not have any old lines, and ones that only1208 * delete are not necessarily deletion.1209 *1210 * Unfortunately, a real creation/deletion patch do _not_ have1211 * any context line by definition, so we cannot safely tell it1212 * apart with --unified=0 insanity. At least if the patch has1213 * more than one hunk it is not creation or deletion.1214 */1215if(patch->is_new <0&&1216(oldlines || (patch->fragments && patch->fragments->next)))1217 patch->is_new =0;1218if(patch->is_delete <0&&1219(newlines || (patch->fragments && patch->fragments->next)))1220 patch->is_delete =0;12211222if(0< patch->is_new && oldlines)1223die("new file%sdepends on old contents", patch->new_name);1224if(0< patch->is_delete && newlines)1225die("deleted file%sstill has contents", patch->old_name);1226if(!patch->is_delete && !newlines && context)1227fprintf(stderr,"** warning: file%sbecomes empty but "1228"is not deleted\n", patch->new_name);12291230return offset;1231}12321233staticinlineintmetadata_changes(struct patch *patch)1234{1235return patch->is_rename >0||1236 patch->is_copy >0||1237 patch->is_new >0||1238 patch->is_delete ||1239(patch->old_mode && patch->new_mode &&1240 patch->old_mode != patch->new_mode);1241}12421243static char*inflate_it(const void*data,unsigned long size,1244unsigned long inflated_size)1245{1246 z_stream stream;1247void*out;1248int st;12491250memset(&stream,0,sizeof(stream));12511252 stream.next_in = (unsigned char*)data;1253 stream.avail_in = size;1254 stream.next_out = out =xmalloc(inflated_size);1255 stream.avail_out = inflated_size;1256inflateInit(&stream);1257 st =inflate(&stream, Z_FINISH);1258if((st != Z_STREAM_END) || stream.total_out != inflated_size) {1259free(out);1260return NULL;1261}1262return out;1263}12641265static struct fragment *parse_binary_hunk(char**buf_p,1266unsigned long*sz_p,1267int*status_p,1268int*used_p)1269{1270/*1271 * Expect a line that begins with binary patch method ("literal"1272 * or "delta"), followed by the length of data before deflating.1273 * a sequence of 'length-byte' followed by base-85 encoded data1274 * should follow, terminated by a newline.1275 *1276 * Each 5-byte sequence of base-85 encodes up to 4 bytes,1277 * and we would limit the patch line to 66 characters,1278 * so one line can fit up to 13 groups that would decode1279 * to 52 bytes max. The length byte 'A'-'Z' corresponds1280 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.1281 */1282int llen, used;1283unsigned long size = *sz_p;1284char*buffer = *buf_p;1285int patch_method;1286unsigned long origlen;1287char*data = NULL;1288int hunk_size =0;1289struct fragment *frag;12901291 llen =linelen(buffer, size);1292 used = llen;12931294*status_p =0;12951296if(!prefixcmp(buffer,"delta ")) {1297 patch_method = BINARY_DELTA_DEFLATED;1298 origlen =strtoul(buffer +6, NULL,10);1299}1300else if(!prefixcmp(buffer,"literal ")) {1301 patch_method = BINARY_LITERAL_DEFLATED;1302 origlen =strtoul(buffer +8, NULL,10);1303}1304else1305return NULL;13061307 linenr++;1308 buffer += llen;1309while(1) {1310int byte_length, max_byte_length, newsize;1311 llen =linelen(buffer, size);1312 used += llen;1313 linenr++;1314if(llen ==1) {1315/* consume the blank line */1316 buffer++;1317 size--;1318break;1319}1320/*1321 * Minimum line is "A00000\n" which is 7-byte long,1322 * and the line length must be multiple of 5 plus 2.1323 */1324if((llen <7) || (llen-2) %5)1325goto corrupt;1326 max_byte_length = (llen -2) /5*4;1327 byte_length = *buffer;1328if('A'<= byte_length && byte_length <='Z')1329 byte_length = byte_length -'A'+1;1330else if('a'<= byte_length && byte_length <='z')1331 byte_length = byte_length -'a'+27;1332else1333goto corrupt;1334/* if the input length was not multiple of 4, we would1335 * have filler at the end but the filler should never1336 * exceed 3 bytes1337 */1338if(max_byte_length < byte_length ||1339 byte_length <= max_byte_length -4)1340goto corrupt;1341 newsize = hunk_size + byte_length;1342 data =xrealloc(data, newsize);1343if(decode_85(data + hunk_size, buffer +1, byte_length))1344goto corrupt;1345 hunk_size = newsize;1346 buffer += llen;1347 size -= llen;1348}13491350 frag =xcalloc(1,sizeof(*frag));1351 frag->patch =inflate_it(data, hunk_size, origlen);1352if(!frag->patch)1353goto corrupt;1354free(data);1355 frag->size = origlen;1356*buf_p = buffer;1357*sz_p = size;1358*used_p = used;1359 frag->binary_patch_method = patch_method;1360return frag;13611362 corrupt:1363free(data);1364*status_p = -1;1365error("corrupt binary patch at line%d: %.*s",1366 linenr-1, llen-1, buffer);1367return NULL;1368}13691370static intparse_binary(char*buffer,unsigned long size,struct patch *patch)1371{1372/*1373 * We have read "GIT binary patch\n"; what follows is a line1374 * that says the patch method (currently, either "literal" or1375 * "delta") and the length of data before deflating; a1376 * sequence of 'length-byte' followed by base-85 encoded data1377 * follows.1378 *1379 * When a binary patch is reversible, there is another binary1380 * hunk in the same format, starting with patch method (either1381 * "literal" or "delta") with the length of data, and a sequence1382 * of length-byte + base-85 encoded data, terminated with another1383 * empty line. This data, when applied to the postimage, produces1384 * the preimage.1385 */1386struct fragment *forward;1387struct fragment *reverse;1388int status;1389int used, used_1;13901391 forward =parse_binary_hunk(&buffer, &size, &status, &used);1392if(!forward && !status)1393/* there has to be one hunk (forward hunk) */1394returnerror("unrecognized binary patch at line%d", linenr-1);1395if(status)1396/* otherwise we already gave an error message */1397return status;13981399 reverse =parse_binary_hunk(&buffer, &size, &status, &used_1);1400if(reverse)1401 used += used_1;1402else if(status) {1403/*1404 * Not having reverse hunk is not an error, but having1405 * a corrupt reverse hunk is.1406 */1407free((void*) forward->patch);1408free(forward);1409return status;1410}1411 forward->next = reverse;1412 patch->fragments = forward;1413 patch->is_binary =1;1414return used;1415}14161417static intparse_chunk(char*buffer,unsigned long size,struct patch *patch)1418{1419int hdrsize, patchsize;1420int offset =find_header(buffer, size, &hdrsize, patch);14211422if(offset <0)1423return offset;14241425 patch->ws_rule =whitespace_rule(patch->new_name1426? patch->new_name1427: patch->old_name);14281429 patchsize =parse_single_patch(buffer + offset + hdrsize,1430 size - offset - hdrsize, patch);14311432if(!patchsize) {1433static const char*binhdr[] = {1434"Binary files ",1435"Files ",1436 NULL,1437};1438static const char git_binary[] ="GIT binary patch\n";1439int i;1440int hd = hdrsize + offset;1441unsigned long llen =linelen(buffer + hd, size - hd);14421443if(llen ==sizeof(git_binary) -1&&1444!memcmp(git_binary, buffer + hd, llen)) {1445int used;1446 linenr++;1447 used =parse_binary(buffer + hd + llen,1448 size - hd - llen, patch);1449if(used)1450 patchsize = used + llen;1451else1452 patchsize =0;1453}1454else if(!memcmp(" differ\n", buffer + hd + llen -8,8)) {1455for(i =0; binhdr[i]; i++) {1456int len =strlen(binhdr[i]);1457if(len < size - hd &&1458!memcmp(binhdr[i], buffer + hd, len)) {1459 linenr++;1460 patch->is_binary =1;1461 patchsize = llen;1462break;1463}1464}1465}14661467/* Empty patch cannot be applied if it is a text patch1468 * without metadata change. A binary patch appears1469 * empty to us here.1470 */1471if((apply || check) &&1472(!patch->is_binary && !metadata_changes(patch)))1473die("patch with only garbage at line%d", linenr);1474}14751476return offset + hdrsize + patchsize;1477}14781479#define swap(a,b) myswap((a),(b),sizeof(a))14801481#define myswap(a, b, size) do { \1482 unsigned char mytmp[size]; \1483 memcpy(mytmp, &a, size); \1484 memcpy(&a, &b, size); \1485 memcpy(&b, mytmp, size); \1486} while (0)14871488static voidreverse_patches(struct patch *p)1489{1490for(; p; p = p->next) {1491struct fragment *frag = p->fragments;14921493swap(p->new_name, p->old_name);1494swap(p->new_mode, p->old_mode);1495swap(p->is_new, p->is_delete);1496swap(p->lines_added, p->lines_deleted);1497swap(p->old_sha1_prefix, p->new_sha1_prefix);14981499for(; frag; frag = frag->next) {1500swap(frag->newpos, frag->oldpos);1501swap(frag->newlines, frag->oldlines);1502}1503}1504}15051506static const char pluses[] =1507"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";1508static const char minuses[]=1509"----------------------------------------------------------------------";15101511static voidshow_stats(struct patch *patch)1512{1513struct strbuf qname = STRBUF_INIT;1514char*cp = patch->new_name ? patch->new_name : patch->old_name;1515int max, add, del;15161517quote_c_style(cp, &qname, NULL,0);15181519/*1520 * "scale" the filename1521 */1522 max = max_len;1523if(max >50)1524 max =50;15251526if(qname.len > max) {1527 cp =strchr(qname.buf + qname.len +3- max,'/');1528if(!cp)1529 cp = qname.buf + qname.len +3- max;1530strbuf_splice(&qname,0, cp - qname.buf,"...",3);1531}15321533if(patch->is_binary) {1534printf(" %-*s | Bin\n", max, qname.buf);1535strbuf_release(&qname);1536return;1537}15381539printf(" %-*s |", max, qname.buf);1540strbuf_release(&qname);15411542/*1543 * scale the add/delete1544 */1545 max = max + max_change >70?70- max : max_change;1546 add = patch->lines_added;1547 del = patch->lines_deleted;15481549if(max_change >0) {1550int total = ((add + del) * max + max_change /2) / max_change;1551 add = (add * max + max_change /2) / max_change;1552 del = total - add;1553}1554printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,1555 add, pluses, del, minuses);1556}15571558static intread_old_data(struct stat *st,const char*path,struct strbuf *buf)1559{1560switch(st->st_mode & S_IFMT) {1561case S_IFLNK:1562strbuf_grow(buf, st->st_size);1563if(readlink(path, buf->buf, st->st_size) != st->st_size)1564return-1;1565strbuf_setlen(buf, st->st_size);1566return0;1567case S_IFREG:1568if(strbuf_read_file(buf, path, st->st_size) != st->st_size)1569returnerror("unable to open or read%s", path);1570convert_to_git(path, buf->buf, buf->len, buf,0);1571return0;1572default:1573return-1;1574}1575}15761577static voidupdate_pre_post_images(struct image *preimage,1578struct image *postimage,1579char*buf,1580size_t len)1581{1582int i, ctx;1583char*new, *old, *fixed;1584struct image fixed_preimage;15851586/*1587 * Update the preimage with whitespace fixes. Note that we1588 * are not losing preimage->buf -- apply_one_fragment() will1589 * free "oldlines".1590 */1591prepare_image(&fixed_preimage, buf, len,1);1592assert(fixed_preimage.nr == preimage->nr);1593for(i =0; i < preimage->nr; i++)1594 fixed_preimage.line[i].flag = preimage->line[i].flag;1595free(preimage->line_allocated);1596*preimage = fixed_preimage;15971598/*1599 * Adjust the common context lines in postimage, in place.1600 * This is possible because whitespace fixing does not make1601 * the string grow.1602 */1603new= old = postimage->buf;1604 fixed = preimage->buf;1605for(i = ctx =0; i < postimage->nr; i++) {1606size_t len = postimage->line[i].len;1607if(!(postimage->line[i].flag & LINE_COMMON)) {1608/* an added line -- no counterparts in preimage */1609memmove(new, old, len);1610 old += len;1611new+= len;1612continue;1613}16141615/* a common context -- skip it in the original postimage */1616 old += len;16171618/* and find the corresponding one in the fixed preimage */1619while(ctx < preimage->nr &&1620!(preimage->line[ctx].flag & LINE_COMMON)) {1621 fixed += preimage->line[ctx].len;1622 ctx++;1623}1624if(preimage->nr <= ctx)1625die("oops");16261627/* and copy it in, while fixing the line length */1628 len = preimage->line[ctx].len;1629memcpy(new, fixed, len);1630new+= len;1631 fixed += len;1632 postimage->line[i].len = len;1633 ctx++;1634}16351636/* Fix the length of the whole thing */1637 postimage->len =new- postimage->buf;1638}16391640static intmatch_fragment(struct image *img,1641struct image *preimage,1642struct image *postimage,1643unsigned longtry,1644int try_lno,1645unsigned ws_rule,1646int match_beginning,int match_end)1647{1648int i;1649char*fixed_buf, *buf, *orig, *target;16501651if(preimage->nr + try_lno > img->nr)1652return0;16531654if(match_beginning && try_lno)1655return0;16561657if(match_end && preimage->nr + try_lno != img->nr)1658return0;16591660/* Quick hash check */1661for(i =0; i < preimage->nr; i++)1662if(preimage->line[i].hash != img->line[try_lno + i].hash)1663return0;16641665/*1666 * Do we have an exact match? If we were told to match1667 * at the end, size must be exactly at try+fragsize,1668 * otherwise try+fragsize must be still within the preimage,1669 * and either case, the old piece should match the preimage1670 * exactly.1671 */1672if((match_end1673? (try+ preimage->len == img->len)1674: (try+ preimage->len <= img->len)) &&1675!memcmp(img->buf +try, preimage->buf, preimage->len))1676return1;16771678if(ws_error_action != correct_ws_error)1679return0;16801681/*1682 * The hunk does not apply byte-by-byte, but the hash says1683 * it might with whitespace fuzz.1684 */1685 fixed_buf =xmalloc(preimage->len +1);1686 buf = fixed_buf;1687 orig = preimage->buf;1688 target = img->buf +try;1689for(i =0; i < preimage->nr; i++) {1690size_t fixlen;/* length after fixing the preimage */1691size_t oldlen = preimage->line[i].len;1692size_t tgtlen = img->line[try_lno + i].len;1693size_t tgtfixlen;/* length after fixing the target line */1694char tgtfixbuf[1024], *tgtfix;1695int match;16961697/* Try fixing the line in the preimage */1698 fixlen =ws_fix_copy(buf, orig, oldlen, ws_rule, NULL);16991700/* Try fixing the line in the target */1701if(sizeof(tgtfixbuf) > tgtlen)1702 tgtfix = tgtfixbuf;1703else1704 tgtfix =xmalloc(tgtlen);1705 tgtfixlen =ws_fix_copy(tgtfix, target, tgtlen, ws_rule, NULL);17061707/*1708 * If they match, either the preimage was based on1709 * a version before our tree fixed whitespace breakage,1710 * or we are lacking a whitespace-fix patch the tree1711 * the preimage was based on already had (i.e. target1712 * has whitespace breakage, the preimage doesn't).1713 * In either case, we are fixing the whitespace breakages1714 * so we might as well take the fix together with their1715 * real change.1716 */1717 match = (tgtfixlen == fixlen && !memcmp(tgtfix, buf, fixlen));17181719if(tgtfix != tgtfixbuf)1720free(tgtfix);1721if(!match)1722goto unmatch_exit;17231724 orig += oldlen;1725 buf += fixlen;1726 target += tgtlen;1727}17281729/*1730 * Yes, the preimage is based on an older version that still1731 * has whitespace breakages unfixed, and fixing them makes the1732 * hunk match. Update the context lines in the postimage.1733 */1734update_pre_post_images(preimage, postimage,1735 fixed_buf, buf - fixed_buf);1736return1;17371738 unmatch_exit:1739free(fixed_buf);1740return0;1741}17421743static intfind_pos(struct image *img,1744struct image *preimage,1745struct image *postimage,1746int line,1747unsigned ws_rule,1748int match_beginning,int match_end)1749{1750int i;1751unsigned long backwards, forwards,try;1752int backwards_lno, forwards_lno, try_lno;17531754if(preimage->nr > img->nr)1755return-1;17561757/*1758 * If match_begining or match_end is specified, there is no1759 * point starting from a wrong line that will never match and1760 * wander around and wait for a match at the specified end.1761 */1762if(match_beginning)1763 line =0;1764else if(match_end)1765 line = img->nr - preimage->nr;17661767if(line > img->nr)1768 line = img->nr;17691770try=0;1771for(i =0; i < line; i++)1772try+= img->line[i].len;17731774/*1775 * There's probably some smart way to do this, but I'll leave1776 * that to the smart and beautiful people. I'm simple and stupid.1777 */1778 backwards =try;1779 backwards_lno = line;1780 forwards =try;1781 forwards_lno = line;1782 try_lno = line;17831784for(i =0; ; i++) {1785if(match_fragment(img, preimage, postimage,1786try, try_lno, ws_rule,1787 match_beginning, match_end))1788return try_lno;17891790 again:1791if(backwards_lno ==0&& forwards_lno == img->nr)1792break;17931794if(i &1) {1795if(backwards_lno ==0) {1796 i++;1797goto again;1798}1799 backwards_lno--;1800 backwards -= img->line[backwards_lno].len;1801try= backwards;1802 try_lno = backwards_lno;1803}else{1804if(forwards_lno == img->nr) {1805 i++;1806goto again;1807}1808 forwards += img->line[forwards_lno].len;1809 forwards_lno++;1810try= forwards;1811 try_lno = forwards_lno;1812}18131814}1815return-1;1816}18171818static voidremove_first_line(struct image *img)1819{1820 img->buf += img->line[0].len;1821 img->len -= img->line[0].len;1822 img->line++;1823 img->nr--;1824}18251826static voidremove_last_line(struct image *img)1827{1828 img->len -= img->line[--img->nr].len;1829}18301831static voidupdate_image(struct image *img,1832int applied_pos,1833struct image *preimage,1834struct image *postimage)1835{1836/*1837 * remove the copy of preimage at offset in img1838 * and replace it with postimage1839 */1840int i, nr;1841size_t remove_count, insert_count, applied_at =0;1842char*result;18431844for(i =0; i < applied_pos; i++)1845 applied_at += img->line[i].len;18461847 remove_count =0;1848for(i =0; i < preimage->nr; i++)1849 remove_count += img->line[applied_pos + i].len;1850 insert_count = postimage->len;18511852/* Adjust the contents */1853 result =xmalloc(img->len + insert_count - remove_count +1);1854memcpy(result, img->buf, applied_at);1855memcpy(result + applied_at, postimage->buf, postimage->len);1856memcpy(result + applied_at + postimage->len,1857 img->buf + (applied_at + remove_count),1858 img->len - (applied_at + remove_count));1859free(img->buf);1860 img->buf = result;1861 img->len += insert_count - remove_count;1862 result[img->len] ='\0';18631864/* Adjust the line table */1865 nr = img->nr + postimage->nr - preimage->nr;1866if(preimage->nr < postimage->nr) {1867/*1868 * NOTE: this knows that we never call remove_first_line()1869 * on anything other than pre/post image.1870 */1871 img->line =xrealloc(img->line, nr *sizeof(*img->line));1872 img->line_allocated = img->line;1873}1874if(preimage->nr != postimage->nr)1875memmove(img->line + applied_pos + postimage->nr,1876 img->line + applied_pos + preimage->nr,1877(img->nr - (applied_pos + preimage->nr)) *1878sizeof(*img->line));1879memcpy(img->line + applied_pos,1880 postimage->line,1881 postimage->nr *sizeof(*img->line));1882 img->nr = nr;1883}18841885static intapply_one_fragment(struct image *img,struct fragment *frag,1886int inaccurate_eof,unsigned ws_rule)1887{1888int match_beginning, match_end;1889const char*patch = frag->patch;1890int size = frag->size;1891char*old, *new, *oldlines, *newlines;1892int new_blank_lines_at_end =0;1893unsigned long leading, trailing;1894int pos, applied_pos;1895struct image preimage;1896struct image postimage;18971898memset(&preimage,0,sizeof(preimage));1899memset(&postimage,0,sizeof(postimage));1900 oldlines =xmalloc(size);1901 newlines =xmalloc(size);19021903 old = oldlines;1904new= newlines;1905while(size >0) {1906char first;1907int len =linelen(patch, size);1908int plen, added;1909int added_blank_line =0;19101911if(!len)1912break;19131914/*1915 * "plen" is how much of the line we should use for1916 * the actual patch data. Normally we just remove the1917 * first character on the line, but if the line is1918 * followed by "\ No newline", then we also remove the1919 * last one (which is the newline, of course).1920 */1921 plen = len -1;1922if(len < size && patch[len] =='\\')1923 plen--;1924 first = *patch;1925if(apply_in_reverse) {1926if(first =='-')1927 first ='+';1928else if(first =='+')1929 first ='-';1930}19311932switch(first) {1933case'\n':1934/* Newer GNU diff, empty context line */1935if(plen <0)1936/* ... followed by '\No newline'; nothing */1937break;1938*old++ ='\n';1939*new++ ='\n';1940add_line_info(&preimage,"\n",1, LINE_COMMON);1941add_line_info(&postimage,"\n",1, LINE_COMMON);1942break;1943case' ':1944case'-':1945memcpy(old, patch +1, plen);1946add_line_info(&preimage, old, plen,1947(first ==' '? LINE_COMMON :0));1948 old += plen;1949if(first =='-')1950break;1951/* Fall-through for ' ' */1952case'+':1953/* --no-add does not add new lines */1954if(first =='+'&& no_add)1955break;19561957if(first !='+'||1958!whitespace_error ||1959 ws_error_action != correct_ws_error) {1960memcpy(new, patch +1, plen);1961 added = plen;1962}1963else{1964 added =ws_fix_copy(new, patch +1, plen, ws_rule, &applied_after_fixing_ws);1965}1966add_line_info(&postimage,new, added,1967(first =='+'?0: LINE_COMMON));1968new+= added;1969if(first =='+'&&1970 added ==1&&new[-1] =='\n')1971 added_blank_line =1;1972break;1973case'@':case'\\':1974/* Ignore it, we already handled it */1975break;1976default:1977if(apply_verbosely)1978error("invalid start of line: '%c'", first);1979return-1;1980}1981if(added_blank_line)1982 new_blank_lines_at_end++;1983else1984 new_blank_lines_at_end =0;1985 patch += len;1986 size -= len;1987}1988if(inaccurate_eof &&1989 old > oldlines && old[-1] =='\n'&&1990new> newlines &&new[-1] =='\n') {1991 old--;1992new--;1993}19941995 leading = frag->leading;1996 trailing = frag->trailing;19971998/*1999 * A hunk to change lines at the beginning would begin with2000 * @@ -1,L +N,M @@2001 * but we need to be careful. -U0 that inserts before the second2002 * line also has this pattern.2003 *2004 * And a hunk to add to an empty file would begin with2005 * @@ -0,0 +N,M @@2006 *2007 * In other words, a hunk that is (frag->oldpos <= 1) with or2008 * without leading context must match at the beginning.2009 */2010 match_beginning = (!frag->oldpos ||2011(frag->oldpos ==1&& !unidiff_zero));20122013/*2014 * A hunk without trailing lines must match at the end.2015 * However, we simply cannot tell if a hunk must match end2016 * from the lack of trailing lines if the patch was generated2017 * with unidiff without any context.2018 */2019 match_end = !unidiff_zero && !trailing;20202021 pos = frag->newpos ? (frag->newpos -1) :0;2022 preimage.buf = oldlines;2023 preimage.len = old - oldlines;2024 postimage.buf = newlines;2025 postimage.len =new- newlines;2026 preimage.line = preimage.line_allocated;2027 postimage.line = postimage.line_allocated;20282029for(;;) {20302031 applied_pos =find_pos(img, &preimage, &postimage, pos,2032 ws_rule, match_beginning, match_end);20332034if(applied_pos >=0)2035break;20362037/* Am I at my context limits? */2038if((leading <= p_context) && (trailing <= p_context))2039break;2040if(match_beginning || match_end) {2041 match_beginning = match_end =0;2042continue;2043}20442045/*2046 * Reduce the number of context lines; reduce both2047 * leading and trailing if they are equal otherwise2048 * just reduce the larger context.2049 */2050if(leading >= trailing) {2051remove_first_line(&preimage);2052remove_first_line(&postimage);2053 pos--;2054 leading--;2055}2056if(trailing > leading) {2057remove_last_line(&preimage);2058remove_last_line(&postimage);2059 trailing--;2060}2061}20622063if(applied_pos >=0) {2064if(ws_error_action == correct_ws_error &&2065 new_blank_lines_at_end &&2066 postimage.nr + applied_pos == img->nr) {2067/*2068 * If the patch application adds blank lines2069 * at the end, and if the patch applies at the2070 * end of the image, remove those added blank2071 * lines.2072 */2073while(new_blank_lines_at_end--)2074remove_last_line(&postimage);2075}20762077/*2078 * Warn if it was necessary to reduce the number2079 * of context lines.2080 */2081if((leading != frag->leading) ||2082(trailing != frag->trailing))2083fprintf(stderr,"Context reduced to (%ld/%ld)"2084" to apply fragment at%d\n",2085 leading, trailing, applied_pos+1);2086update_image(img, applied_pos, &preimage, &postimage);2087}else{2088if(apply_verbosely)2089error("while searching for:\n%.*s",2090(int)(old - oldlines), oldlines);2091}20922093free(oldlines);2094free(newlines);2095free(preimage.line_allocated);2096free(postimage.line_allocated);20972098return(applied_pos <0);2099}21002101static intapply_binary_fragment(struct image *img,struct patch *patch)2102{2103struct fragment *fragment = patch->fragments;2104unsigned long len;2105void*dst;21062107/* Binary patch is irreversible without the optional second hunk */2108if(apply_in_reverse) {2109if(!fragment->next)2110returnerror("cannot reverse-apply a binary patch "2111"without the reverse hunk to '%s'",2112 patch->new_name2113? patch->new_name : patch->old_name);2114 fragment = fragment->next;2115}2116switch(fragment->binary_patch_method) {2117case BINARY_DELTA_DEFLATED:2118 dst =patch_delta(img->buf, img->len, fragment->patch,2119 fragment->size, &len);2120if(!dst)2121return-1;2122clear_image(img);2123 img->buf = dst;2124 img->len = len;2125return0;2126case BINARY_LITERAL_DEFLATED:2127clear_image(img);2128 img->len = fragment->size;2129 img->buf =xmalloc(img->len+1);2130memcpy(img->buf, fragment->patch, img->len);2131 img->buf[img->len] ='\0';2132return0;2133}2134return-1;2135}21362137static intapply_binary(struct image *img,struct patch *patch)2138{2139const char*name = patch->old_name ? patch->old_name : patch->new_name;2140unsigned char sha1[20];21412142/*2143 * For safety, we require patch index line to contain2144 * full 40-byte textual SHA1 for old and new, at least for now.2145 */2146if(strlen(patch->old_sha1_prefix) !=40||2147strlen(patch->new_sha1_prefix) !=40||2148get_sha1_hex(patch->old_sha1_prefix, sha1) ||2149get_sha1_hex(patch->new_sha1_prefix, sha1))2150returnerror("cannot apply binary patch to '%s' "2151"without full index line", name);21522153if(patch->old_name) {2154/*2155 * See if the old one matches what the patch2156 * applies to.2157 */2158hash_sha1_file(img->buf, img->len, blob_type, sha1);2159if(strcmp(sha1_to_hex(sha1), patch->old_sha1_prefix))2160returnerror("the patch applies to '%s' (%s), "2161"which does not match the "2162"current contents.",2163 name,sha1_to_hex(sha1));2164}2165else{2166/* Otherwise, the old one must be empty. */2167if(img->len)2168returnerror("the patch applies to an empty "2169"'%s' but it is not empty", name);2170}21712172get_sha1_hex(patch->new_sha1_prefix, sha1);2173if(is_null_sha1(sha1)) {2174clear_image(img);2175return0;/* deletion patch */2176}21772178if(has_sha1_file(sha1)) {2179/* We already have the postimage */2180enum object_type type;2181unsigned long size;2182char*result;21832184 result =read_sha1_file(sha1, &type, &size);2185if(!result)2186returnerror("the necessary postimage%sfor "2187"'%s' cannot be read",2188 patch->new_sha1_prefix, name);2189clear_image(img);2190 img->buf = result;2191 img->len = size;2192}else{2193/*2194 * We have verified buf matches the preimage;2195 * apply the patch data to it, which is stored2196 * in the patch->fragments->{patch,size}.2197 */2198if(apply_binary_fragment(img, patch))2199returnerror("binary patch does not apply to '%s'",2200 name);22012202/* verify that the result matches */2203hash_sha1_file(img->buf, img->len, blob_type, sha1);2204if(strcmp(sha1_to_hex(sha1), patch->new_sha1_prefix))2205returnerror("binary patch to '%s' creates incorrect result (expecting%s, got%s)",2206 name, patch->new_sha1_prefix,sha1_to_hex(sha1));2207}22082209return0;2210}22112212static intapply_fragments(struct image *img,struct patch *patch)2213{2214struct fragment *frag = patch->fragments;2215const char*name = patch->old_name ? patch->old_name : patch->new_name;2216unsigned ws_rule = patch->ws_rule;2217unsigned inaccurate_eof = patch->inaccurate_eof;22182219if(patch->is_binary)2220returnapply_binary(img, patch);22212222while(frag) {2223if(apply_one_fragment(img, frag, inaccurate_eof, ws_rule)) {2224error("patch failed:%s:%ld", name, frag->oldpos);2225if(!apply_with_reject)2226return-1;2227 frag->rejected =1;2228}2229 frag = frag->next;2230}2231return0;2232}22332234static intread_file_or_gitlink(struct cache_entry *ce,struct strbuf *buf)2235{2236if(!ce)2237return0;22382239if(S_ISGITLINK(ce->ce_mode)) {2240strbuf_grow(buf,100);2241strbuf_addf(buf,"Subproject commit%s\n",sha1_to_hex(ce->sha1));2242}else{2243enum object_type type;2244unsigned long sz;2245char*result;22462247 result =read_sha1_file(ce->sha1, &type, &sz);2248if(!result)2249return-1;2250/* XXX read_sha1_file NUL-terminates */2251strbuf_attach(buf, result, sz, sz +1);2252}2253return0;2254}22552256static struct patch *in_fn_table(const char*name)2257{2258struct string_list_item *item;22592260if(name == NULL)2261return NULL;22622263 item =string_list_lookup(name, &fn_table);2264if(item != NULL)2265return(struct patch *)item->util;22662267return NULL;2268}22692270static voidadd_to_fn_table(struct patch *patch)2271{2272struct string_list_item *item;22732274/*2275 * Always add new_name unless patch is a deletion2276 * This should cover the cases for normal diffs,2277 * file creations and copies2278 */2279if(patch->new_name != NULL) {2280 item =string_list_insert(patch->new_name, &fn_table);2281 item->util = patch;2282}22832284/*2285 * store a failure on rename/deletion cases because2286 * later chunks shouldn't patch old names2287 */2288if((patch->new_name == NULL) || (patch->is_rename)) {2289 item =string_list_insert(patch->old_name, &fn_table);2290 item->util = (struct patch *) -1;2291}2292}22932294static intapply_data(struct patch *patch,struct stat *st,struct cache_entry *ce)2295{2296struct strbuf buf = STRBUF_INIT;2297struct image image;2298size_t len;2299char*img;2300struct patch *tpatch;23012302if(!(patch->is_copy || patch->is_rename) &&2303((tpatch =in_fn_table(patch->old_name)) != NULL)) {2304if(tpatch == (struct patch *) -1) {2305returnerror("patch%shas been renamed/deleted",2306 patch->old_name);2307}2308/* We have a patched copy in memory use that */2309strbuf_add(&buf, tpatch->result, tpatch->resultsize);2310}else if(cached) {2311if(read_file_or_gitlink(ce, &buf))2312returnerror("read of%sfailed", patch->old_name);2313}else if(patch->old_name) {2314if(S_ISGITLINK(patch->old_mode)) {2315if(ce) {2316read_file_or_gitlink(ce, &buf);2317}else{2318/*2319 * There is no way to apply subproject2320 * patch without looking at the index.2321 */2322 patch->fragments = NULL;2323}2324}else{2325if(read_old_data(st, patch->old_name, &buf))2326returnerror("read of%sfailed", patch->old_name);2327}2328}23292330 img =strbuf_detach(&buf, &len);2331prepare_image(&image, img, len, !patch->is_binary);23322333if(apply_fragments(&image, patch) <0)2334return-1;/* note with --reject this succeeds. */2335 patch->result = image.buf;2336 patch->resultsize = image.len;2337add_to_fn_table(patch);2338free(image.line_allocated);23392340if(0< patch->is_delete && patch->resultsize)2341returnerror("removal patch leaves file contents");23422343return0;2344}23452346static intcheck_to_create_blob(const char*new_name,int ok_if_exists)2347{2348struct stat nst;2349if(!lstat(new_name, &nst)) {2350if(S_ISDIR(nst.st_mode) || ok_if_exists)2351return0;2352/*2353 * A leading component of new_name might be a symlink2354 * that is going to be removed with this patch, but2355 * still pointing at somewhere that has the path.2356 * In such a case, path "new_name" does not exist as2357 * far as git is concerned.2358 */2359if(has_symlink_leading_path(strlen(new_name), new_name))2360return0;23612362returnerror("%s: already exists in working directory", new_name);2363}2364else if((errno != ENOENT) && (errno != ENOTDIR))2365returnerror("%s:%s", new_name,strerror(errno));2366return0;2367}23682369static intverify_index_match(struct cache_entry *ce,struct stat *st)2370{2371if(S_ISGITLINK(ce->ce_mode)) {2372if(!S_ISDIR(st->st_mode))2373return-1;2374return0;2375}2376returnce_match_stat(ce, st, CE_MATCH_IGNORE_VALID);2377}23782379static intcheck_preimage(struct patch *patch,struct cache_entry **ce,struct stat *st)2380{2381const char*old_name = patch->old_name;2382struct patch *tpatch = NULL;2383int stat_ret =0;2384unsigned st_mode =0;23852386/*2387 * Make sure that we do not have local modifications from the2388 * index when we are looking at the index. Also make sure2389 * we have the preimage file to be patched in the work tree,2390 * unless --cached, which tells git to apply only in the index.2391 */2392if(!old_name)2393return0;23942395assert(patch->is_new <=0);23962397if(!(patch->is_copy || patch->is_rename) &&2398(tpatch =in_fn_table(old_name)) != NULL) {2399if(tpatch == (struct patch *) -1) {2400returnerror("%s: has been deleted/renamed", old_name);2401}2402 st_mode = tpatch->new_mode;2403}else if(!cached) {2404 stat_ret =lstat(old_name, st);2405if(stat_ret && errno != ENOENT)2406returnerror("%s:%s", old_name,strerror(errno));2407}24082409if(check_index && !tpatch) {2410int pos =cache_name_pos(old_name,strlen(old_name));2411if(pos <0) {2412if(patch->is_new <0)2413goto is_new;2414returnerror("%s: does not exist in index", old_name);2415}2416*ce = active_cache[pos];2417if(stat_ret <0) {2418struct checkout costate;2419/* checkout */2420 costate.base_dir ="";2421 costate.base_dir_len =0;2422 costate.force =0;2423 costate.quiet =0;2424 costate.not_new =0;2425 costate.refresh_cache =1;2426if(checkout_entry(*ce, &costate, NULL) ||2427lstat(old_name, st))2428return-1;2429}2430if(!cached &&verify_index_match(*ce, st))2431returnerror("%s: does not match index", old_name);2432if(cached)2433 st_mode = (*ce)->ce_mode;2434}else if(stat_ret <0) {2435if(patch->is_new <0)2436goto is_new;2437returnerror("%s:%s", old_name,strerror(errno));2438}24392440if(!cached)2441 st_mode =ce_mode_from_stat(*ce, st->st_mode);24422443if(patch->is_new <0)2444 patch->is_new =0;2445if(!patch->old_mode)2446 patch->old_mode = st_mode;2447if((st_mode ^ patch->old_mode) & S_IFMT)2448returnerror("%s: wrong type", old_name);2449if(st_mode != patch->old_mode)2450fprintf(stderr,"warning:%shas type%o, expected%o\n",2451 old_name, st_mode, patch->old_mode);2452return0;24532454 is_new:2455 patch->is_new =1;2456 patch->is_delete =0;2457 patch->old_name = NULL;2458return0;2459}24602461static intcheck_patch(struct patch *patch)2462{2463struct stat st;2464const char*old_name = patch->old_name;2465const char*new_name = patch->new_name;2466const char*name = old_name ? old_name : new_name;2467struct cache_entry *ce = NULL;2468int ok_if_exists;2469int status;24702471 patch->rejected =1;/* we will drop this after we succeed */24722473 status =check_preimage(patch, &ce, &st);2474if(status)2475return status;2476 old_name = patch->old_name;24772478if(in_fn_table(new_name) == (struct patch *) -1)2479/*2480 * A type-change diff is always split into a patch to2481 * delete old, immediately followed by a patch to2482 * create new (see diff.c::run_diff()); in such a case2483 * it is Ok that the entry to be deleted by the2484 * previous patch is still in the working tree and in2485 * the index.2486 */2487 ok_if_exists =1;2488else2489 ok_if_exists =0;24902491if(new_name &&2492((0< patch->is_new) | (0< patch->is_rename) | patch->is_copy)) {2493if(check_index &&2494cache_name_pos(new_name,strlen(new_name)) >=0&&2495!ok_if_exists)2496returnerror("%s: already exists in index", new_name);2497if(!cached) {2498int err =check_to_create_blob(new_name, ok_if_exists);2499if(err)2500return err;2501}2502if(!patch->new_mode) {2503if(0< patch->is_new)2504 patch->new_mode = S_IFREG |0644;2505else2506 patch->new_mode = patch->old_mode;2507}2508}25092510if(new_name && old_name) {2511int same = !strcmp(old_name, new_name);2512if(!patch->new_mode)2513 patch->new_mode = patch->old_mode;2514if((patch->old_mode ^ patch->new_mode) & S_IFMT)2515returnerror("new mode (%o) of%sdoes not match old mode (%o)%s%s",2516 patch->new_mode, new_name, patch->old_mode,2517 same ?"":" of ", same ?"": old_name);2518}25192520if(apply_data(patch, &st, ce) <0)2521returnerror("%s: patch does not apply", name);2522 patch->rejected =0;2523return0;2524}25252526static intcheck_patch_list(struct patch *patch)2527{2528int err =0;25292530while(patch) {2531if(apply_verbosely)2532say_patch_name(stderr,2533"Checking patch ", patch,"...\n");2534 err |=check_patch(patch);2535 patch = patch->next;2536}2537return err;2538}25392540/* This function tries to read the sha1 from the current index */2541static intget_current_sha1(const char*path,unsigned char*sha1)2542{2543int pos;25442545if(read_cache() <0)2546return-1;2547 pos =cache_name_pos(path,strlen(path));2548if(pos <0)2549return-1;2550hashcpy(sha1, active_cache[pos]->sha1);2551return0;2552}25532554/* Build an index that contains the just the files needed for a 3way merge */2555static voidbuild_fake_ancestor(struct patch *list,const char*filename)2556{2557struct patch *patch;2558struct index_state result = {0};2559int fd;25602561/* Once we start supporting the reverse patch, it may be2562 * worth showing the new sha1 prefix, but until then...2563 */2564for(patch = list; patch; patch = patch->next) {2565const unsigned char*sha1_ptr;2566unsigned char sha1[20];2567struct cache_entry *ce;2568const char*name;25692570 name = patch->old_name ? patch->old_name : patch->new_name;2571if(0< patch->is_new)2572continue;2573else if(get_sha1(patch->old_sha1_prefix, sha1))2574/* git diff has no index line for mode/type changes */2575if(!patch->lines_added && !patch->lines_deleted) {2576if(get_current_sha1(patch->new_name, sha1) ||2577get_current_sha1(patch->old_name, sha1))2578die("mode change for%s, which is not "2579"in current HEAD", name);2580 sha1_ptr = sha1;2581}else2582die("sha1 information is lacking or useless "2583"(%s).", name);2584else2585 sha1_ptr = sha1;25862587 ce =make_cache_entry(patch->old_mode, sha1_ptr, name,0,0);2588if(!ce)2589die("make_cache_entry failed for path '%s'", name);2590if(add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD))2591die("Could not add%sto temporary index", name);2592}25932594 fd =open(filename, O_WRONLY | O_CREAT,0666);2595if(fd <0||write_index(&result, fd) ||close(fd))2596die("Could not write temporary index to%s", filename);25972598discard_index(&result);2599}26002601static voidstat_patch_list(struct patch *patch)2602{2603int files, adds, dels;26042605for(files = adds = dels =0; patch ; patch = patch->next) {2606 files++;2607 adds += patch->lines_added;2608 dels += patch->lines_deleted;2609show_stats(patch);2610}26112612printf("%dfiles changed,%dinsertions(+),%ddeletions(-)\n", files, adds, dels);2613}26142615static voidnumstat_patch_list(struct patch *patch)2616{2617for( ; patch; patch = patch->next) {2618const char*name;2619 name = patch->new_name ? patch->new_name : patch->old_name;2620if(patch->is_binary)2621printf("-\t-\t");2622else2623printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);2624write_name_quoted(name, stdout, line_termination);2625}2626}26272628static voidshow_file_mode_name(const char*newdelete,unsigned int mode,const char*name)2629{2630if(mode)2631printf("%smode%06o%s\n", newdelete, mode, name);2632else2633printf("%s %s\n", newdelete, name);2634}26352636static voidshow_mode_change(struct patch *p,int show_name)2637{2638if(p->old_mode && p->new_mode && p->old_mode != p->new_mode) {2639if(show_name)2640printf(" mode change%06o =>%06o%s\n",2641 p->old_mode, p->new_mode, p->new_name);2642else2643printf(" mode change%06o =>%06o\n",2644 p->old_mode, p->new_mode);2645}2646}26472648static voidshow_rename_copy(struct patch *p)2649{2650const char*renamecopy = p->is_rename ?"rename":"copy";2651const char*old, *new;26522653/* Find common prefix */2654 old = p->old_name;2655new= p->new_name;2656while(1) {2657const char*slash_old, *slash_new;2658 slash_old =strchr(old,'/');2659 slash_new =strchr(new,'/');2660if(!slash_old ||2661!slash_new ||2662 slash_old - old != slash_new -new||2663memcmp(old,new, slash_new -new))2664break;2665 old = slash_old +1;2666new= slash_new +1;2667}2668/* p->old_name thru old is the common prefix, and old and new2669 * through the end of names are renames2670 */2671if(old != p->old_name)2672printf("%s%.*s{%s=>%s} (%d%%)\n", renamecopy,2673(int)(old - p->old_name), p->old_name,2674 old,new, p->score);2675else2676printf("%s %s=>%s(%d%%)\n", renamecopy,2677 p->old_name, p->new_name, p->score);2678show_mode_change(p,0);2679}26802681static voidsummary_patch_list(struct patch *patch)2682{2683struct patch *p;26842685for(p = patch; p; p = p->next) {2686if(p->is_new)2687show_file_mode_name("create", p->new_mode, p->new_name);2688else if(p->is_delete)2689show_file_mode_name("delete", p->old_mode, p->old_name);2690else{2691if(p->is_rename || p->is_copy)2692show_rename_copy(p);2693else{2694if(p->score) {2695printf(" rewrite%s(%d%%)\n",2696 p->new_name, p->score);2697show_mode_change(p,0);2698}2699else2700show_mode_change(p,1);2701}2702}2703}2704}27052706static voidpatch_stats(struct patch *patch)2707{2708int lines = patch->lines_added + patch->lines_deleted;27092710if(lines > max_change)2711 max_change = lines;2712if(patch->old_name) {2713int len =quote_c_style(patch->old_name, NULL, NULL,0);2714if(!len)2715 len =strlen(patch->old_name);2716if(len > max_len)2717 max_len = len;2718}2719if(patch->new_name) {2720int len =quote_c_style(patch->new_name, NULL, NULL,0);2721if(!len)2722 len =strlen(patch->new_name);2723if(len > max_len)2724 max_len = len;2725}2726}27272728static voidremove_file(struct patch *patch,int rmdir_empty)2729{2730if(update_index) {2731if(remove_file_from_cache(patch->old_name) <0)2732die("unable to remove%sfrom index", patch->old_name);2733}2734if(!cached) {2735if(S_ISGITLINK(patch->old_mode)) {2736if(rmdir(patch->old_name))2737warning("unable to remove submodule%s",2738 patch->old_name);2739}else if(!unlink(patch->old_name) && rmdir_empty) {2740remove_path(patch->old_name);2741}2742}2743}27442745static voidadd_index_file(const char*path,unsigned mode,void*buf,unsigned long size)2746{2747struct stat st;2748struct cache_entry *ce;2749int namelen =strlen(path);2750unsigned ce_size =cache_entry_size(namelen);27512752if(!update_index)2753return;27542755 ce =xcalloc(1, ce_size);2756memcpy(ce->name, path, namelen);2757 ce->ce_mode =create_ce_mode(mode);2758 ce->ce_flags = namelen;2759if(S_ISGITLINK(mode)) {2760const char*s = buf;27612762if(get_sha1_hex(s +strlen("Subproject commit "), ce->sha1))2763die("corrupt patch for subproject%s", path);2764}else{2765if(!cached) {2766if(lstat(path, &st) <0)2767die("unable to stat newly created file%s",2768 path);2769fill_stat_cache_info(ce, &st);2770}2771if(write_sha1_file(buf, size, blob_type, ce->sha1) <0)2772die("unable to create backing store for newly created file%s", path);2773}2774if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0)2775die("unable to add cache entry for%s", path);2776}27772778static inttry_create_file(const char*path,unsigned int mode,const char*buf,unsigned long size)2779{2780int fd;2781struct strbuf nbuf = STRBUF_INIT;27822783if(S_ISGITLINK(mode)) {2784struct stat st;2785if(!lstat(path, &st) &&S_ISDIR(st.st_mode))2786return0;2787returnmkdir(path,0777);2788}27892790if(has_symlinks &&S_ISLNK(mode))2791/* Although buf:size is counted string, it also is NUL2792 * terminated.2793 */2794returnsymlink(buf, path);27952796 fd =open(path, O_CREAT | O_EXCL | O_WRONLY, (mode &0100) ?0777:0666);2797if(fd <0)2798return-1;27992800if(convert_to_working_tree(path, buf, size, &nbuf)) {2801 size = nbuf.len;2802 buf = nbuf.buf;2803}2804write_or_die(fd, buf, size);2805strbuf_release(&nbuf);28062807if(close(fd) <0)2808die("closing file%s:%s", path,strerror(errno));2809return0;2810}28112812/*2813 * We optimistically assume that the directories exist,2814 * which is true 99% of the time anyway. If they don't,2815 * we create them and try again.2816 */2817static voidcreate_one_file(char*path,unsigned mode,const char*buf,unsigned long size)2818{2819if(cached)2820return;2821if(!try_create_file(path, mode, buf, size))2822return;28232824if(errno == ENOENT) {2825if(safe_create_leading_directories(path))2826return;2827if(!try_create_file(path, mode, buf, size))2828return;2829}28302831if(errno == EEXIST || errno == EACCES) {2832/* We may be trying to create a file where a directory2833 * used to be.2834 */2835struct stat st;2836if(!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))2837 errno = EEXIST;2838}28392840if(errno == EEXIST) {2841unsigned int nr =getpid();28422843for(;;) {2844char newpath[PATH_MAX];2845mksnpath(newpath,sizeof(newpath),"%s~%u", path, nr);2846if(!try_create_file(newpath, mode, buf, size)) {2847if(!rename(newpath, path))2848return;2849unlink(newpath);2850break;2851}2852if(errno != EEXIST)2853break;2854++nr;2855}2856}2857die("unable to write file%smode%o", path, mode);2858}28592860static voidcreate_file(struct patch *patch)2861{2862char*path = patch->new_name;2863unsigned mode = patch->new_mode;2864unsigned long size = patch->resultsize;2865char*buf = patch->result;28662867if(!mode)2868 mode = S_IFREG |0644;2869create_one_file(path, mode, buf, size);2870add_index_file(path, mode, buf, size);2871}28722873/* phase zero is to remove, phase one is to create */2874static voidwrite_out_one_result(struct patch *patch,int phase)2875{2876if(patch->is_delete >0) {2877if(phase ==0)2878remove_file(patch,1);2879return;2880}2881if(patch->is_new >0|| patch->is_copy) {2882if(phase ==1)2883create_file(patch);2884return;2885}2886/*2887 * Rename or modification boils down to the same2888 * thing: remove the old, write the new2889 */2890if(phase ==0)2891remove_file(patch, patch->is_rename);2892if(phase ==1)2893create_file(patch);2894}28952896static intwrite_out_one_reject(struct patch *patch)2897{2898FILE*rej;2899char namebuf[PATH_MAX];2900struct fragment *frag;2901int cnt =0;29022903for(cnt =0, frag = patch->fragments; frag; frag = frag->next) {2904if(!frag->rejected)2905continue;2906 cnt++;2907}29082909if(!cnt) {2910if(apply_verbosely)2911say_patch_name(stderr,2912"Applied patch ", patch," cleanly.\n");2913return0;2914}29152916/* This should not happen, because a removal patch that leaves2917 * contents are marked "rejected" at the patch level.2918 */2919if(!patch->new_name)2920die("internal error");29212922/* Say this even without --verbose */2923say_patch_name(stderr,"Applying patch ", patch," with");2924fprintf(stderr,"%drejects...\n", cnt);29252926 cnt =strlen(patch->new_name);2927if(ARRAY_SIZE(namebuf) <= cnt +5) {2928 cnt =ARRAY_SIZE(namebuf) -5;2929fprintf(stderr,2930"warning: truncating .rej filename to %.*s.rej",2931 cnt -1, patch->new_name);2932}2933memcpy(namebuf, patch->new_name, cnt);2934memcpy(namebuf + cnt,".rej",5);29352936 rej =fopen(namebuf,"w");2937if(!rej)2938returnerror("cannot open%s:%s", namebuf,strerror(errno));29392940/* Normal git tools never deal with .rej, so do not pretend2941 * this is a git patch by saying --git nor give extended2942 * headers. While at it, maybe please "kompare" that wants2943 * the trailing TAB and some garbage at the end of line ;-).2944 */2945fprintf(rej,"diff a/%sb/%s\t(rejected hunks)\n",2946 patch->new_name, patch->new_name);2947for(cnt =1, frag = patch->fragments;2948 frag;2949 cnt++, frag = frag->next) {2950if(!frag->rejected) {2951fprintf(stderr,"Hunk #%dapplied cleanly.\n", cnt);2952continue;2953}2954fprintf(stderr,"Rejected hunk #%d.\n", cnt);2955fprintf(rej,"%.*s", frag->size, frag->patch);2956if(frag->patch[frag->size-1] !='\n')2957fputc('\n', rej);2958}2959fclose(rej);2960return-1;2961}29622963static intwrite_out_results(struct patch *list,int skipped_patch)2964{2965int phase;2966int errs =0;2967struct patch *l;29682969if(!list && !skipped_patch)2970returnerror("No changes");29712972for(phase =0; phase <2; phase++) {2973 l = list;2974while(l) {2975if(l->rejected)2976 errs =1;2977else{2978write_out_one_result(l, phase);2979if(phase ==1&&write_out_one_reject(l))2980 errs =1;2981}2982 l = l->next;2983}2984}2985return errs;2986}29872988static struct lock_file lock_file;29892990static struct string_list limit_by_name;2991static int has_include;2992static voidadd_name_limit(const char*name,int exclude)2993{2994struct string_list_item *it;29952996 it =string_list_append(name, &limit_by_name);2997 it->util = exclude ? NULL : (void*)1;2998}29993000static intuse_patch(struct patch *p)3001{3002const char*pathname = p->new_name ? p->new_name : p->old_name;3003int i;30043005/* Paths outside are not touched regardless of "--include" */3006if(0< prefix_length) {3007int pathlen =strlen(pathname);3008if(pathlen <= prefix_length ||3009memcmp(prefix, pathname, prefix_length))3010return0;3011}30123013/* See if it matches any of exclude/include rule */3014for(i =0; i < limit_by_name.nr; i++) {3015struct string_list_item *it = &limit_by_name.items[i];3016if(!fnmatch(it->string, pathname,0))3017return(it->util != NULL);3018}30193020/*3021 * If we had any include, a path that does not match any rule is3022 * not used. Otherwise, we saw bunch of exclude rules (or none)3023 * and such a path is used.3024 */3025return!has_include;3026}302730283029static voidprefix_one(char**name)3030{3031char*old_name = *name;3032if(!old_name)3033return;3034*name =xstrdup(prefix_filename(prefix, prefix_length, *name));3035free(old_name);3036}30373038static voidprefix_patches(struct patch *p)3039{3040if(!prefix || p->is_toplevel_relative)3041return;3042for( ; p; p = p->next) {3043if(p->new_name == p->old_name) {3044char*prefixed = p->new_name;3045prefix_one(&prefixed);3046 p->new_name = p->old_name = prefixed;3047}3048else{3049prefix_one(&p->new_name);3050prefix_one(&p->old_name);3051}3052}3053}30543055#define INACCURATE_EOF (1<<0)3056#define RECOUNT (1<<1)30573058static intapply_patch(int fd,const char*filename,int options)3059{3060size_t offset;3061struct strbuf buf = STRBUF_INIT;3062struct patch *list = NULL, **listp = &list;3063int skipped_patch =0;30643065/* FIXME - memory leak when using multiple patch files as inputs */3066memset(&fn_table,0,sizeof(struct string_list));3067 patch_input_file = filename;3068read_patch_file(&buf, fd);3069 offset =0;3070while(offset < buf.len) {3071struct patch *patch;3072int nr;30733074 patch =xcalloc(1,sizeof(*patch));3075 patch->inaccurate_eof = !!(options & INACCURATE_EOF);3076 patch->recount = !!(options & RECOUNT);3077 nr =parse_chunk(buf.buf + offset, buf.len - offset, patch);3078if(nr <0)3079break;3080if(apply_in_reverse)3081reverse_patches(patch);3082if(prefix)3083prefix_patches(patch);3084if(use_patch(patch)) {3085patch_stats(patch);3086*listp = patch;3087 listp = &patch->next;3088}3089else{3090/* perhaps free it a bit better? */3091free(patch);3092 skipped_patch++;3093}3094 offset += nr;3095}30963097if(whitespace_error && (ws_error_action == die_on_ws_error))3098 apply =0;30993100 update_index = check_index && apply;3101if(update_index && newfd <0)3102 newfd =hold_locked_index(&lock_file,1);31033104if(check_index) {3105if(read_cache() <0)3106die("unable to read index file");3107}31083109if((check || apply) &&3110check_patch_list(list) <0&&3111!apply_with_reject)3112exit(1);31133114if(apply &&write_out_results(list, skipped_patch))3115exit(1);31163117if(fake_ancestor)3118build_fake_ancestor(list, fake_ancestor);31193120if(diffstat)3121stat_patch_list(list);31223123if(numstat)3124numstat_patch_list(list);31253126if(summary)3127summary_patch_list(list);31283129strbuf_release(&buf);3130return0;3131}31323133static intgit_apply_config(const char*var,const char*value,void*cb)3134{3135if(!strcmp(var,"apply.whitespace"))3136returngit_config_string(&apply_default_whitespace, var, value);3137returngit_default_config(var, value, cb);3138}313931403141intcmd_apply(int argc,const char**argv,const char*unused_prefix)3142{3143int i;3144int read_stdin =1;3145int options =0;3146int errs =0;3147int is_not_gitdir;31483149const char*whitespace_option = NULL;31503151 prefix =setup_git_directory_gently(&is_not_gitdir);3152 prefix_length = prefix ?strlen(prefix) :0;3153git_config(git_apply_config, NULL);3154if(apply_default_whitespace)3155parse_whitespace_option(apply_default_whitespace);31563157for(i =1; i < argc; i++) {3158const char*arg = argv[i];3159char*end;3160int fd;31613162if(!strcmp(arg,"-")) {3163 errs |=apply_patch(0,"<stdin>", options);3164 read_stdin =0;3165continue;3166}3167if(!prefixcmp(arg,"--exclude=")) {3168add_name_limit(arg +10,1);3169continue;3170}3171if(!prefixcmp(arg,"--include=")) {3172add_name_limit(arg +10,0);3173 has_include =1;3174continue;3175}3176if(!prefixcmp(arg,"-p")) {3177 p_value =atoi(arg +2);3178 p_value_known =1;3179continue;3180}3181if(!strcmp(arg,"--no-add")) {3182 no_add =1;3183continue;3184}3185if(!strcmp(arg,"--stat")) {3186 apply =0;3187 diffstat =1;3188continue;3189}3190if(!strcmp(arg,"--allow-binary-replacement") ||3191!strcmp(arg,"--binary")) {3192continue;/* now no-op */3193}3194if(!strcmp(arg,"--numstat")) {3195 apply =0;3196 numstat =1;3197continue;3198}3199if(!strcmp(arg,"--summary")) {3200 apply =0;3201 summary =1;3202continue;3203}3204if(!strcmp(arg,"--check")) {3205 apply =0;3206 check =1;3207continue;3208}3209if(!strcmp(arg,"--index")) {3210if(is_not_gitdir)3211die("--index outside a repository");3212 check_index =1;3213continue;3214}3215if(!strcmp(arg,"--cached")) {3216if(is_not_gitdir)3217die("--cached outside a repository");3218 check_index =1;3219 cached =1;3220continue;3221}3222if(!strcmp(arg,"--apply")) {3223 apply =1;3224continue;3225}3226if(!strcmp(arg,"--build-fake-ancestor")) {3227 apply =0;3228if(++i >= argc)3229die("need a filename");3230 fake_ancestor = argv[i];3231continue;3232}3233if(!strcmp(arg,"-z")) {3234 line_termination =0;3235continue;3236}3237if(!prefixcmp(arg,"-C")) {3238 p_context =strtoul(arg +2, &end,0);3239if(*end !='\0')3240die("unrecognized context count '%s'", arg +2);3241continue;3242}3243if(!prefixcmp(arg,"--whitespace=")) {3244 whitespace_option = arg +13;3245parse_whitespace_option(arg +13);3246continue;3247}3248if(!strcmp(arg,"-R") || !strcmp(arg,"--reverse")) {3249 apply_in_reverse =1;3250continue;3251}3252if(!strcmp(arg,"--unidiff-zero")) {3253 unidiff_zero =1;3254continue;3255}3256if(!strcmp(arg,"--reject")) {3257 apply = apply_with_reject = apply_verbosely =1;3258continue;3259}3260if(!strcmp(arg,"-v") || !strcmp(arg,"--verbose")) {3261 apply_verbosely =1;3262continue;3263}3264if(!strcmp(arg,"--inaccurate-eof")) {3265 options |= INACCURATE_EOF;3266continue;3267}3268if(!strcmp(arg,"--recount")) {3269 options |= RECOUNT;3270continue;3271}3272if(!prefixcmp(arg,"--directory=")) {3273 arg +=strlen("--directory=");3274 root_len =strlen(arg);3275if(root_len && arg[root_len -1] !='/') {3276char*new_root;3277 root = new_root =xmalloc(root_len +2);3278strcpy(new_root, arg);3279strcpy(new_root + root_len++,"/");3280}else3281 root = arg;3282continue;3283}3284if(0< prefix_length)3285 arg =prefix_filename(prefix, prefix_length, arg);32863287 fd =open(arg, O_RDONLY);3288if(fd <0)3289die("can't open patch '%s':%s", arg,strerror(errno));3290 read_stdin =0;3291set_default_whitespace_mode(whitespace_option);3292 errs |=apply_patch(fd, arg, options);3293close(fd);3294}3295set_default_whitespace_mode(whitespace_option);3296if(read_stdin)3297 errs |=apply_patch(0,"<stdin>", options);3298if(whitespace_error) {3299if(squelch_whitespace_errors &&3300 squelch_whitespace_errors < whitespace_error) {3301int squelched =3302 whitespace_error - squelch_whitespace_errors;3303fprintf(stderr,"warning: squelched%d"3304"whitespace error%s\n",3305 squelched,3306 squelched ==1?"":"s");3307}3308if(ws_error_action == die_on_ws_error)3309die("%dline%sadd%swhitespace errors.",3310 whitespace_error,3311 whitespace_error ==1?"":"s",3312 whitespace_error ==1?"s":"");3313if(applied_after_fixing_ws && apply)3314fprintf(stderr,"warning:%dline%sapplied after"3315" fixing whitespace errors.\n",3316 applied_after_fixing_ws,3317 applied_after_fixing_ws ==1?"":"s");3318else if(whitespace_error)3319fprintf(stderr,"warning:%dline%sadd%swhitespace errors.\n",3320 whitespace_error,3321 whitespace_error ==1?"":"s",3322 whitespace_error ==1?"s":"");3323}33243325if(update_index) {3326if(write_cache(newfd, active_cache, active_nr) ||3327commit_locked_index(&lock_file))3328die("Unable to write new index file");3329}33303331return!!errs;3332}