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