fast-import.con commit Merge branch 'jk/sha1dc' (62dc8b5)
   1/*
   2(See Documentation/git-fast-import.txt for maintained documentation.)
   3Format of STDIN stream:
   4
   5  stream ::= cmd*;
   6
   7  cmd ::= new_blob
   8        | new_commit
   9        | new_tag
  10        | reset_branch
  11        | checkpoint
  12        | progress
  13        ;
  14
  15  new_blob ::= 'blob' lf
  16    mark?
  17    file_content;
  18  file_content ::= data;
  19
  20  new_commit ::= 'commit' sp ref_str lf
  21    mark?
  22    ('author' (sp name)? sp '<' email '>' sp when lf)?
  23    'committer' (sp name)? sp '<' email '>' sp when lf
  24    commit_msg
  25    ('from' sp commit-ish lf)?
  26    ('merge' sp commit-ish lf)*
  27    (file_change | ls)*
  28    lf?;
  29  commit_msg ::= data;
  30
  31  ls ::= 'ls' sp '"' quoted(path) '"' lf;
  32
  33  file_change ::= file_clr
  34    | file_del
  35    | file_rnm
  36    | file_cpy
  37    | file_obm
  38    | file_inm;
  39  file_clr ::= 'deleteall' lf;
  40  file_del ::= 'D' sp path_str lf;
  41  file_rnm ::= 'R' sp path_str sp path_str lf;
  42  file_cpy ::= 'C' sp path_str sp path_str lf;
  43  file_obm ::= 'M' sp mode sp (hexsha1 | idnum) sp path_str lf;
  44  file_inm ::= 'M' sp mode sp 'inline' sp path_str lf
  45    data;
  46  note_obm ::= 'N' sp (hexsha1 | idnum) sp commit-ish lf;
  47  note_inm ::= 'N' sp 'inline' sp commit-ish lf
  48    data;
  49
  50  new_tag ::= 'tag' sp tag_str lf
  51    'from' sp commit-ish lf
  52    ('tagger' (sp name)? sp '<' email '>' sp when lf)?
  53    tag_msg;
  54  tag_msg ::= data;
  55
  56  reset_branch ::= 'reset' sp ref_str lf
  57    ('from' sp commit-ish lf)?
  58    lf?;
  59
  60  checkpoint ::= 'checkpoint' lf
  61    lf?;
  62
  63  progress ::= 'progress' sp not_lf* lf
  64    lf?;
  65
  66     # note: the first idnum in a stream should be 1 and subsequent
  67     # idnums should not have gaps between values as this will cause
  68     # the stream parser to reserve space for the gapped values.  An
  69     # idnum can be updated in the future to a new object by issuing
  70     # a new mark directive with the old idnum.
  71     #
  72  mark ::= 'mark' sp idnum lf;
  73  data ::= (delimited_data | exact_data)
  74    lf?;
  75
  76    # note: delim may be any string but must not contain lf.
  77    # data_line may contain any data but must not be exactly
  78    # delim.
  79  delimited_data ::= 'data' sp '<<' delim lf
  80    (data_line lf)*
  81    delim lf;
  82
  83     # note: declen indicates the length of binary_data in bytes.
  84     # declen does not include the lf preceding the binary data.
  85     #
  86  exact_data ::= 'data' sp declen lf
  87    binary_data;
  88
  89     # note: quoted strings are C-style quoting supporting \c for
  90     # common escapes of 'c' (e..g \n, \t, \\, \") or \nnn where nnn
  91     # is the signed byte value in octal.  Note that the only
  92     # characters which must actually be escaped to protect the
  93     # stream formatting is: \, " and LF.  Otherwise these values
  94     # are UTF8.
  95     #
  96  commit-ish  ::= (ref_str | hexsha1 | sha1exp_str | idnum);
  97  ref_str     ::= ref;
  98  sha1exp_str ::= sha1exp;
  99  tag_str     ::= tag;
 100  path_str    ::= path    | '"' quoted(path)    '"' ;
 101  mode        ::= '100644' | '644'
 102                | '100755' | '755'
 103                | '120000'
 104                ;
 105
 106  declen ::= # unsigned 32 bit value, ascii base10 notation;
 107  bigint ::= # unsigned integer value, ascii base10 notation;
 108  binary_data ::= # file content, not interpreted;
 109
 110  when         ::= raw_when | rfc2822_when;
 111  raw_when     ::= ts sp tz;
 112  rfc2822_when ::= # Valid RFC 2822 date and time;
 113
 114  sp ::= # ASCII space character;
 115  lf ::= # ASCII newline (LF) character;
 116
 117     # note: a colon (':') must precede the numerical value assigned to
 118     # an idnum.  This is to distinguish it from a ref or tag name as
 119     # GIT does not permit ':' in ref or tag strings.
 120     #
 121  idnum   ::= ':' bigint;
 122  path    ::= # GIT style file path, e.g. "a/b/c";
 123  ref     ::= # GIT ref name, e.g. "refs/heads/MOZ_GECKO_EXPERIMENT";
 124  tag     ::= # GIT tag name, e.g. "FIREFOX_1_5";
 125  sha1exp ::= # Any valid GIT SHA1 expression;
 126  hexsha1 ::= # SHA1 in hexadecimal format;
 127
 128     # note: name and email are UTF8 strings, however name must not
 129     # contain '<' or lf and email must not contain any of the
 130     # following: '<', '>', lf.
 131     #
 132  name  ::= # valid GIT author/committer name;
 133  email ::= # valid GIT author/committer email;
 134  ts    ::= # time since the epoch in seconds, ascii base10 notation;
 135  tz    ::= # GIT style timezone;
 136
 137     # note: comments, get-mark, ls-tree, and cat-blob requests may
 138     # appear anywhere in the input, except within a data command. Any
 139     # form of the data command always escapes the related input from
 140     # comment processing.
 141     #
 142     # In case it is not clear, the '#' that starts the comment
 143     # must be the first character on that line (an lf
 144     # preceded it).
 145     #
 146
 147  get_mark ::= 'get-mark' sp idnum lf;
 148  cat_blob ::= 'cat-blob' sp (hexsha1 | idnum) lf;
 149  ls_tree  ::= 'ls' sp (hexsha1 | idnum) sp path_str lf;
 150
 151  comment ::= '#' not_lf* lf;
 152  not_lf  ::= # Any byte that is not ASCII newline (LF);
 153*/
 154
 155#include "builtin.h"
 156#include "cache.h"
 157#include "lockfile.h"
 158#include "object.h"
 159#include "blob.h"
 160#include "tree.h"
 161#include "commit.h"
 162#include "delta.h"
 163#include "pack.h"
 164#include "refs.h"
 165#include "csum-file.h"
 166#include "quote.h"
 167#include "dir.h"
 168#include "run-command.h"
 169
 170#define PACK_ID_BITS 16
 171#define MAX_PACK_ID ((1<<PACK_ID_BITS)-1)
 172#define DEPTH_BITS 13
 173#define MAX_DEPTH ((1<<DEPTH_BITS)-1)
 174
 175/*
 176 * We abuse the setuid bit on directories to mean "do not delta".
 177 */
 178#define NO_DELTA S_ISUID
 179
 180struct object_entry {
 181        struct pack_idx_entry idx;
 182        struct object_entry *next;
 183        uint32_t type : TYPE_BITS,
 184                pack_id : PACK_ID_BITS,
 185                depth : DEPTH_BITS;
 186};
 187
 188struct object_entry_pool {
 189        struct object_entry_pool *next_pool;
 190        struct object_entry *next_free;
 191        struct object_entry *end;
 192        struct object_entry entries[FLEX_ARRAY]; /* more */
 193};
 194
 195struct mark_set {
 196        union {
 197                struct object_entry *marked[1024];
 198                struct mark_set *sets[1024];
 199        } data;
 200        unsigned int shift;
 201};
 202
 203struct last_object {
 204        struct strbuf data;
 205        off_t offset;
 206        unsigned int depth;
 207        unsigned no_swap : 1;
 208};
 209
 210struct mem_pool {
 211        struct mem_pool *next_pool;
 212        char *next_free;
 213        char *end;
 214        uintmax_t space[FLEX_ARRAY]; /* more */
 215};
 216
 217struct atom_str {
 218        struct atom_str *next_atom;
 219        unsigned short str_len;
 220        char str_dat[FLEX_ARRAY]; /* more */
 221};
 222
 223struct tree_content;
 224struct tree_entry {
 225        struct tree_content *tree;
 226        struct atom_str *name;
 227        struct tree_entry_ms {
 228                uint16_t mode;
 229                unsigned char sha1[20];
 230        } versions[2];
 231};
 232
 233struct tree_content {
 234        unsigned int entry_capacity; /* must match avail_tree_content */
 235        unsigned int entry_count;
 236        unsigned int delta_depth;
 237        struct tree_entry *entries[FLEX_ARRAY]; /* more */
 238};
 239
 240struct avail_tree_content {
 241        unsigned int entry_capacity; /* must match tree_content */
 242        struct avail_tree_content *next_avail;
 243};
 244
 245struct branch {
 246        struct branch *table_next_branch;
 247        struct branch *active_next_branch;
 248        const char *name;
 249        struct tree_entry branch_tree;
 250        uintmax_t last_commit;
 251        uintmax_t num_notes;
 252        unsigned active : 1;
 253        unsigned delete : 1;
 254        unsigned pack_id : PACK_ID_BITS;
 255        unsigned char sha1[20];
 256};
 257
 258struct tag {
 259        struct tag *next_tag;
 260        const char *name;
 261        unsigned int pack_id;
 262        unsigned char sha1[20];
 263};
 264
 265struct hash_list {
 266        struct hash_list *next;
 267        unsigned char sha1[20];
 268};
 269
 270typedef enum {
 271        WHENSPEC_RAW = 1,
 272        WHENSPEC_RFC2822,
 273        WHENSPEC_NOW
 274} whenspec_type;
 275
 276struct recent_command {
 277        struct recent_command *prev;
 278        struct recent_command *next;
 279        char *buf;
 280};
 281
 282/* Configured limits on output */
 283static unsigned long max_depth = 10;
 284static off_t max_packsize;
 285static int unpack_limit = 100;
 286static int force_update;
 287
 288/* Stats and misc. counters */
 289static uintmax_t alloc_count;
 290static uintmax_t marks_set_count;
 291static uintmax_t object_count_by_type[1 << TYPE_BITS];
 292static uintmax_t duplicate_count_by_type[1 << TYPE_BITS];
 293static uintmax_t delta_count_by_type[1 << TYPE_BITS];
 294static uintmax_t delta_count_attempts_by_type[1 << TYPE_BITS];
 295static unsigned long object_count;
 296static unsigned long branch_count;
 297static unsigned long branch_load_count;
 298static int failure;
 299static FILE *pack_edges;
 300static unsigned int show_stats = 1;
 301static int global_argc;
 302static const char **global_argv;
 303
 304/* Memory pools */
 305static size_t mem_pool_alloc = 2*1024*1024 - sizeof(struct mem_pool);
 306static size_t total_allocd;
 307static struct mem_pool *mem_pool;
 308
 309/* Atom management */
 310static unsigned int atom_table_sz = 4451;
 311static unsigned int atom_cnt;
 312static struct atom_str **atom_table;
 313
 314/* The .pack file being generated */
 315static struct pack_idx_option pack_idx_opts;
 316static unsigned int pack_id;
 317static struct sha1file *pack_file;
 318static struct packed_git *pack_data;
 319static struct packed_git **all_packs;
 320static off_t pack_size;
 321
 322/* Table of objects we've written. */
 323static unsigned int object_entry_alloc = 5000;
 324static struct object_entry_pool *blocks;
 325static struct object_entry *object_table[1 << 16];
 326static struct mark_set *marks;
 327static const char *export_marks_file;
 328static const char *import_marks_file;
 329static int import_marks_file_from_stream;
 330static int import_marks_file_ignore_missing;
 331static int import_marks_file_done;
 332static int relative_marks_paths;
 333
 334/* Our last blob */
 335static struct last_object last_blob = { STRBUF_INIT, 0, 0, 0 };
 336
 337/* Tree management */
 338static unsigned int tree_entry_alloc = 1000;
 339static void *avail_tree_entry;
 340static unsigned int avail_tree_table_sz = 100;
 341static struct avail_tree_content **avail_tree_table;
 342static struct strbuf old_tree = STRBUF_INIT;
 343static struct strbuf new_tree = STRBUF_INIT;
 344
 345/* Branch data */
 346static unsigned long max_active_branches = 5;
 347static unsigned long cur_active_branches;
 348static unsigned long branch_table_sz = 1039;
 349static struct branch **branch_table;
 350static struct branch *active_branches;
 351
 352/* Tag data */
 353static struct tag *first_tag;
 354static struct tag *last_tag;
 355
 356/* Input stream parsing */
 357static whenspec_type whenspec = WHENSPEC_RAW;
 358static struct strbuf command_buf = STRBUF_INIT;
 359static int unread_command_buf;
 360static struct recent_command cmd_hist = {&cmd_hist, &cmd_hist, NULL};
 361static struct recent_command *cmd_tail = &cmd_hist;
 362static struct recent_command *rc_free;
 363static unsigned int cmd_save = 100;
 364static uintmax_t next_mark;
 365static struct strbuf new_data = STRBUF_INIT;
 366static int seen_data_command;
 367static int require_explicit_termination;
 368
 369/* Signal handling */
 370static volatile sig_atomic_t checkpoint_requested;
 371
 372/* Where to write output of cat-blob commands */
 373static int cat_blob_fd = STDOUT_FILENO;
 374
 375static void parse_argv(void);
 376static void parse_get_mark(const char *p);
 377static void parse_cat_blob(const char *p);
 378static void parse_ls(const char *p, struct branch *b);
 379
 380static void write_branch_report(FILE *rpt, struct branch *b)
 381{
 382        fprintf(rpt, "%s:\n", b->name);
 383
 384        fprintf(rpt, "  status      :");
 385        if (b->active)
 386                fputs(" active", rpt);
 387        if (b->branch_tree.tree)
 388                fputs(" loaded", rpt);
 389        if (is_null_sha1(b->branch_tree.versions[1].sha1))
 390                fputs(" dirty", rpt);
 391        fputc('\n', rpt);
 392
 393        fprintf(rpt, "  tip commit  : %s\n", sha1_to_hex(b->sha1));
 394        fprintf(rpt, "  old tree    : %s\n", sha1_to_hex(b->branch_tree.versions[0].sha1));
 395        fprintf(rpt, "  cur tree    : %s\n", sha1_to_hex(b->branch_tree.versions[1].sha1));
 396        fprintf(rpt, "  commit clock: %" PRIuMAX "\n", b->last_commit);
 397
 398        fputs("  last pack   : ", rpt);
 399        if (b->pack_id < MAX_PACK_ID)
 400                fprintf(rpt, "%u", b->pack_id);
 401        fputc('\n', rpt);
 402
 403        fputc('\n', rpt);
 404}
 405
 406static void dump_marks_helper(FILE *, uintmax_t, struct mark_set *);
 407
 408static void write_crash_report(const char *err)
 409{
 410        char *loc = git_pathdup("fast_import_crash_%"PRIuMAX, (uintmax_t) getpid());
 411        FILE *rpt = fopen(loc, "w");
 412        struct branch *b;
 413        unsigned long lu;
 414        struct recent_command *rc;
 415
 416        if (!rpt) {
 417                error_errno("can't write crash report %s", loc);
 418                free(loc);
 419                return;
 420        }
 421
 422        fprintf(stderr, "fast-import: dumping crash report to %s\n", loc);
 423
 424        fprintf(rpt, "fast-import crash report:\n");
 425        fprintf(rpt, "    fast-import process: %"PRIuMAX"\n", (uintmax_t) getpid());
 426        fprintf(rpt, "    parent process     : %"PRIuMAX"\n", (uintmax_t) getppid());
 427        fprintf(rpt, "    at %s\n", show_date(time(NULL), 0, DATE_MODE(ISO8601)));
 428        fputc('\n', rpt);
 429
 430        fputs("fatal: ", rpt);
 431        fputs(err, rpt);
 432        fputc('\n', rpt);
 433
 434        fputc('\n', rpt);
 435        fputs("Most Recent Commands Before Crash\n", rpt);
 436        fputs("---------------------------------\n", rpt);
 437        for (rc = cmd_hist.next; rc != &cmd_hist; rc = rc->next) {
 438                if (rc->next == &cmd_hist)
 439                        fputs("* ", rpt);
 440                else
 441                        fputs("  ", rpt);
 442                fputs(rc->buf, rpt);
 443                fputc('\n', rpt);
 444        }
 445
 446        fputc('\n', rpt);
 447        fputs("Active Branch LRU\n", rpt);
 448        fputs("-----------------\n", rpt);
 449        fprintf(rpt, "    active_branches = %lu cur, %lu max\n",
 450                cur_active_branches,
 451                max_active_branches);
 452        fputc('\n', rpt);
 453        fputs("  pos  clock name\n", rpt);
 454        fputs("  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n", rpt);
 455        for (b = active_branches, lu = 0; b; b = b->active_next_branch)
 456                fprintf(rpt, "  %2lu) %6" PRIuMAX" %s\n",
 457                        ++lu, b->last_commit, b->name);
 458
 459        fputc('\n', rpt);
 460        fputs("Inactive Branches\n", rpt);
 461        fputs("-----------------\n", rpt);
 462        for (lu = 0; lu < branch_table_sz; lu++) {
 463                for (b = branch_table[lu]; b; b = b->table_next_branch)
 464                        write_branch_report(rpt, b);
 465        }
 466
 467        if (first_tag) {
 468                struct tag *tg;
 469                fputc('\n', rpt);
 470                fputs("Annotated Tags\n", rpt);
 471                fputs("--------------\n", rpt);
 472                for (tg = first_tag; tg; tg = tg->next_tag) {
 473                        fputs(sha1_to_hex(tg->sha1), rpt);
 474                        fputc(' ', rpt);
 475                        fputs(tg->name, rpt);
 476                        fputc('\n', rpt);
 477                }
 478        }
 479
 480        fputc('\n', rpt);
 481        fputs("Marks\n", rpt);
 482        fputs("-----\n", rpt);
 483        if (export_marks_file)
 484                fprintf(rpt, "  exported to %s\n", export_marks_file);
 485        else
 486                dump_marks_helper(rpt, 0, marks);
 487
 488        fputc('\n', rpt);
 489        fputs("-------------------\n", rpt);
 490        fputs("END OF CRASH REPORT\n", rpt);
 491        fclose(rpt);
 492        free(loc);
 493}
 494
 495static void end_packfile(void);
 496static void unkeep_all_packs(void);
 497static void dump_marks(void);
 498
 499static NORETURN void die_nicely(const char *err, va_list params)
 500{
 501        static int zombie;
 502        char message[2 * PATH_MAX];
 503
 504        vsnprintf(message, sizeof(message), err, params);
 505        fputs("fatal: ", stderr);
 506        fputs(message, stderr);
 507        fputc('\n', stderr);
 508
 509        if (!zombie) {
 510                zombie = 1;
 511                write_crash_report(message);
 512                end_packfile();
 513                unkeep_all_packs();
 514                dump_marks();
 515        }
 516        exit(128);
 517}
 518
 519#ifndef SIGUSR1 /* Windows, for example */
 520
 521static void set_checkpoint_signal(void)
 522{
 523}
 524
 525#else
 526
 527static void checkpoint_signal(int signo)
 528{
 529        checkpoint_requested = 1;
 530}
 531
 532static void set_checkpoint_signal(void)
 533{
 534        struct sigaction sa;
 535
 536        memset(&sa, 0, sizeof(sa));
 537        sa.sa_handler = checkpoint_signal;
 538        sigemptyset(&sa.sa_mask);
 539        sa.sa_flags = SA_RESTART;
 540        sigaction(SIGUSR1, &sa, NULL);
 541}
 542
 543#endif
 544
 545static void alloc_objects(unsigned int cnt)
 546{
 547        struct object_entry_pool *b;
 548
 549        b = xmalloc(sizeof(struct object_entry_pool)
 550                + cnt * sizeof(struct object_entry));
 551        b->next_pool = blocks;
 552        b->next_free = b->entries;
 553        b->end = b->entries + cnt;
 554        blocks = b;
 555        alloc_count += cnt;
 556}
 557
 558static struct object_entry *new_object(unsigned char *sha1)
 559{
 560        struct object_entry *e;
 561
 562        if (blocks->next_free == blocks->end)
 563                alloc_objects(object_entry_alloc);
 564
 565        e = blocks->next_free++;
 566        hashcpy(e->idx.sha1, sha1);
 567        return e;
 568}
 569
 570static struct object_entry *find_object(unsigned char *sha1)
 571{
 572        unsigned int h = sha1[0] << 8 | sha1[1];
 573        struct object_entry *e;
 574        for (e = object_table[h]; e; e = e->next)
 575                if (!hashcmp(sha1, e->idx.sha1))
 576                        return e;
 577        return NULL;
 578}
 579
 580static struct object_entry *insert_object(unsigned char *sha1)
 581{
 582        unsigned int h = sha1[0] << 8 | sha1[1];
 583        struct object_entry *e = object_table[h];
 584
 585        while (e) {
 586                if (!hashcmp(sha1, e->idx.sha1))
 587                        return e;
 588                e = e->next;
 589        }
 590
 591        e = new_object(sha1);
 592        e->next = object_table[h];
 593        e->idx.offset = 0;
 594        object_table[h] = e;
 595        return e;
 596}
 597
 598static void invalidate_pack_id(unsigned int id)
 599{
 600        unsigned int h;
 601        unsigned long lu;
 602        struct tag *t;
 603
 604        for (h = 0; h < ARRAY_SIZE(object_table); h++) {
 605                struct object_entry *e;
 606
 607                for (e = object_table[h]; e; e = e->next)
 608                        if (e->pack_id == id)
 609                                e->pack_id = MAX_PACK_ID;
 610        }
 611
 612        for (lu = 0; lu < branch_table_sz; lu++) {
 613                struct branch *b;
 614
 615                for (b = branch_table[lu]; b; b = b->table_next_branch)
 616                        if (b->pack_id == id)
 617                                b->pack_id = MAX_PACK_ID;
 618        }
 619
 620        for (t = first_tag; t; t = t->next_tag)
 621                if (t->pack_id == id)
 622                        t->pack_id = MAX_PACK_ID;
 623}
 624
 625static unsigned int hc_str(const char *s, size_t len)
 626{
 627        unsigned int r = 0;
 628        while (len-- > 0)
 629                r = r * 31 + *s++;
 630        return r;
 631}
 632
 633static void *pool_alloc(size_t len)
 634{
 635        struct mem_pool *p;
 636        void *r;
 637
 638        /* round up to a 'uintmax_t' alignment */
 639        if (len & (sizeof(uintmax_t) - 1))
 640                len += sizeof(uintmax_t) - (len & (sizeof(uintmax_t) - 1));
 641
 642        for (p = mem_pool; p; p = p->next_pool)
 643                if ((p->end - p->next_free >= len))
 644                        break;
 645
 646        if (!p) {
 647                if (len >= (mem_pool_alloc/2)) {
 648                        total_allocd += len;
 649                        return xmalloc(len);
 650                }
 651                total_allocd += sizeof(struct mem_pool) + mem_pool_alloc;
 652                p = xmalloc(st_add(sizeof(struct mem_pool), mem_pool_alloc));
 653                p->next_pool = mem_pool;
 654                p->next_free = (char *) p->space;
 655                p->end = p->next_free + mem_pool_alloc;
 656                mem_pool = p;
 657        }
 658
 659        r = p->next_free;
 660        p->next_free += len;
 661        return r;
 662}
 663
 664static void *pool_calloc(size_t count, size_t size)
 665{
 666        size_t len = count * size;
 667        void *r = pool_alloc(len);
 668        memset(r, 0, len);
 669        return r;
 670}
 671
 672static char *pool_strdup(const char *s)
 673{
 674        size_t len = strlen(s) + 1;
 675        char *r = pool_alloc(len);
 676        memcpy(r, s, len);
 677        return r;
 678}
 679
 680static void insert_mark(uintmax_t idnum, struct object_entry *oe)
 681{
 682        struct mark_set *s = marks;
 683        while ((idnum >> s->shift) >= 1024) {
 684                s = pool_calloc(1, sizeof(struct mark_set));
 685                s->shift = marks->shift + 10;
 686                s->data.sets[0] = marks;
 687                marks = s;
 688        }
 689        while (s->shift) {
 690                uintmax_t i = idnum >> s->shift;
 691                idnum -= i << s->shift;
 692                if (!s->data.sets[i]) {
 693                        s->data.sets[i] = pool_calloc(1, sizeof(struct mark_set));
 694                        s->data.sets[i]->shift = s->shift - 10;
 695                }
 696                s = s->data.sets[i];
 697        }
 698        if (!s->data.marked[idnum])
 699                marks_set_count++;
 700        s->data.marked[idnum] = oe;
 701}
 702
 703static struct object_entry *find_mark(uintmax_t idnum)
 704{
 705        uintmax_t orig_idnum = idnum;
 706        struct mark_set *s = marks;
 707        struct object_entry *oe = NULL;
 708        if ((idnum >> s->shift) < 1024) {
 709                while (s && s->shift) {
 710                        uintmax_t i = idnum >> s->shift;
 711                        idnum -= i << s->shift;
 712                        s = s->data.sets[i];
 713                }
 714                if (s)
 715                        oe = s->data.marked[idnum];
 716        }
 717        if (!oe)
 718                die("mark :%" PRIuMAX " not declared", orig_idnum);
 719        return oe;
 720}
 721
 722static struct atom_str *to_atom(const char *s, unsigned short len)
 723{
 724        unsigned int hc = hc_str(s, len) % atom_table_sz;
 725        struct atom_str *c;
 726
 727        for (c = atom_table[hc]; c; c = c->next_atom)
 728                if (c->str_len == len && !strncmp(s, c->str_dat, len))
 729                        return c;
 730
 731        c = pool_alloc(sizeof(struct atom_str) + len + 1);
 732        c->str_len = len;
 733        memcpy(c->str_dat, s, len);
 734        c->str_dat[len] = 0;
 735        c->next_atom = atom_table[hc];
 736        atom_table[hc] = c;
 737        atom_cnt++;
 738        return c;
 739}
 740
 741static struct branch *lookup_branch(const char *name)
 742{
 743        unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz;
 744        struct branch *b;
 745
 746        for (b = branch_table[hc]; b; b = b->table_next_branch)
 747                if (!strcmp(name, b->name))
 748                        return b;
 749        return NULL;
 750}
 751
 752static struct branch *new_branch(const char *name)
 753{
 754        unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz;
 755        struct branch *b = lookup_branch(name);
 756
 757        if (b)
 758                die("Invalid attempt to create duplicate branch: %s", name);
 759        if (check_refname_format(name, REFNAME_ALLOW_ONELEVEL))
 760                die("Branch name doesn't conform to GIT standards: %s", name);
 761
 762        b = pool_calloc(1, sizeof(struct branch));
 763        b->name = pool_strdup(name);
 764        b->table_next_branch = branch_table[hc];
 765        b->branch_tree.versions[0].mode = S_IFDIR;
 766        b->branch_tree.versions[1].mode = S_IFDIR;
 767        b->num_notes = 0;
 768        b->active = 0;
 769        b->pack_id = MAX_PACK_ID;
 770        branch_table[hc] = b;
 771        branch_count++;
 772        return b;
 773}
 774
 775static unsigned int hc_entries(unsigned int cnt)
 776{
 777        cnt = cnt & 7 ? (cnt / 8) + 1 : cnt / 8;
 778        return cnt < avail_tree_table_sz ? cnt : avail_tree_table_sz - 1;
 779}
 780
 781static struct tree_content *new_tree_content(unsigned int cnt)
 782{
 783        struct avail_tree_content *f, *l = NULL;
 784        struct tree_content *t;
 785        unsigned int hc = hc_entries(cnt);
 786
 787        for (f = avail_tree_table[hc]; f; l = f, f = f->next_avail)
 788                if (f->entry_capacity >= cnt)
 789                        break;
 790
 791        if (f) {
 792                if (l)
 793                        l->next_avail = f->next_avail;
 794                else
 795                        avail_tree_table[hc] = f->next_avail;
 796        } else {
 797                cnt = cnt & 7 ? ((cnt / 8) + 1) * 8 : cnt;
 798                f = pool_alloc(sizeof(*t) + sizeof(t->entries[0]) * cnt);
 799                f->entry_capacity = cnt;
 800        }
 801
 802        t = (struct tree_content*)f;
 803        t->entry_count = 0;
 804        t->delta_depth = 0;
 805        return t;
 806}
 807
 808static void release_tree_entry(struct tree_entry *e);
 809static void release_tree_content(struct tree_content *t)
 810{
 811        struct avail_tree_content *f = (struct avail_tree_content*)t;
 812        unsigned int hc = hc_entries(f->entry_capacity);
 813        f->next_avail = avail_tree_table[hc];
 814        avail_tree_table[hc] = f;
 815}
 816
 817static void release_tree_content_recursive(struct tree_content *t)
 818{
 819        unsigned int i;
 820        for (i = 0; i < t->entry_count; i++)
 821                release_tree_entry(t->entries[i]);
 822        release_tree_content(t);
 823}
 824
 825static struct tree_content *grow_tree_content(
 826        struct tree_content *t,
 827        int amt)
 828{
 829        struct tree_content *r = new_tree_content(t->entry_count + amt);
 830        r->entry_count = t->entry_count;
 831        r->delta_depth = t->delta_depth;
 832        memcpy(r->entries,t->entries,t->entry_count*sizeof(t->entries[0]));
 833        release_tree_content(t);
 834        return r;
 835}
 836
 837static struct tree_entry *new_tree_entry(void)
 838{
 839        struct tree_entry *e;
 840
 841        if (!avail_tree_entry) {
 842                unsigned int n = tree_entry_alloc;
 843                total_allocd += n * sizeof(struct tree_entry);
 844                ALLOC_ARRAY(e, n);
 845                avail_tree_entry = e;
 846                while (n-- > 1) {
 847                        *((void**)e) = e + 1;
 848                        e++;
 849                }
 850                *((void**)e) = NULL;
 851        }
 852
 853        e = avail_tree_entry;
 854        avail_tree_entry = *((void**)e);
 855        return e;
 856}
 857
 858static void release_tree_entry(struct tree_entry *e)
 859{
 860        if (e->tree)
 861                release_tree_content_recursive(e->tree);
 862        *((void**)e) = avail_tree_entry;
 863        avail_tree_entry = e;
 864}
 865
 866static struct tree_content *dup_tree_content(struct tree_content *s)
 867{
 868        struct tree_content *d;
 869        struct tree_entry *a, *b;
 870        unsigned int i;
 871
 872        if (!s)
 873                return NULL;
 874        d = new_tree_content(s->entry_count);
 875        for (i = 0; i < s->entry_count; i++) {
 876                a = s->entries[i];
 877                b = new_tree_entry();
 878                memcpy(b, a, sizeof(*a));
 879                if (a->tree && is_null_sha1(b->versions[1].sha1))
 880                        b->tree = dup_tree_content(a->tree);
 881                else
 882                        b->tree = NULL;
 883                d->entries[i] = b;
 884        }
 885        d->entry_count = s->entry_count;
 886        d->delta_depth = s->delta_depth;
 887
 888        return d;
 889}
 890
 891static void start_packfile(void)
 892{
 893        static char tmp_file[PATH_MAX];
 894        struct packed_git *p;
 895        struct pack_header hdr;
 896        int pack_fd;
 897
 898        pack_fd = odb_mkstemp(tmp_file, sizeof(tmp_file),
 899                              "pack/tmp_pack_XXXXXX");
 900        FLEX_ALLOC_STR(p, pack_name, tmp_file);
 901        p->pack_fd = pack_fd;
 902        p->do_not_close = 1;
 903        pack_file = sha1fd(pack_fd, p->pack_name);
 904
 905        hdr.hdr_signature = htonl(PACK_SIGNATURE);
 906        hdr.hdr_version = htonl(2);
 907        hdr.hdr_entries = 0;
 908        sha1write(pack_file, &hdr, sizeof(hdr));
 909
 910        pack_data = p;
 911        pack_size = sizeof(hdr);
 912        object_count = 0;
 913
 914        REALLOC_ARRAY(all_packs, pack_id + 1);
 915        all_packs[pack_id] = p;
 916}
 917
 918static const char *create_index(void)
 919{
 920        const char *tmpfile;
 921        struct pack_idx_entry **idx, **c, **last;
 922        struct object_entry *e;
 923        struct object_entry_pool *o;
 924
 925        /* Build the table of object IDs. */
 926        ALLOC_ARRAY(idx, object_count);
 927        c = idx;
 928        for (o = blocks; o; o = o->next_pool)
 929                for (e = o->next_free; e-- != o->entries;)
 930                        if (pack_id == e->pack_id)
 931                                *c++ = &e->idx;
 932        last = idx + object_count;
 933        if (c != last)
 934                die("internal consistency error creating the index");
 935
 936        tmpfile = write_idx_file(NULL, idx, object_count, &pack_idx_opts, pack_data->sha1);
 937        free(idx);
 938        return tmpfile;
 939}
 940
 941static char *keep_pack(const char *curr_index_name)
 942{
 943        static const char *keep_msg = "fast-import";
 944        struct strbuf name = STRBUF_INIT;
 945        int keep_fd;
 946
 947        odb_pack_name(&name, pack_data->sha1, "keep");
 948        keep_fd = odb_pack_keep(name.buf);
 949        if (keep_fd < 0)
 950                die_errno("cannot create keep file");
 951        write_or_die(keep_fd, keep_msg, strlen(keep_msg));
 952        if (close(keep_fd))
 953                die_errno("failed to write keep file");
 954
 955        odb_pack_name(&name, pack_data->sha1, "pack");
 956        if (finalize_object_file(pack_data->pack_name, name.buf))
 957                die("cannot store pack file");
 958
 959        odb_pack_name(&name, pack_data->sha1, "idx");
 960        if (finalize_object_file(curr_index_name, name.buf))
 961                die("cannot store index file");
 962        free((void *)curr_index_name);
 963        return strbuf_detach(&name, NULL);
 964}
 965
 966static void unkeep_all_packs(void)
 967{
 968        struct strbuf name = STRBUF_INIT;
 969        int k;
 970
 971        for (k = 0; k < pack_id; k++) {
 972                struct packed_git *p = all_packs[k];
 973                odb_pack_name(&name, p->sha1, "keep");
 974                unlink_or_warn(name.buf);
 975        }
 976        strbuf_release(&name);
 977}
 978
 979static int loosen_small_pack(const struct packed_git *p)
 980{
 981        struct child_process unpack = CHILD_PROCESS_INIT;
 982
 983        if (lseek(p->pack_fd, 0, SEEK_SET) < 0)
 984                die_errno("Failed seeking to start of '%s'", p->pack_name);
 985
 986        unpack.in = p->pack_fd;
 987        unpack.git_cmd = 1;
 988        unpack.stdout_to_stderr = 1;
 989        argv_array_push(&unpack.args, "unpack-objects");
 990        if (!show_stats)
 991                argv_array_push(&unpack.args, "-q");
 992
 993        return run_command(&unpack);
 994}
 995
 996static void end_packfile(void)
 997{
 998        static int running;
 999
1000        if (running || !pack_data)
1001                return;
1002
1003        running = 1;
1004        clear_delta_base_cache();
1005        if (object_count) {
1006                struct packed_git *new_p;
1007                unsigned char cur_pack_sha1[20];
1008                char *idx_name;
1009                int i;
1010                struct branch *b;
1011                struct tag *t;
1012
1013                close_pack_windows(pack_data);
1014                sha1close(pack_file, cur_pack_sha1, 0);
1015                fixup_pack_header_footer(pack_data->pack_fd, pack_data->sha1,
1016                                    pack_data->pack_name, object_count,
1017                                    cur_pack_sha1, pack_size);
1018
1019                if (object_count <= unpack_limit) {
1020                        if (!loosen_small_pack(pack_data)) {
1021                                invalidate_pack_id(pack_id);
1022                                goto discard_pack;
1023                        }
1024                }
1025
1026                close(pack_data->pack_fd);
1027                idx_name = keep_pack(create_index());
1028
1029                /* Register the packfile with core git's machinery. */
1030                new_p = add_packed_git(idx_name, strlen(idx_name), 1);
1031                if (!new_p)
1032                        die("core git rejected index %s", idx_name);
1033                all_packs[pack_id] = new_p;
1034                install_packed_git(new_p);
1035                free(idx_name);
1036
1037                /* Print the boundary */
1038                if (pack_edges) {
1039                        fprintf(pack_edges, "%s:", new_p->pack_name);
1040                        for (i = 0; i < branch_table_sz; i++) {
1041                                for (b = branch_table[i]; b; b = b->table_next_branch) {
1042                                        if (b->pack_id == pack_id)
1043                                                fprintf(pack_edges, " %s", sha1_to_hex(b->sha1));
1044                                }
1045                        }
1046                        for (t = first_tag; t; t = t->next_tag) {
1047                                if (t->pack_id == pack_id)
1048                                        fprintf(pack_edges, " %s", sha1_to_hex(t->sha1));
1049                        }
1050                        fputc('\n', pack_edges);
1051                        fflush(pack_edges);
1052                }
1053
1054                pack_id++;
1055        }
1056        else {
1057discard_pack:
1058                close(pack_data->pack_fd);
1059                unlink_or_warn(pack_data->pack_name);
1060        }
1061        free(pack_data);
1062        pack_data = NULL;
1063        running = 0;
1064
1065        /* We can't carry a delta across packfiles. */
1066        strbuf_release(&last_blob.data);
1067        last_blob.offset = 0;
1068        last_blob.depth = 0;
1069}
1070
1071static void cycle_packfile(void)
1072{
1073        end_packfile();
1074        start_packfile();
1075}
1076
1077static int store_object(
1078        enum object_type type,
1079        struct strbuf *dat,
1080        struct last_object *last,
1081        unsigned char *sha1out,
1082        uintmax_t mark)
1083{
1084        void *out, *delta;
1085        struct object_entry *e;
1086        unsigned char hdr[96];
1087        unsigned char sha1[20];
1088        unsigned long hdrlen, deltalen;
1089        git_SHA_CTX c;
1090        git_zstream s;
1091
1092        hdrlen = xsnprintf((char *)hdr, sizeof(hdr), "%s %lu",
1093                           typename(type), (unsigned long)dat->len) + 1;
1094        git_SHA1_Init(&c);
1095        git_SHA1_Update(&c, hdr, hdrlen);
1096        git_SHA1_Update(&c, dat->buf, dat->len);
1097        git_SHA1_Final(sha1, &c);
1098        if (sha1out)
1099                hashcpy(sha1out, sha1);
1100
1101        e = insert_object(sha1);
1102        if (mark)
1103                insert_mark(mark, e);
1104        if (e->idx.offset) {
1105                duplicate_count_by_type[type]++;
1106                return 1;
1107        } else if (find_sha1_pack(sha1, packed_git)) {
1108                e->type = type;
1109                e->pack_id = MAX_PACK_ID;
1110                e->idx.offset = 1; /* just not zero! */
1111                duplicate_count_by_type[type]++;
1112                return 1;
1113        }
1114
1115        if (last && last->data.buf && last->depth < max_depth && dat->len > 20) {
1116                delta_count_attempts_by_type[type]++;
1117                delta = diff_delta(last->data.buf, last->data.len,
1118                        dat->buf, dat->len,
1119                        &deltalen, dat->len - 20);
1120        } else
1121                delta = NULL;
1122
1123        git_deflate_init(&s, pack_compression_level);
1124        if (delta) {
1125                s.next_in = delta;
1126                s.avail_in = deltalen;
1127        } else {
1128                s.next_in = (void *)dat->buf;
1129                s.avail_in = dat->len;
1130        }
1131        s.avail_out = git_deflate_bound(&s, s.avail_in);
1132        s.next_out = out = xmalloc(s.avail_out);
1133        while (git_deflate(&s, Z_FINISH) == Z_OK)
1134                ; /* nothing */
1135        git_deflate_end(&s);
1136
1137        /* Determine if we should auto-checkpoint. */
1138        if ((max_packsize && (pack_size + 60 + s.total_out) > max_packsize)
1139                || (pack_size + 60 + s.total_out) < pack_size) {
1140
1141                /* This new object needs to *not* have the current pack_id. */
1142                e->pack_id = pack_id + 1;
1143                cycle_packfile();
1144
1145                /* We cannot carry a delta into the new pack. */
1146                if (delta) {
1147                        free(delta);
1148                        delta = NULL;
1149
1150                        git_deflate_init(&s, pack_compression_level);
1151                        s.next_in = (void *)dat->buf;
1152                        s.avail_in = dat->len;
1153                        s.avail_out = git_deflate_bound(&s, s.avail_in);
1154                        s.next_out = out = xrealloc(out, s.avail_out);
1155                        while (git_deflate(&s, Z_FINISH) == Z_OK)
1156                                ; /* nothing */
1157                        git_deflate_end(&s);
1158                }
1159        }
1160
1161        e->type = type;
1162        e->pack_id = pack_id;
1163        e->idx.offset = pack_size;
1164        object_count++;
1165        object_count_by_type[type]++;
1166
1167        crc32_begin(pack_file);
1168
1169        if (delta) {
1170                off_t ofs = e->idx.offset - last->offset;
1171                unsigned pos = sizeof(hdr) - 1;
1172
1173                delta_count_by_type[type]++;
1174                e->depth = last->depth + 1;
1175
1176                hdrlen = encode_in_pack_object_header(hdr, sizeof(hdr),
1177                                                      OBJ_OFS_DELTA, deltalen);
1178                sha1write(pack_file, hdr, hdrlen);
1179                pack_size += hdrlen;
1180
1181                hdr[pos] = ofs & 127;
1182                while (ofs >>= 7)
1183                        hdr[--pos] = 128 | (--ofs & 127);
1184                sha1write(pack_file, hdr + pos, sizeof(hdr) - pos);
1185                pack_size += sizeof(hdr) - pos;
1186        } else {
1187                e->depth = 0;
1188                hdrlen = encode_in_pack_object_header(hdr, sizeof(hdr),
1189                                                      type, dat->len);
1190                sha1write(pack_file, hdr, hdrlen);
1191                pack_size += hdrlen;
1192        }
1193
1194        sha1write(pack_file, out, s.total_out);
1195        pack_size += s.total_out;
1196
1197        e->idx.crc32 = crc32_end(pack_file);
1198
1199        free(out);
1200        free(delta);
1201        if (last) {
1202                if (last->no_swap) {
1203                        last->data = *dat;
1204                } else {
1205                        strbuf_swap(&last->data, dat);
1206                }
1207                last->offset = e->idx.offset;
1208                last->depth = e->depth;
1209        }
1210        return 0;
1211}
1212
1213static void truncate_pack(struct sha1file_checkpoint *checkpoint)
1214{
1215        if (sha1file_truncate(pack_file, checkpoint))
1216                die_errno("cannot truncate pack to skip duplicate");
1217        pack_size = checkpoint->offset;
1218}
1219
1220static void stream_blob(uintmax_t len, unsigned char *sha1out, uintmax_t mark)
1221{
1222        size_t in_sz = 64 * 1024, out_sz = 64 * 1024;
1223        unsigned char *in_buf = xmalloc(in_sz);
1224        unsigned char *out_buf = xmalloc(out_sz);
1225        struct object_entry *e;
1226        unsigned char sha1[20];
1227        unsigned long hdrlen;
1228        off_t offset;
1229        git_SHA_CTX c;
1230        git_zstream s;
1231        struct sha1file_checkpoint checkpoint;
1232        int status = Z_OK;
1233
1234        /* Determine if we should auto-checkpoint. */
1235        if ((max_packsize && (pack_size + 60 + len) > max_packsize)
1236                || (pack_size + 60 + len) < pack_size)
1237                cycle_packfile();
1238
1239        sha1file_checkpoint(pack_file, &checkpoint);
1240        offset = checkpoint.offset;
1241
1242        hdrlen = xsnprintf((char *)out_buf, out_sz, "blob %" PRIuMAX, len) + 1;
1243
1244        git_SHA1_Init(&c);
1245        git_SHA1_Update(&c, out_buf, hdrlen);
1246
1247        crc32_begin(pack_file);
1248
1249        git_deflate_init(&s, pack_compression_level);
1250
1251        hdrlen = encode_in_pack_object_header(out_buf, out_sz, OBJ_BLOB, len);
1252
1253        s.next_out = out_buf + hdrlen;
1254        s.avail_out = out_sz - hdrlen;
1255
1256        while (status != Z_STREAM_END) {
1257                if (0 < len && !s.avail_in) {
1258                        size_t cnt = in_sz < len ? in_sz : (size_t)len;
1259                        size_t n = fread(in_buf, 1, cnt, stdin);
1260                        if (!n && feof(stdin))
1261                                die("EOF in data (%" PRIuMAX " bytes remaining)", len);
1262
1263                        git_SHA1_Update(&c, in_buf, n);
1264                        s.next_in = in_buf;
1265                        s.avail_in = n;
1266                        len -= n;
1267                }
1268
1269                status = git_deflate(&s, len ? 0 : Z_FINISH);
1270
1271                if (!s.avail_out || status == Z_STREAM_END) {
1272                        size_t n = s.next_out - out_buf;
1273                        sha1write(pack_file, out_buf, n);
1274                        pack_size += n;
1275                        s.next_out = out_buf;
1276                        s.avail_out = out_sz;
1277                }
1278
1279                switch (status) {
1280                case Z_OK:
1281                case Z_BUF_ERROR:
1282                case Z_STREAM_END:
1283                        continue;
1284                default:
1285                        die("unexpected deflate failure: %d", status);
1286                }
1287        }
1288        git_deflate_end(&s);
1289        git_SHA1_Final(sha1, &c);
1290
1291        if (sha1out)
1292                hashcpy(sha1out, sha1);
1293
1294        e = insert_object(sha1);
1295
1296        if (mark)
1297                insert_mark(mark, e);
1298
1299        if (e->idx.offset) {
1300                duplicate_count_by_type[OBJ_BLOB]++;
1301                truncate_pack(&checkpoint);
1302
1303        } else if (find_sha1_pack(sha1, packed_git)) {
1304                e->type = OBJ_BLOB;
1305                e->pack_id = MAX_PACK_ID;
1306                e->idx.offset = 1; /* just not zero! */
1307                duplicate_count_by_type[OBJ_BLOB]++;
1308                truncate_pack(&checkpoint);
1309
1310        } else {
1311                e->depth = 0;
1312                e->type = OBJ_BLOB;
1313                e->pack_id = pack_id;
1314                e->idx.offset = offset;
1315                e->idx.crc32 = crc32_end(pack_file);
1316                object_count++;
1317                object_count_by_type[OBJ_BLOB]++;
1318        }
1319
1320        free(in_buf);
1321        free(out_buf);
1322}
1323
1324/* All calls must be guarded by find_object() or find_mark() to
1325 * ensure the 'struct object_entry' passed was written by this
1326 * process instance.  We unpack the entry by the offset, avoiding
1327 * the need for the corresponding .idx file.  This unpacking rule
1328 * works because we only use OBJ_REF_DELTA within the packfiles
1329 * created by fast-import.
1330 *
1331 * oe must not be NULL.  Such an oe usually comes from giving
1332 * an unknown SHA-1 to find_object() or an undefined mark to
1333 * find_mark().  Callers must test for this condition and use
1334 * the standard read_sha1_file() when it happens.
1335 *
1336 * oe->pack_id must not be MAX_PACK_ID.  Such an oe is usually from
1337 * find_mark(), where the mark was reloaded from an existing marks
1338 * file and is referencing an object that this fast-import process
1339 * instance did not write out to a packfile.  Callers must test for
1340 * this condition and use read_sha1_file() instead.
1341 */
1342static void *gfi_unpack_entry(
1343        struct object_entry *oe,
1344        unsigned long *sizep)
1345{
1346        enum object_type type;
1347        struct packed_git *p = all_packs[oe->pack_id];
1348        if (p == pack_data && p->pack_size < (pack_size + 20)) {
1349                /* The object is stored in the packfile we are writing to
1350                 * and we have modified it since the last time we scanned
1351                 * back to read a previously written object.  If an old
1352                 * window covered [p->pack_size, p->pack_size + 20) its
1353                 * data is stale and is not valid.  Closing all windows
1354                 * and updating the packfile length ensures we can read
1355                 * the newly written data.
1356                 */
1357                close_pack_windows(p);
1358                sha1flush(pack_file);
1359
1360                /* We have to offer 20 bytes additional on the end of
1361                 * the packfile as the core unpacker code assumes the
1362                 * footer is present at the file end and must promise
1363                 * at least 20 bytes within any window it maps.  But
1364                 * we don't actually create the footer here.
1365                 */
1366                p->pack_size = pack_size + 20;
1367        }
1368        return unpack_entry(p, oe->idx.offset, &type, sizep);
1369}
1370
1371static const char *get_mode(const char *str, uint16_t *modep)
1372{
1373        unsigned char c;
1374        uint16_t mode = 0;
1375
1376        while ((c = *str++) != ' ') {
1377                if (c < '0' || c > '7')
1378                        return NULL;
1379                mode = (mode << 3) + (c - '0');
1380        }
1381        *modep = mode;
1382        return str;
1383}
1384
1385static void load_tree(struct tree_entry *root)
1386{
1387        unsigned char *sha1 = root->versions[1].sha1;
1388        struct object_entry *myoe;
1389        struct tree_content *t;
1390        unsigned long size;
1391        char *buf;
1392        const char *c;
1393
1394        root->tree = t = new_tree_content(8);
1395        if (is_null_sha1(sha1))
1396                return;
1397
1398        myoe = find_object(sha1);
1399        if (myoe && myoe->pack_id != MAX_PACK_ID) {
1400                if (myoe->type != OBJ_TREE)
1401                        die("Not a tree: %s", sha1_to_hex(sha1));
1402                t->delta_depth = myoe->depth;
1403                buf = gfi_unpack_entry(myoe, &size);
1404                if (!buf)
1405                        die("Can't load tree %s", sha1_to_hex(sha1));
1406        } else {
1407                enum object_type type;
1408                buf = read_sha1_file(sha1, &type, &size);
1409                if (!buf || type != OBJ_TREE)
1410                        die("Can't load tree %s", sha1_to_hex(sha1));
1411        }
1412
1413        c = buf;
1414        while (c != (buf + size)) {
1415                struct tree_entry *e = new_tree_entry();
1416
1417                if (t->entry_count == t->entry_capacity)
1418                        root->tree = t = grow_tree_content(t, t->entry_count);
1419                t->entries[t->entry_count++] = e;
1420
1421                e->tree = NULL;
1422                c = get_mode(c, &e->versions[1].mode);
1423                if (!c)
1424                        die("Corrupt mode in %s", sha1_to_hex(sha1));
1425                e->versions[0].mode = e->versions[1].mode;
1426                e->name = to_atom(c, strlen(c));
1427                c += e->name->str_len + 1;
1428                hashcpy(e->versions[0].sha1, (unsigned char *)c);
1429                hashcpy(e->versions[1].sha1, (unsigned char *)c);
1430                c += 20;
1431        }
1432        free(buf);
1433}
1434
1435static int tecmp0 (const void *_a, const void *_b)
1436{
1437        struct tree_entry *a = *((struct tree_entry**)_a);
1438        struct tree_entry *b = *((struct tree_entry**)_b);
1439        return base_name_compare(
1440                a->name->str_dat, a->name->str_len, a->versions[0].mode,
1441                b->name->str_dat, b->name->str_len, b->versions[0].mode);
1442}
1443
1444static int tecmp1 (const void *_a, const void *_b)
1445{
1446        struct tree_entry *a = *((struct tree_entry**)_a);
1447        struct tree_entry *b = *((struct tree_entry**)_b);
1448        return base_name_compare(
1449                a->name->str_dat, a->name->str_len, a->versions[1].mode,
1450                b->name->str_dat, b->name->str_len, b->versions[1].mode);
1451}
1452
1453static void mktree(struct tree_content *t, int v, struct strbuf *b)
1454{
1455        size_t maxlen = 0;
1456        unsigned int i;
1457
1458        if (!v)
1459                QSORT(t->entries, t->entry_count, tecmp0);
1460        else
1461                QSORT(t->entries, t->entry_count, tecmp1);
1462
1463        for (i = 0; i < t->entry_count; i++) {
1464                if (t->entries[i]->versions[v].mode)
1465                        maxlen += t->entries[i]->name->str_len + 34;
1466        }
1467
1468        strbuf_reset(b);
1469        strbuf_grow(b, maxlen);
1470        for (i = 0; i < t->entry_count; i++) {
1471                struct tree_entry *e = t->entries[i];
1472                if (!e->versions[v].mode)
1473                        continue;
1474                strbuf_addf(b, "%o %s%c",
1475                        (unsigned int)(e->versions[v].mode & ~NO_DELTA),
1476                        e->name->str_dat, '\0');
1477                strbuf_add(b, e->versions[v].sha1, 20);
1478        }
1479}
1480
1481static void store_tree(struct tree_entry *root)
1482{
1483        struct tree_content *t;
1484        unsigned int i, j, del;
1485        struct last_object lo = { STRBUF_INIT, 0, 0, /* no_swap */ 1 };
1486        struct object_entry *le = NULL;
1487
1488        if (!is_null_sha1(root->versions[1].sha1))
1489                return;
1490
1491        if (!root->tree)
1492                load_tree(root);
1493        t = root->tree;
1494
1495        for (i = 0; i < t->entry_count; i++) {
1496                if (t->entries[i]->tree)
1497                        store_tree(t->entries[i]);
1498        }
1499
1500        if (!(root->versions[0].mode & NO_DELTA))
1501                le = find_object(root->versions[0].sha1);
1502        if (S_ISDIR(root->versions[0].mode) && le && le->pack_id == pack_id) {
1503                mktree(t, 0, &old_tree);
1504                lo.data = old_tree;
1505                lo.offset = le->idx.offset;
1506                lo.depth = t->delta_depth;
1507        }
1508
1509        mktree(t, 1, &new_tree);
1510        store_object(OBJ_TREE, &new_tree, &lo, root->versions[1].sha1, 0);
1511
1512        t->delta_depth = lo.depth;
1513        for (i = 0, j = 0, del = 0; i < t->entry_count; i++) {
1514                struct tree_entry *e = t->entries[i];
1515                if (e->versions[1].mode) {
1516                        e->versions[0].mode = e->versions[1].mode;
1517                        hashcpy(e->versions[0].sha1, e->versions[1].sha1);
1518                        t->entries[j++] = e;
1519                } else {
1520                        release_tree_entry(e);
1521                        del++;
1522                }
1523        }
1524        t->entry_count -= del;
1525}
1526
1527static void tree_content_replace(
1528        struct tree_entry *root,
1529        const unsigned char *sha1,
1530        const uint16_t mode,
1531        struct tree_content *newtree)
1532{
1533        if (!S_ISDIR(mode))
1534                die("Root cannot be a non-directory");
1535        hashclr(root->versions[0].sha1);
1536        hashcpy(root->versions[1].sha1, sha1);
1537        if (root->tree)
1538                release_tree_content_recursive(root->tree);
1539        root->tree = newtree;
1540}
1541
1542static int tree_content_set(
1543        struct tree_entry *root,
1544        const char *p,
1545        const unsigned char *sha1,
1546        const uint16_t mode,
1547        struct tree_content *subtree)
1548{
1549        struct tree_content *t;
1550        const char *slash1;
1551        unsigned int i, n;
1552        struct tree_entry *e;
1553
1554        slash1 = strchrnul(p, '/');
1555        n = slash1 - p;
1556        if (!n)
1557                die("Empty path component found in input");
1558        if (!*slash1 && !S_ISDIR(mode) && subtree)
1559                die("Non-directories cannot have subtrees");
1560
1561        if (!root->tree)
1562                load_tree(root);
1563        t = root->tree;
1564        for (i = 0; i < t->entry_count; i++) {
1565                e = t->entries[i];
1566                if (e->name->str_len == n && !fspathncmp(p, e->name->str_dat, n)) {
1567                        if (!*slash1) {
1568                                if (!S_ISDIR(mode)
1569                                                && e->versions[1].mode == mode
1570                                                && !hashcmp(e->versions[1].sha1, sha1))
1571                                        return 0;
1572                                e->versions[1].mode = mode;
1573                                hashcpy(e->versions[1].sha1, sha1);
1574                                if (e->tree)
1575                                        release_tree_content_recursive(e->tree);
1576                                e->tree = subtree;
1577
1578                                /*
1579                                 * We need to leave e->versions[0].sha1 alone
1580                                 * to avoid modifying the preimage tree used
1581                                 * when writing out the parent directory.
1582                                 * But after replacing the subdir with a
1583                                 * completely different one, it's not a good
1584                                 * delta base any more, and besides, we've
1585                                 * thrown away the tree entries needed to
1586                                 * make a delta against it.
1587                                 *
1588                                 * So let's just explicitly disable deltas
1589                                 * for the subtree.
1590                                 */
1591                                if (S_ISDIR(e->versions[0].mode))
1592                                        e->versions[0].mode |= NO_DELTA;
1593
1594                                hashclr(root->versions[1].sha1);
1595                                return 1;
1596                        }
1597                        if (!S_ISDIR(e->versions[1].mode)) {
1598                                e->tree = new_tree_content(8);
1599                                e->versions[1].mode = S_IFDIR;
1600                        }
1601                        if (!e->tree)
1602                                load_tree(e);
1603                        if (tree_content_set(e, slash1 + 1, sha1, mode, subtree)) {
1604                                hashclr(root->versions[1].sha1);
1605                                return 1;
1606                        }
1607                        return 0;
1608                }
1609        }
1610
1611        if (t->entry_count == t->entry_capacity)
1612                root->tree = t = grow_tree_content(t, t->entry_count);
1613        e = new_tree_entry();
1614        e->name = to_atom(p, n);
1615        e->versions[0].mode = 0;
1616        hashclr(e->versions[0].sha1);
1617        t->entries[t->entry_count++] = e;
1618        if (*slash1) {
1619                e->tree = new_tree_content(8);
1620                e->versions[1].mode = S_IFDIR;
1621                tree_content_set(e, slash1 + 1, sha1, mode, subtree);
1622        } else {
1623                e->tree = subtree;
1624                e->versions[1].mode = mode;
1625                hashcpy(e->versions[1].sha1, sha1);
1626        }
1627        hashclr(root->versions[1].sha1);
1628        return 1;
1629}
1630
1631static int tree_content_remove(
1632        struct tree_entry *root,
1633        const char *p,
1634        struct tree_entry *backup_leaf,
1635        int allow_root)
1636{
1637        struct tree_content *t;
1638        const char *slash1;
1639        unsigned int i, n;
1640        struct tree_entry *e;
1641
1642        slash1 = strchrnul(p, '/');
1643        n = slash1 - p;
1644
1645        if (!root->tree)
1646                load_tree(root);
1647
1648        if (!*p && allow_root) {
1649                e = root;
1650                goto del_entry;
1651        }
1652
1653        t = root->tree;
1654        for (i = 0; i < t->entry_count; i++) {
1655                e = t->entries[i];
1656                if (e->name->str_len == n && !fspathncmp(p, e->name->str_dat, n)) {
1657                        if (*slash1 && !S_ISDIR(e->versions[1].mode))
1658                                /*
1659                                 * If p names a file in some subdirectory, and a
1660                                 * file or symlink matching the name of the
1661                                 * parent directory of p exists, then p cannot
1662                                 * exist and need not be deleted.
1663                                 */
1664                                return 1;
1665                        if (!*slash1 || !S_ISDIR(e->versions[1].mode))
1666                                goto del_entry;
1667                        if (!e->tree)
1668                                load_tree(e);
1669                        if (tree_content_remove(e, slash1 + 1, backup_leaf, 0)) {
1670                                for (n = 0; n < e->tree->entry_count; n++) {
1671                                        if (e->tree->entries[n]->versions[1].mode) {
1672                                                hashclr(root->versions[1].sha1);
1673                                                return 1;
1674                                        }
1675                                }
1676                                backup_leaf = NULL;
1677                                goto del_entry;
1678                        }
1679                        return 0;
1680                }
1681        }
1682        return 0;
1683
1684del_entry:
1685        if (backup_leaf)
1686                memcpy(backup_leaf, e, sizeof(*backup_leaf));
1687        else if (e->tree)
1688                release_tree_content_recursive(e->tree);
1689        e->tree = NULL;
1690        e->versions[1].mode = 0;
1691        hashclr(e->versions[1].sha1);
1692        hashclr(root->versions[1].sha1);
1693        return 1;
1694}
1695
1696static int tree_content_get(
1697        struct tree_entry *root,
1698        const char *p,
1699        struct tree_entry *leaf,
1700        int allow_root)
1701{
1702        struct tree_content *t;
1703        const char *slash1;
1704        unsigned int i, n;
1705        struct tree_entry *e;
1706
1707        slash1 = strchrnul(p, '/');
1708        n = slash1 - p;
1709        if (!n && !allow_root)
1710                die("Empty path component found in input");
1711
1712        if (!root->tree)
1713                load_tree(root);
1714
1715        if (!n) {
1716                e = root;
1717                goto found_entry;
1718        }
1719
1720        t = root->tree;
1721        for (i = 0; i < t->entry_count; i++) {
1722                e = t->entries[i];
1723                if (e->name->str_len == n && !fspathncmp(p, e->name->str_dat, n)) {
1724                        if (!*slash1)
1725                                goto found_entry;
1726                        if (!S_ISDIR(e->versions[1].mode))
1727                                return 0;
1728                        if (!e->tree)
1729                                load_tree(e);
1730                        return tree_content_get(e, slash1 + 1, leaf, 0);
1731                }
1732        }
1733        return 0;
1734
1735found_entry:
1736        memcpy(leaf, e, sizeof(*leaf));
1737        if (e->tree && is_null_sha1(e->versions[1].sha1))
1738                leaf->tree = dup_tree_content(e->tree);
1739        else
1740                leaf->tree = NULL;
1741        return 1;
1742}
1743
1744static int update_branch(struct branch *b)
1745{
1746        static const char *msg = "fast-import";
1747        struct ref_transaction *transaction;
1748        unsigned char old_sha1[20];
1749        struct strbuf err = STRBUF_INIT;
1750
1751        if (is_null_sha1(b->sha1)) {
1752                if (b->delete)
1753                        delete_ref(NULL, b->name, NULL, 0);
1754                return 0;
1755        }
1756        if (read_ref(b->name, old_sha1))
1757                hashclr(old_sha1);
1758        if (!force_update && !is_null_sha1(old_sha1)) {
1759                struct commit *old_cmit, *new_cmit;
1760
1761                old_cmit = lookup_commit_reference_gently(old_sha1, 0);
1762                new_cmit = lookup_commit_reference_gently(b->sha1, 0);
1763                if (!old_cmit || !new_cmit)
1764                        return error("Branch %s is missing commits.", b->name);
1765
1766                if (!in_merge_bases(old_cmit, new_cmit)) {
1767                        warning("Not updating %s"
1768                                " (new tip %s does not contain %s)",
1769                                b->name, sha1_to_hex(b->sha1), sha1_to_hex(old_sha1));
1770                        return -1;
1771                }
1772        }
1773        transaction = ref_transaction_begin(&err);
1774        if (!transaction ||
1775            ref_transaction_update(transaction, b->name, b->sha1, old_sha1,
1776                                   0, msg, &err) ||
1777            ref_transaction_commit(transaction, &err)) {
1778                ref_transaction_free(transaction);
1779                error("%s", err.buf);
1780                strbuf_release(&err);
1781                return -1;
1782        }
1783        ref_transaction_free(transaction);
1784        strbuf_release(&err);
1785        return 0;
1786}
1787
1788static void dump_branches(void)
1789{
1790        unsigned int i;
1791        struct branch *b;
1792
1793        for (i = 0; i < branch_table_sz; i++) {
1794                for (b = branch_table[i]; b; b = b->table_next_branch)
1795                        failure |= update_branch(b);
1796        }
1797}
1798
1799static void dump_tags(void)
1800{
1801        static const char *msg = "fast-import";
1802        struct tag *t;
1803        struct strbuf ref_name = STRBUF_INIT;
1804        struct strbuf err = STRBUF_INIT;
1805        struct ref_transaction *transaction;
1806
1807        transaction = ref_transaction_begin(&err);
1808        if (!transaction) {
1809                failure |= error("%s", err.buf);
1810                goto cleanup;
1811        }
1812        for (t = first_tag; t; t = t->next_tag) {
1813                strbuf_reset(&ref_name);
1814                strbuf_addf(&ref_name, "refs/tags/%s", t->name);
1815
1816                if (ref_transaction_update(transaction, ref_name.buf,
1817                                           t->sha1, NULL, 0, msg, &err)) {
1818                        failure |= error("%s", err.buf);
1819                        goto cleanup;
1820                }
1821        }
1822        if (ref_transaction_commit(transaction, &err))
1823                failure |= error("%s", err.buf);
1824
1825 cleanup:
1826        ref_transaction_free(transaction);
1827        strbuf_release(&ref_name);
1828        strbuf_release(&err);
1829}
1830
1831static void dump_marks_helper(FILE *f,
1832        uintmax_t base,
1833        struct mark_set *m)
1834{
1835        uintmax_t k;
1836        if (m->shift) {
1837                for (k = 0; k < 1024; k++) {
1838                        if (m->data.sets[k])
1839                                dump_marks_helper(f, base + (k << m->shift),
1840                                        m->data.sets[k]);
1841                }
1842        } else {
1843                for (k = 0; k < 1024; k++) {
1844                        if (m->data.marked[k])
1845                                fprintf(f, ":%" PRIuMAX " %s\n", base + k,
1846                                        sha1_to_hex(m->data.marked[k]->idx.sha1));
1847                }
1848        }
1849}
1850
1851static void dump_marks(void)
1852{
1853        static struct lock_file mark_lock;
1854        FILE *f;
1855
1856        if (!export_marks_file || (import_marks_file && !import_marks_file_done))
1857                return;
1858
1859        if (hold_lock_file_for_update(&mark_lock, export_marks_file, 0) < 0) {
1860                failure |= error_errno("Unable to write marks file %s",
1861                                       export_marks_file);
1862                return;
1863        }
1864
1865        f = fdopen_lock_file(&mark_lock, "w");
1866        if (!f) {
1867                int saved_errno = errno;
1868                rollback_lock_file(&mark_lock);
1869                failure |= error("Unable to write marks file %s: %s",
1870                        export_marks_file, strerror(saved_errno));
1871                return;
1872        }
1873
1874        dump_marks_helper(f, 0, marks);
1875        if (commit_lock_file(&mark_lock)) {
1876                failure |= error_errno("Unable to write file %s",
1877                                       export_marks_file);
1878                return;
1879        }
1880}
1881
1882static void read_marks(void)
1883{
1884        char line[512];
1885        FILE *f = fopen(import_marks_file, "r");
1886        if (f)
1887                ;
1888        else if (import_marks_file_ignore_missing && errno == ENOENT)
1889                goto done; /* Marks file does not exist */
1890        else
1891                die_errno("cannot read '%s'", import_marks_file);
1892        while (fgets(line, sizeof(line), f)) {
1893                uintmax_t mark;
1894                char *end;
1895                unsigned char sha1[20];
1896                struct object_entry *e;
1897
1898                end = strchr(line, '\n');
1899                if (line[0] != ':' || !end)
1900                        die("corrupt mark line: %s", line);
1901                *end = 0;
1902                mark = strtoumax(line + 1, &end, 10);
1903                if (!mark || end == line + 1
1904                        || *end != ' ' || get_sha1_hex(end + 1, sha1))
1905                        die("corrupt mark line: %s", line);
1906                e = find_object(sha1);
1907                if (!e) {
1908                        enum object_type type = sha1_object_info(sha1, NULL);
1909                        if (type < 0)
1910                                die("object not found: %s", sha1_to_hex(sha1));
1911                        e = insert_object(sha1);
1912                        e->type = type;
1913                        e->pack_id = MAX_PACK_ID;
1914                        e->idx.offset = 1; /* just not zero! */
1915                }
1916                insert_mark(mark, e);
1917        }
1918        fclose(f);
1919done:
1920        import_marks_file_done = 1;
1921}
1922
1923
1924static int read_next_command(void)
1925{
1926        static int stdin_eof = 0;
1927
1928        if (stdin_eof) {
1929                unread_command_buf = 0;
1930                return EOF;
1931        }
1932
1933        for (;;) {
1934                const char *p;
1935
1936                if (unread_command_buf) {
1937                        unread_command_buf = 0;
1938                } else {
1939                        struct recent_command *rc;
1940
1941                        strbuf_detach(&command_buf, NULL);
1942                        stdin_eof = strbuf_getline_lf(&command_buf, stdin);
1943                        if (stdin_eof)
1944                                return EOF;
1945
1946                        if (!seen_data_command
1947                                && !starts_with(command_buf.buf, "feature ")
1948                                && !starts_with(command_buf.buf, "option ")) {
1949                                parse_argv();
1950                        }
1951
1952                        rc = rc_free;
1953                        if (rc)
1954                                rc_free = rc->next;
1955                        else {
1956                                rc = cmd_hist.next;
1957                                cmd_hist.next = rc->next;
1958                                cmd_hist.next->prev = &cmd_hist;
1959                                free(rc->buf);
1960                        }
1961
1962                        rc->buf = command_buf.buf;
1963                        rc->prev = cmd_tail;
1964                        rc->next = cmd_hist.prev;
1965                        rc->prev->next = rc;
1966                        cmd_tail = rc;
1967                }
1968                if (skip_prefix(command_buf.buf, "get-mark ", &p)) {
1969                        parse_get_mark(p);
1970                        continue;
1971                }
1972                if (skip_prefix(command_buf.buf, "cat-blob ", &p)) {
1973                        parse_cat_blob(p);
1974                        continue;
1975                }
1976                if (command_buf.buf[0] == '#')
1977                        continue;
1978                return 0;
1979        }
1980}
1981
1982static void skip_optional_lf(void)
1983{
1984        int term_char = fgetc(stdin);
1985        if (term_char != '\n' && term_char != EOF)
1986                ungetc(term_char, stdin);
1987}
1988
1989static void parse_mark(void)
1990{
1991        const char *v;
1992        if (skip_prefix(command_buf.buf, "mark :", &v)) {
1993                next_mark = strtoumax(v, NULL, 10);
1994                read_next_command();
1995        }
1996        else
1997                next_mark = 0;
1998}
1999
2000static int parse_data(struct strbuf *sb, uintmax_t limit, uintmax_t *len_res)
2001{
2002        const char *data;
2003        strbuf_reset(sb);
2004
2005        if (!skip_prefix(command_buf.buf, "data ", &data))
2006                die("Expected 'data n' command, found: %s", command_buf.buf);
2007
2008        if (skip_prefix(data, "<<", &data)) {
2009                char *term = xstrdup(data);
2010                size_t term_len = command_buf.len - (data - command_buf.buf);
2011
2012                strbuf_detach(&command_buf, NULL);
2013                for (;;) {
2014                        if (strbuf_getline_lf(&command_buf, stdin) == EOF)
2015                                die("EOF in data (terminator '%s' not found)", term);
2016                        if (term_len == command_buf.len
2017                                && !strcmp(term, command_buf.buf))
2018                                break;
2019                        strbuf_addbuf(sb, &command_buf);
2020                        strbuf_addch(sb, '\n');
2021                }
2022                free(term);
2023        }
2024        else {
2025                uintmax_t len = strtoumax(data, NULL, 10);
2026                size_t n = 0, length = (size_t)len;
2027
2028                if (limit && limit < len) {
2029                        *len_res = len;
2030                        return 0;
2031                }
2032                if (length < len)
2033                        die("data is too large to use in this context");
2034
2035                while (n < length) {
2036                        size_t s = strbuf_fread(sb, length - n, stdin);
2037                        if (!s && feof(stdin))
2038                                die("EOF in data (%lu bytes remaining)",
2039                                        (unsigned long)(length - n));
2040                        n += s;
2041                }
2042        }
2043
2044        skip_optional_lf();
2045        return 1;
2046}
2047
2048static int validate_raw_date(const char *src, struct strbuf *result)
2049{
2050        const char *orig_src = src;
2051        char *endp;
2052        unsigned long num;
2053
2054        errno = 0;
2055
2056        num = strtoul(src, &endp, 10);
2057        /* NEEDSWORK: perhaps check for reasonable values? */
2058        if (errno || endp == src || *endp != ' ')
2059                return -1;
2060
2061        src = endp + 1;
2062        if (*src != '-' && *src != '+')
2063                return -1;
2064
2065        num = strtoul(src + 1, &endp, 10);
2066        if (errno || endp == src + 1 || *endp || 1400 < num)
2067                return -1;
2068
2069        strbuf_addstr(result, orig_src);
2070        return 0;
2071}
2072
2073static char *parse_ident(const char *buf)
2074{
2075        const char *ltgt;
2076        size_t name_len;
2077        struct strbuf ident = STRBUF_INIT;
2078
2079        /* ensure there is a space delimiter even if there is no name */
2080        if (*buf == '<')
2081                --buf;
2082
2083        ltgt = buf + strcspn(buf, "<>");
2084        if (*ltgt != '<')
2085                die("Missing < in ident string: %s", buf);
2086        if (ltgt != buf && ltgt[-1] != ' ')
2087                die("Missing space before < in ident string: %s", buf);
2088        ltgt = ltgt + 1 + strcspn(ltgt + 1, "<>");
2089        if (*ltgt != '>')
2090                die("Missing > in ident string: %s", buf);
2091        ltgt++;
2092        if (*ltgt != ' ')
2093                die("Missing space after > in ident string: %s", buf);
2094        ltgt++;
2095        name_len = ltgt - buf;
2096        strbuf_add(&ident, buf, name_len);
2097
2098        switch (whenspec) {
2099        case WHENSPEC_RAW:
2100                if (validate_raw_date(ltgt, &ident) < 0)
2101                        die("Invalid raw date \"%s\" in ident: %s", ltgt, buf);
2102                break;
2103        case WHENSPEC_RFC2822:
2104                if (parse_date(ltgt, &ident) < 0)
2105                        die("Invalid rfc2822 date \"%s\" in ident: %s", ltgt, buf);
2106                break;
2107        case WHENSPEC_NOW:
2108                if (strcmp("now", ltgt))
2109                        die("Date in ident must be 'now': %s", buf);
2110                datestamp(&ident);
2111                break;
2112        }
2113
2114        return strbuf_detach(&ident, NULL);
2115}
2116
2117static void parse_and_store_blob(
2118        struct last_object *last,
2119        unsigned char *sha1out,
2120        uintmax_t mark)
2121{
2122        static struct strbuf buf = STRBUF_INIT;
2123        uintmax_t len;
2124
2125        if (parse_data(&buf, big_file_threshold, &len))
2126                store_object(OBJ_BLOB, &buf, last, sha1out, mark);
2127        else {
2128                if (last) {
2129                        strbuf_release(&last->data);
2130                        last->offset = 0;
2131                        last->depth = 0;
2132                }
2133                stream_blob(len, sha1out, mark);
2134                skip_optional_lf();
2135        }
2136}
2137
2138static void parse_new_blob(void)
2139{
2140        read_next_command();
2141        parse_mark();
2142        parse_and_store_blob(&last_blob, NULL, next_mark);
2143}
2144
2145static void unload_one_branch(void)
2146{
2147        while (cur_active_branches
2148                && cur_active_branches >= max_active_branches) {
2149                uintmax_t min_commit = ULONG_MAX;
2150                struct branch *e, *l = NULL, *p = NULL;
2151
2152                for (e = active_branches; e; e = e->active_next_branch) {
2153                        if (e->last_commit < min_commit) {
2154                                p = l;
2155                                min_commit = e->last_commit;
2156                        }
2157                        l = e;
2158                }
2159
2160                if (p) {
2161                        e = p->active_next_branch;
2162                        p->active_next_branch = e->active_next_branch;
2163                } else {
2164                        e = active_branches;
2165                        active_branches = e->active_next_branch;
2166                }
2167                e->active = 0;
2168                e->active_next_branch = NULL;
2169                if (e->branch_tree.tree) {
2170                        release_tree_content_recursive(e->branch_tree.tree);
2171                        e->branch_tree.tree = NULL;
2172                }
2173                cur_active_branches--;
2174        }
2175}
2176
2177static void load_branch(struct branch *b)
2178{
2179        load_tree(&b->branch_tree);
2180        if (!b->active) {
2181                b->active = 1;
2182                b->active_next_branch = active_branches;
2183                active_branches = b;
2184                cur_active_branches++;
2185                branch_load_count++;
2186        }
2187}
2188
2189static unsigned char convert_num_notes_to_fanout(uintmax_t num_notes)
2190{
2191        unsigned char fanout = 0;
2192        while ((num_notes >>= 8))
2193                fanout++;
2194        return fanout;
2195}
2196
2197static void construct_path_with_fanout(const char *hex_sha1,
2198                unsigned char fanout, char *path)
2199{
2200        unsigned int i = 0, j = 0;
2201        if (fanout >= 20)
2202                die("Too large fanout (%u)", fanout);
2203        while (fanout) {
2204                path[i++] = hex_sha1[j++];
2205                path[i++] = hex_sha1[j++];
2206                path[i++] = '/';
2207                fanout--;
2208        }
2209        memcpy(path + i, hex_sha1 + j, 40 - j);
2210        path[i + 40 - j] = '\0';
2211}
2212
2213static uintmax_t do_change_note_fanout(
2214                struct tree_entry *orig_root, struct tree_entry *root,
2215                char *hex_sha1, unsigned int hex_sha1_len,
2216                char *fullpath, unsigned int fullpath_len,
2217                unsigned char fanout)
2218{
2219        struct tree_content *t;
2220        struct tree_entry *e, leaf;
2221        unsigned int i, tmp_hex_sha1_len, tmp_fullpath_len;
2222        uintmax_t num_notes = 0;
2223        unsigned char sha1[20];
2224        char realpath[60];
2225
2226        if (!root->tree)
2227                load_tree(root);
2228        t = root->tree;
2229
2230        for (i = 0; t && i < t->entry_count; i++) {
2231                e = t->entries[i];
2232                tmp_hex_sha1_len = hex_sha1_len + e->name->str_len;
2233                tmp_fullpath_len = fullpath_len;
2234
2235                /*
2236                 * We're interested in EITHER existing note entries (entries
2237                 * with exactly 40 hex chars in path, not including directory
2238                 * separators), OR directory entries that may contain note
2239                 * entries (with < 40 hex chars in path).
2240                 * Also, each path component in a note entry must be a multiple
2241                 * of 2 chars.
2242                 */
2243                if (!e->versions[1].mode ||
2244                    tmp_hex_sha1_len > 40 ||
2245                    e->name->str_len % 2)
2246                        continue;
2247
2248                /* This _may_ be a note entry, or a subdir containing notes */
2249                memcpy(hex_sha1 + hex_sha1_len, e->name->str_dat,
2250                       e->name->str_len);
2251                if (tmp_fullpath_len)
2252                        fullpath[tmp_fullpath_len++] = '/';
2253                memcpy(fullpath + tmp_fullpath_len, e->name->str_dat,
2254                       e->name->str_len);
2255                tmp_fullpath_len += e->name->str_len;
2256                fullpath[tmp_fullpath_len] = '\0';
2257
2258                if (tmp_hex_sha1_len == 40 && !get_sha1_hex(hex_sha1, sha1)) {
2259                        /* This is a note entry */
2260                        if (fanout == 0xff) {
2261                                /* Counting mode, no rename */
2262                                num_notes++;
2263                                continue;
2264                        }
2265                        construct_path_with_fanout(hex_sha1, fanout, realpath);
2266                        if (!strcmp(fullpath, realpath)) {
2267                                /* Note entry is in correct location */
2268                                num_notes++;
2269                                continue;
2270                        }
2271
2272                        /* Rename fullpath to realpath */
2273                        if (!tree_content_remove(orig_root, fullpath, &leaf, 0))
2274                                die("Failed to remove path %s", fullpath);
2275                        tree_content_set(orig_root, realpath,
2276                                leaf.versions[1].sha1,
2277                                leaf.versions[1].mode,
2278                                leaf.tree);
2279                } else if (S_ISDIR(e->versions[1].mode)) {
2280                        /* This is a subdir that may contain note entries */
2281                        num_notes += do_change_note_fanout(orig_root, e,
2282                                hex_sha1, tmp_hex_sha1_len,
2283                                fullpath, tmp_fullpath_len, fanout);
2284                }
2285
2286                /* The above may have reallocated the current tree_content */
2287                t = root->tree;
2288        }
2289        return num_notes;
2290}
2291
2292static uintmax_t change_note_fanout(struct tree_entry *root,
2293                unsigned char fanout)
2294{
2295        char hex_sha1[40], path[60];
2296        return do_change_note_fanout(root, root, hex_sha1, 0, path, 0, fanout);
2297}
2298
2299/*
2300 * Given a pointer into a string, parse a mark reference:
2301 *
2302 *   idnum ::= ':' bigint;
2303 *
2304 * Return the first character after the value in *endptr.
2305 *
2306 * Complain if the following character is not what is expected,
2307 * either a space or end of the string.
2308 */
2309static uintmax_t parse_mark_ref(const char *p, char **endptr)
2310{
2311        uintmax_t mark;
2312
2313        assert(*p == ':');
2314        p++;
2315        mark = strtoumax(p, endptr, 10);
2316        if (*endptr == p)
2317                die("No value after ':' in mark: %s", command_buf.buf);
2318        return mark;
2319}
2320
2321/*
2322 * Parse the mark reference, and complain if this is not the end of
2323 * the string.
2324 */
2325static uintmax_t parse_mark_ref_eol(const char *p)
2326{
2327        char *end;
2328        uintmax_t mark;
2329
2330        mark = parse_mark_ref(p, &end);
2331        if (*end != '\0')
2332                die("Garbage after mark: %s", command_buf.buf);
2333        return mark;
2334}
2335
2336/*
2337 * Parse the mark reference, demanding a trailing space.  Return a
2338 * pointer to the space.
2339 */
2340static uintmax_t parse_mark_ref_space(const char **p)
2341{
2342        uintmax_t mark;
2343        char *end;
2344
2345        mark = parse_mark_ref(*p, &end);
2346        if (*end++ != ' ')
2347                die("Missing space after mark: %s", command_buf.buf);
2348        *p = end;
2349        return mark;
2350}
2351
2352static void file_change_m(const char *p, struct branch *b)
2353{
2354        static struct strbuf uq = STRBUF_INIT;
2355        const char *endp;
2356        struct object_entry *oe;
2357        unsigned char sha1[20];
2358        uint16_t mode, inline_data = 0;
2359
2360        p = get_mode(p, &mode);
2361        if (!p)
2362                die("Corrupt mode: %s", command_buf.buf);
2363        switch (mode) {
2364        case 0644:
2365        case 0755:
2366                mode |= S_IFREG;
2367        case S_IFREG | 0644:
2368        case S_IFREG | 0755:
2369        case S_IFLNK:
2370        case S_IFDIR:
2371        case S_IFGITLINK:
2372                /* ok */
2373                break;
2374        default:
2375                die("Corrupt mode: %s", command_buf.buf);
2376        }
2377
2378        if (*p == ':') {
2379                oe = find_mark(parse_mark_ref_space(&p));
2380                hashcpy(sha1, oe->idx.sha1);
2381        } else if (skip_prefix(p, "inline ", &p)) {
2382                inline_data = 1;
2383                oe = NULL; /* not used with inline_data, but makes gcc happy */
2384        } else {
2385                if (get_sha1_hex(p, sha1))
2386                        die("Invalid dataref: %s", command_buf.buf);
2387                oe = find_object(sha1);
2388                p += 40;
2389                if (*p++ != ' ')
2390                        die("Missing space after SHA1: %s", command_buf.buf);
2391        }
2392
2393        strbuf_reset(&uq);
2394        if (!unquote_c_style(&uq, p, &endp)) {
2395                if (*endp)
2396                        die("Garbage after path in: %s", command_buf.buf);
2397                p = uq.buf;
2398        }
2399
2400        /* Git does not track empty, non-toplevel directories. */
2401        if (S_ISDIR(mode) && !hashcmp(sha1, EMPTY_TREE_SHA1_BIN) && *p) {
2402                tree_content_remove(&b->branch_tree, p, NULL, 0);
2403                return;
2404        }
2405
2406        if (S_ISGITLINK(mode)) {
2407                if (inline_data)
2408                        die("Git links cannot be specified 'inline': %s",
2409                                command_buf.buf);
2410                else if (oe) {
2411                        if (oe->type != OBJ_COMMIT)
2412                                die("Not a commit (actually a %s): %s",
2413                                        typename(oe->type), command_buf.buf);
2414                }
2415                /*
2416                 * Accept the sha1 without checking; it expected to be in
2417                 * another repository.
2418                 */
2419        } else if (inline_data) {
2420                if (S_ISDIR(mode))
2421                        die("Directories cannot be specified 'inline': %s",
2422                                command_buf.buf);
2423                if (p != uq.buf) {
2424                        strbuf_addstr(&uq, p);
2425                        p = uq.buf;
2426                }
2427                read_next_command();
2428                parse_and_store_blob(&last_blob, sha1, 0);
2429        } else {
2430                enum object_type expected = S_ISDIR(mode) ?
2431                                                OBJ_TREE: OBJ_BLOB;
2432                enum object_type type = oe ? oe->type :
2433                                        sha1_object_info(sha1, NULL);
2434                if (type < 0)
2435                        die("%s not found: %s",
2436                                        S_ISDIR(mode) ?  "Tree" : "Blob",
2437                                        command_buf.buf);
2438                if (type != expected)
2439                        die("Not a %s (actually a %s): %s",
2440                                typename(expected), typename(type),
2441                                command_buf.buf);
2442        }
2443
2444        if (!*p) {
2445                tree_content_replace(&b->branch_tree, sha1, mode, NULL);
2446                return;
2447        }
2448        tree_content_set(&b->branch_tree, p, sha1, mode, NULL);
2449}
2450
2451static void file_change_d(const char *p, struct branch *b)
2452{
2453        static struct strbuf uq = STRBUF_INIT;
2454        const char *endp;
2455
2456        strbuf_reset(&uq);
2457        if (!unquote_c_style(&uq, p, &endp)) {
2458                if (*endp)
2459                        die("Garbage after path in: %s", command_buf.buf);
2460                p = uq.buf;
2461        }
2462        tree_content_remove(&b->branch_tree, p, NULL, 1);
2463}
2464
2465static void file_change_cr(const char *s, struct branch *b, int rename)
2466{
2467        const char *d;
2468        static struct strbuf s_uq = STRBUF_INIT;
2469        static struct strbuf d_uq = STRBUF_INIT;
2470        const char *endp;
2471        struct tree_entry leaf;
2472
2473        strbuf_reset(&s_uq);
2474        if (!unquote_c_style(&s_uq, s, &endp)) {
2475                if (*endp != ' ')
2476                        die("Missing space after source: %s", command_buf.buf);
2477        } else {
2478                endp = strchr(s, ' ');
2479                if (!endp)
2480                        die("Missing space after source: %s", command_buf.buf);
2481                strbuf_add(&s_uq, s, endp - s);
2482        }
2483        s = s_uq.buf;
2484
2485        endp++;
2486        if (!*endp)
2487                die("Missing dest: %s", command_buf.buf);
2488
2489        d = endp;
2490        strbuf_reset(&d_uq);
2491        if (!unquote_c_style(&d_uq, d, &endp)) {
2492                if (*endp)
2493                        die("Garbage after dest in: %s", command_buf.buf);
2494                d = d_uq.buf;
2495        }
2496
2497        memset(&leaf, 0, sizeof(leaf));
2498        if (rename)
2499                tree_content_remove(&b->branch_tree, s, &leaf, 1);
2500        else
2501                tree_content_get(&b->branch_tree, s, &leaf, 1);
2502        if (!leaf.versions[1].mode)
2503                die("Path %s not in branch", s);
2504        if (!*d) {      /* C "path/to/subdir" "" */
2505                tree_content_replace(&b->branch_tree,
2506                        leaf.versions[1].sha1,
2507                        leaf.versions[1].mode,
2508                        leaf.tree);
2509                return;
2510        }
2511        tree_content_set(&b->branch_tree, d,
2512                leaf.versions[1].sha1,
2513                leaf.versions[1].mode,
2514                leaf.tree);
2515}
2516
2517static void note_change_n(const char *p, struct branch *b, unsigned char *old_fanout)
2518{
2519        static struct strbuf uq = STRBUF_INIT;
2520        struct object_entry *oe;
2521        struct branch *s;
2522        unsigned char sha1[20], commit_sha1[20];
2523        char path[60];
2524        uint16_t inline_data = 0;
2525        unsigned char new_fanout;
2526
2527        /*
2528         * When loading a branch, we don't traverse its tree to count the real
2529         * number of notes (too expensive to do this for all non-note refs).
2530         * This means that recently loaded notes refs might incorrectly have
2531         * b->num_notes == 0, and consequently, old_fanout might be wrong.
2532         *
2533         * Fix this by traversing the tree and counting the number of notes
2534         * when b->num_notes == 0. If the notes tree is truly empty, the
2535         * calculation should not take long.
2536         */
2537        if (b->num_notes == 0 && *old_fanout == 0) {
2538                /* Invoke change_note_fanout() in "counting mode". */
2539                b->num_notes = change_note_fanout(&b->branch_tree, 0xff);
2540                *old_fanout = convert_num_notes_to_fanout(b->num_notes);
2541        }
2542
2543        /* Now parse the notemodify command. */
2544        /* <dataref> or 'inline' */
2545        if (*p == ':') {
2546                oe = find_mark(parse_mark_ref_space(&p));
2547                hashcpy(sha1, oe->idx.sha1);
2548        } else if (skip_prefix(p, "inline ", &p)) {
2549                inline_data = 1;
2550                oe = NULL; /* not used with inline_data, but makes gcc happy */
2551        } else {
2552                if (get_sha1_hex(p, sha1))
2553                        die("Invalid dataref: %s", command_buf.buf);
2554                oe = find_object(sha1);
2555                p += 40;
2556                if (*p++ != ' ')
2557                        die("Missing space after SHA1: %s", command_buf.buf);
2558        }
2559
2560        /* <commit-ish> */
2561        s = lookup_branch(p);
2562        if (s) {
2563                if (is_null_sha1(s->sha1))
2564                        die("Can't add a note on empty branch.");
2565                hashcpy(commit_sha1, s->sha1);
2566        } else if (*p == ':') {
2567                uintmax_t commit_mark = parse_mark_ref_eol(p);
2568                struct object_entry *commit_oe = find_mark(commit_mark);
2569                if (commit_oe->type != OBJ_COMMIT)
2570                        die("Mark :%" PRIuMAX " not a commit", commit_mark);
2571                hashcpy(commit_sha1, commit_oe->idx.sha1);
2572        } else if (!get_sha1(p, commit_sha1)) {
2573                unsigned long size;
2574                char *buf = read_object_with_reference(commit_sha1,
2575                        commit_type, &size, commit_sha1);
2576                if (!buf || size < 46)
2577                        die("Not a valid commit: %s", p);
2578                free(buf);
2579        } else
2580                die("Invalid ref name or SHA1 expression: %s", p);
2581
2582        if (inline_data) {
2583                if (p != uq.buf) {
2584                        strbuf_addstr(&uq, p);
2585                        p = uq.buf;
2586                }
2587                read_next_command();
2588                parse_and_store_blob(&last_blob, sha1, 0);
2589        } else if (oe) {
2590                if (oe->type != OBJ_BLOB)
2591                        die("Not a blob (actually a %s): %s",
2592                                typename(oe->type), command_buf.buf);
2593        } else if (!is_null_sha1(sha1)) {
2594                enum object_type type = sha1_object_info(sha1, NULL);
2595                if (type < 0)
2596                        die("Blob not found: %s", command_buf.buf);
2597                if (type != OBJ_BLOB)
2598                        die("Not a blob (actually a %s): %s",
2599                            typename(type), command_buf.buf);
2600        }
2601
2602        construct_path_with_fanout(sha1_to_hex(commit_sha1), *old_fanout, path);
2603        if (tree_content_remove(&b->branch_tree, path, NULL, 0))
2604                b->num_notes--;
2605
2606        if (is_null_sha1(sha1))
2607                return; /* nothing to insert */
2608
2609        b->num_notes++;
2610        new_fanout = convert_num_notes_to_fanout(b->num_notes);
2611        construct_path_with_fanout(sha1_to_hex(commit_sha1), new_fanout, path);
2612        tree_content_set(&b->branch_tree, path, sha1, S_IFREG | 0644, NULL);
2613}
2614
2615static void file_change_deleteall(struct branch *b)
2616{
2617        release_tree_content_recursive(b->branch_tree.tree);
2618        hashclr(b->branch_tree.versions[0].sha1);
2619        hashclr(b->branch_tree.versions[1].sha1);
2620        load_tree(&b->branch_tree);
2621        b->num_notes = 0;
2622}
2623
2624static void parse_from_commit(struct branch *b, char *buf, unsigned long size)
2625{
2626        if (!buf || size < 46)
2627                die("Not a valid commit: %s", sha1_to_hex(b->sha1));
2628        if (memcmp("tree ", buf, 5)
2629                || get_sha1_hex(buf + 5, b->branch_tree.versions[1].sha1))
2630                die("The commit %s is corrupt", sha1_to_hex(b->sha1));
2631        hashcpy(b->branch_tree.versions[0].sha1,
2632                b->branch_tree.versions[1].sha1);
2633}
2634
2635static void parse_from_existing(struct branch *b)
2636{
2637        if (is_null_sha1(b->sha1)) {
2638                hashclr(b->branch_tree.versions[0].sha1);
2639                hashclr(b->branch_tree.versions[1].sha1);
2640        } else {
2641                unsigned long size;
2642                char *buf;
2643
2644                buf = read_object_with_reference(b->sha1,
2645                        commit_type, &size, b->sha1);
2646                parse_from_commit(b, buf, size);
2647                free(buf);
2648        }
2649}
2650
2651static int parse_from(struct branch *b)
2652{
2653        const char *from;
2654        struct branch *s;
2655        unsigned char sha1[20];
2656
2657        if (!skip_prefix(command_buf.buf, "from ", &from))
2658                return 0;
2659
2660        hashcpy(sha1, b->branch_tree.versions[1].sha1);
2661
2662        s = lookup_branch(from);
2663        if (b == s)
2664                die("Can't create a branch from itself: %s", b->name);
2665        else if (s) {
2666                unsigned char *t = s->branch_tree.versions[1].sha1;
2667                hashcpy(b->sha1, s->sha1);
2668                hashcpy(b->branch_tree.versions[0].sha1, t);
2669                hashcpy(b->branch_tree.versions[1].sha1, t);
2670        } else if (*from == ':') {
2671                uintmax_t idnum = parse_mark_ref_eol(from);
2672                struct object_entry *oe = find_mark(idnum);
2673                if (oe->type != OBJ_COMMIT)
2674                        die("Mark :%" PRIuMAX " not a commit", idnum);
2675                if (hashcmp(b->sha1, oe->idx.sha1)) {
2676                        hashcpy(b->sha1, oe->idx.sha1);
2677                        if (oe->pack_id != MAX_PACK_ID) {
2678                                unsigned long size;
2679                                char *buf = gfi_unpack_entry(oe, &size);
2680                                parse_from_commit(b, buf, size);
2681                                free(buf);
2682                        } else
2683                                parse_from_existing(b);
2684                }
2685        } else if (!get_sha1(from, b->sha1)) {
2686                parse_from_existing(b);
2687                if (is_null_sha1(b->sha1))
2688                        b->delete = 1;
2689        }
2690        else
2691                die("Invalid ref name or SHA1 expression: %s", from);
2692
2693        if (b->branch_tree.tree && hashcmp(sha1, b->branch_tree.versions[1].sha1)) {
2694                release_tree_content_recursive(b->branch_tree.tree);
2695                b->branch_tree.tree = NULL;
2696        }
2697
2698        read_next_command();
2699        return 1;
2700}
2701
2702static struct hash_list *parse_merge(unsigned int *count)
2703{
2704        struct hash_list *list = NULL, **tail = &list, *n;
2705        const char *from;
2706        struct branch *s;
2707
2708        *count = 0;
2709        while (skip_prefix(command_buf.buf, "merge ", &from)) {
2710                n = xmalloc(sizeof(*n));
2711                s = lookup_branch(from);
2712                if (s)
2713                        hashcpy(n->sha1, s->sha1);
2714                else if (*from == ':') {
2715                        uintmax_t idnum = parse_mark_ref_eol(from);
2716                        struct object_entry *oe = find_mark(idnum);
2717                        if (oe->type != OBJ_COMMIT)
2718                                die("Mark :%" PRIuMAX " not a commit", idnum);
2719                        hashcpy(n->sha1, oe->idx.sha1);
2720                } else if (!get_sha1(from, n->sha1)) {
2721                        unsigned long size;
2722                        char *buf = read_object_with_reference(n->sha1,
2723                                commit_type, &size, n->sha1);
2724                        if (!buf || size < 46)
2725                                die("Not a valid commit: %s", from);
2726                        free(buf);
2727                } else
2728                        die("Invalid ref name or SHA1 expression: %s", from);
2729
2730                n->next = NULL;
2731                *tail = n;
2732                tail = &n->next;
2733
2734                (*count)++;
2735                read_next_command();
2736        }
2737        return list;
2738}
2739
2740static void parse_new_commit(const char *arg)
2741{
2742        static struct strbuf msg = STRBUF_INIT;
2743        struct branch *b;
2744        char *author = NULL;
2745        char *committer = NULL;
2746        struct hash_list *merge_list = NULL;
2747        unsigned int merge_count;
2748        unsigned char prev_fanout, new_fanout;
2749        const char *v;
2750
2751        b = lookup_branch(arg);
2752        if (!b)
2753                b = new_branch(arg);
2754
2755        read_next_command();
2756        parse_mark();
2757        if (skip_prefix(command_buf.buf, "author ", &v)) {
2758                author = parse_ident(v);
2759                read_next_command();
2760        }
2761        if (skip_prefix(command_buf.buf, "committer ", &v)) {
2762                committer = parse_ident(v);
2763                read_next_command();
2764        }
2765        if (!committer)
2766                die("Expected committer but didn't get one");
2767        parse_data(&msg, 0, NULL);
2768        read_next_command();
2769        parse_from(b);
2770        merge_list = parse_merge(&merge_count);
2771
2772        /* ensure the branch is active/loaded */
2773        if (!b->branch_tree.tree || !max_active_branches) {
2774                unload_one_branch();
2775                load_branch(b);
2776        }
2777
2778        prev_fanout = convert_num_notes_to_fanout(b->num_notes);
2779
2780        /* file_change* */
2781        while (command_buf.len > 0) {
2782                if (skip_prefix(command_buf.buf, "M ", &v))
2783                        file_change_m(v, b);
2784                else if (skip_prefix(command_buf.buf, "D ", &v))
2785                        file_change_d(v, b);
2786                else if (skip_prefix(command_buf.buf, "R ", &v))
2787                        file_change_cr(v, b, 1);
2788                else if (skip_prefix(command_buf.buf, "C ", &v))
2789                        file_change_cr(v, b, 0);
2790                else if (skip_prefix(command_buf.buf, "N ", &v))
2791                        note_change_n(v, b, &prev_fanout);
2792                else if (!strcmp("deleteall", command_buf.buf))
2793                        file_change_deleteall(b);
2794                else if (skip_prefix(command_buf.buf, "ls ", &v))
2795                        parse_ls(v, b);
2796                else {
2797                        unread_command_buf = 1;
2798                        break;
2799                }
2800                if (read_next_command() == EOF)
2801                        break;
2802        }
2803
2804        new_fanout = convert_num_notes_to_fanout(b->num_notes);
2805        if (new_fanout != prev_fanout)
2806                b->num_notes = change_note_fanout(&b->branch_tree, new_fanout);
2807
2808        /* build the tree and the commit */
2809        store_tree(&b->branch_tree);
2810        hashcpy(b->branch_tree.versions[0].sha1,
2811                b->branch_tree.versions[1].sha1);
2812
2813        strbuf_reset(&new_data);
2814        strbuf_addf(&new_data, "tree %s\n",
2815                sha1_to_hex(b->branch_tree.versions[1].sha1));
2816        if (!is_null_sha1(b->sha1))
2817                strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(b->sha1));
2818        while (merge_list) {
2819                struct hash_list *next = merge_list->next;
2820                strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(merge_list->sha1));
2821                free(merge_list);
2822                merge_list = next;
2823        }
2824        strbuf_addf(&new_data,
2825                "author %s\n"
2826                "committer %s\n"
2827                "\n",
2828                author ? author : committer, committer);
2829        strbuf_addbuf(&new_data, &msg);
2830        free(author);
2831        free(committer);
2832
2833        if (!store_object(OBJ_COMMIT, &new_data, NULL, b->sha1, next_mark))
2834                b->pack_id = pack_id;
2835        b->last_commit = object_count_by_type[OBJ_COMMIT];
2836}
2837
2838static void parse_new_tag(const char *arg)
2839{
2840        static struct strbuf msg = STRBUF_INIT;
2841        const char *from;
2842        char *tagger;
2843        struct branch *s;
2844        struct tag *t;
2845        uintmax_t from_mark = 0;
2846        unsigned char sha1[20];
2847        enum object_type type;
2848        const char *v;
2849
2850        t = pool_alloc(sizeof(struct tag));
2851        memset(t, 0, sizeof(struct tag));
2852        t->name = pool_strdup(arg);
2853        if (last_tag)
2854                last_tag->next_tag = t;
2855        else
2856                first_tag = t;
2857        last_tag = t;
2858        read_next_command();
2859
2860        /* from ... */
2861        if (!skip_prefix(command_buf.buf, "from ", &from))
2862                die("Expected from command, got %s", command_buf.buf);
2863        s = lookup_branch(from);
2864        if (s) {
2865                if (is_null_sha1(s->sha1))
2866                        die("Can't tag an empty branch.");
2867                hashcpy(sha1, s->sha1);
2868                type = OBJ_COMMIT;
2869        } else if (*from == ':') {
2870                struct object_entry *oe;
2871                from_mark = parse_mark_ref_eol(from);
2872                oe = find_mark(from_mark);
2873                type = oe->type;
2874                hashcpy(sha1, oe->idx.sha1);
2875        } else if (!get_sha1(from, sha1)) {
2876                struct object_entry *oe = find_object(sha1);
2877                if (!oe) {
2878                        type = sha1_object_info(sha1, NULL);
2879                        if (type < 0)
2880                                die("Not a valid object: %s", from);
2881                } else
2882                        type = oe->type;
2883        } else
2884                die("Invalid ref name or SHA1 expression: %s", from);
2885        read_next_command();
2886
2887        /* tagger ... */
2888        if (skip_prefix(command_buf.buf, "tagger ", &v)) {
2889                tagger = parse_ident(v);
2890                read_next_command();
2891        } else
2892                tagger = NULL;
2893
2894        /* tag payload/message */
2895        parse_data(&msg, 0, NULL);
2896
2897        /* build the tag object */
2898        strbuf_reset(&new_data);
2899
2900        strbuf_addf(&new_data,
2901                    "object %s\n"
2902                    "type %s\n"
2903                    "tag %s\n",
2904                    sha1_to_hex(sha1), typename(type), t->name);
2905        if (tagger)
2906                strbuf_addf(&new_data,
2907                            "tagger %s\n", tagger);
2908        strbuf_addch(&new_data, '\n');
2909        strbuf_addbuf(&new_data, &msg);
2910        free(tagger);
2911
2912        if (store_object(OBJ_TAG, &new_data, NULL, t->sha1, 0))
2913                t->pack_id = MAX_PACK_ID;
2914        else
2915                t->pack_id = pack_id;
2916}
2917
2918static void parse_reset_branch(const char *arg)
2919{
2920        struct branch *b;
2921
2922        b = lookup_branch(arg);
2923        if (b) {
2924                hashclr(b->sha1);
2925                hashclr(b->branch_tree.versions[0].sha1);
2926                hashclr(b->branch_tree.versions[1].sha1);
2927                if (b->branch_tree.tree) {
2928                        release_tree_content_recursive(b->branch_tree.tree);
2929                        b->branch_tree.tree = NULL;
2930                }
2931        }
2932        else
2933                b = new_branch(arg);
2934        read_next_command();
2935        parse_from(b);
2936        if (command_buf.len > 0)
2937                unread_command_buf = 1;
2938}
2939
2940static void cat_blob_write(const char *buf, unsigned long size)
2941{
2942        if (write_in_full(cat_blob_fd, buf, size) != size)
2943                die_errno("Write to frontend failed");
2944}
2945
2946static void cat_blob(struct object_entry *oe, unsigned char sha1[20])
2947{
2948        struct strbuf line = STRBUF_INIT;
2949        unsigned long size;
2950        enum object_type type = 0;
2951        char *buf;
2952
2953        if (!oe || oe->pack_id == MAX_PACK_ID) {
2954                buf = read_sha1_file(sha1, &type, &size);
2955        } else {
2956                type = oe->type;
2957                buf = gfi_unpack_entry(oe, &size);
2958        }
2959
2960        /*
2961         * Output based on batch_one_object() from cat-file.c.
2962         */
2963        if (type <= 0) {
2964                strbuf_reset(&line);
2965                strbuf_addf(&line, "%s missing\n", sha1_to_hex(sha1));
2966                cat_blob_write(line.buf, line.len);
2967                strbuf_release(&line);
2968                free(buf);
2969                return;
2970        }
2971        if (!buf)
2972                die("Can't read object %s", sha1_to_hex(sha1));
2973        if (type != OBJ_BLOB)
2974                die("Object %s is a %s but a blob was expected.",
2975                    sha1_to_hex(sha1), typename(type));
2976        strbuf_reset(&line);
2977        strbuf_addf(&line, "%s %s %lu\n", sha1_to_hex(sha1),
2978                                                typename(type), size);
2979        cat_blob_write(line.buf, line.len);
2980        strbuf_release(&line);
2981        cat_blob_write(buf, size);
2982        cat_blob_write("\n", 1);
2983        if (oe && oe->pack_id == pack_id) {
2984                last_blob.offset = oe->idx.offset;
2985                strbuf_attach(&last_blob.data, buf, size, size);
2986                last_blob.depth = oe->depth;
2987        } else
2988                free(buf);
2989}
2990
2991static void parse_get_mark(const char *p)
2992{
2993        struct object_entry *oe = oe;
2994        char output[42];
2995
2996        /* get-mark SP <object> LF */
2997        if (*p != ':')
2998                die("Not a mark: %s", p);
2999
3000        oe = find_mark(parse_mark_ref_eol(p));
3001        if (!oe)
3002                die("Unknown mark: %s", command_buf.buf);
3003
3004        xsnprintf(output, sizeof(output), "%s\n", sha1_to_hex(oe->idx.sha1));
3005        cat_blob_write(output, 41);
3006}
3007
3008static void parse_cat_blob(const char *p)
3009{
3010        struct object_entry *oe = oe;
3011        unsigned char sha1[20];
3012
3013        /* cat-blob SP <object> LF */
3014        if (*p == ':') {
3015                oe = find_mark(parse_mark_ref_eol(p));
3016                if (!oe)
3017                        die("Unknown mark: %s", command_buf.buf);
3018                hashcpy(sha1, oe->idx.sha1);
3019        } else {
3020                if (get_sha1_hex(p, sha1))
3021                        die("Invalid dataref: %s", command_buf.buf);
3022                if (p[40])
3023                        die("Garbage after SHA1: %s", command_buf.buf);
3024                oe = find_object(sha1);
3025        }
3026
3027        cat_blob(oe, sha1);
3028}
3029
3030static struct object_entry *dereference(struct object_entry *oe,
3031                                        unsigned char sha1[20])
3032{
3033        unsigned long size;
3034        char *buf = NULL;
3035        if (!oe) {
3036                enum object_type type = sha1_object_info(sha1, NULL);
3037                if (type < 0)
3038                        die("object not found: %s", sha1_to_hex(sha1));
3039                /* cache it! */
3040                oe = insert_object(sha1);
3041                oe->type = type;
3042                oe->pack_id = MAX_PACK_ID;
3043                oe->idx.offset = 1;
3044        }
3045        switch (oe->type) {
3046        case OBJ_TREE:  /* easy case. */
3047                return oe;
3048        case OBJ_COMMIT:
3049        case OBJ_TAG:
3050                break;
3051        default:
3052                die("Not a tree-ish: %s", command_buf.buf);
3053        }
3054
3055        if (oe->pack_id != MAX_PACK_ID) {       /* in a pack being written */
3056                buf = gfi_unpack_entry(oe, &size);
3057        } else {
3058                enum object_type unused;
3059                buf = read_sha1_file(sha1, &unused, &size);
3060        }
3061        if (!buf)
3062                die("Can't load object %s", sha1_to_hex(sha1));
3063
3064        /* Peel one layer. */
3065        switch (oe->type) {
3066        case OBJ_TAG:
3067                if (size < 40 + strlen("object ") ||
3068                    get_sha1_hex(buf + strlen("object "), sha1))
3069                        die("Invalid SHA1 in tag: %s", command_buf.buf);
3070                break;
3071        case OBJ_COMMIT:
3072                if (size < 40 + strlen("tree ") ||
3073                    get_sha1_hex(buf + strlen("tree "), sha1))
3074                        die("Invalid SHA1 in commit: %s", command_buf.buf);
3075        }
3076
3077        free(buf);
3078        return find_object(sha1);
3079}
3080
3081static struct object_entry *parse_treeish_dataref(const char **p)
3082{
3083        unsigned char sha1[20];
3084        struct object_entry *e;
3085
3086        if (**p == ':') {       /* <mark> */
3087                e = find_mark(parse_mark_ref_space(p));
3088                if (!e)
3089                        die("Unknown mark: %s", command_buf.buf);
3090                hashcpy(sha1, e->idx.sha1);
3091        } else {        /* <sha1> */
3092                if (get_sha1_hex(*p, sha1))
3093                        die("Invalid dataref: %s", command_buf.buf);
3094                e = find_object(sha1);
3095                *p += 40;
3096                if (*(*p)++ != ' ')
3097                        die("Missing space after tree-ish: %s", command_buf.buf);
3098        }
3099
3100        while (!e || e->type != OBJ_TREE)
3101                e = dereference(e, sha1);
3102        return e;
3103}
3104
3105static void print_ls(int mode, const unsigned char *sha1, const char *path)
3106{
3107        static struct strbuf line = STRBUF_INIT;
3108
3109        /* See show_tree(). */
3110        const char *type =
3111                S_ISGITLINK(mode) ? commit_type :
3112                S_ISDIR(mode) ? tree_type :
3113                blob_type;
3114
3115        if (!mode) {
3116                /* missing SP path LF */
3117                strbuf_reset(&line);
3118                strbuf_addstr(&line, "missing ");
3119                quote_c_style(path, &line, NULL, 0);
3120                strbuf_addch(&line, '\n');
3121        } else {
3122                /* mode SP type SP object_name TAB path LF */
3123                strbuf_reset(&line);
3124                strbuf_addf(&line, "%06o %s %s\t",
3125                                mode & ~NO_DELTA, type, sha1_to_hex(sha1));
3126                quote_c_style(path, &line, NULL, 0);
3127                strbuf_addch(&line, '\n');
3128        }
3129        cat_blob_write(line.buf, line.len);
3130}
3131
3132static void parse_ls(const char *p, struct branch *b)
3133{
3134        struct tree_entry *root = NULL;
3135        struct tree_entry leaf = {NULL};
3136
3137        /* ls SP (<tree-ish> SP)? <path> */
3138        if (*p == '"') {
3139                if (!b)
3140                        die("Not in a commit: %s", command_buf.buf);
3141                root = &b->branch_tree;
3142        } else {
3143                struct object_entry *e = parse_treeish_dataref(&p);
3144                root = new_tree_entry();
3145                hashcpy(root->versions[1].sha1, e->idx.sha1);
3146                if (!is_null_sha1(root->versions[1].sha1))
3147                        root->versions[1].mode = S_IFDIR;
3148                load_tree(root);
3149        }
3150        if (*p == '"') {
3151                static struct strbuf uq = STRBUF_INIT;
3152                const char *endp;
3153                strbuf_reset(&uq);
3154                if (unquote_c_style(&uq, p, &endp))
3155                        die("Invalid path: %s", command_buf.buf);
3156                if (*endp)
3157                        die("Garbage after path in: %s", command_buf.buf);
3158                p = uq.buf;
3159        }
3160        tree_content_get(root, p, &leaf, 1);
3161        /*
3162         * A directory in preparation would have a sha1 of zero
3163         * until it is saved.  Save, for simplicity.
3164         */
3165        if (S_ISDIR(leaf.versions[1].mode))
3166                store_tree(&leaf);
3167
3168        print_ls(leaf.versions[1].mode, leaf.versions[1].sha1, p);
3169        if (leaf.tree)
3170                release_tree_content_recursive(leaf.tree);
3171        if (!b || root != &b->branch_tree)
3172                release_tree_entry(root);
3173}
3174
3175static void checkpoint(void)
3176{
3177        checkpoint_requested = 0;
3178        if (object_count) {
3179                cycle_packfile();
3180                dump_branches();
3181                dump_tags();
3182                dump_marks();
3183        }
3184}
3185
3186static void parse_checkpoint(void)
3187{
3188        checkpoint_requested = 1;
3189        skip_optional_lf();
3190}
3191
3192static void parse_progress(void)
3193{
3194        fwrite(command_buf.buf, 1, command_buf.len, stdout);
3195        fputc('\n', stdout);
3196        fflush(stdout);
3197        skip_optional_lf();
3198}
3199
3200static char* make_fast_import_path(const char *path)
3201{
3202        if (!relative_marks_paths || is_absolute_path(path))
3203                return xstrdup(path);
3204        return xstrdup(git_path("info/fast-import/%s", path));
3205}
3206
3207static void option_import_marks(const char *marks,
3208                                        int from_stream, int ignore_missing)
3209{
3210        if (import_marks_file) {
3211                if (from_stream)
3212                        die("Only one import-marks command allowed per stream");
3213
3214                /* read previous mark file */
3215                if(!import_marks_file_from_stream)
3216                        read_marks();
3217        }
3218
3219        import_marks_file = make_fast_import_path(marks);
3220        safe_create_leading_directories_const(import_marks_file);
3221        import_marks_file_from_stream = from_stream;
3222        import_marks_file_ignore_missing = ignore_missing;
3223}
3224
3225static void option_date_format(const char *fmt)
3226{
3227        if (!strcmp(fmt, "raw"))
3228                whenspec = WHENSPEC_RAW;
3229        else if (!strcmp(fmt, "rfc2822"))
3230                whenspec = WHENSPEC_RFC2822;
3231        else if (!strcmp(fmt, "now"))
3232                whenspec = WHENSPEC_NOW;
3233        else
3234                die("unknown --date-format argument %s", fmt);
3235}
3236
3237static unsigned long ulong_arg(const char *option, const char *arg)
3238{
3239        char *endptr;
3240        unsigned long rv = strtoul(arg, &endptr, 0);
3241        if (strchr(arg, '-') || endptr == arg || *endptr)
3242                die("%s: argument must be a non-negative integer", option);
3243        return rv;
3244}
3245
3246static void option_depth(const char *depth)
3247{
3248        max_depth = ulong_arg("--depth", depth);
3249        if (max_depth > MAX_DEPTH)
3250                die("--depth cannot exceed %u", MAX_DEPTH);
3251}
3252
3253static void option_active_branches(const char *branches)
3254{
3255        max_active_branches = ulong_arg("--active-branches", branches);
3256}
3257
3258static void option_export_marks(const char *marks)
3259{
3260        export_marks_file = make_fast_import_path(marks);
3261        safe_create_leading_directories_const(export_marks_file);
3262}
3263
3264static void option_cat_blob_fd(const char *fd)
3265{
3266        unsigned long n = ulong_arg("--cat-blob-fd", fd);
3267        if (n > (unsigned long) INT_MAX)
3268                die("--cat-blob-fd cannot exceed %d", INT_MAX);
3269        cat_blob_fd = (int) n;
3270}
3271
3272static void option_export_pack_edges(const char *edges)
3273{
3274        if (pack_edges)
3275                fclose(pack_edges);
3276        pack_edges = fopen(edges, "a");
3277        if (!pack_edges)
3278                die_errno("Cannot open '%s'", edges);
3279}
3280
3281static int parse_one_option(const char *option)
3282{
3283        if (skip_prefix(option, "max-pack-size=", &option)) {
3284                unsigned long v;
3285                if (!git_parse_ulong(option, &v))
3286                        return 0;
3287                if (v < 8192) {
3288                        warning("max-pack-size is now in bytes, assuming --max-pack-size=%lum", v);
3289                        v *= 1024 * 1024;
3290                } else if (v < 1024 * 1024) {
3291                        warning("minimum max-pack-size is 1 MiB");
3292                        v = 1024 * 1024;
3293                }
3294                max_packsize = v;
3295        } else if (skip_prefix(option, "big-file-threshold=", &option)) {
3296                unsigned long v;
3297                if (!git_parse_ulong(option, &v))
3298                        return 0;
3299                big_file_threshold = v;
3300        } else if (skip_prefix(option, "depth=", &option)) {
3301                option_depth(option);
3302        } else if (skip_prefix(option, "active-branches=", &option)) {
3303                option_active_branches(option);
3304        } else if (skip_prefix(option, "export-pack-edges=", &option)) {
3305                option_export_pack_edges(option);
3306        } else if (starts_with(option, "quiet")) {
3307                show_stats = 0;
3308        } else if (starts_with(option, "stats")) {
3309                show_stats = 1;
3310        } else {
3311                return 0;
3312        }
3313
3314        return 1;
3315}
3316
3317static int parse_one_feature(const char *feature, int from_stream)
3318{
3319        const char *arg;
3320
3321        if (skip_prefix(feature, "date-format=", &arg)) {
3322                option_date_format(arg);
3323        } else if (skip_prefix(feature, "import-marks=", &arg)) {
3324                option_import_marks(arg, from_stream, 0);
3325        } else if (skip_prefix(feature, "import-marks-if-exists=", &arg)) {
3326                option_import_marks(arg, from_stream, 1);
3327        } else if (skip_prefix(feature, "export-marks=", &arg)) {
3328                option_export_marks(arg);
3329        } else if (!strcmp(feature, "get-mark")) {
3330                ; /* Don't die - this feature is supported */
3331        } else if (!strcmp(feature, "cat-blob")) {
3332                ; /* Don't die - this feature is supported */
3333        } else if (!strcmp(feature, "relative-marks")) {
3334                relative_marks_paths = 1;
3335        } else if (!strcmp(feature, "no-relative-marks")) {
3336                relative_marks_paths = 0;
3337        } else if (!strcmp(feature, "done")) {
3338                require_explicit_termination = 1;
3339        } else if (!strcmp(feature, "force")) {
3340                force_update = 1;
3341        } else if (!strcmp(feature, "notes") || !strcmp(feature, "ls")) {
3342                ; /* do nothing; we have the feature */
3343        } else {
3344                return 0;
3345        }
3346
3347        return 1;
3348}
3349
3350static void parse_feature(const char *feature)
3351{
3352        if (seen_data_command)
3353                die("Got feature command '%s' after data command", feature);
3354
3355        if (parse_one_feature(feature, 1))
3356                return;
3357
3358        die("This version of fast-import does not support feature %s.", feature);
3359}
3360
3361static void parse_option(const char *option)
3362{
3363        if (seen_data_command)
3364                die("Got option command '%s' after data command", option);
3365
3366        if (parse_one_option(option))
3367                return;
3368
3369        die("This version of fast-import does not support option: %s", option);
3370}
3371
3372static void git_pack_config(void)
3373{
3374        int indexversion_value;
3375        int limit;
3376        unsigned long packsizelimit_value;
3377
3378        if (!git_config_get_ulong("pack.depth", &max_depth)) {
3379                if (max_depth > MAX_DEPTH)
3380                        max_depth = MAX_DEPTH;
3381        }
3382        if (!git_config_get_int("pack.indexversion", &indexversion_value)) {
3383                pack_idx_opts.version = indexversion_value;
3384                if (pack_idx_opts.version > 2)
3385                        git_die_config("pack.indexversion",
3386                                        "bad pack.indexversion=%"PRIu32, pack_idx_opts.version);
3387        }
3388        if (!git_config_get_ulong("pack.packsizelimit", &packsizelimit_value))
3389                max_packsize = packsizelimit_value;
3390
3391        if (!git_config_get_int("fastimport.unpacklimit", &limit))
3392                unpack_limit = limit;
3393        else if (!git_config_get_int("transfer.unpacklimit", &limit))
3394                unpack_limit = limit;
3395
3396        git_config(git_default_config, NULL);
3397}
3398
3399static const char fast_import_usage[] =
3400"git fast-import [--date-format=<f>] [--max-pack-size=<n>] [--big-file-threshold=<n>] [--depth=<n>] [--active-branches=<n>] [--export-marks=<marks.file>]";
3401
3402static void parse_argv(void)
3403{
3404        unsigned int i;
3405
3406        for (i = 1; i < global_argc; i++) {
3407                const char *a = global_argv[i];
3408
3409                if (*a != '-' || !strcmp(a, "--"))
3410                        break;
3411
3412                if (!skip_prefix(a, "--", &a))
3413                        die("unknown option %s", a);
3414
3415                if (parse_one_option(a))
3416                        continue;
3417
3418                if (parse_one_feature(a, 0))
3419                        continue;
3420
3421                if (skip_prefix(a, "cat-blob-fd=", &a)) {
3422                        option_cat_blob_fd(a);
3423                        continue;
3424                }
3425
3426                die("unknown option --%s", a);
3427        }
3428        if (i != global_argc)
3429                usage(fast_import_usage);
3430
3431        seen_data_command = 1;
3432        if (import_marks_file)
3433                read_marks();
3434}
3435
3436int cmd_main(int argc, const char **argv)
3437{
3438        unsigned int i;
3439
3440        if (argc == 2 && !strcmp(argv[1], "-h"))
3441                usage(fast_import_usage);
3442
3443        setup_git_directory();
3444        reset_pack_idx_option(&pack_idx_opts);
3445        git_pack_config();
3446
3447        alloc_objects(object_entry_alloc);
3448        strbuf_init(&command_buf, 0);
3449        atom_table = xcalloc(atom_table_sz, sizeof(struct atom_str*));
3450        branch_table = xcalloc(branch_table_sz, sizeof(struct branch*));
3451        avail_tree_table = xcalloc(avail_tree_table_sz, sizeof(struct avail_tree_content*));
3452        marks = pool_calloc(1, sizeof(struct mark_set));
3453
3454        global_argc = argc;
3455        global_argv = argv;
3456
3457        rc_free = pool_alloc(cmd_save * sizeof(*rc_free));
3458        for (i = 0; i < (cmd_save - 1); i++)
3459                rc_free[i].next = &rc_free[i + 1];
3460        rc_free[cmd_save - 1].next = NULL;
3461
3462        prepare_packed_git();
3463        start_packfile();
3464        set_die_routine(die_nicely);
3465        set_checkpoint_signal();
3466        while (read_next_command() != EOF) {
3467                const char *v;
3468                if (!strcmp("blob", command_buf.buf))
3469                        parse_new_blob();
3470                else if (skip_prefix(command_buf.buf, "ls ", &v))
3471                        parse_ls(v, NULL);
3472                else if (skip_prefix(command_buf.buf, "commit ", &v))
3473                        parse_new_commit(v);
3474                else if (skip_prefix(command_buf.buf, "tag ", &v))
3475                        parse_new_tag(v);
3476                else if (skip_prefix(command_buf.buf, "reset ", &v))
3477                        parse_reset_branch(v);
3478                else if (!strcmp("checkpoint", command_buf.buf))
3479                        parse_checkpoint();
3480                else if (!strcmp("done", command_buf.buf))
3481                        break;
3482                else if (starts_with(command_buf.buf, "progress "))
3483                        parse_progress();
3484                else if (skip_prefix(command_buf.buf, "feature ", &v))
3485                        parse_feature(v);
3486                else if (skip_prefix(command_buf.buf, "option git ", &v))
3487                        parse_option(v);
3488                else if (starts_with(command_buf.buf, "option "))
3489                        /* ignore non-git options*/;
3490                else
3491                        die("Unsupported command: %s", command_buf.buf);
3492
3493                if (checkpoint_requested)
3494                        checkpoint();
3495        }
3496
3497        /* argv hasn't been parsed yet, do so */
3498        if (!seen_data_command)
3499                parse_argv();
3500
3501        if (require_explicit_termination && feof(stdin))
3502                die("stream ends early");
3503
3504        end_packfile();
3505
3506        dump_branches();
3507        dump_tags();
3508        unkeep_all_packs();
3509        dump_marks();
3510
3511        if (pack_edges)
3512                fclose(pack_edges);
3513
3514        if (show_stats) {
3515                uintmax_t total_count = 0, duplicate_count = 0;
3516                for (i = 0; i < ARRAY_SIZE(object_count_by_type); i++)
3517                        total_count += object_count_by_type[i];
3518                for (i = 0; i < ARRAY_SIZE(duplicate_count_by_type); i++)
3519                        duplicate_count += duplicate_count_by_type[i];
3520
3521                fprintf(stderr, "%s statistics:\n", argv[0]);
3522                fprintf(stderr, "---------------------------------------------------------------------\n");
3523                fprintf(stderr, "Alloc'd objects: %10" PRIuMAX "\n", alloc_count);
3524                fprintf(stderr, "Total objects:   %10" PRIuMAX " (%10" PRIuMAX " duplicates                  )\n", total_count, duplicate_count);
3525                fprintf(stderr, "      blobs  :   %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas of %10" PRIuMAX" attempts)\n", object_count_by_type[OBJ_BLOB], duplicate_count_by_type[OBJ_BLOB], delta_count_by_type[OBJ_BLOB], delta_count_attempts_by_type[OBJ_BLOB]);
3526                fprintf(stderr, "      trees  :   %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas of %10" PRIuMAX" attempts)\n", object_count_by_type[OBJ_TREE], duplicate_count_by_type[OBJ_TREE], delta_count_by_type[OBJ_TREE], delta_count_attempts_by_type[OBJ_TREE]);
3527                fprintf(stderr, "      commits:   %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas of %10" PRIuMAX" attempts)\n", object_count_by_type[OBJ_COMMIT], duplicate_count_by_type[OBJ_COMMIT], delta_count_by_type[OBJ_COMMIT], delta_count_attempts_by_type[OBJ_COMMIT]);
3528                fprintf(stderr, "      tags   :   %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas of %10" PRIuMAX" attempts)\n", object_count_by_type[OBJ_TAG], duplicate_count_by_type[OBJ_TAG], delta_count_by_type[OBJ_TAG], delta_count_attempts_by_type[OBJ_TAG]);
3529                fprintf(stderr, "Total branches:  %10lu (%10lu loads     )\n", branch_count, branch_load_count);
3530                fprintf(stderr, "      marks:     %10" PRIuMAX " (%10" PRIuMAX " unique    )\n", (((uintmax_t)1) << marks->shift) * 1024, marks_set_count);
3531                fprintf(stderr, "      atoms:     %10u\n", atom_cnt);
3532                fprintf(stderr, "Memory total:    %10" PRIuMAX " KiB\n", (total_allocd + alloc_count*sizeof(struct object_entry))/1024);
3533                fprintf(stderr, "       pools:    %10lu KiB\n", (unsigned long)(total_allocd/1024));
3534                fprintf(stderr, "     objects:    %10" PRIuMAX " KiB\n", (alloc_count*sizeof(struct object_entry))/1024);
3535                fprintf(stderr, "---------------------------------------------------------------------\n");
3536                pack_report();
3537                fprintf(stderr, "---------------------------------------------------------------------\n");
3538                fprintf(stderr, "\n");
3539        }
3540
3541        return failure ? 1 : 0;
3542}