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; 325 326/* 327 * Proposed "new-style" GNU patch/diff format; see 328 * http://marc.theaimsgroup.com/?l=git&m=112927316408690&w=2 329 */ 330strbuf_init(&name,0); 331if(!unquote_c_style(&name, line, NULL)) { 332char*cp; 333 334for(cp = name.buf; p_value; p_value--) { 335 cp =strchr(cp,'/'); 336if(!cp) 337break; 338 cp++; 339} 340if(cp) { 341/* name can later be freed, so we need 342 * to memmove, not just return cp 343 */ 344strbuf_remove(&name,0, cp - name.buf); 345free(def); 346if(root) 347strbuf_insert(&name,0, root, root_len); 348returnstrbuf_detach(&name, NULL); 349} 350} 351strbuf_release(&name); 352} 353 354for(;;) { 355char c = *line; 356 357if(isspace(c)) { 358if(c =='\n') 359break; 360if(name_terminate(start, line-start, c, terminate)) 361break; 362} 363 line++; 364if(c =='/'&& !--p_value) 365 start = line; 366} 367if(!start) 368return def; 369 len = line - start; 370if(!len) 371return def; 372 373/* 374 * Generally we prefer the shorter name, especially 375 * if the other one is just a variation of that with 376 * something else tacked on to the end (ie "file.orig" 377 * or "file~"). 378 */ 379if(def) { 380int deflen =strlen(def); 381if(deflen < len && !strncmp(start, def, deflen)) 382return def; 383free(def); 384} 385 386if(root) { 387char*ret =xmalloc(root_len + len +1); 388strcpy(ret, root); 389memcpy(ret + root_len, start, len); 390 ret[root_len + len] ='\0'; 391return ret; 392} 393 394returnxmemdupz(start, len); 395} 396 397static intcount_slashes(const char*cp) 398{ 399int cnt =0; 400char ch; 401 402while((ch = *cp++)) 403if(ch =='/') 404 cnt++; 405return cnt; 406} 407 408/* 409 * Given the string after "--- " or "+++ ", guess the appropriate 410 * p_value for the given patch. 411 */ 412static intguess_p_value(const char*nameline) 413{ 414char*name, *cp; 415int val = -1; 416 417if(is_dev_null(nameline)) 418return-1; 419 name =find_name(nameline, NULL,0, TERM_SPACE | TERM_TAB); 420if(!name) 421return-1; 422 cp =strchr(name,'/'); 423if(!cp) 424 val =0; 425else if(prefix) { 426/* 427 * Does it begin with "a/$our-prefix" and such? Then this is 428 * very likely to apply to our directory. 429 */ 430if(!strncmp(name, prefix, prefix_length)) 431 val =count_slashes(prefix); 432else{ 433 cp++; 434if(!strncmp(cp, prefix, prefix_length)) 435 val =count_slashes(prefix) +1; 436} 437} 438free(name); 439return val; 440} 441 442/* 443 * Get the name etc info from the ---/+++ lines of a traditional patch header 444 * 445 * FIXME! The end-of-filename heuristics are kind of screwy. For existing 446 * files, we can happily check the index for a match, but for creating a 447 * new file we should try to match whatever "patch" does. I have no idea. 448 */ 449static voidparse_traditional_patch(const char*first,const char*second,struct patch *patch) 450{ 451char*name; 452 453 first +=4;/* skip "--- " */ 454 second +=4;/* skip "+++ " */ 455if(!p_value_known) { 456int p, q; 457 p =guess_p_value(first); 458 q =guess_p_value(second); 459if(p <0) p = q; 460if(0<= p && p == q) { 461 p_value = p; 462 p_value_known =1; 463} 464} 465if(is_dev_null(first)) { 466 patch->is_new =1; 467 patch->is_delete =0; 468 name =find_name(second, NULL, p_value, TERM_SPACE | TERM_TAB); 469 patch->new_name = name; 470}else if(is_dev_null(second)) { 471 patch->is_new =0; 472 patch->is_delete =1; 473 name =find_name(first, NULL, p_value, TERM_SPACE | TERM_TAB); 474 patch->old_name = name; 475}else{ 476 name =find_name(first, NULL, p_value, TERM_SPACE | TERM_TAB); 477 name =find_name(second, name, p_value, TERM_SPACE | TERM_TAB); 478 patch->old_name = patch->new_name = name; 479} 480if(!name) 481die("unable to find filename in patch at line%d", linenr); 482} 483 484static intgitdiff_hdrend(const char*line,struct patch *patch) 485{ 486return-1; 487} 488 489/* 490 * We're anal about diff header consistency, to make 491 * sure that we don't end up having strange ambiguous 492 * patches floating around. 493 * 494 * As a result, gitdiff_{old|new}name() will check 495 * their names against any previous information, just 496 * to make sure.. 497 */ 498static char*gitdiff_verify_name(const char*line,int isnull,char*orig_name,const char*oldnew) 499{ 500if(!orig_name && !isnull) 501returnfind_name(line, NULL, p_value, TERM_TAB); 502 503if(orig_name) { 504int len; 505const char*name; 506char*another; 507 name = orig_name; 508 len =strlen(name); 509if(isnull) 510die("git apply: bad git-diff - expected /dev/null, got%son line%d", name, linenr); 511 another =find_name(line, NULL, p_value, TERM_TAB); 512if(!another ||memcmp(another, name, len)) 513die("git apply: bad git-diff - inconsistent%sfilename on line%d", oldnew, linenr); 514free(another); 515return orig_name; 516} 517else{ 518/* expect "/dev/null" */ 519if(memcmp("/dev/null", line,9) || line[9] !='\n') 520die("git apply: bad git-diff - expected /dev/null on line%d", linenr); 521return NULL; 522} 523} 524 525static intgitdiff_oldname(const char*line,struct patch *patch) 526{ 527 patch->old_name =gitdiff_verify_name(line, patch->is_new, patch->old_name,"old"); 528return0; 529} 530 531static intgitdiff_newname(const char*line,struct patch *patch) 532{ 533 patch->new_name =gitdiff_verify_name(line, patch->is_delete, patch->new_name,"new"); 534return0; 535} 536 537static intgitdiff_oldmode(const char*line,struct patch *patch) 538{ 539 patch->old_mode =strtoul(line, NULL,8); 540return0; 541} 542 543static intgitdiff_newmode(const char*line,struct patch *patch) 544{ 545 patch->new_mode =strtoul(line, NULL,8); 546return0; 547} 548 549static intgitdiff_delete(const char*line,struct patch *patch) 550{ 551 patch->is_delete =1; 552 patch->old_name = patch->def_name; 553returngitdiff_oldmode(line, patch); 554} 555 556static intgitdiff_newfile(const char*line,struct patch *patch) 557{ 558 patch->is_new =1; 559 patch->new_name = patch->def_name; 560returngitdiff_newmode(line, patch); 561} 562 563static intgitdiff_copysrc(const char*line,struct patch *patch) 564{ 565 patch->is_copy =1; 566 patch->old_name =find_name(line, NULL,0,0); 567return0; 568} 569 570static intgitdiff_copydst(const char*line,struct patch *patch) 571{ 572 patch->is_copy =1; 573 patch->new_name =find_name(line, NULL,0,0); 574return0; 575} 576 577static intgitdiff_renamesrc(const char*line,struct patch *patch) 578{ 579 patch->is_rename =1; 580 patch->old_name =find_name(line, NULL,0,0); 581return0; 582} 583 584static intgitdiff_renamedst(const char*line,struct patch *patch) 585{ 586 patch->is_rename =1; 587 patch->new_name =find_name(line, NULL,0,0); 588return0; 589} 590 591static intgitdiff_similarity(const char*line,struct patch *patch) 592{ 593if((patch->score =strtoul(line, NULL,10)) == ULONG_MAX) 594 patch->score =0; 595return0; 596} 597 598static intgitdiff_dissimilarity(const char*line,struct patch *patch) 599{ 600if((patch->score =strtoul(line, NULL,10)) == ULONG_MAX) 601 patch->score =0; 602return0; 603} 604 605static intgitdiff_index(const char*line,struct patch *patch) 606{ 607/* 608 * index line is N hexadecimal, "..", N hexadecimal, 609 * and optional space with octal mode. 610 */ 611const char*ptr, *eol; 612int len; 613 614 ptr =strchr(line,'.'); 615if(!ptr || ptr[1] !='.'||40< ptr - line) 616return0; 617 len = ptr - line; 618memcpy(patch->old_sha1_prefix, line, len); 619 patch->old_sha1_prefix[len] =0; 620 621 line = ptr +2; 622 ptr =strchr(line,' '); 623 eol =strchr(line,'\n'); 624 625if(!ptr || eol < ptr) 626 ptr = eol; 627 len = ptr - line; 628 629if(40< len) 630return0; 631memcpy(patch->new_sha1_prefix, line, len); 632 patch->new_sha1_prefix[len] =0; 633if(*ptr ==' ') 634 patch->new_mode = patch->old_mode =strtoul(ptr+1, NULL,8); 635return0; 636} 637 638/* 639 * This is normal for a diff that doesn't change anything: we'll fall through 640 * into the next diff. Tell the parser to break out. 641 */ 642static intgitdiff_unrecognized(const char*line,struct patch *patch) 643{ 644return-1; 645} 646 647static const char*stop_at_slash(const char*line,int llen) 648{ 649int i; 650 651for(i =0; i < llen; i++) { 652int ch = line[i]; 653if(ch =='/') 654return line + i; 655} 656return NULL; 657} 658 659/* 660 * This is to extract the same name that appears on "diff --git" 661 * line. We do not find and return anything if it is a rename 662 * patch, and it is OK because we will find the name elsewhere. 663 * We need to reliably find name only when it is mode-change only, 664 * creation or deletion of an empty file. In any of these cases, 665 * both sides are the same name under a/ and b/ respectively. 666 */ 667static char*git_header_name(char*line,int llen) 668{ 669const char*name; 670const char*second = NULL; 671size_t len; 672 673 line +=strlen("diff --git "); 674 llen -=strlen("diff --git "); 675 676if(*line =='"') { 677const char*cp; 678struct strbuf first; 679struct strbuf sp; 680 681strbuf_init(&first,0); 682strbuf_init(&sp,0); 683 684if(unquote_c_style(&first, line, &second)) 685goto free_and_fail1; 686 687/* advance to the first slash */ 688 cp =stop_at_slash(first.buf, first.len); 689/* we do not accept absolute paths */ 690if(!cp || cp == first.buf) 691goto free_and_fail1; 692strbuf_remove(&first,0, cp +1- first.buf); 693 694/* 695 * second points at one past closing dq of name. 696 * find the second name. 697 */ 698while((second < line + llen) &&isspace(*second)) 699 second++; 700 701if(line + llen <= second) 702goto free_and_fail1; 703if(*second =='"') { 704if(unquote_c_style(&sp, second, NULL)) 705goto free_and_fail1; 706 cp =stop_at_slash(sp.buf, sp.len); 707if(!cp || cp == sp.buf) 708goto free_and_fail1; 709/* They must match, otherwise ignore */ 710if(strcmp(cp +1, first.buf)) 711goto free_and_fail1; 712strbuf_release(&sp); 713returnstrbuf_detach(&first, NULL); 714} 715 716/* unquoted second */ 717 cp =stop_at_slash(second, line + llen - second); 718if(!cp || cp == second) 719goto free_and_fail1; 720 cp++; 721if(line + llen - cp != first.len +1|| 722memcmp(first.buf, cp, first.len)) 723goto free_and_fail1; 724returnstrbuf_detach(&first, NULL); 725 726 free_and_fail1: 727strbuf_release(&first); 728strbuf_release(&sp); 729return NULL; 730} 731 732/* unquoted first name */ 733 name =stop_at_slash(line, llen); 734if(!name || name == line) 735return NULL; 736 name++; 737 738/* 739 * since the first name is unquoted, a dq if exists must be 740 * the beginning of the second name. 741 */ 742for(second = name; second < line + llen; second++) { 743if(*second =='"') { 744struct strbuf sp; 745const char*np; 746 747strbuf_init(&sp,0); 748if(unquote_c_style(&sp, second, NULL)) 749goto free_and_fail2; 750 751 np =stop_at_slash(sp.buf, sp.len); 752if(!np || np == sp.buf) 753goto free_and_fail2; 754 np++; 755 756 len = sp.buf + sp.len - np; 757if(len < second - name && 758!strncmp(np, name, len) && 759isspace(name[len])) { 760/* Good */ 761strbuf_remove(&sp,0, np - sp.buf); 762returnstrbuf_detach(&sp, NULL); 763} 764 765 free_and_fail2: 766strbuf_release(&sp); 767return NULL; 768} 769} 770 771/* 772 * Accept a name only if it shows up twice, exactly the same 773 * form. 774 */ 775for(len =0; ; len++) { 776switch(name[len]) { 777default: 778continue; 779case'\n': 780return NULL; 781case'\t':case' ': 782 second = name+len; 783for(;;) { 784char c = *second++; 785if(c =='\n') 786return NULL; 787if(c =='/') 788break; 789} 790if(second[len] =='\n'&& !memcmp(name, second, len)) { 791returnxmemdupz(name, len); 792} 793} 794} 795} 796 797/* Verify that we recognize the lines following a git header */ 798static intparse_git_header(char*line,int len,unsigned int size,struct patch *patch) 799{ 800unsigned long offset; 801 802/* A git diff has explicit new/delete information, so we don't guess */ 803 patch->is_new =0; 804 patch->is_delete =0; 805 806/* 807 * Some things may not have the old name in the 808 * rest of the headers anywhere (pure mode changes, 809 * or removing or adding empty files), so we get 810 * the default name from the header. 811 */ 812 patch->def_name =git_header_name(line, len); 813if(patch->def_name && root) { 814char*s =xmalloc(root_len +strlen(patch->def_name) +1); 815strcpy(s, root); 816strcpy(s + root_len, patch->def_name); 817free(patch->def_name); 818 patch->def_name = s; 819} 820 821 line += len; 822 size -= len; 823 linenr++; 824for(offset = len ; size >0; offset += len, size -= len, line += len, linenr++) { 825static const struct opentry { 826const char*str; 827int(*fn)(const char*,struct patch *); 828} optable[] = { 829{"@@ -", gitdiff_hdrend }, 830{"--- ", gitdiff_oldname }, 831{"+++ ", gitdiff_newname }, 832{"old mode ", gitdiff_oldmode }, 833{"new mode ", gitdiff_newmode }, 834{"deleted file mode ", gitdiff_delete }, 835{"new file mode ", gitdiff_newfile }, 836{"copy from ", gitdiff_copysrc }, 837{"copy to ", gitdiff_copydst }, 838{"rename old ", gitdiff_renamesrc }, 839{"rename new ", gitdiff_renamedst }, 840{"rename from ", gitdiff_renamesrc }, 841{"rename to ", gitdiff_renamedst }, 842{"similarity index ", gitdiff_similarity }, 843{"dissimilarity index ", gitdiff_dissimilarity }, 844{"index ", gitdiff_index }, 845{"", gitdiff_unrecognized }, 846}; 847int i; 848 849 len =linelen(line, size); 850if(!len || line[len-1] !='\n') 851break; 852for(i =0; i <ARRAY_SIZE(optable); i++) { 853const struct opentry *p = optable + i; 854int oplen =strlen(p->str); 855if(len < oplen ||memcmp(p->str, line, oplen)) 856continue; 857if(p->fn(line + oplen, patch) <0) 858return offset; 859break; 860} 861} 862 863return offset; 864} 865 866static intparse_num(const char*line,unsigned long*p) 867{ 868char*ptr; 869 870if(!isdigit(*line)) 871return0; 872*p =strtoul(line, &ptr,10); 873return ptr - line; 874} 875 876static intparse_range(const char*line,int len,int offset,const char*expect, 877unsigned long*p1,unsigned long*p2) 878{ 879int digits, ex; 880 881if(offset <0|| offset >= len) 882return-1; 883 line += offset; 884 len -= offset; 885 886 digits =parse_num(line, p1); 887if(!digits) 888return-1; 889 890 offset += digits; 891 line += digits; 892 len -= digits; 893 894*p2 =1; 895if(*line ==',') { 896 digits =parse_num(line+1, p2); 897if(!digits) 898return-1; 899 900 offset += digits+1; 901 line += digits+1; 902 len -= digits+1; 903} 904 905 ex =strlen(expect); 906if(ex > len) 907return-1; 908if(memcmp(line, expect, ex)) 909return-1; 910 911return offset + ex; 912} 913 914static voidrecount_diff(char*line,int size,struct fragment *fragment) 915{ 916int oldlines =0, newlines =0, ret =0; 917 918if(size <1) { 919warning("recount: ignore empty hunk"); 920return; 921} 922 923for(;;) { 924int len =linelen(line, size); 925 size -= len; 926 line += len; 927 928if(size <1) 929break; 930 931switch(*line) { 932case' ':case'\n': 933 newlines++; 934/* fall through */ 935case'-': 936 oldlines++; 937continue; 938case'+': 939 newlines++; 940continue; 941case'\\': 942continue; 943case'@': 944 ret = size <3||prefixcmp(line,"@@ "); 945break; 946case'd': 947 ret = size <5||prefixcmp(line,"diff "); 948break; 949default: 950 ret = -1; 951break; 952} 953if(ret) { 954warning("recount: unexpected line: %.*s", 955(int)linelen(line, size), line); 956return; 957} 958break; 959} 960 fragment->oldlines = oldlines; 961 fragment->newlines = newlines; 962} 963 964/* 965 * Parse a unified diff fragment header of the 966 * form "@@ -a,b +c,d @@" 967 */ 968static intparse_fragment_header(char*line,int len,struct fragment *fragment) 969{ 970int offset; 971 972if(!len || line[len-1] !='\n') 973return-1; 974 975/* Figure out the number of lines in a fragment */ 976 offset =parse_range(line, len,4," +", &fragment->oldpos, &fragment->oldlines); 977 offset =parse_range(line, len, offset," @@", &fragment->newpos, &fragment->newlines); 978 979return offset; 980} 981 982static intfind_header(char*line,unsigned long size,int*hdrsize,struct patch *patch) 983{ 984unsigned long offset, len; 985 986 patch->is_toplevel_relative =0; 987 patch->is_rename = patch->is_copy =0; 988 patch->is_new = patch->is_delete = -1; 989 patch->old_mode = patch->new_mode =0; 990 patch->old_name = patch->new_name = NULL; 991for(offset =0; size >0; offset += len, size -= len, line += len, linenr++) { 992unsigned long nextlen; 993 994 len =linelen(line, size); 995if(!len) 996break; 997 998/* Testing this early allows us to take a few shortcuts.. */ 999if(len <6)1000continue;10011002/*1003 * Make sure we don't find any unconnected patch fragments.1004 * That's a sign that we didn't find a header, and that a1005 * patch has become corrupted/broken up.1006 */1007if(!memcmp("@@ -", line,4)) {1008struct fragment dummy;1009if(parse_fragment_header(line, len, &dummy) <0)1010continue;1011die("patch fragment without header at line%d: %.*s",1012 linenr, (int)len-1, line);1013}10141015if(size < len +6)1016break;10171018/*1019 * Git patch? It might not have a real patch, just a rename1020 * or mode change, so we handle that specially1021 */1022if(!memcmp("diff --git ", line,11)) {1023int git_hdr_len =parse_git_header(line, len, size, patch);1024if(git_hdr_len <= len)1025continue;1026if(!patch->old_name && !patch->new_name) {1027if(!patch->def_name)1028die("git diff header lacks filename information (line%d)", linenr);1029 patch->old_name = patch->new_name = patch->def_name;1030}1031 patch->is_toplevel_relative =1;1032*hdrsize = git_hdr_len;1033return offset;1034}10351036/* --- followed by +++ ? */1037if(memcmp("--- ", line,4) ||memcmp("+++ ", line + len,4))1038continue;10391040/*1041 * We only accept unified patches, so we want it to1042 * at least have "@@ -a,b +c,d @@\n", which is 14 chars1043 * minimum ("@@ -0,0 +1 @@\n" is the shortest).1044 */1045 nextlen =linelen(line + len, size - len);1046if(size < nextlen +14||memcmp("@@ -", line + len + nextlen,4))1047continue;10481049/* Ok, we'll consider it a patch */1050parse_traditional_patch(line, line+len, patch);1051*hdrsize = len + nextlen;1052 linenr +=2;1053return offset;1054}1055return-1;1056}10571058static voidcheck_whitespace(const char*line,int len,unsigned ws_rule)1059{1060char*err;1061unsigned result =ws_check(line +1, len -1, ws_rule);1062if(!result)1063return;10641065 whitespace_error++;1066if(squelch_whitespace_errors &&1067 squelch_whitespace_errors < whitespace_error)1068;1069else{1070 err =whitespace_error_string(result);1071fprintf(stderr,"%s:%d:%s.\n%.*s\n",1072 patch_input_file, linenr, err, len -2, line +1);1073free(err);1074}1075}10761077/*1078 * Parse a unified diff. Note that this really needs to parse each1079 * fragment separately, since the only way to know the difference1080 * between a "---" that is part of a patch, and a "---" that starts1081 * the next patch is to look at the line counts..1082 */1083static intparse_fragment(char*line,unsigned long size,1084struct patch *patch,struct fragment *fragment)1085{1086int added, deleted;1087int len =linelen(line, size), offset;1088unsigned long oldlines, newlines;1089unsigned long leading, trailing;10901091 offset =parse_fragment_header(line, len, fragment);1092if(offset <0)1093return-1;1094if(offset >0&& patch->recount)1095recount_diff(line + offset, size - offset, fragment);1096 oldlines = fragment->oldlines;1097 newlines = fragment->newlines;1098 leading =0;1099 trailing =0;11001101/* Parse the thing.. */1102 line += len;1103 size -= len;1104 linenr++;1105 added = deleted =0;1106for(offset = len;11070< size;1108 offset += len, size -= len, line += len, linenr++) {1109if(!oldlines && !newlines)1110break;1111 len =linelen(line, size);1112if(!len || line[len-1] !='\n')1113return-1;1114switch(*line) {1115default:1116return-1;1117case'\n':/* newer GNU diff, an empty context line */1118case' ':1119 oldlines--;1120 newlines--;1121if(!deleted && !added)1122 leading++;1123 trailing++;1124break;1125case'-':1126if(apply_in_reverse &&1127 ws_error_action != nowarn_ws_error)1128check_whitespace(line, len, patch->ws_rule);1129 deleted++;1130 oldlines--;1131 trailing =0;1132break;1133case'+':1134if(!apply_in_reverse &&1135 ws_error_action != nowarn_ws_error)1136check_whitespace(line, len, patch->ws_rule);1137 added++;1138 newlines--;1139 trailing =0;1140break;11411142/*1143 * We allow "\ No newline at end of file". Depending1144 * on locale settings when the patch was produced we1145 * don't know what this line looks like. The only1146 * thing we do know is that it begins with "\ ".1147 * Checking for 12 is just for sanity check -- any1148 * l10n of "\ No newline..." is at least that long.1149 */1150case'\\':1151if(len <12||memcmp(line,"\\",2))1152return-1;1153break;1154}1155}1156if(oldlines || newlines)1157return-1;1158 fragment->leading = leading;1159 fragment->trailing = trailing;11601161/*1162 * If a fragment ends with an incomplete line, we failed to include1163 * it in the above loop because we hit oldlines == newlines == 01164 * before seeing it.1165 */1166if(12< size && !memcmp(line,"\\",2))1167 offset +=linelen(line, size);11681169 patch->lines_added += added;1170 patch->lines_deleted += deleted;11711172if(0< patch->is_new && oldlines)1173returnerror("new file depends on old contents");1174if(0< patch->is_delete && newlines)1175returnerror("deleted file still has contents");1176return offset;1177}11781179static intparse_single_patch(char*line,unsigned long size,struct patch *patch)1180{1181unsigned long offset =0;1182unsigned long oldlines =0, newlines =0, context =0;1183struct fragment **fragp = &patch->fragments;11841185while(size >4&& !memcmp(line,"@@ -",4)) {1186struct fragment *fragment;1187int len;11881189 fragment =xcalloc(1,sizeof(*fragment));1190 len =parse_fragment(line, size, patch, fragment);1191if(len <=0)1192die("corrupt patch at line%d", linenr);1193 fragment->patch = line;1194 fragment->size = len;1195 oldlines += fragment->oldlines;1196 newlines += fragment->newlines;1197 context += fragment->leading + fragment->trailing;11981199*fragp = fragment;1200 fragp = &fragment->next;12011202 offset += len;1203 line += len;1204 size -= len;1205}12061207/*1208 * If something was removed (i.e. we have old-lines) it cannot1209 * be creation, and if something was added it cannot be1210 * deletion. However, the reverse is not true; --unified=01211 * patches that only add are not necessarily creation even1212 * though they do not have any old lines, and ones that only1213 * delete are not necessarily deletion.1214 *1215 * Unfortunately, a real creation/deletion patch do _not_ have1216 * any context line by definition, so we cannot safely tell it1217 * apart with --unified=0 insanity. At least if the patch has1218 * more than one hunk it is not creation or deletion.1219 */1220if(patch->is_new <0&&1221(oldlines || (patch->fragments && patch->fragments->next)))1222 patch->is_new =0;1223if(patch->is_delete <0&&1224(newlines || (patch->fragments && patch->fragments->next)))1225 patch->is_delete =0;12261227if(0< patch->is_new && oldlines)1228die("new file%sdepends on old contents", patch->new_name);1229if(0< patch->is_delete && newlines)1230die("deleted file%sstill has contents", patch->old_name);1231if(!patch->is_delete && !newlines && context)1232fprintf(stderr,"** warning: file%sbecomes empty but "1233"is not deleted\n", patch->new_name);12341235return offset;1236}12371238staticinlineintmetadata_changes(struct patch *patch)1239{1240return patch->is_rename >0||1241 patch->is_copy >0||1242 patch->is_new >0||1243 patch->is_delete ||1244(patch->old_mode && patch->new_mode &&1245 patch->old_mode != patch->new_mode);1246}12471248static char*inflate_it(const void*data,unsigned long size,1249unsigned long inflated_size)1250{1251 z_stream stream;1252void*out;1253int st;12541255memset(&stream,0,sizeof(stream));12561257 stream.next_in = (unsigned char*)data;1258 stream.avail_in = size;1259 stream.next_out = out =xmalloc(inflated_size);1260 stream.avail_out = inflated_size;1261git_inflate_init(&stream);1262 st =git_inflate(&stream, Z_FINISH);1263git_inflate_end(&stream);1264if((st != Z_STREAM_END) || stream.total_out != inflated_size) {1265free(out);1266return NULL;1267}1268return out;1269}12701271static struct fragment *parse_binary_hunk(char**buf_p,1272unsigned long*sz_p,1273int*status_p,1274int*used_p)1275{1276/*1277 * Expect a line that begins with binary patch method ("literal"1278 * or "delta"), followed by the length of data before deflating.1279 * a sequence of 'length-byte' followed by base-85 encoded data1280 * should follow, terminated by a newline.1281 *1282 * Each 5-byte sequence of base-85 encodes up to 4 bytes,1283 * and we would limit the patch line to 66 characters,1284 * so one line can fit up to 13 groups that would decode1285 * to 52 bytes max. The length byte 'A'-'Z' corresponds1286 * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.1287 */1288int llen, used;1289unsigned long size = *sz_p;1290char*buffer = *buf_p;1291int patch_method;1292unsigned long origlen;1293char*data = NULL;1294int hunk_size =0;1295struct fragment *frag;12961297 llen =linelen(buffer, size);1298 used = llen;12991300*status_p =0;13011302if(!prefixcmp(buffer,"delta ")) {1303 patch_method = BINARY_DELTA_DEFLATED;1304 origlen =strtoul(buffer +6, NULL,10);1305}1306else if(!prefixcmp(buffer,"literal ")) {1307 patch_method = BINARY_LITERAL_DEFLATED;1308 origlen =strtoul(buffer +8, NULL,10);1309}1310else1311return NULL;13121313 linenr++;1314 buffer += llen;1315while(1) {1316int byte_length, max_byte_length, newsize;1317 llen =linelen(buffer, size);1318 used += llen;1319 linenr++;1320if(llen ==1) {1321/* consume the blank line */1322 buffer++;1323 size--;1324break;1325}1326/*1327 * Minimum line is "A00000\n" which is 7-byte long,1328 * and the line length must be multiple of 5 plus 2.1329 */1330if((llen <7) || (llen-2) %5)1331goto corrupt;1332 max_byte_length = (llen -2) /5*4;1333 byte_length = *buffer;1334if('A'<= byte_length && byte_length <='Z')1335 byte_length = byte_length -'A'+1;1336else if('a'<= byte_length && byte_length <='z')1337 byte_length = byte_length -'a'+27;1338else1339goto corrupt;1340/* if the input length was not multiple of 4, we would1341 * have filler at the end but the filler should never1342 * exceed 3 bytes1343 */1344if(max_byte_length < byte_length ||1345 byte_length <= max_byte_length -4)1346goto corrupt;1347 newsize = hunk_size + byte_length;1348 data =xrealloc(data, newsize);1349if(decode_85(data + hunk_size, buffer +1, byte_length))1350goto corrupt;1351 hunk_size = newsize;1352 buffer += llen;1353 size -= llen;1354}13551356 frag =xcalloc(1,sizeof(*frag));1357 frag->patch =inflate_it(data, hunk_size, origlen);1358if(!frag->patch)1359goto corrupt;1360free(data);1361 frag->size = origlen;1362*buf_p = buffer;1363*sz_p = size;1364*used_p = used;1365 frag->binary_patch_method = patch_method;1366return frag;13671368 corrupt:1369free(data);1370*status_p = -1;1371error("corrupt binary patch at line%d: %.*s",1372 linenr-1, llen-1, buffer);1373return NULL;1374}13751376static intparse_binary(char*buffer,unsigned long size,struct patch *patch)1377{1378/*1379 * We have read "GIT binary patch\n"; what follows is a line1380 * that says the patch method (currently, either "literal" or1381 * "delta") and the length of data before deflating; a1382 * sequence of 'length-byte' followed by base-85 encoded data1383 * follows.1384 *1385 * When a binary patch is reversible, there is another binary1386 * hunk in the same format, starting with patch method (either1387 * "literal" or "delta") with the length of data, and a sequence1388 * of length-byte + base-85 encoded data, terminated with another1389 * empty line. This data, when applied to the postimage, produces1390 * the preimage.1391 */1392struct fragment *forward;1393struct fragment *reverse;1394int status;1395int used, used_1;13961397 forward =parse_binary_hunk(&buffer, &size, &status, &used);1398if(!forward && !status)1399/* there has to be one hunk (forward hunk) */1400returnerror("unrecognized binary patch at line%d", linenr-1);1401if(status)1402/* otherwise we already gave an error message */1403return status;14041405 reverse =parse_binary_hunk(&buffer, &size, &status, &used_1);1406if(reverse)1407 used += used_1;1408else if(status) {1409/*1410 * Not having reverse hunk is not an error, but having1411 * a corrupt reverse hunk is.1412 */1413free((void*) forward->patch);1414free(forward);1415return status;1416}1417 forward->next = reverse;1418 patch->fragments = forward;1419 patch->is_binary =1;1420return used;1421}14221423static intparse_chunk(char*buffer,unsigned long size,struct patch *patch)1424{1425int hdrsize, patchsize;1426int offset =find_header(buffer, size, &hdrsize, patch);14271428if(offset <0)1429return offset;14301431 patch->ws_rule =whitespace_rule(patch->new_name1432? patch->new_name1433: patch->old_name);14341435 patchsize =parse_single_patch(buffer + offset + hdrsize,1436 size - offset - hdrsize, patch);14371438if(!patchsize) {1439static const char*binhdr[] = {1440"Binary files ",1441"Files ",1442 NULL,1443};1444static const char git_binary[] ="GIT binary patch\n";1445int i;1446int hd = hdrsize + offset;1447unsigned long llen =linelen(buffer + hd, size - hd);14481449if(llen ==sizeof(git_binary) -1&&1450!memcmp(git_binary, buffer + hd, llen)) {1451int used;1452 linenr++;1453 used =parse_binary(buffer + hd + llen,1454 size - hd - llen, patch);1455if(used)1456 patchsize = used + llen;1457else1458 patchsize =0;1459}1460else if(!memcmp(" differ\n", buffer + hd + llen -8,8)) {1461for(i =0; binhdr[i]; i++) {1462int len =strlen(binhdr[i]);1463if(len < size - hd &&1464!memcmp(binhdr[i], buffer + hd, len)) {1465 linenr++;1466 patch->is_binary =1;1467 patchsize = llen;1468break;1469}1470}1471}14721473/* Empty patch cannot be applied if it is a text patch1474 * without metadata change. A binary patch appears1475 * empty to us here.1476 */1477if((apply || check) &&1478(!patch->is_binary && !metadata_changes(patch)))1479die("patch with only garbage at line%d", linenr);1480}14811482return offset + hdrsize + patchsize;1483}14841485#define swap(a,b) myswap((a),(b),sizeof(a))14861487#define myswap(a, b, size) do { \1488 unsigned char mytmp[size]; \1489 memcpy(mytmp, &a, size); \1490 memcpy(&a, &b, size); \1491 memcpy(&b, mytmp, size); \1492} while (0)14931494static voidreverse_patches(struct patch *p)1495{1496for(; p; p = p->next) {1497struct fragment *frag = p->fragments;14981499swap(p->new_name, p->old_name);1500swap(p->new_mode, p->old_mode);1501swap(p->is_new, p->is_delete);1502swap(p->lines_added, p->lines_deleted);1503swap(p->old_sha1_prefix, p->new_sha1_prefix);15041505for(; frag; frag = frag->next) {1506swap(frag->newpos, frag->oldpos);1507swap(frag->newlines, frag->oldlines);1508}1509}1510}15111512static const char pluses[] =1513"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";1514static const char minuses[]=1515"----------------------------------------------------------------------";15161517static voidshow_stats(struct patch *patch)1518{1519struct strbuf qname;1520char*cp = patch->new_name ? patch->new_name : patch->old_name;1521int max, add, del;15221523strbuf_init(&qname,0);1524quote_c_style(cp, &qname, NULL,0);15251526/*1527 * "scale" the filename1528 */1529 max = max_len;1530if(max >50)1531 max =50;15321533if(qname.len > max) {1534 cp =strchr(qname.buf + qname.len +3- max,'/');1535if(!cp)1536 cp = qname.buf + qname.len +3- max;1537strbuf_splice(&qname,0, cp - qname.buf,"...",3);1538}15391540if(patch->is_binary) {1541printf(" %-*s | Bin\n", max, qname.buf);1542strbuf_release(&qname);1543return;1544}15451546printf(" %-*s |", max, qname.buf);1547strbuf_release(&qname);15481549/*1550 * scale the add/delete1551 */1552 max = max + max_change >70?70- max : max_change;1553 add = patch->lines_added;1554 del = patch->lines_deleted;15551556if(max_change >0) {1557int total = ((add + del) * max + max_change /2) / max_change;1558 add = (add * max + max_change /2) / max_change;1559 del = total - add;1560}1561printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,1562 add, pluses, del, minuses);1563}15641565static intread_old_data(struct stat *st,const char*path,struct strbuf *buf)1566{1567switch(st->st_mode & S_IFMT) {1568case S_IFLNK:1569strbuf_grow(buf, st->st_size);1570if(readlink(path, buf->buf, st->st_size) != st->st_size)1571return-1;1572strbuf_setlen(buf, st->st_size);1573return0;1574case S_IFREG:1575if(strbuf_read_file(buf, path, st->st_size) != st->st_size)1576returnerror("unable to open or read%s", path);1577convert_to_git(path, buf->buf, buf->len, buf,0);1578return0;1579default:1580return-1;1581}1582}15831584static voidupdate_pre_post_images(struct image *preimage,1585struct image *postimage,1586char*buf,1587size_t len)1588{1589int i, ctx;1590char*new, *old, *fixed;1591struct image fixed_preimage;15921593/*1594 * Update the preimage with whitespace fixes. Note that we1595 * are not losing preimage->buf -- apply_one_fragment() will1596 * free "oldlines".1597 */1598prepare_image(&fixed_preimage, buf, len,1);1599assert(fixed_preimage.nr == preimage->nr);1600for(i =0; i < preimage->nr; i++)1601 fixed_preimage.line[i].flag = preimage->line[i].flag;1602free(preimage->line_allocated);1603*preimage = fixed_preimage;16041605/*1606 * Adjust the common context lines in postimage, in place.1607 * This is possible because whitespace fixing does not make1608 * the string grow.1609 */1610new= old = postimage->buf;1611 fixed = preimage->buf;1612for(i = ctx =0; i < postimage->nr; i++) {1613size_t len = postimage->line[i].len;1614if(!(postimage->line[i].flag & LINE_COMMON)) {1615/* an added line -- no counterparts in preimage */1616memmove(new, old, len);1617 old += len;1618new+= len;1619continue;1620}16211622/* a common context -- skip it in the original postimage */1623 old += len;16241625/* and find the corresponding one in the fixed preimage */1626while(ctx < preimage->nr &&1627!(preimage->line[ctx].flag & LINE_COMMON)) {1628 fixed += preimage->line[ctx].len;1629 ctx++;1630}1631if(preimage->nr <= ctx)1632die("oops");16331634/* and copy it in, while fixing the line length */1635 len = preimage->line[ctx].len;1636memcpy(new, fixed, len);1637new+= len;1638 fixed += len;1639 postimage->line[i].len = len;1640 ctx++;1641}16421643/* Fix the length of the whole thing */1644 postimage->len =new- postimage->buf;1645}16461647static intmatch_fragment(struct image *img,1648struct image *preimage,1649struct image *postimage,1650unsigned longtry,1651int try_lno,1652unsigned ws_rule,1653int match_beginning,int match_end)1654{1655int i;1656char*fixed_buf, *buf, *orig, *target;16571658if(preimage->nr + try_lno > img->nr)1659return0;16601661if(match_beginning && try_lno)1662return0;16631664if(match_end && preimage->nr + try_lno != img->nr)1665return0;16661667/* Quick hash check */1668for(i =0; i < preimage->nr; i++)1669if(preimage->line[i].hash != img->line[try_lno + i].hash)1670return0;16711672/*1673 * Do we have an exact match? If we were told to match1674 * at the end, size must be exactly at try+fragsize,1675 * otherwise try+fragsize must be still within the preimage,1676 * and either case, the old piece should match the preimage1677 * exactly.1678 */1679if((match_end1680? (try+ preimage->len == img->len)1681: (try+ preimage->len <= img->len)) &&1682!memcmp(img->buf +try, preimage->buf, preimage->len))1683return1;16841685if(ws_error_action != correct_ws_error)1686return0;16871688/*1689 * The hunk does not apply byte-by-byte, but the hash says1690 * it might with whitespace fuzz.1691 */1692 fixed_buf =xmalloc(preimage->len +1);1693 buf = fixed_buf;1694 orig = preimage->buf;1695 target = img->buf +try;1696for(i =0; i < preimage->nr; i++) {1697size_t fixlen;/* length after fixing the preimage */1698size_t oldlen = preimage->line[i].len;1699size_t tgtlen = img->line[try_lno + i].len;1700size_t tgtfixlen;/* length after fixing the target line */1701char tgtfixbuf[1024], *tgtfix;1702int match;17031704/* Try fixing the line in the preimage */1705 fixlen =ws_fix_copy(buf, orig, oldlen, ws_rule, NULL);17061707/* Try fixing the line in the target */1708if(sizeof(tgtfixbuf) > tgtlen)1709 tgtfix = tgtfixbuf;1710else1711 tgtfix =xmalloc(tgtlen);1712 tgtfixlen =ws_fix_copy(tgtfix, target, tgtlen, ws_rule, NULL);17131714/*1715 * If they match, either the preimage was based on1716 * a version before our tree fixed whitespace breakage,1717 * or we are lacking a whitespace-fix patch the tree1718 * the preimage was based on already had (i.e. target1719 * has whitespace breakage, the preimage doesn't).1720 * In either case, we are fixing the whitespace breakages1721 * so we might as well take the fix together with their1722 * real change.1723 */1724 match = (tgtfixlen == fixlen && !memcmp(tgtfix, buf, fixlen));17251726if(tgtfix != tgtfixbuf)1727free(tgtfix);1728if(!match)1729goto unmatch_exit;17301731 orig += oldlen;1732 buf += fixlen;1733 target += tgtlen;1734}17351736/*1737 * Yes, the preimage is based on an older version that still1738 * has whitespace breakages unfixed, and fixing them makes the1739 * hunk match. Update the context lines in the postimage.1740 */1741update_pre_post_images(preimage, postimage,1742 fixed_buf, buf - fixed_buf);1743return1;17441745 unmatch_exit:1746free(fixed_buf);1747return0;1748}17491750static intfind_pos(struct image *img,1751struct image *preimage,1752struct image *postimage,1753int line,1754unsigned ws_rule,1755int match_beginning,int match_end)1756{1757int i;1758unsigned long backwards, forwards,try;1759int backwards_lno, forwards_lno, try_lno;17601761if(preimage->nr > img->nr)1762return-1;17631764/*1765 * If match_begining or match_end is specified, there is no1766 * point starting from a wrong line that will never match and1767 * wander around and wait for a match at the specified end.1768 */1769if(match_beginning)1770 line =0;1771else if(match_end)1772 line = img->nr - preimage->nr;17731774if(line > img->nr)1775 line = img->nr;17761777try=0;1778for(i =0; i < line; i++)1779try+= img->line[i].len;17801781/*1782 * There's probably some smart way to do this, but I'll leave1783 * that to the smart and beautiful people. I'm simple and stupid.1784 */1785 backwards =try;1786 backwards_lno = line;1787 forwards =try;1788 forwards_lno = line;1789 try_lno = line;17901791for(i =0; ; i++) {1792if(match_fragment(img, preimage, postimage,1793try, try_lno, ws_rule,1794 match_beginning, match_end))1795return try_lno;17961797 again:1798if(backwards_lno ==0&& forwards_lno == img->nr)1799break;18001801if(i &1) {1802if(backwards_lno ==0) {1803 i++;1804goto again;1805}1806 backwards_lno--;1807 backwards -= img->line[backwards_lno].len;1808try= backwards;1809 try_lno = backwards_lno;1810}else{1811if(forwards_lno == img->nr) {1812 i++;1813goto again;1814}1815 forwards += img->line[forwards_lno].len;1816 forwards_lno++;1817try= forwards;1818 try_lno = forwards_lno;1819}18201821}1822return-1;1823}18241825static voidremove_first_line(struct image *img)1826{1827 img->buf += img->line[0].len;1828 img->len -= img->line[0].len;1829 img->line++;1830 img->nr--;1831}18321833static voidremove_last_line(struct image *img)1834{1835 img->len -= img->line[--img->nr].len;1836}18371838static voidupdate_image(struct image *img,1839int applied_pos,1840struct image *preimage,1841struct image *postimage)1842{1843/*1844 * remove the copy of preimage at offset in img1845 * and replace it with postimage1846 */1847int i, nr;1848size_t remove_count, insert_count, applied_at =0;1849char*result;18501851for(i =0; i < applied_pos; i++)1852 applied_at += img->line[i].len;18531854 remove_count =0;1855for(i =0; i < preimage->nr; i++)1856 remove_count += img->line[applied_pos + i].len;1857 insert_count = postimage->len;18581859/* Adjust the contents */1860 result =xmalloc(img->len + insert_count - remove_count +1);1861memcpy(result, img->buf, applied_at);1862memcpy(result + applied_at, postimage->buf, postimage->len);1863memcpy(result + applied_at + postimage->len,1864 img->buf + (applied_at + remove_count),1865 img->len - (applied_at + remove_count));1866free(img->buf);1867 img->buf = result;1868 img->len += insert_count - remove_count;1869 result[img->len] ='\0';18701871/* Adjust the line table */1872 nr = img->nr + postimage->nr - preimage->nr;1873if(preimage->nr < postimage->nr) {1874/*1875 * NOTE: this knows that we never call remove_first_line()1876 * on anything other than pre/post image.1877 */1878 img->line =xrealloc(img->line, nr *sizeof(*img->line));1879 img->line_allocated = img->line;1880}1881if(preimage->nr != postimage->nr)1882memmove(img->line + applied_pos + postimage->nr,1883 img->line + applied_pos + preimage->nr,1884(img->nr - (applied_pos + preimage->nr)) *1885sizeof(*img->line));1886memcpy(img->line + applied_pos,1887 postimage->line,1888 postimage->nr *sizeof(*img->line));1889 img->nr = nr;1890}18911892static intapply_one_fragment(struct image *img,struct fragment *frag,1893int inaccurate_eof,unsigned ws_rule)1894{1895int match_beginning, match_end;1896const char*patch = frag->patch;1897int size = frag->size;1898char*old, *new, *oldlines, *newlines;1899int new_blank_lines_at_end =0;1900unsigned long leading, trailing;1901int pos, applied_pos;1902struct image preimage;1903struct image postimage;19041905memset(&preimage,0,sizeof(preimage));1906memset(&postimage,0,sizeof(postimage));1907 oldlines =xmalloc(size);1908 newlines =xmalloc(size);19091910 old = oldlines;1911new= newlines;1912while(size >0) {1913char first;1914int len =linelen(patch, size);1915int plen, added;1916int added_blank_line =0;19171918if(!len)1919break;19201921/*1922 * "plen" is how much of the line we should use for1923 * the actual patch data. Normally we just remove the1924 * first character on the line, but if the line is1925 * followed by "\ No newline", then we also remove the1926 * last one (which is the newline, of course).1927 */1928 plen = len -1;1929if(len < size && patch[len] =='\\')1930 plen--;1931 first = *patch;1932if(apply_in_reverse) {1933if(first =='-')1934 first ='+';1935else if(first =='+')1936 first ='-';1937}19381939switch(first) {1940case'\n':1941/* Newer GNU diff, empty context line */1942if(plen <0)1943/* ... followed by '\No newline'; nothing */1944break;1945*old++ ='\n';1946*new++ ='\n';1947add_line_info(&preimage,"\n",1, LINE_COMMON);1948add_line_info(&postimage,"\n",1, LINE_COMMON);1949break;1950case' ':1951case'-':1952memcpy(old, patch +1, plen);1953add_line_info(&preimage, old, plen,1954(first ==' '? LINE_COMMON :0));1955 old += plen;1956if(first =='-')1957break;1958/* Fall-through for ' ' */1959case'+':1960/* --no-add does not add new lines */1961if(first =='+'&& no_add)1962break;19631964if(first !='+'||1965!whitespace_error ||1966 ws_error_action != correct_ws_error) {1967memcpy(new, patch +1, plen);1968 added = plen;1969}1970else{1971 added =ws_fix_copy(new, patch +1, plen, ws_rule, &applied_after_fixing_ws);1972}1973add_line_info(&postimage,new, added,1974(first =='+'?0: LINE_COMMON));1975new+= added;1976if(first =='+'&&1977 added ==1&&new[-1] =='\n')1978 added_blank_line =1;1979break;1980case'@':case'\\':1981/* Ignore it, we already handled it */1982break;1983default:1984if(apply_verbosely)1985error("invalid start of line: '%c'", first);1986return-1;1987}1988if(added_blank_line)1989 new_blank_lines_at_end++;1990else1991 new_blank_lines_at_end =0;1992 patch += len;1993 size -= len;1994}1995if(inaccurate_eof &&1996 old > oldlines && old[-1] =='\n'&&1997new> newlines &&new[-1] =='\n') {1998 old--;1999new--;2000}20012002 leading = frag->leading;2003 trailing = frag->trailing;20042005/*2006 * A hunk to change lines at the beginning would begin with2007 * @@ -1,L +N,M @@2008 * but we need to be careful. -U0 that inserts before the second2009 * line also has this pattern.2010 *2011 * And a hunk to add to an empty file would begin with2012 * @@ -0,0 +N,M @@2013 *2014 * In other words, a hunk that is (frag->oldpos <= 1) with or2015 * without leading context must match at the beginning.2016 */2017 match_beginning = (!frag->oldpos ||2018(frag->oldpos ==1&& !unidiff_zero));20192020/*2021 * A hunk without trailing lines must match at the end.2022 * However, we simply cannot tell if a hunk must match end2023 * from the lack of trailing lines if the patch was generated2024 * with unidiff without any context.2025 */2026 match_end = !unidiff_zero && !trailing;20272028 pos = frag->newpos ? (frag->newpos -1) :0;2029 preimage.buf = oldlines;2030 preimage.len = old - oldlines;2031 postimage.buf = newlines;2032 postimage.len =new- newlines;2033 preimage.line = preimage.line_allocated;2034 postimage.line = postimage.line_allocated;20352036for(;;) {20372038 applied_pos =find_pos(img, &preimage, &postimage, pos,2039 ws_rule, match_beginning, match_end);20402041if(applied_pos >=0)2042break;20432044/* Am I at my context limits? */2045if((leading <= p_context) && (trailing <= p_context))2046break;2047if(match_beginning || match_end) {2048 match_beginning = match_end =0;2049continue;2050}20512052/*2053 * Reduce the number of context lines; reduce both2054 * leading and trailing if they are equal otherwise2055 * just reduce the larger context.2056 */2057if(leading >= trailing) {2058remove_first_line(&preimage);2059remove_first_line(&postimage);2060 pos--;2061 leading--;2062}2063if(trailing > leading) {2064remove_last_line(&preimage);2065remove_last_line(&postimage);2066 trailing--;2067}2068}20692070if(applied_pos >=0) {2071if(ws_error_action == correct_ws_error &&2072 new_blank_lines_at_end &&2073 postimage.nr + applied_pos == img->nr) {2074/*2075 * If the patch application adds blank lines2076 * at the end, and if the patch applies at the2077 * end of the image, remove those added blank2078 * lines.2079 */2080while(new_blank_lines_at_end--)2081remove_last_line(&postimage);2082}20832084/*2085 * Warn if it was necessary to reduce the number2086 * of context lines.2087 */2088if((leading != frag->leading) ||2089(trailing != frag->trailing))2090fprintf(stderr,"Context reduced to (%ld/%ld)"2091" to apply fragment at%d\n",2092 leading, trailing, applied_pos+1);2093update_image(img, applied_pos, &preimage, &postimage);2094}else{2095if(apply_verbosely)2096error("while searching for:\n%.*s",2097(int)(old - oldlines), oldlines);2098}20992100free(oldlines);2101free(newlines);2102free(preimage.line_allocated);2103free(postimage.line_allocated);21042105return(applied_pos <0);2106}21072108static intapply_binary_fragment(struct image *img,struct patch *patch)2109{2110struct fragment *fragment = patch->fragments;2111unsigned long len;2112void*dst;21132114/* Binary patch is irreversible without the optional second hunk */2115if(apply_in_reverse) {2116if(!fragment->next)2117returnerror("cannot reverse-apply a binary patch "2118"without the reverse hunk to '%s'",2119 patch->new_name2120? patch->new_name : patch->old_name);2121 fragment = fragment->next;2122}2123switch(fragment->binary_patch_method) {2124case BINARY_DELTA_DEFLATED:2125 dst =patch_delta(img->buf, img->len, fragment->patch,2126 fragment->size, &len);2127if(!dst)2128return-1;2129clear_image(img);2130 img->buf = dst;2131 img->len = len;2132return0;2133case BINARY_LITERAL_DEFLATED:2134clear_image(img);2135 img->len = fragment->size;2136 img->buf =xmalloc(img->len+1);2137memcpy(img->buf, fragment->patch, img->len);2138 img->buf[img->len] ='\0';2139return0;2140}2141return-1;2142}21432144static intapply_binary(struct image *img,struct patch *patch)2145{2146const char*name = patch->old_name ? patch->old_name : patch->new_name;2147unsigned char sha1[20];21482149/*2150 * For safety, we require patch index line to contain2151 * full 40-byte textual SHA1 for old and new, at least for now.2152 */2153if(strlen(patch->old_sha1_prefix) !=40||2154strlen(patch->new_sha1_prefix) !=40||2155get_sha1_hex(patch->old_sha1_prefix, sha1) ||2156get_sha1_hex(patch->new_sha1_prefix, sha1))2157returnerror("cannot apply binary patch to '%s' "2158"without full index line", name);21592160if(patch->old_name) {2161/*2162 * See if the old one matches what the patch2163 * applies to.2164 */2165hash_sha1_file(img->buf, img->len, blob_type, sha1);2166if(strcmp(sha1_to_hex(sha1), patch->old_sha1_prefix))2167returnerror("the patch applies to '%s' (%s), "2168"which does not match the "2169"current contents.",2170 name,sha1_to_hex(sha1));2171}2172else{2173/* Otherwise, the old one must be empty. */2174if(img->len)2175returnerror("the patch applies to an empty "2176"'%s' but it is not empty", name);2177}21782179get_sha1_hex(patch->new_sha1_prefix, sha1);2180if(is_null_sha1(sha1)) {2181clear_image(img);2182return0;/* deletion patch */2183}21842185if(has_sha1_file(sha1)) {2186/* We already have the postimage */2187enum object_type type;2188unsigned long size;2189char*result;21902191 result =read_sha1_file(sha1, &type, &size);2192if(!result)2193returnerror("the necessary postimage%sfor "2194"'%s' cannot be read",2195 patch->new_sha1_prefix, name);2196clear_image(img);2197 img->buf = result;2198 img->len = size;2199}else{2200/*2201 * We have verified buf matches the preimage;2202 * apply the patch data to it, which is stored2203 * in the patch->fragments->{patch,size}.2204 */2205if(apply_binary_fragment(img, patch))2206returnerror("binary patch does not apply to '%s'",2207 name);22082209/* verify that the result matches */2210hash_sha1_file(img->buf, img->len, blob_type, sha1);2211if(strcmp(sha1_to_hex(sha1), patch->new_sha1_prefix))2212returnerror("binary patch to '%s' creates incorrect result (expecting%s, got%s)",2213 name, patch->new_sha1_prefix,sha1_to_hex(sha1));2214}22152216return0;2217}22182219static intapply_fragments(struct image *img,struct patch *patch)2220{2221struct fragment *frag = patch->fragments;2222const char*name = patch->old_name ? patch->old_name : patch->new_name;2223unsigned ws_rule = patch->ws_rule;2224unsigned inaccurate_eof = patch->inaccurate_eof;22252226if(patch->is_binary)2227returnapply_binary(img, patch);22282229while(frag) {2230if(apply_one_fragment(img, frag, inaccurate_eof, ws_rule)) {2231error("patch failed:%s:%ld", name, frag->oldpos);2232if(!apply_with_reject)2233return-1;2234 frag->rejected =1;2235}2236 frag = frag->next;2237}2238return0;2239}22402241static intread_file_or_gitlink(struct cache_entry *ce,struct strbuf *buf)2242{2243if(!ce)2244return0;22452246if(S_ISGITLINK(ce->ce_mode)) {2247strbuf_grow(buf,100);2248strbuf_addf(buf,"Subproject commit%s\n",sha1_to_hex(ce->sha1));2249}else{2250enum object_type type;2251unsigned long sz;2252char*result;22532254 result =read_sha1_file(ce->sha1, &type, &sz);2255if(!result)2256return-1;2257/* XXX read_sha1_file NUL-terminates */2258strbuf_attach(buf, result, sz, sz +1);2259}2260return0;2261}22622263static struct patch *in_fn_table(const char*name)2264{2265struct string_list_item *item;22662267if(name == NULL)2268return NULL;22692270 item =string_list_lookup(name, &fn_table);2271if(item != NULL)2272return(struct patch *)item->util;22732274return NULL;2275}22762277static voidadd_to_fn_table(struct patch *patch)2278{2279struct string_list_item *item;22802281/*2282 * Always add new_name unless patch is a deletion2283 * This should cover the cases for normal diffs,2284 * file creations and copies2285 */2286if(patch->new_name != NULL) {2287 item =string_list_insert(patch->new_name, &fn_table);2288 item->util = patch;2289}22902291/*2292 * store a failure on rename/deletion cases because2293 * later chunks shouldn't patch old names2294 */2295if((patch->new_name == NULL) || (patch->is_rename)) {2296 item =string_list_insert(patch->old_name, &fn_table);2297 item->util = (struct patch *) -1;2298}2299}23002301static intapply_data(struct patch *patch,struct stat *st,struct cache_entry *ce)2302{2303struct strbuf buf;2304struct image image;2305size_t len;2306char*img;2307struct patch *tpatch;23082309strbuf_init(&buf,0);23102311if(!(patch->is_copy || patch->is_rename) &&2312((tpatch =in_fn_table(patch->old_name)) != NULL)) {2313if(tpatch == (struct patch *) -1) {2314returnerror("patch%shas been renamed/deleted",2315 patch->old_name);2316}2317/* We have a patched copy in memory use that */2318strbuf_add(&buf, tpatch->result, tpatch->resultsize);2319}else if(cached) {2320if(read_file_or_gitlink(ce, &buf))2321returnerror("read of%sfailed", patch->old_name);2322}else if(patch->old_name) {2323if(S_ISGITLINK(patch->old_mode)) {2324if(ce) {2325read_file_or_gitlink(ce, &buf);2326}else{2327/*2328 * There is no way to apply subproject2329 * patch without looking at the index.2330 */2331 patch->fragments = NULL;2332}2333}else{2334if(read_old_data(st, patch->old_name, &buf))2335returnerror("read of%sfailed", patch->old_name);2336}2337}23382339 img =strbuf_detach(&buf, &len);2340prepare_image(&image, img, len, !patch->is_binary);23412342if(apply_fragments(&image, patch) <0)2343return-1;/* note with --reject this succeeds. */2344 patch->result = image.buf;2345 patch->resultsize = image.len;2346add_to_fn_table(patch);2347free(image.line_allocated);23482349if(0< patch->is_delete && patch->resultsize)2350returnerror("removal patch leaves file contents");23512352return0;2353}23542355static intcheck_to_create_blob(const char*new_name,int ok_if_exists)2356{2357struct stat nst;2358if(!lstat(new_name, &nst)) {2359if(S_ISDIR(nst.st_mode) || ok_if_exists)2360return0;2361/*2362 * A leading component of new_name might be a symlink2363 * that is going to be removed with this patch, but2364 * still pointing at somewhere that has the path.2365 * In such a case, path "new_name" does not exist as2366 * far as git is concerned.2367 */2368if(has_symlink_leading_path(strlen(new_name), new_name))2369return0;23702371returnerror("%s: already exists in working directory", new_name);2372}2373else if((errno != ENOENT) && (errno != ENOTDIR))2374returnerror("%s:%s", new_name,strerror(errno));2375return0;2376}23772378static intverify_index_match(struct cache_entry *ce,struct stat *st)2379{2380if(S_ISGITLINK(ce->ce_mode)) {2381if(!S_ISDIR(st->st_mode))2382return-1;2383return0;2384}2385returnce_match_stat(ce, st, CE_MATCH_IGNORE_VALID);2386}23872388static intcheck_preimage(struct patch *patch,struct cache_entry **ce,struct stat *st)2389{2390const char*old_name = patch->old_name;2391struct patch *tpatch = NULL;2392int stat_ret =0;2393unsigned st_mode =0;23942395/*2396 * Make sure that we do not have local modifications from the2397 * index when we are looking at the index. Also make sure2398 * we have the preimage file to be patched in the work tree,2399 * unless --cached, which tells git to apply only in the index.2400 */2401if(!old_name)2402return0;24032404assert(patch->is_new <=0);24052406if(!(patch->is_copy || patch->is_rename) &&2407(tpatch =in_fn_table(old_name)) != NULL) {2408if(tpatch == (struct patch *) -1) {2409returnerror("%s: has been deleted/renamed", old_name);2410}2411 st_mode = tpatch->new_mode;2412}else if(!cached) {2413 stat_ret =lstat(old_name, st);2414if(stat_ret && errno != ENOENT)2415returnerror("%s:%s", old_name,strerror(errno));2416}24172418if(check_index && !tpatch) {2419int pos =cache_name_pos(old_name,strlen(old_name));2420if(pos <0) {2421if(patch->is_new <0)2422goto is_new;2423returnerror("%s: does not exist in index", old_name);2424}2425*ce = active_cache[pos];2426if(stat_ret <0) {2427struct checkout costate;2428/* checkout */2429 costate.base_dir ="";2430 costate.base_dir_len =0;2431 costate.force =0;2432 costate.quiet =0;2433 costate.not_new =0;2434 costate.refresh_cache =1;2435if(checkout_entry(*ce, &costate, NULL) ||2436lstat(old_name, st))2437return-1;2438}2439if(!cached &&verify_index_match(*ce, st))2440returnerror("%s: does not match index", old_name);2441if(cached)2442 st_mode = (*ce)->ce_mode;2443}else if(stat_ret <0) {2444if(patch->is_new <0)2445goto is_new;2446returnerror("%s:%s", old_name,strerror(errno));2447}24482449if(!cached)2450 st_mode =ce_mode_from_stat(*ce, st->st_mode);24512452if(patch->is_new <0)2453 patch->is_new =0;2454if(!patch->old_mode)2455 patch->old_mode = st_mode;2456if((st_mode ^ patch->old_mode) & S_IFMT)2457returnerror("%s: wrong type", old_name);2458if(st_mode != patch->old_mode)2459fprintf(stderr,"warning:%shas type%o, expected%o\n",2460 old_name, st_mode, patch->old_mode);2461return0;24622463 is_new:2464 patch->is_new =1;2465 patch->is_delete =0;2466 patch->old_name = NULL;2467return0;2468}24692470static intcheck_patch(struct patch *patch)2471{2472struct stat st;2473const char*old_name = patch->old_name;2474const char*new_name = patch->new_name;2475const char*name = old_name ? old_name : new_name;2476struct cache_entry *ce = NULL;2477int ok_if_exists;2478int status;24792480 patch->rejected =1;/* we will drop this after we succeed */24812482 status =check_preimage(patch, &ce, &st);2483if(status)2484return status;2485 old_name = patch->old_name;24862487if(in_fn_table(new_name) == (struct patch *) -1)2488/*2489 * A type-change diff is always split into a patch to2490 * delete old, immediately followed by a patch to2491 * create new (see diff.c::run_diff()); in such a case2492 * it is Ok that the entry to be deleted by the2493 * previous patch is still in the working tree and in2494 * the index.2495 */2496 ok_if_exists =1;2497else2498 ok_if_exists =0;24992500if(new_name &&2501((0< patch->is_new) | (0< patch->is_rename) | patch->is_copy)) {2502if(check_index &&2503cache_name_pos(new_name,strlen(new_name)) >=0&&2504!ok_if_exists)2505returnerror("%s: already exists in index", new_name);2506if(!cached) {2507int err =check_to_create_blob(new_name, ok_if_exists);2508if(err)2509return err;2510}2511if(!patch->new_mode) {2512if(0< patch->is_new)2513 patch->new_mode = S_IFREG |0644;2514else2515 patch->new_mode = patch->old_mode;2516}2517}25182519if(new_name && old_name) {2520int same = !strcmp(old_name, new_name);2521if(!patch->new_mode)2522 patch->new_mode = patch->old_mode;2523if((patch->old_mode ^ patch->new_mode) & S_IFMT)2524returnerror("new mode (%o) of%sdoes not match old mode (%o)%s%s",2525 patch->new_mode, new_name, patch->old_mode,2526 same ?"":" of ", same ?"": old_name);2527}25282529if(apply_data(patch, &st, ce) <0)2530returnerror("%s: patch does not apply", name);2531 patch->rejected =0;2532return0;2533}25342535static intcheck_patch_list(struct patch *patch)2536{2537int err =0;25382539while(patch) {2540if(apply_verbosely)2541say_patch_name(stderr,2542"Checking patch ", patch,"...\n");2543 err |=check_patch(patch);2544 patch = patch->next;2545}2546return err;2547}25482549/* This function tries to read the sha1 from the current index */2550static intget_current_sha1(const char*path,unsigned char*sha1)2551{2552int pos;25532554if(read_cache() <0)2555return-1;2556 pos =cache_name_pos(path,strlen(path));2557if(pos <0)2558return-1;2559hashcpy(sha1, active_cache[pos]->sha1);2560return0;2561}25622563/* Build an index that contains the just the files needed for a 3way merge */2564static voidbuild_fake_ancestor(struct patch *list,const char*filename)2565{2566struct patch *patch;2567struct index_state result = {0};2568int fd;25692570/* Once we start supporting the reverse patch, it may be2571 * worth showing the new sha1 prefix, but until then...2572 */2573for(patch = list; patch; patch = patch->next) {2574const unsigned char*sha1_ptr;2575unsigned char sha1[20];2576struct cache_entry *ce;2577const char*name;25782579 name = patch->old_name ? patch->old_name : patch->new_name;2580if(0< patch->is_new)2581continue;2582else if(get_sha1(patch->old_sha1_prefix, sha1))2583/* git diff has no index line for mode/type changes */2584if(!patch->lines_added && !patch->lines_deleted) {2585if(get_current_sha1(patch->new_name, sha1) ||2586get_current_sha1(patch->old_name, sha1))2587die("mode change for%s, which is not "2588"in current HEAD", name);2589 sha1_ptr = sha1;2590}else2591die("sha1 information is lacking or useless "2592"(%s).", name);2593else2594 sha1_ptr = sha1;25952596 ce =make_cache_entry(patch->old_mode, sha1_ptr, name,0,0);2597if(!ce)2598die("make_cache_entry failed for path '%s'", name);2599if(add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD))2600die("Could not add%sto temporary index", name);2601}26022603 fd =open(filename, O_WRONLY | O_CREAT,0666);2604if(fd <0||write_index(&result, fd) ||close(fd))2605die("Could not write temporary index to%s", filename);26062607discard_index(&result);2608}26092610static voidstat_patch_list(struct patch *patch)2611{2612int files, adds, dels;26132614for(files = adds = dels =0; patch ; patch = patch->next) {2615 files++;2616 adds += patch->lines_added;2617 dels += patch->lines_deleted;2618show_stats(patch);2619}26202621printf("%dfiles changed,%dinsertions(+),%ddeletions(-)\n", files, adds, dels);2622}26232624static voidnumstat_patch_list(struct patch *patch)2625{2626for( ; patch; patch = patch->next) {2627const char*name;2628 name = patch->new_name ? patch->new_name : patch->old_name;2629if(patch->is_binary)2630printf("-\t-\t");2631else2632printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);2633write_name_quoted(name, stdout, line_termination);2634}2635}26362637static voidshow_file_mode_name(const char*newdelete,unsigned int mode,const char*name)2638{2639if(mode)2640printf("%smode%06o%s\n", newdelete, mode, name);2641else2642printf("%s %s\n", newdelete, name);2643}26442645static voidshow_mode_change(struct patch *p,int show_name)2646{2647if(p->old_mode && p->new_mode && p->old_mode != p->new_mode) {2648if(show_name)2649printf(" mode change%06o =>%06o%s\n",2650 p->old_mode, p->new_mode, p->new_name);2651else2652printf(" mode change%06o =>%06o\n",2653 p->old_mode, p->new_mode);2654}2655}26562657static voidshow_rename_copy(struct patch *p)2658{2659const char*renamecopy = p->is_rename ?"rename":"copy";2660const char*old, *new;26612662/* Find common prefix */2663 old = p->old_name;2664new= p->new_name;2665while(1) {2666const char*slash_old, *slash_new;2667 slash_old =strchr(old,'/');2668 slash_new =strchr(new,'/');2669if(!slash_old ||2670!slash_new ||2671 slash_old - old != slash_new -new||2672memcmp(old,new, slash_new -new))2673break;2674 old = slash_old +1;2675new= slash_new +1;2676}2677/* p->old_name thru old is the common prefix, and old and new2678 * through the end of names are renames2679 */2680if(old != p->old_name)2681printf("%s%.*s{%s=>%s} (%d%%)\n", renamecopy,2682(int)(old - p->old_name), p->old_name,2683 old,new, p->score);2684else2685printf("%s %s=>%s(%d%%)\n", renamecopy,2686 p->old_name, p->new_name, p->score);2687show_mode_change(p,0);2688}26892690static voidsummary_patch_list(struct patch *patch)2691{2692struct patch *p;26932694for(p = patch; p; p = p->next) {2695if(p->is_new)2696show_file_mode_name("create", p->new_mode, p->new_name);2697else if(p->is_delete)2698show_file_mode_name("delete", p->old_mode, p->old_name);2699else{2700if(p->is_rename || p->is_copy)2701show_rename_copy(p);2702else{2703if(p->score) {2704printf(" rewrite%s(%d%%)\n",2705 p->new_name, p->score);2706show_mode_change(p,0);2707}2708else2709show_mode_change(p,1);2710}2711}2712}2713}27142715static voidpatch_stats(struct patch *patch)2716{2717int lines = patch->lines_added + patch->lines_deleted;27182719if(lines > max_change)2720 max_change = lines;2721if(patch->old_name) {2722int len =quote_c_style(patch->old_name, NULL, NULL,0);2723if(!len)2724 len =strlen(patch->old_name);2725if(len > max_len)2726 max_len = len;2727}2728if(patch->new_name) {2729int len =quote_c_style(patch->new_name, NULL, NULL,0);2730if(!len)2731 len =strlen(patch->new_name);2732if(len > max_len)2733 max_len = len;2734}2735}27362737static voidremove_file(struct patch *patch,int rmdir_empty)2738{2739if(update_index) {2740if(remove_file_from_cache(patch->old_name) <0)2741die("unable to remove%sfrom index", patch->old_name);2742}2743if(!cached) {2744if(S_ISGITLINK(patch->old_mode)) {2745if(rmdir(patch->old_name))2746warning("unable to remove submodule%s",2747 patch->old_name);2748}else if(!unlink(patch->old_name) && rmdir_empty) {2749remove_path(patch->old_name);2750}2751}2752}27532754static voidadd_index_file(const char*path,unsigned mode,void*buf,unsigned long size)2755{2756struct stat st;2757struct cache_entry *ce;2758int namelen =strlen(path);2759unsigned ce_size =cache_entry_size(namelen);27602761if(!update_index)2762return;27632764 ce =xcalloc(1, ce_size);2765memcpy(ce->name, path, namelen);2766 ce->ce_mode =create_ce_mode(mode);2767 ce->ce_flags = namelen;2768if(S_ISGITLINK(mode)) {2769const char*s = buf;27702771if(get_sha1_hex(s +strlen("Subproject commit "), ce->sha1))2772die("corrupt patch for subproject%s", path);2773}else{2774if(!cached) {2775if(lstat(path, &st) <0)2776die("unable to stat newly created file%s",2777 path);2778fill_stat_cache_info(ce, &st);2779}2780if(write_sha1_file(buf, size, blob_type, ce->sha1) <0)2781die("unable to create backing store for newly created file%s", path);2782}2783if(add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) <0)2784die("unable to add cache entry for%s", path);2785}27862787static inttry_create_file(const char*path,unsigned int mode,const char*buf,unsigned long size)2788{2789int fd;2790struct strbuf nbuf;27912792if(S_ISGITLINK(mode)) {2793struct stat st;2794if(!lstat(path, &st) &&S_ISDIR(st.st_mode))2795return0;2796returnmkdir(path,0777);2797}27982799if(has_symlinks &&S_ISLNK(mode))2800/* Although buf:size is counted string, it also is NUL2801 * terminated.2802 */2803returnsymlink(buf, path);28042805 fd =open(path, O_CREAT | O_EXCL | O_WRONLY, (mode &0100) ?0777:0666);2806if(fd <0)2807return-1;28082809strbuf_init(&nbuf,0);2810if(convert_to_working_tree(path, buf, size, &nbuf)) {2811 size = nbuf.len;2812 buf = nbuf.buf;2813}2814write_or_die(fd, buf, size);2815strbuf_release(&nbuf);28162817if(close(fd) <0)2818die("closing file%s:%s", path,strerror(errno));2819return0;2820}28212822/*2823 * We optimistically assume that the directories exist,2824 * which is true 99% of the time anyway. If they don't,2825 * we create them and try again.2826 */2827static voidcreate_one_file(char*path,unsigned mode,const char*buf,unsigned long size)2828{2829if(cached)2830return;2831if(!try_create_file(path, mode, buf, size))2832return;28332834if(errno == ENOENT) {2835if(safe_create_leading_directories(path))2836return;2837if(!try_create_file(path, mode, buf, size))2838return;2839}28402841if(errno == EEXIST || errno == EACCES) {2842/* We may be trying to create a file where a directory2843 * used to be.2844 */2845struct stat st;2846if(!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))2847 errno = EEXIST;2848}28492850if(errno == EEXIST) {2851unsigned int nr =getpid();28522853for(;;) {2854char newpath[PATH_MAX];2855mksnpath(newpath,sizeof(newpath),"%s~%u", path, nr);2856if(!try_create_file(newpath, mode, buf, size)) {2857if(!rename(newpath, path))2858return;2859unlink(newpath);2860break;2861}2862if(errno != EEXIST)2863break;2864++nr;2865}2866}2867die("unable to write file%smode%o", path, mode);2868}28692870static voidcreate_file(struct patch *patch)2871{2872char*path = patch->new_name;2873unsigned mode = patch->new_mode;2874unsigned long size = patch->resultsize;2875char*buf = patch->result;28762877if(!mode)2878 mode = S_IFREG |0644;2879create_one_file(path, mode, buf, size);2880add_index_file(path, mode, buf, size);2881}28822883/* phase zero is to remove, phase one is to create */2884static voidwrite_out_one_result(struct patch *patch,int phase)2885{2886if(patch->is_delete >0) {2887if(phase ==0)2888remove_file(patch,1);2889return;2890}2891if(patch->is_new >0|| patch->is_copy) {2892if(phase ==1)2893create_file(patch);2894return;2895}2896/*2897 * Rename or modification boils down to the same2898 * thing: remove the old, write the new2899 */2900if(phase ==0)2901remove_file(patch, patch->is_rename);2902if(phase ==1)2903create_file(patch);2904}29052906static intwrite_out_one_reject(struct patch *patch)2907{2908FILE*rej;2909char namebuf[PATH_MAX];2910struct fragment *frag;2911int cnt =0;29122913for(cnt =0, frag = patch->fragments; frag; frag = frag->next) {2914if(!frag->rejected)2915continue;2916 cnt++;2917}29182919if(!cnt) {2920if(apply_verbosely)2921say_patch_name(stderr,2922"Applied patch ", patch," cleanly.\n");2923return0;2924}29252926/* This should not happen, because a removal patch that leaves2927 * contents are marked "rejected" at the patch level.2928 */2929if(!patch->new_name)2930die("internal error");29312932/* Say this even without --verbose */2933say_patch_name(stderr,"Applying patch ", patch," with");2934fprintf(stderr,"%drejects...\n", cnt);29352936 cnt =strlen(patch->new_name);2937if(ARRAY_SIZE(namebuf) <= cnt +5) {2938 cnt =ARRAY_SIZE(namebuf) -5;2939fprintf(stderr,2940"warning: truncating .rej filename to %.*s.rej",2941 cnt -1, patch->new_name);2942}2943memcpy(namebuf, patch->new_name, cnt);2944memcpy(namebuf + cnt,".rej",5);29452946 rej =fopen(namebuf,"w");2947if(!rej)2948returnerror("cannot open%s:%s", namebuf,strerror(errno));29492950/* Normal git tools never deal with .rej, so do not pretend2951 * this is a git patch by saying --git nor give extended2952 * headers. While at it, maybe please "kompare" that wants2953 * the trailing TAB and some garbage at the end of line ;-).2954 */2955fprintf(rej,"diff a/%sb/%s\t(rejected hunks)\n",2956 patch->new_name, patch->new_name);2957for(cnt =1, frag = patch->fragments;2958 frag;2959 cnt++, frag = frag->next) {2960if(!frag->rejected) {2961fprintf(stderr,"Hunk #%dapplied cleanly.\n", cnt);2962continue;2963}2964fprintf(stderr,"Rejected hunk #%d.\n", cnt);2965fprintf(rej,"%.*s", frag->size, frag->patch);2966if(frag->patch[frag->size-1] !='\n')2967fputc('\n', rej);2968}2969fclose(rej);2970return-1;2971}29722973static intwrite_out_results(struct patch *list,int skipped_patch)2974{2975int phase;2976int errs =0;2977struct patch *l;29782979if(!list && !skipped_patch)2980returnerror("No changes");29812982for(phase =0; phase <2; phase++) {2983 l = list;2984while(l) {2985if(l->rejected)2986 errs =1;2987else{2988write_out_one_result(l, phase);2989if(phase ==1&&write_out_one_reject(l))2990 errs =1;2991}2992 l = l->next;2993}2994}2995return errs;2996}29972998static struct lock_file lock_file;29993000static struct excludes {3001struct excludes *next;3002const char*path;3003} *excludes;30043005static intuse_patch(struct patch *p)3006{3007const char*pathname = p->new_name ? p->new_name : p->old_name;3008struct excludes *x = excludes;3009while(x) {3010if(fnmatch(x->path, pathname,0) ==0)3011return0;3012 x = x->next;3013}3014if(0< prefix_length) {3015int pathlen =strlen(pathname);3016if(pathlen <= prefix_length ||3017memcmp(prefix, pathname, prefix_length))3018return0;3019}3020return1;3021}30223023static voidprefix_one(char**name)3024{3025char*old_name = *name;3026if(!old_name)3027return;3028*name =xstrdup(prefix_filename(prefix, prefix_length, *name));3029free(old_name);3030}30313032static voidprefix_patches(struct patch *p)3033{3034if(!prefix || p->is_toplevel_relative)3035return;3036for( ; p; p = p->next) {3037if(p->new_name == p->old_name) {3038char*prefixed = p->new_name;3039prefix_one(&prefixed);3040 p->new_name = p->old_name = prefixed;3041}3042else{3043prefix_one(&p->new_name);3044prefix_one(&p->old_name);3045}3046}3047}30483049#define INACCURATE_EOF (1<<0)3050#define RECOUNT (1<<1)30513052static intapply_patch(int fd,const char*filename,int options)3053{3054size_t offset;3055struct strbuf buf;3056struct patch *list = NULL, **listp = &list;3057int skipped_patch =0;30583059/* FIXME - memory leak when using multiple patch files as inputs */3060memset(&fn_table,0,sizeof(struct string_list));3061strbuf_init(&buf,0);3062 patch_input_file = filename;3063read_patch_file(&buf, fd);3064 offset =0;3065while(offset < buf.len) {3066struct patch *patch;3067int nr;30683069 patch =xcalloc(1,sizeof(*patch));3070 patch->inaccurate_eof = !!(options & INACCURATE_EOF);3071 patch->recount = !!(options & RECOUNT);3072 nr =parse_chunk(buf.buf + offset, buf.len - offset, patch);3073if(nr <0)3074break;3075if(apply_in_reverse)3076reverse_patches(patch);3077if(prefix)3078prefix_patches(patch);3079if(use_patch(patch)) {3080patch_stats(patch);3081*listp = patch;3082 listp = &patch->next;3083}3084else{3085/* perhaps free it a bit better? */3086free(patch);3087 skipped_patch++;3088}3089 offset += nr;3090}30913092if(whitespace_error && (ws_error_action == die_on_ws_error))3093 apply =0;30943095 update_index = check_index && apply;3096if(update_index && newfd <0)3097 newfd =hold_locked_index(&lock_file,1);30983099if(check_index) {3100if(read_cache() <0)3101die("unable to read index file");3102}31033104if((check || apply) &&3105check_patch_list(list) <0&&3106!apply_with_reject)3107exit(1);31083109if(apply &&write_out_results(list, skipped_patch))3110exit(1);31113112if(fake_ancestor)3113build_fake_ancestor(list, fake_ancestor);31143115if(diffstat)3116stat_patch_list(list);31173118if(numstat)3119numstat_patch_list(list);31203121if(summary)3122summary_patch_list(list);31233124strbuf_release(&buf);3125return0;3126}31273128static intgit_apply_config(const char*var,const char*value,void*cb)3129{3130if(!strcmp(var,"apply.whitespace"))3131returngit_config_string(&apply_default_whitespace, var, value);3132returngit_default_config(var, value, cb);3133}313431353136intcmd_apply(int argc,const char**argv,const char*unused_prefix)3137{3138int i;3139int read_stdin =1;3140int options =0;3141int errs =0;3142int is_not_gitdir;31433144const char*whitespace_option = NULL;31453146 prefix =setup_git_directory_gently(&is_not_gitdir);3147 prefix_length = prefix ?strlen(prefix) :0;3148git_config(git_apply_config, NULL);3149if(apply_default_whitespace)3150parse_whitespace_option(apply_default_whitespace);31513152for(i =1; i < argc; i++) {3153const char*arg = argv[i];3154char*end;3155int fd;31563157if(!strcmp(arg,"-")) {3158 errs |=apply_patch(0,"<stdin>", options);3159 read_stdin =0;3160continue;3161}3162if(!prefixcmp(arg,"--exclude=")) {3163struct excludes *x =xmalloc(sizeof(*x));3164 x->path = arg +10;3165 x->next = excludes;3166 excludes = x;3167continue;3168}3169if(!prefixcmp(arg,"-p")) {3170 p_value =atoi(arg +2);3171 p_value_known =1;3172continue;3173}3174if(!strcmp(arg,"--no-add")) {3175 no_add =1;3176continue;3177}3178if(!strcmp(arg,"--stat")) {3179 apply =0;3180 diffstat =1;3181continue;3182}3183if(!strcmp(arg,"--allow-binary-replacement") ||3184!strcmp(arg,"--binary")) {3185continue;/* now no-op */3186}3187if(!strcmp(arg,"--numstat")) {3188 apply =0;3189 numstat =1;3190continue;3191}3192if(!strcmp(arg,"--summary")) {3193 apply =0;3194 summary =1;3195continue;3196}3197if(!strcmp(arg,"--check")) {3198 apply =0;3199 check =1;3200continue;3201}3202if(!strcmp(arg,"--index")) {3203if(is_not_gitdir)3204die("--index outside a repository");3205 check_index =1;3206continue;3207}3208if(!strcmp(arg,"--cached")) {3209if(is_not_gitdir)3210die("--cached outside a repository");3211 check_index =1;3212 cached =1;3213continue;3214}3215if(!strcmp(arg,"--apply")) {3216 apply =1;3217continue;3218}3219if(!strcmp(arg,"--build-fake-ancestor")) {3220 apply =0;3221if(++i >= argc)3222die("need a filename");3223 fake_ancestor = argv[i];3224continue;3225}3226if(!strcmp(arg,"-z")) {3227 line_termination =0;3228continue;3229}3230if(!prefixcmp(arg,"-C")) {3231 p_context =strtoul(arg +2, &end,0);3232if(*end !='\0')3233die("unrecognized context count '%s'", arg +2);3234continue;3235}3236if(!prefixcmp(arg,"--whitespace=")) {3237 whitespace_option = arg +13;3238parse_whitespace_option(arg +13);3239continue;3240}3241if(!strcmp(arg,"-R") || !strcmp(arg,"--reverse")) {3242 apply_in_reverse =1;3243continue;3244}3245if(!strcmp(arg,"--unidiff-zero")) {3246 unidiff_zero =1;3247continue;3248}3249if(!strcmp(arg,"--reject")) {3250 apply = apply_with_reject = apply_verbosely =1;3251continue;3252}3253if(!strcmp(arg,"-v") || !strcmp(arg,"--verbose")) {3254 apply_verbosely =1;3255continue;3256}3257if(!strcmp(arg,"--inaccurate-eof")) {3258 options |= INACCURATE_EOF;3259continue;3260}3261if(!strcmp(arg,"--recount")) {3262 options |= RECOUNT;3263continue;3264}3265if(!prefixcmp(arg,"--directory=")) {3266 arg +=strlen("--directory=");3267 root_len =strlen(arg);3268if(root_len && arg[root_len -1] !='/') {3269char*new_root;3270 root = new_root =xmalloc(root_len +2);3271strcpy(new_root, arg);3272strcpy(new_root + root_len++,"/");3273}else3274 root = arg;3275continue;3276}3277if(0< prefix_length)3278 arg =prefix_filename(prefix, prefix_length, arg);32793280 fd =open(arg, O_RDONLY);3281if(fd <0)3282die("can't open patch '%s':%s", arg,strerror(errno));3283 read_stdin =0;3284set_default_whitespace_mode(whitespace_option);3285 errs |=apply_patch(fd, arg, options);3286close(fd);3287}3288set_default_whitespace_mode(whitespace_option);3289if(read_stdin)3290 errs |=apply_patch(0,"<stdin>", options);3291if(whitespace_error) {3292if(squelch_whitespace_errors &&3293 squelch_whitespace_errors < whitespace_error) {3294int squelched =3295 whitespace_error - squelch_whitespace_errors;3296fprintf(stderr,"warning: squelched%d"3297"whitespace error%s\n",3298 squelched,3299 squelched ==1?"":"s");3300}3301if(ws_error_action == die_on_ws_error)3302die("%dline%sadd%swhitespace errors.",3303 whitespace_error,3304 whitespace_error ==1?"":"s",3305 whitespace_error ==1?"s":"");3306if(applied_after_fixing_ws && apply)3307fprintf(stderr,"warning:%dline%sapplied after"3308" fixing whitespace errors.\n",3309 applied_after_fixing_ws,3310 applied_after_fixing_ws ==1?"":"s");3311else if(whitespace_error)3312fprintf(stderr,"warning:%dline%sadd%swhitespace errors.\n",3313 whitespace_error,3314 whitespace_error ==1?"":"s",3315 whitespace_error ==1?"s":"");3316}33173318if(update_index) {3319if(write_cache(newfd, active_cache, active_nr) ||3320commit_locked_index(&lock_file))3321die("Unable to write new index file");3322}33233324return!!errs;3325}