criss cross rename failure workaround
[git/dscho.git] / fast-import.c
blobeab68d58c394a67f4805d77b0007b583e79e24b9
1 /*
2 (See Documentation/git-fast-import.txt for maintained documentation.)
3 Format of STDIN stream:
5 stream ::= cmd*;
7 cmd ::= new_blob
8 | new_commit
9 | new_tag
10 | reset_branch
11 | checkpoint
12 | progress
15 new_blob ::= 'blob' lf
16 mark?
17 file_content;
18 file_content ::= data;
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 committish lf)?
26 ('merge' sp committish lf)*
27 file_change*
28 lf?;
29 commit_msg ::= data;
31 file_change ::= file_clr
32 | file_del
33 | file_rnm
34 | file_cpy
35 | file_obm
36 | file_inm;
37 file_clr ::= 'deleteall' lf;
38 file_del ::= 'D' sp path_str lf;
39 file_rnm ::= 'R' sp path_str sp path_str lf;
40 file_cpy ::= 'C' sp path_str sp path_str lf;
41 file_obm ::= 'M' sp mode sp (hexsha1 | idnum) sp path_str lf;
42 file_inm ::= 'M' sp mode sp 'inline' sp path_str lf
43 data;
44 note_obm ::= 'N' sp (hexsha1 | idnum) sp committish lf;
45 note_inm ::= 'N' sp 'inline' sp committish lf
46 data;
48 new_tag ::= 'tag' sp tag_str lf
49 'from' sp committish lf
50 ('tagger' (sp name)? sp '<' email '>' sp when lf)?
51 tag_msg;
52 tag_msg ::= data;
54 reset_branch ::= 'reset' sp ref_str lf
55 ('from' sp committish lf)?
56 lf?;
58 checkpoint ::= 'checkpoint' lf
59 lf?;
61 progress ::= 'progress' sp not_lf* lf
62 lf?;
64 # note: the first idnum in a stream should be 1 and subsequent
65 # idnums should not have gaps between values as this will cause
66 # the stream parser to reserve space for the gapped values. An
67 # idnum can be updated in the future to a new object by issuing
68 # a new mark directive with the old idnum.
70 mark ::= 'mark' sp idnum lf;
71 data ::= (delimited_data | exact_data)
72 lf?;
74 # note: delim may be any string but must not contain lf.
75 # data_line may contain any data but must not be exactly
76 # delim.
77 delimited_data ::= 'data' sp '<<' delim lf
78 (data_line lf)*
79 delim lf;
81 # note: declen indicates the length of binary_data in bytes.
82 # declen does not include the lf preceding the binary data.
84 exact_data ::= 'data' sp declen lf
85 binary_data;
87 # note: quoted strings are C-style quoting supporting \c for
88 # common escapes of 'c' (e..g \n, \t, \\, \") or \nnn where nnn
89 # is the signed byte value in octal. Note that the only
90 # characters which must actually be escaped to protect the
91 # stream formatting is: \, " and LF. Otherwise these values
92 # are UTF8.
94 committish ::= (ref_str | hexsha1 | sha1exp_str | idnum);
95 ref_str ::= ref;
96 sha1exp_str ::= sha1exp;
97 tag_str ::= tag;
98 path_str ::= path | '"' quoted(path) '"' ;
99 mode ::= '100644' | '644'
100 | '100755' | '755'
101 | '120000'
104 declen ::= # unsigned 32 bit value, ascii base10 notation;
105 bigint ::= # unsigned integer value, ascii base10 notation;
106 binary_data ::= # file content, not interpreted;
108 when ::= raw_when | rfc2822_when;
109 raw_when ::= ts sp tz;
110 rfc2822_when ::= # Valid RFC 2822 date and time;
112 sp ::= # ASCII space character;
113 lf ::= # ASCII newline (LF) character;
115 # note: a colon (':') must precede the numerical value assigned to
116 # an idnum. This is to distinguish it from a ref or tag name as
117 # GIT does not permit ':' in ref or tag strings.
119 idnum ::= ':' bigint;
120 path ::= # GIT style file path, e.g. "a/b/c";
121 ref ::= # GIT ref name, e.g. "refs/heads/MOZ_GECKO_EXPERIMENT";
122 tag ::= # GIT tag name, e.g. "FIREFOX_1_5";
123 sha1exp ::= # Any valid GIT SHA1 expression;
124 hexsha1 ::= # SHA1 in hexadecimal format;
126 # note: name and email are UTF8 strings, however name must not
127 # contain '<' or lf and email must not contain any of the
128 # following: '<', '>', lf.
130 name ::= # valid GIT author/committer name;
131 email ::= # valid GIT author/committer email;
132 ts ::= # time since the epoch in seconds, ascii base10 notation;
133 tz ::= # GIT style timezone;
135 # note: comments may appear anywhere in the input, except
136 # within a data command. Any form of the data command
137 # always escapes the related input from comment processing.
139 # In case it is not clear, the '#' that starts the comment
140 # must be the first character on that line (an lf
141 # preceded it).
143 comment ::= '#' not_lf* lf;
144 not_lf ::= # Any byte that is not ASCII newline (LF);
147 #include "builtin.h"
148 #include "cache.h"
149 #include "object.h"
150 #include "blob.h"
151 #include "tree.h"
152 #include "commit.h"
153 #include "delta.h"
154 #include "pack.h"
155 #include "refs.h"
156 #include "csum-file.h"
157 #include "quote.h"
158 #include "exec_cmd.h"
160 #define PACK_ID_BITS 16
161 #define MAX_PACK_ID ((1<<PACK_ID_BITS)-1)
162 #define DEPTH_BITS 13
163 #define MAX_DEPTH ((1<<DEPTH_BITS)-1)
165 struct object_entry
167 struct pack_idx_entry idx;
168 struct object_entry *next;
169 uint32_t type : TYPE_BITS,
170 pack_id : PACK_ID_BITS,
171 depth : DEPTH_BITS;
174 struct object_entry_pool
176 struct object_entry_pool *next_pool;
177 struct object_entry *next_free;
178 struct object_entry *end;
179 struct object_entry entries[FLEX_ARRAY]; /* more */
182 struct mark_set
184 union {
185 struct object_entry *marked[1024];
186 struct mark_set *sets[1024];
187 } data;
188 unsigned int shift;
191 struct last_object
193 struct strbuf data;
194 off_t offset;
195 unsigned int depth;
196 unsigned no_swap : 1;
199 struct mem_pool
201 struct mem_pool *next_pool;
202 char *next_free;
203 char *end;
204 uintmax_t space[FLEX_ARRAY]; /* more */
207 struct atom_str
209 struct atom_str *next_atom;
210 unsigned short str_len;
211 char str_dat[FLEX_ARRAY]; /* more */
214 struct tree_content;
215 struct tree_entry
217 struct tree_content *tree;
218 struct atom_str *name;
219 struct tree_entry_ms
221 uint16_t mode;
222 unsigned char sha1[20];
223 } versions[2];
226 struct tree_content
228 unsigned int entry_capacity; /* must match avail_tree_content */
229 unsigned int entry_count;
230 unsigned int delta_depth;
231 struct tree_entry *entries[FLEX_ARRAY]; /* more */
234 struct avail_tree_content
236 unsigned int entry_capacity; /* must match tree_content */
237 struct avail_tree_content *next_avail;
240 struct branch
242 struct branch *table_next_branch;
243 struct branch *active_next_branch;
244 const char *name;
245 struct tree_entry branch_tree;
246 uintmax_t last_commit;
247 uintmax_t num_notes;
248 unsigned active : 1;
249 unsigned pack_id : PACK_ID_BITS;
250 unsigned char sha1[20];
253 struct tag
255 struct tag *next_tag;
256 const char *name;
257 unsigned int pack_id;
258 unsigned char sha1[20];
261 struct hash_list
263 struct hash_list *next;
264 unsigned char sha1[20];
267 typedef enum {
268 WHENSPEC_RAW = 1,
269 WHENSPEC_RFC2822,
270 WHENSPEC_NOW
271 } whenspec_type;
273 struct recent_command
275 struct recent_command *prev;
276 struct recent_command *next;
277 char *buf;
280 /* Configured limits on output */
281 static unsigned long max_depth = 10;
282 static off_t max_packsize;
283 static uintmax_t big_file_threshold = 512 * 1024 * 1024;
284 static int force_update;
285 static int pack_compression_level = Z_DEFAULT_COMPRESSION;
286 static int pack_compression_seen;
288 /* Stats and misc. counters */
289 static uintmax_t alloc_count;
290 static uintmax_t marks_set_count;
291 static uintmax_t object_count_by_type[1 << TYPE_BITS];
292 static uintmax_t duplicate_count_by_type[1 << TYPE_BITS];
293 static uintmax_t delta_count_by_type[1 << TYPE_BITS];
294 static unsigned long object_count;
295 static unsigned long branch_count;
296 static unsigned long branch_load_count;
297 static int failure;
298 static FILE *pack_edges;
299 static unsigned int show_stats = 1;
300 static int global_argc;
301 static const char **global_argv;
303 /* Memory pools */
304 static size_t mem_pool_alloc = 2*1024*1024 - sizeof(struct mem_pool);
305 static size_t total_allocd;
306 static struct mem_pool *mem_pool;
308 /* Atom management */
309 static unsigned int atom_table_sz = 4451;
310 static unsigned int atom_cnt;
311 static struct atom_str **atom_table;
313 /* The .pack file being generated */
314 static unsigned int pack_id;
315 static struct sha1file *pack_file;
316 static struct packed_git *pack_data;
317 static struct packed_git **all_packs;
318 static off_t pack_size;
320 /* Table of objects we've written. */
321 static unsigned int object_entry_alloc = 5000;
322 static struct object_entry_pool *blocks;
323 static struct object_entry *object_table[1 << 16];
324 static struct mark_set *marks;
325 static const char *export_marks_file;
326 static const char *import_marks_file;
327 static int import_marks_file_from_stream;
328 static int relative_marks_paths;
330 /* Our last blob */
331 static struct last_object last_blob = { STRBUF_INIT, 0, 0, 0 };
333 /* Tree management */
334 static unsigned int tree_entry_alloc = 1000;
335 static void *avail_tree_entry;
336 static unsigned int avail_tree_table_sz = 100;
337 static struct avail_tree_content **avail_tree_table;
338 static struct strbuf old_tree = STRBUF_INIT;
339 static struct strbuf new_tree = STRBUF_INIT;
341 /* Branch data */
342 static unsigned long max_active_branches = 5;
343 static unsigned long cur_active_branches;
344 static unsigned long branch_table_sz = 1039;
345 static struct branch **branch_table;
346 static struct branch *active_branches;
348 /* Tag data */
349 static struct tag *first_tag;
350 static struct tag *last_tag;
352 /* Input stream parsing */
353 static whenspec_type whenspec = WHENSPEC_RAW;
354 static struct strbuf command_buf = STRBUF_INIT;
355 static int unread_command_buf;
356 static struct recent_command cmd_hist = {&cmd_hist, &cmd_hist, NULL};
357 static struct recent_command *cmd_tail = &cmd_hist;
358 static struct recent_command *rc_free;
359 static unsigned int cmd_save = 100;
360 static uintmax_t next_mark;
361 static struct strbuf new_data = STRBUF_INIT;
362 static int seen_data_command;
364 static void parse_argv(void);
366 static void write_branch_report(FILE *rpt, struct branch *b)
368 fprintf(rpt, "%s:\n", b->name);
370 fprintf(rpt, " status :");
371 if (b->active)
372 fputs(" active", rpt);
373 if (b->branch_tree.tree)
374 fputs(" loaded", rpt);
375 if (is_null_sha1(b->branch_tree.versions[1].sha1))
376 fputs(" dirty", rpt);
377 fputc('\n', rpt);
379 fprintf(rpt, " tip commit : %s\n", sha1_to_hex(b->sha1));
380 fprintf(rpt, " old tree : %s\n", sha1_to_hex(b->branch_tree.versions[0].sha1));
381 fprintf(rpt, " cur tree : %s\n", sha1_to_hex(b->branch_tree.versions[1].sha1));
382 fprintf(rpt, " commit clock: %" PRIuMAX "\n", b->last_commit);
384 fputs(" last pack : ", rpt);
385 if (b->pack_id < MAX_PACK_ID)
386 fprintf(rpt, "%u", b->pack_id);
387 fputc('\n', rpt);
389 fputc('\n', rpt);
392 static void dump_marks_helper(FILE *, uintmax_t, struct mark_set *);
394 static void write_crash_report(const char *err)
396 char *loc = git_path("fast_import_crash_%"PRIuMAX, (uintmax_t) getpid());
397 FILE *rpt = fopen(loc, "w");
398 struct branch *b;
399 unsigned long lu;
400 struct recent_command *rc;
402 if (!rpt) {
403 error("can't write crash report %s: %s", loc, strerror(errno));
404 return;
407 fprintf(stderr, "fast-import: dumping crash report to %s\n", loc);
409 fprintf(rpt, "fast-import crash report:\n");
410 fprintf(rpt, " fast-import process: %"PRIuMAX"\n", (uintmax_t) getpid());
411 fprintf(rpt, " parent process : %"PRIuMAX"\n", (uintmax_t) getppid());
412 fprintf(rpt, " at %s\n", show_date(time(NULL), 0, DATE_LOCAL));
413 fputc('\n', rpt);
415 fputs("fatal: ", rpt);
416 fputs(err, rpt);
417 fputc('\n', rpt);
419 fputc('\n', rpt);
420 fputs("Most Recent Commands Before Crash\n", rpt);
421 fputs("---------------------------------\n", rpt);
422 for (rc = cmd_hist.next; rc != &cmd_hist; rc = rc->next) {
423 if (rc->next == &cmd_hist)
424 fputs("* ", rpt);
425 else
426 fputs(" ", rpt);
427 fputs(rc->buf, rpt);
428 fputc('\n', rpt);
431 fputc('\n', rpt);
432 fputs("Active Branch LRU\n", rpt);
433 fputs("-----------------\n", rpt);
434 fprintf(rpt, " active_branches = %lu cur, %lu max\n",
435 cur_active_branches,
436 max_active_branches);
437 fputc('\n', rpt);
438 fputs(" pos clock name\n", rpt);
439 fputs(" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n", rpt);
440 for (b = active_branches, lu = 0; b; b = b->active_next_branch)
441 fprintf(rpt, " %2lu) %6" PRIuMAX" %s\n",
442 ++lu, b->last_commit, b->name);
444 fputc('\n', rpt);
445 fputs("Inactive Branches\n", rpt);
446 fputs("-----------------\n", rpt);
447 for (lu = 0; lu < branch_table_sz; lu++) {
448 for (b = branch_table[lu]; b; b = b->table_next_branch)
449 write_branch_report(rpt, b);
452 if (first_tag) {
453 struct tag *tg;
454 fputc('\n', rpt);
455 fputs("Annotated Tags\n", rpt);
456 fputs("--------------\n", rpt);
457 for (tg = first_tag; tg; tg = tg->next_tag) {
458 fputs(sha1_to_hex(tg->sha1), rpt);
459 fputc(' ', rpt);
460 fputs(tg->name, rpt);
461 fputc('\n', rpt);
465 fputc('\n', rpt);
466 fputs("Marks\n", rpt);
467 fputs("-----\n", rpt);
468 if (export_marks_file)
469 fprintf(rpt, " exported to %s\n", export_marks_file);
470 else
471 dump_marks_helper(rpt, 0, marks);
473 fputc('\n', rpt);
474 fputs("-------------------\n", rpt);
475 fputs("END OF CRASH REPORT\n", rpt);
476 fclose(rpt);
479 static void end_packfile(void);
480 static void unkeep_all_packs(void);
481 static void dump_marks(void);
483 static NORETURN void die_nicely(const char *err, va_list params)
485 static int zombie;
486 char message[2 * PATH_MAX];
488 vsnprintf(message, sizeof(message), err, params);
489 fputs("fatal: ", stderr);
490 fputs(message, stderr);
491 fputc('\n', stderr);
493 if (!zombie) {
494 zombie = 1;
495 write_crash_report(message);
496 end_packfile();
497 unkeep_all_packs();
498 dump_marks();
500 exit(128);
503 static void alloc_objects(unsigned int cnt)
505 struct object_entry_pool *b;
507 b = xmalloc(sizeof(struct object_entry_pool)
508 + cnt * sizeof(struct object_entry));
509 b->next_pool = blocks;
510 b->next_free = b->entries;
511 b->end = b->entries + cnt;
512 blocks = b;
513 alloc_count += cnt;
516 static struct object_entry *new_object(unsigned char *sha1)
518 struct object_entry *e;
520 if (blocks->next_free == blocks->end)
521 alloc_objects(object_entry_alloc);
523 e = blocks->next_free++;
524 hashcpy(e->idx.sha1, sha1);
525 return e;
528 static struct object_entry *find_object(unsigned char *sha1)
530 unsigned int h = sha1[0] << 8 | sha1[1];
531 struct object_entry *e;
532 for (e = object_table[h]; e; e = e->next)
533 if (!hashcmp(sha1, e->idx.sha1))
534 return e;
535 return NULL;
538 static struct object_entry *insert_object(unsigned char *sha1)
540 unsigned int h = sha1[0] << 8 | sha1[1];
541 struct object_entry *e = object_table[h];
542 struct object_entry *p = NULL;
544 while (e) {
545 if (!hashcmp(sha1, e->idx.sha1))
546 return e;
547 p = e;
548 e = e->next;
551 e = new_object(sha1);
552 e->next = NULL;
553 e->idx.offset = 0;
554 if (p)
555 p->next = e;
556 else
557 object_table[h] = e;
558 return e;
561 static unsigned int hc_str(const char *s, size_t len)
563 unsigned int r = 0;
564 while (len-- > 0)
565 r = r * 31 + *s++;
566 return r;
569 static void *pool_alloc(size_t len)
571 struct mem_pool *p;
572 void *r;
574 /* round up to a 'uintmax_t' alignment */
575 if (len & (sizeof(uintmax_t) - 1))
576 len += sizeof(uintmax_t) - (len & (sizeof(uintmax_t) - 1));
578 for (p = mem_pool; p; p = p->next_pool)
579 if ((p->end - p->next_free >= len))
580 break;
582 if (!p) {
583 if (len >= (mem_pool_alloc/2)) {
584 total_allocd += len;
585 return xmalloc(len);
587 total_allocd += sizeof(struct mem_pool) + mem_pool_alloc;
588 p = xmalloc(sizeof(struct mem_pool) + mem_pool_alloc);
589 p->next_pool = mem_pool;
590 p->next_free = (char *) p->space;
591 p->end = p->next_free + mem_pool_alloc;
592 mem_pool = p;
595 r = p->next_free;
596 p->next_free += len;
597 return r;
600 static void *pool_calloc(size_t count, size_t size)
602 size_t len = count * size;
603 void *r = pool_alloc(len);
604 memset(r, 0, len);
605 return r;
608 static char *pool_strdup(const char *s)
610 char *r = pool_alloc(strlen(s) + 1);
611 strcpy(r, s);
612 return r;
615 static void insert_mark(uintmax_t idnum, struct object_entry *oe)
617 struct mark_set *s = marks;
618 while ((idnum >> s->shift) >= 1024) {
619 s = pool_calloc(1, sizeof(struct mark_set));
620 s->shift = marks->shift + 10;
621 s->data.sets[0] = marks;
622 marks = s;
624 while (s->shift) {
625 uintmax_t i = idnum >> s->shift;
626 idnum -= i << s->shift;
627 if (!s->data.sets[i]) {
628 s->data.sets[i] = pool_calloc(1, sizeof(struct mark_set));
629 s->data.sets[i]->shift = s->shift - 10;
631 s = s->data.sets[i];
633 if (!s->data.marked[idnum])
634 marks_set_count++;
635 s->data.marked[idnum] = oe;
638 static struct object_entry *find_mark(uintmax_t idnum)
640 uintmax_t orig_idnum = idnum;
641 struct mark_set *s = marks;
642 struct object_entry *oe = NULL;
643 if ((idnum >> s->shift) < 1024) {
644 while (s && s->shift) {
645 uintmax_t i = idnum >> s->shift;
646 idnum -= i << s->shift;
647 s = s->data.sets[i];
649 if (s)
650 oe = s->data.marked[idnum];
652 if (!oe)
653 die("mark :%" PRIuMAX " not declared", orig_idnum);
654 return oe;
657 static struct atom_str *to_atom(const char *s, unsigned short len)
659 unsigned int hc = hc_str(s, len) % atom_table_sz;
660 struct atom_str *c;
662 for (c = atom_table[hc]; c; c = c->next_atom)
663 if (c->str_len == len && !strncmp(s, c->str_dat, len))
664 return c;
666 c = pool_alloc(sizeof(struct atom_str) + len + 1);
667 c->str_len = len;
668 strncpy(c->str_dat, s, len);
669 c->str_dat[len] = 0;
670 c->next_atom = atom_table[hc];
671 atom_table[hc] = c;
672 atom_cnt++;
673 return c;
676 static struct branch *lookup_branch(const char *name)
678 unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz;
679 struct branch *b;
681 for (b = branch_table[hc]; b; b = b->table_next_branch)
682 if (!strcmp(name, b->name))
683 return b;
684 return NULL;
687 static struct branch *new_branch(const char *name)
689 unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz;
690 struct branch *b = lookup_branch(name);
692 if (b)
693 die("Invalid attempt to create duplicate branch: %s", name);
694 switch (check_ref_format(name)) {
695 case 0: break; /* its valid */
696 case CHECK_REF_FORMAT_ONELEVEL:
697 break; /* valid, but too few '/', allow anyway */
698 default:
699 die("Branch name doesn't conform to GIT standards: %s", name);
702 b = pool_calloc(1, sizeof(struct branch));
703 b->name = pool_strdup(name);
704 b->table_next_branch = branch_table[hc];
705 b->branch_tree.versions[0].mode = S_IFDIR;
706 b->branch_tree.versions[1].mode = S_IFDIR;
707 b->num_notes = 0;
708 b->active = 0;
709 b->pack_id = MAX_PACK_ID;
710 branch_table[hc] = b;
711 branch_count++;
712 return b;
715 static unsigned int hc_entries(unsigned int cnt)
717 cnt = cnt & 7 ? (cnt / 8) + 1 : cnt / 8;
718 return cnt < avail_tree_table_sz ? cnt : avail_tree_table_sz - 1;
721 static struct tree_content *new_tree_content(unsigned int cnt)
723 struct avail_tree_content *f, *l = NULL;
724 struct tree_content *t;
725 unsigned int hc = hc_entries(cnt);
727 for (f = avail_tree_table[hc]; f; l = f, f = f->next_avail)
728 if (f->entry_capacity >= cnt)
729 break;
731 if (f) {
732 if (l)
733 l->next_avail = f->next_avail;
734 else
735 avail_tree_table[hc] = f->next_avail;
736 } else {
737 cnt = cnt & 7 ? ((cnt / 8) + 1) * 8 : cnt;
738 f = pool_alloc(sizeof(*t) + sizeof(t->entries[0]) * cnt);
739 f->entry_capacity = cnt;
742 t = (struct tree_content*)f;
743 t->entry_count = 0;
744 t->delta_depth = 0;
745 return t;
748 static void release_tree_entry(struct tree_entry *e);
749 static void release_tree_content(struct tree_content *t)
751 struct avail_tree_content *f = (struct avail_tree_content*)t;
752 unsigned int hc = hc_entries(f->entry_capacity);
753 f->next_avail = avail_tree_table[hc];
754 avail_tree_table[hc] = f;
757 static void release_tree_content_recursive(struct tree_content *t)
759 unsigned int i;
760 for (i = 0; i < t->entry_count; i++)
761 release_tree_entry(t->entries[i]);
762 release_tree_content(t);
765 static struct tree_content *grow_tree_content(
766 struct tree_content *t,
767 int amt)
769 struct tree_content *r = new_tree_content(t->entry_count + amt);
770 r->entry_count = t->entry_count;
771 r->delta_depth = t->delta_depth;
772 memcpy(r->entries,t->entries,t->entry_count*sizeof(t->entries[0]));
773 release_tree_content(t);
774 return r;
777 static struct tree_entry *new_tree_entry(void)
779 struct tree_entry *e;
781 if (!avail_tree_entry) {
782 unsigned int n = tree_entry_alloc;
783 total_allocd += n * sizeof(struct tree_entry);
784 avail_tree_entry = e = xmalloc(n * sizeof(struct tree_entry));
785 while (n-- > 1) {
786 *((void**)e) = e + 1;
787 e++;
789 *((void**)e) = NULL;
792 e = avail_tree_entry;
793 avail_tree_entry = *((void**)e);
794 return e;
797 static void release_tree_entry(struct tree_entry *e)
799 if (e->tree)
800 release_tree_content_recursive(e->tree);
801 *((void**)e) = avail_tree_entry;
802 avail_tree_entry = e;
805 static struct tree_content *dup_tree_content(struct tree_content *s)
807 struct tree_content *d;
808 struct tree_entry *a, *b;
809 unsigned int i;
811 if (!s)
812 return NULL;
813 d = new_tree_content(s->entry_count);
814 for (i = 0; i < s->entry_count; i++) {
815 a = s->entries[i];
816 b = new_tree_entry();
817 memcpy(b, a, sizeof(*a));
818 if (a->tree && is_null_sha1(b->versions[1].sha1))
819 b->tree = dup_tree_content(a->tree);
820 else
821 b->tree = NULL;
822 d->entries[i] = b;
824 d->entry_count = s->entry_count;
825 d->delta_depth = s->delta_depth;
827 return d;
830 static void start_packfile(void)
832 static char tmpfile[PATH_MAX];
833 struct packed_git *p;
834 struct pack_header hdr;
835 int pack_fd;
837 pack_fd = odb_mkstemp(tmpfile, sizeof(tmpfile),
838 "pack/tmp_pack_XXXXXX");
839 p = xcalloc(1, sizeof(*p) + strlen(tmpfile) + 2);
840 strcpy(p->pack_name, tmpfile);
841 p->pack_fd = pack_fd;
842 pack_file = sha1fd(pack_fd, p->pack_name);
844 hdr.hdr_signature = htonl(PACK_SIGNATURE);
845 hdr.hdr_version = htonl(2);
846 hdr.hdr_entries = 0;
847 sha1write(pack_file, &hdr, sizeof(hdr));
849 pack_data = p;
850 pack_size = sizeof(hdr);
851 object_count = 0;
853 all_packs = xrealloc(all_packs, sizeof(*all_packs) * (pack_id + 1));
854 all_packs[pack_id] = p;
857 static const char *create_index(void)
859 const char *tmpfile;
860 struct pack_idx_entry **idx, **c, **last;
861 struct object_entry *e;
862 struct object_entry_pool *o;
864 /* Build the table of object IDs. */
865 idx = xmalloc(object_count * sizeof(*idx));
866 c = idx;
867 for (o = blocks; o; o = o->next_pool)
868 for (e = o->next_free; e-- != o->entries;)
869 if (pack_id == e->pack_id)
870 *c++ = &e->idx;
871 last = idx + object_count;
872 if (c != last)
873 die("internal consistency error creating the index");
875 tmpfile = write_idx_file(NULL, idx, object_count, pack_data->sha1);
876 free(idx);
877 return tmpfile;
880 static char *keep_pack(const char *curr_index_name)
882 static char name[PATH_MAX];
883 static const char *keep_msg = "fast-import";
884 int keep_fd;
886 keep_fd = odb_pack_keep(name, sizeof(name), pack_data->sha1);
887 if (keep_fd < 0)
888 die_errno("cannot create keep file");
889 write_or_die(keep_fd, keep_msg, strlen(keep_msg));
890 if (close(keep_fd))
891 die_errno("failed to write keep file");
893 snprintf(name, sizeof(name), "%s/pack/pack-%s.pack",
894 get_object_directory(), sha1_to_hex(pack_data->sha1));
895 if (move_temp_to_file(pack_data->pack_name, name))
896 die("cannot store pack file");
898 snprintf(name, sizeof(name), "%s/pack/pack-%s.idx",
899 get_object_directory(), sha1_to_hex(pack_data->sha1));
900 if (move_temp_to_file(curr_index_name, name))
901 die("cannot store index file");
902 free((void *)curr_index_name);
903 return name;
906 static void unkeep_all_packs(void)
908 static char name[PATH_MAX];
909 int k;
911 for (k = 0; k < pack_id; k++) {
912 struct packed_git *p = all_packs[k];
913 snprintf(name, sizeof(name), "%s/pack/pack-%s.keep",
914 get_object_directory(), sha1_to_hex(p->sha1));
915 unlink_or_warn(name);
919 static void end_packfile(void)
921 struct packed_git *old_p = pack_data, *new_p;
923 clear_delta_base_cache();
924 if (object_count) {
925 unsigned char cur_pack_sha1[20];
926 char *idx_name;
927 int i;
928 struct branch *b;
929 struct tag *t;
931 close_pack_windows(pack_data);
932 sha1close(pack_file, cur_pack_sha1, 0);
933 fixup_pack_header_footer(pack_data->pack_fd, pack_data->sha1,
934 pack_data->pack_name, object_count,
935 cur_pack_sha1, pack_size);
936 close(pack_data->pack_fd);
937 idx_name = keep_pack(create_index());
939 /* Register the packfile with core git's machinery. */
940 new_p = add_packed_git(idx_name, strlen(idx_name), 1);
941 if (!new_p)
942 die("core git rejected index %s", idx_name);
943 all_packs[pack_id] = new_p;
944 install_packed_git(new_p);
946 /* Print the boundary */
947 if (pack_edges) {
948 fprintf(pack_edges, "%s:", new_p->pack_name);
949 for (i = 0; i < branch_table_sz; i++) {
950 for (b = branch_table[i]; b; b = b->table_next_branch) {
951 if (b->pack_id == pack_id)
952 fprintf(pack_edges, " %s", sha1_to_hex(b->sha1));
955 for (t = first_tag; t; t = t->next_tag) {
956 if (t->pack_id == pack_id)
957 fprintf(pack_edges, " %s", sha1_to_hex(t->sha1));
959 fputc('\n', pack_edges);
960 fflush(pack_edges);
963 pack_id++;
965 else {
966 close(old_p->pack_fd);
967 unlink_or_warn(old_p->pack_name);
969 free(old_p);
971 /* We can't carry a delta across packfiles. */
972 strbuf_release(&last_blob.data);
973 last_blob.offset = 0;
974 last_blob.depth = 0;
977 static void cycle_packfile(void)
979 end_packfile();
980 start_packfile();
983 static int store_object(
984 enum object_type type,
985 struct strbuf *dat,
986 struct last_object *last,
987 unsigned char *sha1out,
988 uintmax_t mark)
990 void *out, *delta;
991 struct object_entry *e;
992 unsigned char hdr[96];
993 unsigned char sha1[20];
994 unsigned long hdrlen, deltalen;
995 git_SHA_CTX c;
996 z_stream s;
998 hdrlen = sprintf((char *)hdr,"%s %lu", typename(type),
999 (unsigned long)dat->len) + 1;
1000 git_SHA1_Init(&c);
1001 git_SHA1_Update(&c, hdr, hdrlen);
1002 git_SHA1_Update(&c, dat->buf, dat->len);
1003 git_SHA1_Final(sha1, &c);
1004 if (sha1out)
1005 hashcpy(sha1out, sha1);
1007 e = insert_object(sha1);
1008 if (mark)
1009 insert_mark(mark, e);
1010 if (e->idx.offset) {
1011 duplicate_count_by_type[type]++;
1012 return 1;
1013 } else if (find_sha1_pack(sha1, packed_git)) {
1014 e->type = type;
1015 e->pack_id = MAX_PACK_ID;
1016 e->idx.offset = 1; /* just not zero! */
1017 duplicate_count_by_type[type]++;
1018 return 1;
1021 if (last && last->data.buf && last->depth < max_depth && dat->len > 20) {
1022 delta = diff_delta(last->data.buf, last->data.len,
1023 dat->buf, dat->len,
1024 &deltalen, dat->len - 20);
1025 } else
1026 delta = NULL;
1028 memset(&s, 0, sizeof(s));
1029 deflateInit(&s, pack_compression_level);
1030 if (delta) {
1031 s.next_in = delta;
1032 s.avail_in = deltalen;
1033 } else {
1034 s.next_in = (void *)dat->buf;
1035 s.avail_in = dat->len;
1037 s.avail_out = deflateBound(&s, s.avail_in);
1038 s.next_out = out = xmalloc(s.avail_out);
1039 while (deflate(&s, Z_FINISH) == Z_OK)
1040 /* nothing */;
1041 deflateEnd(&s);
1043 /* Determine if we should auto-checkpoint. */
1044 if ((max_packsize && (pack_size + 60 + s.total_out) > max_packsize)
1045 || (pack_size + 60 + s.total_out) < pack_size) {
1047 /* This new object needs to *not* have the current pack_id. */
1048 e->pack_id = pack_id + 1;
1049 cycle_packfile();
1051 /* We cannot carry a delta into the new pack. */
1052 if (delta) {
1053 free(delta);
1054 delta = NULL;
1056 memset(&s, 0, sizeof(s));
1057 deflateInit(&s, pack_compression_level);
1058 s.next_in = (void *)dat->buf;
1059 s.avail_in = dat->len;
1060 s.avail_out = deflateBound(&s, s.avail_in);
1061 s.next_out = out = xrealloc(out, s.avail_out);
1062 while (deflate(&s, Z_FINISH) == Z_OK)
1063 /* nothing */;
1064 deflateEnd(&s);
1068 e->type = type;
1069 e->pack_id = pack_id;
1070 e->idx.offset = pack_size;
1071 object_count++;
1072 object_count_by_type[type]++;
1074 crc32_begin(pack_file);
1076 if (delta) {
1077 off_t ofs = e->idx.offset - last->offset;
1078 unsigned pos = sizeof(hdr) - 1;
1080 delta_count_by_type[type]++;
1081 e->depth = last->depth + 1;
1083 hdrlen = encode_in_pack_object_header(OBJ_OFS_DELTA, deltalen, hdr);
1084 sha1write(pack_file, hdr, hdrlen);
1085 pack_size += hdrlen;
1087 hdr[pos] = ofs & 127;
1088 while (ofs >>= 7)
1089 hdr[--pos] = 128 | (--ofs & 127);
1090 sha1write(pack_file, hdr + pos, sizeof(hdr) - pos);
1091 pack_size += sizeof(hdr) - pos;
1092 } else {
1093 e->depth = 0;
1094 hdrlen = encode_in_pack_object_header(type, dat->len, hdr);
1095 sha1write(pack_file, hdr, hdrlen);
1096 pack_size += hdrlen;
1099 sha1write(pack_file, out, s.total_out);
1100 pack_size += s.total_out;
1102 e->idx.crc32 = crc32_end(pack_file);
1104 free(out);
1105 free(delta);
1106 if (last) {
1107 if (last->no_swap) {
1108 last->data = *dat;
1109 } else {
1110 strbuf_swap(&last->data, dat);
1112 last->offset = e->idx.offset;
1113 last->depth = e->depth;
1115 return 0;
1118 static void truncate_pack(off_t to, git_SHA_CTX *ctx)
1120 if (ftruncate(pack_data->pack_fd, to)
1121 || lseek(pack_data->pack_fd, to, SEEK_SET) != to)
1122 die_errno("cannot truncate pack to skip duplicate");
1123 pack_size = to;
1125 /* yes this is a layering violation */
1126 pack_file->total = to;
1127 pack_file->offset = 0;
1128 pack_file->ctx = *ctx;
1131 static void stream_blob(uintmax_t len, unsigned char *sha1out, uintmax_t mark)
1133 size_t in_sz = 64 * 1024, out_sz = 64 * 1024;
1134 unsigned char *in_buf = xmalloc(in_sz);
1135 unsigned char *out_buf = xmalloc(out_sz);
1136 struct object_entry *e;
1137 unsigned char sha1[20];
1138 unsigned long hdrlen;
1139 off_t offset;
1140 git_SHA_CTX c;
1141 git_SHA_CTX pack_file_ctx;
1142 z_stream s;
1143 int status = Z_OK;
1145 /* Determine if we should auto-checkpoint. */
1146 if ((max_packsize && (pack_size + 60 + len) > max_packsize)
1147 || (pack_size + 60 + len) < pack_size)
1148 cycle_packfile();
1150 offset = pack_size;
1152 /* preserve the pack_file SHA1 ctx in case we have to truncate later */
1153 sha1flush(pack_file);
1154 pack_file_ctx = pack_file->ctx;
1156 hdrlen = snprintf((char *)out_buf, out_sz, "blob %" PRIuMAX, len) + 1;
1157 if (out_sz <= hdrlen)
1158 die("impossibly large object header");
1160 git_SHA1_Init(&c);
1161 git_SHA1_Update(&c, out_buf, hdrlen);
1163 crc32_begin(pack_file);
1165 memset(&s, 0, sizeof(s));
1166 deflateInit(&s, pack_compression_level);
1168 hdrlen = encode_in_pack_object_header(OBJ_BLOB, len, out_buf);
1169 if (out_sz <= hdrlen)
1170 die("impossibly large object header");
1172 s.next_out = out_buf + hdrlen;
1173 s.avail_out = out_sz - hdrlen;
1175 while (status != Z_STREAM_END) {
1176 if (0 < len && !s.avail_in) {
1177 size_t cnt = in_sz < len ? in_sz : (size_t)len;
1178 size_t n = fread(in_buf, 1, cnt, stdin);
1179 if (!n && feof(stdin))
1180 die("EOF in data (%" PRIuMAX " bytes remaining)", len);
1182 git_SHA1_Update(&c, in_buf, n);
1183 s.next_in = in_buf;
1184 s.avail_in = n;
1185 len -= n;
1188 status = deflate(&s, len ? 0 : Z_FINISH);
1190 if (!s.avail_out || status == Z_STREAM_END) {
1191 size_t n = s.next_out - out_buf;
1192 sha1write(pack_file, out_buf, n);
1193 pack_size += n;
1194 s.next_out = out_buf;
1195 s.avail_out = out_sz;
1198 switch (status) {
1199 case Z_OK:
1200 case Z_BUF_ERROR:
1201 case Z_STREAM_END:
1202 continue;
1203 default:
1204 die("unexpected deflate failure: %d", status);
1207 deflateEnd(&s);
1208 git_SHA1_Final(sha1, &c);
1210 if (sha1out)
1211 hashcpy(sha1out, sha1);
1213 e = insert_object(sha1);
1215 if (mark)
1216 insert_mark(mark, e);
1218 if (e->idx.offset) {
1219 duplicate_count_by_type[OBJ_BLOB]++;
1220 truncate_pack(offset, &pack_file_ctx);
1222 } else if (find_sha1_pack(sha1, packed_git)) {
1223 e->type = OBJ_BLOB;
1224 e->pack_id = MAX_PACK_ID;
1225 e->idx.offset = 1; /* just not zero! */
1226 duplicate_count_by_type[OBJ_BLOB]++;
1227 truncate_pack(offset, &pack_file_ctx);
1229 } else {
1230 e->depth = 0;
1231 e->type = OBJ_BLOB;
1232 e->pack_id = pack_id;
1233 e->idx.offset = offset;
1234 e->idx.crc32 = crc32_end(pack_file);
1235 object_count++;
1236 object_count_by_type[OBJ_BLOB]++;
1239 free(in_buf);
1240 free(out_buf);
1243 /* All calls must be guarded by find_object() or find_mark() to
1244 * ensure the 'struct object_entry' passed was written by this
1245 * process instance. We unpack the entry by the offset, avoiding
1246 * the need for the corresponding .idx file. This unpacking rule
1247 * works because we only use OBJ_REF_DELTA within the packfiles
1248 * created by fast-import.
1250 * oe must not be NULL. Such an oe usually comes from giving
1251 * an unknown SHA-1 to find_object() or an undefined mark to
1252 * find_mark(). Callers must test for this condition and use
1253 * the standard read_sha1_file() when it happens.
1255 * oe->pack_id must not be MAX_PACK_ID. Such an oe is usually from
1256 * find_mark(), where the mark was reloaded from an existing marks
1257 * file and is referencing an object that this fast-import process
1258 * instance did not write out to a packfile. Callers must test for
1259 * this condition and use read_sha1_file() instead.
1261 static void *gfi_unpack_entry(
1262 struct object_entry *oe,
1263 unsigned long *sizep)
1265 enum object_type type;
1266 struct packed_git *p = all_packs[oe->pack_id];
1267 if (p == pack_data && p->pack_size < (pack_size + 20)) {
1268 /* The object is stored in the packfile we are writing to
1269 * and we have modified it since the last time we scanned
1270 * back to read a previously written object. If an old
1271 * window covered [p->pack_size, p->pack_size + 20) its
1272 * data is stale and is not valid. Closing all windows
1273 * and updating the packfile length ensures we can read
1274 * the newly written data.
1276 close_pack_windows(p);
1277 sha1flush(pack_file);
1279 /* We have to offer 20 bytes additional on the end of
1280 * the packfile as the core unpacker code assumes the
1281 * footer is present at the file end and must promise
1282 * at least 20 bytes within any window it maps. But
1283 * we don't actually create the footer here.
1285 p->pack_size = pack_size + 20;
1287 return unpack_entry(p, oe->idx.offset, &type, sizep);
1290 static const char *get_mode(const char *str, uint16_t *modep)
1292 unsigned char c;
1293 uint16_t mode = 0;
1295 while ((c = *str++) != ' ') {
1296 if (c < '0' || c > '7')
1297 return NULL;
1298 mode = (mode << 3) + (c - '0');
1300 *modep = mode;
1301 return str;
1304 static void load_tree(struct tree_entry *root)
1306 unsigned char *sha1 = root->versions[1].sha1;
1307 struct object_entry *myoe;
1308 struct tree_content *t;
1309 unsigned long size;
1310 char *buf;
1311 const char *c;
1313 root->tree = t = new_tree_content(8);
1314 if (is_null_sha1(sha1))
1315 return;
1317 myoe = find_object(sha1);
1318 if (myoe && myoe->pack_id != MAX_PACK_ID) {
1319 if (myoe->type != OBJ_TREE)
1320 die("Not a tree: %s", sha1_to_hex(sha1));
1321 t->delta_depth = myoe->depth;
1322 buf = gfi_unpack_entry(myoe, &size);
1323 if (!buf)
1324 die("Can't load tree %s", sha1_to_hex(sha1));
1325 } else {
1326 enum object_type type;
1327 buf = read_sha1_file(sha1, &type, &size);
1328 if (!buf || type != OBJ_TREE)
1329 die("Can't load tree %s", sha1_to_hex(sha1));
1332 c = buf;
1333 while (c != (buf + size)) {
1334 struct tree_entry *e = new_tree_entry();
1336 if (t->entry_count == t->entry_capacity)
1337 root->tree = t = grow_tree_content(t, t->entry_count);
1338 t->entries[t->entry_count++] = e;
1340 e->tree = NULL;
1341 c = get_mode(c, &e->versions[1].mode);
1342 if (!c)
1343 die("Corrupt mode in %s", sha1_to_hex(sha1));
1344 e->versions[0].mode = e->versions[1].mode;
1345 e->name = to_atom(c, strlen(c));
1346 c += e->name->str_len + 1;
1347 hashcpy(e->versions[0].sha1, (unsigned char *)c);
1348 hashcpy(e->versions[1].sha1, (unsigned char *)c);
1349 c += 20;
1351 free(buf);
1354 static int tecmp0 (const void *_a, const void *_b)
1356 struct tree_entry *a = *((struct tree_entry**)_a);
1357 struct tree_entry *b = *((struct tree_entry**)_b);
1358 return base_name_compare(
1359 a->name->str_dat, a->name->str_len, a->versions[0].mode,
1360 b->name->str_dat, b->name->str_len, b->versions[0].mode);
1363 static int tecmp1 (const void *_a, const void *_b)
1365 struct tree_entry *a = *((struct tree_entry**)_a);
1366 struct tree_entry *b = *((struct tree_entry**)_b);
1367 return base_name_compare(
1368 a->name->str_dat, a->name->str_len, a->versions[1].mode,
1369 b->name->str_dat, b->name->str_len, b->versions[1].mode);
1372 static void mktree(struct tree_content *t, int v, struct strbuf *b)
1374 size_t maxlen = 0;
1375 unsigned int i;
1377 if (!v)
1378 qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp0);
1379 else
1380 qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp1);
1382 for (i = 0; i < t->entry_count; i++) {
1383 if (t->entries[i]->versions[v].mode)
1384 maxlen += t->entries[i]->name->str_len + 34;
1387 strbuf_reset(b);
1388 strbuf_grow(b, maxlen);
1389 for (i = 0; i < t->entry_count; i++) {
1390 struct tree_entry *e = t->entries[i];
1391 if (!e->versions[v].mode)
1392 continue;
1393 strbuf_addf(b, "%o %s%c", (unsigned int)e->versions[v].mode,
1394 e->name->str_dat, '\0');
1395 strbuf_add(b, e->versions[v].sha1, 20);
1399 static void store_tree(struct tree_entry *root)
1401 struct tree_content *t = root->tree;
1402 unsigned int i, j, del;
1403 struct last_object lo = { STRBUF_INIT, 0, 0, /* no_swap */ 1 };
1404 struct object_entry *le;
1406 if (!is_null_sha1(root->versions[1].sha1))
1407 return;
1409 for (i = 0; i < t->entry_count; i++) {
1410 if (t->entries[i]->tree)
1411 store_tree(t->entries[i]);
1414 le = find_object(root->versions[0].sha1);
1415 if (S_ISDIR(root->versions[0].mode) && le && le->pack_id == pack_id) {
1416 mktree(t, 0, &old_tree);
1417 lo.data = old_tree;
1418 lo.offset = le->idx.offset;
1419 lo.depth = t->delta_depth;
1422 mktree(t, 1, &new_tree);
1423 store_object(OBJ_TREE, &new_tree, &lo, root->versions[1].sha1, 0);
1425 t->delta_depth = lo.depth;
1426 for (i = 0, j = 0, del = 0; i < t->entry_count; i++) {
1427 struct tree_entry *e = t->entries[i];
1428 if (e->versions[1].mode) {
1429 e->versions[0].mode = e->versions[1].mode;
1430 hashcpy(e->versions[0].sha1, e->versions[1].sha1);
1431 t->entries[j++] = e;
1432 } else {
1433 release_tree_entry(e);
1434 del++;
1437 t->entry_count -= del;
1440 static int tree_content_set(
1441 struct tree_entry *root,
1442 const char *p,
1443 const unsigned char *sha1,
1444 const uint16_t mode,
1445 struct tree_content *subtree)
1447 struct tree_content *t = root->tree;
1448 const char *slash1;
1449 unsigned int i, n;
1450 struct tree_entry *e;
1452 slash1 = strchr(p, '/');
1453 if (slash1)
1454 n = slash1 - p;
1455 else
1456 n = strlen(p);
1457 if (!n)
1458 die("Empty path component found in input");
1459 if (!slash1 && !S_ISDIR(mode) && subtree)
1460 die("Non-directories cannot have subtrees");
1462 for (i = 0; i < t->entry_count; i++) {
1463 e = t->entries[i];
1464 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
1465 if (!slash1) {
1466 if (!S_ISDIR(mode)
1467 && e->versions[1].mode == mode
1468 && !hashcmp(e->versions[1].sha1, sha1))
1469 return 0;
1470 e->versions[1].mode = mode;
1471 hashcpy(e->versions[1].sha1, sha1);
1472 if (e->tree)
1473 release_tree_content_recursive(e->tree);
1474 e->tree = subtree;
1475 hashclr(root->versions[1].sha1);
1476 return 1;
1478 if (!S_ISDIR(e->versions[1].mode)) {
1479 e->tree = new_tree_content(8);
1480 e->versions[1].mode = S_IFDIR;
1482 if (!e->tree)
1483 load_tree(e);
1484 if (tree_content_set(e, slash1 + 1, sha1, mode, subtree)) {
1485 hashclr(root->versions[1].sha1);
1486 return 1;
1488 return 0;
1492 if (t->entry_count == t->entry_capacity)
1493 root->tree = t = grow_tree_content(t, t->entry_count);
1494 e = new_tree_entry();
1495 e->name = to_atom(p, n);
1496 e->versions[0].mode = 0;
1497 hashclr(e->versions[0].sha1);
1498 t->entries[t->entry_count++] = e;
1499 if (slash1) {
1500 e->tree = new_tree_content(8);
1501 e->versions[1].mode = S_IFDIR;
1502 tree_content_set(e, slash1 + 1, sha1, mode, subtree);
1503 } else {
1504 e->tree = subtree;
1505 e->versions[1].mode = mode;
1506 hashcpy(e->versions[1].sha1, sha1);
1508 hashclr(root->versions[1].sha1);
1509 return 1;
1512 static int tree_content_remove(
1513 struct tree_entry *root,
1514 const char *p,
1515 struct tree_entry *backup_leaf)
1517 struct tree_content *t = root->tree;
1518 const char *slash1;
1519 unsigned int i, n;
1520 struct tree_entry *e;
1522 slash1 = strchr(p, '/');
1523 if (slash1)
1524 n = slash1 - p;
1525 else
1526 n = strlen(p);
1528 for (i = 0; i < t->entry_count; i++) {
1529 e = t->entries[i];
1530 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
1531 if (slash1 && !S_ISDIR(e->versions[1].mode))
1533 * If p names a file in some subdirectory, and a
1534 * file or symlink matching the name of the
1535 * parent directory of p exists, then p cannot
1536 * exist and need not be deleted.
1538 return 1;
1539 if (!slash1 || !S_ISDIR(e->versions[1].mode))
1540 goto del_entry;
1541 if (!e->tree)
1542 load_tree(e);
1543 if (tree_content_remove(e, slash1 + 1, backup_leaf)) {
1544 for (n = 0; n < e->tree->entry_count; n++) {
1545 if (e->tree->entries[n]->versions[1].mode) {
1546 hashclr(root->versions[1].sha1);
1547 return 1;
1550 backup_leaf = NULL;
1551 goto del_entry;
1553 return 0;
1556 return 0;
1558 del_entry:
1559 if (backup_leaf)
1560 memcpy(backup_leaf, e, sizeof(*backup_leaf));
1561 else if (e->tree)
1562 release_tree_content_recursive(e->tree);
1563 e->tree = NULL;
1564 e->versions[1].mode = 0;
1565 hashclr(e->versions[1].sha1);
1566 hashclr(root->versions[1].sha1);
1567 return 1;
1570 static int tree_content_get(
1571 struct tree_entry *root,
1572 const char *p,
1573 struct tree_entry *leaf)
1575 struct tree_content *t = root->tree;
1576 const char *slash1;
1577 unsigned int i, n;
1578 struct tree_entry *e;
1580 slash1 = strchr(p, '/');
1581 if (slash1)
1582 n = slash1 - p;
1583 else
1584 n = strlen(p);
1586 for (i = 0; i < t->entry_count; i++) {
1587 e = t->entries[i];
1588 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
1589 if (!slash1) {
1590 memcpy(leaf, e, sizeof(*leaf));
1591 if (e->tree && is_null_sha1(e->versions[1].sha1))
1592 leaf->tree = dup_tree_content(e->tree);
1593 else
1594 leaf->tree = NULL;
1595 return 1;
1597 if (!S_ISDIR(e->versions[1].mode))
1598 return 0;
1599 if (!e->tree)
1600 load_tree(e);
1601 return tree_content_get(e, slash1 + 1, leaf);
1604 return 0;
1607 static int update_branch(struct branch *b)
1609 static const char *msg = "fast-import";
1610 struct ref_lock *lock;
1611 unsigned char old_sha1[20];
1613 if (is_null_sha1(b->sha1))
1614 return 0;
1615 if (read_ref(b->name, old_sha1))
1616 hashclr(old_sha1);
1617 lock = lock_any_ref_for_update(b->name, old_sha1, 0);
1618 if (!lock)
1619 return error("Unable to lock %s", b->name);
1620 if (!force_update && !is_null_sha1(old_sha1)) {
1621 struct commit *old_cmit, *new_cmit;
1623 old_cmit = lookup_commit_reference_gently(old_sha1, 0);
1624 new_cmit = lookup_commit_reference_gently(b->sha1, 0);
1625 if (!old_cmit || !new_cmit) {
1626 unlock_ref(lock);
1627 return error("Branch %s is missing commits.", b->name);
1630 if (!in_merge_bases(old_cmit, &new_cmit, 1)) {
1631 unlock_ref(lock);
1632 warning("Not updating %s"
1633 " (new tip %s does not contain %s)",
1634 b->name, sha1_to_hex(b->sha1), sha1_to_hex(old_sha1));
1635 return -1;
1638 if (write_ref_sha1(lock, b->sha1, msg) < 0)
1639 return error("Unable to update %s", b->name);
1640 return 0;
1643 static void dump_branches(void)
1645 unsigned int i;
1646 struct branch *b;
1648 for (i = 0; i < branch_table_sz; i++) {
1649 for (b = branch_table[i]; b; b = b->table_next_branch)
1650 failure |= update_branch(b);
1654 static void dump_tags(void)
1656 static const char *msg = "fast-import";
1657 struct tag *t;
1658 struct ref_lock *lock;
1659 char ref_name[PATH_MAX];
1661 for (t = first_tag; t; t = t->next_tag) {
1662 sprintf(ref_name, "tags/%s", t->name);
1663 lock = lock_ref_sha1(ref_name, NULL);
1664 if (!lock || write_ref_sha1(lock, t->sha1, msg) < 0)
1665 failure |= error("Unable to update %s", ref_name);
1669 static void dump_marks_helper(FILE *f,
1670 uintmax_t base,
1671 struct mark_set *m)
1673 uintmax_t k;
1674 if (m->shift) {
1675 for (k = 0; k < 1024; k++) {
1676 if (m->data.sets[k])
1677 dump_marks_helper(f, base + (k << m->shift),
1678 m->data.sets[k]);
1680 } else {
1681 for (k = 0; k < 1024; k++) {
1682 if (m->data.marked[k])
1683 fprintf(f, ":%" PRIuMAX " %s\n", base + k,
1684 sha1_to_hex(m->data.marked[k]->idx.sha1));
1689 static void dump_marks(void)
1691 static struct lock_file mark_lock;
1692 int mark_fd;
1693 FILE *f;
1695 if (!export_marks_file)
1696 return;
1698 mark_fd = hold_lock_file_for_update(&mark_lock, export_marks_file, 0);
1699 if (mark_fd < 0) {
1700 failure |= error("Unable to write marks file %s: %s",
1701 export_marks_file, strerror(errno));
1702 return;
1705 f = fdopen(mark_fd, "w");
1706 if (!f) {
1707 int saved_errno = errno;
1708 rollback_lock_file(&mark_lock);
1709 failure |= error("Unable to write marks file %s: %s",
1710 export_marks_file, strerror(saved_errno));
1711 return;
1715 * Since the lock file was fdopen()'ed, it should not be close()'ed.
1716 * Assign -1 to the lock file descriptor so that commit_lock_file()
1717 * won't try to close() it.
1719 mark_lock.fd = -1;
1721 dump_marks_helper(f, 0, marks);
1722 if (ferror(f) || fclose(f)) {
1723 int saved_errno = errno;
1724 rollback_lock_file(&mark_lock);
1725 failure |= error("Unable to write marks file %s: %s",
1726 export_marks_file, strerror(saved_errno));
1727 return;
1730 if (commit_lock_file(&mark_lock)) {
1731 int saved_errno = errno;
1732 rollback_lock_file(&mark_lock);
1733 failure |= error("Unable to commit marks file %s: %s",
1734 export_marks_file, strerror(saved_errno));
1735 return;
1739 static void read_marks(void)
1741 char line[512];
1742 FILE *f = fopen(import_marks_file, "r");
1743 if (!f)
1744 die_errno("cannot read '%s'", import_marks_file);
1745 while (fgets(line, sizeof(line), f)) {
1746 uintmax_t mark;
1747 char *end;
1748 unsigned char sha1[20];
1749 struct object_entry *e;
1751 end = strchr(line, '\n');
1752 if (line[0] != ':' || !end)
1753 die("corrupt mark line: %s", line);
1754 *end = 0;
1755 mark = strtoumax(line + 1, &end, 10);
1756 if (!mark || end == line + 1
1757 || *end != ' ' || get_sha1(end + 1, sha1))
1758 die("corrupt mark line: %s", line);
1759 e = find_object(sha1);
1760 if (!e) {
1761 enum object_type type = sha1_object_info(sha1, NULL);
1762 if (type < 0)
1763 die("object not found: %s", sha1_to_hex(sha1));
1764 e = insert_object(sha1);
1765 e->type = type;
1766 e->pack_id = MAX_PACK_ID;
1767 e->idx.offset = 1; /* just not zero! */
1769 insert_mark(mark, e);
1771 fclose(f);
1775 static int read_next_command(void)
1777 static int stdin_eof = 0;
1779 if (stdin_eof) {
1780 unread_command_buf = 0;
1781 return EOF;
1784 do {
1785 if (unread_command_buf) {
1786 unread_command_buf = 0;
1787 } else {
1788 struct recent_command *rc;
1790 strbuf_detach(&command_buf, NULL);
1791 stdin_eof = strbuf_getline(&command_buf, stdin, '\n');
1792 if (stdin_eof)
1793 return EOF;
1795 if (!seen_data_command
1796 && prefixcmp(command_buf.buf, "feature ")
1797 && prefixcmp(command_buf.buf, "option ")) {
1798 parse_argv();
1801 rc = rc_free;
1802 if (rc)
1803 rc_free = rc->next;
1804 else {
1805 rc = cmd_hist.next;
1806 cmd_hist.next = rc->next;
1807 cmd_hist.next->prev = &cmd_hist;
1808 free(rc->buf);
1811 rc->buf = command_buf.buf;
1812 rc->prev = cmd_tail;
1813 rc->next = cmd_hist.prev;
1814 rc->prev->next = rc;
1815 cmd_tail = rc;
1817 } while (command_buf.buf[0] == '#');
1819 return 0;
1822 static void skip_optional_lf(void)
1824 int term_char = fgetc(stdin);
1825 if (term_char != '\n' && term_char != EOF)
1826 ungetc(term_char, stdin);
1829 static void parse_mark(void)
1831 if (!prefixcmp(command_buf.buf, "mark :")) {
1832 next_mark = strtoumax(command_buf.buf + 6, NULL, 10);
1833 read_next_command();
1835 else
1836 next_mark = 0;
1839 static int parse_data(struct strbuf *sb, uintmax_t limit, uintmax_t *len_res)
1841 strbuf_reset(sb);
1843 if (prefixcmp(command_buf.buf, "data "))
1844 die("Expected 'data n' command, found: %s", command_buf.buf);
1846 if (!prefixcmp(command_buf.buf + 5, "<<")) {
1847 char *term = xstrdup(command_buf.buf + 5 + 2);
1848 size_t term_len = command_buf.len - 5 - 2;
1850 strbuf_detach(&command_buf, NULL);
1851 for (;;) {
1852 if (strbuf_getline(&command_buf, stdin, '\n') == EOF)
1853 die("EOF in data (terminator '%s' not found)", term);
1854 if (term_len == command_buf.len
1855 && !strcmp(term, command_buf.buf))
1856 break;
1857 strbuf_addbuf(sb, &command_buf);
1858 strbuf_addch(sb, '\n');
1860 free(term);
1862 else {
1863 uintmax_t len = strtoumax(command_buf.buf + 5, NULL, 10);
1864 size_t n = 0, length = (size_t)len;
1866 if (limit && limit < len) {
1867 *len_res = len;
1868 return 0;
1870 if (length < len)
1871 die("data is too large to use in this context");
1873 while (n < length) {
1874 size_t s = strbuf_fread(sb, length - n, stdin);
1875 if (!s && feof(stdin))
1876 die("EOF in data (%lu bytes remaining)",
1877 (unsigned long)(length - n));
1878 n += s;
1882 skip_optional_lf();
1883 return 1;
1886 static int validate_raw_date(const char *src, char *result, int maxlen)
1888 const char *orig_src = src;
1889 char *endp;
1890 unsigned long num;
1892 errno = 0;
1894 num = strtoul(src, &endp, 10);
1895 /* NEEDSWORK: perhaps check for reasonable values? */
1896 if (errno || endp == src || *endp != ' ')
1897 return -1;
1899 src = endp + 1;
1900 if (*src != '-' && *src != '+')
1901 return -1;
1903 num = strtoul(src + 1, &endp, 10);
1904 if (errno || endp == src + 1 || *endp || (endp - orig_src) >= maxlen ||
1905 1400 < num)
1906 return -1;
1908 strcpy(result, orig_src);
1909 return 0;
1912 static char *parse_ident(const char *buf)
1914 const char *gt;
1915 size_t name_len;
1916 char *ident;
1918 gt = strrchr(buf, '>');
1919 if (!gt)
1920 die("Missing > in ident string: %s", buf);
1921 gt++;
1922 if (*gt != ' ')
1923 die("Missing space after > in ident string: %s", buf);
1924 gt++;
1925 name_len = gt - buf;
1926 ident = xmalloc(name_len + 24);
1927 strncpy(ident, buf, name_len);
1929 switch (whenspec) {
1930 case WHENSPEC_RAW:
1931 if (validate_raw_date(gt, ident + name_len, 24) < 0)
1932 die("Invalid raw date \"%s\" in ident: %s", gt, buf);
1933 break;
1934 case WHENSPEC_RFC2822:
1935 if (parse_date(gt, ident + name_len, 24) < 0)
1936 die("Invalid rfc2822 date \"%s\" in ident: %s", gt, buf);
1937 break;
1938 case WHENSPEC_NOW:
1939 if (strcmp("now", gt))
1940 die("Date in ident must be 'now': %s", buf);
1941 datestamp(ident + name_len, 24);
1942 break;
1945 return ident;
1948 static void parse_and_store_blob(
1949 struct last_object *last,
1950 unsigned char *sha1out,
1951 uintmax_t mark)
1953 static struct strbuf buf = STRBUF_INIT;
1954 uintmax_t len;
1956 if (parse_data(&buf, big_file_threshold, &len))
1957 store_object(OBJ_BLOB, &buf, last, sha1out, mark);
1958 else {
1959 if (last) {
1960 strbuf_release(&last->data);
1961 last->offset = 0;
1962 last->depth = 0;
1964 stream_blob(len, sha1out, mark);
1965 skip_optional_lf();
1969 static void parse_new_blob(void)
1971 read_next_command();
1972 parse_mark();
1973 parse_and_store_blob(&last_blob, NULL, next_mark);
1976 static void unload_one_branch(void)
1978 while (cur_active_branches
1979 && cur_active_branches >= max_active_branches) {
1980 uintmax_t min_commit = ULONG_MAX;
1981 struct branch *e, *l = NULL, *p = NULL;
1983 for (e = active_branches; e; e = e->active_next_branch) {
1984 if (e->last_commit < min_commit) {
1985 p = l;
1986 min_commit = e->last_commit;
1988 l = e;
1991 if (p) {
1992 e = p->active_next_branch;
1993 p->active_next_branch = e->active_next_branch;
1994 } else {
1995 e = active_branches;
1996 active_branches = e->active_next_branch;
1998 e->active = 0;
1999 e->active_next_branch = NULL;
2000 if (e->branch_tree.tree) {
2001 release_tree_content_recursive(e->branch_tree.tree);
2002 e->branch_tree.tree = NULL;
2004 cur_active_branches--;
2008 static void load_branch(struct branch *b)
2010 load_tree(&b->branch_tree);
2011 if (!b->active) {
2012 b->active = 1;
2013 b->active_next_branch = active_branches;
2014 active_branches = b;
2015 cur_active_branches++;
2016 branch_load_count++;
2020 static unsigned char convert_num_notes_to_fanout(uintmax_t num_notes)
2022 unsigned char fanout = 0;
2023 while ((num_notes >>= 8))
2024 fanout++;
2025 return fanout;
2028 static void construct_path_with_fanout(const char *hex_sha1,
2029 unsigned char fanout, char *path)
2031 unsigned int i = 0, j = 0;
2032 if (fanout >= 20)
2033 die("Too large fanout (%u)", fanout);
2034 while (fanout) {
2035 path[i++] = hex_sha1[j++];
2036 path[i++] = hex_sha1[j++];
2037 path[i++] = '/';
2038 fanout--;
2040 memcpy(path + i, hex_sha1 + j, 40 - j);
2041 path[i + 40 - j] = '\0';
2044 static uintmax_t do_change_note_fanout(
2045 struct tree_entry *orig_root, struct tree_entry *root,
2046 char *hex_sha1, unsigned int hex_sha1_len,
2047 char *fullpath, unsigned int fullpath_len,
2048 unsigned char fanout)
2050 struct tree_content *t = root->tree;
2051 struct tree_entry *e, leaf;
2052 unsigned int i, tmp_hex_sha1_len, tmp_fullpath_len;
2053 uintmax_t num_notes = 0;
2054 unsigned char sha1[20];
2055 char realpath[60];
2057 for (i = 0; t && i < t->entry_count; i++) {
2058 e = t->entries[i];
2059 tmp_hex_sha1_len = hex_sha1_len + e->name->str_len;
2060 tmp_fullpath_len = fullpath_len;
2063 * We're interested in EITHER existing note entries (entries
2064 * with exactly 40 hex chars in path, not including directory
2065 * separators), OR directory entries that may contain note
2066 * entries (with < 40 hex chars in path).
2067 * Also, each path component in a note entry must be a multiple
2068 * of 2 chars.
2070 if (!e->versions[1].mode ||
2071 tmp_hex_sha1_len > 40 ||
2072 e->name->str_len % 2)
2073 continue;
2075 /* This _may_ be a note entry, or a subdir containing notes */
2076 memcpy(hex_sha1 + hex_sha1_len, e->name->str_dat,
2077 e->name->str_len);
2078 if (tmp_fullpath_len)
2079 fullpath[tmp_fullpath_len++] = '/';
2080 memcpy(fullpath + tmp_fullpath_len, e->name->str_dat,
2081 e->name->str_len);
2082 tmp_fullpath_len += e->name->str_len;
2083 fullpath[tmp_fullpath_len] = '\0';
2085 if (tmp_hex_sha1_len == 40 && !get_sha1_hex(hex_sha1, sha1)) {
2086 /* This is a note entry */
2087 construct_path_with_fanout(hex_sha1, fanout, realpath);
2088 if (!strcmp(fullpath, realpath)) {
2089 /* Note entry is in correct location */
2090 num_notes++;
2091 continue;
2094 /* Rename fullpath to realpath */
2095 if (!tree_content_remove(orig_root, fullpath, &leaf))
2096 die("Failed to remove path %s", fullpath);
2097 tree_content_set(orig_root, realpath,
2098 leaf.versions[1].sha1,
2099 leaf.versions[1].mode,
2100 leaf.tree);
2101 } else if (S_ISDIR(e->versions[1].mode)) {
2102 /* This is a subdir that may contain note entries */
2103 if (!e->tree)
2104 load_tree(e);
2105 num_notes += do_change_note_fanout(orig_root, e,
2106 hex_sha1, tmp_hex_sha1_len,
2107 fullpath, tmp_fullpath_len, fanout);
2110 /* The above may have reallocated the current tree_content */
2111 t = root->tree;
2113 return num_notes;
2116 static uintmax_t change_note_fanout(struct tree_entry *root,
2117 unsigned char fanout)
2119 char hex_sha1[40], path[60];
2120 return do_change_note_fanout(root, root, hex_sha1, 0, path, 0, fanout);
2123 static void file_change_m(struct branch *b)
2125 const char *p = command_buf.buf + 2;
2126 static struct strbuf uq = STRBUF_INIT;
2127 const char *endp;
2128 struct object_entry *oe = oe;
2129 unsigned char sha1[20];
2130 uint16_t mode, inline_data = 0;
2132 p = get_mode(p, &mode);
2133 if (!p)
2134 die("Corrupt mode: %s", command_buf.buf);
2135 switch (mode) {
2136 case 0644:
2137 case 0755:
2138 mode |= S_IFREG;
2139 case S_IFREG | 0644:
2140 case S_IFREG | 0755:
2141 case S_IFLNK:
2142 case S_IFDIR:
2143 case S_IFGITLINK:
2144 /* ok */
2145 break;
2146 default:
2147 die("Corrupt mode: %s", command_buf.buf);
2150 if (*p == ':') {
2151 char *x;
2152 oe = find_mark(strtoumax(p + 1, &x, 10));
2153 hashcpy(sha1, oe->idx.sha1);
2154 p = x;
2155 } else if (!prefixcmp(p, "inline")) {
2156 inline_data = 1;
2157 p += 6;
2158 } else {
2159 if (get_sha1_hex(p, sha1))
2160 die("Invalid SHA1: %s", command_buf.buf);
2161 oe = find_object(sha1);
2162 p += 40;
2164 if (*p++ != ' ')
2165 die("Missing space after SHA1: %s", command_buf.buf);
2167 strbuf_reset(&uq);
2168 if (!unquote_c_style(&uq, p, &endp)) {
2169 if (*endp)
2170 die("Garbage after path in: %s", command_buf.buf);
2171 p = uq.buf;
2174 if (S_ISGITLINK(mode)) {
2175 if (inline_data)
2176 die("Git links cannot be specified 'inline': %s",
2177 command_buf.buf);
2178 else if (oe) {
2179 if (oe->type != OBJ_COMMIT)
2180 die("Not a commit (actually a %s): %s",
2181 typename(oe->type), command_buf.buf);
2184 * Accept the sha1 without checking; it expected to be in
2185 * another repository.
2187 } else if (inline_data) {
2188 if (S_ISDIR(mode))
2189 die("Directories cannot be specified 'inline': %s",
2190 command_buf.buf);
2191 if (p != uq.buf) {
2192 strbuf_addstr(&uq, p);
2193 p = uq.buf;
2195 read_next_command();
2196 parse_and_store_blob(&last_blob, sha1, 0);
2197 } else {
2198 enum object_type expected = S_ISDIR(mode) ?
2199 OBJ_TREE: OBJ_BLOB;
2200 enum object_type type = oe ? oe->type :
2201 sha1_object_info(sha1, NULL);
2202 if (type < 0)
2203 die("%s not found: %s",
2204 S_ISDIR(mode) ? "Tree" : "Blob",
2205 command_buf.buf);
2206 if (type != expected)
2207 die("Not a %s (actually a %s): %s",
2208 typename(expected), typename(type),
2209 command_buf.buf);
2212 tree_content_set(&b->branch_tree, p, sha1, mode, NULL);
2215 static void file_change_d(struct branch *b)
2217 const char *p = command_buf.buf + 2;
2218 static struct strbuf uq = STRBUF_INIT;
2219 const char *endp;
2221 strbuf_reset(&uq);
2222 if (!unquote_c_style(&uq, p, &endp)) {
2223 if (*endp)
2224 die("Garbage after path in: %s", command_buf.buf);
2225 p = uq.buf;
2227 tree_content_remove(&b->branch_tree, p, NULL);
2230 static void file_change_cr(struct branch *b, int rename)
2232 const char *s, *d;
2233 static struct strbuf s_uq = STRBUF_INIT;
2234 static struct strbuf d_uq = STRBUF_INIT;
2235 const char *endp;
2236 struct tree_entry leaf;
2238 s = command_buf.buf + 2;
2239 strbuf_reset(&s_uq);
2240 if (!unquote_c_style(&s_uq, s, &endp)) {
2241 if (*endp != ' ')
2242 die("Missing space after source: %s", command_buf.buf);
2243 } else {
2244 endp = strchr(s, ' ');
2245 if (!endp)
2246 die("Missing space after source: %s", command_buf.buf);
2247 strbuf_add(&s_uq, s, endp - s);
2249 s = s_uq.buf;
2251 endp++;
2252 if (!*endp)
2253 die("Missing dest: %s", command_buf.buf);
2255 d = endp;
2256 strbuf_reset(&d_uq);
2257 if (!unquote_c_style(&d_uq, d, &endp)) {
2258 if (*endp)
2259 die("Garbage after dest in: %s", command_buf.buf);
2260 d = d_uq.buf;
2263 memset(&leaf, 0, sizeof(leaf));
2264 if (rename)
2265 tree_content_remove(&b->branch_tree, s, &leaf);
2266 else
2267 tree_content_get(&b->branch_tree, s, &leaf);
2268 if (!leaf.versions[1].mode)
2269 die("Path %s not in branch", s);
2270 tree_content_set(&b->branch_tree, d,
2271 leaf.versions[1].sha1,
2272 leaf.versions[1].mode,
2273 leaf.tree);
2276 static void note_change_n(struct branch *b, unsigned char old_fanout)
2278 const char *p = command_buf.buf + 2;
2279 static struct strbuf uq = STRBUF_INIT;
2280 struct object_entry *oe = oe;
2281 struct branch *s;
2282 unsigned char sha1[20], commit_sha1[20];
2283 char path[60];
2284 uint16_t inline_data = 0;
2285 unsigned char new_fanout;
2287 /* <dataref> or 'inline' */
2288 if (*p == ':') {
2289 char *x;
2290 oe = find_mark(strtoumax(p + 1, &x, 10));
2291 hashcpy(sha1, oe->idx.sha1);
2292 p = x;
2293 } else if (!prefixcmp(p, "inline")) {
2294 inline_data = 1;
2295 p += 6;
2296 } else {
2297 if (get_sha1_hex(p, sha1))
2298 die("Invalid SHA1: %s", command_buf.buf);
2299 oe = find_object(sha1);
2300 p += 40;
2302 if (*p++ != ' ')
2303 die("Missing space after SHA1: %s", command_buf.buf);
2305 /* <committish> */
2306 s = lookup_branch(p);
2307 if (s) {
2308 hashcpy(commit_sha1, s->sha1);
2309 } else if (*p == ':') {
2310 uintmax_t commit_mark = strtoumax(p + 1, NULL, 10);
2311 struct object_entry *commit_oe = find_mark(commit_mark);
2312 if (commit_oe->type != OBJ_COMMIT)
2313 die("Mark :%" PRIuMAX " not a commit", commit_mark);
2314 hashcpy(commit_sha1, commit_oe->idx.sha1);
2315 } else if (!get_sha1(p, commit_sha1)) {
2316 unsigned long size;
2317 char *buf = read_object_with_reference(commit_sha1,
2318 commit_type, &size, commit_sha1);
2319 if (!buf || size < 46)
2320 die("Not a valid commit: %s", p);
2321 free(buf);
2322 } else
2323 die("Invalid ref name or SHA1 expression: %s", p);
2325 if (inline_data) {
2326 if (p != uq.buf) {
2327 strbuf_addstr(&uq, p);
2328 p = uq.buf;
2330 read_next_command();
2331 parse_and_store_blob(&last_blob, sha1, 0);
2332 } else if (oe) {
2333 if (oe->type != OBJ_BLOB)
2334 die("Not a blob (actually a %s): %s",
2335 typename(oe->type), command_buf.buf);
2336 } else if (!is_null_sha1(sha1)) {
2337 enum object_type type = sha1_object_info(sha1, NULL);
2338 if (type < 0)
2339 die("Blob not found: %s", command_buf.buf);
2340 if (type != OBJ_BLOB)
2341 die("Not a blob (actually a %s): %s",
2342 typename(type), command_buf.buf);
2345 construct_path_with_fanout(sha1_to_hex(commit_sha1), old_fanout, path);
2346 if (tree_content_remove(&b->branch_tree, path, NULL))
2347 b->num_notes--;
2349 if (is_null_sha1(sha1))
2350 return; /* nothing to insert */
2352 b->num_notes++;
2353 new_fanout = convert_num_notes_to_fanout(b->num_notes);
2354 construct_path_with_fanout(sha1_to_hex(commit_sha1), new_fanout, path);
2355 tree_content_set(&b->branch_tree, path, sha1, S_IFREG | 0644, NULL);
2358 static void file_change_deleteall(struct branch *b)
2360 release_tree_content_recursive(b->branch_tree.tree);
2361 hashclr(b->branch_tree.versions[0].sha1);
2362 hashclr(b->branch_tree.versions[1].sha1);
2363 load_tree(&b->branch_tree);
2364 b->num_notes = 0;
2367 static void parse_from_commit(struct branch *b, char *buf, unsigned long size)
2369 if (!buf || size < 46)
2370 die("Not a valid commit: %s", sha1_to_hex(b->sha1));
2371 if (memcmp("tree ", buf, 5)
2372 || get_sha1_hex(buf + 5, b->branch_tree.versions[1].sha1))
2373 die("The commit %s is corrupt", sha1_to_hex(b->sha1));
2374 hashcpy(b->branch_tree.versions[0].sha1,
2375 b->branch_tree.versions[1].sha1);
2378 static void parse_from_existing(struct branch *b)
2380 if (is_null_sha1(b->sha1)) {
2381 hashclr(b->branch_tree.versions[0].sha1);
2382 hashclr(b->branch_tree.versions[1].sha1);
2383 } else {
2384 unsigned long size;
2385 char *buf;
2387 buf = read_object_with_reference(b->sha1,
2388 commit_type, &size, b->sha1);
2389 parse_from_commit(b, buf, size);
2390 free(buf);
2394 static int parse_from(struct branch *b)
2396 const char *from;
2397 struct branch *s;
2399 if (prefixcmp(command_buf.buf, "from "))
2400 return 0;
2402 if (b->branch_tree.tree) {
2403 release_tree_content_recursive(b->branch_tree.tree);
2404 b->branch_tree.tree = NULL;
2407 from = strchr(command_buf.buf, ' ') + 1;
2408 s = lookup_branch(from);
2409 if (b == s)
2410 die("Can't create a branch from itself: %s", b->name);
2411 else if (s) {
2412 unsigned char *t = s->branch_tree.versions[1].sha1;
2413 hashcpy(b->sha1, s->sha1);
2414 hashcpy(b->branch_tree.versions[0].sha1, t);
2415 hashcpy(b->branch_tree.versions[1].sha1, t);
2416 } else if (*from == ':') {
2417 uintmax_t idnum = strtoumax(from + 1, NULL, 10);
2418 struct object_entry *oe = find_mark(idnum);
2419 if (oe->type != OBJ_COMMIT)
2420 die("Mark :%" PRIuMAX " not a commit", idnum);
2421 hashcpy(b->sha1, oe->idx.sha1);
2422 if (oe->pack_id != MAX_PACK_ID) {
2423 unsigned long size;
2424 char *buf = gfi_unpack_entry(oe, &size);
2425 parse_from_commit(b, buf, size);
2426 free(buf);
2427 } else
2428 parse_from_existing(b);
2429 } else if (!get_sha1(from, b->sha1))
2430 parse_from_existing(b);
2431 else
2432 die("Invalid ref name or SHA1 expression: %s", from);
2434 read_next_command();
2435 return 1;
2438 static struct hash_list *parse_merge(unsigned int *count)
2440 struct hash_list *list = NULL, *n, *e = e;
2441 const char *from;
2442 struct branch *s;
2444 *count = 0;
2445 while (!prefixcmp(command_buf.buf, "merge ")) {
2446 from = strchr(command_buf.buf, ' ') + 1;
2447 n = xmalloc(sizeof(*n));
2448 s = lookup_branch(from);
2449 if (s)
2450 hashcpy(n->sha1, s->sha1);
2451 else if (*from == ':') {
2452 uintmax_t idnum = strtoumax(from + 1, NULL, 10);
2453 struct object_entry *oe = find_mark(idnum);
2454 if (oe->type != OBJ_COMMIT)
2455 die("Mark :%" PRIuMAX " not a commit", idnum);
2456 hashcpy(n->sha1, oe->idx.sha1);
2457 } else if (!get_sha1(from, n->sha1)) {
2458 unsigned long size;
2459 char *buf = read_object_with_reference(n->sha1,
2460 commit_type, &size, n->sha1);
2461 if (!buf || size < 46)
2462 die("Not a valid commit: %s", from);
2463 free(buf);
2464 } else
2465 die("Invalid ref name or SHA1 expression: %s", from);
2467 n->next = NULL;
2468 if (list)
2469 e->next = n;
2470 else
2471 list = n;
2472 e = n;
2473 (*count)++;
2474 read_next_command();
2476 return list;
2479 static void parse_new_commit(void)
2481 static struct strbuf msg = STRBUF_INIT;
2482 struct branch *b;
2483 char *sp;
2484 char *author = NULL;
2485 char *committer = NULL;
2486 struct hash_list *merge_list = NULL;
2487 unsigned int merge_count;
2488 unsigned char prev_fanout, new_fanout;
2490 /* Obtain the branch name from the rest of our command */
2491 sp = strchr(command_buf.buf, ' ') + 1;
2492 b = lookup_branch(sp);
2493 if (!b)
2494 b = new_branch(sp);
2496 read_next_command();
2497 parse_mark();
2498 if (!prefixcmp(command_buf.buf, "author ")) {
2499 author = parse_ident(command_buf.buf + 7);
2500 read_next_command();
2502 if (!prefixcmp(command_buf.buf, "committer ")) {
2503 committer = parse_ident(command_buf.buf + 10);
2504 read_next_command();
2506 if (!committer)
2507 die("Expected committer but didn't get one");
2508 parse_data(&msg, 0, NULL);
2509 read_next_command();
2510 parse_from(b);
2511 merge_list = parse_merge(&merge_count);
2513 /* ensure the branch is active/loaded */
2514 if (!b->branch_tree.tree || !max_active_branches) {
2515 unload_one_branch();
2516 load_branch(b);
2519 prev_fanout = convert_num_notes_to_fanout(b->num_notes);
2521 /* file_change* */
2522 while (command_buf.len > 0) {
2523 if (!prefixcmp(command_buf.buf, "M "))
2524 file_change_m(b);
2525 else if (!prefixcmp(command_buf.buf, "D "))
2526 file_change_d(b);
2527 else if (!prefixcmp(command_buf.buf, "R "))
2528 file_change_cr(b, 1);
2529 else if (!prefixcmp(command_buf.buf, "C "))
2530 file_change_cr(b, 0);
2531 else if (!prefixcmp(command_buf.buf, "N "))
2532 note_change_n(b, prev_fanout);
2533 else if (!strcmp("deleteall", command_buf.buf))
2534 file_change_deleteall(b);
2535 else {
2536 unread_command_buf = 1;
2537 break;
2539 if (read_next_command() == EOF)
2540 break;
2543 new_fanout = convert_num_notes_to_fanout(b->num_notes);
2544 if (new_fanout != prev_fanout)
2545 b->num_notes = change_note_fanout(&b->branch_tree, new_fanout);
2547 /* build the tree and the commit */
2548 store_tree(&b->branch_tree);
2549 hashcpy(b->branch_tree.versions[0].sha1,
2550 b->branch_tree.versions[1].sha1);
2552 strbuf_reset(&new_data);
2553 strbuf_addf(&new_data, "tree %s\n",
2554 sha1_to_hex(b->branch_tree.versions[1].sha1));
2555 if (!is_null_sha1(b->sha1))
2556 strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(b->sha1));
2557 while (merge_list) {
2558 struct hash_list *next = merge_list->next;
2559 strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(merge_list->sha1));
2560 free(merge_list);
2561 merge_list = next;
2563 strbuf_addf(&new_data,
2564 "author %s\n"
2565 "committer %s\n"
2566 "\n",
2567 author ? author : committer, committer);
2568 strbuf_addbuf(&new_data, &msg);
2569 free(author);
2570 free(committer);
2572 if (!store_object(OBJ_COMMIT, &new_data, NULL, b->sha1, next_mark))
2573 b->pack_id = pack_id;
2574 b->last_commit = object_count_by_type[OBJ_COMMIT];
2577 static void parse_new_tag(void)
2579 static struct strbuf msg = STRBUF_INIT;
2580 char *sp;
2581 const char *from;
2582 char *tagger;
2583 struct branch *s;
2584 struct tag *t;
2585 uintmax_t from_mark = 0;
2586 unsigned char sha1[20];
2587 enum object_type type;
2589 /* Obtain the new tag name from the rest of our command */
2590 sp = strchr(command_buf.buf, ' ') + 1;
2591 t = pool_alloc(sizeof(struct tag));
2592 t->next_tag = NULL;
2593 t->name = pool_strdup(sp);
2594 if (last_tag)
2595 last_tag->next_tag = t;
2596 else
2597 first_tag = t;
2598 last_tag = t;
2599 read_next_command();
2601 /* from ... */
2602 if (prefixcmp(command_buf.buf, "from "))
2603 die("Expected from command, got %s", command_buf.buf);
2604 from = strchr(command_buf.buf, ' ') + 1;
2605 s = lookup_branch(from);
2606 if (s) {
2607 hashcpy(sha1, s->sha1);
2608 type = OBJ_COMMIT;
2609 } else if (*from == ':') {
2610 struct object_entry *oe;
2611 from_mark = strtoumax(from + 1, NULL, 10);
2612 oe = find_mark(from_mark);
2613 type = oe->type;
2614 hashcpy(sha1, oe->idx.sha1);
2615 } else if (!get_sha1(from, sha1)) {
2616 unsigned long size;
2617 char *buf;
2619 buf = read_sha1_file(sha1, &type, &size);
2620 if (!buf || size < 46)
2621 die("Not a valid commit: %s", from);
2622 free(buf);
2623 } else
2624 die("Invalid ref name or SHA1 expression: %s", from);
2625 read_next_command();
2627 /* tagger ... */
2628 if (!prefixcmp(command_buf.buf, "tagger ")) {
2629 tagger = parse_ident(command_buf.buf + 7);
2630 read_next_command();
2631 } else
2632 tagger = NULL;
2634 /* tag payload/message */
2635 parse_data(&msg, 0, NULL);
2637 /* build the tag object */
2638 strbuf_reset(&new_data);
2640 strbuf_addf(&new_data,
2641 "object %s\n"
2642 "type %s\n"
2643 "tag %s\n",
2644 sha1_to_hex(sha1), typename(type), t->name);
2645 if (tagger)
2646 strbuf_addf(&new_data,
2647 "tagger %s\n", tagger);
2648 strbuf_addch(&new_data, '\n');
2649 strbuf_addbuf(&new_data, &msg);
2650 free(tagger);
2652 if (store_object(OBJ_TAG, &new_data, NULL, t->sha1, 0))
2653 t->pack_id = MAX_PACK_ID;
2654 else
2655 t->pack_id = pack_id;
2658 static void parse_reset_branch(void)
2660 struct branch *b;
2661 char *sp;
2663 /* Obtain the branch name from the rest of our command */
2664 sp = strchr(command_buf.buf, ' ') + 1;
2665 b = lookup_branch(sp);
2666 if (b) {
2667 hashclr(b->sha1);
2668 hashclr(b->branch_tree.versions[0].sha1);
2669 hashclr(b->branch_tree.versions[1].sha1);
2670 if (b->branch_tree.tree) {
2671 release_tree_content_recursive(b->branch_tree.tree);
2672 b->branch_tree.tree = NULL;
2675 else
2676 b = new_branch(sp);
2677 read_next_command();
2678 parse_from(b);
2679 if (command_buf.len > 0)
2680 unread_command_buf = 1;
2683 static void parse_checkpoint(void)
2685 if (object_count) {
2686 cycle_packfile();
2687 dump_branches();
2688 dump_tags();
2689 dump_marks();
2691 skip_optional_lf();
2694 static void parse_progress(void)
2696 fwrite(command_buf.buf, 1, command_buf.len, stdout);
2697 fputc('\n', stdout);
2698 fflush(stdout);
2699 skip_optional_lf();
2702 static char* make_fast_import_path(const char *path)
2704 struct strbuf abs_path = STRBUF_INIT;
2706 if (!relative_marks_paths || is_absolute_path(path))
2707 return xstrdup(path);
2708 strbuf_addf(&abs_path, "%s/info/fast-import/%s", get_git_dir(), path);
2709 return strbuf_detach(&abs_path, NULL);
2712 static void option_import_marks(const char *marks, int from_stream)
2714 if (import_marks_file) {
2715 if (from_stream)
2716 die("Only one import-marks command allowed per stream");
2718 /* read previous mark file */
2719 if(!import_marks_file_from_stream)
2720 read_marks();
2723 import_marks_file = make_fast_import_path(marks);
2724 safe_create_leading_directories_const(import_marks_file);
2725 import_marks_file_from_stream = from_stream;
2728 static void option_date_format(const char *fmt)
2730 if (!strcmp(fmt, "raw"))
2731 whenspec = WHENSPEC_RAW;
2732 else if (!strcmp(fmt, "rfc2822"))
2733 whenspec = WHENSPEC_RFC2822;
2734 else if (!strcmp(fmt, "now"))
2735 whenspec = WHENSPEC_NOW;
2736 else
2737 die("unknown --date-format argument %s", fmt);
2740 static void option_depth(const char *depth)
2742 max_depth = strtoul(depth, NULL, 0);
2743 if (max_depth > MAX_DEPTH)
2744 die("--depth cannot exceed %u", MAX_DEPTH);
2747 static void option_active_branches(const char *branches)
2749 max_active_branches = strtoul(branches, NULL, 0);
2752 static void option_export_marks(const char *marks)
2754 export_marks_file = make_fast_import_path(marks);
2755 safe_create_leading_directories_const(export_marks_file);
2758 static void option_export_pack_edges(const char *edges)
2760 if (pack_edges)
2761 fclose(pack_edges);
2762 pack_edges = fopen(edges, "a");
2763 if (!pack_edges)
2764 die_errno("Cannot open '%s'", edges);
2767 static int parse_one_option(const char *option)
2769 if (!prefixcmp(option, "max-pack-size=")) {
2770 unsigned long v;
2771 if (!git_parse_ulong(option + 14, &v))
2772 return 0;
2773 if (v < 8192) {
2774 warning("max-pack-size is now in bytes, assuming --max-pack-size=%lum", v);
2775 v *= 1024 * 1024;
2776 } else if (v < 1024 * 1024) {
2777 warning("minimum max-pack-size is 1 MiB");
2778 v = 1024 * 1024;
2780 max_packsize = v;
2781 } else if (!prefixcmp(option, "big-file-threshold=")) {
2782 unsigned long v;
2783 if (!git_parse_ulong(option + 19, &v))
2784 return 0;
2785 big_file_threshold = v;
2786 } else if (!prefixcmp(option, "depth=")) {
2787 option_depth(option + 6);
2788 } else if (!prefixcmp(option, "active-branches=")) {
2789 option_active_branches(option + 16);
2790 } else if (!prefixcmp(option, "export-pack-edges=")) {
2791 option_export_pack_edges(option + 18);
2792 } else if (!prefixcmp(option, "quiet")) {
2793 show_stats = 0;
2794 } else if (!prefixcmp(option, "stats")) {
2795 show_stats = 1;
2796 } else {
2797 return 0;
2800 return 1;
2803 static int parse_one_feature(const char *feature, int from_stream)
2805 if (!prefixcmp(feature, "date-format=")) {
2806 option_date_format(feature + 12);
2807 } else if (!prefixcmp(feature, "import-marks=")) {
2808 option_import_marks(feature + 13, from_stream);
2809 } else if (!prefixcmp(feature, "export-marks=")) {
2810 option_export_marks(feature + 13);
2811 } else if (!prefixcmp(feature, "relative-marks")) {
2812 relative_marks_paths = 1;
2813 } else if (!prefixcmp(feature, "no-relative-marks")) {
2814 relative_marks_paths = 0;
2815 } else if (!prefixcmp(feature, "force")) {
2816 force_update = 1;
2817 } else {
2818 return 0;
2821 return 1;
2824 static void parse_feature(void)
2826 char *feature = command_buf.buf + 8;
2828 if (seen_data_command)
2829 die("Got feature command '%s' after data command", feature);
2831 if (parse_one_feature(feature, 1))
2832 return;
2834 die("This version of fast-import does not support feature %s.", feature);
2837 static void parse_option(void)
2839 char *option = command_buf.buf + 11;
2841 if (seen_data_command)
2842 die("Got option command '%s' after data command", option);
2844 if (parse_one_option(option))
2845 return;
2847 die("This version of fast-import does not support option: %s", option);
2850 static int git_pack_config(const char *k, const char *v, void *cb)
2852 if (!strcmp(k, "pack.depth")) {
2853 max_depth = git_config_int(k, v);
2854 if (max_depth > MAX_DEPTH)
2855 max_depth = MAX_DEPTH;
2856 return 0;
2858 if (!strcmp(k, "pack.compression")) {
2859 int level = git_config_int(k, v);
2860 if (level == -1)
2861 level = Z_DEFAULT_COMPRESSION;
2862 else if (level < 0 || level > Z_BEST_COMPRESSION)
2863 die("bad pack compression level %d", level);
2864 pack_compression_level = level;
2865 pack_compression_seen = 1;
2866 return 0;
2868 if (!strcmp(k, "pack.indexversion")) {
2869 pack_idx_default_version = git_config_int(k, v);
2870 if (pack_idx_default_version > 2)
2871 die("bad pack.indexversion=%"PRIu32,
2872 pack_idx_default_version);
2873 return 0;
2875 if (!strcmp(k, "pack.packsizelimit")) {
2876 max_packsize = git_config_ulong(k, v);
2877 return 0;
2879 if (!strcmp(k, "core.bigfilethreshold")) {
2880 long n = git_config_int(k, v);
2881 big_file_threshold = 0 < n ? n : 0;
2883 return git_default_config(k, v, cb);
2886 static const char fast_import_usage[] =
2887 "git fast-import [--date-format=<f>] [--max-pack-size=<n>] [--big-file-threshold=<n>] [--depth=<n>] [--active-branches=<n>] [--export-marks=<marks.file>]";
2889 static void parse_argv(void)
2891 unsigned int i;
2893 for (i = 1; i < global_argc; i++) {
2894 const char *a = global_argv[i];
2896 if (*a != '-' || !strcmp(a, "--"))
2897 break;
2899 if (parse_one_option(a + 2))
2900 continue;
2902 if (parse_one_feature(a + 2, 0))
2903 continue;
2905 die("unknown option %s", a);
2907 if (i != global_argc)
2908 usage(fast_import_usage);
2910 seen_data_command = 1;
2911 if (import_marks_file)
2912 read_marks();
2915 int main(int argc, const char **argv)
2917 unsigned int i;
2919 git_extract_argv0_path(argv[0]);
2921 if (argc == 2 && !strcmp(argv[1], "-h"))
2922 usage(fast_import_usage);
2924 setup_git_directory();
2925 git_config(git_pack_config, NULL);
2926 if (!pack_compression_seen && core_compression_seen)
2927 pack_compression_level = core_compression_level;
2929 alloc_objects(object_entry_alloc);
2930 strbuf_init(&command_buf, 0);
2931 atom_table = xcalloc(atom_table_sz, sizeof(struct atom_str*));
2932 branch_table = xcalloc(branch_table_sz, sizeof(struct branch*));
2933 avail_tree_table = xcalloc(avail_tree_table_sz, sizeof(struct avail_tree_content*));
2934 marks = pool_calloc(1, sizeof(struct mark_set));
2936 global_argc = argc;
2937 global_argv = argv;
2939 rc_free = pool_alloc(cmd_save * sizeof(*rc_free));
2940 for (i = 0; i < (cmd_save - 1); i++)
2941 rc_free[i].next = &rc_free[i + 1];
2942 rc_free[cmd_save - 1].next = NULL;
2944 prepare_packed_git();
2945 start_packfile();
2946 set_die_routine(die_nicely);
2947 while (read_next_command() != EOF) {
2948 if (!strcmp("blob", command_buf.buf))
2949 parse_new_blob();
2950 else if (!prefixcmp(command_buf.buf, "commit "))
2951 parse_new_commit();
2952 else if (!prefixcmp(command_buf.buf, "tag "))
2953 parse_new_tag();
2954 else if (!prefixcmp(command_buf.buf, "reset "))
2955 parse_reset_branch();
2956 else if (!strcmp("checkpoint", command_buf.buf))
2957 parse_checkpoint();
2958 else if (!prefixcmp(command_buf.buf, "progress "))
2959 parse_progress();
2960 else if (!prefixcmp(command_buf.buf, "feature "))
2961 parse_feature();
2962 else if (!prefixcmp(command_buf.buf, "option git "))
2963 parse_option();
2964 else if (!prefixcmp(command_buf.buf, "option "))
2965 /* ignore non-git options*/;
2966 else
2967 die("Unsupported command: %s", command_buf.buf);
2970 /* argv hasn't been parsed yet, do so */
2971 if (!seen_data_command)
2972 parse_argv();
2974 end_packfile();
2976 dump_branches();
2977 dump_tags();
2978 unkeep_all_packs();
2979 dump_marks();
2981 if (pack_edges)
2982 fclose(pack_edges);
2984 if (show_stats) {
2985 uintmax_t total_count = 0, duplicate_count = 0;
2986 for (i = 0; i < ARRAY_SIZE(object_count_by_type); i++)
2987 total_count += object_count_by_type[i];
2988 for (i = 0; i < ARRAY_SIZE(duplicate_count_by_type); i++)
2989 duplicate_count += duplicate_count_by_type[i];
2991 fprintf(stderr, "%s statistics:\n", argv[0]);
2992 fprintf(stderr, "---------------------------------------------------------------------\n");
2993 fprintf(stderr, "Alloc'd objects: %10" PRIuMAX "\n", alloc_count);
2994 fprintf(stderr, "Total objects: %10" PRIuMAX " (%10" PRIuMAX " duplicates )\n", total_count, duplicate_count);
2995 fprintf(stderr, " blobs : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas)\n", object_count_by_type[OBJ_BLOB], duplicate_count_by_type[OBJ_BLOB], delta_count_by_type[OBJ_BLOB]);
2996 fprintf(stderr, " trees : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas)\n", object_count_by_type[OBJ_TREE], duplicate_count_by_type[OBJ_TREE], delta_count_by_type[OBJ_TREE]);
2997 fprintf(stderr, " commits: %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas)\n", object_count_by_type[OBJ_COMMIT], duplicate_count_by_type[OBJ_COMMIT], delta_count_by_type[OBJ_COMMIT]);
2998 fprintf(stderr, " tags : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas)\n", object_count_by_type[OBJ_TAG], duplicate_count_by_type[OBJ_TAG], delta_count_by_type[OBJ_TAG]);
2999 fprintf(stderr, "Total branches: %10lu (%10lu loads )\n", branch_count, branch_load_count);
3000 fprintf(stderr, " marks: %10" PRIuMAX " (%10" PRIuMAX " unique )\n", (((uintmax_t)1) << marks->shift) * 1024, marks_set_count);
3001 fprintf(stderr, " atoms: %10u\n", atom_cnt);
3002 fprintf(stderr, "Memory total: %10" PRIuMAX " KiB\n", (total_allocd + alloc_count*sizeof(struct object_entry))/1024);
3003 fprintf(stderr, " pools: %10lu KiB\n", (unsigned long)(total_allocd/1024));
3004 fprintf(stderr, " objects: %10" PRIuMAX " KiB\n", (alloc_count*sizeof(struct object_entry))/1024);
3005 fprintf(stderr, "---------------------------------------------------------------------\n");
3006 pack_report();
3007 fprintf(stderr, "---------------------------------------------------------------------\n");
3008 fprintf(stderr, "\n");
3011 return failure ? 1 : 0;