Update 1.7.0.1 release notes
[git.git] / fast-import.c
blobb477dc6a8f8104cecf21b68375b7c5cf7ab8842c
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 object_entry *next;
168 uint32_t offset;
169 uint32_t type : TYPE_BITS,
170 pack_id : PACK_ID_BITS,
171 depth : DEPTH_BITS;
172 unsigned char sha1[20];
175 struct object_entry_pool
177 struct object_entry_pool *next_pool;
178 struct object_entry *next_free;
179 struct object_entry *end;
180 struct object_entry entries[FLEX_ARRAY]; /* more */
183 struct mark_set
185 union {
186 struct object_entry *marked[1024];
187 struct mark_set *sets[1024];
188 } data;
189 unsigned int shift;
192 struct last_object
194 struct strbuf data;
195 uint32_t offset;
196 unsigned int depth;
197 unsigned no_swap : 1;
200 struct mem_pool
202 struct mem_pool *next_pool;
203 char *next_free;
204 char *end;
205 uintmax_t space[FLEX_ARRAY]; /* more */
208 struct atom_str
210 struct atom_str *next_atom;
211 unsigned short str_len;
212 char str_dat[FLEX_ARRAY]; /* more */
215 struct tree_content;
216 struct tree_entry
218 struct tree_content *tree;
219 struct atom_str *name;
220 struct tree_entry_ms
222 uint16_t mode;
223 unsigned char sha1[20];
224 } versions[2];
227 struct tree_content
229 unsigned int entry_capacity; /* must match avail_tree_content */
230 unsigned int entry_count;
231 unsigned int delta_depth;
232 struct tree_entry *entries[FLEX_ARRAY]; /* more */
235 struct avail_tree_content
237 unsigned int entry_capacity; /* must match tree_content */
238 struct avail_tree_content *next_avail;
241 struct branch
243 struct branch *table_next_branch;
244 struct branch *active_next_branch;
245 const char *name;
246 struct tree_entry branch_tree;
247 uintmax_t last_commit;
248 uintmax_t num_notes;
249 unsigned active : 1;
250 unsigned pack_id : PACK_ID_BITS;
251 unsigned char sha1[20];
254 struct tag
256 struct tag *next_tag;
257 const char *name;
258 unsigned int pack_id;
259 unsigned char sha1[20];
262 struct hash_list
264 struct hash_list *next;
265 unsigned char sha1[20];
268 typedef enum {
269 WHENSPEC_RAW = 1,
270 WHENSPEC_RFC2822,
271 WHENSPEC_NOW,
272 } whenspec_type;
274 struct recent_command
276 struct recent_command *prev;
277 struct recent_command *next;
278 char *buf;
281 /* Configured limits on output */
282 static unsigned long max_depth = 10;
283 static off_t max_packsize = (1LL << 32) - 1;
284 static uintmax_t big_file_threshold = 512 * 1024 * 1024;
285 static int force_update;
286 static int pack_compression_level = Z_DEFAULT_COMPRESSION;
287 static int pack_compression_seen;
289 /* Stats and misc. counters */
290 static uintmax_t alloc_count;
291 static uintmax_t marks_set_count;
292 static uintmax_t object_count_by_type[1 << TYPE_BITS];
293 static uintmax_t duplicate_count_by_type[1 << TYPE_BITS];
294 static uintmax_t delta_count_by_type[1 << TYPE_BITS];
295 static unsigned long object_count;
296 static unsigned long branch_count;
297 static unsigned long branch_load_count;
298 static int failure;
299 static FILE *pack_edges;
300 static unsigned int show_stats = 1;
301 static int global_argc;
302 static const char **global_argv;
304 /* Memory pools */
305 static size_t mem_pool_alloc = 2*1024*1024 - sizeof(struct mem_pool);
306 static size_t total_allocd;
307 static struct mem_pool *mem_pool;
309 /* Atom management */
310 static unsigned int atom_table_sz = 4451;
311 static unsigned int atom_cnt;
312 static struct atom_str **atom_table;
314 /* The .pack file being generated */
315 static unsigned int pack_id;
316 static struct packed_git *pack_data;
317 static struct packed_git **all_packs;
318 static unsigned long 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->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->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->sha1))
546 return e;
547 p = e;
548 e = e->next;
551 e = new_object(sha1);
552 e->next = NULL;
553 e->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;
843 hdr.hdr_signature = htonl(PACK_SIGNATURE);
844 hdr.hdr_version = htonl(2);
845 hdr.hdr_entries = 0;
846 write_or_die(p->pack_fd, &hdr, sizeof(hdr));
848 pack_data = p;
849 pack_size = sizeof(hdr);
850 object_count = 0;
852 all_packs = xrealloc(all_packs, sizeof(*all_packs) * (pack_id + 1));
853 all_packs[pack_id] = p;
856 static int oecmp (const void *a_, const void *b_)
858 struct object_entry *a = *((struct object_entry**)a_);
859 struct object_entry *b = *((struct object_entry**)b_);
860 return hashcmp(a->sha1, b->sha1);
863 static char *create_index(void)
865 static char tmpfile[PATH_MAX];
866 git_SHA_CTX ctx;
867 struct sha1file *f;
868 struct object_entry **idx, **c, **last, *e;
869 struct object_entry_pool *o;
870 uint32_t array[256];
871 int i, idx_fd;
873 /* Build the sorted table of object IDs. */
874 idx = xmalloc(object_count * sizeof(struct object_entry*));
875 c = idx;
876 for (o = blocks; o; o = o->next_pool)
877 for (e = o->next_free; e-- != o->entries;)
878 if (pack_id == e->pack_id)
879 *c++ = e;
880 last = idx + object_count;
881 if (c != last)
882 die("internal consistency error creating the index");
883 qsort(idx, object_count, sizeof(struct object_entry*), oecmp);
885 /* Generate the fan-out array. */
886 c = idx;
887 for (i = 0; i < 256; i++) {
888 struct object_entry **next = c;
889 while (next < last) {
890 if ((*next)->sha1[0] != i)
891 break;
892 next++;
894 array[i] = htonl(next - idx);
895 c = next;
898 idx_fd = odb_mkstemp(tmpfile, sizeof(tmpfile),
899 "pack/tmp_idx_XXXXXX");
900 f = sha1fd(idx_fd, tmpfile);
901 sha1write(f, array, 256 * sizeof(int));
902 git_SHA1_Init(&ctx);
903 for (c = idx; c != last; c++) {
904 uint32_t offset = htonl((*c)->offset);
905 sha1write(f, &offset, 4);
906 sha1write(f, (*c)->sha1, sizeof((*c)->sha1));
907 git_SHA1_Update(&ctx, (*c)->sha1, 20);
909 sha1write(f, pack_data->sha1, sizeof(pack_data->sha1));
910 sha1close(f, NULL, CSUM_FSYNC);
911 free(idx);
912 git_SHA1_Final(pack_data->sha1, &ctx);
913 return tmpfile;
916 static char *keep_pack(char *curr_index_name)
918 static char name[PATH_MAX];
919 static const char *keep_msg = "fast-import";
920 int keep_fd;
922 keep_fd = odb_pack_keep(name, sizeof(name), pack_data->sha1);
923 if (keep_fd < 0)
924 die_errno("cannot create keep file");
925 write_or_die(keep_fd, keep_msg, strlen(keep_msg));
926 if (close(keep_fd))
927 die_errno("failed to write keep file");
929 snprintf(name, sizeof(name), "%s/pack/pack-%s.pack",
930 get_object_directory(), sha1_to_hex(pack_data->sha1));
931 if (move_temp_to_file(pack_data->pack_name, name))
932 die("cannot store pack file");
934 snprintf(name, sizeof(name), "%s/pack/pack-%s.idx",
935 get_object_directory(), sha1_to_hex(pack_data->sha1));
936 if (move_temp_to_file(curr_index_name, name))
937 die("cannot store index file");
938 return name;
941 static void unkeep_all_packs(void)
943 static char name[PATH_MAX];
944 int k;
946 for (k = 0; k < pack_id; k++) {
947 struct packed_git *p = all_packs[k];
948 snprintf(name, sizeof(name), "%s/pack/pack-%s.keep",
949 get_object_directory(), sha1_to_hex(p->sha1));
950 unlink_or_warn(name);
954 static void end_packfile(void)
956 struct packed_git *old_p = pack_data, *new_p;
958 clear_delta_base_cache();
959 if (object_count) {
960 char *idx_name;
961 int i;
962 struct branch *b;
963 struct tag *t;
965 close_pack_windows(pack_data);
966 fixup_pack_header_footer(pack_data->pack_fd, pack_data->sha1,
967 pack_data->pack_name, object_count,
968 NULL, 0);
969 close(pack_data->pack_fd);
970 idx_name = keep_pack(create_index());
972 /* Register the packfile with core git's machinery. */
973 new_p = add_packed_git(idx_name, strlen(idx_name), 1);
974 if (!new_p)
975 die("core git rejected index %s", idx_name);
976 all_packs[pack_id] = new_p;
977 install_packed_git(new_p);
979 /* Print the boundary */
980 if (pack_edges) {
981 fprintf(pack_edges, "%s:", new_p->pack_name);
982 for (i = 0; i < branch_table_sz; i++) {
983 for (b = branch_table[i]; b; b = b->table_next_branch) {
984 if (b->pack_id == pack_id)
985 fprintf(pack_edges, " %s", sha1_to_hex(b->sha1));
988 for (t = first_tag; t; t = t->next_tag) {
989 if (t->pack_id == pack_id)
990 fprintf(pack_edges, " %s", sha1_to_hex(t->sha1));
992 fputc('\n', pack_edges);
993 fflush(pack_edges);
996 pack_id++;
998 else {
999 close(old_p->pack_fd);
1000 unlink_or_warn(old_p->pack_name);
1002 free(old_p);
1004 /* We can't carry a delta across packfiles. */
1005 strbuf_release(&last_blob.data);
1006 last_blob.offset = 0;
1007 last_blob.depth = 0;
1010 static void cycle_packfile(void)
1012 end_packfile();
1013 start_packfile();
1016 static size_t encode_header(
1017 enum object_type type,
1018 uintmax_t size,
1019 unsigned char *hdr)
1021 int n = 1;
1022 unsigned char c;
1024 if (type < OBJ_COMMIT || type > OBJ_REF_DELTA)
1025 die("bad type %d", type);
1027 c = (type << 4) | (size & 15);
1028 size >>= 4;
1029 while (size) {
1030 *hdr++ = c | 0x80;
1031 c = size & 0x7f;
1032 size >>= 7;
1033 n++;
1035 *hdr = c;
1036 return n;
1039 static int store_object(
1040 enum object_type type,
1041 struct strbuf *dat,
1042 struct last_object *last,
1043 unsigned char *sha1out,
1044 uintmax_t mark)
1046 void *out, *delta;
1047 struct object_entry *e;
1048 unsigned char hdr[96];
1049 unsigned char sha1[20];
1050 unsigned long hdrlen, deltalen;
1051 git_SHA_CTX c;
1052 z_stream s;
1054 hdrlen = sprintf((char *)hdr,"%s %lu", typename(type),
1055 (unsigned long)dat->len) + 1;
1056 git_SHA1_Init(&c);
1057 git_SHA1_Update(&c, hdr, hdrlen);
1058 git_SHA1_Update(&c, dat->buf, dat->len);
1059 git_SHA1_Final(sha1, &c);
1060 if (sha1out)
1061 hashcpy(sha1out, sha1);
1063 e = insert_object(sha1);
1064 if (mark)
1065 insert_mark(mark, e);
1066 if (e->offset) {
1067 duplicate_count_by_type[type]++;
1068 return 1;
1069 } else if (find_sha1_pack(sha1, packed_git)) {
1070 e->type = type;
1071 e->pack_id = MAX_PACK_ID;
1072 e->offset = 1; /* just not zero! */
1073 duplicate_count_by_type[type]++;
1074 return 1;
1077 if (last && last->data.buf && last->depth < max_depth) {
1078 delta = diff_delta(last->data.buf, last->data.len,
1079 dat->buf, dat->len,
1080 &deltalen, 0);
1081 if (delta && deltalen >= dat->len) {
1082 free(delta);
1083 delta = NULL;
1085 } else
1086 delta = NULL;
1088 memset(&s, 0, sizeof(s));
1089 deflateInit(&s, pack_compression_level);
1090 if (delta) {
1091 s.next_in = delta;
1092 s.avail_in = deltalen;
1093 } else {
1094 s.next_in = (void *)dat->buf;
1095 s.avail_in = dat->len;
1097 s.avail_out = deflateBound(&s, s.avail_in);
1098 s.next_out = out = xmalloc(s.avail_out);
1099 while (deflate(&s, Z_FINISH) == Z_OK)
1100 /* nothing */;
1101 deflateEnd(&s);
1103 /* Determine if we should auto-checkpoint. */
1104 if ((pack_size + 60 + s.total_out) > max_packsize
1105 || (pack_size + 60 + s.total_out) < pack_size) {
1107 /* This new object needs to *not* have the current pack_id. */
1108 e->pack_id = pack_id + 1;
1109 cycle_packfile();
1111 /* We cannot carry a delta into the new pack. */
1112 if (delta) {
1113 free(delta);
1114 delta = NULL;
1116 memset(&s, 0, sizeof(s));
1117 deflateInit(&s, pack_compression_level);
1118 s.next_in = (void *)dat->buf;
1119 s.avail_in = dat->len;
1120 s.avail_out = deflateBound(&s, s.avail_in);
1121 s.next_out = out = xrealloc(out, s.avail_out);
1122 while (deflate(&s, Z_FINISH) == Z_OK)
1123 /* nothing */;
1124 deflateEnd(&s);
1128 e->type = type;
1129 e->pack_id = pack_id;
1130 e->offset = pack_size;
1131 object_count++;
1132 object_count_by_type[type]++;
1134 if (delta) {
1135 unsigned long ofs = e->offset - last->offset;
1136 unsigned pos = sizeof(hdr) - 1;
1138 delta_count_by_type[type]++;
1139 e->depth = last->depth + 1;
1141 hdrlen = encode_header(OBJ_OFS_DELTA, deltalen, hdr);
1142 write_or_die(pack_data->pack_fd, hdr, hdrlen);
1143 pack_size += hdrlen;
1145 hdr[pos] = ofs & 127;
1146 while (ofs >>= 7)
1147 hdr[--pos] = 128 | (--ofs & 127);
1148 write_or_die(pack_data->pack_fd, hdr + pos, sizeof(hdr) - pos);
1149 pack_size += sizeof(hdr) - pos;
1150 } else {
1151 e->depth = 0;
1152 hdrlen = encode_header(type, dat->len, hdr);
1153 write_or_die(pack_data->pack_fd, hdr, hdrlen);
1154 pack_size += hdrlen;
1157 write_or_die(pack_data->pack_fd, out, s.total_out);
1158 pack_size += s.total_out;
1160 free(out);
1161 free(delta);
1162 if (last) {
1163 if (last->no_swap) {
1164 last->data = *dat;
1165 } else {
1166 strbuf_swap(&last->data, dat);
1168 last->offset = e->offset;
1169 last->depth = e->depth;
1171 return 0;
1174 static void truncate_pack(off_t to)
1176 if (ftruncate(pack_data->pack_fd, to)
1177 || lseek(pack_data->pack_fd, to, SEEK_SET) != to)
1178 die_errno("cannot truncate pack to skip duplicate");
1179 pack_size = to;
1182 static void stream_blob(uintmax_t len, unsigned char *sha1out, uintmax_t mark)
1184 size_t in_sz = 64 * 1024, out_sz = 64 * 1024;
1185 unsigned char *in_buf = xmalloc(in_sz);
1186 unsigned char *out_buf = xmalloc(out_sz);
1187 struct object_entry *e;
1188 unsigned char sha1[20];
1189 unsigned long hdrlen;
1190 off_t offset;
1191 git_SHA_CTX c;
1192 z_stream s;
1193 int status = Z_OK;
1195 /* Determine if we should auto-checkpoint. */
1196 if ((pack_size + 60 + len) > max_packsize
1197 || (pack_size + 60 + len) < pack_size)
1198 cycle_packfile();
1200 offset = pack_size;
1202 hdrlen = snprintf((char *)out_buf, out_sz, "blob %" PRIuMAX, len) + 1;
1203 if (out_sz <= hdrlen)
1204 die("impossibly large object header");
1206 git_SHA1_Init(&c);
1207 git_SHA1_Update(&c, out_buf, hdrlen);
1209 memset(&s, 0, sizeof(s));
1210 deflateInit(&s, pack_compression_level);
1212 hdrlen = encode_header(OBJ_BLOB, len, out_buf);
1213 if (out_sz <= hdrlen)
1214 die("impossibly large object header");
1216 s.next_out = out_buf + hdrlen;
1217 s.avail_out = out_sz - hdrlen;
1219 while (status != Z_STREAM_END) {
1220 if (0 < len && !s.avail_in) {
1221 size_t cnt = in_sz < len ? in_sz : (size_t)len;
1222 size_t n = fread(in_buf, 1, cnt, stdin);
1223 if (!n && feof(stdin))
1224 die("EOF in data (%" PRIuMAX " bytes remaining)", len);
1226 git_SHA1_Update(&c, in_buf, n);
1227 s.next_in = in_buf;
1228 s.avail_in = n;
1229 len -= n;
1232 status = deflate(&s, len ? 0 : Z_FINISH);
1234 if (!s.avail_out || status == Z_STREAM_END) {
1235 size_t n = s.next_out - out_buf;
1236 write_or_die(pack_data->pack_fd, out_buf, n);
1237 pack_size += n;
1238 s.next_out = out_buf;
1239 s.avail_out = out_sz;
1242 switch (status) {
1243 case Z_OK:
1244 case Z_BUF_ERROR:
1245 case Z_STREAM_END:
1246 continue;
1247 default:
1248 die("unexpected deflate failure: %d", status);
1251 deflateEnd(&s);
1252 git_SHA1_Final(sha1, &c);
1254 if (sha1out)
1255 hashcpy(sha1out, sha1);
1257 e = insert_object(sha1);
1259 if (mark)
1260 insert_mark(mark, e);
1262 if (e->offset) {
1263 duplicate_count_by_type[OBJ_BLOB]++;
1264 truncate_pack(offset);
1266 } else if (find_sha1_pack(sha1, packed_git)) {
1267 e->type = OBJ_BLOB;
1268 e->pack_id = MAX_PACK_ID;
1269 e->offset = 1; /* just not zero! */
1270 duplicate_count_by_type[OBJ_BLOB]++;
1271 truncate_pack(offset);
1273 } else {
1274 e->depth = 0;
1275 e->type = OBJ_BLOB;
1276 e->pack_id = pack_id;
1277 e->offset = offset;
1278 object_count++;
1279 object_count_by_type[OBJ_BLOB]++;
1282 free(in_buf);
1283 free(out_buf);
1286 /* All calls must be guarded by find_object() or find_mark() to
1287 * ensure the 'struct object_entry' passed was written by this
1288 * process instance. We unpack the entry by the offset, avoiding
1289 * the need for the corresponding .idx file. This unpacking rule
1290 * works because we only use OBJ_REF_DELTA within the packfiles
1291 * created by fast-import.
1293 * oe must not be NULL. Such an oe usually comes from giving
1294 * an unknown SHA-1 to find_object() or an undefined mark to
1295 * find_mark(). Callers must test for this condition and use
1296 * the standard read_sha1_file() when it happens.
1298 * oe->pack_id must not be MAX_PACK_ID. Such an oe is usually from
1299 * find_mark(), where the mark was reloaded from an existing marks
1300 * file and is referencing an object that this fast-import process
1301 * instance did not write out to a packfile. Callers must test for
1302 * this condition and use read_sha1_file() instead.
1304 static void *gfi_unpack_entry(
1305 struct object_entry *oe,
1306 unsigned long *sizep)
1308 enum object_type type;
1309 struct packed_git *p = all_packs[oe->pack_id];
1310 if (p == pack_data && p->pack_size < (pack_size + 20)) {
1311 /* The object is stored in the packfile we are writing to
1312 * and we have modified it since the last time we scanned
1313 * back to read a previously written object. If an old
1314 * window covered [p->pack_size, p->pack_size + 20) its
1315 * data is stale and is not valid. Closing all windows
1316 * and updating the packfile length ensures we can read
1317 * the newly written data.
1319 close_pack_windows(p);
1321 /* We have to offer 20 bytes additional on the end of
1322 * the packfile as the core unpacker code assumes the
1323 * footer is present at the file end and must promise
1324 * at least 20 bytes within any window it maps. But
1325 * we don't actually create the footer here.
1327 p->pack_size = pack_size + 20;
1329 return unpack_entry(p, oe->offset, &type, sizep);
1332 static const char *get_mode(const char *str, uint16_t *modep)
1334 unsigned char c;
1335 uint16_t mode = 0;
1337 while ((c = *str++) != ' ') {
1338 if (c < '0' || c > '7')
1339 return NULL;
1340 mode = (mode << 3) + (c - '0');
1342 *modep = mode;
1343 return str;
1346 static void load_tree(struct tree_entry *root)
1348 unsigned char *sha1 = root->versions[1].sha1;
1349 struct object_entry *myoe;
1350 struct tree_content *t;
1351 unsigned long size;
1352 char *buf;
1353 const char *c;
1355 root->tree = t = new_tree_content(8);
1356 if (is_null_sha1(sha1))
1357 return;
1359 myoe = find_object(sha1);
1360 if (myoe && myoe->pack_id != MAX_PACK_ID) {
1361 if (myoe->type != OBJ_TREE)
1362 die("Not a tree: %s", sha1_to_hex(sha1));
1363 t->delta_depth = myoe->depth;
1364 buf = gfi_unpack_entry(myoe, &size);
1365 if (!buf)
1366 die("Can't load tree %s", sha1_to_hex(sha1));
1367 } else {
1368 enum object_type type;
1369 buf = read_sha1_file(sha1, &type, &size);
1370 if (!buf || type != OBJ_TREE)
1371 die("Can't load tree %s", sha1_to_hex(sha1));
1374 c = buf;
1375 while (c != (buf + size)) {
1376 struct tree_entry *e = new_tree_entry();
1378 if (t->entry_count == t->entry_capacity)
1379 root->tree = t = grow_tree_content(t, t->entry_count);
1380 t->entries[t->entry_count++] = e;
1382 e->tree = NULL;
1383 c = get_mode(c, &e->versions[1].mode);
1384 if (!c)
1385 die("Corrupt mode in %s", sha1_to_hex(sha1));
1386 e->versions[0].mode = e->versions[1].mode;
1387 e->name = to_atom(c, strlen(c));
1388 c += e->name->str_len + 1;
1389 hashcpy(e->versions[0].sha1, (unsigned char *)c);
1390 hashcpy(e->versions[1].sha1, (unsigned char *)c);
1391 c += 20;
1393 free(buf);
1396 static int tecmp0 (const void *_a, const void *_b)
1398 struct tree_entry *a = *((struct tree_entry**)_a);
1399 struct tree_entry *b = *((struct tree_entry**)_b);
1400 return base_name_compare(
1401 a->name->str_dat, a->name->str_len, a->versions[0].mode,
1402 b->name->str_dat, b->name->str_len, b->versions[0].mode);
1405 static int tecmp1 (const void *_a, const void *_b)
1407 struct tree_entry *a = *((struct tree_entry**)_a);
1408 struct tree_entry *b = *((struct tree_entry**)_b);
1409 return base_name_compare(
1410 a->name->str_dat, a->name->str_len, a->versions[1].mode,
1411 b->name->str_dat, b->name->str_len, b->versions[1].mode);
1414 static void mktree(struct tree_content *t, int v, struct strbuf *b)
1416 size_t maxlen = 0;
1417 unsigned int i;
1419 if (!v)
1420 qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp0);
1421 else
1422 qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp1);
1424 for (i = 0; i < t->entry_count; i++) {
1425 if (t->entries[i]->versions[v].mode)
1426 maxlen += t->entries[i]->name->str_len + 34;
1429 strbuf_reset(b);
1430 strbuf_grow(b, maxlen);
1431 for (i = 0; i < t->entry_count; i++) {
1432 struct tree_entry *e = t->entries[i];
1433 if (!e->versions[v].mode)
1434 continue;
1435 strbuf_addf(b, "%o %s%c", (unsigned int)e->versions[v].mode,
1436 e->name->str_dat, '\0');
1437 strbuf_add(b, e->versions[v].sha1, 20);
1441 static void store_tree(struct tree_entry *root)
1443 struct tree_content *t = root->tree;
1444 unsigned int i, j, del;
1445 struct last_object lo = { STRBUF_INIT, 0, 0, /* no_swap */ 1 };
1446 struct object_entry *le;
1448 if (!is_null_sha1(root->versions[1].sha1))
1449 return;
1451 for (i = 0; i < t->entry_count; i++) {
1452 if (t->entries[i]->tree)
1453 store_tree(t->entries[i]);
1456 le = find_object(root->versions[0].sha1);
1457 if (S_ISDIR(root->versions[0].mode) && le && le->pack_id == pack_id) {
1458 mktree(t, 0, &old_tree);
1459 lo.data = old_tree;
1460 lo.offset = le->offset;
1461 lo.depth = t->delta_depth;
1464 mktree(t, 1, &new_tree);
1465 store_object(OBJ_TREE, &new_tree, &lo, root->versions[1].sha1, 0);
1467 t->delta_depth = lo.depth;
1468 for (i = 0, j = 0, del = 0; i < t->entry_count; i++) {
1469 struct tree_entry *e = t->entries[i];
1470 if (e->versions[1].mode) {
1471 e->versions[0].mode = e->versions[1].mode;
1472 hashcpy(e->versions[0].sha1, e->versions[1].sha1);
1473 t->entries[j++] = e;
1474 } else {
1475 release_tree_entry(e);
1476 del++;
1479 t->entry_count -= del;
1482 static int tree_content_set(
1483 struct tree_entry *root,
1484 const char *p,
1485 const unsigned char *sha1,
1486 const uint16_t mode,
1487 struct tree_content *subtree)
1489 struct tree_content *t = root->tree;
1490 const char *slash1;
1491 unsigned int i, n;
1492 struct tree_entry *e;
1494 slash1 = strchr(p, '/');
1495 if (slash1)
1496 n = slash1 - p;
1497 else
1498 n = strlen(p);
1499 if (!n)
1500 die("Empty path component found in input");
1501 if (!slash1 && !S_ISDIR(mode) && subtree)
1502 die("Non-directories cannot have subtrees");
1504 for (i = 0; i < t->entry_count; i++) {
1505 e = t->entries[i];
1506 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
1507 if (!slash1) {
1508 if (!S_ISDIR(mode)
1509 && e->versions[1].mode == mode
1510 && !hashcmp(e->versions[1].sha1, sha1))
1511 return 0;
1512 e->versions[1].mode = mode;
1513 hashcpy(e->versions[1].sha1, sha1);
1514 if (e->tree)
1515 release_tree_content_recursive(e->tree);
1516 e->tree = subtree;
1517 hashclr(root->versions[1].sha1);
1518 return 1;
1520 if (!S_ISDIR(e->versions[1].mode)) {
1521 e->tree = new_tree_content(8);
1522 e->versions[1].mode = S_IFDIR;
1524 if (!e->tree)
1525 load_tree(e);
1526 if (tree_content_set(e, slash1 + 1, sha1, mode, subtree)) {
1527 hashclr(root->versions[1].sha1);
1528 return 1;
1530 return 0;
1534 if (t->entry_count == t->entry_capacity)
1535 root->tree = t = grow_tree_content(t, t->entry_count);
1536 e = new_tree_entry();
1537 e->name = to_atom(p, n);
1538 e->versions[0].mode = 0;
1539 hashclr(e->versions[0].sha1);
1540 t->entries[t->entry_count++] = e;
1541 if (slash1) {
1542 e->tree = new_tree_content(8);
1543 e->versions[1].mode = S_IFDIR;
1544 tree_content_set(e, slash1 + 1, sha1, mode, subtree);
1545 } else {
1546 e->tree = subtree;
1547 e->versions[1].mode = mode;
1548 hashcpy(e->versions[1].sha1, sha1);
1550 hashclr(root->versions[1].sha1);
1551 return 1;
1554 static int tree_content_remove(
1555 struct tree_entry *root,
1556 const char *p,
1557 struct tree_entry *backup_leaf)
1559 struct tree_content *t = root->tree;
1560 const char *slash1;
1561 unsigned int i, n;
1562 struct tree_entry *e;
1564 slash1 = strchr(p, '/');
1565 if (slash1)
1566 n = slash1 - p;
1567 else
1568 n = strlen(p);
1570 for (i = 0; i < t->entry_count; i++) {
1571 e = t->entries[i];
1572 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
1573 if (!slash1 || !S_ISDIR(e->versions[1].mode))
1574 goto del_entry;
1575 if (!e->tree)
1576 load_tree(e);
1577 if (tree_content_remove(e, slash1 + 1, backup_leaf)) {
1578 for (n = 0; n < e->tree->entry_count; n++) {
1579 if (e->tree->entries[n]->versions[1].mode) {
1580 hashclr(root->versions[1].sha1);
1581 return 1;
1584 backup_leaf = NULL;
1585 goto del_entry;
1587 return 0;
1590 return 0;
1592 del_entry:
1593 if (backup_leaf)
1594 memcpy(backup_leaf, e, sizeof(*backup_leaf));
1595 else if (e->tree)
1596 release_tree_content_recursive(e->tree);
1597 e->tree = NULL;
1598 e->versions[1].mode = 0;
1599 hashclr(e->versions[1].sha1);
1600 hashclr(root->versions[1].sha1);
1601 return 1;
1604 static int tree_content_get(
1605 struct tree_entry *root,
1606 const char *p,
1607 struct tree_entry *leaf)
1609 struct tree_content *t = root->tree;
1610 const char *slash1;
1611 unsigned int i, n;
1612 struct tree_entry *e;
1614 slash1 = strchr(p, '/');
1615 if (slash1)
1616 n = slash1 - p;
1617 else
1618 n = strlen(p);
1620 for (i = 0; i < t->entry_count; i++) {
1621 e = t->entries[i];
1622 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
1623 if (!slash1) {
1624 memcpy(leaf, e, sizeof(*leaf));
1625 if (e->tree && is_null_sha1(e->versions[1].sha1))
1626 leaf->tree = dup_tree_content(e->tree);
1627 else
1628 leaf->tree = NULL;
1629 return 1;
1631 if (!S_ISDIR(e->versions[1].mode))
1632 return 0;
1633 if (!e->tree)
1634 load_tree(e);
1635 return tree_content_get(e, slash1 + 1, leaf);
1638 return 0;
1641 static int update_branch(struct branch *b)
1643 static const char *msg = "fast-import";
1644 struct ref_lock *lock;
1645 unsigned char old_sha1[20];
1647 if (is_null_sha1(b->sha1))
1648 return 0;
1649 if (read_ref(b->name, old_sha1))
1650 hashclr(old_sha1);
1651 lock = lock_any_ref_for_update(b->name, old_sha1, 0);
1652 if (!lock)
1653 return error("Unable to lock %s", b->name);
1654 if (!force_update && !is_null_sha1(old_sha1)) {
1655 struct commit *old_cmit, *new_cmit;
1657 old_cmit = lookup_commit_reference_gently(old_sha1, 0);
1658 new_cmit = lookup_commit_reference_gently(b->sha1, 0);
1659 if (!old_cmit || !new_cmit) {
1660 unlock_ref(lock);
1661 return error("Branch %s is missing commits.", b->name);
1664 if (!in_merge_bases(old_cmit, &new_cmit, 1)) {
1665 unlock_ref(lock);
1666 warning("Not updating %s"
1667 " (new tip %s does not contain %s)",
1668 b->name, sha1_to_hex(b->sha1), sha1_to_hex(old_sha1));
1669 return -1;
1672 if (write_ref_sha1(lock, b->sha1, msg) < 0)
1673 return error("Unable to update %s", b->name);
1674 return 0;
1677 static void dump_branches(void)
1679 unsigned int i;
1680 struct branch *b;
1682 for (i = 0; i < branch_table_sz; i++) {
1683 for (b = branch_table[i]; b; b = b->table_next_branch)
1684 failure |= update_branch(b);
1688 static void dump_tags(void)
1690 static const char *msg = "fast-import";
1691 struct tag *t;
1692 struct ref_lock *lock;
1693 char ref_name[PATH_MAX];
1695 for (t = first_tag; t; t = t->next_tag) {
1696 sprintf(ref_name, "tags/%s", t->name);
1697 lock = lock_ref_sha1(ref_name, NULL);
1698 if (!lock || write_ref_sha1(lock, t->sha1, msg) < 0)
1699 failure |= error("Unable to update %s", ref_name);
1703 static void dump_marks_helper(FILE *f,
1704 uintmax_t base,
1705 struct mark_set *m)
1707 uintmax_t k;
1708 if (m->shift) {
1709 for (k = 0; k < 1024; k++) {
1710 if (m->data.sets[k])
1711 dump_marks_helper(f, (base + k) << m->shift,
1712 m->data.sets[k]);
1714 } else {
1715 for (k = 0; k < 1024; k++) {
1716 if (m->data.marked[k])
1717 fprintf(f, ":%" PRIuMAX " %s\n", base + k,
1718 sha1_to_hex(m->data.marked[k]->sha1));
1723 static void dump_marks(void)
1725 static struct lock_file mark_lock;
1726 int mark_fd;
1727 FILE *f;
1729 if (!export_marks_file)
1730 return;
1732 mark_fd = hold_lock_file_for_update(&mark_lock, export_marks_file, 0);
1733 if (mark_fd < 0) {
1734 failure |= error("Unable to write marks file %s: %s",
1735 export_marks_file, strerror(errno));
1736 return;
1739 f = fdopen(mark_fd, "w");
1740 if (!f) {
1741 int saved_errno = errno;
1742 rollback_lock_file(&mark_lock);
1743 failure |= error("Unable to write marks file %s: %s",
1744 export_marks_file, strerror(saved_errno));
1745 return;
1749 * Since the lock file was fdopen()'ed, it should not be close()'ed.
1750 * Assign -1 to the lock file descriptor so that commit_lock_file()
1751 * won't try to close() it.
1753 mark_lock.fd = -1;
1755 dump_marks_helper(f, 0, marks);
1756 if (ferror(f) || fclose(f)) {
1757 int saved_errno = errno;
1758 rollback_lock_file(&mark_lock);
1759 failure |= error("Unable to write marks file %s: %s",
1760 export_marks_file, strerror(saved_errno));
1761 return;
1764 if (commit_lock_file(&mark_lock)) {
1765 int saved_errno = errno;
1766 rollback_lock_file(&mark_lock);
1767 failure |= error("Unable to commit marks file %s: %s",
1768 export_marks_file, strerror(saved_errno));
1769 return;
1773 static void read_marks(void)
1775 char line[512];
1776 FILE *f = fopen(import_marks_file, "r");
1777 if (!f)
1778 die_errno("cannot read '%s'", import_marks_file);
1779 while (fgets(line, sizeof(line), f)) {
1780 uintmax_t mark;
1781 char *end;
1782 unsigned char sha1[20];
1783 struct object_entry *e;
1785 end = strchr(line, '\n');
1786 if (line[0] != ':' || !end)
1787 die("corrupt mark line: %s", line);
1788 *end = 0;
1789 mark = strtoumax(line + 1, &end, 10);
1790 if (!mark || end == line + 1
1791 || *end != ' ' || get_sha1(end + 1, sha1))
1792 die("corrupt mark line: %s", line);
1793 e = find_object(sha1);
1794 if (!e) {
1795 enum object_type type = sha1_object_info(sha1, NULL);
1796 if (type < 0)
1797 die("object not found: %s", sha1_to_hex(sha1));
1798 e = insert_object(sha1);
1799 e->type = type;
1800 e->pack_id = MAX_PACK_ID;
1801 e->offset = 1; /* just not zero! */
1803 insert_mark(mark, e);
1805 fclose(f);
1809 static int read_next_command(void)
1811 static int stdin_eof = 0;
1813 if (stdin_eof) {
1814 unread_command_buf = 0;
1815 return EOF;
1818 do {
1819 if (unread_command_buf) {
1820 unread_command_buf = 0;
1821 } else {
1822 struct recent_command *rc;
1824 strbuf_detach(&command_buf, NULL);
1825 stdin_eof = strbuf_getline(&command_buf, stdin, '\n');
1826 if (stdin_eof)
1827 return EOF;
1829 if (!seen_data_command
1830 && prefixcmp(command_buf.buf, "feature ")
1831 && prefixcmp(command_buf.buf, "option ")) {
1832 parse_argv();
1835 rc = rc_free;
1836 if (rc)
1837 rc_free = rc->next;
1838 else {
1839 rc = cmd_hist.next;
1840 cmd_hist.next = rc->next;
1841 cmd_hist.next->prev = &cmd_hist;
1842 free(rc->buf);
1845 rc->buf = command_buf.buf;
1846 rc->prev = cmd_tail;
1847 rc->next = cmd_hist.prev;
1848 rc->prev->next = rc;
1849 cmd_tail = rc;
1851 } while (command_buf.buf[0] == '#');
1853 return 0;
1856 static void skip_optional_lf(void)
1858 int term_char = fgetc(stdin);
1859 if (term_char != '\n' && term_char != EOF)
1860 ungetc(term_char, stdin);
1863 static void parse_mark(void)
1865 if (!prefixcmp(command_buf.buf, "mark :")) {
1866 next_mark = strtoumax(command_buf.buf + 6, NULL, 10);
1867 read_next_command();
1869 else
1870 next_mark = 0;
1873 static int parse_data(struct strbuf *sb, uintmax_t limit, uintmax_t *len_res)
1875 strbuf_reset(sb);
1877 if (prefixcmp(command_buf.buf, "data "))
1878 die("Expected 'data n' command, found: %s", command_buf.buf);
1880 if (!prefixcmp(command_buf.buf + 5, "<<")) {
1881 char *term = xstrdup(command_buf.buf + 5 + 2);
1882 size_t term_len = command_buf.len - 5 - 2;
1884 strbuf_detach(&command_buf, NULL);
1885 for (;;) {
1886 if (strbuf_getline(&command_buf, stdin, '\n') == EOF)
1887 die("EOF in data (terminator '%s' not found)", term);
1888 if (term_len == command_buf.len
1889 && !strcmp(term, command_buf.buf))
1890 break;
1891 strbuf_addbuf(sb, &command_buf);
1892 strbuf_addch(sb, '\n');
1894 free(term);
1896 else {
1897 uintmax_t len = strtoumax(command_buf.buf + 5, NULL, 10);
1898 size_t n = 0, length = (size_t)len;
1900 if (limit && limit < len) {
1901 *len_res = len;
1902 return 0;
1904 if (length < len)
1905 die("data is too large to use in this context");
1907 while (n < length) {
1908 size_t s = strbuf_fread(sb, length - n, stdin);
1909 if (!s && feof(stdin))
1910 die("EOF in data (%lu bytes remaining)",
1911 (unsigned long)(length - n));
1912 n += s;
1916 skip_optional_lf();
1917 return 1;
1920 static int validate_raw_date(const char *src, char *result, int maxlen)
1922 const char *orig_src = src;
1923 char *endp;
1924 unsigned long num;
1926 errno = 0;
1928 num = strtoul(src, &endp, 10);
1929 /* NEEDSWORK: perhaps check for reasonable values? */
1930 if (errno || endp == src || *endp != ' ')
1931 return -1;
1933 src = endp + 1;
1934 if (*src != '-' && *src != '+')
1935 return -1;
1937 num = strtoul(src + 1, &endp, 10);
1938 if (errno || endp == src + 1 || *endp || (endp - orig_src) >= maxlen ||
1939 1400 < num)
1940 return -1;
1942 strcpy(result, orig_src);
1943 return 0;
1946 static char *parse_ident(const char *buf)
1948 const char *gt;
1949 size_t name_len;
1950 char *ident;
1952 gt = strrchr(buf, '>');
1953 if (!gt)
1954 die("Missing > in ident string: %s", buf);
1955 gt++;
1956 if (*gt != ' ')
1957 die("Missing space after > in ident string: %s", buf);
1958 gt++;
1959 name_len = gt - buf;
1960 ident = xmalloc(name_len + 24);
1961 strncpy(ident, buf, name_len);
1963 switch (whenspec) {
1964 case WHENSPEC_RAW:
1965 if (validate_raw_date(gt, ident + name_len, 24) < 0)
1966 die("Invalid raw date \"%s\" in ident: %s", gt, buf);
1967 break;
1968 case WHENSPEC_RFC2822:
1969 if (parse_date(gt, ident + name_len, 24) < 0)
1970 die("Invalid rfc2822 date \"%s\" in ident: %s", gt, buf);
1971 break;
1972 case WHENSPEC_NOW:
1973 if (strcmp("now", gt))
1974 die("Date in ident must be 'now': %s", buf);
1975 datestamp(ident + name_len, 24);
1976 break;
1979 return ident;
1982 static void parse_and_store_blob(
1983 struct last_object *last,
1984 unsigned char *sha1out,
1985 uintmax_t mark)
1987 static struct strbuf buf = STRBUF_INIT;
1988 uintmax_t len;
1990 if (parse_data(&buf, big_file_threshold, &len))
1991 store_object(OBJ_BLOB, &buf, last, sha1out, mark);
1992 else {
1993 if (last) {
1994 strbuf_release(&last->data);
1995 last->offset = 0;
1996 last->depth = 0;
1998 stream_blob(len, sha1out, mark);
1999 skip_optional_lf();
2003 static void parse_new_blob(void)
2005 read_next_command();
2006 parse_mark();
2007 parse_and_store_blob(&last_blob, NULL, next_mark);
2010 static void unload_one_branch(void)
2012 while (cur_active_branches
2013 && cur_active_branches >= max_active_branches) {
2014 uintmax_t min_commit = ULONG_MAX;
2015 struct branch *e, *l = NULL, *p = NULL;
2017 for (e = active_branches; e; e = e->active_next_branch) {
2018 if (e->last_commit < min_commit) {
2019 p = l;
2020 min_commit = e->last_commit;
2022 l = e;
2025 if (p) {
2026 e = p->active_next_branch;
2027 p->active_next_branch = e->active_next_branch;
2028 } else {
2029 e = active_branches;
2030 active_branches = e->active_next_branch;
2032 e->active = 0;
2033 e->active_next_branch = NULL;
2034 if (e->branch_tree.tree) {
2035 release_tree_content_recursive(e->branch_tree.tree);
2036 e->branch_tree.tree = NULL;
2038 cur_active_branches--;
2042 static void load_branch(struct branch *b)
2044 load_tree(&b->branch_tree);
2045 if (!b->active) {
2046 b->active = 1;
2047 b->active_next_branch = active_branches;
2048 active_branches = b;
2049 cur_active_branches++;
2050 branch_load_count++;
2054 static unsigned char convert_num_notes_to_fanout(uintmax_t num_notes)
2056 unsigned char fanout = 0;
2057 while ((num_notes >>= 8))
2058 fanout++;
2059 return fanout;
2062 static void construct_path_with_fanout(const char *hex_sha1,
2063 unsigned char fanout, char *path)
2065 unsigned int i = 0, j = 0;
2066 if (fanout >= 20)
2067 die("Too large fanout (%u)", fanout);
2068 while (fanout) {
2069 path[i++] = hex_sha1[j++];
2070 path[i++] = hex_sha1[j++];
2071 path[i++] = '/';
2072 fanout--;
2074 memcpy(path + i, hex_sha1 + j, 40 - j);
2075 path[i + 40 - j] = '\0';
2078 static uintmax_t do_change_note_fanout(
2079 struct tree_entry *orig_root, struct tree_entry *root,
2080 char *hex_sha1, unsigned int hex_sha1_len,
2081 char *fullpath, unsigned int fullpath_len,
2082 unsigned char fanout)
2084 struct tree_content *t = root->tree;
2085 struct tree_entry *e, leaf;
2086 unsigned int i, tmp_hex_sha1_len, tmp_fullpath_len;
2087 uintmax_t num_notes = 0;
2088 unsigned char sha1[20];
2089 char realpath[60];
2091 for (i = 0; t && i < t->entry_count; i++) {
2092 e = t->entries[i];
2093 tmp_hex_sha1_len = hex_sha1_len + e->name->str_len;
2094 tmp_fullpath_len = fullpath_len;
2097 * We're interested in EITHER existing note entries (entries
2098 * with exactly 40 hex chars in path, not including directory
2099 * separators), OR directory entries that may contain note
2100 * entries (with < 40 hex chars in path).
2101 * Also, each path component in a note entry must be a multiple
2102 * of 2 chars.
2104 if (!e->versions[1].mode ||
2105 tmp_hex_sha1_len > 40 ||
2106 e->name->str_len % 2)
2107 continue;
2109 /* This _may_ be a note entry, or a subdir containing notes */
2110 memcpy(hex_sha1 + hex_sha1_len, e->name->str_dat,
2111 e->name->str_len);
2112 if (tmp_fullpath_len)
2113 fullpath[tmp_fullpath_len++] = '/';
2114 memcpy(fullpath + tmp_fullpath_len, e->name->str_dat,
2115 e->name->str_len);
2116 tmp_fullpath_len += e->name->str_len;
2117 fullpath[tmp_fullpath_len] = '\0';
2119 if (tmp_hex_sha1_len == 40 && !get_sha1_hex(hex_sha1, sha1)) {
2120 /* This is a note entry */
2121 construct_path_with_fanout(hex_sha1, fanout, realpath);
2122 if (!strcmp(fullpath, realpath)) {
2123 /* Note entry is in correct location */
2124 num_notes++;
2125 continue;
2128 /* Rename fullpath to realpath */
2129 if (!tree_content_remove(orig_root, fullpath, &leaf))
2130 die("Failed to remove path %s", fullpath);
2131 tree_content_set(orig_root, realpath,
2132 leaf.versions[1].sha1,
2133 leaf.versions[1].mode,
2134 leaf.tree);
2135 } else if (S_ISDIR(e->versions[1].mode)) {
2136 /* This is a subdir that may contain note entries */
2137 if (!e->tree)
2138 load_tree(e);
2139 num_notes += do_change_note_fanout(orig_root, e,
2140 hex_sha1, tmp_hex_sha1_len,
2141 fullpath, tmp_fullpath_len, fanout);
2144 /* The above may have reallocated the current tree_content */
2145 t = root->tree;
2147 return num_notes;
2150 static uintmax_t change_note_fanout(struct tree_entry *root,
2151 unsigned char fanout)
2153 char hex_sha1[40], path[60];
2154 return do_change_note_fanout(root, root, hex_sha1, 0, path, 0, fanout);
2157 static void file_change_m(struct branch *b)
2159 const char *p = command_buf.buf + 2;
2160 static struct strbuf uq = STRBUF_INIT;
2161 const char *endp;
2162 struct object_entry *oe = oe;
2163 unsigned char sha1[20];
2164 uint16_t mode, inline_data = 0;
2166 p = get_mode(p, &mode);
2167 if (!p)
2168 die("Corrupt mode: %s", command_buf.buf);
2169 switch (mode) {
2170 case 0644:
2171 case 0755:
2172 mode |= S_IFREG;
2173 case S_IFREG | 0644:
2174 case S_IFREG | 0755:
2175 case S_IFLNK:
2176 case S_IFGITLINK:
2177 /* ok */
2178 break;
2179 default:
2180 die("Corrupt mode: %s", command_buf.buf);
2183 if (*p == ':') {
2184 char *x;
2185 oe = find_mark(strtoumax(p + 1, &x, 10));
2186 hashcpy(sha1, oe->sha1);
2187 p = x;
2188 } else if (!prefixcmp(p, "inline")) {
2189 inline_data = 1;
2190 p += 6;
2191 } else {
2192 if (get_sha1_hex(p, sha1))
2193 die("Invalid SHA1: %s", command_buf.buf);
2194 oe = find_object(sha1);
2195 p += 40;
2197 if (*p++ != ' ')
2198 die("Missing space after SHA1: %s", command_buf.buf);
2200 strbuf_reset(&uq);
2201 if (!unquote_c_style(&uq, p, &endp)) {
2202 if (*endp)
2203 die("Garbage after path in: %s", command_buf.buf);
2204 p = uq.buf;
2207 if (S_ISGITLINK(mode)) {
2208 if (inline_data)
2209 die("Git links cannot be specified 'inline': %s",
2210 command_buf.buf);
2211 else if (oe) {
2212 if (oe->type != OBJ_COMMIT)
2213 die("Not a commit (actually a %s): %s",
2214 typename(oe->type), command_buf.buf);
2217 * Accept the sha1 without checking; it expected to be in
2218 * another repository.
2220 } else if (inline_data) {
2221 if (p != uq.buf) {
2222 strbuf_addstr(&uq, p);
2223 p = uq.buf;
2225 read_next_command();
2226 parse_and_store_blob(&last_blob, sha1, 0);
2227 } else if (oe) {
2228 if (oe->type != OBJ_BLOB)
2229 die("Not a blob (actually a %s): %s",
2230 typename(oe->type), command_buf.buf);
2231 } else {
2232 enum object_type type = sha1_object_info(sha1, NULL);
2233 if (type < 0)
2234 die("Blob not found: %s", command_buf.buf);
2235 if (type != OBJ_BLOB)
2236 die("Not a blob (actually a %s): %s",
2237 typename(type), command_buf.buf);
2240 tree_content_set(&b->branch_tree, p, sha1, mode, NULL);
2243 static void file_change_d(struct branch *b)
2245 const char *p = command_buf.buf + 2;
2246 static struct strbuf uq = STRBUF_INIT;
2247 const char *endp;
2249 strbuf_reset(&uq);
2250 if (!unquote_c_style(&uq, p, &endp)) {
2251 if (*endp)
2252 die("Garbage after path in: %s", command_buf.buf);
2253 p = uq.buf;
2255 tree_content_remove(&b->branch_tree, p, NULL);
2258 static void file_change_cr(struct branch *b, int rename)
2260 const char *s, *d;
2261 static struct strbuf s_uq = STRBUF_INIT;
2262 static struct strbuf d_uq = STRBUF_INIT;
2263 const char *endp;
2264 struct tree_entry leaf;
2266 s = command_buf.buf + 2;
2267 strbuf_reset(&s_uq);
2268 if (!unquote_c_style(&s_uq, s, &endp)) {
2269 if (*endp != ' ')
2270 die("Missing space after source: %s", command_buf.buf);
2271 } else {
2272 endp = strchr(s, ' ');
2273 if (!endp)
2274 die("Missing space after source: %s", command_buf.buf);
2275 strbuf_add(&s_uq, s, endp - s);
2277 s = s_uq.buf;
2279 endp++;
2280 if (!*endp)
2281 die("Missing dest: %s", command_buf.buf);
2283 d = endp;
2284 strbuf_reset(&d_uq);
2285 if (!unquote_c_style(&d_uq, d, &endp)) {
2286 if (*endp)
2287 die("Garbage after dest in: %s", command_buf.buf);
2288 d = d_uq.buf;
2291 memset(&leaf, 0, sizeof(leaf));
2292 if (rename)
2293 tree_content_remove(&b->branch_tree, s, &leaf);
2294 else
2295 tree_content_get(&b->branch_tree, s, &leaf);
2296 if (!leaf.versions[1].mode)
2297 die("Path %s not in branch", s);
2298 tree_content_set(&b->branch_tree, d,
2299 leaf.versions[1].sha1,
2300 leaf.versions[1].mode,
2301 leaf.tree);
2304 static void note_change_n(struct branch *b, unsigned char old_fanout)
2306 const char *p = command_buf.buf + 2;
2307 static struct strbuf uq = STRBUF_INIT;
2308 struct object_entry *oe = oe;
2309 struct branch *s;
2310 unsigned char sha1[20], commit_sha1[20];
2311 char path[60];
2312 uint16_t inline_data = 0;
2313 unsigned char new_fanout;
2315 /* <dataref> or 'inline' */
2316 if (*p == ':') {
2317 char *x;
2318 oe = find_mark(strtoumax(p + 1, &x, 10));
2319 hashcpy(sha1, oe->sha1);
2320 p = x;
2321 } else if (!prefixcmp(p, "inline")) {
2322 inline_data = 1;
2323 p += 6;
2324 } else {
2325 if (get_sha1_hex(p, sha1))
2326 die("Invalid SHA1: %s", command_buf.buf);
2327 oe = find_object(sha1);
2328 p += 40;
2330 if (*p++ != ' ')
2331 die("Missing space after SHA1: %s", command_buf.buf);
2333 /* <committish> */
2334 s = lookup_branch(p);
2335 if (s) {
2336 hashcpy(commit_sha1, s->sha1);
2337 } else if (*p == ':') {
2338 uintmax_t commit_mark = strtoumax(p + 1, NULL, 10);
2339 struct object_entry *commit_oe = find_mark(commit_mark);
2340 if (commit_oe->type != OBJ_COMMIT)
2341 die("Mark :%" PRIuMAX " not a commit", commit_mark);
2342 hashcpy(commit_sha1, commit_oe->sha1);
2343 } else if (!get_sha1(p, commit_sha1)) {
2344 unsigned long size;
2345 char *buf = read_object_with_reference(commit_sha1,
2346 commit_type, &size, commit_sha1);
2347 if (!buf || size < 46)
2348 die("Not a valid commit: %s", p);
2349 free(buf);
2350 } else
2351 die("Invalid ref name or SHA1 expression: %s", p);
2353 if (inline_data) {
2354 if (p != uq.buf) {
2355 strbuf_addstr(&uq, p);
2356 p = uq.buf;
2358 read_next_command();
2359 parse_and_store_blob(&last_blob, sha1, 0);
2360 } else if (oe) {
2361 if (oe->type != OBJ_BLOB)
2362 die("Not a blob (actually a %s): %s",
2363 typename(oe->type), command_buf.buf);
2364 } else if (!is_null_sha1(sha1)) {
2365 enum object_type type = sha1_object_info(sha1, NULL);
2366 if (type < 0)
2367 die("Blob not found: %s", command_buf.buf);
2368 if (type != OBJ_BLOB)
2369 die("Not a blob (actually a %s): %s",
2370 typename(type), command_buf.buf);
2373 construct_path_with_fanout(sha1_to_hex(commit_sha1), old_fanout, path);
2374 if (tree_content_remove(&b->branch_tree, path, NULL))
2375 b->num_notes--;
2377 if (is_null_sha1(sha1))
2378 return; /* nothing to insert */
2380 b->num_notes++;
2381 new_fanout = convert_num_notes_to_fanout(b->num_notes);
2382 construct_path_with_fanout(sha1_to_hex(commit_sha1), new_fanout, path);
2383 tree_content_set(&b->branch_tree, path, sha1, S_IFREG | 0644, NULL);
2386 static void file_change_deleteall(struct branch *b)
2388 release_tree_content_recursive(b->branch_tree.tree);
2389 hashclr(b->branch_tree.versions[0].sha1);
2390 hashclr(b->branch_tree.versions[1].sha1);
2391 load_tree(&b->branch_tree);
2392 b->num_notes = 0;
2395 static void parse_from_commit(struct branch *b, char *buf, unsigned long size)
2397 if (!buf || size < 46)
2398 die("Not a valid commit: %s", sha1_to_hex(b->sha1));
2399 if (memcmp("tree ", buf, 5)
2400 || get_sha1_hex(buf + 5, b->branch_tree.versions[1].sha1))
2401 die("The commit %s is corrupt", sha1_to_hex(b->sha1));
2402 hashcpy(b->branch_tree.versions[0].sha1,
2403 b->branch_tree.versions[1].sha1);
2406 static void parse_from_existing(struct branch *b)
2408 if (is_null_sha1(b->sha1)) {
2409 hashclr(b->branch_tree.versions[0].sha1);
2410 hashclr(b->branch_tree.versions[1].sha1);
2411 } else {
2412 unsigned long size;
2413 char *buf;
2415 buf = read_object_with_reference(b->sha1,
2416 commit_type, &size, b->sha1);
2417 parse_from_commit(b, buf, size);
2418 free(buf);
2422 static int parse_from(struct branch *b)
2424 const char *from;
2425 struct branch *s;
2427 if (prefixcmp(command_buf.buf, "from "))
2428 return 0;
2430 if (b->branch_tree.tree) {
2431 release_tree_content_recursive(b->branch_tree.tree);
2432 b->branch_tree.tree = NULL;
2435 from = strchr(command_buf.buf, ' ') + 1;
2436 s = lookup_branch(from);
2437 if (b == s)
2438 die("Can't create a branch from itself: %s", b->name);
2439 else if (s) {
2440 unsigned char *t = s->branch_tree.versions[1].sha1;
2441 hashcpy(b->sha1, s->sha1);
2442 hashcpy(b->branch_tree.versions[0].sha1, t);
2443 hashcpy(b->branch_tree.versions[1].sha1, t);
2444 } else if (*from == ':') {
2445 uintmax_t idnum = strtoumax(from + 1, NULL, 10);
2446 struct object_entry *oe = find_mark(idnum);
2447 if (oe->type != OBJ_COMMIT)
2448 die("Mark :%" PRIuMAX " not a commit", idnum);
2449 hashcpy(b->sha1, oe->sha1);
2450 if (oe->pack_id != MAX_PACK_ID) {
2451 unsigned long size;
2452 char *buf = gfi_unpack_entry(oe, &size);
2453 parse_from_commit(b, buf, size);
2454 free(buf);
2455 } else
2456 parse_from_existing(b);
2457 } else if (!get_sha1(from, b->sha1))
2458 parse_from_existing(b);
2459 else
2460 die("Invalid ref name or SHA1 expression: %s", from);
2462 read_next_command();
2463 return 1;
2466 static struct hash_list *parse_merge(unsigned int *count)
2468 struct hash_list *list = NULL, *n, *e = e;
2469 const char *from;
2470 struct branch *s;
2472 *count = 0;
2473 while (!prefixcmp(command_buf.buf, "merge ")) {
2474 from = strchr(command_buf.buf, ' ') + 1;
2475 n = xmalloc(sizeof(*n));
2476 s = lookup_branch(from);
2477 if (s)
2478 hashcpy(n->sha1, s->sha1);
2479 else if (*from == ':') {
2480 uintmax_t idnum = strtoumax(from + 1, NULL, 10);
2481 struct object_entry *oe = find_mark(idnum);
2482 if (oe->type != OBJ_COMMIT)
2483 die("Mark :%" PRIuMAX " not a commit", idnum);
2484 hashcpy(n->sha1, oe->sha1);
2485 } else if (!get_sha1(from, n->sha1)) {
2486 unsigned long size;
2487 char *buf = read_object_with_reference(n->sha1,
2488 commit_type, &size, n->sha1);
2489 if (!buf || size < 46)
2490 die("Not a valid commit: %s", from);
2491 free(buf);
2492 } else
2493 die("Invalid ref name or SHA1 expression: %s", from);
2495 n->next = NULL;
2496 if (list)
2497 e->next = n;
2498 else
2499 list = n;
2500 e = n;
2501 (*count)++;
2502 read_next_command();
2504 return list;
2507 static void parse_new_commit(void)
2509 static struct strbuf msg = STRBUF_INIT;
2510 struct branch *b;
2511 char *sp;
2512 char *author = NULL;
2513 char *committer = NULL;
2514 struct hash_list *merge_list = NULL;
2515 unsigned int merge_count;
2516 unsigned char prev_fanout, new_fanout;
2518 /* Obtain the branch name from the rest of our command */
2519 sp = strchr(command_buf.buf, ' ') + 1;
2520 b = lookup_branch(sp);
2521 if (!b)
2522 b = new_branch(sp);
2524 read_next_command();
2525 parse_mark();
2526 if (!prefixcmp(command_buf.buf, "author ")) {
2527 author = parse_ident(command_buf.buf + 7);
2528 read_next_command();
2530 if (!prefixcmp(command_buf.buf, "committer ")) {
2531 committer = parse_ident(command_buf.buf + 10);
2532 read_next_command();
2534 if (!committer)
2535 die("Expected committer but didn't get one");
2536 parse_data(&msg, 0, NULL);
2537 read_next_command();
2538 parse_from(b);
2539 merge_list = parse_merge(&merge_count);
2541 /* ensure the branch is active/loaded */
2542 if (!b->branch_tree.tree || !max_active_branches) {
2543 unload_one_branch();
2544 load_branch(b);
2547 prev_fanout = convert_num_notes_to_fanout(b->num_notes);
2549 /* file_change* */
2550 while (command_buf.len > 0) {
2551 if (!prefixcmp(command_buf.buf, "M "))
2552 file_change_m(b);
2553 else if (!prefixcmp(command_buf.buf, "D "))
2554 file_change_d(b);
2555 else if (!prefixcmp(command_buf.buf, "R "))
2556 file_change_cr(b, 1);
2557 else if (!prefixcmp(command_buf.buf, "C "))
2558 file_change_cr(b, 0);
2559 else if (!prefixcmp(command_buf.buf, "N "))
2560 note_change_n(b, prev_fanout);
2561 else if (!strcmp("deleteall", command_buf.buf))
2562 file_change_deleteall(b);
2563 else {
2564 unread_command_buf = 1;
2565 break;
2567 if (read_next_command() == EOF)
2568 break;
2571 new_fanout = convert_num_notes_to_fanout(b->num_notes);
2572 if (new_fanout != prev_fanout)
2573 b->num_notes = change_note_fanout(&b->branch_tree, new_fanout);
2575 /* build the tree and the commit */
2576 store_tree(&b->branch_tree);
2577 hashcpy(b->branch_tree.versions[0].sha1,
2578 b->branch_tree.versions[1].sha1);
2580 strbuf_reset(&new_data);
2581 strbuf_addf(&new_data, "tree %s\n",
2582 sha1_to_hex(b->branch_tree.versions[1].sha1));
2583 if (!is_null_sha1(b->sha1))
2584 strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(b->sha1));
2585 while (merge_list) {
2586 struct hash_list *next = merge_list->next;
2587 strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(merge_list->sha1));
2588 free(merge_list);
2589 merge_list = next;
2591 strbuf_addf(&new_data,
2592 "author %s\n"
2593 "committer %s\n"
2594 "\n",
2595 author ? author : committer, committer);
2596 strbuf_addbuf(&new_data, &msg);
2597 free(author);
2598 free(committer);
2600 if (!store_object(OBJ_COMMIT, &new_data, NULL, b->sha1, next_mark))
2601 b->pack_id = pack_id;
2602 b->last_commit = object_count_by_type[OBJ_COMMIT];
2605 static void parse_new_tag(void)
2607 static struct strbuf msg = STRBUF_INIT;
2608 char *sp;
2609 const char *from;
2610 char *tagger;
2611 struct branch *s;
2612 struct tag *t;
2613 uintmax_t from_mark = 0;
2614 unsigned char sha1[20];
2615 enum object_type type;
2617 /* Obtain the new tag name from the rest of our command */
2618 sp = strchr(command_buf.buf, ' ') + 1;
2619 t = pool_alloc(sizeof(struct tag));
2620 t->next_tag = NULL;
2621 t->name = pool_strdup(sp);
2622 if (last_tag)
2623 last_tag->next_tag = t;
2624 else
2625 first_tag = t;
2626 last_tag = t;
2627 read_next_command();
2629 /* from ... */
2630 if (prefixcmp(command_buf.buf, "from "))
2631 die("Expected from command, got %s", command_buf.buf);
2632 from = strchr(command_buf.buf, ' ') + 1;
2633 s = lookup_branch(from);
2634 if (s) {
2635 hashcpy(sha1, s->sha1);
2636 type = OBJ_COMMIT;
2637 } else if (*from == ':') {
2638 struct object_entry *oe;
2639 from_mark = strtoumax(from + 1, NULL, 10);
2640 oe = find_mark(from_mark);
2641 type = oe->type;
2642 hashcpy(sha1, oe->sha1);
2643 } else if (!get_sha1(from, sha1)) {
2644 unsigned long size;
2645 char *buf;
2647 buf = read_sha1_file(sha1, &type, &size);
2648 if (!buf || size < 46)
2649 die("Not a valid commit: %s", from);
2650 free(buf);
2651 } else
2652 die("Invalid ref name or SHA1 expression: %s", from);
2653 read_next_command();
2655 /* tagger ... */
2656 if (!prefixcmp(command_buf.buf, "tagger ")) {
2657 tagger = parse_ident(command_buf.buf + 7);
2658 read_next_command();
2659 } else
2660 tagger = NULL;
2662 /* tag payload/message */
2663 parse_data(&msg, 0, NULL);
2665 /* build the tag object */
2666 strbuf_reset(&new_data);
2668 strbuf_addf(&new_data,
2669 "object %s\n"
2670 "type %s\n"
2671 "tag %s\n",
2672 sha1_to_hex(sha1), typename(type), t->name);
2673 if (tagger)
2674 strbuf_addf(&new_data,
2675 "tagger %s\n", tagger);
2676 strbuf_addch(&new_data, '\n');
2677 strbuf_addbuf(&new_data, &msg);
2678 free(tagger);
2680 if (store_object(OBJ_TAG, &new_data, NULL, t->sha1, 0))
2681 t->pack_id = MAX_PACK_ID;
2682 else
2683 t->pack_id = pack_id;
2686 static void parse_reset_branch(void)
2688 struct branch *b;
2689 char *sp;
2691 /* Obtain the branch name from the rest of our command */
2692 sp = strchr(command_buf.buf, ' ') + 1;
2693 b = lookup_branch(sp);
2694 if (b) {
2695 hashclr(b->sha1);
2696 hashclr(b->branch_tree.versions[0].sha1);
2697 hashclr(b->branch_tree.versions[1].sha1);
2698 if (b->branch_tree.tree) {
2699 release_tree_content_recursive(b->branch_tree.tree);
2700 b->branch_tree.tree = NULL;
2703 else
2704 b = new_branch(sp);
2705 read_next_command();
2706 parse_from(b);
2707 if (command_buf.len > 0)
2708 unread_command_buf = 1;
2711 static void parse_checkpoint(void)
2713 if (object_count) {
2714 cycle_packfile();
2715 dump_branches();
2716 dump_tags();
2717 dump_marks();
2719 skip_optional_lf();
2722 static void parse_progress(void)
2724 fwrite(command_buf.buf, 1, command_buf.len, stdout);
2725 fputc('\n', stdout);
2726 fflush(stdout);
2727 skip_optional_lf();
2730 static char* make_fast_import_path(const char *path)
2732 struct strbuf abs_path = STRBUF_INIT;
2734 if (!relative_marks_paths || is_absolute_path(path))
2735 return xstrdup(path);
2736 strbuf_addf(&abs_path, "%s/info/fast-import/%s", get_git_dir(), path);
2737 return strbuf_detach(&abs_path, NULL);
2740 static void option_import_marks(const char *marks, int from_stream)
2742 if (import_marks_file) {
2743 if (from_stream)
2744 die("Only one import-marks command allowed per stream");
2746 /* read previous mark file */
2747 if(!import_marks_file_from_stream)
2748 read_marks();
2751 import_marks_file = make_fast_import_path(marks);
2752 import_marks_file_from_stream = from_stream;
2755 static void option_date_format(const char *fmt)
2757 if (!strcmp(fmt, "raw"))
2758 whenspec = WHENSPEC_RAW;
2759 else if (!strcmp(fmt, "rfc2822"))
2760 whenspec = WHENSPEC_RFC2822;
2761 else if (!strcmp(fmt, "now"))
2762 whenspec = WHENSPEC_NOW;
2763 else
2764 die("unknown --date-format argument %s", fmt);
2767 static void option_depth(const char *depth)
2769 max_depth = strtoul(depth, NULL, 0);
2770 if (max_depth > MAX_DEPTH)
2771 die("--depth cannot exceed %u", MAX_DEPTH);
2774 static void option_active_branches(const char *branches)
2776 max_active_branches = strtoul(branches, NULL, 0);
2779 static void option_export_marks(const char *marks)
2781 export_marks_file = make_fast_import_path(marks);
2784 static void option_export_pack_edges(const char *edges)
2786 if (pack_edges)
2787 fclose(pack_edges);
2788 pack_edges = fopen(edges, "a");
2789 if (!pack_edges)
2790 die_errno("Cannot open '%s'", edges);
2793 static int parse_one_option(const char *option)
2795 if (!prefixcmp(option, "max-pack-size=")) {
2796 unsigned long v;
2797 if (!git_parse_ulong(option + 14, &v))
2798 return 0;
2799 if (v < 8192) {
2800 warning("max-pack-size is now in bytes, assuming --max-pack-size=%lum", v);
2801 v *= 1024 * 1024;
2802 } else if (v < 1024 * 1024) {
2803 warning("minimum max-pack-size is 1 MiB");
2804 v = 1024 * 1024;
2806 max_packsize = v;
2807 } else if (!prefixcmp(option, "big-file-threshold=")) {
2808 unsigned long v;
2809 if (!git_parse_ulong(option + 19, &v))
2810 return 0;
2811 big_file_threshold = v;
2812 } else if (!prefixcmp(option, "depth=")) {
2813 option_depth(option + 6);
2814 } else if (!prefixcmp(option, "active-branches=")) {
2815 option_active_branches(option + 16);
2816 } else if (!prefixcmp(option, "export-pack-edges=")) {
2817 option_export_pack_edges(option + 18);
2818 } else if (!prefixcmp(option, "quiet")) {
2819 show_stats = 0;
2820 } else if (!prefixcmp(option, "stats")) {
2821 show_stats = 1;
2822 } else {
2823 return 0;
2826 return 1;
2829 static int parse_one_feature(const char *feature, int from_stream)
2831 if (!prefixcmp(feature, "date-format=")) {
2832 option_date_format(feature + 12);
2833 } else if (!prefixcmp(feature, "import-marks=")) {
2834 option_import_marks(feature + 13, from_stream);
2835 } else if (!prefixcmp(feature, "export-marks=")) {
2836 option_export_marks(feature + 13);
2837 } else if (!prefixcmp(feature, "relative-marks")) {
2838 relative_marks_paths = 1;
2839 } else if (!prefixcmp(feature, "no-relative-marks")) {
2840 relative_marks_paths = 0;
2841 } else if (!prefixcmp(feature, "force")) {
2842 force_update = 1;
2843 } else {
2844 return 0;
2847 return 1;
2850 static void parse_feature(void)
2852 char *feature = command_buf.buf + 8;
2854 if (seen_data_command)
2855 die("Got feature command '%s' after data command", feature);
2857 if (parse_one_feature(feature, 1))
2858 return;
2860 die("This version of fast-import does not support feature %s.", feature);
2863 static void parse_option(void)
2865 char *option = command_buf.buf + 11;
2867 if (seen_data_command)
2868 die("Got option command '%s' after data command", option);
2870 if (parse_one_option(option))
2871 return;
2873 die("This version of fast-import does not support option: %s", option);
2876 static int git_pack_config(const char *k, const char *v, void *cb)
2878 if (!strcmp(k, "pack.depth")) {
2879 max_depth = git_config_int(k, v);
2880 if (max_depth > MAX_DEPTH)
2881 max_depth = MAX_DEPTH;
2882 return 0;
2884 if (!strcmp(k, "pack.compression")) {
2885 int level = git_config_int(k, v);
2886 if (level == -1)
2887 level = Z_DEFAULT_COMPRESSION;
2888 else if (level < 0 || level > Z_BEST_COMPRESSION)
2889 die("bad pack compression level %d", level);
2890 pack_compression_level = level;
2891 pack_compression_seen = 1;
2892 return 0;
2894 if (!strcmp(k, "core.bigfilethreshold")) {
2895 long n = git_config_int(k, v);
2896 big_file_threshold = 0 < n ? n : 0;
2898 return git_default_config(k, v, cb);
2901 static const char fast_import_usage[] =
2902 "git fast-import [--date-format=f] [--max-pack-size=n] [--big-file-threshold=n] [--depth=n] [--active-branches=n] [--export-marks=marks.file]";
2904 static void parse_argv(void)
2906 unsigned int i;
2908 for (i = 1; i < global_argc; i++) {
2909 const char *a = global_argv[i];
2911 if (*a != '-' || !strcmp(a, "--"))
2912 break;
2914 if (parse_one_option(a + 2))
2915 continue;
2917 if (parse_one_feature(a + 2, 0))
2918 continue;
2920 die("unknown option %s", a);
2922 if (i != global_argc)
2923 usage(fast_import_usage);
2925 seen_data_command = 1;
2926 if (import_marks_file)
2927 read_marks();
2930 int main(int argc, const char **argv)
2932 unsigned int i;
2934 git_extract_argv0_path(argv[0]);
2936 if (argc == 2 && !strcmp(argv[1], "-h"))
2937 usage(fast_import_usage);
2939 setup_git_directory();
2940 git_config(git_pack_config, NULL);
2941 if (!pack_compression_seen && core_compression_seen)
2942 pack_compression_level = core_compression_level;
2944 alloc_objects(object_entry_alloc);
2945 strbuf_init(&command_buf, 0);
2946 atom_table = xcalloc(atom_table_sz, sizeof(struct atom_str*));
2947 branch_table = xcalloc(branch_table_sz, sizeof(struct branch*));
2948 avail_tree_table = xcalloc(avail_tree_table_sz, sizeof(struct avail_tree_content*));
2949 marks = pool_calloc(1, sizeof(struct mark_set));
2951 global_argc = argc;
2952 global_argv = argv;
2954 rc_free = pool_alloc(cmd_save * sizeof(*rc_free));
2955 for (i = 0; i < (cmd_save - 1); i++)
2956 rc_free[i].next = &rc_free[i + 1];
2957 rc_free[cmd_save - 1].next = NULL;
2959 prepare_packed_git();
2960 start_packfile();
2961 set_die_routine(die_nicely);
2962 while (read_next_command() != EOF) {
2963 if (!strcmp("blob", command_buf.buf))
2964 parse_new_blob();
2965 else if (!prefixcmp(command_buf.buf, "commit "))
2966 parse_new_commit();
2967 else if (!prefixcmp(command_buf.buf, "tag "))
2968 parse_new_tag();
2969 else if (!prefixcmp(command_buf.buf, "reset "))
2970 parse_reset_branch();
2971 else if (!strcmp("checkpoint", command_buf.buf))
2972 parse_checkpoint();
2973 else if (!prefixcmp(command_buf.buf, "progress "))
2974 parse_progress();
2975 else if (!prefixcmp(command_buf.buf, "feature "))
2976 parse_feature();
2977 else if (!prefixcmp(command_buf.buf, "option git "))
2978 parse_option();
2979 else if (!prefixcmp(command_buf.buf, "option "))
2980 /* ignore non-git options*/;
2981 else
2982 die("Unsupported command: %s", command_buf.buf);
2985 /* argv hasn't been parsed yet, do so */
2986 if (!seen_data_command)
2987 parse_argv();
2989 end_packfile();
2991 dump_branches();
2992 dump_tags();
2993 unkeep_all_packs();
2994 dump_marks();
2996 if (pack_edges)
2997 fclose(pack_edges);
2999 if (show_stats) {
3000 uintmax_t total_count = 0, duplicate_count = 0;
3001 for (i = 0; i < ARRAY_SIZE(object_count_by_type); i++)
3002 total_count += object_count_by_type[i];
3003 for (i = 0; i < ARRAY_SIZE(duplicate_count_by_type); i++)
3004 duplicate_count += duplicate_count_by_type[i];
3006 fprintf(stderr, "%s statistics:\n", argv[0]);
3007 fprintf(stderr, "---------------------------------------------------------------------\n");
3008 fprintf(stderr, "Alloc'd objects: %10" PRIuMAX "\n", alloc_count);
3009 fprintf(stderr, "Total objects: %10" PRIuMAX " (%10" PRIuMAX " duplicates )\n", total_count, duplicate_count);
3010 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]);
3011 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]);
3012 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]);
3013 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]);
3014 fprintf(stderr, "Total branches: %10lu (%10lu loads )\n", branch_count, branch_load_count);
3015 fprintf(stderr, " marks: %10" PRIuMAX " (%10" PRIuMAX " unique )\n", (((uintmax_t)1) << marks->shift) * 1024, marks_set_count);
3016 fprintf(stderr, " atoms: %10u\n", atom_cnt);
3017 fprintf(stderr, "Memory total: %10" PRIuMAX " KiB\n", (total_allocd + alloc_count*sizeof(struct object_entry))/1024);
3018 fprintf(stderr, " pools: %10lu KiB\n", (unsigned long)(total_allocd/1024));
3019 fprintf(stderr, " objects: %10" PRIuMAX " KiB\n", (alloc_count*sizeof(struct object_entry))/1024);
3020 fprintf(stderr, "---------------------------------------------------------------------\n");
3021 pack_report();
3022 fprintf(stderr, "---------------------------------------------------------------------\n");
3023 fprintf(stderr, "\n");
3026 return failure ? 1 : 0;