builtin / apply.con commit tag: add --column (d96e3c1)
   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#include "diff.h"
  18#include "parse-options.h"
  19
  20/*
  21 *  --check turns on checking that the working tree matches the
  22 *    files that are being modified, but doesn't apply the patch
  23 *  --stat does just a diffstat, and doesn't actually apply
  24 *  --numstat does numeric diffstat, and doesn't actually apply
  25 *  --index-info shows the old and new index info for paths if available.
  26 *  --index updates the cache as well.
  27 *  --cached updates only the cache without ever touching the working tree.
  28 */
  29static const char *prefix;
  30static int prefix_length = -1;
  31static int newfd = -1;
  32
  33static int unidiff_zero;
  34static int p_value = 1;
  35static int p_value_known;
  36static int check_index;
  37static int update_index;
  38static int cached;
  39static int diffstat;
  40static int numstat;
  41static int summary;
  42static int check;
  43static int apply = 1;
  44static int apply_in_reverse;
  45static int apply_with_reject;
  46static int apply_verbosely;
  47static int allow_overlap;
  48static int no_add;
  49static const char *fake_ancestor;
  50static int line_termination = '\n';
  51static unsigned int p_context = UINT_MAX;
  52static const char * const apply_usage[] = {
  53        "git apply [options] [<patch>...]",
  54        NULL
  55};
  56
  57static enum ws_error_action {
  58        nowarn_ws_error,
  59        warn_on_ws_error,
  60        die_on_ws_error,
  61        correct_ws_error
  62} ws_error_action = warn_on_ws_error;
  63static int whitespace_error;
  64static int squelch_whitespace_errors = 5;
  65static int applied_after_fixing_ws;
  66
  67static enum ws_ignore {
  68        ignore_ws_none,
  69        ignore_ws_change
  70} ws_ignore_action = ignore_ws_none;
  71
  72
  73static const char *patch_input_file;
  74static const char *root;
  75static int root_len;
  76static int read_stdin = 1;
  77static int options;
  78
  79static void parse_whitespace_option(const char *option)
  80{
  81        if (!option) {
  82                ws_error_action = warn_on_ws_error;
  83                return;
  84        }
  85        if (!strcmp(option, "warn")) {
  86                ws_error_action = warn_on_ws_error;
  87                return;
  88        }
  89        if (!strcmp(option, "nowarn")) {
  90                ws_error_action = nowarn_ws_error;
  91                return;
  92        }
  93        if (!strcmp(option, "error")) {
  94                ws_error_action = die_on_ws_error;
  95                return;
  96        }
  97        if (!strcmp(option, "error-all")) {
  98                ws_error_action = die_on_ws_error;
  99                squelch_whitespace_errors = 0;
 100                return;
 101        }
 102        if (!strcmp(option, "strip") || !strcmp(option, "fix")) {
 103                ws_error_action = correct_ws_error;
 104                return;
 105        }
 106        die("unrecognized whitespace option '%s'", option);
 107}
 108
 109static void parse_ignorewhitespace_option(const char *option)
 110{
 111        if (!option || !strcmp(option, "no") ||
 112            !strcmp(option, "false") || !strcmp(option, "never") ||
 113            !strcmp(option, "none")) {
 114                ws_ignore_action = ignore_ws_none;
 115                return;
 116        }
 117        if (!strcmp(option, "change")) {
 118                ws_ignore_action = ignore_ws_change;
 119                return;
 120        }
 121        die("unrecognized whitespace ignore option '%s'", option);
 122}
 123
 124static void set_default_whitespace_mode(const char *whitespace_option)
 125{
 126        if (!whitespace_option && !apply_default_whitespace)
 127                ws_error_action = (apply ? warn_on_ws_error : nowarn_ws_error);
 128}
 129
 130/*
 131 * For "diff-stat" like behaviour, we keep track of the biggest change
 132 * we've seen, and the longest filename. That allows us to do simple
 133 * scaling.
 134 */
 135static int max_change, max_len;
 136
 137/*
 138 * Various "current state", notably line numbers and what
 139 * file (and how) we're patching right now.. The "is_xxxx"
 140 * things are flags, where -1 means "don't know yet".
 141 */
 142static int linenr = 1;
 143
 144/*
 145 * This represents one "hunk" from a patch, starting with
 146 * "@@ -oldpos,oldlines +newpos,newlines @@" marker.  The
 147 * patch text is pointed at by patch, and its byte length
 148 * is stored in size.  leading and trailing are the number
 149 * of context lines.
 150 */
 151struct fragment {
 152        unsigned long leading, trailing;
 153        unsigned long oldpos, oldlines;
 154        unsigned long newpos, newlines;
 155        const char *patch;
 156        int size;
 157        int rejected;
 158        int linenr;
 159        struct fragment *next;
 160};
 161
 162/*
 163 * When dealing with a binary patch, we reuse "leading" field
 164 * to store the type of the binary hunk, either deflated "delta"
 165 * or deflated "literal".
 166 */
 167#define binary_patch_method leading
 168#define BINARY_DELTA_DEFLATED   1
 169#define BINARY_LITERAL_DEFLATED 2
 170
 171/*
 172 * This represents a "patch" to a file, both metainfo changes
 173 * such as creation/deletion, filemode and content changes represented
 174 * as a series of fragments.
 175 */
 176struct patch {
 177        char *new_name, *old_name, *def_name;
 178        unsigned int old_mode, new_mode;
 179        int is_new, is_delete;  /* -1 = unknown, 0 = false, 1 = true */
 180        int rejected;
 181        unsigned ws_rule;
 182        unsigned long deflate_origlen;
 183        int lines_added, lines_deleted;
 184        int score;
 185        unsigned int is_toplevel_relative:1;
 186        unsigned int inaccurate_eof:1;
 187        unsigned int is_binary:1;
 188        unsigned int is_copy:1;
 189        unsigned int is_rename:1;
 190        unsigned int recount:1;
 191        struct fragment *fragments;
 192        char *result;
 193        size_t resultsize;
 194        char old_sha1_prefix[41];
 195        char new_sha1_prefix[41];
 196        struct patch *next;
 197};
 198
 199/*
 200 * A line in a file, len-bytes long (includes the terminating LF,
 201 * except for an incomplete line at the end if the file ends with
 202 * one), and its contents hashes to 'hash'.
 203 */
 204struct line {
 205        size_t len;
 206        unsigned hash : 24;
 207        unsigned flag : 8;
 208#define LINE_COMMON     1
 209#define LINE_PATCHED    2
 210};
 211
 212/*
 213 * This represents a "file", which is an array of "lines".
 214 */
 215struct image {
 216        char *buf;
 217        size_t len;
 218        size_t nr;
 219        size_t alloc;
 220        struct line *line_allocated;
 221        struct line *line;
 222};
 223
 224/*
 225 * Records filenames that have been touched, in order to handle
 226 * the case where more than one patches touch the same file.
 227 */
 228
 229static struct string_list fn_table;
 230
 231static uint32_t hash_line(const char *cp, size_t len)
 232{
 233        size_t i;
 234        uint32_t h;
 235        for (i = 0, h = 0; i < len; i++) {
 236                if (!isspace(cp[i])) {
 237                        h = h * 3 + (cp[i] & 0xff);
 238                }
 239        }
 240        return h;
 241}
 242
 243/*
 244 * Compare lines s1 of length n1 and s2 of length n2, ignoring
 245 * whitespace difference. Returns 1 if they match, 0 otherwise
 246 */
 247static int fuzzy_matchlines(const char *s1, size_t n1,
 248                            const char *s2, size_t n2)
 249{
 250        const char *last1 = s1 + n1 - 1;
 251        const char *last2 = s2 + n2 - 1;
 252        int result = 0;
 253
 254        /* ignore line endings */
 255        while ((*last1 == '\r') || (*last1 == '\n'))
 256                last1--;
 257        while ((*last2 == '\r') || (*last2 == '\n'))
 258                last2--;
 259
 260        /* skip leading whitespace */
 261        while (isspace(*s1) && (s1 <= last1))
 262                s1++;
 263        while (isspace(*s2) && (s2 <= last2))
 264                s2++;
 265        /* early return if both lines are empty */
 266        if ((s1 > last1) && (s2 > last2))
 267                return 1;
 268        while (!result) {
 269                result = *s1++ - *s2++;
 270                /*
 271                 * Skip whitespace inside. We check for whitespace on
 272                 * both buffers because we don't want "a b" to match
 273                 * "ab"
 274                 */
 275                if (isspace(*s1) && isspace(*s2)) {
 276                        while (isspace(*s1) && s1 <= last1)
 277                                s1++;
 278                        while (isspace(*s2) && s2 <= last2)
 279                                s2++;
 280                }
 281                /*
 282                 * If we reached the end on one side only,
 283                 * lines don't match
 284                 */
 285                if (
 286                    ((s2 > last2) && (s1 <= last1)) ||
 287                    ((s1 > last1) && (s2 <= last2)))
 288                        return 0;
 289                if ((s1 > last1) && (s2 > last2))
 290                        break;
 291        }
 292
 293        return !result;
 294}
 295
 296static void add_line_info(struct image *img, const char *bol, size_t len, unsigned flag)
 297{
 298        ALLOC_GROW(img->line_allocated, img->nr + 1, img->alloc);
 299        img->line_allocated[img->nr].len = len;
 300        img->line_allocated[img->nr].hash = hash_line(bol, len);
 301        img->line_allocated[img->nr].flag = flag;
 302        img->nr++;
 303}
 304
 305static void prepare_image(struct image *image, char *buf, size_t len,
 306                          int prepare_linetable)
 307{
 308        const char *cp, *ep;
 309
 310        memset(image, 0, sizeof(*image));
 311        image->buf = buf;
 312        image->len = len;
 313
 314        if (!prepare_linetable)
 315                return;
 316
 317        ep = image->buf + image->len;
 318        cp = image->buf;
 319        while (cp < ep) {
 320                const char *next;
 321                for (next = cp; next < ep && *next != '\n'; next++)
 322                        ;
 323                if (next < ep)
 324                        next++;
 325                add_line_info(image, cp, next - cp, 0);
 326                cp = next;
 327        }
 328        image->line = image->line_allocated;
 329}
 330
 331static void clear_image(struct image *image)
 332{
 333        free(image->buf);
 334        image->buf = NULL;
 335        image->len = 0;
 336}
 337
 338static void say_patch_name(FILE *output, const char *pre,
 339                           struct patch *patch, const char *post)
 340{
 341        fputs(pre, output);
 342        if (patch->old_name && patch->new_name &&
 343            strcmp(patch->old_name, patch->new_name)) {
 344                quote_c_style(patch->old_name, NULL, output, 0);
 345                fputs(" => ", output);
 346                quote_c_style(patch->new_name, NULL, output, 0);
 347        } else {
 348                const char *n = patch->new_name;
 349                if (!n)
 350                        n = patch->old_name;
 351                quote_c_style(n, NULL, output, 0);
 352        }
 353        fputs(post, output);
 354}
 355
 356#define CHUNKSIZE (8192)
 357#define SLOP (16)
 358
 359static void read_patch_file(struct strbuf *sb, int fd)
 360{
 361        if (strbuf_read(sb, fd, 0) < 0)
 362                die_errno("git apply: failed to read");
 363
 364        /*
 365         * Make sure that we have some slop in the buffer
 366         * so that we can do speculative "memcmp" etc, and
 367         * see to it that it is NUL-filled.
 368         */
 369        strbuf_grow(sb, SLOP);
 370        memset(sb->buf + sb->len, 0, SLOP);
 371}
 372
 373static unsigned long linelen(const char *buffer, unsigned long size)
 374{
 375        unsigned long len = 0;
 376        while (size--) {
 377                len++;
 378                if (*buffer++ == '\n')
 379                        break;
 380        }
 381        return len;
 382}
 383
 384static int is_dev_null(const char *str)
 385{
 386        return !memcmp("/dev/null", str, 9) && isspace(str[9]);
 387}
 388
 389#define TERM_SPACE      1
 390#define TERM_TAB        2
 391
 392static int name_terminate(const char *name, int namelen, int c, int terminate)
 393{
 394        if (c == ' ' && !(terminate & TERM_SPACE))
 395                return 0;
 396        if (c == '\t' && !(terminate & TERM_TAB))
 397                return 0;
 398
 399        return 1;
 400}
 401
 402/* remove double slashes to make --index work with such filenames */
 403static char *squash_slash(char *name)
 404{
 405        int i = 0, j = 0;
 406
 407        if (!name)
 408                return NULL;
 409
 410        while (name[i]) {
 411                if ((name[j++] = name[i++]) == '/')
 412                        while (name[i] == '/')
 413                                i++;
 414        }
 415        name[j] = '\0';
 416        return name;
 417}
 418
 419static char *find_name_gnu(const char *line, char *def, int p_value)
 420{
 421        struct strbuf name = STRBUF_INIT;
 422        char *cp;
 423
 424        /*
 425         * Proposed "new-style" GNU patch/diff format; see
 426         * http://marc.theaimsgroup.com/?l=git&m=112927316408690&w=2
 427         */
 428        if (unquote_c_style(&name, line, NULL)) {
 429                strbuf_release(&name);
 430                return NULL;
 431        }
 432
 433        for (cp = name.buf; p_value; p_value--) {
 434                cp = strchr(cp, '/');
 435                if (!cp) {
 436                        strbuf_release(&name);
 437                        return NULL;
 438                }
 439                cp++;
 440        }
 441
 442        /* name can later be freed, so we need
 443         * to memmove, not just return cp
 444         */
 445        strbuf_remove(&name, 0, cp - name.buf);
 446        free(def);
 447        if (root)
 448                strbuf_insert(&name, 0, root, root_len);
 449        return squash_slash(strbuf_detach(&name, NULL));
 450}
 451
 452static size_t sane_tz_len(const char *line, size_t len)
 453{
 454        const char *tz, *p;
 455
 456        if (len < strlen(" +0500") || line[len-strlen(" +0500")] != ' ')
 457                return 0;
 458        tz = line + len - strlen(" +0500");
 459
 460        if (tz[1] != '+' && tz[1] != '-')
 461                return 0;
 462
 463        for (p = tz + 2; p != line + len; p++)
 464                if (!isdigit(*p))
 465                        return 0;
 466
 467        return line + len - tz;
 468}
 469
 470static size_t tz_with_colon_len(const char *line, size_t len)
 471{
 472        const char *tz, *p;
 473
 474        if (len < strlen(" +08:00") || line[len - strlen(":00")] != ':')
 475                return 0;
 476        tz = line + len - strlen(" +08:00");
 477
 478        if (tz[0] != ' ' || (tz[1] != '+' && tz[1] != '-'))
 479                return 0;
 480        p = tz + 2;
 481        if (!isdigit(*p++) || !isdigit(*p++) || *p++ != ':' ||
 482            !isdigit(*p++) || !isdigit(*p++))
 483                return 0;
 484
 485        return line + len - tz;
 486}
 487
 488static size_t date_len(const char *line, size_t len)
 489{
 490        const char *date, *p;
 491
 492        if (len < strlen("72-02-05") || line[len-strlen("-05")] != '-')
 493                return 0;
 494        p = date = line + len - strlen("72-02-05");
 495
 496        if (!isdigit(*p++) || !isdigit(*p++) || *p++ != '-' ||
 497            !isdigit(*p++) || !isdigit(*p++) || *p++ != '-' ||
 498            !isdigit(*p++) || !isdigit(*p++))   /* Not a date. */
 499                return 0;
 500
 501        if (date - line >= strlen("19") &&
 502            isdigit(date[-1]) && isdigit(date[-2]))     /* 4-digit year */
 503                date -= strlen("19");
 504
 505        return line + len - date;
 506}
 507
 508static size_t short_time_len(const char *line, size_t len)
 509{
 510        const char *time, *p;
 511
 512        if (len < strlen(" 07:01:32") || line[len-strlen(":32")] != ':')
 513                return 0;
 514        p = time = line + len - strlen(" 07:01:32");
 515
 516        /* Permit 1-digit hours? */
 517        if (*p++ != ' ' ||
 518            !isdigit(*p++) || !isdigit(*p++) || *p++ != ':' ||
 519            !isdigit(*p++) || !isdigit(*p++) || *p++ != ':' ||
 520            !isdigit(*p++) || !isdigit(*p++))   /* Not a time. */
 521                return 0;
 522
 523        return line + len - time;
 524}
 525
 526static size_t fractional_time_len(const char *line, size_t len)
 527{
 528        const char *p;
 529        size_t n;
 530
 531        /* Expected format: 19:41:17.620000023 */
 532        if (!len || !isdigit(line[len - 1]))
 533                return 0;
 534        p = line + len - 1;
 535
 536        /* Fractional seconds. */
 537        while (p > line && isdigit(*p))
 538                p--;
 539        if (*p != '.')
 540                return 0;
 541
 542        /* Hours, minutes, and whole seconds. */
 543        n = short_time_len(line, p - line);
 544        if (!n)
 545                return 0;
 546
 547        return line + len - p + n;
 548}
 549
 550static size_t trailing_spaces_len(const char *line, size_t len)
 551{
 552        const char *p;
 553
 554        /* Expected format: ' ' x (1 or more)  */
 555        if (!len || line[len - 1] != ' ')
 556                return 0;
 557
 558        p = line + len;
 559        while (p != line) {
 560                p--;
 561                if (*p != ' ')
 562                        return line + len - (p + 1);
 563        }
 564
 565        /* All spaces! */
 566        return len;
 567}
 568
 569static size_t diff_timestamp_len(const char *line, size_t len)
 570{
 571        const char *end = line + len;
 572        size_t n;
 573
 574        /*
 575         * Posix: 2010-07-05 19:41:17
 576         * GNU: 2010-07-05 19:41:17.620000023 -0500
 577         */
 578
 579        if (!isdigit(end[-1]))
 580                return 0;
 581
 582        n = sane_tz_len(line, end - line);
 583        if (!n)
 584                n = tz_with_colon_len(line, end - line);
 585        end -= n;
 586
 587        n = short_time_len(line, end - line);
 588        if (!n)
 589                n = fractional_time_len(line, end - line);
 590        end -= n;
 591
 592        n = date_len(line, end - line);
 593        if (!n) /* No date.  Too bad. */
 594                return 0;
 595        end -= n;
 596
 597        if (end == line)        /* No space before date. */
 598                return 0;
 599        if (end[-1] == '\t') {  /* Success! */
 600                end--;
 601                return line + len - end;
 602        }
 603        if (end[-1] != ' ')     /* No space before date. */
 604                return 0;
 605
 606        /* Whitespace damage. */
 607        end -= trailing_spaces_len(line, end - line);
 608        return line + len - end;
 609}
 610
 611static char *find_name_common(const char *line, char *def, int p_value,
 612                                const char *end, int terminate)
 613{
 614        int len;
 615        const char *start = NULL;
 616
 617        if (p_value == 0)
 618                start = line;
 619        while (line != end) {
 620                char c = *line;
 621
 622                if (!end && isspace(c)) {
 623                        if (c == '\n')
 624                                break;
 625                        if (name_terminate(start, line-start, c, terminate))
 626                                break;
 627                }
 628                line++;
 629                if (c == '/' && !--p_value)
 630                        start = line;
 631        }
 632        if (!start)
 633                return squash_slash(def);
 634        len = line - start;
 635        if (!len)
 636                return squash_slash(def);
 637
 638        /*
 639         * Generally we prefer the shorter name, especially
 640         * if the other one is just a variation of that with
 641         * something else tacked on to the end (ie "file.orig"
 642         * or "file~").
 643         */
 644        if (def) {
 645                int deflen = strlen(def);
 646                if (deflen < len && !strncmp(start, def, deflen))
 647                        return squash_slash(def);
 648                free(def);
 649        }
 650
 651        if (root) {
 652                char *ret = xmalloc(root_len + len + 1);
 653                strcpy(ret, root);
 654                memcpy(ret + root_len, start, len);
 655                ret[root_len + len] = '\0';
 656                return squash_slash(ret);
 657        }
 658
 659        return squash_slash(xmemdupz(start, len));
 660}
 661
 662static char *find_name(const char *line, char *def, int p_value, int terminate)
 663{
 664        if (*line == '"') {
 665                char *name = find_name_gnu(line, def, p_value);
 666                if (name)
 667                        return name;
 668        }
 669
 670        return find_name_common(line, def, p_value, NULL, terminate);
 671}
 672
 673static char *find_name_traditional(const char *line, char *def, int p_value)
 674{
 675        size_t len = strlen(line);
 676        size_t date_len;
 677
 678        if (*line == '"') {
 679                char *name = find_name_gnu(line, def, p_value);
 680                if (name)
 681                        return name;
 682        }
 683
 684        len = strchrnul(line, '\n') - line;
 685        date_len = diff_timestamp_len(line, len);
 686        if (!date_len)
 687                return find_name_common(line, def, p_value, NULL, TERM_TAB);
 688        len -= date_len;
 689
 690        return find_name_common(line, def, p_value, line + len, 0);
 691}
 692
 693static int count_slashes(const char *cp)
 694{
 695        int cnt = 0;
 696        char ch;
 697
 698        while ((ch = *cp++))
 699                if (ch == '/')
 700                        cnt++;
 701        return cnt;
 702}
 703
 704/*
 705 * Given the string after "--- " or "+++ ", guess the appropriate
 706 * p_value for the given patch.
 707 */
 708static int guess_p_value(const char *nameline)
 709{
 710        char *name, *cp;
 711        int val = -1;
 712
 713        if (is_dev_null(nameline))
 714                return -1;
 715        name = find_name_traditional(nameline, NULL, 0);
 716        if (!name)
 717                return -1;
 718        cp = strchr(name, '/');
 719        if (!cp)
 720                val = 0;
 721        else if (prefix) {
 722                /*
 723                 * Does it begin with "a/$our-prefix" and such?  Then this is
 724                 * very likely to apply to our directory.
 725                 */
 726                if (!strncmp(name, prefix, prefix_length))
 727                        val = count_slashes(prefix);
 728                else {
 729                        cp++;
 730                        if (!strncmp(cp, prefix, prefix_length))
 731                                val = count_slashes(prefix) + 1;
 732                }
 733        }
 734        free(name);
 735        return val;
 736}
 737
 738/*
 739 * Does the ---/+++ line has the POSIX timestamp after the last HT?
 740 * GNU diff puts epoch there to signal a creation/deletion event.  Is
 741 * this such a timestamp?
 742 */
 743static int has_epoch_timestamp(const char *nameline)
 744{
 745        /*
 746         * We are only interested in epoch timestamp; any non-zero
 747         * fraction cannot be one, hence "(\.0+)?" in the regexp below.
 748         * For the same reason, the date must be either 1969-12-31 or
 749         * 1970-01-01, and the seconds part must be "00".
 750         */
 751        const char stamp_regexp[] =
 752                "^(1969-12-31|1970-01-01)"
 753                " "
 754                "[0-2][0-9]:[0-5][0-9]:00(\\.0+)?"
 755                " "
 756                "([-+][0-2][0-9]:?[0-5][0-9])\n";
 757        const char *timestamp = NULL, *cp, *colon;
 758        static regex_t *stamp;
 759        regmatch_t m[10];
 760        int zoneoffset;
 761        int hourminute;
 762        int status;
 763
 764        for (cp = nameline; *cp != '\n'; cp++) {
 765                if (*cp == '\t')
 766                        timestamp = cp + 1;
 767        }
 768        if (!timestamp)
 769                return 0;
 770        if (!stamp) {
 771                stamp = xmalloc(sizeof(*stamp));
 772                if (regcomp(stamp, stamp_regexp, REG_EXTENDED)) {
 773                        warning("Cannot prepare timestamp regexp %s",
 774                                stamp_regexp);
 775                        return 0;
 776                }
 777        }
 778
 779        status = regexec(stamp, timestamp, ARRAY_SIZE(m), m, 0);
 780        if (status) {
 781                if (status != REG_NOMATCH)
 782                        warning("regexec returned %d for input: %s",
 783                                status, timestamp);
 784                return 0;
 785        }
 786
 787        zoneoffset = strtol(timestamp + m[3].rm_so + 1, (char **) &colon, 10);
 788        if (*colon == ':')
 789                zoneoffset = zoneoffset * 60 + strtol(colon + 1, NULL, 10);
 790        else
 791                zoneoffset = (zoneoffset / 100) * 60 + (zoneoffset % 100);
 792        if (timestamp[m[3].rm_so] == '-')
 793                zoneoffset = -zoneoffset;
 794
 795        /*
 796         * YYYY-MM-DD hh:mm:ss must be from either 1969-12-31
 797         * (west of GMT) or 1970-01-01 (east of GMT)
 798         */
 799        if ((zoneoffset < 0 && memcmp(timestamp, "1969-12-31", 10)) ||
 800            (0 <= zoneoffset && memcmp(timestamp, "1970-01-01", 10)))
 801                return 0;
 802
 803        hourminute = (strtol(timestamp + 11, NULL, 10) * 60 +
 804                      strtol(timestamp + 14, NULL, 10) -
 805                      zoneoffset);
 806
 807        return ((zoneoffset < 0 && hourminute == 1440) ||
 808                (0 <= zoneoffset && !hourminute));
 809}
 810
 811/*
 812 * Get the name etc info from the ---/+++ lines of a traditional patch header
 813 *
 814 * FIXME! The end-of-filename heuristics are kind of screwy. For existing
 815 * files, we can happily check the index for a match, but for creating a
 816 * new file we should try to match whatever "patch" does. I have no idea.
 817 */
 818static void parse_traditional_patch(const char *first, const char *second, struct patch *patch)
 819{
 820        char *name;
 821
 822        first += 4;     /* skip "--- " */
 823        second += 4;    /* skip "+++ " */
 824        if (!p_value_known) {
 825                int p, q;
 826                p = guess_p_value(first);
 827                q = guess_p_value(second);
 828                if (p < 0) p = q;
 829                if (0 <= p && p == q) {
 830                        p_value = p;
 831                        p_value_known = 1;
 832                }
 833        }
 834        if (is_dev_null(first)) {
 835                patch->is_new = 1;
 836                patch->is_delete = 0;
 837                name = find_name_traditional(second, NULL, p_value);
 838                patch->new_name = name;
 839        } else if (is_dev_null(second)) {
 840                patch->is_new = 0;
 841                patch->is_delete = 1;
 842                name = find_name_traditional(first, NULL, p_value);
 843                patch->old_name = name;
 844        } else {
 845                name = find_name_traditional(first, NULL, p_value);
 846                name = find_name_traditional(second, name, p_value);
 847                if (has_epoch_timestamp(first)) {
 848                        patch->is_new = 1;
 849                        patch->is_delete = 0;
 850                        patch->new_name = name;
 851                } else if (has_epoch_timestamp(second)) {
 852                        patch->is_new = 0;
 853                        patch->is_delete = 1;
 854                        patch->old_name = name;
 855                } else {
 856                        patch->old_name = patch->new_name = name;
 857                }
 858        }
 859        if (!name)
 860                die("unable to find filename in patch at line %d", linenr);
 861}
 862
 863static int gitdiff_hdrend(const char *line, struct patch *patch)
 864{
 865        return -1;
 866}
 867
 868/*
 869 * We're anal about diff header consistency, to make
 870 * sure that we don't end up having strange ambiguous
 871 * patches floating around.
 872 *
 873 * As a result, gitdiff_{old|new}name() will check
 874 * their names against any previous information, just
 875 * to make sure..
 876 */
 877static char *gitdiff_verify_name(const char *line, int isnull, char *orig_name, const char *oldnew)
 878{
 879        if (!orig_name && !isnull)
 880                return find_name(line, NULL, p_value, TERM_TAB);
 881
 882        if (orig_name) {
 883                int len;
 884                const char *name;
 885                char *another;
 886                name = orig_name;
 887                len = strlen(name);
 888                if (isnull)
 889                        die("git apply: bad git-diff - expected /dev/null, got %s on line %d", name, linenr);
 890                another = find_name(line, NULL, p_value, TERM_TAB);
 891                if (!another || memcmp(another, name, len + 1))
 892                        die("git apply: bad git-diff - inconsistent %s filename on line %d", oldnew, linenr);
 893                free(another);
 894                return orig_name;
 895        }
 896        else {
 897                /* expect "/dev/null" */
 898                if (memcmp("/dev/null", line, 9) || line[9] != '\n')
 899                        die("git apply: bad git-diff - expected /dev/null on line %d", linenr);
 900                return NULL;
 901        }
 902}
 903
 904static int gitdiff_oldname(const char *line, struct patch *patch)
 905{
 906        patch->old_name = gitdiff_verify_name(line, patch->is_new, patch->old_name, "old");
 907        return 0;
 908}
 909
 910static int gitdiff_newname(const char *line, struct patch *patch)
 911{
 912        patch->new_name = gitdiff_verify_name(line, patch->is_delete, patch->new_name, "new");
 913        return 0;
 914}
 915
 916static int gitdiff_oldmode(const char *line, struct patch *patch)
 917{
 918        patch->old_mode = strtoul(line, NULL, 8);
 919        return 0;
 920}
 921
 922static int gitdiff_newmode(const char *line, struct patch *patch)
 923{
 924        patch->new_mode = strtoul(line, NULL, 8);
 925        return 0;
 926}
 927
 928static int gitdiff_delete(const char *line, struct patch *patch)
 929{
 930        patch->is_delete = 1;
 931        patch->old_name = patch->def_name;
 932        return gitdiff_oldmode(line, patch);
 933}
 934
 935static int gitdiff_newfile(const char *line, struct patch *patch)
 936{
 937        patch->is_new = 1;
 938        patch->new_name = patch->def_name;
 939        return gitdiff_newmode(line, patch);
 940}
 941
 942static int gitdiff_copysrc(const char *line, struct patch *patch)
 943{
 944        patch->is_copy = 1;
 945        patch->old_name = find_name(line, NULL, p_value ? p_value - 1 : 0, 0);
 946        return 0;
 947}
 948
 949static int gitdiff_copydst(const char *line, struct patch *patch)
 950{
 951        patch->is_copy = 1;
 952        patch->new_name = find_name(line, NULL, p_value ? p_value - 1 : 0, 0);
 953        return 0;
 954}
 955
 956static int gitdiff_renamesrc(const char *line, struct patch *patch)
 957{
 958        patch->is_rename = 1;
 959        patch->old_name = find_name(line, NULL, p_value ? p_value - 1 : 0, 0);
 960        return 0;
 961}
 962
 963static int gitdiff_renamedst(const char *line, struct patch *patch)
 964{
 965        patch->is_rename = 1;
 966        patch->new_name = find_name(line, NULL, p_value ? p_value - 1 : 0, 0);
 967        return 0;
 968}
 969
 970static int gitdiff_similarity(const char *line, struct patch *patch)
 971{
 972        if ((patch->score = strtoul(line, NULL, 10)) == ULONG_MAX)
 973                patch->score = 0;
 974        return 0;
 975}
 976
 977static int gitdiff_dissimilarity(const char *line, struct patch *patch)
 978{
 979        if ((patch->score = strtoul(line, NULL, 10)) == ULONG_MAX)
 980                patch->score = 0;
 981        return 0;
 982}
 983
 984static int gitdiff_index(const char *line, struct patch *patch)
 985{
 986        /*
 987         * index line is N hexadecimal, "..", N hexadecimal,
 988         * and optional space with octal mode.
 989         */
 990        const char *ptr, *eol;
 991        int len;
 992
 993        ptr = strchr(line, '.');
 994        if (!ptr || ptr[1] != '.' || 40 < ptr - line)
 995                return 0;
 996        len = ptr - line;
 997        memcpy(patch->old_sha1_prefix, line, len);
 998        patch->old_sha1_prefix[len] = 0;
 999
1000        line = ptr + 2;
1001        ptr = strchr(line, ' ');
1002        eol = strchr(line, '\n');
1003
1004        if (!ptr || eol < ptr)
1005                ptr = eol;
1006        len = ptr - line;
1007
1008        if (40 < len)
1009                return 0;
1010        memcpy(patch->new_sha1_prefix, line, len);
1011        patch->new_sha1_prefix[len] = 0;
1012        if (*ptr == ' ')
1013                patch->old_mode = strtoul(ptr+1, NULL, 8);
1014        return 0;
1015}
1016
1017/*
1018 * This is normal for a diff that doesn't change anything: we'll fall through
1019 * into the next diff. Tell the parser to break out.
1020 */
1021static int gitdiff_unrecognized(const char *line, struct patch *patch)
1022{
1023        return -1;
1024}
1025
1026static const char *stop_at_slash(const char *line, int llen)
1027{
1028        int nslash = p_value;
1029        int i;
1030
1031        for (i = 0; i < llen; i++) {
1032                int ch = line[i];
1033                if (ch == '/' && --nslash <= 0)
1034                        return &line[i];
1035        }
1036        return NULL;
1037}
1038
1039/*
1040 * This is to extract the same name that appears on "diff --git"
1041 * line.  We do not find and return anything if it is a rename
1042 * patch, and it is OK because we will find the name elsewhere.
1043 * We need to reliably find name only when it is mode-change only,
1044 * creation or deletion of an empty file.  In any of these cases,
1045 * both sides are the same name under a/ and b/ respectively.
1046 */
1047static char *git_header_name(char *line, int llen)
1048{
1049        const char *name;
1050        const char *second = NULL;
1051        size_t len, line_len;
1052
1053        line += strlen("diff --git ");
1054        llen -= strlen("diff --git ");
1055
1056        if (*line == '"') {
1057                const char *cp;
1058                struct strbuf first = STRBUF_INIT;
1059                struct strbuf sp = STRBUF_INIT;
1060
1061                if (unquote_c_style(&first, line, &second))
1062                        goto free_and_fail1;
1063
1064                /* advance to the first slash */
1065                cp = stop_at_slash(first.buf, first.len);
1066                /* we do not accept absolute paths */
1067                if (!cp || cp == first.buf)
1068                        goto free_and_fail1;
1069                strbuf_remove(&first, 0, cp + 1 - first.buf);
1070
1071                /*
1072                 * second points at one past closing dq of name.
1073                 * find the second name.
1074                 */
1075                while ((second < line + llen) && isspace(*second))
1076                        second++;
1077
1078                if (line + llen <= second)
1079                        goto free_and_fail1;
1080                if (*second == '"') {
1081                        if (unquote_c_style(&sp, second, NULL))
1082                                goto free_and_fail1;
1083                        cp = stop_at_slash(sp.buf, sp.len);
1084                        if (!cp || cp == sp.buf)
1085                                goto free_and_fail1;
1086                        /* They must match, otherwise ignore */
1087                        if (strcmp(cp + 1, first.buf))
1088                                goto free_and_fail1;
1089                        strbuf_release(&sp);
1090                        return strbuf_detach(&first, NULL);
1091                }
1092
1093                /* unquoted second */
1094                cp = stop_at_slash(second, line + llen - second);
1095                if (!cp || cp == second)
1096                        goto free_and_fail1;
1097                cp++;
1098                if (line + llen - cp != first.len + 1 ||
1099                    memcmp(first.buf, cp, first.len))
1100                        goto free_and_fail1;
1101                return strbuf_detach(&first, NULL);
1102
1103        free_and_fail1:
1104                strbuf_release(&first);
1105                strbuf_release(&sp);
1106                return NULL;
1107        }
1108
1109        /* unquoted first name */
1110        name = stop_at_slash(line, llen);
1111        if (!name || name == line)
1112                return NULL;
1113        name++;
1114
1115        /*
1116         * since the first name is unquoted, a dq if exists must be
1117         * the beginning of the second name.
1118         */
1119        for (second = name; second < line + llen; second++) {
1120                if (*second == '"') {
1121                        struct strbuf sp = STRBUF_INIT;
1122                        const char *np;
1123
1124                        if (unquote_c_style(&sp, second, NULL))
1125                                goto free_and_fail2;
1126
1127                        np = stop_at_slash(sp.buf, sp.len);
1128                        if (!np || np == sp.buf)
1129                                goto free_and_fail2;
1130                        np++;
1131
1132                        len = sp.buf + sp.len - np;
1133                        if (len < second - name &&
1134                            !strncmp(np, name, len) &&
1135                            isspace(name[len])) {
1136                                /* Good */
1137                                strbuf_remove(&sp, 0, np - sp.buf);
1138                                return strbuf_detach(&sp, NULL);
1139                        }
1140
1141                free_and_fail2:
1142                        strbuf_release(&sp);
1143                        return NULL;
1144                }
1145        }
1146
1147        /*
1148         * Accept a name only if it shows up twice, exactly the same
1149         * form.
1150         */
1151        second = strchr(name, '\n');
1152        if (!second)
1153                return NULL;
1154        line_len = second - name;
1155        for (len = 0 ; ; len++) {
1156                switch (name[len]) {
1157                default:
1158                        continue;
1159                case '\n':
1160                        return NULL;
1161                case '\t': case ' ':
1162                        second = stop_at_slash(name + len, line_len - len);
1163                        if (!second)
1164                                return NULL;
1165                        second++;
1166                        if (second[len] == '\n' && !strncmp(name, second, len)) {
1167                                return xmemdupz(name, len);
1168                        }
1169                }
1170        }
1171}
1172
1173/* Verify that we recognize the lines following a git header */
1174static int parse_git_header(char *line, int len, unsigned int size, struct patch *patch)
1175{
1176        unsigned long offset;
1177
1178        /* A git diff has explicit new/delete information, so we don't guess */
1179        patch->is_new = 0;
1180        patch->is_delete = 0;
1181
1182        /*
1183         * Some things may not have the old name in the
1184         * rest of the headers anywhere (pure mode changes,
1185         * or removing or adding empty files), so we get
1186         * the default name from the header.
1187         */
1188        patch->def_name = git_header_name(line, len);
1189        if (patch->def_name && root) {
1190                char *s = xmalloc(root_len + strlen(patch->def_name) + 1);
1191                strcpy(s, root);
1192                strcpy(s + root_len, patch->def_name);
1193                free(patch->def_name);
1194                patch->def_name = s;
1195        }
1196
1197        line += len;
1198        size -= len;
1199        linenr++;
1200        for (offset = len ; size > 0 ; offset += len, size -= len, line += len, linenr++) {
1201                static const struct opentry {
1202                        const char *str;
1203                        int (*fn)(const char *, struct patch *);
1204                } optable[] = {
1205                        { "@@ -", gitdiff_hdrend },
1206                        { "--- ", gitdiff_oldname },
1207                        { "+++ ", gitdiff_newname },
1208                        { "old mode ", gitdiff_oldmode },
1209                        { "new mode ", gitdiff_newmode },
1210                        { "deleted file mode ", gitdiff_delete },
1211                        { "new file mode ", gitdiff_newfile },
1212                        { "copy from ", gitdiff_copysrc },
1213                        { "copy to ", gitdiff_copydst },
1214                        { "rename old ", gitdiff_renamesrc },
1215                        { "rename new ", gitdiff_renamedst },
1216                        { "rename from ", gitdiff_renamesrc },
1217                        { "rename to ", gitdiff_renamedst },
1218                        { "similarity index ", gitdiff_similarity },
1219                        { "dissimilarity index ", gitdiff_dissimilarity },
1220                        { "index ", gitdiff_index },
1221                        { "", gitdiff_unrecognized },
1222                };
1223                int i;
1224
1225                len = linelen(line, size);
1226                if (!len || line[len-1] != '\n')
1227                        break;
1228                for (i = 0; i < ARRAY_SIZE(optable); i++) {
1229                        const struct opentry *p = optable + i;
1230                        int oplen = strlen(p->str);
1231                        if (len < oplen || memcmp(p->str, line, oplen))
1232                                continue;
1233                        if (p->fn(line + oplen, patch) < 0)
1234                                return offset;
1235                        break;
1236                }
1237        }
1238
1239        return offset;
1240}
1241
1242static int parse_num(const char *line, unsigned long *p)
1243{
1244        char *ptr;
1245
1246        if (!isdigit(*line))
1247                return 0;
1248        *p = strtoul(line, &ptr, 10);
1249        return ptr - line;
1250}
1251
1252static int parse_range(const char *line, int len, int offset, const char *expect,
1253                       unsigned long *p1, unsigned long *p2)
1254{
1255        int digits, ex;
1256
1257        if (offset < 0 || offset >= len)
1258                return -1;
1259        line += offset;
1260        len -= offset;
1261
1262        digits = parse_num(line, p1);
1263        if (!digits)
1264                return -1;
1265
1266        offset += digits;
1267        line += digits;
1268        len -= digits;
1269
1270        *p2 = 1;
1271        if (*line == ',') {
1272                digits = parse_num(line+1, p2);
1273                if (!digits)
1274                        return -1;
1275
1276                offset += digits+1;
1277                line += digits+1;
1278                len -= digits+1;
1279        }
1280
1281        ex = strlen(expect);
1282        if (ex > len)
1283                return -1;
1284        if (memcmp(line, expect, ex))
1285                return -1;
1286
1287        return offset + ex;
1288}
1289
1290static void recount_diff(char *line, int size, struct fragment *fragment)
1291{
1292        int oldlines = 0, newlines = 0, ret = 0;
1293
1294        if (size < 1) {
1295                warning("recount: ignore empty hunk");
1296                return;
1297        }
1298
1299        for (;;) {
1300                int len = linelen(line, size);
1301                size -= len;
1302                line += len;
1303
1304                if (size < 1)
1305                        break;
1306
1307                switch (*line) {
1308                case ' ': case '\n':
1309                        newlines++;
1310                        /* fall through */
1311                case '-':
1312                        oldlines++;
1313                        continue;
1314                case '+':
1315                        newlines++;
1316                        continue;
1317                case '\\':
1318                        continue;
1319                case '@':
1320                        ret = size < 3 || prefixcmp(line, "@@ ");
1321                        break;
1322                case 'd':
1323                        ret = size < 5 || prefixcmp(line, "diff ");
1324                        break;
1325                default:
1326                        ret = -1;
1327                        break;
1328                }
1329                if (ret) {
1330                        warning("recount: unexpected line: %.*s",
1331                                (int)linelen(line, size), line);
1332                        return;
1333                }
1334                break;
1335        }
1336        fragment->oldlines = oldlines;
1337        fragment->newlines = newlines;
1338}
1339
1340/*
1341 * Parse a unified diff fragment header of the
1342 * form "@@ -a,b +c,d @@"
1343 */
1344static int parse_fragment_header(char *line, int len, struct fragment *fragment)
1345{
1346        int offset;
1347
1348        if (!len || line[len-1] != '\n')
1349                return -1;
1350
1351        /* Figure out the number of lines in a fragment */
1352        offset = parse_range(line, len, 4, " +", &fragment->oldpos, &fragment->oldlines);
1353        offset = parse_range(line, len, offset, " @@", &fragment->newpos, &fragment->newlines);
1354
1355        return offset;
1356}
1357
1358static int find_header(char *line, unsigned long size, int *hdrsize, struct patch *patch)
1359{
1360        unsigned long offset, len;
1361
1362        patch->is_toplevel_relative = 0;
1363        patch->is_rename = patch->is_copy = 0;
1364        patch->is_new = patch->is_delete = -1;
1365        patch->old_mode = patch->new_mode = 0;
1366        patch->old_name = patch->new_name = NULL;
1367        for (offset = 0; size > 0; offset += len, size -= len, line += len, linenr++) {
1368                unsigned long nextlen;
1369
1370                len = linelen(line, size);
1371                if (!len)
1372                        break;
1373
1374                /* Testing this early allows us to take a few shortcuts.. */
1375                if (len < 6)
1376                        continue;
1377
1378                /*
1379                 * Make sure we don't find any unconnected patch fragments.
1380                 * That's a sign that we didn't find a header, and that a
1381                 * patch has become corrupted/broken up.
1382                 */
1383                if (!memcmp("@@ -", line, 4)) {
1384                        struct fragment dummy;
1385                        if (parse_fragment_header(line, len, &dummy) < 0)
1386                                continue;
1387                        die("patch fragment without header at line %d: %.*s",
1388                            linenr, (int)len-1, line);
1389                }
1390
1391                if (size < len + 6)
1392                        break;
1393
1394                /*
1395                 * Git patch? It might not have a real patch, just a rename
1396                 * or mode change, so we handle that specially
1397                 */
1398                if (!memcmp("diff --git ", line, 11)) {
1399                        int git_hdr_len = parse_git_header(line, len, size, patch);
1400                        if (git_hdr_len <= len)
1401                                continue;
1402                        if (!patch->old_name && !patch->new_name) {
1403                                if (!patch->def_name)
1404                                        die("git diff header lacks filename information when removing "
1405                                            "%d leading pathname components (line %d)" , p_value, linenr);
1406                                patch->old_name = patch->new_name = patch->def_name;
1407                        }
1408                        if (!patch->is_delete && !patch->new_name)
1409                                die("git diff header lacks filename information "
1410                                    "(line %d)", linenr);
1411                        patch->is_toplevel_relative = 1;
1412                        *hdrsize = git_hdr_len;
1413                        return offset;
1414                }
1415
1416                /* --- followed by +++ ? */
1417                if (memcmp("--- ", line,  4) || memcmp("+++ ", line + len, 4))
1418                        continue;
1419
1420                /*
1421                 * We only accept unified patches, so we want it to
1422                 * at least have "@@ -a,b +c,d @@\n", which is 14 chars
1423                 * minimum ("@@ -0,0 +1 @@\n" is the shortest).
1424                 */
1425                nextlen = linelen(line + len, size - len);
1426                if (size < nextlen + 14 || memcmp("@@ -", line + len + nextlen, 4))
1427                        continue;
1428
1429                /* Ok, we'll consider it a patch */
1430                parse_traditional_patch(line, line+len, patch);
1431                *hdrsize = len + nextlen;
1432                linenr += 2;
1433                return offset;
1434        }
1435        return -1;
1436}
1437
1438static void record_ws_error(unsigned result, const char *line, int len, int linenr)
1439{
1440        char *err;
1441
1442        if (!result)
1443                return;
1444
1445        whitespace_error++;
1446        if (squelch_whitespace_errors &&
1447            squelch_whitespace_errors < whitespace_error)
1448                return;
1449
1450        err = whitespace_error_string(result);
1451        fprintf(stderr, "%s:%d: %s.\n%.*s\n",
1452                patch_input_file, linenr, err, len, line);
1453        free(err);
1454}
1455
1456static void check_whitespace(const char *line, int len, unsigned ws_rule)
1457{
1458        unsigned result = ws_check(line + 1, len - 1, ws_rule);
1459
1460        record_ws_error(result, line + 1, len - 2, linenr);
1461}
1462
1463/*
1464 * Parse a unified diff. Note that this really needs to parse each
1465 * fragment separately, since the only way to know the difference
1466 * between a "---" that is part of a patch, and a "---" that starts
1467 * the next patch is to look at the line counts..
1468 */
1469static int parse_fragment(char *line, unsigned long size,
1470                          struct patch *patch, struct fragment *fragment)
1471{
1472        int added, deleted;
1473        int len = linelen(line, size), offset;
1474        unsigned long oldlines, newlines;
1475        unsigned long leading, trailing;
1476
1477        offset = parse_fragment_header(line, len, fragment);
1478        if (offset < 0)
1479                return -1;
1480        if (offset > 0 && patch->recount)
1481                recount_diff(line + offset, size - offset, fragment);
1482        oldlines = fragment->oldlines;
1483        newlines = fragment->newlines;
1484        leading = 0;
1485        trailing = 0;
1486
1487        /* Parse the thing.. */
1488        line += len;
1489        size -= len;
1490        linenr++;
1491        added = deleted = 0;
1492        for (offset = len;
1493             0 < size;
1494             offset += len, size -= len, line += len, linenr++) {
1495                if (!oldlines && !newlines)
1496                        break;
1497                len = linelen(line, size);
1498                if (!len || line[len-1] != '\n')
1499                        return -1;
1500                switch (*line) {
1501                default:
1502                        return -1;
1503                case '\n': /* newer GNU diff, an empty context line */
1504                case ' ':
1505                        oldlines--;
1506                        newlines--;
1507                        if (!deleted && !added)
1508                                leading++;
1509                        trailing++;
1510                        break;
1511                case '-':
1512                        if (apply_in_reverse &&
1513                            ws_error_action != nowarn_ws_error)
1514                                check_whitespace(line, len, patch->ws_rule);
1515                        deleted++;
1516                        oldlines--;
1517                        trailing = 0;
1518                        break;
1519                case '+':
1520                        if (!apply_in_reverse &&
1521                            ws_error_action != nowarn_ws_error)
1522                                check_whitespace(line, len, patch->ws_rule);
1523                        added++;
1524                        newlines--;
1525                        trailing = 0;
1526                        break;
1527
1528                /*
1529                 * We allow "\ No newline at end of file". Depending
1530                 * on locale settings when the patch was produced we
1531                 * don't know what this line looks like. The only
1532                 * thing we do know is that it begins with "\ ".
1533                 * Checking for 12 is just for sanity check -- any
1534                 * l10n of "\ No newline..." is at least that long.
1535                 */
1536                case '\\':
1537                        if (len < 12 || memcmp(line, "\\ ", 2))
1538                                return -1;
1539                        break;
1540                }
1541        }
1542        if (oldlines || newlines)
1543                return -1;
1544        fragment->leading = leading;
1545        fragment->trailing = trailing;
1546
1547        /*
1548         * If a fragment ends with an incomplete line, we failed to include
1549         * it in the above loop because we hit oldlines == newlines == 0
1550         * before seeing it.
1551         */
1552        if (12 < size && !memcmp(line, "\\ ", 2))
1553                offset += linelen(line, size);
1554
1555        patch->lines_added += added;
1556        patch->lines_deleted += deleted;
1557
1558        if (0 < patch->is_new && oldlines)
1559                return error("new file depends on old contents");
1560        if (0 < patch->is_delete && newlines)
1561                return error("deleted file still has contents");
1562        return offset;
1563}
1564
1565static int parse_single_patch(char *line, unsigned long size, struct patch *patch)
1566{
1567        unsigned long offset = 0;
1568        unsigned long oldlines = 0, newlines = 0, context = 0;
1569        struct fragment **fragp = &patch->fragments;
1570
1571        while (size > 4 && !memcmp(line, "@@ -", 4)) {
1572                struct fragment *fragment;
1573                int len;
1574
1575                fragment = xcalloc(1, sizeof(*fragment));
1576                fragment->linenr = linenr;
1577                len = parse_fragment(line, size, patch, fragment);
1578                if (len <= 0)
1579                        die("corrupt patch at line %d", linenr);
1580                fragment->patch = line;
1581                fragment->size = len;
1582                oldlines += fragment->oldlines;
1583                newlines += fragment->newlines;
1584                context += fragment->leading + fragment->trailing;
1585
1586                *fragp = fragment;
1587                fragp = &fragment->next;
1588
1589                offset += len;
1590                line += len;
1591                size -= len;
1592        }
1593
1594        /*
1595         * If something was removed (i.e. we have old-lines) it cannot
1596         * be creation, and if something was added it cannot be
1597         * deletion.  However, the reverse is not true; --unified=0
1598         * patches that only add are not necessarily creation even
1599         * though they do not have any old lines, and ones that only
1600         * delete are not necessarily deletion.
1601         *
1602         * Unfortunately, a real creation/deletion patch do _not_ have
1603         * any context line by definition, so we cannot safely tell it
1604         * apart with --unified=0 insanity.  At least if the patch has
1605         * more than one hunk it is not creation or deletion.
1606         */
1607        if (patch->is_new < 0 &&
1608            (oldlines || (patch->fragments && patch->fragments->next)))
1609                patch->is_new = 0;
1610        if (patch->is_delete < 0 &&
1611            (newlines || (patch->fragments && patch->fragments->next)))
1612                patch->is_delete = 0;
1613
1614        if (0 < patch->is_new && oldlines)
1615                die("new file %s depends on old contents", patch->new_name);
1616        if (0 < patch->is_delete && newlines)
1617                die("deleted file %s still has contents", patch->old_name);
1618        if (!patch->is_delete && !newlines && context)
1619                fprintf(stderr, "** warning: file %s becomes empty but "
1620                        "is not deleted\n", patch->new_name);
1621
1622        return offset;
1623}
1624
1625static inline int metadata_changes(struct patch *patch)
1626{
1627        return  patch->is_rename > 0 ||
1628                patch->is_copy > 0 ||
1629                patch->is_new > 0 ||
1630                patch->is_delete ||
1631                (patch->old_mode && patch->new_mode &&
1632                 patch->old_mode != patch->new_mode);
1633}
1634
1635static char *inflate_it(const void *data, unsigned long size,
1636                        unsigned long inflated_size)
1637{
1638        git_zstream stream;
1639        void *out;
1640        int st;
1641
1642        memset(&stream, 0, sizeof(stream));
1643
1644        stream.next_in = (unsigned char *)data;
1645        stream.avail_in = size;
1646        stream.next_out = out = xmalloc(inflated_size);
1647        stream.avail_out = inflated_size;
1648        git_inflate_init(&stream);
1649        st = git_inflate(&stream, Z_FINISH);
1650        git_inflate_end(&stream);
1651        if ((st != Z_STREAM_END) || stream.total_out != inflated_size) {
1652                free(out);
1653                return NULL;
1654        }
1655        return out;
1656}
1657
1658static struct fragment *parse_binary_hunk(char **buf_p,
1659                                          unsigned long *sz_p,
1660                                          int *status_p,
1661                                          int *used_p)
1662{
1663        /*
1664         * Expect a line that begins with binary patch method ("literal"
1665         * or "delta"), followed by the length of data before deflating.
1666         * a sequence of 'length-byte' followed by base-85 encoded data
1667         * should follow, terminated by a newline.
1668         *
1669         * Each 5-byte sequence of base-85 encodes up to 4 bytes,
1670         * and we would limit the patch line to 66 characters,
1671         * so one line can fit up to 13 groups that would decode
1672         * to 52 bytes max.  The length byte 'A'-'Z' corresponds
1673         * to 1-26 bytes, and 'a'-'z' corresponds to 27-52 bytes.
1674         */
1675        int llen, used;
1676        unsigned long size = *sz_p;
1677        char *buffer = *buf_p;
1678        int patch_method;
1679        unsigned long origlen;
1680        char *data = NULL;
1681        int hunk_size = 0;
1682        struct fragment *frag;
1683
1684        llen = linelen(buffer, size);
1685        used = llen;
1686
1687        *status_p = 0;
1688
1689        if (!prefixcmp(buffer, "delta ")) {
1690                patch_method = BINARY_DELTA_DEFLATED;
1691                origlen = strtoul(buffer + 6, NULL, 10);
1692        }
1693        else if (!prefixcmp(buffer, "literal ")) {
1694                patch_method = BINARY_LITERAL_DEFLATED;
1695                origlen = strtoul(buffer + 8, NULL, 10);
1696        }
1697        else
1698                return NULL;
1699
1700        linenr++;
1701        buffer += llen;
1702        while (1) {
1703                int byte_length, max_byte_length, newsize;
1704                llen = linelen(buffer, size);
1705                used += llen;
1706                linenr++;
1707                if (llen == 1) {
1708                        /* consume the blank line */
1709                        buffer++;
1710                        size--;
1711                        break;
1712                }
1713                /*
1714                 * Minimum line is "A00000\n" which is 7-byte long,
1715                 * and the line length must be multiple of 5 plus 2.
1716                 */
1717                if ((llen < 7) || (llen-2) % 5)
1718                        goto corrupt;
1719                max_byte_length = (llen - 2) / 5 * 4;
1720                byte_length = *buffer;
1721                if ('A' <= byte_length && byte_length <= 'Z')
1722                        byte_length = byte_length - 'A' + 1;
1723                else if ('a' <= byte_length && byte_length <= 'z')
1724                        byte_length = byte_length - 'a' + 27;
1725                else
1726                        goto corrupt;
1727                /* if the input length was not multiple of 4, we would
1728                 * have filler at the end but the filler should never
1729                 * exceed 3 bytes
1730                 */
1731                if (max_byte_length < byte_length ||
1732                    byte_length <= max_byte_length - 4)
1733                        goto corrupt;
1734                newsize = hunk_size + byte_length;
1735                data = xrealloc(data, newsize);
1736                if (decode_85(data + hunk_size, buffer + 1, byte_length))
1737                        goto corrupt;
1738                hunk_size = newsize;
1739                buffer += llen;
1740                size -= llen;
1741        }
1742
1743        frag = xcalloc(1, sizeof(*frag));
1744        frag->patch = inflate_it(data, hunk_size, origlen);
1745        if (!frag->patch)
1746                goto corrupt;
1747        free(data);
1748        frag->size = origlen;
1749        *buf_p = buffer;
1750        *sz_p = size;
1751        *used_p = used;
1752        frag->binary_patch_method = patch_method;
1753        return frag;
1754
1755 corrupt:
1756        free(data);
1757        *status_p = -1;
1758        error("corrupt binary patch at line %d: %.*s",
1759              linenr-1, llen-1, buffer);
1760        return NULL;
1761}
1762
1763static int parse_binary(char *buffer, unsigned long size, struct patch *patch)
1764{
1765        /*
1766         * We have read "GIT binary patch\n"; what follows is a line
1767         * that says the patch method (currently, either "literal" or
1768         * "delta") and the length of data before deflating; a
1769         * sequence of 'length-byte' followed by base-85 encoded data
1770         * follows.
1771         *
1772         * When a binary patch is reversible, there is another binary
1773         * hunk in the same format, starting with patch method (either
1774         * "literal" or "delta") with the length of data, and a sequence
1775         * of length-byte + base-85 encoded data, terminated with another
1776         * empty line.  This data, when applied to the postimage, produces
1777         * the preimage.
1778         */
1779        struct fragment *forward;
1780        struct fragment *reverse;
1781        int status;
1782        int used, used_1;
1783
1784        forward = parse_binary_hunk(&buffer, &size, &status, &used);
1785        if (!forward && !status)
1786                /* there has to be one hunk (forward hunk) */
1787                return error("unrecognized binary patch at line %d", linenr-1);
1788        if (status)
1789                /* otherwise we already gave an error message */
1790                return status;
1791
1792        reverse = parse_binary_hunk(&buffer, &size, &status, &used_1);
1793        if (reverse)
1794                used += used_1;
1795        else if (status) {
1796                /*
1797                 * Not having reverse hunk is not an error, but having
1798                 * a corrupt reverse hunk is.
1799                 */
1800                free((void*) forward->patch);
1801                free(forward);
1802                return status;
1803        }
1804        forward->next = reverse;
1805        patch->fragments = forward;
1806        patch->is_binary = 1;
1807        return used;
1808}
1809
1810static int parse_chunk(char *buffer, unsigned long size, struct patch *patch)
1811{
1812        int hdrsize, patchsize;
1813        int offset = find_header(buffer, size, &hdrsize, patch);
1814
1815        if (offset < 0)
1816                return offset;
1817
1818        patch->ws_rule = whitespace_rule(patch->new_name
1819                                         ? patch->new_name
1820                                         : patch->old_name);
1821
1822        patchsize = parse_single_patch(buffer + offset + hdrsize,
1823                                       size - offset - hdrsize, patch);
1824
1825        if (!patchsize) {
1826                static const char *binhdr[] = {
1827                        "Binary files ",
1828                        "Files ",
1829                        NULL,
1830                };
1831                static const char git_binary[] = "GIT binary patch\n";
1832                int i;
1833                int hd = hdrsize + offset;
1834                unsigned long llen = linelen(buffer + hd, size - hd);
1835
1836                if (llen == sizeof(git_binary) - 1 &&
1837                    !memcmp(git_binary, buffer + hd, llen)) {
1838                        int used;
1839                        linenr++;
1840                        used = parse_binary(buffer + hd + llen,
1841                                            size - hd - llen, patch);
1842                        if (used)
1843                                patchsize = used + llen;
1844                        else
1845                                patchsize = 0;
1846                }
1847                else if (!memcmp(" differ\n", buffer + hd + llen - 8, 8)) {
1848                        for (i = 0; binhdr[i]; i++) {
1849                                int len = strlen(binhdr[i]);
1850                                if (len < size - hd &&
1851                                    !memcmp(binhdr[i], buffer + hd, len)) {
1852                                        linenr++;
1853                                        patch->is_binary = 1;
1854                                        patchsize = llen;
1855                                        break;
1856                                }
1857                        }
1858                }
1859
1860                /* Empty patch cannot be applied if it is a text patch
1861                 * without metadata change.  A binary patch appears
1862                 * empty to us here.
1863                 */
1864                if ((apply || check) &&
1865                    (!patch->is_binary && !metadata_changes(patch)))
1866                        die("patch with only garbage at line %d", linenr);
1867        }
1868
1869        return offset + hdrsize + patchsize;
1870}
1871
1872#define swap(a,b) myswap((a),(b),sizeof(a))
1873
1874#define myswap(a, b, size) do {         \
1875        unsigned char mytmp[size];      \
1876        memcpy(mytmp, &a, size);                \
1877        memcpy(&a, &b, size);           \
1878        memcpy(&b, mytmp, size);                \
1879} while (0)
1880
1881static void reverse_patches(struct patch *p)
1882{
1883        for (; p; p = p->next) {
1884                struct fragment *frag = p->fragments;
1885
1886                swap(p->new_name, p->old_name);
1887                swap(p->new_mode, p->old_mode);
1888                swap(p->is_new, p->is_delete);
1889                swap(p->lines_added, p->lines_deleted);
1890                swap(p->old_sha1_prefix, p->new_sha1_prefix);
1891
1892                for (; frag; frag = frag->next) {
1893                        swap(frag->newpos, frag->oldpos);
1894                        swap(frag->newlines, frag->oldlines);
1895                }
1896        }
1897}
1898
1899static const char pluses[] =
1900"++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++";
1901static const char minuses[]=
1902"----------------------------------------------------------------------";
1903
1904static void show_stats(struct patch *patch)
1905{
1906        struct strbuf qname = STRBUF_INIT;
1907        char *cp = patch->new_name ? patch->new_name : patch->old_name;
1908        int max, add, del;
1909
1910        quote_c_style(cp, &qname, NULL, 0);
1911
1912        /*
1913         * "scale" the filename
1914         */
1915        max = max_len;
1916        if (max > 50)
1917                max = 50;
1918
1919        if (qname.len > max) {
1920                cp = strchr(qname.buf + qname.len + 3 - max, '/');
1921                if (!cp)
1922                        cp = qname.buf + qname.len + 3 - max;
1923                strbuf_splice(&qname, 0, cp - qname.buf, "...", 3);
1924        }
1925
1926        if (patch->is_binary) {
1927                printf(" %-*s |  Bin\n", max, qname.buf);
1928                strbuf_release(&qname);
1929                return;
1930        }
1931
1932        printf(" %-*s |", max, qname.buf);
1933        strbuf_release(&qname);
1934
1935        /*
1936         * scale the add/delete
1937         */
1938        max = max + max_change > 70 ? 70 - max : max_change;
1939        add = patch->lines_added;
1940        del = patch->lines_deleted;
1941
1942        if (max_change > 0) {
1943                int total = ((add + del) * max + max_change / 2) / max_change;
1944                add = (add * max + max_change / 2) / max_change;
1945                del = total - add;
1946        }
1947        printf("%5d %.*s%.*s\n", patch->lines_added + patch->lines_deleted,
1948                add, pluses, del, minuses);
1949}
1950
1951static int read_old_data(struct stat *st, const char *path, struct strbuf *buf)
1952{
1953        switch (st->st_mode & S_IFMT) {
1954        case S_IFLNK:
1955                if (strbuf_readlink(buf, path, st->st_size) < 0)
1956                        return error("unable to read symlink %s", path);
1957                return 0;
1958        case S_IFREG:
1959                if (strbuf_read_file(buf, path, st->st_size) != st->st_size)
1960                        return error("unable to open or read %s", path);
1961                convert_to_git(path, buf->buf, buf->len, buf, 0);
1962                return 0;
1963        default:
1964                return -1;
1965        }
1966}
1967
1968/*
1969 * Update the preimage, and the common lines in postimage,
1970 * from buffer buf of length len. If postlen is 0 the postimage
1971 * is updated in place, otherwise it's updated on a new buffer
1972 * of length postlen
1973 */
1974
1975static void update_pre_post_images(struct image *preimage,
1976                                   struct image *postimage,
1977                                   char *buf,
1978                                   size_t len, size_t postlen)
1979{
1980        int i, ctx;
1981        char *new, *old, *fixed;
1982        struct image fixed_preimage;
1983
1984        /*
1985         * Update the preimage with whitespace fixes.  Note that we
1986         * are not losing preimage->buf -- apply_one_fragment() will
1987         * free "oldlines".
1988         */
1989        prepare_image(&fixed_preimage, buf, len, 1);
1990        assert(fixed_preimage.nr == preimage->nr);
1991        for (i = 0; i < preimage->nr; i++)
1992                fixed_preimage.line[i].flag = preimage->line[i].flag;
1993        free(preimage->line_allocated);
1994        *preimage = fixed_preimage;
1995
1996        /*
1997         * Adjust the common context lines in postimage. This can be
1998         * done in-place when we are just doing whitespace fixing,
1999         * which does not make the string grow, but needs a new buffer
2000         * when ignoring whitespace causes the update, since in this case
2001         * we could have e.g. tabs converted to multiple spaces.
2002         * We trust the caller to tell us if the update can be done
2003         * in place (postlen==0) or not.
2004         */
2005        old = postimage->buf;
2006        if (postlen)
2007                new = postimage->buf = xmalloc(postlen);
2008        else
2009                new = old;
2010        fixed = preimage->buf;
2011        for (i = ctx = 0; i < postimage->nr; i++) {
2012                size_t len = postimage->line[i].len;
2013                if (!(postimage->line[i].flag & LINE_COMMON)) {
2014                        /* an added line -- no counterparts in preimage */
2015                        memmove(new, old, len);
2016                        old += len;
2017                        new += len;
2018                        continue;
2019                }
2020
2021                /* a common context -- skip it in the original postimage */
2022                old += len;
2023
2024                /* and find the corresponding one in the fixed preimage */
2025                while (ctx < preimage->nr &&
2026                       !(preimage->line[ctx].flag & LINE_COMMON)) {
2027                        fixed += preimage->line[ctx].len;
2028                        ctx++;
2029                }
2030                if (preimage->nr <= ctx)
2031                        die("oops");
2032
2033                /* and copy it in, while fixing the line length */
2034                len = preimage->line[ctx].len;
2035                memcpy(new, fixed, len);
2036                new += len;
2037                fixed += len;
2038                postimage->line[i].len = len;
2039                ctx++;
2040        }
2041
2042        /* Fix the length of the whole thing */
2043        postimage->len = new - postimage->buf;
2044}
2045
2046static int match_fragment(struct image *img,
2047                          struct image *preimage,
2048                          struct image *postimage,
2049                          unsigned long try,
2050                          int try_lno,
2051                          unsigned ws_rule,
2052                          int match_beginning, int match_end)
2053{
2054        int i;
2055        char *fixed_buf, *buf, *orig, *target;
2056        struct strbuf fixed;
2057        size_t fixed_len;
2058        int preimage_limit;
2059
2060        if (preimage->nr + try_lno <= img->nr) {
2061                /*
2062                 * The hunk falls within the boundaries of img.
2063                 */
2064                preimage_limit = preimage->nr;
2065                if (match_end && (preimage->nr + try_lno != img->nr))
2066                        return 0;
2067        } else if (ws_error_action == correct_ws_error &&
2068                   (ws_rule & WS_BLANK_AT_EOF)) {
2069                /*
2070                 * This hunk extends beyond the end of img, and we are
2071                 * removing blank lines at the end of the file.  This
2072                 * many lines from the beginning of the preimage must
2073                 * match with img, and the remainder of the preimage
2074                 * must be blank.
2075                 */
2076                preimage_limit = img->nr - try_lno;
2077        } else {
2078                /*
2079                 * The hunk extends beyond the end of the img and
2080                 * we are not removing blanks at the end, so we
2081                 * should reject the hunk at this position.
2082                 */
2083                return 0;
2084        }
2085
2086        if (match_beginning && try_lno)
2087                return 0;
2088
2089        /* Quick hash check */
2090        for (i = 0; i < preimage_limit; i++)
2091                if ((img->line[try_lno + i].flag & LINE_PATCHED) ||
2092                    (preimage->line[i].hash != img->line[try_lno + i].hash))
2093                        return 0;
2094
2095        if (preimage_limit == preimage->nr) {
2096                /*
2097                 * Do we have an exact match?  If we were told to match
2098                 * at the end, size must be exactly at try+fragsize,
2099                 * otherwise try+fragsize must be still within the preimage,
2100                 * and either case, the old piece should match the preimage
2101                 * exactly.
2102                 */
2103                if ((match_end
2104                     ? (try + preimage->len == img->len)
2105                     : (try + preimage->len <= img->len)) &&
2106                    !memcmp(img->buf + try, preimage->buf, preimage->len))
2107                        return 1;
2108        } else {
2109                /*
2110                 * The preimage extends beyond the end of img, so
2111                 * there cannot be an exact match.
2112                 *
2113                 * There must be one non-blank context line that match
2114                 * a line before the end of img.
2115                 */
2116                char *buf_end;
2117
2118                buf = preimage->buf;
2119                buf_end = buf;
2120                for (i = 0; i < preimage_limit; i++)
2121                        buf_end += preimage->line[i].len;
2122
2123                for ( ; buf < buf_end; buf++)
2124                        if (!isspace(*buf))
2125                                break;
2126                if (buf == buf_end)
2127                        return 0;
2128        }
2129
2130        /*
2131         * No exact match. If we are ignoring whitespace, run a line-by-line
2132         * fuzzy matching. We collect all the line length information because
2133         * we need it to adjust whitespace if we match.
2134         */
2135        if (ws_ignore_action == ignore_ws_change) {
2136                size_t imgoff = 0;
2137                size_t preoff = 0;
2138                size_t postlen = postimage->len;
2139                size_t extra_chars;
2140                char *preimage_eof;
2141                char *preimage_end;
2142                for (i = 0; i < preimage_limit; i++) {
2143                        size_t prelen = preimage->line[i].len;
2144                        size_t imglen = img->line[try_lno+i].len;
2145
2146                        if (!fuzzy_matchlines(img->buf + try + imgoff, imglen,
2147                                              preimage->buf + preoff, prelen))
2148                                return 0;
2149                        if (preimage->line[i].flag & LINE_COMMON)
2150                                postlen += imglen - prelen;
2151                        imgoff += imglen;
2152                        preoff += prelen;
2153                }
2154
2155                /*
2156                 * Ok, the preimage matches with whitespace fuzz.
2157                 *
2158                 * imgoff now holds the true length of the target that
2159                 * matches the preimage before the end of the file.
2160                 *
2161                 * Count the number of characters in the preimage that fall
2162                 * beyond the end of the file and make sure that all of them
2163                 * are whitespace characters. (This can only happen if
2164                 * we are removing blank lines at the end of the file.)
2165                 */
2166                buf = preimage_eof = preimage->buf + preoff;
2167                for ( ; i < preimage->nr; i++)
2168                        preoff += preimage->line[i].len;
2169                preimage_end = preimage->buf + preoff;
2170                for ( ; buf < preimage_end; buf++)
2171                        if (!isspace(*buf))
2172                                return 0;
2173
2174                /*
2175                 * Update the preimage and the common postimage context
2176                 * lines to use the same whitespace as the target.
2177                 * If whitespace is missing in the target (i.e.
2178                 * if the preimage extends beyond the end of the file),
2179                 * use the whitespace from the preimage.
2180                 */
2181                extra_chars = preimage_end - preimage_eof;
2182                strbuf_init(&fixed, imgoff + extra_chars);
2183                strbuf_add(&fixed, img->buf + try, imgoff);
2184                strbuf_add(&fixed, preimage_eof, extra_chars);
2185                fixed_buf = strbuf_detach(&fixed, &fixed_len);
2186                update_pre_post_images(preimage, postimage,
2187                                fixed_buf, fixed_len, postlen);
2188                return 1;
2189        }
2190
2191        if (ws_error_action != correct_ws_error)
2192                return 0;
2193
2194        /*
2195         * The hunk does not apply byte-by-byte, but the hash says
2196         * it might with whitespace fuzz. We haven't been asked to
2197         * ignore whitespace, we were asked to correct whitespace
2198         * errors, so let's try matching after whitespace correction.
2199         *
2200         * The preimage may extend beyond the end of the file,
2201         * but in this loop we will only handle the part of the
2202         * preimage that falls within the file.
2203         */
2204        strbuf_init(&fixed, preimage->len + 1);
2205        orig = preimage->buf;
2206        target = img->buf + try;
2207        for (i = 0; i < preimage_limit; i++) {
2208                size_t oldlen = preimage->line[i].len;
2209                size_t tgtlen = img->line[try_lno + i].len;
2210                size_t fixstart = fixed.len;
2211                struct strbuf tgtfix;
2212                int match;
2213
2214                /* Try fixing the line in the preimage */
2215                ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);
2216
2217                /* Try fixing the line in the target */
2218                strbuf_init(&tgtfix, tgtlen);
2219                ws_fix_copy(&tgtfix, target, tgtlen, ws_rule, NULL);
2220
2221                /*
2222                 * If they match, either the preimage was based on
2223                 * a version before our tree fixed whitespace breakage,
2224                 * or we are lacking a whitespace-fix patch the tree
2225                 * the preimage was based on already had (i.e. target
2226                 * has whitespace breakage, the preimage doesn't).
2227                 * In either case, we are fixing the whitespace breakages
2228                 * so we might as well take the fix together with their
2229                 * real change.
2230                 */
2231                match = (tgtfix.len == fixed.len - fixstart &&
2232                         !memcmp(tgtfix.buf, fixed.buf + fixstart,
2233                                             fixed.len - fixstart));
2234
2235                strbuf_release(&tgtfix);
2236                if (!match)
2237                        goto unmatch_exit;
2238
2239                orig += oldlen;
2240                target += tgtlen;
2241        }
2242
2243
2244        /*
2245         * Now handle the lines in the preimage that falls beyond the
2246         * end of the file (if any). They will only match if they are
2247         * empty or only contain whitespace (if WS_BLANK_AT_EOL is
2248         * false).
2249         */
2250        for ( ; i < preimage->nr; i++) {
2251                size_t fixstart = fixed.len; /* start of the fixed preimage */
2252                size_t oldlen = preimage->line[i].len;
2253                int j;
2254
2255                /* Try fixing the line in the preimage */
2256                ws_fix_copy(&fixed, orig, oldlen, ws_rule, NULL);
2257
2258                for (j = fixstart; j < fixed.len; j++)
2259                        if (!isspace(fixed.buf[j]))
2260                                goto unmatch_exit;
2261
2262                orig += oldlen;
2263        }
2264
2265        /*
2266         * Yes, the preimage is based on an older version that still
2267         * has whitespace breakages unfixed, and fixing them makes the
2268         * hunk match.  Update the context lines in the postimage.
2269         */
2270        fixed_buf = strbuf_detach(&fixed, &fixed_len);
2271        update_pre_post_images(preimage, postimage,
2272                               fixed_buf, fixed_len, 0);
2273        return 1;
2274
2275 unmatch_exit:
2276        strbuf_release(&fixed);
2277        return 0;
2278}
2279
2280static int find_pos(struct image *img,
2281                    struct image *preimage,
2282                    struct image *postimage,
2283                    int line,
2284                    unsigned ws_rule,
2285                    int match_beginning, int match_end)
2286{
2287        int i;
2288        unsigned long backwards, forwards, try;
2289        int backwards_lno, forwards_lno, try_lno;
2290
2291        /*
2292         * If match_beginning or match_end is specified, there is no
2293         * point starting from a wrong line that will never match and
2294         * wander around and wait for a match at the specified end.
2295         */
2296        if (match_beginning)
2297                line = 0;
2298        else if (match_end)
2299                line = img->nr - preimage->nr;
2300
2301        /*
2302         * Because the comparison is unsigned, the following test
2303         * will also take care of a negative line number that can
2304         * result when match_end and preimage is larger than the target.
2305         */
2306        if ((size_t) line > img->nr)
2307                line = img->nr;
2308
2309        try = 0;
2310        for (i = 0; i < line; i++)
2311                try += img->line[i].len;
2312
2313        /*
2314         * There's probably some smart way to do this, but I'll leave
2315         * that to the smart and beautiful people. I'm simple and stupid.
2316         */
2317        backwards = try;
2318        backwards_lno = line;
2319        forwards = try;
2320        forwards_lno = line;
2321        try_lno = line;
2322
2323        for (i = 0; ; i++) {
2324                if (match_fragment(img, preimage, postimage,
2325                                   try, try_lno, ws_rule,
2326                                   match_beginning, match_end))
2327                        return try_lno;
2328
2329        again:
2330                if (backwards_lno == 0 && forwards_lno == img->nr)
2331                        break;
2332
2333                if (i & 1) {
2334                        if (backwards_lno == 0) {
2335                                i++;
2336                                goto again;
2337                        }
2338                        backwards_lno--;
2339                        backwards -= img->line[backwards_lno].len;
2340                        try = backwards;
2341                        try_lno = backwards_lno;
2342                } else {
2343                        if (forwards_lno == img->nr) {
2344                                i++;
2345                                goto again;
2346                        }
2347                        forwards += img->line[forwards_lno].len;
2348                        forwards_lno++;
2349                        try = forwards;
2350                        try_lno = forwards_lno;
2351                }
2352
2353        }
2354        return -1;
2355}
2356
2357static void remove_first_line(struct image *img)
2358{
2359        img->buf += img->line[0].len;
2360        img->len -= img->line[0].len;
2361        img->line++;
2362        img->nr--;
2363}
2364
2365static void remove_last_line(struct image *img)
2366{
2367        img->len -= img->line[--img->nr].len;
2368}
2369
2370static void update_image(struct image *img,
2371                         int applied_pos,
2372                         struct image *preimage,
2373                         struct image *postimage)
2374{
2375        /*
2376         * remove the copy of preimage at offset in img
2377         * and replace it with postimage
2378         */
2379        int i, nr;
2380        size_t remove_count, insert_count, applied_at = 0;
2381        char *result;
2382        int preimage_limit;
2383
2384        /*
2385         * If we are removing blank lines at the end of img,
2386         * the preimage may extend beyond the end.
2387         * If that is the case, we must be careful only to
2388         * remove the part of the preimage that falls within
2389         * the boundaries of img. Initialize preimage_limit
2390         * to the number of lines in the preimage that falls
2391         * within the boundaries.
2392         */
2393        preimage_limit = preimage->nr;
2394        if (preimage_limit > img->nr - applied_pos)
2395                preimage_limit = img->nr - applied_pos;
2396
2397        for (i = 0; i < applied_pos; i++)
2398                applied_at += img->line[i].len;
2399
2400        remove_count = 0;
2401        for (i = 0; i < preimage_limit; i++)
2402                remove_count += img->line[applied_pos + i].len;
2403        insert_count = postimage->len;
2404
2405        /* Adjust the contents */
2406        result = xmalloc(img->len + insert_count - remove_count + 1);
2407        memcpy(result, img->buf, applied_at);
2408        memcpy(result + applied_at, postimage->buf, postimage->len);
2409        memcpy(result + applied_at + postimage->len,
2410               img->buf + (applied_at + remove_count),
2411               img->len - (applied_at + remove_count));
2412        free(img->buf);
2413        img->buf = result;
2414        img->len += insert_count - remove_count;
2415        result[img->len] = '\0';
2416
2417        /* Adjust the line table */
2418        nr = img->nr + postimage->nr - preimage_limit;
2419        if (preimage_limit < postimage->nr) {
2420                /*
2421                 * NOTE: this knows that we never call remove_first_line()
2422                 * on anything other than pre/post image.
2423                 */
2424                img->line = xrealloc(img->line, nr * sizeof(*img->line));
2425                img->line_allocated = img->line;
2426        }
2427        if (preimage_limit != postimage->nr)
2428                memmove(img->line + applied_pos + postimage->nr,
2429                        img->line + applied_pos + preimage_limit,
2430                        (img->nr - (applied_pos + preimage_limit)) *
2431                        sizeof(*img->line));
2432        memcpy(img->line + applied_pos,
2433               postimage->line,
2434               postimage->nr * sizeof(*img->line));
2435        if (!allow_overlap)
2436                for (i = 0; i < postimage->nr; i++)
2437                        img->line[applied_pos + i].flag |= LINE_PATCHED;
2438        img->nr = nr;
2439}
2440
2441static int apply_one_fragment(struct image *img, struct fragment *frag,
2442                              int inaccurate_eof, unsigned ws_rule,
2443                              int nth_fragment)
2444{
2445        int match_beginning, match_end;
2446        const char *patch = frag->patch;
2447        int size = frag->size;
2448        char *old, *oldlines;
2449        struct strbuf newlines;
2450        int new_blank_lines_at_end = 0;
2451        int found_new_blank_lines_at_end = 0;
2452        int hunk_linenr = frag->linenr;
2453        unsigned long leading, trailing;
2454        int pos, applied_pos;
2455        struct image preimage;
2456        struct image postimage;
2457
2458        memset(&preimage, 0, sizeof(preimage));
2459        memset(&postimage, 0, sizeof(postimage));
2460        oldlines = xmalloc(size);
2461        strbuf_init(&newlines, size);
2462
2463        old = oldlines;
2464        while (size > 0) {
2465                char first;
2466                int len = linelen(patch, size);
2467                int plen;
2468                int added_blank_line = 0;
2469                int is_blank_context = 0;
2470                size_t start;
2471
2472                if (!len)
2473                        break;
2474
2475                /*
2476                 * "plen" is how much of the line we should use for
2477                 * the actual patch data. Normally we just remove the
2478                 * first character on the line, but if the line is
2479                 * followed by "\ No newline", then we also remove the
2480                 * last one (which is the newline, of course).
2481                 */
2482                plen = len - 1;
2483                if (len < size && patch[len] == '\\')
2484                        plen--;
2485                first = *patch;
2486                if (apply_in_reverse) {
2487                        if (first == '-')
2488                                first = '+';
2489                        else if (first == '+')
2490                                first = '-';
2491                }
2492
2493                switch (first) {
2494                case '\n':
2495                        /* Newer GNU diff, empty context line */
2496                        if (plen < 0)
2497                                /* ... followed by '\No newline'; nothing */
2498                                break;
2499                        *old++ = '\n';
2500                        strbuf_addch(&newlines, '\n');
2501                        add_line_info(&preimage, "\n", 1, LINE_COMMON);
2502                        add_line_info(&postimage, "\n", 1, LINE_COMMON);
2503                        is_blank_context = 1;
2504                        break;
2505                case ' ':
2506                        if (plen && (ws_rule & WS_BLANK_AT_EOF) &&
2507                            ws_blank_line(patch + 1, plen, ws_rule))
2508                                is_blank_context = 1;
2509                case '-':
2510                        memcpy(old, patch + 1, plen);
2511                        add_line_info(&preimage, old, plen,
2512                                      (first == ' ' ? LINE_COMMON : 0));
2513                        old += plen;
2514                        if (first == '-')
2515                                break;
2516                /* Fall-through for ' ' */
2517                case '+':
2518                        /* --no-add does not add new lines */
2519                        if (first == '+' && no_add)
2520                                break;
2521
2522                        start = newlines.len;
2523                        if (first != '+' ||
2524                            !whitespace_error ||
2525                            ws_error_action != correct_ws_error) {
2526                                strbuf_add(&newlines, patch + 1, plen);
2527                        }
2528                        else {
2529                                ws_fix_copy(&newlines, patch + 1, plen, ws_rule, &applied_after_fixing_ws);
2530                        }
2531                        add_line_info(&postimage, newlines.buf + start, newlines.len - start,
2532                                      (first == '+' ? 0 : LINE_COMMON));
2533                        if (first == '+' &&
2534                            (ws_rule & WS_BLANK_AT_EOF) &&
2535                            ws_blank_line(patch + 1, plen, ws_rule))
2536                                added_blank_line = 1;
2537                        break;
2538                case '@': case '\\':
2539                        /* Ignore it, we already handled it */
2540                        break;
2541                default:
2542                        if (apply_verbosely)
2543                                error("invalid start of line: '%c'", first);
2544                        return -1;
2545                }
2546                if (added_blank_line) {
2547                        if (!new_blank_lines_at_end)
2548                                found_new_blank_lines_at_end = hunk_linenr;
2549                        new_blank_lines_at_end++;
2550                }
2551                else if (is_blank_context)
2552                        ;
2553                else
2554                        new_blank_lines_at_end = 0;
2555                patch += len;
2556                size -= len;
2557                hunk_linenr++;
2558        }
2559        if (inaccurate_eof &&
2560            old > oldlines && old[-1] == '\n' &&
2561            newlines.len > 0 && newlines.buf[newlines.len - 1] == '\n') {
2562                old--;
2563                strbuf_setlen(&newlines, newlines.len - 1);
2564        }
2565
2566        leading = frag->leading;
2567        trailing = frag->trailing;
2568
2569        /*
2570         * A hunk to change lines at the beginning would begin with
2571         * @@ -1,L +N,M @@
2572         * but we need to be careful.  -U0 that inserts before the second
2573         * line also has this pattern.
2574         *
2575         * And a hunk to add to an empty file would begin with
2576         * @@ -0,0 +N,M @@
2577         *
2578         * In other words, a hunk that is (frag->oldpos <= 1) with or
2579         * without leading context must match at the beginning.
2580         */
2581        match_beginning = (!frag->oldpos ||
2582                           (frag->oldpos == 1 && !unidiff_zero));
2583
2584        /*
2585         * A hunk without trailing lines must match at the end.
2586         * However, we simply cannot tell if a hunk must match end
2587         * from the lack of trailing lines if the patch was generated
2588         * with unidiff without any context.
2589         */
2590        match_end = !unidiff_zero && !trailing;
2591
2592        pos = frag->newpos ? (frag->newpos - 1) : 0;
2593        preimage.buf = oldlines;
2594        preimage.len = old - oldlines;
2595        postimage.buf = newlines.buf;
2596        postimage.len = newlines.len;
2597        preimage.line = preimage.line_allocated;
2598        postimage.line = postimage.line_allocated;
2599
2600        for (;;) {
2601
2602                applied_pos = find_pos(img, &preimage, &postimage, pos,
2603                                       ws_rule, match_beginning, match_end);
2604
2605                if (applied_pos >= 0)
2606                        break;
2607
2608                /* Am I at my context limits? */
2609                if ((leading <= p_context) && (trailing <= p_context))
2610                        break;
2611                if (match_beginning || match_end) {
2612                        match_beginning = match_end = 0;
2613                        continue;
2614                }
2615
2616                /*
2617                 * Reduce the number of context lines; reduce both
2618                 * leading and trailing if they are equal otherwise
2619                 * just reduce the larger context.
2620                 */
2621                if (leading >= trailing) {
2622                        remove_first_line(&preimage);
2623                        remove_first_line(&postimage);
2624                        pos--;
2625                        leading--;
2626                }
2627                if (trailing > leading) {
2628                        remove_last_line(&preimage);
2629                        remove_last_line(&postimage);
2630                        trailing--;
2631                }
2632        }
2633
2634        if (applied_pos >= 0) {
2635                if (new_blank_lines_at_end &&
2636                    preimage.nr + applied_pos >= img->nr &&
2637                    (ws_rule & WS_BLANK_AT_EOF) &&
2638                    ws_error_action != nowarn_ws_error) {
2639                        record_ws_error(WS_BLANK_AT_EOF, "+", 1,
2640                                        found_new_blank_lines_at_end);
2641                        if (ws_error_action == correct_ws_error) {
2642                                while (new_blank_lines_at_end--)
2643                                        remove_last_line(&postimage);
2644                        }
2645                        /*
2646                         * We would want to prevent write_out_results()
2647                         * from taking place in apply_patch() that follows
2648                         * the callchain led us here, which is:
2649                         * apply_patch->check_patch_list->check_patch->
2650                         * apply_data->apply_fragments->apply_one_fragment
2651                         */
2652                        if (ws_error_action == die_on_ws_error)
2653                                apply = 0;
2654                }
2655
2656                if (apply_verbosely && applied_pos != pos) {
2657                        int offset = applied_pos - pos;
2658                        if (apply_in_reverse)
2659                                offset = 0 - offset;
2660                        fprintf(stderr,
2661                                "Hunk #%d succeeded at %d (offset %d lines).\n",
2662                                nth_fragment, applied_pos + 1, offset);
2663                }
2664
2665                /*
2666                 * Warn if it was necessary to reduce the number
2667                 * of context lines.
2668                 */
2669                if ((leading != frag->leading) ||
2670                    (trailing != frag->trailing))
2671                        fprintf(stderr, "Context reduced to (%ld/%ld)"
2672                                " to apply fragment at %d\n",
2673                                leading, trailing, applied_pos+1);
2674                update_image(img, applied_pos, &preimage, &postimage);
2675        } else {
2676                if (apply_verbosely)
2677                        error("while searching for:\n%.*s",
2678                              (int)(old - oldlines), oldlines);
2679        }
2680
2681        free(oldlines);
2682        strbuf_release(&newlines);
2683        free(preimage.line_allocated);
2684        free(postimage.line_allocated);
2685
2686        return (applied_pos < 0);
2687}
2688
2689static int apply_binary_fragment(struct image *img, struct patch *patch)
2690{
2691        struct fragment *fragment = patch->fragments;
2692        unsigned long len;
2693        void *dst;
2694
2695        if (!fragment)
2696                return error("missing binary patch data for '%s'",
2697                             patch->new_name ?
2698                             patch->new_name :
2699                             patch->old_name);
2700
2701        /* Binary patch is irreversible without the optional second hunk */
2702        if (apply_in_reverse) {
2703                if (!fragment->next)
2704                        return error("cannot reverse-apply a binary patch "
2705                                     "without the reverse hunk to '%s'",
2706                                     patch->new_name
2707                                     ? patch->new_name : patch->old_name);
2708                fragment = fragment->next;
2709        }
2710        switch (fragment->binary_patch_method) {
2711        case BINARY_DELTA_DEFLATED:
2712                dst = patch_delta(img->buf, img->len, fragment->patch,
2713                                  fragment->size, &len);
2714                if (!dst)
2715                        return -1;
2716                clear_image(img);
2717                img->buf = dst;
2718                img->len = len;
2719                return 0;
2720        case BINARY_LITERAL_DEFLATED:
2721                clear_image(img);
2722                img->len = fragment->size;
2723                img->buf = xmalloc(img->len+1);
2724                memcpy(img->buf, fragment->patch, img->len);
2725                img->buf[img->len] = '\0';
2726                return 0;
2727        }
2728        return -1;
2729}
2730
2731static int apply_binary(struct image *img, struct patch *patch)
2732{
2733        const char *name = patch->old_name ? patch->old_name : patch->new_name;
2734        unsigned char sha1[20];
2735
2736        /*
2737         * For safety, we require patch index line to contain
2738         * full 40-byte textual SHA1 for old and new, at least for now.
2739         */
2740        if (strlen(patch->old_sha1_prefix) != 40 ||
2741            strlen(patch->new_sha1_prefix) != 40 ||
2742            get_sha1_hex(patch->old_sha1_prefix, sha1) ||
2743            get_sha1_hex(patch->new_sha1_prefix, sha1))
2744                return error("cannot apply binary patch to '%s' "
2745                             "without full index line", name);
2746
2747        if (patch->old_name) {
2748                /*
2749                 * See if the old one matches what the patch
2750                 * applies to.
2751                 */
2752                hash_sha1_file(img->buf, img->len, blob_type, sha1);
2753                if (strcmp(sha1_to_hex(sha1), patch->old_sha1_prefix))
2754                        return error("the patch applies to '%s' (%s), "
2755                                     "which does not match the "
2756                                     "current contents.",
2757                                     name, sha1_to_hex(sha1));
2758        }
2759        else {
2760                /* Otherwise, the old one must be empty. */
2761                if (img->len)
2762                        return error("the patch applies to an empty "
2763                                     "'%s' but it is not empty", name);
2764        }
2765
2766        get_sha1_hex(patch->new_sha1_prefix, sha1);
2767        if (is_null_sha1(sha1)) {
2768                clear_image(img);
2769                return 0; /* deletion patch */
2770        }
2771
2772        if (has_sha1_file(sha1)) {
2773                /* We already have the postimage */
2774                enum object_type type;
2775                unsigned long size;
2776                char *result;
2777
2778                result = read_sha1_file(sha1, &type, &size);
2779                if (!result)
2780                        return error("the necessary postimage %s for "
2781                                     "'%s' cannot be read",
2782                                     patch->new_sha1_prefix, name);
2783                clear_image(img);
2784                img->buf = result;
2785                img->len = size;
2786        } else {
2787                /*
2788                 * We have verified buf matches the preimage;
2789                 * apply the patch data to it, which is stored
2790                 * in the patch->fragments->{patch,size}.
2791                 */
2792                if (apply_binary_fragment(img, patch))
2793                        return error("binary patch does not apply to '%s'",
2794                                     name);
2795
2796                /* verify that the result matches */
2797                hash_sha1_file(img->buf, img->len, blob_type, sha1);
2798                if (strcmp(sha1_to_hex(sha1), patch->new_sha1_prefix))
2799                        return error("binary patch to '%s' creates incorrect result (expecting %s, got %s)",
2800                                name, patch->new_sha1_prefix, sha1_to_hex(sha1));
2801        }
2802
2803        return 0;
2804}
2805
2806static int apply_fragments(struct image *img, struct patch *patch)
2807{
2808        struct fragment *frag = patch->fragments;
2809        const char *name = patch->old_name ? patch->old_name : patch->new_name;
2810        unsigned ws_rule = patch->ws_rule;
2811        unsigned inaccurate_eof = patch->inaccurate_eof;
2812        int nth = 0;
2813
2814        if (patch->is_binary)
2815                return apply_binary(img, patch);
2816
2817        while (frag) {
2818                nth++;
2819                if (apply_one_fragment(img, frag, inaccurate_eof, ws_rule, nth)) {
2820                        error("patch failed: %s:%ld", name, frag->oldpos);
2821                        if (!apply_with_reject)
2822                                return -1;
2823                        frag->rejected = 1;
2824                }
2825                frag = frag->next;
2826        }
2827        return 0;
2828}
2829
2830static int read_file_or_gitlink(struct cache_entry *ce, struct strbuf *buf)
2831{
2832        if (!ce)
2833                return 0;
2834
2835        if (S_ISGITLINK(ce->ce_mode)) {
2836                strbuf_grow(buf, 100);
2837                strbuf_addf(buf, "Subproject commit %s\n", sha1_to_hex(ce->sha1));
2838        } else {
2839                enum object_type type;
2840                unsigned long sz;
2841                char *result;
2842
2843                result = read_sha1_file(ce->sha1, &type, &sz);
2844                if (!result)
2845                        return -1;
2846                /* XXX read_sha1_file NUL-terminates */
2847                strbuf_attach(buf, result, sz, sz + 1);
2848        }
2849        return 0;
2850}
2851
2852static struct patch *in_fn_table(const char *name)
2853{
2854        struct string_list_item *item;
2855
2856        if (name == NULL)
2857                return NULL;
2858
2859        item = string_list_lookup(&fn_table, name);
2860        if (item != NULL)
2861                return (struct patch *)item->util;
2862
2863        return NULL;
2864}
2865
2866/*
2867 * item->util in the filename table records the status of the path.
2868 * Usually it points at a patch (whose result records the contents
2869 * of it after applying it), but it could be PATH_WAS_DELETED for a
2870 * path that a previously applied patch has already removed.
2871 */
2872 #define PATH_TO_BE_DELETED ((struct patch *) -2)
2873#define PATH_WAS_DELETED ((struct patch *) -1)
2874
2875static int to_be_deleted(struct patch *patch)
2876{
2877        return patch == PATH_TO_BE_DELETED;
2878}
2879
2880static int was_deleted(struct patch *patch)
2881{
2882        return patch == PATH_WAS_DELETED;
2883}
2884
2885static void add_to_fn_table(struct patch *patch)
2886{
2887        struct string_list_item *item;
2888
2889        /*
2890         * Always add new_name unless patch is a deletion
2891         * This should cover the cases for normal diffs,
2892         * file creations and copies
2893         */
2894        if (patch->new_name != NULL) {
2895                item = string_list_insert(&fn_table, patch->new_name);
2896                item->util = patch;
2897        }
2898
2899        /*
2900         * store a failure on rename/deletion cases because
2901         * later chunks shouldn't patch old names
2902         */
2903        if ((patch->new_name == NULL) || (patch->is_rename)) {
2904                item = string_list_insert(&fn_table, patch->old_name);
2905                item->util = PATH_WAS_DELETED;
2906        }
2907}
2908
2909static void prepare_fn_table(struct patch *patch)
2910{
2911        /*
2912         * store information about incoming file deletion
2913         */
2914        while (patch) {
2915                if ((patch->new_name == NULL) || (patch->is_rename)) {
2916                        struct string_list_item *item;
2917                        item = string_list_insert(&fn_table, patch->old_name);
2918                        item->util = PATH_TO_BE_DELETED;
2919                }
2920                patch = patch->next;
2921        }
2922}
2923
2924static int apply_data(struct patch *patch, struct stat *st, struct cache_entry *ce)
2925{
2926        struct strbuf buf = STRBUF_INIT;
2927        struct image image;
2928        size_t len;
2929        char *img;
2930        struct patch *tpatch;
2931
2932        if (!(patch->is_copy || patch->is_rename) &&
2933            (tpatch = in_fn_table(patch->old_name)) != NULL && !to_be_deleted(tpatch)) {
2934                if (was_deleted(tpatch)) {
2935                        return error("patch %s has been renamed/deleted",
2936                                patch->old_name);
2937                }
2938                /* We have a patched copy in memory use that */
2939                strbuf_add(&buf, tpatch->result, tpatch->resultsize);
2940        } else if (cached) {
2941                if (read_file_or_gitlink(ce, &buf))
2942                        return error("read of %s failed", patch->old_name);
2943        } else if (patch->old_name) {
2944                if (S_ISGITLINK(patch->old_mode)) {
2945                        if (ce) {
2946                                read_file_or_gitlink(ce, &buf);
2947                        } else {
2948                                /*
2949                                 * There is no way to apply subproject
2950                                 * patch without looking at the index.
2951                                 */
2952                                patch->fragments = NULL;
2953                        }
2954                } else {
2955                        if (read_old_data(st, patch->old_name, &buf))
2956                                return error("read of %s failed", patch->old_name);
2957                }
2958        }
2959
2960        img = strbuf_detach(&buf, &len);
2961        prepare_image(&image, img, len, !patch->is_binary);
2962
2963        if (apply_fragments(&image, patch) < 0)
2964                return -1; /* note with --reject this succeeds. */
2965        patch->result = image.buf;
2966        patch->resultsize = image.len;
2967        add_to_fn_table(patch);
2968        free(image.line_allocated);
2969
2970        if (0 < patch->is_delete && patch->resultsize)
2971                return error("removal patch leaves file contents");
2972
2973        return 0;
2974}
2975
2976static int check_to_create_blob(const char *new_name, int ok_if_exists)
2977{
2978        struct stat nst;
2979        if (!lstat(new_name, &nst)) {
2980                if (S_ISDIR(nst.st_mode) || ok_if_exists)
2981                        return 0;
2982                /*
2983                 * A leading component of new_name might be a symlink
2984                 * that is going to be removed with this patch, but
2985                 * still pointing at somewhere that has the path.
2986                 * In such a case, path "new_name" does not exist as
2987                 * far as git is concerned.
2988                 */
2989                if (has_symlink_leading_path(new_name, strlen(new_name)))
2990                        return 0;
2991
2992                return error("%s: already exists in working directory", new_name);
2993        }
2994        else if ((errno != ENOENT) && (errno != ENOTDIR))
2995                return error("%s: %s", new_name, strerror(errno));
2996        return 0;
2997}
2998
2999static int verify_index_match(struct cache_entry *ce, struct stat *st)
3000{
3001        if (S_ISGITLINK(ce->ce_mode)) {
3002                if (!S_ISDIR(st->st_mode))
3003                        return -1;
3004                return 0;
3005        }
3006        return ce_match_stat(ce, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);
3007}
3008
3009static int check_preimage(struct patch *patch, struct cache_entry **ce, struct stat *st)
3010{
3011        const char *old_name = patch->old_name;
3012        struct patch *tpatch = NULL;
3013        int stat_ret = 0;
3014        unsigned st_mode = 0;
3015
3016        /*
3017         * Make sure that we do not have local modifications from the
3018         * index when we are looking at the index.  Also make sure
3019         * we have the preimage file to be patched in the work tree,
3020         * unless --cached, which tells git to apply only in the index.
3021         */
3022        if (!old_name)
3023                return 0;
3024
3025        assert(patch->is_new <= 0);
3026
3027        if (!(patch->is_copy || patch->is_rename) &&
3028            (tpatch = in_fn_table(old_name)) != NULL && !to_be_deleted(tpatch)) {
3029                if (was_deleted(tpatch))
3030                        return error("%s: has been deleted/renamed", old_name);
3031                st_mode = tpatch->new_mode;
3032        } else if (!cached) {
3033                stat_ret = lstat(old_name, st);
3034                if (stat_ret && errno != ENOENT)
3035                        return error("%s: %s", old_name, strerror(errno));
3036        }
3037
3038        if (to_be_deleted(tpatch))
3039                tpatch = NULL;
3040
3041        if (check_index && !tpatch) {
3042                int pos = cache_name_pos(old_name, strlen(old_name));
3043                if (pos < 0) {
3044                        if (patch->is_new < 0)
3045                                goto is_new;
3046                        return error("%s: does not exist in index", old_name);
3047                }
3048                *ce = active_cache[pos];
3049                if (stat_ret < 0) {
3050                        struct checkout costate;
3051                        /* checkout */
3052                        memset(&costate, 0, sizeof(costate));
3053                        costate.base_dir = "";
3054                        costate.refresh_cache = 1;
3055                        if (checkout_entry(*ce, &costate, NULL) ||
3056                            lstat(old_name, st))
3057                                return -1;
3058                }
3059                if (!cached && verify_index_match(*ce, st))
3060                        return error("%s: does not match index", old_name);
3061                if (cached)
3062                        st_mode = (*ce)->ce_mode;
3063        } else if (stat_ret < 0) {
3064                if (patch->is_new < 0)
3065                        goto is_new;
3066                return error("%s: %s", old_name, strerror(errno));
3067        }
3068
3069        if (!cached && !tpatch)
3070                st_mode = ce_mode_from_stat(*ce, st->st_mode);
3071
3072        if (patch->is_new < 0)
3073                patch->is_new = 0;
3074        if (!patch->old_mode)
3075                patch->old_mode = st_mode;
3076        if ((st_mode ^ patch->old_mode) & S_IFMT)
3077                return error("%s: wrong type", old_name);
3078        if (st_mode != patch->old_mode)
3079                warning("%s has type %o, expected %o",
3080                        old_name, st_mode, patch->old_mode);
3081        if (!patch->new_mode && !patch->is_delete)
3082                patch->new_mode = st_mode;
3083        return 0;
3084
3085 is_new:
3086        patch->is_new = 1;
3087        patch->is_delete = 0;
3088        patch->old_name = NULL;
3089        return 0;
3090}
3091
3092static int check_patch(struct patch *patch)
3093{
3094        struct stat st;
3095        const char *old_name = patch->old_name;
3096        const char *new_name = patch->new_name;
3097        const char *name = old_name ? old_name : new_name;
3098        struct cache_entry *ce = NULL;
3099        struct patch *tpatch;
3100        int ok_if_exists;
3101        int status;
3102
3103        patch->rejected = 1; /* we will drop this after we succeed */
3104
3105        status = check_preimage(patch, &ce, &st);
3106        if (status)
3107                return status;
3108        old_name = patch->old_name;
3109
3110        if ((tpatch = in_fn_table(new_name)) &&
3111                        (was_deleted(tpatch) || to_be_deleted(tpatch)))
3112                /*
3113                 * A type-change diff is always split into a patch to
3114                 * delete old, immediately followed by a patch to
3115                 * create new (see diff.c::run_diff()); in such a case
3116                 * it is Ok that the entry to be deleted by the
3117                 * previous patch is still in the working tree and in
3118                 * the index.
3119                 */
3120                ok_if_exists = 1;
3121        else
3122                ok_if_exists = 0;
3123
3124        if (new_name &&
3125            ((0 < patch->is_new) | (0 < patch->is_rename) | patch->is_copy)) {
3126                if (check_index &&
3127                    cache_name_pos(new_name, strlen(new_name)) >= 0 &&
3128                    !ok_if_exists)
3129                        return error("%s: already exists in index", new_name);
3130                if (!cached) {
3131                        int err = check_to_create_blob(new_name, ok_if_exists);
3132                        if (err)
3133                                return err;
3134                }
3135                if (!patch->new_mode) {
3136                        if (0 < patch->is_new)
3137                                patch->new_mode = S_IFREG | 0644;
3138                        else
3139                                patch->new_mode = patch->old_mode;
3140                }
3141        }
3142
3143        if (new_name && old_name) {
3144                int same = !strcmp(old_name, new_name);
3145                if (!patch->new_mode)
3146                        patch->new_mode = patch->old_mode;
3147                if ((patch->old_mode ^ patch->new_mode) & S_IFMT)
3148                        return error("new mode (%o) of %s does not match old mode (%o)%s%s",
3149                                patch->new_mode, new_name, patch->old_mode,
3150                                same ? "" : " of ", same ? "" : old_name);
3151        }
3152
3153        if (apply_data(patch, &st, ce) < 0)
3154                return error("%s: patch does not apply", name);
3155        patch->rejected = 0;
3156        return 0;
3157}
3158
3159static int check_patch_list(struct patch *patch)
3160{
3161        int err = 0;
3162
3163        prepare_fn_table(patch);
3164        while (patch) {
3165                if (apply_verbosely)
3166                        say_patch_name(stderr,
3167                                       "Checking patch ", patch, "...\n");
3168                err |= check_patch(patch);
3169                patch = patch->next;
3170        }
3171        return err;
3172}
3173
3174/* This function tries to read the sha1 from the current index */
3175static int get_current_sha1(const char *path, unsigned char *sha1)
3176{
3177        int pos;
3178
3179        if (read_cache() < 0)
3180                return -1;
3181        pos = cache_name_pos(path, strlen(path));
3182        if (pos < 0)
3183                return -1;
3184        hashcpy(sha1, active_cache[pos]->sha1);
3185        return 0;
3186}
3187
3188/* Build an index that contains the just the files needed for a 3way merge */
3189static void build_fake_ancestor(struct patch *list, const char *filename)
3190{
3191        struct patch *patch;
3192        struct index_state result = { NULL };
3193        int fd;
3194
3195        /* Once we start supporting the reverse patch, it may be
3196         * worth showing the new sha1 prefix, but until then...
3197         */
3198        for (patch = list; patch; patch = patch->next) {
3199                const unsigned char *sha1_ptr;
3200                unsigned char sha1[20];
3201                struct cache_entry *ce;
3202                const char *name;
3203
3204                name = patch->old_name ? patch->old_name : patch->new_name;
3205                if (0 < patch->is_new)
3206                        continue;
3207                else if (get_sha1(patch->old_sha1_prefix, sha1))
3208                        /* git diff has no index line for mode/type changes */
3209                        if (!patch->lines_added && !patch->lines_deleted) {
3210                                if (get_current_sha1(patch->old_name, sha1))
3211                                        die("mode change for %s, which is not "
3212                                                "in current HEAD", name);
3213                                sha1_ptr = sha1;
3214                        } else
3215                                die("sha1 information is lacking or useless "
3216                                        "(%s).", name);
3217                else
3218                        sha1_ptr = sha1;
3219
3220                ce = make_cache_entry(patch->old_mode, sha1_ptr, name, 0, 0);
3221                if (!ce)
3222                        die("make_cache_entry failed for path '%s'", name);
3223                if (add_index_entry(&result, ce, ADD_CACHE_OK_TO_ADD))
3224                        die ("Could not add %s to temporary index", name);
3225        }
3226
3227        fd = open(filename, O_WRONLY | O_CREAT, 0666);
3228        if (fd < 0 || write_index(&result, fd) || close(fd))
3229                die ("Could not write temporary index to %s", filename);
3230
3231        discard_index(&result);
3232}
3233
3234static void stat_patch_list(struct patch *patch)
3235{
3236        int files, adds, dels;
3237
3238        for (files = adds = dels = 0 ; patch ; patch = patch->next) {
3239                files++;
3240                adds += patch->lines_added;
3241                dels += patch->lines_deleted;
3242                show_stats(patch);
3243        }
3244
3245        print_stat_summary(stdout, files, adds, dels);
3246}
3247
3248static void numstat_patch_list(struct patch *patch)
3249{
3250        for ( ; patch; patch = patch->next) {
3251                const char *name;
3252                name = patch->new_name ? patch->new_name : patch->old_name;
3253                if (patch->is_binary)
3254                        printf("-\t-\t");
3255                else
3256                        printf("%d\t%d\t", patch->lines_added, patch->lines_deleted);
3257                write_name_quoted(name, stdout, line_termination);
3258        }
3259}
3260
3261static void show_file_mode_name(const char *newdelete, unsigned int mode, const char *name)
3262{
3263        if (mode)
3264                printf(" %s mode %06o %s\n", newdelete, mode, name);
3265        else
3266                printf(" %s %s\n", newdelete, name);
3267}
3268
3269static void show_mode_change(struct patch *p, int show_name)
3270{
3271        if (p->old_mode && p->new_mode && p->old_mode != p->new_mode) {
3272                if (show_name)
3273                        printf(" mode change %06o => %06o %s\n",
3274                               p->old_mode, p->new_mode, p->new_name);
3275                else
3276                        printf(" mode change %06o => %06o\n",
3277                               p->old_mode, p->new_mode);
3278        }
3279}
3280
3281static void show_rename_copy(struct patch *p)
3282{
3283        const char *renamecopy = p->is_rename ? "rename" : "copy";
3284        const char *old, *new;
3285
3286        /* Find common prefix */
3287        old = p->old_name;
3288        new = p->new_name;
3289        while (1) {
3290                const char *slash_old, *slash_new;
3291                slash_old = strchr(old, '/');
3292                slash_new = strchr(new, '/');
3293                if (!slash_old ||
3294                    !slash_new ||
3295                    slash_old - old != slash_new - new ||
3296                    memcmp(old, new, slash_new - new))
3297                        break;
3298                old = slash_old + 1;
3299                new = slash_new + 1;
3300        }
3301        /* p->old_name thru old is the common prefix, and old and new
3302         * through the end of names are renames
3303         */
3304        if (old != p->old_name)
3305                printf(" %s %.*s{%s => %s} (%d%%)\n", renamecopy,
3306                       (int)(old - p->old_name), p->old_name,
3307                       old, new, p->score);
3308        else
3309                printf(" %s %s => %s (%d%%)\n", renamecopy,
3310                       p->old_name, p->new_name, p->score);
3311        show_mode_change(p, 0);
3312}
3313
3314static void summary_patch_list(struct patch *patch)
3315{
3316        struct patch *p;
3317
3318        for (p = patch; p; p = p->next) {
3319                if (p->is_new)
3320                        show_file_mode_name("create", p->new_mode, p->new_name);
3321                else if (p->is_delete)
3322                        show_file_mode_name("delete", p->old_mode, p->old_name);
3323                else {
3324                        if (p->is_rename || p->is_copy)
3325                                show_rename_copy(p);
3326                        else {
3327                                if (p->score) {
3328                                        printf(" rewrite %s (%d%%)\n",
3329                                               p->new_name, p->score);
3330                                        show_mode_change(p, 0);
3331                                }
3332                                else
3333                                        show_mode_change(p, 1);
3334                        }
3335                }
3336        }
3337}
3338
3339static void patch_stats(struct patch *patch)
3340{
3341        int lines = patch->lines_added + patch->lines_deleted;
3342
3343        if (lines > max_change)
3344                max_change = lines;
3345        if (patch->old_name) {
3346                int len = quote_c_style(patch->old_name, NULL, NULL, 0);
3347                if (!len)
3348                        len = strlen(patch->old_name);
3349                if (len > max_len)
3350                        max_len = len;
3351        }
3352        if (patch->new_name) {
3353                int len = quote_c_style(patch->new_name, NULL, NULL, 0);
3354                if (!len)
3355                        len = strlen(patch->new_name);
3356                if (len > max_len)
3357                        max_len = len;
3358        }
3359}
3360
3361static void remove_file(struct patch *patch, int rmdir_empty)
3362{
3363        if (update_index) {
3364                if (remove_file_from_cache(patch->old_name) < 0)
3365                        die("unable to remove %s from index", patch->old_name);
3366        }
3367        if (!cached) {
3368                if (!remove_or_warn(patch->old_mode, patch->old_name) && rmdir_empty) {
3369                        remove_path(patch->old_name);
3370                }
3371        }
3372}
3373
3374static void add_index_file(const char *path, unsigned mode, void *buf, unsigned long size)
3375{
3376        struct stat st;
3377        struct cache_entry *ce;
3378        int namelen = strlen(path);
3379        unsigned ce_size = cache_entry_size(namelen);
3380
3381        if (!update_index)
3382                return;
3383
3384        ce = xcalloc(1, ce_size);
3385        memcpy(ce->name, path, namelen);
3386        ce->ce_mode = create_ce_mode(mode);
3387        ce->ce_flags = namelen;
3388        if (S_ISGITLINK(mode)) {
3389                const char *s = buf;
3390
3391                if (get_sha1_hex(s + strlen("Subproject commit "), ce->sha1))
3392                        die("corrupt patch for subproject %s", path);
3393        } else {
3394                if (!cached) {
3395                        if (lstat(path, &st) < 0)
3396                                die_errno("unable to stat newly created file '%s'",
3397                                          path);
3398                        fill_stat_cache_info(ce, &st);
3399                }
3400                if (write_sha1_file(buf, size, blob_type, ce->sha1) < 0)
3401                        die("unable to create backing store for newly created file %s", path);
3402        }
3403        if (add_cache_entry(ce, ADD_CACHE_OK_TO_ADD) < 0)
3404                die("unable to add cache entry for %s", path);
3405}
3406
3407static int try_create_file(const char *path, unsigned int mode, const char *buf, unsigned long size)
3408{
3409        int fd;
3410        struct strbuf nbuf = STRBUF_INIT;
3411
3412        if (S_ISGITLINK(mode)) {
3413                struct stat st;
3414                if (!lstat(path, &st) && S_ISDIR(st.st_mode))
3415                        return 0;
3416                return mkdir(path, 0777);
3417        }
3418
3419        if (has_symlinks && S_ISLNK(mode))
3420                /* Although buf:size is counted string, it also is NUL
3421                 * terminated.
3422                 */
3423                return symlink(buf, path);
3424
3425        fd = open(path, O_CREAT | O_EXCL | O_WRONLY, (mode & 0100) ? 0777 : 0666);
3426        if (fd < 0)
3427                return -1;
3428
3429        if (convert_to_working_tree(path, buf, size, &nbuf)) {
3430                size = nbuf.len;
3431                buf  = nbuf.buf;
3432        }
3433        write_or_die(fd, buf, size);
3434        strbuf_release(&nbuf);
3435
3436        if (close(fd) < 0)
3437                die_errno("closing file '%s'", path);
3438        return 0;
3439}
3440
3441/*
3442 * We optimistically assume that the directories exist,
3443 * which is true 99% of the time anyway. If they don't,
3444 * we create them and try again.
3445 */
3446static void create_one_file(char *path, unsigned mode, const char *buf, unsigned long size)
3447{
3448        if (cached)
3449                return;
3450        if (!try_create_file(path, mode, buf, size))
3451                return;
3452
3453        if (errno == ENOENT) {
3454                if (safe_create_leading_directories(path))
3455                        return;
3456                if (!try_create_file(path, mode, buf, size))
3457                        return;
3458        }
3459
3460        if (errno == EEXIST || errno == EACCES) {
3461                /* We may be trying to create a file where a directory
3462                 * used to be.
3463                 */
3464                struct stat st;
3465                if (!lstat(path, &st) && (!S_ISDIR(st.st_mode) || !rmdir(path)))
3466                        errno = EEXIST;
3467        }
3468
3469        if (errno == EEXIST) {
3470                unsigned int nr = getpid();
3471
3472                for (;;) {
3473                        char newpath[PATH_MAX];
3474                        mksnpath(newpath, sizeof(newpath), "%s~%u", path, nr);
3475                        if (!try_create_file(newpath, mode, buf, size)) {
3476                                if (!rename(newpath, path))
3477                                        return;
3478                                unlink_or_warn(newpath);
3479                                break;
3480                        }
3481                        if (errno != EEXIST)
3482                                break;
3483                        ++nr;
3484                }
3485        }
3486        die_errno("unable to write file '%s' mode %o", path, mode);
3487}
3488
3489static void create_file(struct patch *patch)
3490{
3491        char *path = patch->new_name;
3492        unsigned mode = patch->new_mode;
3493        unsigned long size = patch->resultsize;
3494        char *buf = patch->result;
3495
3496        if (!mode)
3497                mode = S_IFREG | 0644;
3498        create_one_file(path, mode, buf, size);
3499        add_index_file(path, mode, buf, size);
3500}
3501
3502/* phase zero is to remove, phase one is to create */
3503static void write_out_one_result(struct patch *patch, int phase)
3504{
3505        if (patch->is_delete > 0) {
3506                if (phase == 0)
3507                        remove_file(patch, 1);
3508                return;
3509        }
3510        if (patch->is_new > 0 || patch->is_copy) {
3511                if (phase == 1)
3512                        create_file(patch);
3513                return;
3514        }
3515        /*
3516         * Rename or modification boils down to the same
3517         * thing: remove the old, write the new
3518         */
3519        if (phase == 0)
3520                remove_file(patch, patch->is_rename);
3521        if (phase == 1)
3522                create_file(patch);
3523}
3524
3525static int write_out_one_reject(struct patch *patch)
3526{
3527        FILE *rej;
3528        char namebuf[PATH_MAX];
3529        struct fragment *frag;
3530        int cnt = 0;
3531
3532        for (cnt = 0, frag = patch->fragments; frag; frag = frag->next) {
3533                if (!frag->rejected)
3534                        continue;
3535                cnt++;
3536        }
3537
3538        if (!cnt) {
3539                if (apply_verbosely)
3540                        say_patch_name(stderr,
3541                                       "Applied patch ", patch, " cleanly.\n");
3542                return 0;
3543        }
3544
3545        /* This should not happen, because a removal patch that leaves
3546         * contents are marked "rejected" at the patch level.
3547         */
3548        if (!patch->new_name)
3549                die("internal error");
3550
3551        /* Say this even without --verbose */
3552        say_patch_name(stderr, "Applying patch ", patch, " with");
3553        fprintf(stderr, " %d rejects...\n", cnt);
3554
3555        cnt = strlen(patch->new_name);
3556        if (ARRAY_SIZE(namebuf) <= cnt + 5) {
3557                cnt = ARRAY_SIZE(namebuf) - 5;
3558                warning("truncating .rej filename to %.*s.rej",
3559                        cnt - 1, patch->new_name);
3560        }
3561        memcpy(namebuf, patch->new_name, cnt);
3562        memcpy(namebuf + cnt, ".rej", 5);
3563
3564        rej = fopen(namebuf, "w");
3565        if (!rej)
3566                return error("cannot open %s: %s", namebuf, strerror(errno));
3567
3568        /* Normal git tools never deal with .rej, so do not pretend
3569         * this is a git patch by saying --git nor give extended
3570         * headers.  While at it, maybe please "kompare" that wants
3571         * the trailing TAB and some garbage at the end of line ;-).
3572         */
3573        fprintf(rej, "diff a/%s b/%s\t(rejected hunks)\n",
3574                patch->new_name, patch->new_name);
3575        for (cnt = 1, frag = patch->fragments;
3576             frag;
3577             cnt++, frag = frag->next) {
3578                if (!frag->rejected) {
3579                        fprintf(stderr, "Hunk #%d applied cleanly.\n", cnt);
3580                        continue;
3581                }
3582                fprintf(stderr, "Rejected hunk #%d.\n", cnt);
3583                fprintf(rej, "%.*s", frag->size, frag->patch);
3584                if (frag->patch[frag->size-1] != '\n')
3585                        fputc('\n', rej);
3586        }
3587        fclose(rej);
3588        return -1;
3589}
3590
3591static int write_out_results(struct patch *list)
3592{
3593        int phase;
3594        int errs = 0;
3595        struct patch *l;
3596
3597        for (phase = 0; phase < 2; phase++) {
3598                l = list;
3599                while (l) {
3600                        if (l->rejected)
3601                                errs = 1;
3602                        else {
3603                                write_out_one_result(l, phase);
3604                                if (phase == 1 && write_out_one_reject(l))
3605                                        errs = 1;
3606                        }
3607                        l = l->next;
3608                }
3609        }
3610        return errs;
3611}
3612
3613static struct lock_file lock_file;
3614
3615static struct string_list limit_by_name;
3616static int has_include;
3617static void add_name_limit(const char *name, int exclude)
3618{
3619        struct string_list_item *it;
3620
3621        it = string_list_append(&limit_by_name, name);
3622        it->util = exclude ? NULL : (void *) 1;
3623}
3624
3625static int use_patch(struct patch *p)
3626{
3627        const char *pathname = p->new_name ? p->new_name : p->old_name;
3628        int i;
3629
3630        /* Paths outside are not touched regardless of "--include" */
3631        if (0 < prefix_length) {
3632                int pathlen = strlen(pathname);
3633                if (pathlen <= prefix_length ||
3634                    memcmp(prefix, pathname, prefix_length))
3635                        return 0;
3636        }
3637
3638        /* See if it matches any of exclude/include rule */
3639        for (i = 0; i < limit_by_name.nr; i++) {
3640                struct string_list_item *it = &limit_by_name.items[i];
3641                if (!fnmatch(it->string, pathname, 0))
3642                        return (it->util != NULL);
3643        }
3644
3645        /*
3646         * If we had any include, a path that does not match any rule is
3647         * not used.  Otherwise, we saw bunch of exclude rules (or none)
3648         * and such a path is used.
3649         */
3650        return !has_include;
3651}
3652
3653
3654static void prefix_one(char **name)
3655{
3656        char *old_name = *name;
3657        if (!old_name)
3658                return;
3659        *name = xstrdup(prefix_filename(prefix, prefix_length, *name));
3660        free(old_name);
3661}
3662
3663static void prefix_patches(struct patch *p)
3664{
3665        if (!prefix || p->is_toplevel_relative)
3666                return;
3667        for ( ; p; p = p->next) {
3668                if (p->new_name == p->old_name) {
3669                        char *prefixed = p->new_name;
3670                        prefix_one(&prefixed);
3671                        p->new_name = p->old_name = prefixed;
3672                }
3673                else {
3674                        prefix_one(&p->new_name);
3675                        prefix_one(&p->old_name);
3676                }
3677        }
3678}
3679
3680#define INACCURATE_EOF  (1<<0)
3681#define RECOUNT         (1<<1)
3682
3683static int apply_patch(int fd, const char *filename, int options)
3684{
3685        size_t offset;
3686        struct strbuf buf = STRBUF_INIT;
3687        struct patch *list = NULL, **listp = &list;
3688        int skipped_patch = 0;
3689
3690        /* FIXME - memory leak when using multiple patch files as inputs */
3691        memset(&fn_table, 0, sizeof(struct string_list));
3692        patch_input_file = filename;
3693        read_patch_file(&buf, fd);
3694        offset = 0;
3695        while (offset < buf.len) {
3696                struct patch *patch;
3697                int nr;
3698
3699                patch = xcalloc(1, sizeof(*patch));
3700                patch->inaccurate_eof = !!(options & INACCURATE_EOF);
3701                patch->recount =  !!(options & RECOUNT);
3702                nr = parse_chunk(buf.buf + offset, buf.len - offset, patch);
3703                if (nr < 0)
3704                        break;
3705                if (apply_in_reverse)
3706                        reverse_patches(patch);
3707                if (prefix)
3708                        prefix_patches(patch);
3709                if (use_patch(patch)) {
3710                        patch_stats(patch);
3711                        *listp = patch;
3712                        listp = &patch->next;
3713                }
3714                else {
3715                        /* perhaps free it a bit better? */
3716                        free(patch);
3717                        skipped_patch++;
3718                }
3719                offset += nr;
3720        }
3721
3722        if (!list && !skipped_patch)
3723                die("unrecognized input");
3724
3725        if (whitespace_error && (ws_error_action == die_on_ws_error))
3726                apply = 0;
3727
3728        update_index = check_index && apply;
3729        if (update_index && newfd < 0)
3730                newfd = hold_locked_index(&lock_file, 1);
3731
3732        if (check_index) {
3733                if (read_cache() < 0)
3734                        die("unable to read index file");
3735        }
3736
3737        if ((check || apply) &&
3738            check_patch_list(list) < 0 &&
3739            !apply_with_reject)
3740                exit(1);
3741
3742        if (apply && write_out_results(list))
3743                exit(1);
3744
3745        if (fake_ancestor)
3746                build_fake_ancestor(list, fake_ancestor);
3747
3748        if (diffstat)
3749                stat_patch_list(list);
3750
3751        if (numstat)
3752                numstat_patch_list(list);
3753
3754        if (summary)
3755                summary_patch_list(list);
3756
3757        strbuf_release(&buf);
3758        return 0;
3759}
3760
3761static int git_apply_config(const char *var, const char *value, void *cb)
3762{
3763        if (!strcmp(var, "apply.whitespace"))
3764                return git_config_string(&apply_default_whitespace, var, value);
3765        else if (!strcmp(var, "apply.ignorewhitespace"))
3766                return git_config_string(&apply_default_ignorewhitespace, var, value);
3767        return git_default_config(var, value, cb);
3768}
3769
3770static int option_parse_exclude(const struct option *opt,
3771                                const char *arg, int unset)
3772{
3773        add_name_limit(arg, 1);
3774        return 0;
3775}
3776
3777static int option_parse_include(const struct option *opt,
3778                                const char *arg, int unset)
3779{
3780        add_name_limit(arg, 0);
3781        has_include = 1;
3782        return 0;
3783}
3784
3785static int option_parse_p(const struct option *opt,
3786                          const char *arg, int unset)
3787{
3788        p_value = atoi(arg);
3789        p_value_known = 1;
3790        return 0;
3791}
3792
3793static int option_parse_z(const struct option *opt,
3794                          const char *arg, int unset)
3795{
3796        if (unset)
3797                line_termination = '\n';
3798        else
3799                line_termination = 0;
3800        return 0;
3801}
3802
3803static int option_parse_space_change(const struct option *opt,
3804                          const char *arg, int unset)
3805{
3806        if (unset)
3807                ws_ignore_action = ignore_ws_none;
3808        else
3809                ws_ignore_action = ignore_ws_change;
3810        return 0;
3811}
3812
3813static int option_parse_whitespace(const struct option *opt,
3814                                   const char *arg, int unset)
3815{
3816        const char **whitespace_option = opt->value;
3817
3818        *whitespace_option = arg;
3819        parse_whitespace_option(arg);
3820        return 0;
3821}
3822
3823static int option_parse_directory(const struct option *opt,
3824                                  const char *arg, int unset)
3825{
3826        root_len = strlen(arg);
3827        if (root_len && arg[root_len - 1] != '/') {
3828                char *new_root;
3829                root = new_root = xmalloc(root_len + 2);
3830                strcpy(new_root, arg);
3831                strcpy(new_root + root_len++, "/");
3832        } else
3833                root = arg;
3834        return 0;
3835}
3836
3837int cmd_apply(int argc, const char **argv, const char *prefix_)
3838{
3839        int i;
3840        int errs = 0;
3841        int is_not_gitdir = !startup_info->have_repository;
3842        int force_apply = 0;
3843
3844        const char *whitespace_option = NULL;
3845
3846        struct option builtin_apply_options[] = {
3847                { OPTION_CALLBACK, 0, "exclude", NULL, "path",
3848                        "don't apply changes matching the given path",
3849                        0, option_parse_exclude },
3850                { OPTION_CALLBACK, 0, "include", NULL, "path",
3851                        "apply changes matching the given path",
3852                        0, option_parse_include },
3853                { OPTION_CALLBACK, 'p', NULL, NULL, "num",
3854                        "remove <num> leading slashes from traditional diff paths",
3855                        0, option_parse_p },
3856                OPT_BOOLEAN(0, "no-add", &no_add,
3857                        "ignore additions made by the patch"),
3858                OPT_BOOLEAN(0, "stat", &diffstat,
3859                        "instead of applying the patch, output diffstat for the input"),
3860                OPT_NOOP_NOARG(0, "allow-binary-replacement"),
3861                OPT_NOOP_NOARG(0, "binary"),
3862                OPT_BOOLEAN(0, "numstat", &numstat,
3863                        "shows number of added and deleted lines in decimal notation"),
3864                OPT_BOOLEAN(0, "summary", &summary,
3865                        "instead of applying the patch, output a summary for the input"),
3866                OPT_BOOLEAN(0, "check", &check,
3867                        "instead of applying the patch, see if the patch is applicable"),
3868                OPT_BOOLEAN(0, "index", &check_index,
3869                        "make sure the patch is applicable to the current index"),
3870                OPT_BOOLEAN(0, "cached", &cached,
3871                        "apply a patch without touching the working tree"),
3872                OPT_BOOLEAN(0, "apply", &force_apply,
3873                        "also apply the patch (use with --stat/--summary/--check)"),
3874                OPT_FILENAME(0, "build-fake-ancestor", &fake_ancestor,
3875                        "build a temporary index based on embedded index information"),
3876                { OPTION_CALLBACK, 'z', NULL, NULL, NULL,
3877                        "paths are separated with NUL character",
3878                        PARSE_OPT_NOARG, option_parse_z },
3879                OPT_INTEGER('C', NULL, &p_context,
3880                                "ensure at least <n> lines of context match"),
3881                { OPTION_CALLBACK, 0, "whitespace", &whitespace_option, "action",
3882                        "detect new or modified lines that have whitespace errors",
3883                        0, option_parse_whitespace },
3884                { OPTION_CALLBACK, 0, "ignore-space-change", NULL, NULL,
3885                        "ignore changes in whitespace when finding context",
3886                        PARSE_OPT_NOARG, option_parse_space_change },
3887                { OPTION_CALLBACK, 0, "ignore-whitespace", NULL, NULL,
3888                        "ignore changes in whitespace when finding context",
3889                        PARSE_OPT_NOARG, option_parse_space_change },
3890                OPT_BOOLEAN('R', "reverse", &apply_in_reverse,
3891                        "apply the patch in reverse"),
3892                OPT_BOOLEAN(0, "unidiff-zero", &unidiff_zero,
3893                        "don't expect at least one line of context"),
3894                OPT_BOOLEAN(0, "reject", &apply_with_reject,
3895                        "leave the rejected hunks in corresponding *.rej files"),
3896                OPT_BOOLEAN(0, "allow-overlap", &allow_overlap,
3897                        "allow overlapping hunks"),
3898                OPT__VERBOSE(&apply_verbosely, "be verbose"),
3899                OPT_BIT(0, "inaccurate-eof", &options,
3900                        "tolerate incorrectly detected missing new-line at the end of file",
3901                        INACCURATE_EOF),
3902                OPT_BIT(0, "recount", &options,
3903                        "do not trust the line counts in the hunk headers",
3904                        RECOUNT),
3905                { OPTION_CALLBACK, 0, "directory", NULL, "root",
3906                        "prepend <root> to all filenames",
3907                        0, option_parse_directory },
3908                OPT_END()
3909        };
3910
3911        prefix = prefix_;
3912        prefix_length = prefix ? strlen(prefix) : 0;
3913        git_config(git_apply_config, NULL);
3914        if (apply_default_whitespace)
3915                parse_whitespace_option(apply_default_whitespace);
3916        if (apply_default_ignorewhitespace)
3917                parse_ignorewhitespace_option(apply_default_ignorewhitespace);
3918
3919        argc = parse_options(argc, argv, prefix, builtin_apply_options,
3920                        apply_usage, 0);
3921
3922        if (apply_with_reject)
3923                apply = apply_verbosely = 1;
3924        if (!force_apply && (diffstat || numstat || summary || check || fake_ancestor))
3925                apply = 0;
3926        if (check_index && is_not_gitdir)
3927                die("--index outside a repository");
3928        if (cached) {
3929                if (is_not_gitdir)
3930                        die("--cached outside a repository");
3931                check_index = 1;
3932        }
3933        for (i = 0; i < argc; i++) {
3934                const char *arg = argv[i];
3935                int fd;
3936
3937                if (!strcmp(arg, "-")) {
3938                        errs |= apply_patch(0, "<stdin>", options);
3939                        read_stdin = 0;
3940                        continue;
3941                } else if (0 < prefix_length)
3942                        arg = prefix_filename(prefix, prefix_length, arg);
3943
3944                fd = open(arg, O_RDONLY);
3945                if (fd < 0)
3946                        die_errno("can't open patch '%s'", arg);
3947                read_stdin = 0;
3948                set_default_whitespace_mode(whitespace_option);
3949                errs |= apply_patch(fd, arg, options);
3950                close(fd);
3951        }
3952        set_default_whitespace_mode(whitespace_option);
3953        if (read_stdin)
3954                errs |= apply_patch(0, "<stdin>", options);
3955        if (whitespace_error) {
3956                if (squelch_whitespace_errors &&
3957                    squelch_whitespace_errors < whitespace_error) {
3958                        int squelched =
3959                                whitespace_error - squelch_whitespace_errors;
3960                        warning("squelched %d "
3961                                "whitespace error%s",
3962                                squelched,
3963                                squelched == 1 ? "" : "s");
3964                }
3965                if (ws_error_action == die_on_ws_error)
3966                        die("%d line%s add%s whitespace errors.",
3967                            whitespace_error,
3968                            whitespace_error == 1 ? "" : "s",
3969                            whitespace_error == 1 ? "s" : "");
3970                if (applied_after_fixing_ws && apply)
3971                        warning("%d line%s applied after"
3972                                " fixing whitespace errors.",
3973                                applied_after_fixing_ws,
3974                                applied_after_fixing_ws == 1 ? "" : "s");
3975                else if (whitespace_error)
3976                        warning("%d line%s add%s whitespace errors.",
3977                                whitespace_error,
3978                                whitespace_error == 1 ? "" : "s",
3979                                whitespace_error == 1 ? "s" : "");
3980        }
3981
3982        if (update_index) {
3983                if (write_cache(newfd, active_cache, active_nr) ||
3984                    commit_locked_index(&lock_file))
3985                        die("Unable to write new index file");
3986        }
3987
3988        return !!errs;
3989}