refs.c: rework ref_locks by abstracting from underlying struct lock_file
[git/git.git] / fast-import.c
CommitLineData
463acbe1
SP
1/*
2Format of STDIN stream:
3
4 stream ::= cmd*;
5
6 cmd ::= new_blob
c44cdc7e 7 | new_commit
463acbe1 8 | new_tag
5fced8dc 9 | reset_branch
8c1f22da 10 | checkpoint
ac053c02 11 | progress
463acbe1
SP
12 ;
13
c44cdc7e 14 new_blob ::= 'blob' lf
c905e090 15 mark?
c44cdc7e
SP
16 file_content;
17 file_content ::= data;
463acbe1 18
c44cdc7e 19 new_commit ::= 'commit' sp ref_str lf
00e2b884 20 mark?
63e0c8b3
SP
21 ('author' sp name '<' email '>' when lf)?
22 'committer' sp name '<' email '>' when lf
00e2b884 23 commit_msg
02f3389d 24 ('from' sp (ref_str | hexsha1 | sha1exp_str | idnum) lf)?
62b6f483 25 ('merge' sp (ref_str | hexsha1 | sha1exp_str | idnum) lf)*
c44cdc7e 26 file_change*
1fdb649c 27 lf?;
c44cdc7e 28 commit_msg ::= data;
463acbe1 29
b6f3481b
SP
30 file_change ::= file_clr
31 | file_del
32 | file_rnm
33 | file_cpy
34 | file_obm
35 | file_inm;
825769a8 36 file_clr ::= 'deleteall' lf;
b715cfbb 37 file_del ::= 'D' sp path_str lf;
f39a946a 38 file_rnm ::= 'R' sp path_str sp path_str lf;
b6f3481b 39 file_cpy ::= 'C' sp path_str sp path_str lf;
b715cfbb
SP
40 file_obm ::= 'M' sp mode sp (hexsha1 | idnum) sp path_str lf;
41 file_inm ::= 'M' sp mode sp 'inline' sp path_str lf
42 data;
c44cdc7e
SP
43
44 new_tag ::= 'tag' sp tag_str lf
45 'from' sp (ref_str | hexsha1 | sha1exp_str | idnum) lf
c905e090 46 'tagger' sp name '<' email '>' when lf
c44cdc7e
SP
47 tag_msg;
48 tag_msg ::= data;
49
9938ffc5
SP
50 reset_branch ::= 'reset' sp ref_str lf
51 ('from' sp (ref_str | hexsha1 | sha1exp_str | idnum) lf)?
1fdb649c 52 lf?;
5fced8dc 53
7bfe6e26 54 checkpoint ::= 'checkpoint' lf
1fdb649c 55 lf?;
7bfe6e26 56
ac053c02
SP
57 progress ::= 'progress' sp not_lf* lf
58 lf?;
59
c44cdc7e
SP
60 # note: the first idnum in a stream should be 1 and subsequent
61 # idnums should not have gaps between values as this will cause
62 # the stream parser to reserve space for the gapped values. An
c905e090 63 # idnum can be updated in the future to a new object by issuing
c44cdc7e 64 # a new mark directive with the old idnum.
c905e090 65 #
c44cdc7e 66 mark ::= 'mark' sp idnum lf;
3b4dce02 67 data ::= (delimited_data | exact_data)
2c570cde 68 lf?;
3b4dce02
SP
69
70 # note: delim may be any string but must not contain lf.
71 # data_line may contain any data but must not be exactly
72 # delim.
73 delimited_data ::= 'data' sp '<<' delim lf
74 (data_line lf)*
c905e090 75 delim lf;
c44cdc7e
SP
76
77 # note: declen indicates the length of binary_data in bytes.
3b4dce02 78 # declen does not include the lf preceeding the binary data.
c44cdc7e 79 #
3b4dce02
SP
80 exact_data ::= 'data' sp declen lf
81 binary_data;
c44cdc7e
SP
82
83 # note: quoted strings are C-style quoting supporting \c for
84 # common escapes of 'c' (e..g \n, \t, \\, \") or \nnn where nnn
c905e090 85 # is the signed byte value in octal. Note that the only
c44cdc7e
SP
86 # characters which must actually be escaped to protect the
87 # stream formatting is: \, " and LF. Otherwise these values
c905e090 88 # are UTF8.
c44cdc7e 89 #
6c3aac1c
SP
90 ref_str ::= ref;
91 sha1exp_str ::= sha1exp;
92 tag_str ::= tag;
c44cdc7e 93 path_str ::= path | '"' quoted(path) '"' ;
b715cfbb
SP
94 mode ::= '100644' | '644'
95 | '100755' | '755'
9981b6d9 96 | '120000'
b715cfbb 97 ;
c44cdc7e
SP
98
99 declen ::= # unsigned 32 bit value, ascii base10 notation;
2104838b 100 bigint ::= # unsigned integer value, ascii base10 notation;
463acbe1 101 binary_data ::= # file content, not interpreted;
c44cdc7e 102
63e0c8b3
SP
103 when ::= raw_when | rfc2822_when;
104 raw_when ::= ts sp tz;
105 rfc2822_when ::= # Valid RFC 2822 date and time;
106
463acbe1
SP
107 sp ::= # ASCII space character;
108 lf ::= # ASCII newline (LF) character;
c44cdc7e
SP
109
110 # note: a colon (':') must precede the numerical value assigned to
c905e090 111 # an idnum. This is to distinguish it from a ref or tag name as
c44cdc7e 112 # GIT does not permit ':' in ref or tag strings.
c905e090 113 #
2104838b 114 idnum ::= ':' bigint;
c44cdc7e
SP
115 path ::= # GIT style file path, e.g. "a/b/c";
116 ref ::= # GIT ref name, e.g. "refs/heads/MOZ_GECKO_EXPERIMENT";
117 tag ::= # GIT tag name, e.g. "FIREFOX_1_5";
463acbe1
SP
118 sha1exp ::= # Any valid GIT SHA1 expression;
119 hexsha1 ::= # SHA1 in hexadecimal format;
c44cdc7e
SP
120
121 # note: name and email are UTF8 strings, however name must not
c905e090 122 # contain '<' or lf and email must not contain any of the
c44cdc7e 123 # following: '<', '>', lf.
c905e090 124 #
c44cdc7e 125 name ::= # valid GIT author/committer name;
463acbe1 126 email ::= # valid GIT author/committer email;
c44cdc7e
SP
127 ts ::= # time since the epoch in seconds, ascii base10 notation;
128 tz ::= # GIT style timezone;
401d53fa
SP
129
130 # note: comments may appear anywhere in the input, except
131 # within a data command. Any form of the data command
132 # always escapes the related input from comment processing.
133 #
134 # In case it is not clear, the '#' that starts the comment
135 # must be the first character on that the line (an lf have
136 # preceeded it).
137 #
138 comment ::= '#' not_lf* lf;
139 not_lf ::= # Any byte that is not ASCII newline (LF);
463acbe1
SP
140*/
141
db5e523f
SP
142#include "builtin.h"
143#include "cache.h"
144#include "object.h"
145#include "blob.h"
463acbe1 146#include "tree.h"
7073e69e 147#include "commit.h"
db5e523f
SP
148#include "delta.h"
149#include "pack.h"
463acbe1 150#include "refs.h"
db5e523f 151#include "csum-file.h"
c44cdc7e 152#include "quote.h"
db5e523f 153
69e74e74
SP
154#define PACK_ID_BITS 16
155#define MAX_PACK_ID ((1<<PACK_ID_BITS)-1)
436e7a74
SP
156#define DEPTH_BITS 13
157#define MAX_DEPTH ((1<<DEPTH_BITS)-1)
69e74e74 158
27d6d290
SP
159struct object_entry
160{
161 struct object_entry *next;
10831c55 162 uint32_t offset;
436e7a74
SP
163 uint32_t type : TYPE_BITS,
164 pack_id : PACK_ID_BITS,
165 depth : DEPTH_BITS;
27d6d290
SP
166 unsigned char sha1[20];
167};
168
463acbe1 169struct object_entry_pool
27d6d290 170{
463acbe1 171 struct object_entry_pool *next_pool;
27d6d290
SP
172 struct object_entry *next_free;
173 struct object_entry *end;
ac47a738 174 struct object_entry entries[FLEX_ARRAY]; /* more */
27d6d290
SP
175};
176
d8397168
SP
177struct mark_set
178{
d8397168
SP
179 union {
180 struct object_entry *marked[1024];
181 struct mark_set *sets[1024];
182 } data;
6f64f6d9 183 unsigned int shift;
d8397168
SP
184};
185
ac47a738
SP
186struct last_object
187{
05576569 188 struct strbuf data;
10831c55 189 uint32_t offset;
6bb5b329 190 unsigned int depth;
05576569 191 unsigned no_swap : 1;
ac47a738
SP
192};
193
463acbe1
SP
194struct mem_pool
195{
196 struct mem_pool *next_pool;
197 char *next_free;
198 char *end;
69ae5175 199 uintmax_t space[FLEX_ARRAY]; /* more */
463acbe1
SP
200};
201
202struct atom_str
203{
204 struct atom_str *next_atom;
10831c55 205 unsigned short str_len;
463acbe1
SP
206 char str_dat[FLEX_ARRAY]; /* more */
207};
208
209struct tree_content;
6bb5b329
SP
210struct tree_entry
211{
463acbe1
SP
212 struct tree_content *tree;
213 struct atom_str* name;
4cabf858
SP
214 struct tree_entry_ms
215 {
10831c55 216 uint16_t mode;
4cabf858
SP
217 unsigned char sha1[20];
218 } versions[2];
6bb5b329
SP
219};
220
463acbe1 221struct tree_content
6bb5b329 222{
463acbe1
SP
223 unsigned int entry_capacity; /* must match avail_tree_content */
224 unsigned int entry_count;
4cabf858 225 unsigned int delta_depth;
463acbe1
SP
226 struct tree_entry *entries[FLEX_ARRAY]; /* more */
227};
228
229struct avail_tree_content
230{
231 unsigned int entry_capacity; /* must match tree_content */
232 struct avail_tree_content *next_avail;
6bb5b329
SP
233};
234
235struct branch
236{
463acbe1
SP
237 struct branch *table_next_branch;
238 struct branch *active_next_branch;
6bb5b329 239 const char *name;
463acbe1 240 struct tree_entry branch_tree;
69e74e74 241 uintmax_t last_commit;
734c91f9
SP
242 unsigned active : 1;
243 unsigned pack_id : PACK_ID_BITS;
463acbe1 244 unsigned char sha1[20];
6bb5b329
SP
245};
246
72303d44
SP
247struct tag
248{
249 struct tag *next_tag;
250 const char *name;
2369ed79 251 unsigned int pack_id;
72303d44
SP
252 unsigned char sha1[20];
253};
254
62b6f483
SP
255struct hash_list
256{
257 struct hash_list *next;
258 unsigned char sha1[20];
259};
463acbe1 260
63e0c8b3
SP
261typedef enum {
262 WHENSPEC_RAW = 1,
263 WHENSPEC_RFC2822,
264 WHENSPEC_NOW,
265} whenspec_type;
266
904b1941
SP
267struct recent_command
268{
269 struct recent_command *prev;
270 struct recent_command *next;
271 char *buf;
272};
273
0ea9f045 274/* Configured limits on output */
d5c57b28 275static unsigned long max_depth = 10;
6777a59f 276static off_t max_packsize = (1LL << 32) - 1;
7073e69e 277static int force_update;
0ea9f045
SP
278
279/* Stats and misc. counters */
280static uintmax_t alloc_count;
0ea9f045
SP
281static uintmax_t marks_set_count;
282static uintmax_t object_count_by_type[1 << TYPE_BITS];
283static uintmax_t duplicate_count_by_type[1 << TYPE_BITS];
284static uintmax_t delta_count_by_type[1 << TYPE_BITS];
a7ddc487 285static unsigned long object_count;
6bb5b329 286static unsigned long branch_count;
d6c7eb2c 287static unsigned long branch_load_count;
7073e69e 288static int failure;
bdf1c06d 289static FILE *pack_edges;
ac47a738 290
463acbe1
SP
291/* Memory pools */
292static size_t mem_pool_alloc = 2*1024*1024 - sizeof(struct mem_pool);
293static size_t total_allocd;
294static struct mem_pool *mem_pool;
295
c44cdc7e 296/* Atom management */
463acbe1
SP
297static unsigned int atom_table_sz = 4451;
298static unsigned int atom_cnt;
299static struct atom_str **atom_table;
300
301/* The .pack file being generated */
7bfe6e26 302static unsigned int pack_id;
d489bc14 303static struct packed_git *pack_data;
7bfe6e26 304static struct packed_git **all_packs;
41e5257f 305static unsigned long pack_size;
ac47a738
SP
306
307/* Table of objects we've written. */
4cabf858 308static unsigned int object_entry_alloc = 5000;
463acbe1
SP
309static struct object_entry_pool *blocks;
310static struct object_entry *object_table[1 << 16];
d8397168 311static struct mark_set *marks;
a6a1a831 312static const char* mark_file;
ac47a738
SP
313
314/* Our last blob */
05576569 315static struct last_object last_blob = { STRBUF_INIT, 0, 0, 0 };
463acbe1
SP
316
317/* Tree management */
318static unsigned int tree_entry_alloc = 1000;
319static void *avail_tree_entry;
320static unsigned int avail_tree_table_sz = 100;
321static struct avail_tree_content **avail_tree_table;
eec813cf
PH
322static struct strbuf old_tree = STRBUF_INIT;
323static struct strbuf new_tree = STRBUF_INIT;
8bcce301 324
6bb5b329 325/* Branch data */
d5c57b28
SP
326static unsigned long max_active_branches = 5;
327static unsigned long cur_active_branches;
328static unsigned long branch_table_sz = 1039;
463acbe1
SP
329static struct branch **branch_table;
330static struct branch *active_branches;
331
72303d44
SP
332/* Tag data */
333static struct tag *first_tag;
334static struct tag *last_tag;
335
c44cdc7e 336/* Input stream parsing */
63e0c8b3 337static whenspec_type whenspec = WHENSPEC_RAW;
4a241d79 338static struct strbuf command_buf = STRBUF_INIT;
1fdb649c 339static int unread_command_buf;
904b1941
SP
340static struct recent_command cmd_hist = {&cmd_hist, &cmd_hist, NULL};
341static struct recent_command *cmd_tail = &cmd_hist;
342static struct recent_command *rc_free;
343static unsigned int cmd_save = 100;
0ea9f045 344static uintmax_t next_mark;
eec813cf 345static struct strbuf new_data = STRBUF_INIT;
c44cdc7e 346
8acb3297
SP
347static void write_branch_report(FILE *rpt, struct branch *b)
348{
349 fprintf(rpt, "%s:\n", b->name);
350
351 fprintf(rpt, " status :");
352 if (b->active)
353 fputs(" active", rpt);
354 if (b->branch_tree.tree)
355 fputs(" loaded", rpt);
356 if (is_null_sha1(b->branch_tree.versions[1].sha1))
357 fputs(" dirty", rpt);
358 fputc('\n', rpt);
359
360 fprintf(rpt, " tip commit : %s\n", sha1_to_hex(b->sha1));
361 fprintf(rpt, " old tree : %s\n", sha1_to_hex(b->branch_tree.versions[0].sha1));
362 fprintf(rpt, " cur tree : %s\n", sha1_to_hex(b->branch_tree.versions[1].sha1));
363 fprintf(rpt, " commit clock: %" PRIuMAX "\n", b->last_commit);
364
365 fputs(" last pack : ", rpt);
366 if (b->pack_id < MAX_PACK_ID)
367 fprintf(rpt, "%u", b->pack_id);
368 fputc('\n', rpt);
369
370 fputc('\n', rpt);
371}
372
4bf53833 373static void write_crash_report(const char *err)
8acb3297
SP
374{
375 char *loc = git_path("fast_import_crash_%d", getpid());
376 FILE *rpt = fopen(loc, "w");
377 struct branch *b;
378 unsigned long lu;
904b1941 379 struct recent_command *rc;
8acb3297
SP
380
381 if (!rpt) {
382 error("can't write crash report %s: %s", loc, strerror(errno));
383 return;
384 }
385
386 fprintf(stderr, "fast-import: dumping crash report to %s\n", loc);
387
388 fprintf(rpt, "fast-import crash report:\n");
389 fprintf(rpt, " fast-import process: %d\n", getpid());
390 fprintf(rpt, " parent process : %d\n", getppid());
391 fprintf(rpt, " at %s\n", show_date(time(NULL), 0, DATE_LOCAL));
392 fputc('\n', rpt);
393
394 fputs("fatal: ", rpt);
4bf53833 395 fputs(err, rpt);
8acb3297
SP
396 fputc('\n', rpt);
397
904b1941
SP
398 fputc('\n', rpt);
399 fputs("Most Recent Commands Before Crash\n", rpt);
400 fputs("---------------------------------\n", rpt);
401 for (rc = cmd_hist.next; rc != &cmd_hist; rc = rc->next) {
402 if (rc->next == &cmd_hist)
403 fputs("* ", rpt);
404 else
405 fputs(" ", rpt);
406 fputs(rc->buf, rpt);
407 fputc('\n', rpt);
408 }
409
8acb3297
SP
410 fputc('\n', rpt);
411 fputs("Active Branch LRU\n", rpt);
412 fputs("-----------------\n", rpt);
413 fprintf(rpt, " active_branches = %lu cur, %lu max\n",
414 cur_active_branches,
415 max_active_branches);
416 fputc('\n', rpt);
417 fputs(" pos clock name\n", rpt);
418 fputs(" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n", rpt);
419 for (b = active_branches, lu = 0; b; b = b->active_next_branch)
420 fprintf(rpt, " %2lu) %6" PRIuMAX" %s\n",
421 ++lu, b->last_commit, b->name);
422
423 fputc('\n', rpt);
424 fputs("Inactive Branches\n", rpt);
425 fputs("-----------------\n", rpt);
426 for (lu = 0; lu < branch_table_sz; lu++) {
427 for (b = branch_table[lu]; b; b = b->table_next_branch)
428 write_branch_report(rpt, b);
429 }
430
431 fputc('\n', rpt);
432 fputs("-------------------\n", rpt);
433 fputs("END OF CRASH REPORT\n", rpt);
434 fclose(rpt);
435}
436
437static NORETURN void die_nicely(const char *err, va_list params)
438{
439 static int zombie;
4bf53833 440 char message[2 * PATH_MAX];
8acb3297 441
4bf53833 442 vsnprintf(message, sizeof(message), err, params);
8acb3297 443 fputs("fatal: ", stderr);
4bf53833 444 fputs(message, stderr);
8acb3297
SP
445 fputc('\n', stderr);
446
447 if (!zombie) {
448 zombie = 1;
4bf53833 449 write_crash_report(message);
8acb3297 450 }
8acb3297
SP
451 exit(128);
452}
6bb5b329 453
03842d8e 454static void alloc_objects(unsigned int cnt)
8bcce301 455{
463acbe1 456 struct object_entry_pool *b;
27d6d290 457
463acbe1 458 b = xmalloc(sizeof(struct object_entry_pool)
27d6d290 459 + cnt * sizeof(struct object_entry));
463acbe1 460 b->next_pool = blocks;
27d6d290
SP
461 b->next_free = b->entries;
462 b->end = b->entries + cnt;
463 blocks = b;
464 alloc_count += cnt;
465}
8bcce301 466
e5b1444b 467static struct object_entry *new_object(unsigned char *sha1)
8bcce301 468{
27d6d290 469 struct object_entry *e;
8bcce301 470
27d6d290 471 if (blocks->next_free == blocks->end)
463acbe1 472 alloc_objects(object_entry_alloc);
8bcce301 473
27d6d290 474 e = blocks->next_free++;
445b8599 475 hashcpy(e->sha1, sha1);
27d6d290 476 return e;
8bcce301
SP
477}
478
e5b1444b 479static struct object_entry *find_object(unsigned char *sha1)
463acbe1
SP
480{
481 unsigned int h = sha1[0] << 8 | sha1[1];
482 struct object_entry *e;
483 for (e = object_table[h]; e; e = e->next)
445b8599 484 if (!hashcmp(sha1, e->sha1))
463acbe1
SP
485 return e;
486 return NULL;
487}
488
e5b1444b 489static struct object_entry *insert_object(unsigned char *sha1)
8bcce301
SP
490{
491 unsigned int h = sha1[0] << 8 | sha1[1];
27d6d290 492 struct object_entry *e = object_table[h];
463acbe1 493 struct object_entry *p = NULL;
8bcce301
SP
494
495 while (e) {
445b8599 496 if (!hashcmp(sha1, e->sha1))
8bcce301
SP
497 return e;
498 p = e;
499 e = e->next;
500 }
501
502 e = new_object(sha1);
463acbe1 503 e->next = NULL;
8bcce301
SP
504 e->offset = 0;
505 if (p)
506 p->next = e;
507 else
27d6d290 508 object_table[h] = e;
8bcce301
SP
509 return e;
510}
db5e523f 511
463acbe1
SP
512static unsigned int hc_str(const char *s, size_t len)
513{
514 unsigned int r = 0;
515 while (len-- > 0)
516 r = r * 31 + *s++;
517 return r;
518}
519
e5b1444b 520static void *pool_alloc(size_t len)
463acbe1
SP
521{
522 struct mem_pool *p;
523 void *r;
524
525 for (p = mem_pool; p; p = p->next_pool)
526 if ((p->end - p->next_free >= len))
527 break;
528
529 if (!p) {
530 if (len >= (mem_pool_alloc/2)) {
531 total_allocd += len;
532 return xmalloc(len);
533 }
534 total_allocd += sizeof(struct mem_pool) + mem_pool_alloc;
535 p = xmalloc(sizeof(struct mem_pool) + mem_pool_alloc);
536 p->next_pool = mem_pool;
69ae5175 537 p->next_free = (char *) p->space;
463acbe1
SP
538 p->end = p->next_free + mem_pool_alloc;
539 mem_pool = p;
540 }
541
542 r = p->next_free;
69ae5175
DM
543 /* round out to a 'uintmax_t' alignment */
544 if (len & (sizeof(uintmax_t) - 1))
545 len += sizeof(uintmax_t) - (len & (sizeof(uintmax_t) - 1));
463acbe1
SP
546 p->next_free += len;
547 return r;
548}
549
e5b1444b 550static void *pool_calloc(size_t count, size_t size)
463acbe1
SP
551{
552 size_t len = count * size;
553 void *r = pool_alloc(len);
554 memset(r, 0, len);
555 return r;
556}
557
e5b1444b 558static char *pool_strdup(const char *s)
463acbe1
SP
559{
560 char *r = pool_alloc(strlen(s) + 1);
561 strcpy(r, s);
562 return r;
563}
564
0ea9f045 565static void insert_mark(uintmax_t idnum, struct object_entry *oe)
d8397168
SP
566{
567 struct mark_set *s = marks;
568 while ((idnum >> s->shift) >= 1024) {
569 s = pool_calloc(1, sizeof(struct mark_set));
570 s->shift = marks->shift + 10;
571 s->data.sets[0] = marks;
572 marks = s;
573 }
574 while (s->shift) {
0ea9f045 575 uintmax_t i = idnum >> s->shift;
d8397168
SP
576 idnum -= i << s->shift;
577 if (!s->data.sets[i]) {
578 s->data.sets[i] = pool_calloc(1, sizeof(struct mark_set));
579 s->data.sets[i]->shift = s->shift - 10;
580 }
581 s = s->data.sets[i];
582 }
583 if (!s->data.marked[idnum])
584 marks_set_count++;
585 s->data.marked[idnum] = oe;
586}
587
e5b1444b 588static struct object_entry *find_mark(uintmax_t idnum)
d8397168 589{
0ea9f045 590 uintmax_t orig_idnum = idnum;
d8397168
SP
591 struct mark_set *s = marks;
592 struct object_entry *oe = NULL;
593 if ((idnum >> s->shift) < 1024) {
594 while (s && s->shift) {
0ea9f045 595 uintmax_t i = idnum >> s->shift;
d8397168
SP
596 idnum -= i << s->shift;
597 s = s->data.sets[i];
598 }
599 if (s)
600 oe = s->data.marked[idnum];
601 }
602 if (!oe)
3efb1f34 603 die("mark :%" PRIuMAX " not declared", orig_idnum);
d8397168
SP
604 return oe;
605}
606
e5b1444b 607static struct atom_str *to_atom(const char *s, unsigned short len)
463acbe1
SP
608{
609 unsigned int hc = hc_str(s, len) % atom_table_sz;
610 struct atom_str *c;
611
612 for (c = atom_table[hc]; c; c = c->next_atom)
613 if (c->str_len == len && !strncmp(s, c->str_dat, len))
614 return c;
615
616 c = pool_alloc(sizeof(struct atom_str) + len + 1);
617 c->str_len = len;
618 strncpy(c->str_dat, s, len);
619 c->str_dat[len] = 0;
620 c->next_atom = atom_table[hc];
621 atom_table[hc] = c;
622 atom_cnt++;
623 return c;
624}
625
e5b1444b 626static struct branch *lookup_branch(const char *name)
463acbe1
SP
627{
628 unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz;
629 struct branch *b;
630
631 for (b = branch_table[hc]; b; b = b->table_next_branch)
632 if (!strcmp(name, b->name))
633 return b;
634 return NULL;
635}
636
e5b1444b 637static struct branch *new_branch(const char *name)
463acbe1
SP
638{
639 unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz;
640 struct branch* b = lookup_branch(name);
641
642 if (b)
643 die("Invalid attempt to create duplicate branch: %s", name);
ea08a6fd 644 switch (check_ref_format(name)) {
257f3020
JH
645 case 0: break; /* its valid */
646 case CHECK_REF_FORMAT_ONELEVEL:
647 break; /* valid, but too few '/', allow anyway */
ea08a6fd 648 default:
c44cdc7e 649 die("Branch name doesn't conform to GIT standards: %s", name);
ea08a6fd 650 }
463acbe1
SP
651
652 b = pool_calloc(1, sizeof(struct branch));
653 b->name = pool_strdup(name);
654 b->table_next_branch = branch_table[hc];
8a8c55ea
SP
655 b->branch_tree.versions[0].mode = S_IFDIR;
656 b->branch_tree.versions[1].mode = S_IFDIR;
734c91f9 657 b->active = 0;
69e74e74 658 b->pack_id = MAX_PACK_ID;
463acbe1
SP
659 branch_table[hc] = b;
660 branch_count++;
661 return b;
662}
663
664static unsigned int hc_entries(unsigned int cnt)
665{
666 cnt = cnt & 7 ? (cnt / 8) + 1 : cnt / 8;
667 return cnt < avail_tree_table_sz ? cnt : avail_tree_table_sz - 1;
668}
669
e5b1444b 670static struct tree_content *new_tree_content(unsigned int cnt)
463acbe1
SP
671{
672 struct avail_tree_content *f, *l = NULL;
673 struct tree_content *t;
674 unsigned int hc = hc_entries(cnt);
675
676 for (f = avail_tree_table[hc]; f; l = f, f = f->next_avail)
677 if (f->entry_capacity >= cnt)
678 break;
679
680 if (f) {
681 if (l)
682 l->next_avail = f->next_avail;
683 else
684 avail_tree_table[hc] = f->next_avail;
685 } else {
686 cnt = cnt & 7 ? ((cnt / 8) + 1) * 8 : cnt;
687 f = pool_alloc(sizeof(*t) + sizeof(t->entries[0]) * cnt);
688 f->entry_capacity = cnt;
689 }
690
691 t = (struct tree_content*)f;
692 t->entry_count = 0;
4cabf858 693 t->delta_depth = 0;
463acbe1
SP
694 return t;
695}
696
697static void release_tree_entry(struct tree_entry *e);
698static void release_tree_content(struct tree_content *t)
699{
700 struct avail_tree_content *f = (struct avail_tree_content*)t;
701 unsigned int hc = hc_entries(f->entry_capacity);
afde8dd9
SP
702 f->next_avail = avail_tree_table[hc];
703 avail_tree_table[hc] = f;
704}
705
706static void release_tree_content_recursive(struct tree_content *t)
707{
463acbe1
SP
708 unsigned int i;
709 for (i = 0; i < t->entry_count; i++)
710 release_tree_entry(t->entries[i]);
afde8dd9 711 release_tree_content(t);
463acbe1
SP
712}
713
e5b1444b 714static struct tree_content *grow_tree_content(
463acbe1
SP
715 struct tree_content *t,
716 int amt)
717{
718 struct tree_content *r = new_tree_content(t->entry_count + amt);
719 r->entry_count = t->entry_count;
4cabf858 720 r->delta_depth = t->delta_depth;
463acbe1
SP
721 memcpy(r->entries,t->entries,t->entry_count*sizeof(t->entries[0]));
722 release_tree_content(t);
723 return r;
724}
725
e5b1444b 726static struct tree_entry *new_tree_entry(void)
463acbe1
SP
727{
728 struct tree_entry *e;
729
730 if (!avail_tree_entry) {
731 unsigned int n = tree_entry_alloc;
8435a9cb 732 total_allocd += n * sizeof(struct tree_entry);
463acbe1 733 avail_tree_entry = e = xmalloc(n * sizeof(struct tree_entry));
2eb26d84 734 while (n-- > 1) {
463acbe1
SP
735 *((void**)e) = e + 1;
736 e++;
737 }
35ef237c 738 *((void**)e) = NULL;
463acbe1
SP
739 }
740
741 e = avail_tree_entry;
742 avail_tree_entry = *((void**)e);
743 return e;
744}
745
746static void release_tree_entry(struct tree_entry *e)
747{
748 if (e->tree)
afde8dd9 749 release_tree_content_recursive(e->tree);
463acbe1
SP
750 *((void**)e) = avail_tree_entry;
751 avail_tree_entry = e;
752}
753
b6f3481b
SP
754static struct tree_content *dup_tree_content(struct tree_content *s)
755{
756 struct tree_content *d;
757 struct tree_entry *a, *b;
758 unsigned int i;
759
760 if (!s)
761 return NULL;
762 d = new_tree_content(s->entry_count);
763 for (i = 0; i < s->entry_count; i++) {
764 a = s->entries[i];
765 b = new_tree_entry();
766 memcpy(b, a, sizeof(*a));
767 if (a->tree && is_null_sha1(b->versions[1].sha1))
768 b->tree = dup_tree_content(a->tree);
769 else
770 b->tree = NULL;
771 d->entries[i] = b;
772 }
773 d->entry_count = s->entry_count;
774 d->delta_depth = s->delta_depth;
775
776 return d;
777}
778
fd99224e 779static void start_packfile(void)
f70b6534 780{
8455e484 781 static char tmpfile[PATH_MAX];
7bfe6e26 782 struct packed_git *p;
f70b6534 783 struct pack_header hdr;
0fcbcae7 784 int pack_fd;
f70b6534 785
8455e484 786 snprintf(tmpfile, sizeof(tmpfile),
0e55181f 787 "%s/tmp_pack_XXXXXX", get_object_directory());
7647b17f 788 pack_fd = xmkstemp(tmpfile);
8455e484
SP
789 p = xcalloc(1, sizeof(*p) + strlen(tmpfile) + 2);
790 strcpy(p->pack_name, tmpfile);
7bfe6e26 791 p->pack_fd = pack_fd;
f70b6534
SP
792
793 hdr.hdr_signature = htonl(PACK_SIGNATURE);
794 hdr.hdr_version = htonl(2);
795 hdr.hdr_entries = 0;
0fcbcae7 796 write_or_die(p->pack_fd, &hdr, sizeof(hdr));
7bfe6e26
SP
797
798 pack_data = p;
f70b6534
SP
799 pack_size = sizeof(hdr);
800 object_count = 0;
7bfe6e26
SP
801
802 all_packs = xrealloc(all_packs, sizeof(*all_packs) * (pack_id + 1));
803 all_packs[pack_id] = p;
f70b6534
SP
804}
805
f70b6534
SP
806static int oecmp (const void *a_, const void *b_)
807{
808 struct object_entry *a = *((struct object_entry**)a_);
809 struct object_entry *b = *((struct object_entry**)b_);
810 return hashcmp(a->sha1, b->sha1);
811}
812
e5b1444b 813static char *create_index(void)
f70b6534 814{
8455e484
SP
815 static char tmpfile[PATH_MAX];
816 SHA_CTX ctx;
f70b6534
SP
817 struct sha1file *f;
818 struct object_entry **idx, **c, **last, *e;
819 struct object_entry_pool *o;
ebea9dd4 820 uint32_t array[256];
8455e484 821 int i, idx_fd;
f70b6534
SP
822
823 /* Build the sorted table of object IDs. */
824 idx = xmalloc(object_count * sizeof(struct object_entry*));
825 c = idx;
826 for (o = blocks; o; o = o->next_pool)
d9ee53ce
SP
827 for (e = o->next_free; e-- != o->entries;)
828 if (pack_id == e->pack_id)
829 *c++ = e;
f70b6534 830 last = idx + object_count;
2fce1f3c
SP
831 if (c != last)
832 die("internal consistency error creating the index");
f70b6534
SP
833 qsort(idx, object_count, sizeof(struct object_entry*), oecmp);
834
835 /* Generate the fan-out array. */
836 c = idx;
837 for (i = 0; i < 256; i++) {
838 struct object_entry **next = c;;
839 while (next < last) {
840 if ((*next)->sha1[0] != i)
841 break;
842 next++;
843 }
844 array[i] = htonl(next - idx);
845 c = next;
846 }
847
8455e484 848 snprintf(tmpfile, sizeof(tmpfile),
0e55181f 849 "%s/tmp_idx_XXXXXX", get_object_directory());
7647b17f 850 idx_fd = xmkstemp(tmpfile);
8455e484 851 f = sha1fd(idx_fd, tmpfile);
f70b6534 852 sha1write(f, array, 256 * sizeof(int));
8455e484 853 SHA1_Init(&ctx);
f70b6534 854 for (c = idx; c != last; c++) {
ebea9dd4 855 uint32_t offset = htonl((*c)->offset);
f70b6534
SP
856 sha1write(f, &offset, 4);
857 sha1write(f, (*c)->sha1, sizeof((*c)->sha1));
8455e484 858 SHA1_Update(&ctx, (*c)->sha1, 20);
f70b6534 859 }
09543c96 860 sha1write(f, pack_data->sha1, sizeof(pack_data->sha1));
8455e484 861 sha1close(f, NULL, 1);
f70b6534 862 free(idx);
8455e484
SP
863 SHA1_Final(pack_data->sha1, &ctx);
864 return tmpfile;
865}
866
e5b1444b 867static char *keep_pack(char *curr_index_name)
8455e484
SP
868{
869 static char name[PATH_MAX];
3a55602e 870 static const char *keep_msg = "fast-import";
8455e484
SP
871 int keep_fd;
872
873 chmod(pack_data->pack_name, 0444);
874 chmod(curr_index_name, 0444);
875
876 snprintf(name, sizeof(name), "%s/pack/pack-%s.keep",
877 get_object_directory(), sha1_to_hex(pack_data->sha1));
878 keep_fd = open(name, O_RDWR|O_CREAT|O_EXCL, 0600);
879 if (keep_fd < 0)
880 die("cannot create keep file");
95693d45
JM
881 write_or_die(keep_fd, keep_msg, strlen(keep_msg));
882 if (close(keep_fd))
883 die("failed to write keep file");
8455e484
SP
884
885 snprintf(name, sizeof(name), "%s/pack/pack-%s.pack",
886 get_object_directory(), sha1_to_hex(pack_data->sha1));
887 if (move_temp_to_file(pack_data->pack_name, name))
888 die("cannot store pack file");
8455e484
SP
889
890 snprintf(name, sizeof(name), "%s/pack/pack-%s.idx",
891 get_object_directory(), sha1_to_hex(pack_data->sha1));
892 if (move_temp_to_file(curr_index_name, name))
893 die("cannot store index file");
894 return name;
895}
896
fd99224e 897static void unkeep_all_packs(void)
8455e484
SP
898{
899 static char name[PATH_MAX];
900 int k;
901
902 for (k = 0; k < pack_id; k++) {
903 struct packed_git *p = all_packs[k];
904 snprintf(name, sizeof(name), "%s/pack/pack-%s.keep",
905 get_object_directory(), sha1_to_hex(p->sha1));
906 unlink(name);
907 }
f70b6534
SP
908}
909
fd99224e 910static void end_packfile(void)
f70b6534 911{
7bfe6e26
SP
912 struct packed_git *old_p = pack_data, *new_p;
913
3e005baf 914 if (object_count) {
8455e484 915 char *idx_name;
2369ed79
SP
916 int i;
917 struct branch *b;
918 struct tag *t;
8455e484 919
8b0eca7c
DH
920 fixup_pack_header_footer(pack_data->pack_fd, pack_data->sha1,
921 pack_data->pack_name, object_count);
922 close(pack_data->pack_fd);
8455e484 923 idx_name = keep_pack(create_index());
3e005baf
SP
924
925 /* Register the packfile with core git's machinary. */
926 new_p = add_packed_git(idx_name, strlen(idx_name), 1);
927 if (!new_p)
928 die("core git rejected index %s", idx_name);
929 new_p->windows = old_p->windows;
2369ed79 930 all_packs[pack_id] = new_p;
3e005baf 931 install_packed_git(new_p);
2369ed79
SP
932
933 /* Print the boundary */
bdf1c06d
SP
934 if (pack_edges) {
935 fprintf(pack_edges, "%s:", new_p->pack_name);
936 for (i = 0; i < branch_table_sz; i++) {
937 for (b = branch_table[i]; b; b = b->table_next_branch) {
938 if (b->pack_id == pack_id)
939 fprintf(pack_edges, " %s", sha1_to_hex(b->sha1));
940 }
2369ed79 941 }
bdf1c06d
SP
942 for (t = first_tag; t; t = t->next_tag) {
943 if (t->pack_id == pack_id)
944 fprintf(pack_edges, " %s", sha1_to_hex(t->sha1));
945 }
946 fputc('\n', pack_edges);
947 fflush(pack_edges);
2369ed79 948 }
2369ed79
SP
949
950 pack_id++;
3e005baf 951 }
12801587 952 else
3e005baf 953 unlink(old_p->pack_name);
7bfe6e26 954 free(old_p);
7bfe6e26
SP
955
956 /* We can't carry a delta across packfiles. */
05576569 957 strbuf_release(&last_blob.data);
7bfe6e26
SP
958 last_blob.offset = 0;
959 last_blob.depth = 0;
f70b6534
SP
960}
961
820b9310 962static void cycle_packfile(void)
d9ee53ce
SP
963{
964 end_packfile();
965 start_packfile();
966}
967
c44cdc7e 968static size_t encode_header(
ac47a738 969 enum object_type type,
c44cdc7e 970 size_t size,
ac47a738 971 unsigned char *hdr)
db5e523f
SP
972{
973 int n = 1;
974 unsigned char c;
975
1fcdd62a 976 if (type < OBJ_COMMIT || type > OBJ_REF_DELTA)
db5e523f
SP
977 die("bad type %d", type);
978
979 c = (type << 4) | (size & 15);
980 size >>= 4;
981 while (size) {
982 *hdr++ = c | 0x80;
983 c = size & 0x7f;
984 size >>= 7;
985 n++;
986 }
987 *hdr = c;
988 return n;
989}
990
ac47a738
SP
991static int store_object(
992 enum object_type type,
eec813cf 993 struct strbuf *dat,
6bb5b329 994 struct last_object *last,
d8397168 995 unsigned char *sha1out,
0ea9f045 996 uintmax_t mark)
db5e523f 997{
db5e523f 998 void *out, *delta;
ac47a738
SP
999 struct object_entry *e;
1000 unsigned char hdr[96];
1001 unsigned char sha1[20];
db5e523f 1002 unsigned long hdrlen, deltalen;
ac47a738
SP
1003 SHA_CTX c;
1004 z_stream s;
1005
df843662 1006 hdrlen = sprintf((char*)hdr,"%s %lu", typename(type),
eec813cf 1007 (unsigned long)dat->len) + 1;
ac47a738
SP
1008 SHA1_Init(&c);
1009 SHA1_Update(&c, hdr, hdrlen);
eec813cf 1010 SHA1_Update(&c, dat->buf, dat->len);
ac47a738 1011 SHA1_Final(sha1, &c);
6bb5b329 1012 if (sha1out)
445b8599 1013 hashcpy(sha1out, sha1);
ac47a738
SP
1014
1015 e = insert_object(sha1);
d8397168
SP
1016 if (mark)
1017 insert_mark(mark, e);
ac47a738 1018 if (e->offset) {
6143f064 1019 duplicate_count_by_type[type]++;
463acbe1 1020 return 1;
a5c1780a
SP
1021 } else if (find_sha1_pack(sha1, packed_git)) {
1022 e->type = type;
1023 e->pack_id = MAX_PACK_ID;
1024 e->offset = 1; /* just not zero! */
1025 duplicate_count_by_type[type]++;
1026 return 1;
ac47a738 1027 }
db5e523f 1028
05576569
PH
1029 if (last && last->data.buf && last->depth < max_depth) {
1030 delta = diff_delta(last->data.buf, last->data.len,
eec813cf 1031 dat->buf, dat->len,
db5e523f 1032 &deltalen, 0);
eec813cf 1033 if (delta && deltalen >= dat->len) {
d9ee53ce
SP
1034 free(delta);
1035 delta = NULL;
1036 }
1037 } else
1038 delta = NULL;
db5e523f
SP
1039
1040 memset(&s, 0, sizeof(s));
1041 deflateInit(&s, zlib_compression_level);
d9ee53ce
SP
1042 if (delta) {
1043 s.next_in = delta;
1044 s.avail_in = deltalen;
1045 } else {
eec813cf
PH
1046 s.next_in = (void *)dat->buf;
1047 s.avail_in = dat->len;
d9ee53ce
SP
1048 }
1049 s.avail_out = deflateBound(&s, s.avail_in);
1050 s.next_out = out = xmalloc(s.avail_out);
1051 while (deflate(&s, Z_FINISH) == Z_OK)
1052 /* nothing */;
1053 deflateEnd(&s);
1054
1055 /* Determine if we should auto-checkpoint. */
e5808826 1056 if ((pack_size + 60 + s.total_out) > max_packsize
d9ee53ce
SP
1057 || (pack_size + 60 + s.total_out) < pack_size) {
1058
1059 /* This new object needs to *not* have the current pack_id. */
1060 e->pack_id = pack_id + 1;
820b9310 1061 cycle_packfile();
d9ee53ce
SP
1062
1063 /* We cannot carry a delta into the new pack. */
1064 if (delta) {
1065 free(delta);
1066 delta = NULL;
5d6f3ef6
SP
1067
1068 memset(&s, 0, sizeof(s));
1069 deflateInit(&s, zlib_compression_level);
eec813cf
PH
1070 s.next_in = (void *)dat->buf;
1071 s.avail_in = dat->len;
5d6f3ef6
SP
1072 s.avail_out = deflateBound(&s, s.avail_in);
1073 s.next_out = out = xrealloc(out, s.avail_out);
1074 while (deflate(&s, Z_FINISH) == Z_OK)
1075 /* nothing */;
1076 deflateEnd(&s);
d9ee53ce 1077 }
d9ee53ce
SP
1078 }
1079
1080 e->type = type;
1081 e->pack_id = pack_id;
1082 e->offset = pack_size;
1083 object_count++;
1084 object_count_by_type[type]++;
db5e523f
SP
1085
1086 if (delta) {
d489bc14
SP
1087 unsigned long ofs = e->offset - last->offset;
1088 unsigned pos = sizeof(hdr) - 1;
1089
4cabf858 1090 delta_count_by_type[type]++;
436e7a74 1091 e->depth = last->depth + 1;
d489bc14
SP
1092
1093 hdrlen = encode_header(OBJ_OFS_DELTA, deltalen, hdr);
0fcbcae7 1094 write_or_die(pack_data->pack_fd, hdr, hdrlen);
d489bc14
SP
1095 pack_size += hdrlen;
1096
1097 hdr[pos] = ofs & 127;
1098 while (ofs >>= 7)
1099 hdr[--pos] = 128 | (--ofs & 127);
0fcbcae7 1100 write_or_die(pack_data->pack_fd, hdr + pos, sizeof(hdr) - pos);
d489bc14 1101 pack_size += sizeof(hdr) - pos;
db5e523f 1102 } else {
436e7a74 1103 e->depth = 0;
eec813cf 1104 hdrlen = encode_header(type, dat->len, hdr);
0fcbcae7 1105 write_or_die(pack_data->pack_fd, hdr, hdrlen);
41e5257f 1106 pack_size += hdrlen;
db5e523f
SP
1107 }
1108
0fcbcae7 1109 write_or_die(pack_data->pack_fd, out, s.total_out);
41e5257f 1110 pack_size += s.total_out;
db5e523f
SP
1111
1112 free(out);
e7d06a4b 1113 free(delta);
463acbe1 1114 if (last) {
05576569
PH
1115 if (last->no_swap) {
1116 last->data = *dat;
1117 } else {
c76689df 1118 strbuf_swap(&last->data, dat);
05576569 1119 }
d489bc14 1120 last->offset = e->offset;
436e7a74 1121 last->depth = e->depth;
463acbe1
SP
1122 }
1123 return 0;
1124}
1125
7bfe6e26
SP
1126static void *gfi_unpack_entry(
1127 struct object_entry *oe,
1128 unsigned long *sizep)
41e5257f 1129{
21666f1a 1130 enum object_type type;
7bfe6e26
SP
1131 struct packed_git *p = all_packs[oe->pack_id];
1132 if (p == pack_data)
1133 p->pack_size = pack_size + 20;
21666f1a 1134 return unpack_entry(p, oe->offset, &type, sizep);
41e5257f
SP
1135}
1136
10831c55 1137static const char *get_mode(const char *str, uint16_t *modep)
463acbe1
SP
1138{
1139 unsigned char c;
10831c55 1140 uint16_t mode = 0;
463acbe1
SP
1141
1142 while ((c = *str++) != ' ') {
1143 if (c < '0' || c > '7')
1144 return NULL;
1145 mode = (mode << 3) + (c - '0');
1146 }
1147 *modep = mode;
1148 return str;
1149}
1150
1151static void load_tree(struct tree_entry *root)
1152{
4cabf858 1153 unsigned char* sha1 = root->versions[1].sha1;
463acbe1
SP
1154 struct object_entry *myoe;
1155 struct tree_content *t;
1156 unsigned long size;
1157 char *buf;
1158 const char *c;
463acbe1
SP
1159
1160 root->tree = t = new_tree_content(8);
4cabf858 1161 if (is_null_sha1(sha1))
463acbe1
SP
1162 return;
1163
4cabf858 1164 myoe = find_object(sha1);
20f546a8 1165 if (myoe && myoe->pack_id != MAX_PACK_ID) {
41e5257f 1166 if (myoe->type != OBJ_TREE)
4cabf858 1167 die("Not a tree: %s", sha1_to_hex(sha1));
436e7a74 1168 t->delta_depth = myoe->depth;
7bfe6e26 1169 buf = gfi_unpack_entry(myoe, &size);
463acbe1 1170 } else {
21666f1a
NP
1171 enum object_type type;
1172 buf = read_sha1_file(sha1, &type, &size);
1173 if (!buf || type != OBJ_TREE)
4cabf858 1174 die("Can't load tree %s", sha1_to_hex(sha1));
463acbe1
SP
1175 }
1176
1177 c = buf;
1178 while (c != (buf + size)) {
1179 struct tree_entry *e = new_tree_entry();
1180
1181 if (t->entry_count == t->entry_capacity)
f022f85f 1182 root->tree = t = grow_tree_content(t, t->entry_count);
463acbe1
SP
1183 t->entries[t->entry_count++] = e;
1184
1185 e->tree = NULL;
4cabf858 1186 c = get_mode(c, &e->versions[1].mode);
463acbe1 1187 if (!c)
4cabf858
SP
1188 die("Corrupt mode in %s", sha1_to_hex(sha1));
1189 e->versions[0].mode = e->versions[1].mode;
061e35c5 1190 e->name = to_atom(c, strlen(c));
463acbe1 1191 c += e->name->str_len + 1;
4cabf858
SP
1192 hashcpy(e->versions[0].sha1, (unsigned char*)c);
1193 hashcpy(e->versions[1].sha1, (unsigned char*)c);
463acbe1
SP
1194 c += 20;
1195 }
1196 free(buf);
1197}
1198
4cabf858 1199static int tecmp0 (const void *_a, const void *_b)
463acbe1
SP
1200{
1201 struct tree_entry *a = *((struct tree_entry**)_a);
1202 struct tree_entry *b = *((struct tree_entry**)_b);
1203 return base_name_compare(
4cabf858
SP
1204 a->name->str_dat, a->name->str_len, a->versions[0].mode,
1205 b->name->str_dat, b->name->str_len, b->versions[0].mode);
463acbe1
SP
1206}
1207
4cabf858 1208static int tecmp1 (const void *_a, const void *_b)
463acbe1 1209{
4cabf858
SP
1210 struct tree_entry *a = *((struct tree_entry**)_a);
1211 struct tree_entry *b = *((struct tree_entry**)_b);
1212 return base_name_compare(
1213 a->name->str_dat, a->name->str_len, a->versions[1].mode,
1214 b->name->str_dat, b->name->str_len, b->versions[1].mode);
1215}
1216
eec813cf 1217static void mktree(struct tree_content *t, int v, struct strbuf *b)
4cabf858
SP
1218{
1219 size_t maxlen = 0;
463acbe1 1220 unsigned int i;
463acbe1 1221
4cabf858
SP
1222 if (!v)
1223 qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp0);
1224 else
1225 qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp1);
463acbe1 1226
463acbe1 1227 for (i = 0; i < t->entry_count; i++) {
4cabf858
SP
1228 if (t->entries[i]->versions[v].mode)
1229 maxlen += t->entries[i]->name->str_len + 34;
463acbe1
SP
1230 }
1231
eec813cf
PH
1232 strbuf_reset(b);
1233 strbuf_grow(b, maxlen);
463acbe1
SP
1234 for (i = 0; i < t->entry_count; i++) {
1235 struct tree_entry *e = t->entries[i];
4cabf858
SP
1236 if (!e->versions[v].mode)
1237 continue;
eec813cf
PH
1238 strbuf_addf(b, "%o %s%c", (unsigned int)e->versions[v].mode,
1239 e->name->str_dat, '\0');
1240 strbuf_add(b, e->versions[v].sha1, 20);
463acbe1 1241 }
4cabf858
SP
1242}
1243
1244static void store_tree(struct tree_entry *root)
1245{
1246 struct tree_content *t = root->tree;
1247 unsigned int i, j, del;
05576569 1248 struct last_object lo = { STRBUF_INIT, 0, 0, /* no_swap */ 1 };
d489bc14 1249 struct object_entry *le;
4cabf858
SP
1250
1251 if (!is_null_sha1(root->versions[1].sha1))
1252 return;
1253
1254 for (i = 0; i < t->entry_count; i++) {
1255 if (t->entries[i]->tree)
1256 store_tree(t->entries[i]);
1257 }
1258
d489bc14 1259 le = find_object(root->versions[0].sha1);
05576569 1260 if (S_ISDIR(root->versions[0].mode) && le && le->pack_id == pack_id) {
eec813cf 1261 mktree(t, 0, &old_tree);
05576569 1262 lo.data = old_tree;
d489bc14 1263 lo.offset = le->offset;
4cabf858 1264 lo.depth = t->delta_depth;
4cabf858 1265 }
4cabf858 1266
eec813cf
PH
1267 mktree(t, 1, &new_tree);
1268 store_object(OBJ_TREE, &new_tree, &lo, root->versions[1].sha1, 0);
4cabf858
SP
1269
1270 t->delta_depth = lo.depth;
4cabf858
SP
1271 for (i = 0, j = 0, del = 0; i < t->entry_count; i++) {
1272 struct tree_entry *e = t->entries[i];
1273 if (e->versions[1].mode) {
1274 e->versions[0].mode = e->versions[1].mode;
1275 hashcpy(e->versions[0].sha1, e->versions[1].sha1);
1276 t->entries[j++] = e;
1277 } else {
1278 release_tree_entry(e);
1279 del++;
1280 }
1281 }
1282 t->entry_count -= del;
463acbe1
SP
1283}
1284
1285static int tree_content_set(
1286 struct tree_entry *root,
1287 const char *p,
1288 const unsigned char *sha1,
f39a946a
SP
1289 const uint16_t mode,
1290 struct tree_content *subtree)
463acbe1
SP
1291{
1292 struct tree_content *t = root->tree;
1293 const char *slash1;
1294 unsigned int i, n;
1295 struct tree_entry *e;
1296
1297 slash1 = strchr(p, '/');
1298 if (slash1)
1299 n = slash1 - p;
1300 else
1301 n = strlen(p);
475d1b33
SP
1302 if (!n)
1303 die("Empty path component found in input");
f39a946a
SP
1304 if (!slash1 && !S_ISDIR(mode) && subtree)
1305 die("Non-directories cannot have subtrees");
463acbe1
SP
1306
1307 for (i = 0; i < t->entry_count; i++) {
1308 e = t->entries[i];
1309 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
1310 if (!slash1) {
f39a946a
SP
1311 if (!S_ISDIR(mode)
1312 && e->versions[1].mode == mode
4cabf858 1313 && !hashcmp(e->versions[1].sha1, sha1))
463acbe1 1314 return 0;
4cabf858
SP
1315 e->versions[1].mode = mode;
1316 hashcpy(e->versions[1].sha1, sha1);
f39a946a 1317 if (e->tree)
afde8dd9 1318 release_tree_content_recursive(e->tree);
f39a946a 1319 e->tree = subtree;
4cabf858 1320 hashclr(root->versions[1].sha1);
463acbe1
SP
1321 return 1;
1322 }
4cabf858 1323 if (!S_ISDIR(e->versions[1].mode)) {
463acbe1 1324 e->tree = new_tree_content(8);
4cabf858 1325 e->versions[1].mode = S_IFDIR;
463acbe1
SP
1326 }
1327 if (!e->tree)
1328 load_tree(e);
f39a946a 1329 if (tree_content_set(e, slash1 + 1, sha1, mode, subtree)) {
4cabf858 1330 hashclr(root->versions[1].sha1);
463acbe1
SP
1331 return 1;
1332 }
1333 return 0;
1334 }
1335 }
1336
1337 if (t->entry_count == t->entry_capacity)
f022f85f 1338 root->tree = t = grow_tree_content(t, t->entry_count);
463acbe1 1339 e = new_tree_entry();
061e35c5 1340 e->name = to_atom(p, n);
4cabf858
SP
1341 e->versions[0].mode = 0;
1342 hashclr(e->versions[0].sha1);
463acbe1
SP
1343 t->entries[t->entry_count++] = e;
1344 if (slash1) {
1345 e->tree = new_tree_content(8);
4cabf858 1346 e->versions[1].mode = S_IFDIR;
f39a946a 1347 tree_content_set(e, slash1 + 1, sha1, mode, subtree);
463acbe1 1348 } else {
f39a946a 1349 e->tree = subtree;
4cabf858
SP
1350 e->versions[1].mode = mode;
1351 hashcpy(e->versions[1].sha1, sha1);
463acbe1 1352 }
4cabf858 1353 hashclr(root->versions[1].sha1);
463acbe1
SP
1354 return 1;
1355}
1356
f39a946a
SP
1357static int tree_content_remove(
1358 struct tree_entry *root,
1359 const char *p,
1360 struct tree_entry *backup_leaf)
463acbe1
SP
1361{
1362 struct tree_content *t = root->tree;
1363 const char *slash1;
1364 unsigned int i, n;
1365 struct tree_entry *e;
1366
1367 slash1 = strchr(p, '/');
1368 if (slash1)
1369 n = slash1 - p;
1370 else
1371 n = strlen(p);
1372
1373 for (i = 0; i < t->entry_count; i++) {
1374 e = t->entries[i];
1375 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
4cabf858 1376 if (!slash1 || !S_ISDIR(e->versions[1].mode))
463acbe1
SP
1377 goto del_entry;
1378 if (!e->tree)
1379 load_tree(e);
f39a946a 1380 if (tree_content_remove(e, slash1 + 1, backup_leaf)) {
b54d6422
SP
1381 for (n = 0; n < e->tree->entry_count; n++) {
1382 if (e->tree->entries[n]->versions[1].mode) {
1383 hashclr(root->versions[1].sha1);
1384 return 1;
1385 }
1386 }
f39a946a 1387 backup_leaf = NULL;
b54d6422 1388 goto del_entry;
463acbe1
SP
1389 }
1390 return 0;
1391 }
1392 }
1393 return 0;
1394
1395del_entry:
f39a946a
SP
1396 if (backup_leaf)
1397 memcpy(backup_leaf, e, sizeof(*backup_leaf));
1398 else if (e->tree)
4cabf858 1399 release_tree_content_recursive(e->tree);
f39a946a 1400 e->tree = NULL;
4cabf858
SP
1401 e->versions[1].mode = 0;
1402 hashclr(e->versions[1].sha1);
1403 hashclr(root->versions[1].sha1);
ac47a738 1404 return 1;
db5e523f
SP
1405}
1406
b6f3481b
SP
1407static int tree_content_get(
1408 struct tree_entry *root,
1409 const char *p,
1410 struct tree_entry *leaf)
1411{
1412 struct tree_content *t = root->tree;
1413 const char *slash1;
1414 unsigned int i, n;
1415 struct tree_entry *e;
1416
1417 slash1 = strchr(p, '/');
1418 if (slash1)
1419 n = slash1 - p;
1420 else
1421 n = strlen(p);
1422
1423 for (i = 0; i < t->entry_count; i++) {
1424 e = t->entries[i];
1425 if (e->name->str_len == n && !strncmp(p, e->name->str_dat, n)) {
1426 if (!slash1) {
1427 memcpy(leaf, e, sizeof(*leaf));
1428 if (e->tree && is_null_sha1(e->versions[1].sha1))
1429 leaf->tree = dup_tree_content(e->tree);
1430 else
1431 leaf->tree = NULL;
1432 return 1;
1433 }
1434 if (!S_ISDIR(e->versions[1].mode))
1435 return 0;
1436 if (!e->tree)
1437 load_tree(e);
1438 return tree_content_get(e, slash1 + 1, leaf);
1439 }
1440 }
1441 return 0;
1442}
1443
7073e69e 1444static int update_branch(struct branch *b)
463acbe1
SP
1445{
1446 static const char *msg = "fast-import";
7073e69e
SP
1447 struct ref_lock *lock;
1448 unsigned char old_sha1[20];
1449
1450 if (read_ref(b->name, old_sha1))
1451 hashclr(old_sha1);
68db31cc 1452 lock = lock_any_ref_for_update(b->name, old_sha1, 0);
7073e69e
SP
1453 if (!lock)
1454 return error("Unable to lock %s", b->name);
1455 if (!force_update && !is_null_sha1(old_sha1)) {
1456 struct commit *old_cmit, *new_cmit;
1457
1458 old_cmit = lookup_commit_reference_gently(old_sha1, 0);
1459 new_cmit = lookup_commit_reference_gently(b->sha1, 0);
1460 if (!old_cmit || !new_cmit) {
1461 unlock_ref(lock);
1462 return error("Branch %s is missing commits.", b->name);
1463 }
1464
4a164d48 1465 if (!in_merge_bases(old_cmit, &new_cmit, 1)) {
7073e69e 1466 unlock_ref(lock);
46efd2d9 1467 warning("Not updating %s"
7073e69e
SP
1468 " (new tip %s does not contain %s)",
1469 b->name, sha1_to_hex(b->sha1), sha1_to_hex(old_sha1));
1470 return -1;
1471 }
1472 }
1473 if (write_ref_sha1(lock, b->sha1, msg) < 0)
1474 return error("Unable to update %s", b->name);
1475 return 0;
1476}
1477
1478static void dump_branches(void)
1479{
463acbe1
SP
1480 unsigned int i;
1481 struct branch *b;
463acbe1
SP
1482
1483 for (i = 0; i < branch_table_sz; i++) {
7073e69e
SP
1484 for (b = branch_table[i]; b; b = b->table_next_branch)
1485 failure |= update_branch(b);
463acbe1
SP
1486 }
1487}
1488
fd99224e 1489static void dump_tags(void)
72303d44
SP
1490{
1491 static const char *msg = "fast-import";
1492 struct tag *t;
1493 struct ref_lock *lock;
7073e69e 1494 char ref_name[PATH_MAX];
72303d44
SP
1495
1496 for (t = first_tag; t; t = t->next_tag) {
7073e69e
SP
1497 sprintf(ref_name, "tags/%s", t->name);
1498 lock = lock_ref_sha1(ref_name, NULL);
72303d44 1499 if (!lock || write_ref_sha1(lock, t->sha1, msg) < 0)
7073e69e 1500 failure |= error("Unable to update %s", ref_name);
72303d44
SP
1501 }
1502}
1503
a6a1a831 1504static void dump_marks_helper(FILE *f,
0ea9f045 1505 uintmax_t base,
a6a1a831
SP
1506 struct mark_set *m)
1507{
0ea9f045 1508 uintmax_t k;
a6a1a831
SP
1509 if (m->shift) {
1510 for (k = 0; k < 1024; k++) {
1511 if (m->data.sets[k])
1512 dump_marks_helper(f, (base + k) << m->shift,
1513 m->data.sets[k]);
1514 }
1515 } else {
1516 for (k = 0; k < 1024; k++) {
1517 if (m->data.marked[k])
3efb1f34 1518 fprintf(f, ":%" PRIuMAX " %s\n", base + k,
a6a1a831
SP
1519 sha1_to_hex(m->data.marked[k]->sha1));
1520 }
1521 }
1522}
1523
fd99224e 1524static void dump_marks(void)
a6a1a831 1525{
60b9004c
SP
1526 static struct lock_file mark_lock;
1527 int mark_fd;
1528 FILE *f;
1529
1530 if (!mark_file)
1531 return;
1532
1533 mark_fd = hold_lock_file_for_update(&mark_lock, mark_file, 0);
1534 if (mark_fd < 0) {
1535 failure |= error("Unable to write marks file %s: %s",
1536 mark_file, strerror(errno));
1537 return;
a6a1a831 1538 }
60b9004c
SP
1539
1540 f = fdopen(mark_fd, "w");
1541 if (!f) {
1542 rollback_lock_file(&mark_lock);
1543 failure |= error("Unable to write marks file %s: %s",
1544 mark_file, strerror(errno));
1545 return;
a6a1a831 1546 }
60b9004c
SP
1547
1548 dump_marks_helper(f, 0, marks);
4ed7cd3a 1549 if (ferror(f) || fclose(f))
60b9004c
SP
1550 failure |= error("Unable to write marks file %s: %s",
1551 mark_file, strerror(errno));
4ed7cd3a
BC
1552 /*
1553 * Since the lock file was fdopen()'ed and then fclose()'ed above,
1554 * assign -1 to the lock file descriptor so that commit_lock_file()
1555 * won't try to close() it.
1556 */
1557 mark_lock.fd = -1;
1558 if (commit_lock_file(&mark_lock))
1559 failure |= error("Unable to write commit file %s: %s",
1560 mark_file, strerror(errno));
a6a1a831
SP
1561}
1562
e6c019d0 1563static int read_next_command(void)
c44cdc7e 1564{
e6c019d0
PH
1565 static int stdin_eof = 0;
1566
1567 if (stdin_eof) {
1568 unread_command_buf = 0;
1569 return EOF;
1570 }
1571
401d53fa 1572 do {
904b1941 1573 if (unread_command_buf) {
1fdb649c 1574 unread_command_buf = 0;
904b1941
SP
1575 } else {
1576 struct recent_command *rc;
1577
b315c5c0 1578 strbuf_detach(&command_buf, NULL);
e6c019d0
PH
1579 stdin_eof = strbuf_getline(&command_buf, stdin, '\n');
1580 if (stdin_eof)
1581 return EOF;
904b1941
SP
1582
1583 rc = rc_free;
1584 if (rc)
1585 rc_free = rc->next;
1586 else {
1587 rc = cmd_hist.next;
1588 cmd_hist.next = rc->next;
1589 cmd_hist.next->prev = &cmd_hist;
1590 free(rc->buf);
1591 }
1592
1593 rc->buf = command_buf.buf;
1594 rc->prev = cmd_tail;
1595 rc->next = cmd_hist.prev;
1596 rc->prev->next = rc;
1597 cmd_tail = rc;
1598 }
1599 } while (command_buf.buf[0] == '#');
e6c019d0
PH
1600
1601 return 0;
c44cdc7e
SP
1602}
1603
7e5dcea8 1604static void skip_optional_lf(void)
2c570cde
SP
1605{
1606 int term_char = fgetc(stdin);
1607 if (term_char != '\n' && term_char != EOF)
1608 ungetc(term_char, stdin);
1609}
1610
fd99224e 1611static void cmd_mark(void)
c44cdc7e 1612{
599065a3 1613 if (!prefixcmp(command_buf.buf, "mark :")) {
0ea9f045 1614 next_mark = strtoumax(command_buf.buf + 6, NULL, 10);
c44cdc7e
SP
1615 read_next_command();
1616 }
1617 else
d8397168 1618 next_mark = 0;
c44cdc7e
SP
1619}
1620
eec813cf 1621static void cmd_data(struct strbuf *sb)
c44cdc7e 1622{
eec813cf 1623 strbuf_reset(sb);
c44cdc7e 1624
599065a3 1625 if (prefixcmp(command_buf.buf, "data "))
c44cdc7e
SP
1626 die("Expected 'data n' command, found: %s", command_buf.buf);
1627
599065a3 1628 if (!prefixcmp(command_buf.buf + 5, "<<")) {
3b4dce02 1629 char *term = xstrdup(command_buf.buf + 5 + 2);
4a241d79
PH
1630 size_t term_len = command_buf.len - 5 - 2;
1631
c2e6b6d0 1632 strbuf_detach(&command_buf, NULL);
3b4dce02 1633 for (;;) {
e6c019d0 1634 if (strbuf_getline(&command_buf, stdin, '\n') == EOF)
3b4dce02
SP
1635 die("EOF in data (terminator '%s' not found)", term);
1636 if (term_len == command_buf.len
1637 && !strcmp(term, command_buf.buf))
1638 break;
eec813cf
PH
1639 strbuf_addbuf(sb, &command_buf);
1640 strbuf_addch(sb, '\n');
3b4dce02
SP
1641 }
1642 free(term);
1643 }
1644 else {
4a241d79
PH
1645 size_t n = 0, length;
1646
3b4dce02 1647 length = strtoul(command_buf.buf + 5, NULL, 10);
4a241d79 1648
3b4dce02 1649 while (n < length) {
eec813cf 1650 size_t s = strbuf_fread(sb, length - n, stdin);
3b4dce02 1651 if (!s && feof(stdin))
40db58b8
JS
1652 die("EOF in data (%lu bytes remaining)",
1653 (unsigned long)(length - n));
3b4dce02
SP
1654 n += s;
1655 }
c44cdc7e
SP
1656 }
1657
2c570cde 1658 skip_optional_lf();
c44cdc7e
SP
1659}
1660
63e0c8b3
SP
1661static int validate_raw_date(const char *src, char *result, int maxlen)
1662{
1663 const char *orig_src = src;
1664 char *endp, sign;
1665
1666 strtoul(src, &endp, 10);
1667 if (endp == src || *endp != ' ')
1668 return -1;
1669
1670 src = endp + 1;
1671 if (*src != '-' && *src != '+')
1672 return -1;
1673 sign = *src;
1674
1675 strtoul(src + 1, &endp, 10);
1676 if (endp == src || *endp || (endp - orig_src) >= maxlen)
1677 return -1;
1678
1679 strcpy(result, orig_src);
1680 return 0;
1681}
1682
1683static char *parse_ident(const char *buf)
1684{
1685 const char *gt;
1686 size_t name_len;
1687 char *ident;
1688
1689 gt = strrchr(buf, '>');
1690 if (!gt)
1691 die("Missing > in ident string: %s", buf);
1692 gt++;
1693 if (*gt != ' ')
1694 die("Missing space after > in ident string: %s", buf);
1695 gt++;
1696 name_len = gt - buf;
1697 ident = xmalloc(name_len + 24);
1698 strncpy(ident, buf, name_len);
1699
1700 switch (whenspec) {
1701 case WHENSPEC_RAW:
1702 if (validate_raw_date(gt, ident + name_len, 24) < 0)
1703 die("Invalid raw date \"%s\" in ident: %s", gt, buf);
1704 break;
1705 case WHENSPEC_RFC2822:
1706 if (parse_date(gt, ident + name_len, 24) < 0)
1707 die("Invalid rfc2822 date \"%s\" in ident: %s", gt, buf);
1708 break;
1709 case WHENSPEC_NOW:
1710 if (strcmp("now", gt))
1711 die("Date in ident must be 'now': %s", buf);
1712 datestamp(ident + name_len, 24);
1713 break;
1714 }
1715
1716 return ident;
1717}
1718
fd99224e 1719static void cmd_new_blob(void)
6143f064 1720{
05576569 1721 static struct strbuf buf = STRBUF_INIT;
c44cdc7e
SP
1722
1723 read_next_command();
1724 cmd_mark();
eec813cf 1725 cmd_data(&buf);
05576569 1726 store_object(OBJ_BLOB, &buf, &last_blob, NULL, next_mark);
6143f064
SP
1727}
1728
fd99224e 1729static void unload_one_branch(void)
6bb5b329 1730{
41e5257f
SP
1731 while (cur_active_branches
1732 && cur_active_branches >= max_active_branches) {
6777a59f 1733 uintmax_t min_commit = ULONG_MAX;
463acbe1
SP
1734 struct branch *e, *l = NULL, *p = NULL;
1735
1736 for (e = active_branches; e; e = e->active_next_branch) {
1737 if (e->last_commit < min_commit) {
1738 p = l;
1739 min_commit = e->last_commit;
1740 }
1741 l = e;
1742 }
1743
1744 if (p) {
1745 e = p->active_next_branch;
1746 p->active_next_branch = e->active_next_branch;
1747 } else {
1748 e = active_branches;
1749 active_branches = e->active_next_branch;
1750 }
734c91f9 1751 e->active = 0;
463acbe1
SP
1752 e->active_next_branch = NULL;
1753 if (e->branch_tree.tree) {
afde8dd9 1754 release_tree_content_recursive(e->branch_tree.tree);
463acbe1
SP
1755 e->branch_tree.tree = NULL;
1756 }
1757 cur_active_branches--;
6bb5b329 1758 }
6bb5b329
SP
1759}
1760
463acbe1 1761static void load_branch(struct branch *b)
6bb5b329 1762{
463acbe1 1763 load_tree(&b->branch_tree);
734c91f9
SP
1764 if (!b->active) {
1765 b->active = 1;
1766 b->active_next_branch = active_branches;
1767 active_branches = b;
1768 cur_active_branches++;
1769 branch_load_count++;
1770 }
6bb5b329
SP
1771}
1772
463acbe1 1773static void file_change_m(struct branch *b)
6bb5b329 1774{
c44cdc7e 1775 const char *p = command_buf.buf + 2;
7fb1011e 1776 static struct strbuf uq = STRBUF_INIT;
c44cdc7e 1777 const char *endp;
10e8d688 1778 struct object_entry *oe = oe;
463acbe1 1779 unsigned char sha1[20];
10831c55 1780 uint16_t mode, inline_data = 0;
6bb5b329 1781
c44cdc7e
SP
1782 p = get_mode(p, &mode);
1783 if (!p)
1784 die("Corrupt mode: %s", command_buf.buf);
1785 switch (mode) {
1786 case S_IFREG | 0644:
1787 case S_IFREG | 0755:
ace4a9d1 1788 case S_IFLNK:
c44cdc7e
SP
1789 case 0644:
1790 case 0755:
1791 /* ok */
1792 break;
1793 default:
1794 die("Corrupt mode: %s", command_buf.buf);
1795 }
1796
d8397168
SP
1797 if (*p == ':') {
1798 char *x;
0ea9f045 1799 oe = find_mark(strtoumax(p + 1, &x, 10));
cacbdd0a 1800 hashcpy(sha1, oe->sha1);
d8397168 1801 p = x;
599065a3 1802 } else if (!prefixcmp(p, "inline")) {
b715cfbb
SP
1803 inline_data = 1;
1804 p += 6;
d8397168
SP
1805 } else {
1806 if (get_sha1_hex(p, sha1))
1807 die("Invalid SHA1: %s", command_buf.buf);
1808 oe = find_object(sha1);
1809 p += 40;
1810 }
c44cdc7e
SP
1811 if (*p++ != ' ')
1812 die("Missing space after SHA1: %s", command_buf.buf);
1813
7fb1011e
PH
1814 strbuf_reset(&uq);
1815 if (!unquote_c_style(&uq, p, &endp)) {
c44cdc7e
SP
1816 if (*endp)
1817 die("Garbage after path in: %s", command_buf.buf);
7fb1011e 1818 p = uq.buf;
c44cdc7e 1819 }
6bb5b329 1820
b715cfbb 1821 if (inline_data) {
05576569 1822 static struct strbuf buf = STRBUF_INIT;
eec813cf 1823
7fb1011e
PH
1824 if (p != uq.buf) {
1825 strbuf_addstr(&uq, p);
1826 p = uq.buf;
1827 }
b715cfbb 1828 read_next_command();
eec813cf 1829 cmd_data(&buf);
05576569 1830 store_object(OBJ_BLOB, &buf, &last_blob, sha1, 0);
b715cfbb 1831 } else if (oe) {
7111feed 1832 if (oe->type != OBJ_BLOB)
c44cdc7e 1833 die("Not a blob (actually a %s): %s",
2005dbe2 1834 typename(oe->type), command_buf.buf);
7111feed 1835 } else {
21666f1a
NP
1836 enum object_type type = sha1_object_info(sha1, NULL);
1837 if (type < 0)
c44cdc7e 1838 die("Blob not found: %s", command_buf.buf);
21666f1a 1839 if (type != OBJ_BLOB)
c44cdc7e 1840 die("Not a blob (actually a %s): %s",
21666f1a 1841 typename(type), command_buf.buf);
7111feed 1842 }
6bb5b329 1843
f39a946a 1844 tree_content_set(&b->branch_tree, p, sha1, S_IFREG | mode, NULL);
463acbe1 1845}
6bb5b329 1846
463acbe1
SP
1847static void file_change_d(struct branch *b)
1848{
c44cdc7e 1849 const char *p = command_buf.buf + 2;
7fb1011e 1850 static struct strbuf uq = STRBUF_INIT;
c44cdc7e
SP
1851 const char *endp;
1852
7fb1011e
PH
1853 strbuf_reset(&uq);
1854 if (!unquote_c_style(&uq, p, &endp)) {
c44cdc7e
SP
1855 if (*endp)
1856 die("Garbage after path in: %s", command_buf.buf);
7fb1011e 1857 p = uq.buf;
c44cdc7e 1858 }
f39a946a 1859 tree_content_remove(&b->branch_tree, p, NULL);
6bb5b329
SP
1860}
1861
b6f3481b 1862static void file_change_cr(struct branch *b, int rename)
f39a946a
SP
1863{
1864 const char *s, *d;
7fb1011e
PH
1865 static struct strbuf s_uq = STRBUF_INIT;
1866 static struct strbuf d_uq = STRBUF_INIT;
f39a946a
SP
1867 const char *endp;
1868 struct tree_entry leaf;
1869
1870 s = command_buf.buf + 2;
7fb1011e
PH
1871 strbuf_reset(&s_uq);
1872 if (!unquote_c_style(&s_uq, s, &endp)) {
f39a946a
SP
1873 if (*endp != ' ')
1874 die("Missing space after source: %s", command_buf.buf);
7fb1011e 1875 } else {
f39a946a
SP
1876 endp = strchr(s, ' ');
1877 if (!endp)
1878 die("Missing space after source: %s", command_buf.buf);
7fb1011e 1879 strbuf_add(&s_uq, s, endp - s);
f39a946a 1880 }
7fb1011e 1881 s = s_uq.buf;
f39a946a
SP
1882
1883 endp++;
1884 if (!*endp)
1885 die("Missing dest: %s", command_buf.buf);
1886
1887 d = endp;
7fb1011e
PH
1888 strbuf_reset(&d_uq);
1889 if (!unquote_c_style(&d_uq, d, &endp)) {
f39a946a
SP
1890 if (*endp)
1891 die("Garbage after dest in: %s", command_buf.buf);
7fb1011e 1892 d = d_uq.buf;
f39a946a
SP
1893 }
1894
1895 memset(&leaf, 0, sizeof(leaf));
b6f3481b
SP
1896 if (rename)
1897 tree_content_remove(&b->branch_tree, s, &leaf);
1898 else
1899 tree_content_get(&b->branch_tree, s, &leaf);
f39a946a
SP
1900 if (!leaf.versions[1].mode)
1901 die("Path %s not in branch", s);
1902 tree_content_set(&b->branch_tree, d,
1903 leaf.versions[1].sha1,
1904 leaf.versions[1].mode,
1905 leaf.tree);
f39a946a
SP
1906}
1907
825769a8
SP
1908static void file_change_deleteall(struct branch *b)
1909{
1910 release_tree_content_recursive(b->branch_tree.tree);
1911 hashclr(b->branch_tree.versions[0].sha1);
1912 hashclr(b->branch_tree.versions[1].sha1);
1913 load_tree(&b->branch_tree);
1914}
1915
654aaa37
SP
1916static void cmd_from_commit(struct branch *b, char *buf, unsigned long size)
1917{
1918 if (!buf || size < 46)
1919 die("Not a valid commit: %s", sha1_to_hex(b->sha1));
1920 if (memcmp("tree ", buf, 5)
1921 || get_sha1_hex(buf + 5, b->branch_tree.versions[1].sha1))
1922 die("The commit %s is corrupt", sha1_to_hex(b->sha1));
1923 hashcpy(b->branch_tree.versions[0].sha1,
1924 b->branch_tree.versions[1].sha1);
1925}
1926
1927static void cmd_from_existing(struct branch *b)
1928{
1929 if (is_null_sha1(b->sha1)) {
1930 hashclr(b->branch_tree.versions[0].sha1);
1931 hashclr(b->branch_tree.versions[1].sha1);
1932 } else {
1933 unsigned long size;
1934 char *buf;
1935
1936 buf = read_object_with_reference(b->sha1,
1937 commit_type, &size, b->sha1);
1938 cmd_from_commit(b, buf, size);
1939 free(buf);
1940 }
1941}
1942
1fdb649c 1943static int cmd_from(struct branch *b)
00e2b884 1944{
6c3aac1c 1945 const char *from;
00e2b884
SP
1946 struct branch *s;
1947
599065a3 1948 if (prefixcmp(command_buf.buf, "from "))
1fdb649c 1949 return 0;
00e2b884 1950
ea5e370a
SP
1951 if (b->branch_tree.tree) {
1952 release_tree_content_recursive(b->branch_tree.tree);
1953 b->branch_tree.tree = NULL;
1954 }
00e2b884
SP
1955
1956 from = strchr(command_buf.buf, ' ') + 1;
00e2b884
SP
1957 s = lookup_branch(from);
1958 if (b == s)
1959 die("Can't create a branch from itself: %s", b->name);
1960 else if (s) {
4cabf858 1961 unsigned char *t = s->branch_tree.versions[1].sha1;
445b8599 1962 hashcpy(b->sha1, s->sha1);
4cabf858
SP
1963 hashcpy(b->branch_tree.versions[0].sha1, t);
1964 hashcpy(b->branch_tree.versions[1].sha1, t);
00e2b884 1965 } else if (*from == ':') {
0ea9f045 1966 uintmax_t idnum = strtoumax(from + 1, NULL, 10);
00e2b884 1967 struct object_entry *oe = find_mark(idnum);
00e2b884 1968 if (oe->type != OBJ_COMMIT)
3efb1f34 1969 die("Mark :%" PRIuMAX " not a commit", idnum);
445b8599 1970 hashcpy(b->sha1, oe->sha1);
aac65ed1 1971 if (oe->pack_id != MAX_PACK_ID) {
00e2b884 1972 unsigned long size;
aac65ed1
SP
1973 char *buf = gfi_unpack_entry(oe, &size);
1974 cmd_from_commit(b, buf, size);
00e2b884 1975 free(buf);
aac65ed1
SP
1976 } else
1977 cmd_from_existing(b);
654aaa37
SP
1978 } else if (!get_sha1(from, b->sha1))
1979 cmd_from_existing(b);
1980 else
00e2b884
SP
1981 die("Invalid ref name or SHA1 expression: %s", from);
1982
1983 read_next_command();
1fdb649c 1984 return 1;
00e2b884
SP
1985}
1986
e5b1444b 1987static struct hash_list *cmd_merge(unsigned int *count)
62b6f483 1988{
10e8d688 1989 struct hash_list *list = NULL, *n, *e = e;
6c3aac1c 1990 const char *from;
62b6f483
SP
1991 struct branch *s;
1992
1993 *count = 0;
599065a3 1994 while (!prefixcmp(command_buf.buf, "merge ")) {
62b6f483 1995 from = strchr(command_buf.buf, ' ') + 1;
62b6f483
SP
1996 n = xmalloc(sizeof(*n));
1997 s = lookup_branch(from);
1998 if (s)
1999 hashcpy(n->sha1, s->sha1);
2000 else if (*from == ':') {
0ea9f045 2001 uintmax_t idnum = strtoumax(from + 1, NULL, 10);
62b6f483
SP
2002 struct object_entry *oe = find_mark(idnum);
2003 if (oe->type != OBJ_COMMIT)
3efb1f34 2004 die("Mark :%" PRIuMAX " not a commit", idnum);
62b6f483 2005 hashcpy(n->sha1, oe->sha1);
2f6dc35d
SP
2006 } else if (!get_sha1(from, n->sha1)) {
2007 unsigned long size;
2008 char *buf = read_object_with_reference(n->sha1,
6b4318e6 2009 commit_type, &size, n->sha1);
2f6dc35d
SP
2010 if (!buf || size < 46)
2011 die("Not a valid commit: %s", from);
2012 free(buf);
2013 } else
62b6f483
SP
2014 die("Invalid ref name or SHA1 expression: %s", from);
2015
2016 n->next = NULL;
2017 if (list)
2018 e->next = n;
2019 else
2020 list = n;
2021 e = n;
10e8d688 2022 (*count)++;
62b6f483
SP
2023 read_next_command();
2024 }
2025 return list;
2026}
2027
fd99224e 2028static void cmd_new_commit(void)
6bb5b329 2029{
eec813cf 2030 static struct strbuf msg = STRBUF_INIT;
c44cdc7e 2031 struct branch *b;
c44cdc7e
SP
2032 char *sp;
2033 char *author = NULL;
2034 char *committer = NULL;
62b6f483
SP
2035 struct hash_list *merge_list = NULL;
2036 unsigned int merge_count;
c44cdc7e
SP
2037
2038 /* Obtain the branch name from the rest of our command */
2039 sp = strchr(command_buf.buf, ' ') + 1;
c44cdc7e 2040 b = lookup_branch(sp);
463acbe1 2041 if (!b)
00e2b884 2042 b = new_branch(sp);
c44cdc7e
SP
2043
2044 read_next_command();
2045 cmd_mark();
599065a3 2046 if (!prefixcmp(command_buf.buf, "author ")) {
63e0c8b3 2047 author = parse_ident(command_buf.buf + 7);
c44cdc7e
SP
2048 read_next_command();
2049 }
599065a3 2050 if (!prefixcmp(command_buf.buf, "committer ")) {
63e0c8b3 2051 committer = parse_ident(command_buf.buf + 10);
c44cdc7e
SP
2052 read_next_command();
2053 }
2054 if (!committer)
2055 die("Expected committer but didn't get one");
eec813cf 2056 cmd_data(&msg);
02f3389d
SP
2057 read_next_command();
2058 cmd_from(b);
62b6f483 2059 merge_list = cmd_merge(&merge_count);
c44cdc7e
SP
2060
2061 /* ensure the branch is active/loaded */
41e5257f 2062 if (!b->branch_tree.tree || !max_active_branches) {
463acbe1
SP
2063 unload_one_branch();
2064 load_branch(b);
2065 }
6bb5b329 2066
463acbe1 2067 /* file_change* */
e6c019d0 2068 while (command_buf.len > 0) {
1fdb649c 2069 if (!prefixcmp(command_buf.buf, "M "))
463acbe1 2070 file_change_m(b);
599065a3 2071 else if (!prefixcmp(command_buf.buf, "D "))
463acbe1 2072 file_change_d(b);
f39a946a 2073 else if (!prefixcmp(command_buf.buf, "R "))
b6f3481b
SP
2074 file_change_cr(b, 1);
2075 else if (!prefixcmp(command_buf.buf, "C "))
2076 file_change_cr(b, 0);
825769a8
SP
2077 else if (!strcmp("deleteall", command_buf.buf))
2078 file_change_deleteall(b);
1fdb649c
SP
2079 else {
2080 unread_command_buf = 1;
2081 break;
2082 }
e6c019d0
PH
2083 if (read_next_command() == EOF)
2084 break;
6bb5b329 2085 }
6bb5b329 2086
c44cdc7e 2087 /* build the tree and the commit */
463acbe1 2088 store_tree(&b->branch_tree);
8a8c55ea
SP
2089 hashcpy(b->branch_tree.versions[0].sha1,
2090 b->branch_tree.versions[1].sha1);
eec813cf
PH
2091
2092 strbuf_reset(&new_data);
2093 strbuf_addf(&new_data, "tree %s\n",
4cabf858 2094 sha1_to_hex(b->branch_tree.versions[1].sha1));
445b8599 2095 if (!is_null_sha1(b->sha1))
eec813cf 2096 strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(b->sha1));
62b6f483
SP
2097 while (merge_list) {
2098 struct hash_list *next = merge_list->next;
eec813cf 2099 strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(merge_list->sha1));
62b6f483
SP
2100 free(merge_list);
2101 merge_list = next;
2102 }
eec813cf
PH
2103 strbuf_addf(&new_data,
2104 "author %s\n"
2105 "committer %s\n"
2106 "\n",
2107 author ? author : committer, committer);
2108 strbuf_addbuf(&new_data, &msg);
e7d06a4b 2109 free(author);
c44cdc7e 2110 free(committer);
c44cdc7e 2111
eec813cf 2112 if (!store_object(OBJ_COMMIT, &new_data, NULL, b->sha1, next_mark))
69e74e74 2113 b->pack_id = pack_id;
463acbe1 2114 b->last_commit = object_count_by_type[OBJ_COMMIT];
6bb5b329
SP
2115}
2116
fd99224e 2117static void cmd_new_tag(void)
72303d44 2118{
eec813cf 2119 static struct strbuf msg = STRBUF_INIT;
72303d44
SP
2120 char *sp;
2121 const char *from;
2122 char *tagger;
2123 struct branch *s;
72303d44 2124 struct tag *t;
0ea9f045 2125 uintmax_t from_mark = 0;
72303d44
SP
2126 unsigned char sha1[20];
2127
2128 /* Obtain the new tag name from the rest of our command */
2129 sp = strchr(command_buf.buf, ' ') + 1;
72303d44
SP
2130 t = pool_alloc(sizeof(struct tag));
2131 t->next_tag = NULL;
2132 t->name = pool_strdup(sp);
2133 if (last_tag)
2134 last_tag->next_tag = t;
2135 else
2136 first_tag = t;
2137 last_tag = t;
72303d44
SP
2138 read_next_command();
2139
2140 /* from ... */
599065a3 2141 if (prefixcmp(command_buf.buf, "from "))
72303d44 2142 die("Expected from command, got %s", command_buf.buf);
72303d44 2143 from = strchr(command_buf.buf, ' ') + 1;
72303d44
SP
2144 s = lookup_branch(from);
2145 if (s) {
445b8599 2146 hashcpy(sha1, s->sha1);
72303d44 2147 } else if (*from == ':') {
10e8d688 2148 struct object_entry *oe;
0ea9f045 2149 from_mark = strtoumax(from + 1, NULL, 10);
10e8d688 2150 oe = find_mark(from_mark);
72303d44 2151 if (oe->type != OBJ_COMMIT)
3efb1f34 2152 die("Mark :%" PRIuMAX " not a commit", from_mark);
445b8599 2153 hashcpy(sha1, oe->sha1);
72303d44
SP
2154 } else if (!get_sha1(from, sha1)) {
2155 unsigned long size;
2156 char *buf;
2157
2158 buf = read_object_with_reference(sha1,
df843662 2159 commit_type, &size, sha1);
72303d44
SP
2160 if (!buf || size < 46)
2161 die("Not a valid commit: %s", from);
2162 free(buf);
2163 } else
2164 die("Invalid ref name or SHA1 expression: %s", from);
72303d44
SP
2165 read_next_command();
2166
2167 /* tagger ... */
599065a3 2168 if (prefixcmp(command_buf.buf, "tagger "))
72303d44 2169 die("Expected tagger command, got %s", command_buf.buf);
63e0c8b3 2170 tagger = parse_ident(command_buf.buf + 7);
72303d44
SP
2171
2172 /* tag payload/message */
2173 read_next_command();
eec813cf 2174 cmd_data(&msg);
72303d44
SP
2175
2176 /* build the tag object */
eec813cf
PH
2177 strbuf_reset(&new_data);
2178 strbuf_addf(&new_data,
2179 "object %s\n"
2180 "type %s\n"
2181 "tag %s\n"
2182 "tagger %s\n"
2183 "\n",
2184 sha1_to_hex(sha1), commit_type, t->name, tagger);
2185 strbuf_addbuf(&new_data, &msg);
72303d44 2186 free(tagger);
72303d44 2187
eec813cf 2188 if (store_object(OBJ_TAG, &new_data, NULL, t->sha1, 0))
69e74e74
SP
2189 t->pack_id = MAX_PACK_ID;
2190 else
2191 t->pack_id = pack_id;
72303d44
SP
2192}
2193
fd99224e 2194static void cmd_reset_branch(void)
5fced8dc
SP
2195{
2196 struct branch *b;
5fced8dc
SP
2197 char *sp;
2198
2199 /* Obtain the branch name from the rest of our command */
2200 sp = strchr(command_buf.buf, ' ') + 1;
5fced8dc
SP
2201 b = lookup_branch(sp);
2202 if (b) {
ea5e370a
SP
2203 hashclr(b->sha1);
2204 hashclr(b->branch_tree.versions[0].sha1);
2205 hashclr(b->branch_tree.versions[1].sha1);
5fced8dc
SP
2206 if (b->branch_tree.tree) {
2207 release_tree_content_recursive(b->branch_tree.tree);
2208 b->branch_tree.tree = NULL;
2209 }
2210 }
9938ffc5
SP
2211 else
2212 b = new_branch(sp);
9938ffc5 2213 read_next_command();
b449f4cf 2214 if (!cmd_from(b) && command_buf.len > 0)
1fdb649c 2215 unread_command_buf = 1;
5fced8dc
SP
2216}
2217
fd99224e 2218static void cmd_checkpoint(void)
7bfe6e26 2219{
820b9310
SP
2220 if (object_count) {
2221 cycle_packfile();
2222 dump_branches();
2223 dump_tags();
2224 dump_marks();
2225 }
1fdb649c 2226 skip_optional_lf();
7bfe6e26
SP
2227}
2228
ac053c02
SP
2229static void cmd_progress(void)
2230{
b449f4cf 2231 fwrite(command_buf.buf, 1, command_buf.len, stdout);
ac053c02
SP
2232 fputc('\n', stdout);
2233 fflush(stdout);
2234 skip_optional_lf();
2235}
2236
e8438420
SP
2237static void import_marks(const char *input_file)
2238{
2239 char line[512];
2240 FILE *f = fopen(input_file, "r");
2241 if (!f)
2242 die("cannot read %s: %s", input_file, strerror(errno));
2243 while (fgets(line, sizeof(line), f)) {
2244 uintmax_t mark;
2245 char *end;
2246 unsigned char sha1[20];
2247 struct object_entry *e;
2248
2249 end = strchr(line, '\n');
2250 if (line[0] != ':' || !end)
2251 die("corrupt mark line: %s", line);
2252 *end = 0;
2253 mark = strtoumax(line + 1, &end, 10);
2254 if (!mark || end == line + 1
2255 || *end != ' ' || get_sha1(end + 1, sha1))
2256 die("corrupt mark line: %s", line);
2257 e = find_object(sha1);
2258 if (!e) {
2259 enum object_type type = sha1_object_info(sha1, NULL);
2260 if (type < 0)
2261 die("object not found: %s", sha1_to_hex(sha1));
2262 e = insert_object(sha1);
2263 e->type = type;
2264 e->pack_id = MAX_PACK_ID;
a5c1780a 2265 e->offset = 1; /* just not zero! */
e8438420
SP
2266 }
2267 insert_mark(mark, e);
2268 }
2269 fclose(f);
2270}
2271
d5c57b28 2272static const char fast_import_usage[] =
63e0c8b3 2273"git-fast-import [--date-format=f] [--max-pack-size=n] [--depth=n] [--active-branches=n] [--export-marks=marks.file]";
d5c57b28 2274
8bcce301
SP
2275int main(int argc, const char **argv)
2276{
904b1941 2277 unsigned int i, show_stats = 1;
8bcce301 2278
463acbe1 2279 git_config(git_default_config);
93e72d8d 2280 alloc_objects(object_entry_alloc);
f1696ee3 2281 strbuf_init(&command_buf, 0);
93e72d8d
SP
2282 atom_table = xcalloc(atom_table_sz, sizeof(struct atom_str*));
2283 branch_table = xcalloc(branch_table_sz, sizeof(struct branch*));
2284 avail_tree_table = xcalloc(avail_tree_table_sz, sizeof(struct avail_tree_content*));
2285 marks = pool_calloc(1, sizeof(struct mark_set));
463acbe1 2286
d5c57b28
SP
2287 for (i = 1; i < argc; i++) {
2288 const char *a = argv[i];
2289
2290 if (*a != '-' || !strcmp(a, "--"))
2291 break;
cc44c765 2292 else if (!prefixcmp(a, "--date-format=")) {
63e0c8b3
SP
2293 const char *fmt = a + 14;
2294 if (!strcmp(fmt, "raw"))
2295 whenspec = WHENSPEC_RAW;
2296 else if (!strcmp(fmt, "rfc2822"))
2297 whenspec = WHENSPEC_RFC2822;
2298 else if (!strcmp(fmt, "now"))
2299 whenspec = WHENSPEC_NOW;
2300 else
2301 die("unknown --date-format argument %s", fmt);
2302 }
cc44c765 2303 else if (!prefixcmp(a, "--max-pack-size="))
0ea9f045 2304 max_packsize = strtoumax(a + 16, NULL, 0) * 1024 * 1024;
436e7a74 2305 else if (!prefixcmp(a, "--depth=")) {
d5c57b28 2306 max_depth = strtoul(a + 8, NULL, 0);
436e7a74
SP
2307 if (max_depth > MAX_DEPTH)
2308 die("--depth cannot exceed %u", MAX_DEPTH);
2309 }
cc44c765 2310 else if (!prefixcmp(a, "--active-branches="))
d5c57b28 2311 max_active_branches = strtoul(a + 18, NULL, 0);
e8438420
SP
2312 else if (!prefixcmp(a, "--import-marks="))
2313 import_marks(a + 15);
cc44c765 2314 else if (!prefixcmp(a, "--export-marks="))
a6a1a831 2315 mark_file = a + 15;
cc44c765 2316 else if (!prefixcmp(a, "--export-pack-edges=")) {
bdf1c06d
SP
2317 if (pack_edges)
2318 fclose(pack_edges);
2319 pack_edges = fopen(a + 20, "a");
2320 if (!pack_edges)
2321 die("Cannot open %s: %s", a + 20, strerror(errno));
2322 } else if (!strcmp(a, "--force"))
7073e69e 2323 force_update = 1;
c499d768
SP
2324 else if (!strcmp(a, "--quiet"))
2325 show_stats = 0;
2326 else if (!strcmp(a, "--stats"))
2327 show_stats = 1;
d5c57b28
SP
2328 else
2329 die("unknown option %s", a);
2330 }
8455e484 2331 if (i != argc)
d5c57b28 2332 usage(fast_import_usage);
d5c57b28 2333
904b1941
SP
2334 rc_free = pool_alloc(cmd_save * sizeof(*rc_free));
2335 for (i = 0; i < (cmd_save - 1); i++)
2336 rc_free[i].next = &rc_free[i + 1];
2337 rc_free[cmd_save - 1].next = NULL;
2338
a5c1780a 2339 prepare_packed_git();
f70b6534 2340 start_packfile();
8acb3297 2341 set_die_routine(die_nicely);
e6c019d0
PH
2342 while (read_next_command() != EOF) {
2343 if (!strcmp("blob", command_buf.buf))
c44cdc7e 2344 cmd_new_blob();
599065a3 2345 else if (!prefixcmp(command_buf.buf, "commit "))
c44cdc7e 2346 cmd_new_commit();
599065a3 2347 else if (!prefixcmp(command_buf.buf, "tag "))
72303d44 2348 cmd_new_tag();
599065a3 2349 else if (!prefixcmp(command_buf.buf, "reset "))
5fced8dc 2350 cmd_reset_branch();
7bfe6e26
SP
2351 else if (!strcmp("checkpoint", command_buf.buf))
2352 cmd_checkpoint();
ac053c02
SP
2353 else if (!prefixcmp(command_buf.buf, "progress "))
2354 cmd_progress();
c44cdc7e
SP
2355 else
2356 die("Unsupported command: %s", command_buf.buf);
db5e523f 2357 }
f70b6534 2358 end_packfile();
c44cdc7e 2359
463acbe1 2360 dump_branches();
72303d44 2361 dump_tags();
8455e484 2362 unkeep_all_packs();
a6a1a831 2363 dump_marks();
8bcce301 2364
bdf1c06d
SP
2365 if (pack_edges)
2366 fclose(pack_edges);
2367
c499d768
SP
2368 if (show_stats) {
2369 uintmax_t total_count = 0, duplicate_count = 0;
2370 for (i = 0; i < ARRAY_SIZE(object_count_by_type); i++)
2371 total_count += object_count_by_type[i];
2372 for (i = 0; i < ARRAY_SIZE(duplicate_count_by_type); i++)
2373 duplicate_count += duplicate_count_by_type[i];
2374
2375 fprintf(stderr, "%s statistics:\n", argv[0]);
2376 fprintf(stderr, "---------------------------------------------------------------------\n");
3efb1f34
JR
2377 fprintf(stderr, "Alloc'd objects: %10" PRIuMAX "\n", alloc_count);
2378 fprintf(stderr, "Total objects: %10" PRIuMAX " (%10" PRIuMAX " duplicates )\n", total_count, duplicate_count);
2379 fprintf(stderr, " blobs : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas)\n", object_count_by_type[OBJ_BLOB], duplicate_count_by_type[OBJ_BLOB], delta_count_by_type[OBJ_BLOB]);
2380 fprintf(stderr, " trees : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas)\n", object_count_by_type[OBJ_TREE], duplicate_count_by_type[OBJ_TREE], delta_count_by_type[OBJ_TREE]);
2381 fprintf(stderr, " commits: %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas)\n", object_count_by_type[OBJ_COMMIT], duplicate_count_by_type[OBJ_COMMIT], delta_count_by_type[OBJ_COMMIT]);
2382 fprintf(stderr, " tags : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas)\n", object_count_by_type[OBJ_TAG], duplicate_count_by_type[OBJ_TAG], delta_count_by_type[OBJ_TAG]);
c499d768 2383 fprintf(stderr, "Total branches: %10lu (%10lu loads )\n", branch_count, branch_load_count);
3efb1f34 2384 fprintf(stderr, " marks: %10" PRIuMAX " (%10" PRIuMAX " unique )\n", (((uintmax_t)1) << marks->shift) * 1024, marks_set_count);
c499d768 2385 fprintf(stderr, " atoms: %10u\n", atom_cnt);
3efb1f34 2386 fprintf(stderr, "Memory total: %10" PRIuMAX " KiB\n", (total_allocd + alloc_count*sizeof(struct object_entry))/1024);
40db58b8 2387 fprintf(stderr, " pools: %10lu KiB\n", (unsigned long)(total_allocd/1024));
3efb1f34 2388 fprintf(stderr, " objects: %10" PRIuMAX " KiB\n", (alloc_count*sizeof(struct object_entry))/1024);
c499d768
SP
2389 fprintf(stderr, "---------------------------------------------------------------------\n");
2390 pack_report();
2391 fprintf(stderr, "---------------------------------------------------------------------\n");
2392 fprintf(stderr, "\n");
2393 }
db5e523f 2394
7073e69e 2395 return failure ? 1 : 0;
db5e523f 2396}