Documentation: add documentation for 'git interpret-trailers'
[alt-git.git] / fast-import.c
blobc071253c90807b6fa98771e9fd046fed12bb7b4b
1 /*
2 (See Documentation/git-fast-import.txt for maintained documentation.)
3 Format of STDIN stream:
5 stream ::= cmd*;
7 cmd ::= new_blob
8 | new_commit
9 | new_tag
10 | reset_branch
11 | checkpoint
12 | progress
15 new_blob ::= 'blob' lf
16 mark?
17 file_content;
18 file_content ::= data;
20 new_commit ::= 'commit' sp ref_str lf
21 mark?
22 ('author' (sp name)? sp '<' email '>' sp when lf)?
23 'committer' (sp name)? sp '<' email '>' sp when lf
24 commit_msg
25 ('from' sp commit-ish lf)?
26 ('merge' sp commit-ish lf)*
27 (file_change | ls)*
28 lf?;
29 commit_msg ::= data;
31 ls ::= 'ls' sp '"' quoted(path) '"' lf;
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;
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;
56 reset_branch ::= 'reset' sp ref_str lf
57 ('from' sp commit-ish lf)?
58 lf?;
60 checkpoint ::= 'checkpoint' lf
61 lf?;
63 progress ::= 'progress' sp not_lf* lf
64 lf?;
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.
72 mark ::= 'mark' sp idnum lf;
73 data ::= (delimited_data | exact_data)
74 lf?;
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;
83 # note: declen indicates the length of binary_data in bytes.
84 # declen does not include the lf preceding the binary data.
86 exact_data ::= 'data' sp declen lf
87 binary_data;
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.
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'
106 declen ::= # unsigned 32 bit value, ascii base10 notation;
107 bigint ::= # unsigned integer value, ascii base10 notation;
108 binary_data ::= # file content, not interpreted;
110 when ::= raw_when | rfc2822_when;
111 raw_when ::= ts sp tz;
112 rfc2822_when ::= # Valid RFC 2822 date and time;
114 sp ::= # ASCII space character;
115 lf ::= # ASCII newline (LF) character;
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.
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;
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.
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;
137 # note: comments, ls and cat requests may appear anywhere
138 # in the input, except within a data command. Any form
139 # of the data command always escapes the related input
140 # from comment processing.
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).
147 cat_blob ::= 'cat-blob' sp (hexsha1 | idnum) lf;
148 ls_tree ::= 'ls' sp (hexsha1 | idnum) sp path_str lf;
150 comment ::= '#' not_lf* lf;
151 not_lf ::= # Any byte that is not ASCII newline (LF);
154 #include "builtin.h"
155 #include "cache.h"
156 #include "object.h"
157 #include "blob.h"
158 #include "tree.h"
159 #include "commit.h"
160 #include "delta.h"
161 #include "pack.h"
162 #include "refs.h"
163 #include "csum-file.h"
164 #include "quote.h"
165 #include "exec_cmd.h"
166 #include "dir.h"
168 #define PACK_ID_BITS 16
169 #define MAX_PACK_ID ((1<<PACK_ID_BITS)-1)
170 #define DEPTH_BITS 13
171 #define MAX_DEPTH ((1<<DEPTH_BITS)-1)
174 * We abuse the setuid bit on directories to mean "do not delta".
176 #define NO_DELTA S_ISUID
178 struct object_entry {
179 struct pack_idx_entry idx;
180 struct object_entry *next;
181 uint32_t type : TYPE_BITS,
182 pack_id : PACK_ID_BITS,
183 depth : DEPTH_BITS;
186 struct object_entry_pool {
187 struct object_entry_pool *next_pool;
188 struct object_entry *next_free;
189 struct object_entry *end;
190 struct object_entry entries[FLEX_ARRAY]; /* more */
193 struct mark_set {
194 union {
195 struct object_entry *marked[1024];
196 struct mark_set *sets[1024];
197 } data;
198 unsigned int shift;
201 struct last_object {
202 struct strbuf data;
203 off_t offset;
204 unsigned int depth;
205 unsigned no_swap : 1;
208 struct mem_pool {
209 struct mem_pool *next_pool;
210 char *next_free;
211 char *end;
212 uintmax_t space[FLEX_ARRAY]; /* more */
215 struct atom_str {
216 struct atom_str *next_atom;
217 unsigned short str_len;
218 char str_dat[FLEX_ARRAY]; /* more */
221 struct tree_content;
222 struct tree_entry {
223 struct tree_content *tree;
224 struct atom_str *name;
225 struct tree_entry_ms {
226 uint16_t mode;
227 unsigned char sha1[20];
228 } versions[2];
231 struct tree_content {
232 unsigned int entry_capacity; /* must match avail_tree_content */
233 unsigned int entry_count;
234 unsigned int delta_depth;
235 struct tree_entry *entries[FLEX_ARRAY]; /* more */
238 struct avail_tree_content {
239 unsigned int entry_capacity; /* must match tree_content */
240 struct avail_tree_content *next_avail;
243 struct branch {
244 struct branch *table_next_branch;
245 struct branch *active_next_branch;
246 const char *name;
247 struct tree_entry branch_tree;
248 uintmax_t last_commit;
249 uintmax_t num_notes;
250 unsigned active : 1;
251 unsigned delete : 1;
252 unsigned pack_id : PACK_ID_BITS;
253 unsigned char sha1[20];
256 struct tag {
257 struct tag *next_tag;
258 const char *name;
259 unsigned int pack_id;
260 unsigned char sha1[20];
263 struct hash_list {
264 struct hash_list *next;
265 unsigned char sha1[20];
268 typedef enum {
269 WHENSPEC_RAW = 1,
270 WHENSPEC_RFC2822,
271 WHENSPEC_NOW
272 } whenspec_type;
274 struct recent_command {
275 struct recent_command *prev;
276 struct recent_command *next;
277 char *buf;
280 /* Configured limits on output */
281 static unsigned long max_depth = 10;
282 static off_t max_packsize;
283 static int force_update;
284 static int pack_compression_level = Z_DEFAULT_COMPRESSION;
285 static int pack_compression_seen;
287 /* Stats and misc. counters */
288 static uintmax_t alloc_count;
289 static uintmax_t marks_set_count;
290 static uintmax_t object_count_by_type[1 << TYPE_BITS];
291 static uintmax_t duplicate_count_by_type[1 << TYPE_BITS];
292 static uintmax_t delta_count_by_type[1 << TYPE_BITS];
293 static uintmax_t delta_count_attempts_by_type[1 << TYPE_BITS];
294 static unsigned long object_count;
295 static unsigned long branch_count;
296 static unsigned long branch_load_count;
297 static int failure;
298 static FILE *pack_edges;
299 static unsigned int show_stats = 1;
300 static int global_argc;
301 static char **global_argv;
303 /* Memory pools */
304 static size_t mem_pool_alloc = 2*1024*1024 - sizeof(struct mem_pool);
305 static size_t total_allocd;
306 static struct mem_pool *mem_pool;
308 /* Atom management */
309 static unsigned int atom_table_sz = 4451;
310 static unsigned int atom_cnt;
311 static struct atom_str **atom_table;
313 /* The .pack file being generated */
314 static struct pack_idx_option pack_idx_opts;
315 static unsigned int pack_id;
316 static struct sha1file *pack_file;
317 static struct packed_git *pack_data;
318 static struct packed_git **all_packs;
319 static off_t pack_size;
321 /* Table of objects we've written. */
322 static unsigned int object_entry_alloc = 5000;
323 static struct object_entry_pool *blocks;
324 static struct object_entry *object_table[1 << 16];
325 static struct mark_set *marks;
326 static const char *export_marks_file;
327 static const char *import_marks_file;
328 static int import_marks_file_from_stream;
329 static int import_marks_file_ignore_missing;
330 static int relative_marks_paths;
332 /* Our last blob */
333 static struct last_object last_blob = { STRBUF_INIT, 0, 0, 0 };
335 /* Tree management */
336 static unsigned int tree_entry_alloc = 1000;
337 static void *avail_tree_entry;
338 static unsigned int avail_tree_table_sz = 100;
339 static struct avail_tree_content **avail_tree_table;
340 static struct strbuf old_tree = STRBUF_INIT;
341 static struct strbuf new_tree = STRBUF_INIT;
343 /* Branch data */
344 static unsigned long max_active_branches = 5;
345 static unsigned long cur_active_branches;
346 static unsigned long branch_table_sz = 1039;
347 static struct branch **branch_table;
348 static struct branch *active_branches;
350 /* Tag data */
351 static struct tag *first_tag;
352 static struct tag *last_tag;
354 /* Input stream parsing */
355 static whenspec_type whenspec = WHENSPEC_RAW;
356 static struct strbuf command_buf = STRBUF_INIT;
357 static int unread_command_buf;
358 static struct recent_command cmd_hist = {&cmd_hist, &cmd_hist, NULL};
359 static struct recent_command *cmd_tail = &cmd_hist;
360 static struct recent_command *rc_free;
361 static unsigned int cmd_save = 100;
362 static uintmax_t next_mark;
363 static struct strbuf new_data = STRBUF_INIT;
364 static int seen_data_command;
365 static int require_explicit_termination;
367 /* Signal handling */
368 static volatile sig_atomic_t checkpoint_requested;
370 /* Where to write output of cat-blob commands */
371 static int cat_blob_fd = STDOUT_FILENO;
373 static void parse_argv(void);
374 static void parse_cat_blob(const char *p);
375 static void parse_ls(const char *p, struct branch *b);
377 static void write_branch_report(FILE *rpt, struct branch *b)
379 fprintf(rpt, "%s:\n", b->name);
381 fprintf(rpt, " status :");
382 if (b->active)
383 fputs(" active", rpt);
384 if (b->branch_tree.tree)
385 fputs(" loaded", rpt);
386 if (is_null_sha1(b->branch_tree.versions[1].sha1))
387 fputs(" dirty", rpt);
388 fputc('\n', rpt);
390 fprintf(rpt, " tip commit : %s\n", sha1_to_hex(b->sha1));
391 fprintf(rpt, " old tree : %s\n", sha1_to_hex(b->branch_tree.versions[0].sha1));
392 fprintf(rpt, " cur tree : %s\n", sha1_to_hex(b->branch_tree.versions[1].sha1));
393 fprintf(rpt, " commit clock: %" PRIuMAX "\n", b->last_commit);
395 fputs(" last pack : ", rpt);
396 if (b->pack_id < MAX_PACK_ID)
397 fprintf(rpt, "%u", b->pack_id);
398 fputc('\n', rpt);
400 fputc('\n', rpt);
403 static void dump_marks_helper(FILE *, uintmax_t, struct mark_set *);
405 static void write_crash_report(const char *err)
407 char *loc = git_path("fast_import_crash_%"PRIuMAX, (uintmax_t) getpid());
408 FILE *rpt = fopen(loc, "w");
409 struct branch *b;
410 unsigned long lu;
411 struct recent_command *rc;
413 if (!rpt) {
414 error("can't write crash report %s: %s", loc, strerror(errno));
415 return;
418 fprintf(stderr, "fast-import: dumping crash report to %s\n", loc);
420 fprintf(rpt, "fast-import crash report:\n");
421 fprintf(rpt, " fast-import process: %"PRIuMAX"\n", (uintmax_t) getpid());
422 fprintf(rpt, " parent process : %"PRIuMAX"\n", (uintmax_t) getppid());
423 fprintf(rpt, " at %s\n", show_date(time(NULL), 0, DATE_LOCAL));
424 fputc('\n', rpt);
426 fputs("fatal: ", rpt);
427 fputs(err, rpt);
428 fputc('\n', rpt);
430 fputc('\n', rpt);
431 fputs("Most Recent Commands Before Crash\n", rpt);
432 fputs("---------------------------------\n", rpt);
433 for (rc = cmd_hist.next; rc != &cmd_hist; rc = rc->next) {
434 if (rc->next == &cmd_hist)
435 fputs("* ", rpt);
436 else
437 fputs(" ", rpt);
438 fputs(rc->buf, rpt);
439 fputc('\n', rpt);
442 fputc('\n', rpt);
443 fputs("Active Branch LRU\n", rpt);
444 fputs("-----------------\n", rpt);
445 fprintf(rpt, " active_branches = %lu cur, %lu max\n",
446 cur_active_branches,
447 max_active_branches);
448 fputc('\n', rpt);
449 fputs(" pos clock name\n", rpt);
450 fputs(" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n", rpt);
451 for (b = active_branches, lu = 0; b; b = b->active_next_branch)
452 fprintf(rpt, " %2lu) %6" PRIuMAX" %s\n",
453 ++lu, b->last_commit, b->name);
455 fputc('\n', rpt);
456 fputs("Inactive Branches\n", rpt);
457 fputs("-----------------\n", rpt);
458 for (lu = 0; lu < branch_table_sz; lu++) {
459 for (b = branch_table[lu]; b; b = b->table_next_branch)
460 write_branch_report(rpt, b);
463 if (first_tag) {
464 struct tag *tg;
465 fputc('\n', rpt);
466 fputs("Annotated Tags\n", rpt);
467 fputs("--------------\n", rpt);
468 for (tg = first_tag; tg; tg = tg->next_tag) {
469 fputs(sha1_to_hex(tg->sha1), rpt);
470 fputc(' ', rpt);
471 fputs(tg->name, rpt);
472 fputc('\n', rpt);
476 fputc('\n', rpt);
477 fputs("Marks\n", rpt);
478 fputs("-----\n", rpt);
479 if (export_marks_file)
480 fprintf(rpt, " exported to %s\n", export_marks_file);
481 else
482 dump_marks_helper(rpt, 0, marks);
484 fputc('\n', rpt);
485 fputs("-------------------\n", rpt);
486 fputs("END OF CRASH REPORT\n", rpt);
487 fclose(rpt);
490 static void end_packfile(void);
491 static void unkeep_all_packs(void);
492 static void dump_marks(void);
494 static NORETURN void die_nicely(const char *err, va_list params)
496 static int zombie;
497 char message[2 * PATH_MAX];
499 vsnprintf(message, sizeof(message), err, params);
500 fputs("fatal: ", stderr);
501 fputs(message, stderr);
502 fputc('\n', stderr);
504 if (!zombie) {
505 zombie = 1;
506 write_crash_report(message);
507 end_packfile();
508 unkeep_all_packs();
509 dump_marks();
511 exit(128);
514 #ifndef SIGUSR1 /* Windows, for example */
516 static void set_checkpoint_signal(void)
520 #else
522 static void checkpoint_signal(int signo)
524 checkpoint_requested = 1;
527 static void set_checkpoint_signal(void)
529 struct sigaction sa;
531 memset(&sa, 0, sizeof(sa));
532 sa.sa_handler = checkpoint_signal;
533 sigemptyset(&sa.sa_mask);
534 sa.sa_flags = SA_RESTART;
535 sigaction(SIGUSR1, &sa, NULL);
538 #endif
540 static void alloc_objects(unsigned int cnt)
542 struct object_entry_pool *b;
544 b = xmalloc(sizeof(struct object_entry_pool)
545 + cnt * sizeof(struct object_entry));
546 b->next_pool = blocks;
547 b->next_free = b->entries;
548 b->end = b->entries + cnt;
549 blocks = b;
550 alloc_count += cnt;
553 static struct object_entry *new_object(unsigned char *sha1)
555 struct object_entry *e;
557 if (blocks->next_free == blocks->end)
558 alloc_objects(object_entry_alloc);
560 e = blocks->next_free++;
561 hashcpy(e->idx.sha1, sha1);
562 return e;
565 static struct object_entry *find_object(unsigned char *sha1)
567 unsigned int h = sha1[0] << 8 | sha1[1];
568 struct object_entry *e;
569 for (e = object_table[h]; e; e = e->next)
570 if (!hashcmp(sha1, e->idx.sha1))
571 return e;
572 return NULL;
575 static struct object_entry *insert_object(unsigned char *sha1)
577 unsigned int h = sha1[0] << 8 | sha1[1];
578 struct object_entry *e = object_table[h];
580 while (e) {
581 if (!hashcmp(sha1, e->idx.sha1))
582 return e;
583 e = e->next;
586 e = new_object(sha1);
587 e->next = object_table[h];
588 e->idx.offset = 0;
589 object_table[h] = e;
590 return e;
593 static unsigned int hc_str(const char *s, size_t len)
595 unsigned int r = 0;
596 while (len-- > 0)
597 r = r * 31 + *s++;
598 return r;
601 static void *pool_alloc(size_t len)
603 struct mem_pool *p;
604 void *r;
606 /* round up to a 'uintmax_t' alignment */
607 if (len & (sizeof(uintmax_t) - 1))
608 len += sizeof(uintmax_t) - (len & (sizeof(uintmax_t) - 1));
610 for (p = mem_pool; p; p = p->next_pool)
611 if ((p->end - p->next_free >= len))
612 break;
614 if (!p) {
615 if (len >= (mem_pool_alloc/2)) {
616 total_allocd += len;
617 return xmalloc(len);
619 total_allocd += sizeof(struct mem_pool) + mem_pool_alloc;
620 p = xmalloc(sizeof(struct mem_pool) + mem_pool_alloc);
621 p->next_pool = mem_pool;
622 p->next_free = (char *) p->space;
623 p->end = p->next_free + mem_pool_alloc;
624 mem_pool = p;
627 r = p->next_free;
628 p->next_free += len;
629 return r;
632 static void *pool_calloc(size_t count, size_t size)
634 size_t len = count * size;
635 void *r = pool_alloc(len);
636 memset(r, 0, len);
637 return r;
640 static char *pool_strdup(const char *s)
642 char *r = pool_alloc(strlen(s) + 1);
643 strcpy(r, s);
644 return r;
647 static void insert_mark(uintmax_t idnum, struct object_entry *oe)
649 struct mark_set *s = marks;
650 while ((idnum >> s->shift) >= 1024) {
651 s = pool_calloc(1, sizeof(struct mark_set));
652 s->shift = marks->shift + 10;
653 s->data.sets[0] = marks;
654 marks = s;
656 while (s->shift) {
657 uintmax_t i = idnum >> s->shift;
658 idnum -= i << s->shift;
659 if (!s->data.sets[i]) {
660 s->data.sets[i] = pool_calloc(1, sizeof(struct mark_set));
661 s->data.sets[i]->shift = s->shift - 10;
663 s = s->data.sets[i];
665 if (!s->data.marked[idnum])
666 marks_set_count++;
667 s->data.marked[idnum] = oe;
670 static struct object_entry *find_mark(uintmax_t idnum)
672 uintmax_t orig_idnum = idnum;
673 struct mark_set *s = marks;
674 struct object_entry *oe = NULL;
675 if ((idnum >> s->shift) < 1024) {
676 while (s && s->shift) {
677 uintmax_t i = idnum >> s->shift;
678 idnum -= i << s->shift;
679 s = s->data.sets[i];
681 if (s)
682 oe = s->data.marked[idnum];
684 if (!oe)
685 die("mark :%" PRIuMAX " not declared", orig_idnum);
686 return oe;
689 static struct atom_str *to_atom(const char *s, unsigned short len)
691 unsigned int hc = hc_str(s, len) % atom_table_sz;
692 struct atom_str *c;
694 for (c = atom_table[hc]; c; c = c->next_atom)
695 if (c->str_len == len && !strncmp(s, c->str_dat, len))
696 return c;
698 c = pool_alloc(sizeof(struct atom_str) + len + 1);
699 c->str_len = len;
700 strncpy(c->str_dat, s, len);
701 c->str_dat[len] = 0;
702 c->next_atom = atom_table[hc];
703 atom_table[hc] = c;
704 atom_cnt++;
705 return c;
708 static struct branch *lookup_branch(const char *name)
710 unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz;
711 struct branch *b;
713 for (b = branch_table[hc]; b; b = b->table_next_branch)
714 if (!strcmp(name, b->name))
715 return b;
716 return NULL;
719 static struct branch *new_branch(const char *name)
721 unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz;
722 struct branch *b = lookup_branch(name);
724 if (b)
725 die("Invalid attempt to create duplicate branch: %s", name);
726 if (check_refname_format(name, REFNAME_ALLOW_ONELEVEL))
727 die("Branch name doesn't conform to GIT standards: %s", name);
729 b = pool_calloc(1, sizeof(struct branch));
730 b->name = pool_strdup(name);
731 b->table_next_branch = branch_table[hc];
732 b->branch_tree.versions[0].mode = S_IFDIR;
733 b->branch_tree.versions[1].mode = S_IFDIR;
734 b->num_notes = 0;
735 b->active = 0;
736 b->pack_id = MAX_PACK_ID;
737 branch_table[hc] = b;
738 branch_count++;
739 return b;
742 static unsigned int hc_entries(unsigned int cnt)
744 cnt = cnt & 7 ? (cnt / 8) + 1 : cnt / 8;
745 return cnt < avail_tree_table_sz ? cnt : avail_tree_table_sz - 1;
748 static struct tree_content *new_tree_content(unsigned int cnt)
750 struct avail_tree_content *f, *l = NULL;
751 struct tree_content *t;
752 unsigned int hc = hc_entries(cnt);
754 for (f = avail_tree_table[hc]; f; l = f, f = f->next_avail)
755 if (f->entry_capacity >= cnt)
756 break;
758 if (f) {
759 if (l)
760 l->next_avail = f->next_avail;
761 else
762 avail_tree_table[hc] = f->next_avail;
763 } else {
764 cnt = cnt & 7 ? ((cnt / 8) + 1) * 8 : cnt;
765 f = pool_alloc(sizeof(*t) + sizeof(t->entries[0]) * cnt);
766 f->entry_capacity = cnt;
769 t = (struct tree_content*)f;
770 t->entry_count = 0;
771 t->delta_depth = 0;
772 return t;
775 static void release_tree_entry(struct tree_entry *e);
776 static void release_tree_content(struct tree_content *t)
778 struct avail_tree_content *f = (struct avail_tree_content*)t;
779 unsigned int hc = hc_entries(f->entry_capacity);
780 f->next_avail = avail_tree_table[hc];
781 avail_tree_table[hc] = f;
784 static void release_tree_content_recursive(struct tree_content *t)
786 unsigned int i;
787 for (i = 0; i < t->entry_count; i++)
788 release_tree_entry(t->entries[i]);
789 release_tree_content(t);
792 static struct tree_content *grow_tree_content(
793 struct tree_content *t,
794 int amt)
796 struct tree_content *r = new_tree_content(t->entry_count + amt);
797 r->entry_count = t->entry_count;
798 r->delta_depth = t->delta_depth;
799 memcpy(r->entries,t->entries,t->entry_count*sizeof(t->entries[0]));
800 release_tree_content(t);
801 return r;
804 static struct tree_entry *new_tree_entry(void)
806 struct tree_entry *e;
808 if (!avail_tree_entry) {
809 unsigned int n = tree_entry_alloc;
810 total_allocd += n * sizeof(struct tree_entry);
811 avail_tree_entry = e = xmalloc(n * sizeof(struct tree_entry));
812 while (n-- > 1) {
813 *((void**)e) = e + 1;
814 e++;
816 *((void**)e) = NULL;
819 e = avail_tree_entry;
820 avail_tree_entry = *((void**)e);
821 return e;
824 static void release_tree_entry(struct tree_entry *e)
826 if (e->tree)
827 release_tree_content_recursive(e->tree);
828 *((void**)e) = avail_tree_entry;
829 avail_tree_entry = e;
832 static struct tree_content *dup_tree_content(struct tree_content *s)
834 struct tree_content *d;
835 struct tree_entry *a, *b;
836 unsigned int i;
838 if (!s)
839 return NULL;
840 d = new_tree_content(s->entry_count);
841 for (i = 0; i < s->entry_count; i++) {
842 a = s->entries[i];
843 b = new_tree_entry();
844 memcpy(b, a, sizeof(*a));
845 if (a->tree && is_null_sha1(b->versions[1].sha1))
846 b->tree = dup_tree_content(a->tree);
847 else
848 b->tree = NULL;
849 d->entries[i] = b;
851 d->entry_count = s->entry_count;
852 d->delta_depth = s->delta_depth;
854 return d;
857 static void start_packfile(void)
859 static char tmp_file[PATH_MAX];
860 struct packed_git *p;
861 struct pack_header hdr;
862 int pack_fd;
864 pack_fd = odb_mkstemp(tmp_file, sizeof(tmp_file),
865 "pack/tmp_pack_XXXXXX");
866 p = xcalloc(1, sizeof(*p) + strlen(tmp_file) + 2);
867 strcpy(p->pack_name, tmp_file);
868 p->pack_fd = pack_fd;
869 p->do_not_close = 1;
870 pack_file = sha1fd(pack_fd, p->pack_name);
872 hdr.hdr_signature = htonl(PACK_SIGNATURE);
873 hdr.hdr_version = htonl(2);
874 hdr.hdr_entries = 0;
875 sha1write(pack_file, &hdr, sizeof(hdr));
877 pack_data = p;
878 pack_size = sizeof(hdr);
879 object_count = 0;
881 all_packs = xrealloc(all_packs, sizeof(*all_packs) * (pack_id + 1));
882 all_packs[pack_id] = p;
885 static const char *create_index(void)
887 const char *tmpfile;
888 struct pack_idx_entry **idx, **c, **last;
889 struct object_entry *e;
890 struct object_entry_pool *o;
892 /* Build the table of object IDs. */
893 idx = xmalloc(object_count * sizeof(*idx));
894 c = idx;
895 for (o = blocks; o; o = o->next_pool)
896 for (e = o->next_free; e-- != o->entries;)
897 if (pack_id == e->pack_id)
898 *c++ = &e->idx;
899 last = idx + object_count;
900 if (c != last)
901 die("internal consistency error creating the index");
903 tmpfile = write_idx_file(NULL, idx, object_count, &pack_idx_opts, pack_data->sha1);
904 free(idx);
905 return tmpfile;
908 static char *keep_pack(const char *curr_index_name)
910 static char name[PATH_MAX];
911 static const char *keep_msg = "fast-import";
912 int keep_fd;
914 keep_fd = odb_pack_keep(name, sizeof(name), pack_data->sha1);
915 if (keep_fd < 0)
916 die_errno("cannot create keep file");
917 write_or_die(keep_fd, keep_msg, strlen(keep_msg));
918 if (close(keep_fd))
919 die_errno("failed to write keep file");
921 snprintf(name, sizeof(name), "%s/pack/pack-%s.pack",
922 get_object_directory(), sha1_to_hex(pack_data->sha1));
923 if (move_temp_to_file(pack_data->pack_name, name))
924 die("cannot store pack file");
926 snprintf(name, sizeof(name), "%s/pack/pack-%s.idx",
927 get_object_directory(), sha1_to_hex(pack_data->sha1));
928 if (move_temp_to_file(curr_index_name, name))
929 die("cannot store index file");
930 free((void *)curr_index_name);
931 return name;
934 static void unkeep_all_packs(void)
936 static char name[PATH_MAX];
937 int k;
939 for (k = 0; k < pack_id; k++) {
940 struct packed_git *p = all_packs[k];
941 snprintf(name, sizeof(name), "%s/pack/pack-%s.keep",
942 get_object_directory(), sha1_to_hex(p->sha1));
943 unlink_or_warn(name);
947 static void end_packfile(void)
949 if (!pack_data)
950 return;
952 clear_delta_base_cache();
953 if (object_count) {
954 struct packed_git *new_p;
955 unsigned char cur_pack_sha1[20];
956 char *idx_name;
957 int i;
958 struct branch *b;
959 struct tag *t;
961 close_pack_windows(pack_data);
962 sha1close(pack_file, cur_pack_sha1, 0);
963 fixup_pack_header_footer(pack_data->pack_fd, pack_data->sha1,
964 pack_data->pack_name, object_count,
965 cur_pack_sha1, pack_size);
966 close(pack_data->pack_fd);
967 idx_name = keep_pack(create_index());
969 /* Register the packfile with core git's machinery. */
970 new_p = add_packed_git(idx_name, strlen(idx_name), 1);
971 if (!new_p)
972 die("core git rejected index %s", idx_name);
973 all_packs[pack_id] = new_p;
974 install_packed_git(new_p);
976 /* Print the boundary */
977 if (pack_edges) {
978 fprintf(pack_edges, "%s:", new_p->pack_name);
979 for (i = 0; i < branch_table_sz; i++) {
980 for (b = branch_table[i]; b; b = b->table_next_branch) {
981 if (b->pack_id == pack_id)
982 fprintf(pack_edges, " %s", sha1_to_hex(b->sha1));
985 for (t = first_tag; t; t = t->next_tag) {
986 if (t->pack_id == pack_id)
987 fprintf(pack_edges, " %s", sha1_to_hex(t->sha1));
989 fputc('\n', pack_edges);
990 fflush(pack_edges);
993 pack_id++;
995 else {
996 close(pack_data->pack_fd);
997 unlink_or_warn(pack_data->pack_name);
999 free(pack_data);
1000 pack_data = NULL;
1002 /* We can't carry a delta across packfiles. */
1003 strbuf_release(&last_blob.data);
1004 last_blob.offset = 0;
1005 last_blob.depth = 0;
1008 static void cycle_packfile(void)
1010 end_packfile();
1011 start_packfile();
1014 static int store_object(
1015 enum object_type type,
1016 struct strbuf *dat,
1017 struct last_object *last,
1018 unsigned char *sha1out,
1019 uintmax_t mark)
1021 void *out, *delta;
1022 struct object_entry *e;
1023 unsigned char hdr[96];
1024 unsigned char sha1[20];
1025 unsigned long hdrlen, deltalen;
1026 git_SHA_CTX c;
1027 git_zstream s;
1029 hdrlen = sprintf((char *)hdr,"%s %lu", typename(type),
1030 (unsigned long)dat->len) + 1;
1031 git_SHA1_Init(&c);
1032 git_SHA1_Update(&c, hdr, hdrlen);
1033 git_SHA1_Update(&c, dat->buf, dat->len);
1034 git_SHA1_Final(sha1, &c);
1035 if (sha1out)
1036 hashcpy(sha1out, sha1);
1038 e = insert_object(sha1);
1039 if (mark)
1040 insert_mark(mark, e);
1041 if (e->idx.offset) {
1042 duplicate_count_by_type[type]++;
1043 return 1;
1044 } else if (find_sha1_pack(sha1, packed_git)) {
1045 e->type = type;
1046 e->pack_id = MAX_PACK_ID;
1047 e->idx.offset = 1; /* just not zero! */
1048 duplicate_count_by_type[type]++;
1049 return 1;
1052 if (last && last->data.buf && last->depth < max_depth && dat->len > 20) {
1053 delta_count_attempts_by_type[type]++;
1054 delta = diff_delta(last->data.buf, last->data.len,
1055 dat->buf, dat->len,
1056 &deltalen, dat->len - 20);
1057 } else
1058 delta = NULL;
1060 memset(&s, 0, sizeof(s));
1061 git_deflate_init(&s, pack_compression_level);
1062 if (delta) {
1063 s.next_in = delta;
1064 s.avail_in = deltalen;
1065 } else {
1066 s.next_in = (void *)dat->buf;
1067 s.avail_in = dat->len;
1069 s.avail_out = git_deflate_bound(&s, s.avail_in);
1070 s.next_out = out = xmalloc(s.avail_out);
1071 while (git_deflate(&s, Z_FINISH) == Z_OK)
1072 ; /* nothing */
1073 git_deflate_end(&s);
1075 /* Determine if we should auto-checkpoint. */
1076 if ((max_packsize && (pack_size + 60 + s.total_out) > max_packsize)
1077 || (pack_size + 60 + s.total_out) < pack_size) {
1079 /* This new object needs to *not* have the current pack_id. */
1080 e->pack_id = pack_id + 1;
1081 cycle_packfile();
1083 /* We cannot carry a delta into the new pack. */
1084 if (delta) {
1085 free(delta);
1086 delta = NULL;
1088 memset(&s, 0, sizeof(s));
1089 git_deflate_init(&s, pack_compression_level);
1090 s.next_in = (void *)dat->buf;
1091 s.avail_in = dat->len;
1092 s.avail_out = git_deflate_bound(&s, s.avail_in);
1093 s.next_out = out = xrealloc(out, s.avail_out);
1094 while (git_deflate(&s, Z_FINISH) == Z_OK)
1095 ; /* nothing */
1096 git_deflate_end(&s);
1100 e->type = type;
1101 e->pack_id = pack_id;
1102 e->idx.offset = pack_size;
1103 object_count++;
1104 object_count_by_type[type]++;
1106 crc32_begin(pack_file);
1108 if (delta) {
1109 off_t ofs = e->idx.offset - last->offset;
1110 unsigned pos = sizeof(hdr) - 1;
1112 delta_count_by_type[type]++;
1113 e->depth = last->depth + 1;
1115 hdrlen = encode_in_pack_object_header(OBJ_OFS_DELTA, deltalen, hdr);
1116 sha1write(pack_file, hdr, hdrlen);
1117 pack_size += hdrlen;
1119 hdr[pos] = ofs & 127;
1120 while (ofs >>= 7)
1121 hdr[--pos] = 128 | (--ofs & 127);
1122 sha1write(pack_file, hdr + pos, sizeof(hdr) - pos);
1123 pack_size += sizeof(hdr) - pos;
1124 } else {
1125 e->depth = 0;
1126 hdrlen = encode_in_pack_object_header(type, dat->len, hdr);
1127 sha1write(pack_file, hdr, hdrlen);
1128 pack_size += hdrlen;
1131 sha1write(pack_file, out, s.total_out);
1132 pack_size += s.total_out;
1134 e->idx.crc32 = crc32_end(pack_file);
1136 free(out);
1137 free(delta);
1138 if (last) {
1139 if (last->no_swap) {
1140 last->data = *dat;
1141 } else {
1142 strbuf_swap(&last->data, dat);
1144 last->offset = e->idx.offset;
1145 last->depth = e->depth;
1147 return 0;
1150 static void truncate_pack(struct sha1file_checkpoint *checkpoint)
1152 if (sha1file_truncate(pack_file, checkpoint))
1153 die_errno("cannot truncate pack to skip duplicate");
1154 pack_size = checkpoint->offset;
1157 static void stream_blob(uintmax_t len, unsigned char *sha1out, uintmax_t mark)
1159 size_t in_sz = 64 * 1024, out_sz = 64 * 1024;
1160 unsigned char *in_buf = xmalloc(in_sz);
1161 unsigned char *out_buf = xmalloc(out_sz);
1162 struct object_entry *e;
1163 unsigned char sha1[20];
1164 unsigned long hdrlen;
1165 off_t offset;
1166 git_SHA_CTX c;
1167 git_zstream s;
1168 struct sha1file_checkpoint checkpoint;
1169 int status = Z_OK;
1171 /* Determine if we should auto-checkpoint. */
1172 if ((max_packsize && (pack_size + 60 + len) > max_packsize)
1173 || (pack_size + 60 + len) < pack_size)
1174 cycle_packfile();
1176 sha1file_checkpoint(pack_file, &checkpoint);
1177 offset = checkpoint.offset;
1179 hdrlen = snprintf((char *)out_buf, out_sz, "blob %" PRIuMAX, len) + 1;
1180 if (out_sz <= hdrlen)
1181 die("impossibly large object header");
1183 git_SHA1_Init(&c);
1184 git_SHA1_Update(&c, out_buf, hdrlen);
1186 crc32_begin(pack_file);
1188 memset(&s, 0, sizeof(s));
1189 git_deflate_init(&s, pack_compression_level);
1191 hdrlen = encode_in_pack_object_header(OBJ_BLOB, len, out_buf);
1192 if (out_sz <= hdrlen)
1193 die("impossibly large object header");
1195 s.next_out = out_buf + hdrlen;
1196 s.avail_out = out_sz - hdrlen;
1198 while (status != Z_STREAM_END) {
1199 if (0 < len && !s.avail_in) {
1200 size_t cnt = in_sz < len ? in_sz : (size_t)len;
1201 size_t n = fread(in_buf, 1, cnt, stdin);
1202 if (!n && feof(stdin))
1203 die("EOF in data (%" PRIuMAX " bytes remaining)", len);
1205 git_SHA1_Update(&c, in_buf, n);
1206 s.next_in = in_buf;
1207 s.avail_in = n;
1208 len -= n;
1211 status = git_deflate(&s, len ? 0 : Z_FINISH);
1213 if (!s.avail_out || status == Z_STREAM_END) {
1214 size_t n = s.next_out - out_buf;
1215 sha1write(pack_file, out_buf, n);
1216 pack_size += n;
1217 s.next_out = out_buf;
1218 s.avail_out = out_sz;
1221 switch (status) {
1222 case Z_OK:
1223 case Z_BUF_ERROR:
1224 case Z_STREAM_END:
1225 continue;
1226 default:
1227 die("unexpected deflate failure: %d", status);
1230 git_deflate_end(&s);
1231 git_SHA1_Final(sha1, &c);
1233 if (sha1out)
1234 hashcpy(sha1out, sha1);
1236 e = insert_object(sha1);
1238 if (mark)
1239 insert_mark(mark, e);
1241 if (e->idx.offset) {
1242 duplicate_count_by_type[OBJ_BLOB]++;
1243 truncate_pack(&checkpoint);
1245 } else if (find_sha1_pack(sha1, packed_git)) {
1246 e->type = OBJ_BLOB;
1247 e->pack_id = MAX_PACK_ID;
1248 e->idx.offset = 1; /* just not zero! */
1249 duplicate_count_by_type[OBJ_BLOB]++;
1250 truncate_pack(&checkpoint);
1252 } else {
1253 e->depth = 0;
1254 e->type = OBJ_BLOB;
1255 e->pack_id = pack_id;
1256 e->idx.offset = offset;
1257 e->idx.crc32 = crc32_end(pack_file);
1258 object_count++;
1259 object_count_by_type[OBJ_BLOB]++;
1262 free(in_buf);
1263 free(out_buf);
1266 /* All calls must be guarded by find_object() or find_mark() to
1267 * ensure the 'struct object_entry' passed was written by this
1268 * process instance. We unpack the entry by the offset, avoiding
1269 * the need for the corresponding .idx file. This unpacking rule
1270 * works because we only use OBJ_REF_DELTA within the packfiles
1271 * created by fast-import.
1273 * oe must not be NULL. Such an oe usually comes from giving
1274 * an unknown SHA-1 to find_object() or an undefined mark to
1275 * find_mark(). Callers must test for this condition and use
1276 * the standard read_sha1_file() when it happens.
1278 * oe->pack_id must not be MAX_PACK_ID. Such an oe is usually from
1279 * find_mark(), where the mark was reloaded from an existing marks
1280 * file and is referencing an object that this fast-import process
1281 * instance did not write out to a packfile. Callers must test for
1282 * this condition and use read_sha1_file() instead.
1284 static void *gfi_unpack_entry(
1285 struct object_entry *oe,
1286 unsigned long *sizep)
1288 enum object_type type;
1289 struct packed_git *p = all_packs[oe->pack_id];
1290 if (p == pack_data && p->pack_size < (pack_size + 20)) {
1291 /* The object is stored in the packfile we are writing to
1292 * and we have modified it since the last time we scanned
1293 * back to read a previously written object. If an old
1294 * window covered [p->pack_size, p->pack_size + 20) its
1295 * data is stale and is not valid. Closing all windows
1296 * and updating the packfile length ensures we can read
1297 * the newly written data.
1299 close_pack_windows(p);
1300 sha1flush(pack_file);
1302 /* We have to offer 20 bytes additional on the end of
1303 * the packfile as the core unpacker code assumes the
1304 * footer is present at the file end and must promise
1305 * at least 20 bytes within any window it maps. But
1306 * we don't actually create the footer here.
1308 p->pack_size = pack_size + 20;
1310 return unpack_entry(p, oe->idx.offset, &type, sizep);
1313 static const char *get_mode(const char *str, uint16_t *modep)
1315 unsigned char c;
1316 uint16_t mode = 0;
1318 while ((c = *str++) != ' ') {
1319 if (c < '0' || c > '7')
1320 return NULL;
1321 mode = (mode << 3) + (c - '0');
1323 *modep = mode;
1324 return str;
1327 static void load_tree(struct tree_entry *root)
1329 unsigned char *sha1 = root->versions[1].sha1;
1330 struct object_entry *myoe;
1331 struct tree_content *t;
1332 unsigned long size;
1333 char *buf;
1334 const char *c;
1336 root->tree = t = new_tree_content(8);
1337 if (is_null_sha1(sha1))
1338 return;
1340 myoe = find_object(sha1);
1341 if (myoe && myoe->pack_id != MAX_PACK_ID) {
1342 if (myoe->type != OBJ_TREE)
1343 die("Not a tree: %s", sha1_to_hex(sha1));
1344 t->delta_depth = myoe->depth;
1345 buf = gfi_unpack_entry(myoe, &size);
1346 if (!buf)
1347 die("Can't load tree %s", sha1_to_hex(sha1));
1348 } else {
1349 enum object_type type;
1350 buf = read_sha1_file(sha1, &type, &size);
1351 if (!buf || type != OBJ_TREE)
1352 die("Can't load tree %s", sha1_to_hex(sha1));
1355 c = buf;
1356 while (c != (buf + size)) {
1357 struct tree_entry *e = new_tree_entry();
1359 if (t->entry_count == t->entry_capacity)
1360 root->tree = t = grow_tree_content(t, t->entry_count);
1361 t->entries[t->entry_count++] = e;
1363 e->tree = NULL;
1364 c = get_mode(c, &e->versions[1].mode);
1365 if (!c)
1366 die("Corrupt mode in %s", sha1_to_hex(sha1));
1367 e->versions[0].mode = e->versions[1].mode;
1368 e->name = to_atom(c, strlen(c));
1369 c += e->name->str_len + 1;
1370 hashcpy(e->versions[0].sha1, (unsigned char *)c);
1371 hashcpy(e->versions[1].sha1, (unsigned char *)c);
1372 c += 20;
1374 free(buf);
1377 static int tecmp0 (const void *_a, const void *_b)
1379 struct tree_entry *a = *((struct tree_entry**)_a);
1380 struct tree_entry *b = *((struct tree_entry**)_b);
1381 return base_name_compare(
1382 a->name->str_dat, a->name->str_len, a->versions[0].mode,
1383 b->name->str_dat, b->name->str_len, b->versions[0].mode);
1386 static int tecmp1 (const void *_a, const void *_b)
1388 struct tree_entry *a = *((struct tree_entry**)_a);
1389 struct tree_entry *b = *((struct tree_entry**)_b);
1390 return base_name_compare(
1391 a->name->str_dat, a->name->str_len, a->versions[1].mode,
1392 b->name->str_dat, b->name->str_len, b->versions[1].mode);
1395 static void mktree(struct tree_content *t, int v, struct strbuf *b)
1397 size_t maxlen = 0;
1398 unsigned int i;
1400 if (!v)
1401 qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp0);
1402 else
1403 qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp1);
1405 for (i = 0; i < t->entry_count; i++) {
1406 if (t->entries[i]->versions[v].mode)
1407 maxlen += t->entries[i]->name->str_len + 34;
1410 strbuf_reset(b);
1411 strbuf_grow(b, maxlen);
1412 for (i = 0; i < t->entry_count; i++) {
1413 struct tree_entry *e = t->entries[i];
1414 if (!e->versions[v].mode)
1415 continue;
1416 strbuf_addf(b, "%o %s%c",
1417 (unsigned int)(e->versions[v].mode & ~NO_DELTA),
1418 e->name->str_dat, '\0');
1419 strbuf_add(b, e->versions[v].sha1, 20);
1423 static void store_tree(struct tree_entry *root)
1425 struct tree_content *t = root->tree;
1426 unsigned int i, j, del;
1427 struct last_object lo = { STRBUF_INIT, 0, 0, /* no_swap */ 1 };
1428 struct object_entry *le = NULL;
1430 if (!is_null_sha1(root->versions[1].sha1))
1431 return;
1433 for (i = 0; i < t->entry_count; i++) {
1434 if (t->entries[i]->tree)
1435 store_tree(t->entries[i]);
1438 if (!(root->versions[0].mode & NO_DELTA))
1439 le = find_object(root->versions[0].sha1);
1440 if (S_ISDIR(root->versions[0].mode) && le && le->pack_id == pack_id) {
1441 mktree(t, 0, &old_tree);
1442 lo.data = old_tree;
1443 lo.offset = le->idx.offset;
1444 lo.depth = t->delta_depth;
1447 mktree(t, 1, &new_tree);
1448 store_object(OBJ_TREE, &new_tree, &lo, root->versions[1].sha1, 0);
1450 t->delta_depth = lo.depth;
1451 for (i = 0, j = 0, del = 0; i < t->entry_count; i++) {
1452 struct tree_entry *e = t->entries[i];
1453 if (e->versions[1].mode) {
1454 e->versions[0].mode = e->versions[1].mode;
1455 hashcpy(e->versions[0].sha1, e->versions[1].sha1);
1456 t->entries[j++] = e;
1457 } else {
1458 release_tree_entry(e);
1459 del++;
1462 t->entry_count -= del;
1465 static void tree_content_replace(
1466 struct tree_entry *root,
1467 const unsigned char *sha1,
1468 const uint16_t mode,
1469 struct tree_content *newtree)
1471 if (!S_ISDIR(mode))
1472 die("Root cannot be a non-directory");
1473 hashclr(root->versions[0].sha1);
1474 hashcpy(root->versions[1].sha1, sha1);
1475 if (root->tree)
1476 release_tree_content_recursive(root->tree);
1477 root->tree = newtree;
1480 static int tree_content_set(
1481 struct tree_entry *root,
1482 const char *p,
1483 const unsigned char *sha1,
1484 const uint16_t mode,
1485 struct tree_content *subtree)
1487 struct tree_content *t;
1488 const char *slash1;
1489 unsigned int i, n;
1490 struct tree_entry *e;
1492 slash1 = strchrnul(p, '/');
1493 n = slash1 - p;
1494 if (!n)
1495 die("Empty path component found in input");
1496 if (!*slash1 && !S_ISDIR(mode) && subtree)
1497 die("Non-directories cannot have subtrees");
1499 if (!root->tree)
1500 load_tree(root);
1501 t = root->tree;
1502 for (i = 0; i < t->entry_count; i++) {
1503 e = t->entries[i];
1504 if (e->name->str_len == n && !strncmp_icase(p, e->name->str_dat, n)) {
1505 if (!*slash1) {
1506 if (!S_ISDIR(mode)
1507 && e->versions[1].mode == mode
1508 && !hashcmp(e->versions[1].sha1, sha1))
1509 return 0;
1510 e->versions[1].mode = mode;
1511 hashcpy(e->versions[1].sha1, sha1);
1512 if (e->tree)
1513 release_tree_content_recursive(e->tree);
1514 e->tree = subtree;
1517 * We need to leave e->versions[0].sha1 alone
1518 * to avoid modifying the preimage tree used
1519 * when writing out the parent directory.
1520 * But after replacing the subdir with a
1521 * completely different one, it's not a good
1522 * delta base any more, and besides, we've
1523 * thrown away the tree entries needed to
1524 * make a delta against it.
1526 * So let's just explicitly disable deltas
1527 * for the subtree.
1529 if (S_ISDIR(e->versions[0].mode))
1530 e->versions[0].mode |= NO_DELTA;
1532 hashclr(root->versions[1].sha1);
1533 return 1;
1535 if (!S_ISDIR(e->versions[1].mode)) {
1536 e->tree = new_tree_content(8);
1537 e->versions[1].mode = S_IFDIR;
1539 if (!e->tree)
1540 load_tree(e);
1541 if (tree_content_set(e, slash1 + 1, sha1, mode, subtree)) {
1542 hashclr(root->versions[1].sha1);
1543 return 1;
1545 return 0;
1549 if (t->entry_count == t->entry_capacity)
1550 root->tree = t = grow_tree_content(t, t->entry_count);
1551 e = new_tree_entry();
1552 e->name = to_atom(p, n);
1553 e->versions[0].mode = 0;
1554 hashclr(e->versions[0].sha1);
1555 t->entries[t->entry_count++] = e;
1556 if (*slash1) {
1557 e->tree = new_tree_content(8);
1558 e->versions[1].mode = S_IFDIR;
1559 tree_content_set(e, slash1 + 1, sha1, mode, subtree);
1560 } else {
1561 e->tree = subtree;
1562 e->versions[1].mode = mode;
1563 hashcpy(e->versions[1].sha1, sha1);
1565 hashclr(root->versions[1].sha1);
1566 return 1;
1569 static int tree_content_remove(
1570 struct tree_entry *root,
1571 const char *p,
1572 struct tree_entry *backup_leaf,
1573 int allow_root)
1575 struct tree_content *t;
1576 const char *slash1;
1577 unsigned int i, n;
1578 struct tree_entry *e;
1580 slash1 = strchrnul(p, '/');
1581 n = slash1 - p;
1583 if (!root->tree)
1584 load_tree(root);
1586 if (!*p && allow_root) {
1587 e = root;
1588 goto del_entry;
1591 t = root->tree;
1592 for (i = 0; i < t->entry_count; i++) {
1593 e = t->entries[i];
1594 if (e->name->str_len == n && !strncmp_icase(p, e->name->str_dat, n)) {
1595 if (*slash1 && !S_ISDIR(e->versions[1].mode))
1597 * If p names a file in some subdirectory, and a
1598 * file or symlink matching the name of the
1599 * parent directory of p exists, then p cannot
1600 * exist and need not be deleted.
1602 return 1;
1603 if (!*slash1 || !S_ISDIR(e->versions[1].mode))
1604 goto del_entry;
1605 if (!e->tree)
1606 load_tree(e);
1607 if (tree_content_remove(e, slash1 + 1, backup_leaf, 0)) {
1608 for (n = 0; n < e->tree->entry_count; n++) {
1609 if (e->tree->entries[n]->versions[1].mode) {
1610 hashclr(root->versions[1].sha1);
1611 return 1;
1614 backup_leaf = NULL;
1615 goto del_entry;
1617 return 0;
1620 return 0;
1622 del_entry:
1623 if (backup_leaf)
1624 memcpy(backup_leaf, e, sizeof(*backup_leaf));
1625 else if (e->tree)
1626 release_tree_content_recursive(e->tree);
1627 e->tree = NULL;
1628 e->versions[1].mode = 0;
1629 hashclr(e->versions[1].sha1);
1630 hashclr(root->versions[1].sha1);
1631 return 1;
1634 static int tree_content_get(
1635 struct tree_entry *root,
1636 const char *p,
1637 struct tree_entry *leaf,
1638 int allow_root)
1640 struct tree_content *t;
1641 const char *slash1;
1642 unsigned int i, n;
1643 struct tree_entry *e;
1645 slash1 = strchrnul(p, '/');
1646 n = slash1 - p;
1647 if (!n && !allow_root)
1648 die("Empty path component found in input");
1650 if (!root->tree)
1651 load_tree(root);
1653 if (!n) {
1654 e = root;
1655 goto found_entry;
1658 t = root->tree;
1659 for (i = 0; i < t->entry_count; i++) {
1660 e = t->entries[i];
1661 if (e->name->str_len == n && !strncmp_icase(p, e->name->str_dat, n)) {
1662 if (!*slash1)
1663 goto found_entry;
1664 if (!S_ISDIR(e->versions[1].mode))
1665 return 0;
1666 if (!e->tree)
1667 load_tree(e);
1668 return tree_content_get(e, slash1 + 1, leaf, 0);
1671 return 0;
1673 found_entry:
1674 memcpy(leaf, e, sizeof(*leaf));
1675 if (e->tree && is_null_sha1(e->versions[1].sha1))
1676 leaf->tree = dup_tree_content(e->tree);
1677 else
1678 leaf->tree = NULL;
1679 return 1;
1682 static int update_branch(struct branch *b)
1684 static const char *msg = "fast-import";
1685 struct ref_transaction *transaction;
1686 unsigned char old_sha1[20];
1687 struct strbuf err = STRBUF_INIT;
1689 if (read_ref(b->name, old_sha1))
1690 hashclr(old_sha1);
1691 if (is_null_sha1(b->sha1)) {
1692 if (b->delete)
1693 delete_ref(b->name, old_sha1, 0);
1694 return 0;
1696 if (!force_update && !is_null_sha1(old_sha1)) {
1697 struct commit *old_cmit, *new_cmit;
1699 old_cmit = lookup_commit_reference_gently(old_sha1, 0);
1700 new_cmit = lookup_commit_reference_gently(b->sha1, 0);
1701 if (!old_cmit || !new_cmit)
1702 return error("Branch %s is missing commits.", b->name);
1704 if (!in_merge_bases(old_cmit, new_cmit)) {
1705 warning("Not updating %s"
1706 " (new tip %s does not contain %s)",
1707 b->name, sha1_to_hex(b->sha1), sha1_to_hex(old_sha1));
1708 return -1;
1711 transaction = ref_transaction_begin(&err);
1712 if (!transaction ||
1713 ref_transaction_update(transaction, b->name, b->sha1, old_sha1,
1714 0, 1, &err) ||
1715 ref_transaction_commit(transaction, msg, &err)) {
1716 ref_transaction_free(transaction);
1717 error("%s", err.buf);
1718 strbuf_release(&err);
1719 return -1;
1721 ref_transaction_free(transaction);
1722 strbuf_release(&err);
1723 return 0;
1726 static void dump_branches(void)
1728 unsigned int i;
1729 struct branch *b;
1731 for (i = 0; i < branch_table_sz; i++) {
1732 for (b = branch_table[i]; b; b = b->table_next_branch)
1733 failure |= update_branch(b);
1737 static void dump_tags(void)
1739 static const char *msg = "fast-import";
1740 struct tag *t;
1741 struct strbuf ref_name = STRBUF_INIT;
1742 struct strbuf err = STRBUF_INIT;
1743 struct ref_transaction *transaction;
1745 transaction = ref_transaction_begin(&err);
1746 if (!transaction) {
1747 failure |= error("%s", err.buf);
1748 goto cleanup;
1750 for (t = first_tag; t; t = t->next_tag) {
1751 strbuf_reset(&ref_name);
1752 strbuf_addf(&ref_name, "refs/tags/%s", t->name);
1754 if (ref_transaction_update(transaction, ref_name.buf, t->sha1,
1755 NULL, 0, 0, &err)) {
1756 failure |= error("%s", err.buf);
1757 goto cleanup;
1760 if (ref_transaction_commit(transaction, msg, &err))
1761 failure |= error("%s", err.buf);
1763 cleanup:
1764 ref_transaction_free(transaction);
1765 strbuf_release(&ref_name);
1766 strbuf_release(&err);
1769 static void dump_marks_helper(FILE *f,
1770 uintmax_t base,
1771 struct mark_set *m)
1773 uintmax_t k;
1774 if (m->shift) {
1775 for (k = 0; k < 1024; k++) {
1776 if (m->data.sets[k])
1777 dump_marks_helper(f, base + (k << m->shift),
1778 m->data.sets[k]);
1780 } else {
1781 for (k = 0; k < 1024; k++) {
1782 if (m->data.marked[k])
1783 fprintf(f, ":%" PRIuMAX " %s\n", base + k,
1784 sha1_to_hex(m->data.marked[k]->idx.sha1));
1789 static void dump_marks(void)
1791 static struct lock_file mark_lock;
1792 int mark_fd;
1793 FILE *f;
1795 if (!export_marks_file)
1796 return;
1798 mark_fd = hold_lock_file_for_update(&mark_lock, export_marks_file, 0);
1799 if (mark_fd < 0) {
1800 failure |= error("Unable to write marks file %s: %s",
1801 export_marks_file, strerror(errno));
1802 return;
1805 f = fdopen(mark_fd, "w");
1806 if (!f) {
1807 int saved_errno = errno;
1808 rollback_lock_file(&mark_lock);
1809 failure |= error("Unable to write marks file %s: %s",
1810 export_marks_file, strerror(saved_errno));
1811 return;
1815 * Since the lock file was fdopen()'ed, it should not be close()'ed.
1816 * Assign -1 to the lock file descriptor so that commit_lock_file()
1817 * won't try to close() it.
1819 mark_lock.fd = -1;
1821 dump_marks_helper(f, 0, marks);
1822 if (ferror(f) || fclose(f)) {
1823 int saved_errno = errno;
1824 rollback_lock_file(&mark_lock);
1825 failure |= error("Unable to write marks file %s: %s",
1826 export_marks_file, strerror(saved_errno));
1827 return;
1830 if (commit_lock_file(&mark_lock)) {
1831 int saved_errno = errno;
1832 rollback_lock_file(&mark_lock);
1833 failure |= error("Unable to commit marks file %s: %s",
1834 export_marks_file, strerror(saved_errno));
1835 return;
1839 static void read_marks(void)
1841 char line[512];
1842 FILE *f = fopen(import_marks_file, "r");
1843 if (f)
1845 else if (import_marks_file_ignore_missing && errno == ENOENT)
1846 return; /* Marks file does not exist */
1847 else
1848 die_errno("cannot read '%s'", import_marks_file);
1849 while (fgets(line, sizeof(line), f)) {
1850 uintmax_t mark;
1851 char *end;
1852 unsigned char sha1[20];
1853 struct object_entry *e;
1855 end = strchr(line, '\n');
1856 if (line[0] != ':' || !end)
1857 die("corrupt mark line: %s", line);
1858 *end = 0;
1859 mark = strtoumax(line + 1, &end, 10);
1860 if (!mark || end == line + 1
1861 || *end != ' ' || get_sha1_hex(end + 1, sha1))
1862 die("corrupt mark line: %s", line);
1863 e = find_object(sha1);
1864 if (!e) {
1865 enum object_type type = sha1_object_info(sha1, NULL);
1866 if (type < 0)
1867 die("object not found: %s", sha1_to_hex(sha1));
1868 e = insert_object(sha1);
1869 e->type = type;
1870 e->pack_id = MAX_PACK_ID;
1871 e->idx.offset = 1; /* just not zero! */
1873 insert_mark(mark, e);
1875 fclose(f);
1879 static int read_next_command(void)
1881 static int stdin_eof = 0;
1883 if (stdin_eof) {
1884 unread_command_buf = 0;
1885 return EOF;
1888 for (;;) {
1889 const char *p;
1891 if (unread_command_buf) {
1892 unread_command_buf = 0;
1893 } else {
1894 struct recent_command *rc;
1896 strbuf_detach(&command_buf, NULL);
1897 stdin_eof = strbuf_getline(&command_buf, stdin, '\n');
1898 if (stdin_eof)
1899 return EOF;
1901 if (!seen_data_command
1902 && !starts_with(command_buf.buf, "feature ")
1903 && !starts_with(command_buf.buf, "option ")) {
1904 parse_argv();
1907 rc = rc_free;
1908 if (rc)
1909 rc_free = rc->next;
1910 else {
1911 rc = cmd_hist.next;
1912 cmd_hist.next = rc->next;
1913 cmd_hist.next->prev = &cmd_hist;
1914 free(rc->buf);
1917 rc->buf = command_buf.buf;
1918 rc->prev = cmd_tail;
1919 rc->next = cmd_hist.prev;
1920 rc->prev->next = rc;
1921 cmd_tail = rc;
1923 if (skip_prefix(command_buf.buf, "cat-blob ", &p)) {
1924 parse_cat_blob(p);
1925 continue;
1927 if (command_buf.buf[0] == '#')
1928 continue;
1929 return 0;
1933 static void skip_optional_lf(void)
1935 int term_char = fgetc(stdin);
1936 if (term_char != '\n' && term_char != EOF)
1937 ungetc(term_char, stdin);
1940 static void parse_mark(void)
1942 const char *v;
1943 if (skip_prefix(command_buf.buf, "mark :", &v)) {
1944 next_mark = strtoumax(v, NULL, 10);
1945 read_next_command();
1947 else
1948 next_mark = 0;
1951 static int parse_data(struct strbuf *sb, uintmax_t limit, uintmax_t *len_res)
1953 const char *data;
1954 strbuf_reset(sb);
1956 if (!skip_prefix(command_buf.buf, "data ", &data))
1957 die("Expected 'data n' command, found: %s", command_buf.buf);
1959 if (skip_prefix(data, "<<", &data)) {
1960 char *term = xstrdup(data);
1961 size_t term_len = command_buf.len - (data - command_buf.buf);
1963 strbuf_detach(&command_buf, NULL);
1964 for (;;) {
1965 if (strbuf_getline(&command_buf, stdin, '\n') == EOF)
1966 die("EOF in data (terminator '%s' not found)", term);
1967 if (term_len == command_buf.len
1968 && !strcmp(term, command_buf.buf))
1969 break;
1970 strbuf_addbuf(sb, &command_buf);
1971 strbuf_addch(sb, '\n');
1973 free(term);
1975 else {
1976 uintmax_t len = strtoumax(data, NULL, 10);
1977 size_t n = 0, length = (size_t)len;
1979 if (limit && limit < len) {
1980 *len_res = len;
1981 return 0;
1983 if (length < len)
1984 die("data is too large to use in this context");
1986 while (n < length) {
1987 size_t s = strbuf_fread(sb, length - n, stdin);
1988 if (!s && feof(stdin))
1989 die("EOF in data (%lu bytes remaining)",
1990 (unsigned long)(length - n));
1991 n += s;
1995 skip_optional_lf();
1996 return 1;
1999 static int validate_raw_date(const char *src, char *result, int maxlen)
2001 const char *orig_src = src;
2002 char *endp;
2003 unsigned long num;
2005 errno = 0;
2007 num = strtoul(src, &endp, 10);
2008 /* NEEDSWORK: perhaps check for reasonable values? */
2009 if (errno || endp == src || *endp != ' ')
2010 return -1;
2012 src = endp + 1;
2013 if (*src != '-' && *src != '+')
2014 return -1;
2016 num = strtoul(src + 1, &endp, 10);
2017 if (errno || endp == src + 1 || *endp || (endp - orig_src) >= maxlen ||
2018 1400 < num)
2019 return -1;
2021 strcpy(result, orig_src);
2022 return 0;
2025 static char *parse_ident(const char *buf)
2027 const char *ltgt;
2028 size_t name_len;
2029 char *ident;
2031 /* ensure there is a space delimiter even if there is no name */
2032 if (*buf == '<')
2033 --buf;
2035 ltgt = buf + strcspn(buf, "<>");
2036 if (*ltgt != '<')
2037 die("Missing < in ident string: %s", buf);
2038 if (ltgt != buf && ltgt[-1] != ' ')
2039 die("Missing space before < in ident string: %s", buf);
2040 ltgt = ltgt + 1 + strcspn(ltgt + 1, "<>");
2041 if (*ltgt != '>')
2042 die("Missing > in ident string: %s", buf);
2043 ltgt++;
2044 if (*ltgt != ' ')
2045 die("Missing space after > in ident string: %s", buf);
2046 ltgt++;
2047 name_len = ltgt - buf;
2048 ident = xmalloc(name_len + 24);
2049 strncpy(ident, buf, name_len);
2051 switch (whenspec) {
2052 case WHENSPEC_RAW:
2053 if (validate_raw_date(ltgt, ident + name_len, 24) < 0)
2054 die("Invalid raw date \"%s\" in ident: %s", ltgt, buf);
2055 break;
2056 case WHENSPEC_RFC2822:
2057 if (parse_date(ltgt, ident + name_len, 24) < 0)
2058 die("Invalid rfc2822 date \"%s\" in ident: %s", ltgt, buf);
2059 break;
2060 case WHENSPEC_NOW:
2061 if (strcmp("now", ltgt))
2062 die("Date in ident must be 'now': %s", buf);
2063 datestamp(ident + name_len, 24);
2064 break;
2067 return ident;
2070 static void parse_and_store_blob(
2071 struct last_object *last,
2072 unsigned char *sha1out,
2073 uintmax_t mark)
2075 static struct strbuf buf = STRBUF_INIT;
2076 uintmax_t len;
2078 if (parse_data(&buf, big_file_threshold, &len))
2079 store_object(OBJ_BLOB, &buf, last, sha1out, mark);
2080 else {
2081 if (last) {
2082 strbuf_release(&last->data);
2083 last->offset = 0;
2084 last->depth = 0;
2086 stream_blob(len, sha1out, mark);
2087 skip_optional_lf();
2091 static void parse_new_blob(void)
2093 read_next_command();
2094 parse_mark();
2095 parse_and_store_blob(&last_blob, NULL, next_mark);
2098 static void unload_one_branch(void)
2100 while (cur_active_branches
2101 && cur_active_branches >= max_active_branches) {
2102 uintmax_t min_commit = ULONG_MAX;
2103 struct branch *e, *l = NULL, *p = NULL;
2105 for (e = active_branches; e; e = e->active_next_branch) {
2106 if (e->last_commit < min_commit) {
2107 p = l;
2108 min_commit = e->last_commit;
2110 l = e;
2113 if (p) {
2114 e = p->active_next_branch;
2115 p->active_next_branch = e->active_next_branch;
2116 } else {
2117 e = active_branches;
2118 active_branches = e->active_next_branch;
2120 e->active = 0;
2121 e->active_next_branch = NULL;
2122 if (e->branch_tree.tree) {
2123 release_tree_content_recursive(e->branch_tree.tree);
2124 e->branch_tree.tree = NULL;
2126 cur_active_branches--;
2130 static void load_branch(struct branch *b)
2132 load_tree(&b->branch_tree);
2133 if (!b->active) {
2134 b->active = 1;
2135 b->active_next_branch = active_branches;
2136 active_branches = b;
2137 cur_active_branches++;
2138 branch_load_count++;
2142 static unsigned char convert_num_notes_to_fanout(uintmax_t num_notes)
2144 unsigned char fanout = 0;
2145 while ((num_notes >>= 8))
2146 fanout++;
2147 return fanout;
2150 static void construct_path_with_fanout(const char *hex_sha1,
2151 unsigned char fanout, char *path)
2153 unsigned int i = 0, j = 0;
2154 if (fanout >= 20)
2155 die("Too large fanout (%u)", fanout);
2156 while (fanout) {
2157 path[i++] = hex_sha1[j++];
2158 path[i++] = hex_sha1[j++];
2159 path[i++] = '/';
2160 fanout--;
2162 memcpy(path + i, hex_sha1 + j, 40 - j);
2163 path[i + 40 - j] = '\0';
2166 static uintmax_t do_change_note_fanout(
2167 struct tree_entry *orig_root, struct tree_entry *root,
2168 char *hex_sha1, unsigned int hex_sha1_len,
2169 char *fullpath, unsigned int fullpath_len,
2170 unsigned char fanout)
2172 struct tree_content *t = root->tree;
2173 struct tree_entry *e, leaf;
2174 unsigned int i, tmp_hex_sha1_len, tmp_fullpath_len;
2175 uintmax_t num_notes = 0;
2176 unsigned char sha1[20];
2177 char realpath[60];
2179 for (i = 0; t && i < t->entry_count; i++) {
2180 e = t->entries[i];
2181 tmp_hex_sha1_len = hex_sha1_len + e->name->str_len;
2182 tmp_fullpath_len = fullpath_len;
2185 * We're interested in EITHER existing note entries (entries
2186 * with exactly 40 hex chars in path, not including directory
2187 * separators), OR directory entries that may contain note
2188 * entries (with < 40 hex chars in path).
2189 * Also, each path component in a note entry must be a multiple
2190 * of 2 chars.
2192 if (!e->versions[1].mode ||
2193 tmp_hex_sha1_len > 40 ||
2194 e->name->str_len % 2)
2195 continue;
2197 /* This _may_ be a note entry, or a subdir containing notes */
2198 memcpy(hex_sha1 + hex_sha1_len, e->name->str_dat,
2199 e->name->str_len);
2200 if (tmp_fullpath_len)
2201 fullpath[tmp_fullpath_len++] = '/';
2202 memcpy(fullpath + tmp_fullpath_len, e->name->str_dat,
2203 e->name->str_len);
2204 tmp_fullpath_len += e->name->str_len;
2205 fullpath[tmp_fullpath_len] = '\0';
2207 if (tmp_hex_sha1_len == 40 && !get_sha1_hex(hex_sha1, sha1)) {
2208 /* This is a note entry */
2209 if (fanout == 0xff) {
2210 /* Counting mode, no rename */
2211 num_notes++;
2212 continue;
2214 construct_path_with_fanout(hex_sha1, fanout, realpath);
2215 if (!strcmp(fullpath, realpath)) {
2216 /* Note entry is in correct location */
2217 num_notes++;
2218 continue;
2221 /* Rename fullpath to realpath */
2222 if (!tree_content_remove(orig_root, fullpath, &leaf, 0))
2223 die("Failed to remove path %s", fullpath);
2224 tree_content_set(orig_root, realpath,
2225 leaf.versions[1].sha1,
2226 leaf.versions[1].mode,
2227 leaf.tree);
2228 } else if (S_ISDIR(e->versions[1].mode)) {
2229 /* This is a subdir that may contain note entries */
2230 if (!e->tree)
2231 load_tree(e);
2232 num_notes += do_change_note_fanout(orig_root, e,
2233 hex_sha1, tmp_hex_sha1_len,
2234 fullpath, tmp_fullpath_len, fanout);
2237 /* The above may have reallocated the current tree_content */
2238 t = root->tree;
2240 return num_notes;
2243 static uintmax_t change_note_fanout(struct tree_entry *root,
2244 unsigned char fanout)
2246 char hex_sha1[40], path[60];
2247 return do_change_note_fanout(root, root, hex_sha1, 0, path, 0, fanout);
2251 * Given a pointer into a string, parse a mark reference:
2253 * idnum ::= ':' bigint;
2255 * Return the first character after the value in *endptr.
2257 * Complain if the following character is not what is expected,
2258 * either a space or end of the string.
2260 static uintmax_t parse_mark_ref(const char *p, char **endptr)
2262 uintmax_t mark;
2264 assert(*p == ':');
2265 p++;
2266 mark = strtoumax(p, endptr, 10);
2267 if (*endptr == p)
2268 die("No value after ':' in mark: %s", command_buf.buf);
2269 return mark;
2273 * Parse the mark reference, and complain if this is not the end of
2274 * the string.
2276 static uintmax_t parse_mark_ref_eol(const char *p)
2278 char *end;
2279 uintmax_t mark;
2281 mark = parse_mark_ref(p, &end);
2282 if (*end != '\0')
2283 die("Garbage after mark: %s", command_buf.buf);
2284 return mark;
2288 * Parse the mark reference, demanding a trailing space. Return a
2289 * pointer to the space.
2291 static uintmax_t parse_mark_ref_space(const char **p)
2293 uintmax_t mark;
2294 char *end;
2296 mark = parse_mark_ref(*p, &end);
2297 if (*end++ != ' ')
2298 die("Missing space after mark: %s", command_buf.buf);
2299 *p = end;
2300 return mark;
2303 static void file_change_m(const char *p, struct branch *b)
2305 static struct strbuf uq = STRBUF_INIT;
2306 const char *endp;
2307 struct object_entry *oe;
2308 unsigned char sha1[20];
2309 uint16_t mode, inline_data = 0;
2311 p = get_mode(p, &mode);
2312 if (!p)
2313 die("Corrupt mode: %s", command_buf.buf);
2314 switch (mode) {
2315 case 0644:
2316 case 0755:
2317 mode |= S_IFREG;
2318 case S_IFREG | 0644:
2319 case S_IFREG | 0755:
2320 case S_IFLNK:
2321 case S_IFDIR:
2322 case S_IFGITLINK:
2323 /* ok */
2324 break;
2325 default:
2326 die("Corrupt mode: %s", command_buf.buf);
2329 if (*p == ':') {
2330 oe = find_mark(parse_mark_ref_space(&p));
2331 hashcpy(sha1, oe->idx.sha1);
2332 } else if (skip_prefix(p, "inline ", &p)) {
2333 inline_data = 1;
2334 oe = NULL; /* not used with inline_data, but makes gcc happy */
2335 } else {
2336 if (get_sha1_hex(p, sha1))
2337 die("Invalid dataref: %s", command_buf.buf);
2338 oe = find_object(sha1);
2339 p += 40;
2340 if (*p++ != ' ')
2341 die("Missing space after SHA1: %s", command_buf.buf);
2344 strbuf_reset(&uq);
2345 if (!unquote_c_style(&uq, p, &endp)) {
2346 if (*endp)
2347 die("Garbage after path in: %s", command_buf.buf);
2348 p = uq.buf;
2351 /* Git does not track empty, non-toplevel directories. */
2352 if (S_ISDIR(mode) && !hashcmp(sha1, EMPTY_TREE_SHA1_BIN) && *p) {
2353 tree_content_remove(&b->branch_tree, p, NULL, 0);
2354 return;
2357 if (S_ISGITLINK(mode)) {
2358 if (inline_data)
2359 die("Git links cannot be specified 'inline': %s",
2360 command_buf.buf);
2361 else if (oe) {
2362 if (oe->type != OBJ_COMMIT)
2363 die("Not a commit (actually a %s): %s",
2364 typename(oe->type), command_buf.buf);
2367 * Accept the sha1 without checking; it expected to be in
2368 * another repository.
2370 } else if (inline_data) {
2371 if (S_ISDIR(mode))
2372 die("Directories cannot be specified 'inline': %s",
2373 command_buf.buf);
2374 if (p != uq.buf) {
2375 strbuf_addstr(&uq, p);
2376 p = uq.buf;
2378 read_next_command();
2379 parse_and_store_blob(&last_blob, sha1, 0);
2380 } else {
2381 enum object_type expected = S_ISDIR(mode) ?
2382 OBJ_TREE: OBJ_BLOB;
2383 enum object_type type = oe ? oe->type :
2384 sha1_object_info(sha1, NULL);
2385 if (type < 0)
2386 die("%s not found: %s",
2387 S_ISDIR(mode) ? "Tree" : "Blob",
2388 command_buf.buf);
2389 if (type != expected)
2390 die("Not a %s (actually a %s): %s",
2391 typename(expected), typename(type),
2392 command_buf.buf);
2395 if (!*p) {
2396 tree_content_replace(&b->branch_tree, sha1, mode, NULL);
2397 return;
2399 tree_content_set(&b->branch_tree, p, sha1, mode, NULL);
2402 static void file_change_d(const char *p, struct branch *b)
2404 static struct strbuf uq = STRBUF_INIT;
2405 const char *endp;
2407 strbuf_reset(&uq);
2408 if (!unquote_c_style(&uq, p, &endp)) {
2409 if (*endp)
2410 die("Garbage after path in: %s", command_buf.buf);
2411 p = uq.buf;
2413 tree_content_remove(&b->branch_tree, p, NULL, 1);
2416 static void file_change_cr(const char *s, struct branch *b, int rename)
2418 const char *d;
2419 static struct strbuf s_uq = STRBUF_INIT;
2420 static struct strbuf d_uq = STRBUF_INIT;
2421 const char *endp;
2422 struct tree_entry leaf;
2424 strbuf_reset(&s_uq);
2425 if (!unquote_c_style(&s_uq, s, &endp)) {
2426 if (*endp != ' ')
2427 die("Missing space after source: %s", command_buf.buf);
2428 } else {
2429 endp = strchr(s, ' ');
2430 if (!endp)
2431 die("Missing space after source: %s", command_buf.buf);
2432 strbuf_add(&s_uq, s, endp - s);
2434 s = s_uq.buf;
2436 endp++;
2437 if (!*endp)
2438 die("Missing dest: %s", command_buf.buf);
2440 d = endp;
2441 strbuf_reset(&d_uq);
2442 if (!unquote_c_style(&d_uq, d, &endp)) {
2443 if (*endp)
2444 die("Garbage after dest in: %s", command_buf.buf);
2445 d = d_uq.buf;
2448 memset(&leaf, 0, sizeof(leaf));
2449 if (rename)
2450 tree_content_remove(&b->branch_tree, s, &leaf, 1);
2451 else
2452 tree_content_get(&b->branch_tree, s, &leaf, 1);
2453 if (!leaf.versions[1].mode)
2454 die("Path %s not in branch", s);
2455 if (!*d) { /* C "path/to/subdir" "" */
2456 tree_content_replace(&b->branch_tree,
2457 leaf.versions[1].sha1,
2458 leaf.versions[1].mode,
2459 leaf.tree);
2460 return;
2462 tree_content_set(&b->branch_tree, d,
2463 leaf.versions[1].sha1,
2464 leaf.versions[1].mode,
2465 leaf.tree);
2468 static void note_change_n(const char *p, struct branch *b, unsigned char *old_fanout)
2470 static struct strbuf uq = STRBUF_INIT;
2471 struct object_entry *oe;
2472 struct branch *s;
2473 unsigned char sha1[20], commit_sha1[20];
2474 char path[60];
2475 uint16_t inline_data = 0;
2476 unsigned char new_fanout;
2479 * When loading a branch, we don't traverse its tree to count the real
2480 * number of notes (too expensive to do this for all non-note refs).
2481 * This means that recently loaded notes refs might incorrectly have
2482 * b->num_notes == 0, and consequently, old_fanout might be wrong.
2484 * Fix this by traversing the tree and counting the number of notes
2485 * when b->num_notes == 0. If the notes tree is truly empty, the
2486 * calculation should not take long.
2488 if (b->num_notes == 0 && *old_fanout == 0) {
2489 /* Invoke change_note_fanout() in "counting mode". */
2490 b->num_notes = change_note_fanout(&b->branch_tree, 0xff);
2491 *old_fanout = convert_num_notes_to_fanout(b->num_notes);
2494 /* Now parse the notemodify command. */
2495 /* <dataref> or 'inline' */
2496 if (*p == ':') {
2497 oe = find_mark(parse_mark_ref_space(&p));
2498 hashcpy(sha1, oe->idx.sha1);
2499 } else if (skip_prefix(p, "inline ", &p)) {
2500 inline_data = 1;
2501 oe = NULL; /* not used with inline_data, but makes gcc happy */
2502 } else {
2503 if (get_sha1_hex(p, sha1))
2504 die("Invalid dataref: %s", command_buf.buf);
2505 oe = find_object(sha1);
2506 p += 40;
2507 if (*p++ != ' ')
2508 die("Missing space after SHA1: %s", command_buf.buf);
2511 /* <commit-ish> */
2512 s = lookup_branch(p);
2513 if (s) {
2514 if (is_null_sha1(s->sha1))
2515 die("Can't add a note on empty branch.");
2516 hashcpy(commit_sha1, s->sha1);
2517 } else if (*p == ':') {
2518 uintmax_t commit_mark = parse_mark_ref_eol(p);
2519 struct object_entry *commit_oe = find_mark(commit_mark);
2520 if (commit_oe->type != OBJ_COMMIT)
2521 die("Mark :%" PRIuMAX " not a commit", commit_mark);
2522 hashcpy(commit_sha1, commit_oe->idx.sha1);
2523 } else if (!get_sha1(p, commit_sha1)) {
2524 unsigned long size;
2525 char *buf = read_object_with_reference(commit_sha1,
2526 commit_type, &size, commit_sha1);
2527 if (!buf || size < 46)
2528 die("Not a valid commit: %s", p);
2529 free(buf);
2530 } else
2531 die("Invalid ref name or SHA1 expression: %s", p);
2533 if (inline_data) {
2534 if (p != uq.buf) {
2535 strbuf_addstr(&uq, p);
2536 p = uq.buf;
2538 read_next_command();
2539 parse_and_store_blob(&last_blob, sha1, 0);
2540 } else if (oe) {
2541 if (oe->type != OBJ_BLOB)
2542 die("Not a blob (actually a %s): %s",
2543 typename(oe->type), command_buf.buf);
2544 } else if (!is_null_sha1(sha1)) {
2545 enum object_type type = sha1_object_info(sha1, NULL);
2546 if (type < 0)
2547 die("Blob not found: %s", command_buf.buf);
2548 if (type != OBJ_BLOB)
2549 die("Not a blob (actually a %s): %s",
2550 typename(type), command_buf.buf);
2553 construct_path_with_fanout(sha1_to_hex(commit_sha1), *old_fanout, path);
2554 if (tree_content_remove(&b->branch_tree, path, NULL, 0))
2555 b->num_notes--;
2557 if (is_null_sha1(sha1))
2558 return; /* nothing to insert */
2560 b->num_notes++;
2561 new_fanout = convert_num_notes_to_fanout(b->num_notes);
2562 construct_path_with_fanout(sha1_to_hex(commit_sha1), new_fanout, path);
2563 tree_content_set(&b->branch_tree, path, sha1, S_IFREG | 0644, NULL);
2566 static void file_change_deleteall(struct branch *b)
2568 release_tree_content_recursive(b->branch_tree.tree);
2569 hashclr(b->branch_tree.versions[0].sha1);
2570 hashclr(b->branch_tree.versions[1].sha1);
2571 load_tree(&b->branch_tree);
2572 b->num_notes = 0;
2575 static void parse_from_commit(struct branch *b, char *buf, unsigned long size)
2577 if (!buf || size < 46)
2578 die("Not a valid commit: %s", sha1_to_hex(b->sha1));
2579 if (memcmp("tree ", buf, 5)
2580 || get_sha1_hex(buf + 5, b->branch_tree.versions[1].sha1))
2581 die("The commit %s is corrupt", sha1_to_hex(b->sha1));
2582 hashcpy(b->branch_tree.versions[0].sha1,
2583 b->branch_tree.versions[1].sha1);
2586 static void parse_from_existing(struct branch *b)
2588 if (is_null_sha1(b->sha1)) {
2589 hashclr(b->branch_tree.versions[0].sha1);
2590 hashclr(b->branch_tree.versions[1].sha1);
2591 } else {
2592 unsigned long size;
2593 char *buf;
2595 buf = read_object_with_reference(b->sha1,
2596 commit_type, &size, b->sha1);
2597 parse_from_commit(b, buf, size);
2598 free(buf);
2602 static int parse_from(struct branch *b)
2604 const char *from;
2605 struct branch *s;
2607 if (!skip_prefix(command_buf.buf, "from ", &from))
2608 return 0;
2610 if (b->branch_tree.tree) {
2611 release_tree_content_recursive(b->branch_tree.tree);
2612 b->branch_tree.tree = NULL;
2615 s = lookup_branch(from);
2616 if (b == s)
2617 die("Can't create a branch from itself: %s", b->name);
2618 else if (s) {
2619 unsigned char *t = s->branch_tree.versions[1].sha1;
2620 hashcpy(b->sha1, s->sha1);
2621 hashcpy(b->branch_tree.versions[0].sha1, t);
2622 hashcpy(b->branch_tree.versions[1].sha1, t);
2623 } else if (*from == ':') {
2624 uintmax_t idnum = parse_mark_ref_eol(from);
2625 struct object_entry *oe = find_mark(idnum);
2626 if (oe->type != OBJ_COMMIT)
2627 die("Mark :%" PRIuMAX " not a commit", idnum);
2628 hashcpy(b->sha1, oe->idx.sha1);
2629 if (oe->pack_id != MAX_PACK_ID) {
2630 unsigned long size;
2631 char *buf = gfi_unpack_entry(oe, &size);
2632 parse_from_commit(b, buf, size);
2633 free(buf);
2634 } else
2635 parse_from_existing(b);
2636 } else if (!get_sha1(from, b->sha1)) {
2637 parse_from_existing(b);
2638 if (is_null_sha1(b->sha1))
2639 b->delete = 1;
2641 else
2642 die("Invalid ref name or SHA1 expression: %s", from);
2644 read_next_command();
2645 return 1;
2648 static struct hash_list *parse_merge(unsigned int *count)
2650 struct hash_list *list = NULL, **tail = &list, *n;
2651 const char *from;
2652 struct branch *s;
2654 *count = 0;
2655 while (skip_prefix(command_buf.buf, "merge ", &from)) {
2656 n = xmalloc(sizeof(*n));
2657 s = lookup_branch(from);
2658 if (s)
2659 hashcpy(n->sha1, s->sha1);
2660 else if (*from == ':') {
2661 uintmax_t idnum = parse_mark_ref_eol(from);
2662 struct object_entry *oe = find_mark(idnum);
2663 if (oe->type != OBJ_COMMIT)
2664 die("Mark :%" PRIuMAX " not a commit", idnum);
2665 hashcpy(n->sha1, oe->idx.sha1);
2666 } else if (!get_sha1(from, n->sha1)) {
2667 unsigned long size;
2668 char *buf = read_object_with_reference(n->sha1,
2669 commit_type, &size, n->sha1);
2670 if (!buf || size < 46)
2671 die("Not a valid commit: %s", from);
2672 free(buf);
2673 } else
2674 die("Invalid ref name or SHA1 expression: %s", from);
2676 n->next = NULL;
2677 *tail = n;
2678 tail = &n->next;
2680 (*count)++;
2681 read_next_command();
2683 return list;
2686 static void parse_new_commit(const char *arg)
2688 static struct strbuf msg = STRBUF_INIT;
2689 struct branch *b;
2690 char *author = NULL;
2691 char *committer = NULL;
2692 struct hash_list *merge_list = NULL;
2693 unsigned int merge_count;
2694 unsigned char prev_fanout, new_fanout;
2695 const char *v;
2697 b = lookup_branch(arg);
2698 if (!b)
2699 b = new_branch(arg);
2701 read_next_command();
2702 parse_mark();
2703 if (skip_prefix(command_buf.buf, "author ", &v)) {
2704 author = parse_ident(v);
2705 read_next_command();
2707 if (skip_prefix(command_buf.buf, "committer ", &v)) {
2708 committer = parse_ident(v);
2709 read_next_command();
2711 if (!committer)
2712 die("Expected committer but didn't get one");
2713 parse_data(&msg, 0, NULL);
2714 read_next_command();
2715 parse_from(b);
2716 merge_list = parse_merge(&merge_count);
2718 /* ensure the branch is active/loaded */
2719 if (!b->branch_tree.tree || !max_active_branches) {
2720 unload_one_branch();
2721 load_branch(b);
2724 prev_fanout = convert_num_notes_to_fanout(b->num_notes);
2726 /* file_change* */
2727 while (command_buf.len > 0) {
2728 if (skip_prefix(command_buf.buf, "M ", &v))
2729 file_change_m(v, b);
2730 else if (skip_prefix(command_buf.buf, "D ", &v))
2731 file_change_d(v, b);
2732 else if (skip_prefix(command_buf.buf, "R ", &v))
2733 file_change_cr(v, b, 1);
2734 else if (skip_prefix(command_buf.buf, "C ", &v))
2735 file_change_cr(v, b, 0);
2736 else if (skip_prefix(command_buf.buf, "N ", &v))
2737 note_change_n(v, b, &prev_fanout);
2738 else if (!strcmp("deleteall", command_buf.buf))
2739 file_change_deleteall(b);
2740 else if (skip_prefix(command_buf.buf, "ls ", &v))
2741 parse_ls(v, b);
2742 else {
2743 unread_command_buf = 1;
2744 break;
2746 if (read_next_command() == EOF)
2747 break;
2750 new_fanout = convert_num_notes_to_fanout(b->num_notes);
2751 if (new_fanout != prev_fanout)
2752 b->num_notes = change_note_fanout(&b->branch_tree, new_fanout);
2754 /* build the tree and the commit */
2755 store_tree(&b->branch_tree);
2756 hashcpy(b->branch_tree.versions[0].sha1,
2757 b->branch_tree.versions[1].sha1);
2759 strbuf_reset(&new_data);
2760 strbuf_addf(&new_data, "tree %s\n",
2761 sha1_to_hex(b->branch_tree.versions[1].sha1));
2762 if (!is_null_sha1(b->sha1))
2763 strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(b->sha1));
2764 while (merge_list) {
2765 struct hash_list *next = merge_list->next;
2766 strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(merge_list->sha1));
2767 free(merge_list);
2768 merge_list = next;
2770 strbuf_addf(&new_data,
2771 "author %s\n"
2772 "committer %s\n"
2773 "\n",
2774 author ? author : committer, committer);
2775 strbuf_addbuf(&new_data, &msg);
2776 free(author);
2777 free(committer);
2779 if (!store_object(OBJ_COMMIT, &new_data, NULL, b->sha1, next_mark))
2780 b->pack_id = pack_id;
2781 b->last_commit = object_count_by_type[OBJ_COMMIT];
2784 static void parse_new_tag(const char *arg)
2786 static struct strbuf msg = STRBUF_INIT;
2787 const char *from;
2788 char *tagger;
2789 struct branch *s;
2790 struct tag *t;
2791 uintmax_t from_mark = 0;
2792 unsigned char sha1[20];
2793 enum object_type type;
2794 const char *v;
2796 t = pool_alloc(sizeof(struct tag));
2797 memset(t, 0, sizeof(struct tag));
2798 t->name = pool_strdup(arg);
2799 if (last_tag)
2800 last_tag->next_tag = t;
2801 else
2802 first_tag = t;
2803 last_tag = t;
2804 read_next_command();
2806 /* from ... */
2807 if (!skip_prefix(command_buf.buf, "from ", &from))
2808 die("Expected from command, got %s", command_buf.buf);
2809 s = lookup_branch(from);
2810 if (s) {
2811 if (is_null_sha1(s->sha1))
2812 die("Can't tag an empty branch.");
2813 hashcpy(sha1, s->sha1);
2814 type = OBJ_COMMIT;
2815 } else if (*from == ':') {
2816 struct object_entry *oe;
2817 from_mark = parse_mark_ref_eol(from);
2818 oe = find_mark(from_mark);
2819 type = oe->type;
2820 hashcpy(sha1, oe->idx.sha1);
2821 } else if (!get_sha1(from, sha1)) {
2822 struct object_entry *oe = find_object(sha1);
2823 if (!oe) {
2824 type = sha1_object_info(sha1, NULL);
2825 if (type < 0)
2826 die("Not a valid object: %s", from);
2827 } else
2828 type = oe->type;
2829 } else
2830 die("Invalid ref name or SHA1 expression: %s", from);
2831 read_next_command();
2833 /* tagger ... */
2834 if (skip_prefix(command_buf.buf, "tagger ", &v)) {
2835 tagger = parse_ident(v);
2836 read_next_command();
2837 } else
2838 tagger = NULL;
2840 /* tag payload/message */
2841 parse_data(&msg, 0, NULL);
2843 /* build the tag object */
2844 strbuf_reset(&new_data);
2846 strbuf_addf(&new_data,
2847 "object %s\n"
2848 "type %s\n"
2849 "tag %s\n",
2850 sha1_to_hex(sha1), typename(type), t->name);
2851 if (tagger)
2852 strbuf_addf(&new_data,
2853 "tagger %s\n", tagger);
2854 strbuf_addch(&new_data, '\n');
2855 strbuf_addbuf(&new_data, &msg);
2856 free(tagger);
2858 if (store_object(OBJ_TAG, &new_data, NULL, t->sha1, 0))
2859 t->pack_id = MAX_PACK_ID;
2860 else
2861 t->pack_id = pack_id;
2864 static void parse_reset_branch(const char *arg)
2866 struct branch *b;
2868 b = lookup_branch(arg);
2869 if (b) {
2870 hashclr(b->sha1);
2871 hashclr(b->branch_tree.versions[0].sha1);
2872 hashclr(b->branch_tree.versions[1].sha1);
2873 if (b->branch_tree.tree) {
2874 release_tree_content_recursive(b->branch_tree.tree);
2875 b->branch_tree.tree = NULL;
2878 else
2879 b = new_branch(arg);
2880 read_next_command();
2881 parse_from(b);
2882 if (command_buf.len > 0)
2883 unread_command_buf = 1;
2886 static void cat_blob_write(const char *buf, unsigned long size)
2888 if (write_in_full(cat_blob_fd, buf, size) != size)
2889 die_errno("Write to frontend failed");
2892 static void cat_blob(struct object_entry *oe, unsigned char sha1[20])
2894 struct strbuf line = STRBUF_INIT;
2895 unsigned long size;
2896 enum object_type type = 0;
2897 char *buf;
2899 if (!oe || oe->pack_id == MAX_PACK_ID) {
2900 buf = read_sha1_file(sha1, &type, &size);
2901 } else {
2902 type = oe->type;
2903 buf = gfi_unpack_entry(oe, &size);
2907 * Output based on batch_one_object() from cat-file.c.
2909 if (type <= 0) {
2910 strbuf_reset(&line);
2911 strbuf_addf(&line, "%s missing\n", sha1_to_hex(sha1));
2912 cat_blob_write(line.buf, line.len);
2913 strbuf_release(&line);
2914 free(buf);
2915 return;
2917 if (!buf)
2918 die("Can't read object %s", sha1_to_hex(sha1));
2919 if (type != OBJ_BLOB)
2920 die("Object %s is a %s but a blob was expected.",
2921 sha1_to_hex(sha1), typename(type));
2922 strbuf_reset(&line);
2923 strbuf_addf(&line, "%s %s %lu\n", sha1_to_hex(sha1),
2924 typename(type), size);
2925 cat_blob_write(line.buf, line.len);
2926 strbuf_release(&line);
2927 cat_blob_write(buf, size);
2928 cat_blob_write("\n", 1);
2929 if (oe && oe->pack_id == pack_id) {
2930 last_blob.offset = oe->idx.offset;
2931 strbuf_attach(&last_blob.data, buf, size, size);
2932 last_blob.depth = oe->depth;
2933 } else
2934 free(buf);
2937 static void parse_cat_blob(const char *p)
2939 struct object_entry *oe = oe;
2940 unsigned char sha1[20];
2942 /* cat-blob SP <object> LF */
2943 if (*p == ':') {
2944 oe = find_mark(parse_mark_ref_eol(p));
2945 if (!oe)
2946 die("Unknown mark: %s", command_buf.buf);
2947 hashcpy(sha1, oe->idx.sha1);
2948 } else {
2949 if (get_sha1_hex(p, sha1))
2950 die("Invalid dataref: %s", command_buf.buf);
2951 if (p[40])
2952 die("Garbage after SHA1: %s", command_buf.buf);
2953 oe = find_object(sha1);
2956 cat_blob(oe, sha1);
2959 static struct object_entry *dereference(struct object_entry *oe,
2960 unsigned char sha1[20])
2962 unsigned long size;
2963 char *buf = NULL;
2964 if (!oe) {
2965 enum object_type type = sha1_object_info(sha1, NULL);
2966 if (type < 0)
2967 die("object not found: %s", sha1_to_hex(sha1));
2968 /* cache it! */
2969 oe = insert_object(sha1);
2970 oe->type = type;
2971 oe->pack_id = MAX_PACK_ID;
2972 oe->idx.offset = 1;
2974 switch (oe->type) {
2975 case OBJ_TREE: /* easy case. */
2976 return oe;
2977 case OBJ_COMMIT:
2978 case OBJ_TAG:
2979 break;
2980 default:
2981 die("Not a tree-ish: %s", command_buf.buf);
2984 if (oe->pack_id != MAX_PACK_ID) { /* in a pack being written */
2985 buf = gfi_unpack_entry(oe, &size);
2986 } else {
2987 enum object_type unused;
2988 buf = read_sha1_file(sha1, &unused, &size);
2990 if (!buf)
2991 die("Can't load object %s", sha1_to_hex(sha1));
2993 /* Peel one layer. */
2994 switch (oe->type) {
2995 case OBJ_TAG:
2996 if (size < 40 + strlen("object ") ||
2997 get_sha1_hex(buf + strlen("object "), sha1))
2998 die("Invalid SHA1 in tag: %s", command_buf.buf);
2999 break;
3000 case OBJ_COMMIT:
3001 if (size < 40 + strlen("tree ") ||
3002 get_sha1_hex(buf + strlen("tree "), sha1))
3003 die("Invalid SHA1 in commit: %s", command_buf.buf);
3006 free(buf);
3007 return find_object(sha1);
3010 static struct object_entry *parse_treeish_dataref(const char **p)
3012 unsigned char sha1[20];
3013 struct object_entry *e;
3015 if (**p == ':') { /* <mark> */
3016 e = find_mark(parse_mark_ref_space(p));
3017 if (!e)
3018 die("Unknown mark: %s", command_buf.buf);
3019 hashcpy(sha1, e->idx.sha1);
3020 } else { /* <sha1> */
3021 if (get_sha1_hex(*p, sha1))
3022 die("Invalid dataref: %s", command_buf.buf);
3023 e = find_object(sha1);
3024 *p += 40;
3025 if (*(*p)++ != ' ')
3026 die("Missing space after tree-ish: %s", command_buf.buf);
3029 while (!e || e->type != OBJ_TREE)
3030 e = dereference(e, sha1);
3031 return e;
3034 static void print_ls(int mode, const unsigned char *sha1, const char *path)
3036 static struct strbuf line = STRBUF_INIT;
3038 /* See show_tree(). */
3039 const char *type =
3040 S_ISGITLINK(mode) ? commit_type :
3041 S_ISDIR(mode) ? tree_type :
3042 blob_type;
3044 if (!mode) {
3045 /* missing SP path LF */
3046 strbuf_reset(&line);
3047 strbuf_addstr(&line, "missing ");
3048 quote_c_style(path, &line, NULL, 0);
3049 strbuf_addch(&line, '\n');
3050 } else {
3051 /* mode SP type SP object_name TAB path LF */
3052 strbuf_reset(&line);
3053 strbuf_addf(&line, "%06o %s %s\t",
3054 mode & ~NO_DELTA, type, sha1_to_hex(sha1));
3055 quote_c_style(path, &line, NULL, 0);
3056 strbuf_addch(&line, '\n');
3058 cat_blob_write(line.buf, line.len);
3061 static void parse_ls(const char *p, struct branch *b)
3063 struct tree_entry *root = NULL;
3064 struct tree_entry leaf = {NULL};
3066 /* ls SP (<tree-ish> SP)? <path> */
3067 if (*p == '"') {
3068 if (!b)
3069 die("Not in a commit: %s", command_buf.buf);
3070 root = &b->branch_tree;
3071 } else {
3072 struct object_entry *e = parse_treeish_dataref(&p);
3073 root = new_tree_entry();
3074 hashcpy(root->versions[1].sha1, e->idx.sha1);
3075 if (!is_null_sha1(root->versions[1].sha1))
3076 root->versions[1].mode = S_IFDIR;
3077 load_tree(root);
3079 if (*p == '"') {
3080 static struct strbuf uq = STRBUF_INIT;
3081 const char *endp;
3082 strbuf_reset(&uq);
3083 if (unquote_c_style(&uq, p, &endp))
3084 die("Invalid path: %s", command_buf.buf);
3085 if (*endp)
3086 die("Garbage after path in: %s", command_buf.buf);
3087 p = uq.buf;
3089 tree_content_get(root, p, &leaf, 1);
3091 * A directory in preparation would have a sha1 of zero
3092 * until it is saved. Save, for simplicity.
3094 if (S_ISDIR(leaf.versions[1].mode))
3095 store_tree(&leaf);
3097 print_ls(leaf.versions[1].mode, leaf.versions[1].sha1, p);
3098 if (leaf.tree)
3099 release_tree_content_recursive(leaf.tree);
3100 if (!b || root != &b->branch_tree)
3101 release_tree_entry(root);
3104 static void checkpoint(void)
3106 checkpoint_requested = 0;
3107 if (object_count) {
3108 cycle_packfile();
3109 dump_branches();
3110 dump_tags();
3111 dump_marks();
3115 static void parse_checkpoint(void)
3117 checkpoint_requested = 1;
3118 skip_optional_lf();
3121 static void parse_progress(void)
3123 fwrite(command_buf.buf, 1, command_buf.len, stdout);
3124 fputc('\n', stdout);
3125 fflush(stdout);
3126 skip_optional_lf();
3129 static char* make_fast_import_path(const char *path)
3131 struct strbuf abs_path = STRBUF_INIT;
3133 if (!relative_marks_paths || is_absolute_path(path))
3134 return xstrdup(path);
3135 strbuf_addf(&abs_path, "%s/info/fast-import/%s", get_git_dir(), path);
3136 return strbuf_detach(&abs_path, NULL);
3139 static void option_import_marks(const char *marks,
3140 int from_stream, int ignore_missing)
3142 if (import_marks_file) {
3143 if (from_stream)
3144 die("Only one import-marks command allowed per stream");
3146 /* read previous mark file */
3147 if(!import_marks_file_from_stream)
3148 read_marks();
3151 import_marks_file = make_fast_import_path(marks);
3152 safe_create_leading_directories_const(import_marks_file);
3153 import_marks_file_from_stream = from_stream;
3154 import_marks_file_ignore_missing = ignore_missing;
3157 static void option_date_format(const char *fmt)
3159 if (!strcmp(fmt, "raw"))
3160 whenspec = WHENSPEC_RAW;
3161 else if (!strcmp(fmt, "rfc2822"))
3162 whenspec = WHENSPEC_RFC2822;
3163 else if (!strcmp(fmt, "now"))
3164 whenspec = WHENSPEC_NOW;
3165 else
3166 die("unknown --date-format argument %s", fmt);
3169 static unsigned long ulong_arg(const char *option, const char *arg)
3171 char *endptr;
3172 unsigned long rv = strtoul(arg, &endptr, 0);
3173 if (strchr(arg, '-') || endptr == arg || *endptr)
3174 die("%s: argument must be a non-negative integer", option);
3175 return rv;
3178 static void option_depth(const char *depth)
3180 max_depth = ulong_arg("--depth", depth);
3181 if (max_depth > MAX_DEPTH)
3182 die("--depth cannot exceed %u", MAX_DEPTH);
3185 static void option_active_branches(const char *branches)
3187 max_active_branches = ulong_arg("--active-branches", branches);
3190 static void option_export_marks(const char *marks)
3192 export_marks_file = make_fast_import_path(marks);
3193 safe_create_leading_directories_const(export_marks_file);
3196 static void option_cat_blob_fd(const char *fd)
3198 unsigned long n = ulong_arg("--cat-blob-fd", fd);
3199 if (n > (unsigned long) INT_MAX)
3200 die("--cat-blob-fd cannot exceed %d", INT_MAX);
3201 cat_blob_fd = (int) n;
3204 static void option_export_pack_edges(const char *edges)
3206 if (pack_edges)
3207 fclose(pack_edges);
3208 pack_edges = fopen(edges, "a");
3209 if (!pack_edges)
3210 die_errno("Cannot open '%s'", edges);
3213 static int parse_one_option(const char *option)
3215 if (skip_prefix(option, "max-pack-size=", &option)) {
3216 unsigned long v;
3217 if (!git_parse_ulong(option, &v))
3218 return 0;
3219 if (v < 8192) {
3220 warning("max-pack-size is now in bytes, assuming --max-pack-size=%lum", v);
3221 v *= 1024 * 1024;
3222 } else if (v < 1024 * 1024) {
3223 warning("minimum max-pack-size is 1 MiB");
3224 v = 1024 * 1024;
3226 max_packsize = v;
3227 } else if (skip_prefix(option, "big-file-threshold=", &option)) {
3228 unsigned long v;
3229 if (!git_parse_ulong(option, &v))
3230 return 0;
3231 big_file_threshold = v;
3232 } else if (skip_prefix(option, "depth=", &option)) {
3233 option_depth(option);
3234 } else if (skip_prefix(option, "active-branches=", &option)) {
3235 option_active_branches(option);
3236 } else if (skip_prefix(option, "export-pack-edges=", &option)) {
3237 option_export_pack_edges(option);
3238 } else if (starts_with(option, "quiet")) {
3239 show_stats = 0;
3240 } else if (starts_with(option, "stats")) {
3241 show_stats = 1;
3242 } else {
3243 return 0;
3246 return 1;
3249 static int parse_one_feature(const char *feature, int from_stream)
3251 const char *arg;
3253 if (skip_prefix(feature, "date-format=", &arg)) {
3254 option_date_format(arg);
3255 } else if (skip_prefix(feature, "import-marks=", &arg)) {
3256 option_import_marks(arg, from_stream, 0);
3257 } else if (skip_prefix(feature, "import-marks-if-exists=", &arg)) {
3258 option_import_marks(arg, from_stream, 1);
3259 } else if (skip_prefix(feature, "export-marks=", &arg)) {
3260 option_export_marks(arg);
3261 } else if (!strcmp(feature, "cat-blob")) {
3262 ; /* Don't die - this feature is supported */
3263 } else if (!strcmp(feature, "relative-marks")) {
3264 relative_marks_paths = 1;
3265 } else if (!strcmp(feature, "no-relative-marks")) {
3266 relative_marks_paths = 0;
3267 } else if (!strcmp(feature, "done")) {
3268 require_explicit_termination = 1;
3269 } else if (!strcmp(feature, "force")) {
3270 force_update = 1;
3271 } else if (!strcmp(feature, "notes") || !strcmp(feature, "ls")) {
3272 ; /* do nothing; we have the feature */
3273 } else {
3274 return 0;
3277 return 1;
3280 static void parse_feature(const char *feature)
3282 if (seen_data_command)
3283 die("Got feature command '%s' after data command", feature);
3285 if (parse_one_feature(feature, 1))
3286 return;
3288 die("This version of fast-import does not support feature %s.", feature);
3291 static void parse_option(const char *option)
3293 if (seen_data_command)
3294 die("Got option command '%s' after data command", option);
3296 if (parse_one_option(option))
3297 return;
3299 die("This version of fast-import does not support option: %s", option);
3302 static void git_pack_config(void)
3304 int indexversion_value;
3305 unsigned long packsizelimit_value;
3307 if (!git_config_get_ulong("pack.depth", &max_depth)) {
3308 if (max_depth > MAX_DEPTH)
3309 max_depth = MAX_DEPTH;
3311 if (!git_config_get_int("pack.compression", &pack_compression_level)) {
3312 if (pack_compression_level == -1)
3313 pack_compression_level = Z_DEFAULT_COMPRESSION;
3314 else if (pack_compression_level < 0 ||
3315 pack_compression_level > Z_BEST_COMPRESSION)
3316 git_die_config("pack.compression",
3317 "bad pack compression level %d", pack_compression_level);
3318 pack_compression_seen = 1;
3320 if (!git_config_get_int("pack.indexversion", &indexversion_value)) {
3321 pack_idx_opts.version = indexversion_value;
3322 if (pack_idx_opts.version > 2)
3323 git_die_config("pack.indexversion",
3324 "bad pack.indexversion=%"PRIu32, pack_idx_opts.version);
3326 if (!git_config_get_ulong("pack.packsizelimit", &packsizelimit_value))
3327 max_packsize = packsizelimit_value;
3329 git_config(git_default_config, NULL);
3332 static const char fast_import_usage[] =
3333 "git fast-import [--date-format=<f>] [--max-pack-size=<n>] [--big-file-threshold=<n>] [--depth=<n>] [--active-branches=<n>] [--export-marks=<marks.file>]";
3335 static void parse_argv(void)
3337 unsigned int i;
3339 for (i = 1; i < global_argc; i++) {
3340 const char *a = global_argv[i];
3342 if (*a != '-' || !strcmp(a, "--"))
3343 break;
3345 if (!skip_prefix(a, "--", &a))
3346 die("unknown option %s", a);
3348 if (parse_one_option(a))
3349 continue;
3351 if (parse_one_feature(a, 0))
3352 continue;
3354 if (skip_prefix(a, "cat-blob-fd=", &a)) {
3355 option_cat_blob_fd(a);
3356 continue;
3359 die("unknown option --%s", a);
3361 if (i != global_argc)
3362 usage(fast_import_usage);
3364 seen_data_command = 1;
3365 if (import_marks_file)
3366 read_marks();
3369 int main(int argc, char **argv)
3371 unsigned int i;
3373 git_extract_argv0_path(argv[0]);
3375 git_setup_gettext();
3377 if (argc == 2 && !strcmp(argv[1], "-h"))
3378 usage(fast_import_usage);
3380 setup_git_directory();
3381 reset_pack_idx_option(&pack_idx_opts);
3382 git_pack_config();
3383 if (!pack_compression_seen && core_compression_seen)
3384 pack_compression_level = core_compression_level;
3386 alloc_objects(object_entry_alloc);
3387 strbuf_init(&command_buf, 0);
3388 atom_table = xcalloc(atom_table_sz, sizeof(struct atom_str*));
3389 branch_table = xcalloc(branch_table_sz, sizeof(struct branch*));
3390 avail_tree_table = xcalloc(avail_tree_table_sz, sizeof(struct avail_tree_content*));
3391 marks = pool_calloc(1, sizeof(struct mark_set));
3393 global_argc = argc;
3394 global_argv = argv;
3396 rc_free = pool_alloc(cmd_save * sizeof(*rc_free));
3397 for (i = 0; i < (cmd_save - 1); i++)
3398 rc_free[i].next = &rc_free[i + 1];
3399 rc_free[cmd_save - 1].next = NULL;
3401 prepare_packed_git();
3402 start_packfile();
3403 set_die_routine(die_nicely);
3404 set_checkpoint_signal();
3405 while (read_next_command() != EOF) {
3406 const char *v;
3407 if (!strcmp("blob", command_buf.buf))
3408 parse_new_blob();
3409 else if (skip_prefix(command_buf.buf, "ls ", &v))
3410 parse_ls(v, NULL);
3411 else if (skip_prefix(command_buf.buf, "commit ", &v))
3412 parse_new_commit(v);
3413 else if (skip_prefix(command_buf.buf, "tag ", &v))
3414 parse_new_tag(v);
3415 else if (skip_prefix(command_buf.buf, "reset ", &v))
3416 parse_reset_branch(v);
3417 else if (!strcmp("checkpoint", command_buf.buf))
3418 parse_checkpoint();
3419 else if (!strcmp("done", command_buf.buf))
3420 break;
3421 else if (starts_with(command_buf.buf, "progress "))
3422 parse_progress();
3423 else if (skip_prefix(command_buf.buf, "feature ", &v))
3424 parse_feature(v);
3425 else if (skip_prefix(command_buf.buf, "option git ", &v))
3426 parse_option(v);
3427 else if (starts_with(command_buf.buf, "option "))
3428 /* ignore non-git options*/;
3429 else
3430 die("Unsupported command: %s", command_buf.buf);
3432 if (checkpoint_requested)
3433 checkpoint();
3436 /* argv hasn't been parsed yet, do so */
3437 if (!seen_data_command)
3438 parse_argv();
3440 if (require_explicit_termination && feof(stdin))
3441 die("stream ends early");
3443 end_packfile();
3445 dump_branches();
3446 dump_tags();
3447 unkeep_all_packs();
3448 dump_marks();
3450 if (pack_edges)
3451 fclose(pack_edges);
3453 if (show_stats) {
3454 uintmax_t total_count = 0, duplicate_count = 0;
3455 for (i = 0; i < ARRAY_SIZE(object_count_by_type); i++)
3456 total_count += object_count_by_type[i];
3457 for (i = 0; i < ARRAY_SIZE(duplicate_count_by_type); i++)
3458 duplicate_count += duplicate_count_by_type[i];
3460 fprintf(stderr, "%s statistics:\n", argv[0]);
3461 fprintf(stderr, "---------------------------------------------------------------------\n");
3462 fprintf(stderr, "Alloc'd objects: %10" PRIuMAX "\n", alloc_count);
3463 fprintf(stderr, "Total objects: %10" PRIuMAX " (%10" PRIuMAX " duplicates )\n", total_count, duplicate_count);
3464 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]);
3465 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]);
3466 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]);
3467 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]);
3468 fprintf(stderr, "Total branches: %10lu (%10lu loads )\n", branch_count, branch_load_count);
3469 fprintf(stderr, " marks: %10" PRIuMAX " (%10" PRIuMAX " unique )\n", (((uintmax_t)1) << marks->shift) * 1024, marks_set_count);
3470 fprintf(stderr, " atoms: %10u\n", atom_cnt);
3471 fprintf(stderr, "Memory total: %10" PRIuMAX " KiB\n", (total_allocd + alloc_count*sizeof(struct object_entry))/1024);
3472 fprintf(stderr, " pools: %10lu KiB\n", (unsigned long)(total_allocd/1024));
3473 fprintf(stderr, " objects: %10" PRIuMAX " KiB\n", (alloc_count*sizeof(struct object_entry))/1024);
3474 fprintf(stderr, "---------------------------------------------------------------------\n");
3475 pack_report();
3476 fprintf(stderr, "---------------------------------------------------------------------\n");
3477 fprintf(stderr, "\n");
3480 return failure ? 1 : 0;