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