2 (See Documentation/git-fast-import.txt for maintained documentation.)
3 Format of STDIN stream:
15 new_blob ::= 'blob' lf
18 file_content ::= data;
20 new_commit ::= 'commit' sp ref_str lf
22 ('author' (sp name)? sp '<' email '>' sp when lf)?
23 'committer' (sp name)? sp '<' email '>' sp when lf
25 ('from' sp commit-ish lf)?
26 ('merge' sp commit-ish lf)*
31 ls ::= 'ls' sp '"' quoted(path) '"' lf;
33 file_change ::= file_clr
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
46 note_obm ::= 'N' sp (hexsha1 | idnum) sp commit-ish lf;
47 note_inm ::= 'N' sp 'inline' sp commit-ish lf
50 new_tag ::= 'tag' sp tag_str lf
51 'from' sp commit-ish lf
52 ('tagger' (sp name)? sp '<' email '>' sp when lf)?
56 reset_branch ::= 'reset' sp ref_str lf
57 ('from' sp commit-ish lf)?
60 checkpoint ::= 'checkpoint' lf
63 progress ::= 'progress' sp not_lf* 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)
76 # note: delim may be any string but must not contain lf.
77 # data_line may contain any data but must not be exactly
79 delimited_data ::= 'data' sp '<<' 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
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
96 commit-ish ::= (ref_str | hexsha1 | sha1exp_str | idnum);
98 sha1exp_str ::= sha1exp;
100 path_str ::= path | '"' quoted(path) '"' ;
101 mode ::= '100644' | '644'
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, get-mark, ls-tree, and cat-blob requests may
138 # appear anywhere in the input, except within a data command. Any
139 # form of the data command always escapes the related input from
140 # comment processing.
142 # In case it is not clear, the '#' that starts the comment
143 # must be the first character on that line (an lf
147 get_mark ::= 'get-mark' sp idnum lf;
148 cat_blob ::= 'cat-blob' sp (hexsha1 | idnum) lf;
149 ls_tree ::= 'ls' sp (hexsha1 | idnum) sp path_str lf;
151 comment ::= '#' not_lf* lf;
152 not_lf ::= # Any byte that is not ASCII newline (LF);
158 #include "lockfile.h"
166 #include "csum-file.h"
169 #include "run-command.h"
171 #define PACK_ID_BITS 16
172 #define MAX_PACK_ID ((1<<PACK_ID_BITS)-1)
173 #define DEPTH_BITS 13
174 #define MAX_DEPTH ((1<<DEPTH_BITS)-1)
177 * We abuse the setuid bit on directories to mean "do not delta".
179 #define NO_DELTA S_ISUID
181 struct object_entry
{
182 struct pack_idx_entry idx
;
183 struct object_entry
*next
;
184 uint32_t type
: TYPE_BITS
,
185 pack_id
: PACK_ID_BITS
,
189 struct object_entry_pool
{
190 struct object_entry_pool
*next_pool
;
191 struct object_entry
*next_free
;
192 struct object_entry
*end
;
193 struct object_entry entries
[FLEX_ARRAY
]; /* more */
198 struct object_entry
*marked
[1024];
199 struct mark_set
*sets
[1024];
208 unsigned no_swap
: 1;
212 struct mem_pool
*next_pool
;
215 uintmax_t space
[FLEX_ARRAY
]; /* more */
219 struct atom_str
*next_atom
;
220 unsigned short str_len
;
221 char str_dat
[FLEX_ARRAY
]; /* more */
226 struct tree_content
*tree
;
227 struct atom_str
*name
;
228 struct tree_entry_ms
{
230 struct object_id oid
;
234 struct tree_content
{
235 unsigned int entry_capacity
; /* must match avail_tree_content */
236 unsigned int entry_count
;
237 unsigned int delta_depth
;
238 struct tree_entry
*entries
[FLEX_ARRAY
]; /* more */
241 struct avail_tree_content
{
242 unsigned int entry_capacity
; /* must match tree_content */
243 struct avail_tree_content
*next_avail
;
247 struct branch
*table_next_branch
;
248 struct branch
*active_next_branch
;
250 struct tree_entry branch_tree
;
251 uintmax_t last_commit
;
255 unsigned pack_id
: PACK_ID_BITS
;
256 struct object_id oid
;
260 struct tag
*next_tag
;
262 unsigned int pack_id
;
263 struct object_id oid
;
267 struct hash_list
*next
;
268 struct object_id oid
;
277 struct recent_command
{
278 struct recent_command
*prev
;
279 struct recent_command
*next
;
283 /* Configured limits on output */
284 static unsigned long max_depth
= 50;
285 static off_t max_packsize
;
286 static int unpack_limit
= 100;
287 static int force_update
;
289 /* Stats and misc. counters */
290 static uintmax_t alloc_count
;
291 static uintmax_t marks_set_count
;
292 static uintmax_t object_count_by_type
[1 << TYPE_BITS
];
293 static uintmax_t duplicate_count_by_type
[1 << TYPE_BITS
];
294 static uintmax_t delta_count_by_type
[1 << TYPE_BITS
];
295 static uintmax_t delta_count_attempts_by_type
[1 << TYPE_BITS
];
296 static unsigned long object_count
;
297 static unsigned long branch_count
;
298 static unsigned long branch_load_count
;
300 static FILE *pack_edges
;
301 static unsigned int show_stats
= 1;
302 static int global_argc
;
303 static const char **global_argv
;
306 static size_t mem_pool_alloc
= 2*1024*1024 - sizeof(struct mem_pool
);
307 static size_t total_allocd
;
308 static struct mem_pool
*mem_pool
;
310 /* Atom management */
311 static unsigned int atom_table_sz
= 4451;
312 static unsigned int atom_cnt
;
313 static struct atom_str
**atom_table
;
315 /* The .pack file being generated */
316 static struct pack_idx_option pack_idx_opts
;
317 static unsigned int pack_id
;
318 static struct sha1file
*pack_file
;
319 static struct packed_git
*pack_data
;
320 static struct packed_git
**all_packs
;
321 static off_t pack_size
;
323 /* Table of objects we've written. */
324 static unsigned int object_entry_alloc
= 5000;
325 static struct object_entry_pool
*blocks
;
326 static struct object_entry
*object_table
[1 << 16];
327 static struct mark_set
*marks
;
328 static const char *export_marks_file
;
329 static const char *import_marks_file
;
330 static int import_marks_file_from_stream
;
331 static int import_marks_file_ignore_missing
;
332 static int import_marks_file_done
;
333 static int relative_marks_paths
;
336 static struct last_object last_blob
= { STRBUF_INIT
, 0, 0, 0 };
338 /* Tree management */
339 static unsigned int tree_entry_alloc
= 1000;
340 static void *avail_tree_entry
;
341 static unsigned int avail_tree_table_sz
= 100;
342 static struct avail_tree_content
**avail_tree_table
;
343 static struct strbuf old_tree
= STRBUF_INIT
;
344 static struct strbuf new_tree
= STRBUF_INIT
;
347 static unsigned long max_active_branches
= 5;
348 static unsigned long cur_active_branches
;
349 static unsigned long branch_table_sz
= 1039;
350 static struct branch
**branch_table
;
351 static struct branch
*active_branches
;
354 static struct tag
*first_tag
;
355 static struct tag
*last_tag
;
357 /* Input stream parsing */
358 static whenspec_type whenspec
= WHENSPEC_RAW
;
359 static struct strbuf command_buf
= STRBUF_INIT
;
360 static int unread_command_buf
;
361 static struct recent_command cmd_hist
= {&cmd_hist
, &cmd_hist
, NULL
};
362 static struct recent_command
*cmd_tail
= &cmd_hist
;
363 static struct recent_command
*rc_free
;
364 static unsigned int cmd_save
= 100;
365 static uintmax_t next_mark
;
366 static struct strbuf new_data
= STRBUF_INIT
;
367 static int seen_data_command
;
368 static int require_explicit_termination
;
370 /* Signal handling */
371 static volatile sig_atomic_t checkpoint_requested
;
373 /* Where to write output of cat-blob commands */
374 static int cat_blob_fd
= STDOUT_FILENO
;
376 static void parse_argv(void);
377 static void parse_get_mark(const char *p
);
378 static void parse_cat_blob(const char *p
);
379 static void parse_ls(const char *p
, struct branch
*b
);
381 static void write_branch_report(FILE *rpt
, struct branch
*b
)
383 fprintf(rpt
, "%s:\n", b
->name
);
385 fprintf(rpt
, " status :");
387 fputs(" active", rpt
);
388 if (b
->branch_tree
.tree
)
389 fputs(" loaded", rpt
);
390 if (is_null_oid(&b
->branch_tree
.versions
[1].oid
))
391 fputs(" dirty", rpt
);
394 fprintf(rpt
, " tip commit : %s\n", oid_to_hex(&b
->oid
));
395 fprintf(rpt
, " old tree : %s\n",
396 oid_to_hex(&b
->branch_tree
.versions
[0].oid
));
397 fprintf(rpt
, " cur tree : %s\n",
398 oid_to_hex(&b
->branch_tree
.versions
[1].oid
));
399 fprintf(rpt
, " commit clock: %" PRIuMAX
"\n", b
->last_commit
);
401 fputs(" last pack : ", rpt
);
402 if (b
->pack_id
< MAX_PACK_ID
)
403 fprintf(rpt
, "%u", b
->pack_id
);
409 static void dump_marks_helper(FILE *, uintmax_t, struct mark_set
*);
411 static void write_crash_report(const char *err
)
413 char *loc
= git_pathdup("fast_import_crash_%"PRIuMAX
, (uintmax_t) getpid());
414 FILE *rpt
= fopen(loc
, "w");
417 struct recent_command
*rc
;
420 error_errno("can't write crash report %s", loc
);
425 fprintf(stderr
, "fast-import: dumping crash report to %s\n", loc
);
427 fprintf(rpt
, "fast-import crash report:\n");
428 fprintf(rpt
, " fast-import process: %"PRIuMAX
"\n", (uintmax_t) getpid());
429 fprintf(rpt
, " parent process : %"PRIuMAX
"\n", (uintmax_t) getppid());
430 fprintf(rpt
, " at %s\n", show_date(time(NULL
), 0, DATE_MODE(ISO8601
)));
433 fputs("fatal: ", rpt
);
438 fputs("Most Recent Commands Before Crash\n", rpt
);
439 fputs("---------------------------------\n", rpt
);
440 for (rc
= cmd_hist
.next
; rc
!= &cmd_hist
; rc
= rc
->next
) {
441 if (rc
->next
== &cmd_hist
)
450 fputs("Active Branch LRU\n", rpt
);
451 fputs("-----------------\n", rpt
);
452 fprintf(rpt
, " active_branches = %lu cur, %lu max\n",
454 max_active_branches
);
456 fputs(" pos clock name\n", rpt
);
457 fputs(" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n", rpt
);
458 for (b
= active_branches
, lu
= 0; b
; b
= b
->active_next_branch
)
459 fprintf(rpt
, " %2lu) %6" PRIuMAX
" %s\n",
460 ++lu
, b
->last_commit
, b
->name
);
463 fputs("Inactive Branches\n", rpt
);
464 fputs("-----------------\n", rpt
);
465 for (lu
= 0; lu
< branch_table_sz
; lu
++) {
466 for (b
= branch_table
[lu
]; b
; b
= b
->table_next_branch
)
467 write_branch_report(rpt
, b
);
473 fputs("Annotated Tags\n", rpt
);
474 fputs("--------------\n", rpt
);
475 for (tg
= first_tag
; tg
; tg
= tg
->next_tag
) {
476 fputs(oid_to_hex(&tg
->oid
), rpt
);
478 fputs(tg
->name
, rpt
);
484 fputs("Marks\n", rpt
);
485 fputs("-----\n", rpt
);
486 if (export_marks_file
)
487 fprintf(rpt
, " exported to %s\n", export_marks_file
);
489 dump_marks_helper(rpt
, 0, marks
);
492 fputs("-------------------\n", rpt
);
493 fputs("END OF CRASH REPORT\n", rpt
);
498 static void end_packfile(void);
499 static void unkeep_all_packs(void);
500 static void dump_marks(void);
502 static NORETURN
void die_nicely(const char *err
, va_list params
)
505 char message
[2 * PATH_MAX
];
507 vsnprintf(message
, sizeof(message
), err
, params
);
508 fputs("fatal: ", stderr
);
509 fputs(message
, stderr
);
514 write_crash_report(message
);
522 #ifndef SIGUSR1 /* Windows, for example */
524 static void set_checkpoint_signal(void)
530 static void checkpoint_signal(int signo
)
532 checkpoint_requested
= 1;
535 static void set_checkpoint_signal(void)
539 memset(&sa
, 0, sizeof(sa
));
540 sa
.sa_handler
= checkpoint_signal
;
541 sigemptyset(&sa
.sa_mask
);
542 sa
.sa_flags
= SA_RESTART
;
543 sigaction(SIGUSR1
, &sa
, NULL
);
548 static void alloc_objects(unsigned int cnt
)
550 struct object_entry_pool
*b
;
552 b
= xmalloc(sizeof(struct object_entry_pool
)
553 + cnt
* sizeof(struct object_entry
));
554 b
->next_pool
= blocks
;
555 b
->next_free
= b
->entries
;
556 b
->end
= b
->entries
+ cnt
;
561 static struct object_entry
*new_object(struct object_id
*oid
)
563 struct object_entry
*e
;
565 if (blocks
->next_free
== blocks
->end
)
566 alloc_objects(object_entry_alloc
);
568 e
= blocks
->next_free
++;
569 oidcpy(&e
->idx
.oid
, oid
);
573 static struct object_entry
*find_object(struct object_id
*oid
)
575 unsigned int h
= oid
->hash
[0] << 8 | oid
->hash
[1];
576 struct object_entry
*e
;
577 for (e
= object_table
[h
]; e
; e
= e
->next
)
578 if (!oidcmp(oid
, &e
->idx
.oid
))
583 static struct object_entry
*insert_object(struct object_id
*oid
)
585 unsigned int h
= oid
->hash
[0] << 8 | oid
->hash
[1];
586 struct object_entry
*e
= object_table
[h
];
589 if (!oidcmp(oid
, &e
->idx
.oid
))
595 e
->next
= object_table
[h
];
601 static void invalidate_pack_id(unsigned int id
)
607 for (h
= 0; h
< ARRAY_SIZE(object_table
); h
++) {
608 struct object_entry
*e
;
610 for (e
= object_table
[h
]; e
; e
= e
->next
)
611 if (e
->pack_id
== id
)
612 e
->pack_id
= MAX_PACK_ID
;
615 for (lu
= 0; lu
< branch_table_sz
; lu
++) {
618 for (b
= branch_table
[lu
]; b
; b
= b
->table_next_branch
)
619 if (b
->pack_id
== id
)
620 b
->pack_id
= MAX_PACK_ID
;
623 for (t
= first_tag
; t
; t
= t
->next_tag
)
624 if (t
->pack_id
== id
)
625 t
->pack_id
= MAX_PACK_ID
;
628 static unsigned int hc_str(const char *s
, size_t len
)
636 static void *pool_alloc(size_t len
)
641 /* round up to a 'uintmax_t' alignment */
642 if (len
& (sizeof(uintmax_t) - 1))
643 len
+= sizeof(uintmax_t) - (len
& (sizeof(uintmax_t) - 1));
645 for (p
= mem_pool
; p
; p
= p
->next_pool
)
646 if ((p
->end
- p
->next_free
>= len
))
650 if (len
>= (mem_pool_alloc
/2)) {
654 total_allocd
+= sizeof(struct mem_pool
) + mem_pool_alloc
;
655 p
= xmalloc(st_add(sizeof(struct mem_pool
), mem_pool_alloc
));
656 p
->next_pool
= mem_pool
;
657 p
->next_free
= (char *) p
->space
;
658 p
->end
= p
->next_free
+ mem_pool_alloc
;
667 static void *pool_calloc(size_t count
, size_t size
)
669 size_t len
= count
* size
;
670 void *r
= pool_alloc(len
);
675 static char *pool_strdup(const char *s
)
677 size_t len
= strlen(s
) + 1;
678 char *r
= pool_alloc(len
);
683 static void insert_mark(uintmax_t idnum
, struct object_entry
*oe
)
685 struct mark_set
*s
= marks
;
686 while ((idnum
>> s
->shift
) >= 1024) {
687 s
= pool_calloc(1, sizeof(struct mark_set
));
688 s
->shift
= marks
->shift
+ 10;
689 s
->data
.sets
[0] = marks
;
693 uintmax_t i
= idnum
>> s
->shift
;
694 idnum
-= i
<< s
->shift
;
695 if (!s
->data
.sets
[i
]) {
696 s
->data
.sets
[i
] = pool_calloc(1, sizeof(struct mark_set
));
697 s
->data
.sets
[i
]->shift
= s
->shift
- 10;
701 if (!s
->data
.marked
[idnum
])
703 s
->data
.marked
[idnum
] = oe
;
706 static struct object_entry
*find_mark(uintmax_t idnum
)
708 uintmax_t orig_idnum
= idnum
;
709 struct mark_set
*s
= marks
;
710 struct object_entry
*oe
= NULL
;
711 if ((idnum
>> s
->shift
) < 1024) {
712 while (s
&& s
->shift
) {
713 uintmax_t i
= idnum
>> s
->shift
;
714 idnum
-= i
<< s
->shift
;
718 oe
= s
->data
.marked
[idnum
];
721 die("mark :%" PRIuMAX
" not declared", orig_idnum
);
725 static struct atom_str
*to_atom(const char *s
, unsigned short len
)
727 unsigned int hc
= hc_str(s
, len
) % atom_table_sz
;
730 for (c
= atom_table
[hc
]; c
; c
= c
->next_atom
)
731 if (c
->str_len
== len
&& !strncmp(s
, c
->str_dat
, len
))
734 c
= pool_alloc(sizeof(struct atom_str
) + len
+ 1);
736 memcpy(c
->str_dat
, s
, len
);
738 c
->next_atom
= atom_table
[hc
];
744 static struct branch
*lookup_branch(const char *name
)
746 unsigned int hc
= hc_str(name
, strlen(name
)) % branch_table_sz
;
749 for (b
= branch_table
[hc
]; b
; b
= b
->table_next_branch
)
750 if (!strcmp(name
, b
->name
))
755 static struct branch
*new_branch(const char *name
)
757 unsigned int hc
= hc_str(name
, strlen(name
)) % branch_table_sz
;
758 struct branch
*b
= lookup_branch(name
);
761 die("Invalid attempt to create duplicate branch: %s", name
);
762 if (check_refname_format(name
, REFNAME_ALLOW_ONELEVEL
))
763 die("Branch name doesn't conform to GIT standards: %s", name
);
765 b
= pool_calloc(1, sizeof(struct branch
));
766 b
->name
= pool_strdup(name
);
767 b
->table_next_branch
= branch_table
[hc
];
768 b
->branch_tree
.versions
[0].mode
= S_IFDIR
;
769 b
->branch_tree
.versions
[1].mode
= S_IFDIR
;
772 b
->pack_id
= MAX_PACK_ID
;
773 branch_table
[hc
] = b
;
778 static unsigned int hc_entries(unsigned int cnt
)
780 cnt
= cnt
& 7 ? (cnt
/ 8) + 1 : cnt
/ 8;
781 return cnt
< avail_tree_table_sz
? cnt
: avail_tree_table_sz
- 1;
784 static struct tree_content
*new_tree_content(unsigned int cnt
)
786 struct avail_tree_content
*f
, *l
= NULL
;
787 struct tree_content
*t
;
788 unsigned int hc
= hc_entries(cnt
);
790 for (f
= avail_tree_table
[hc
]; f
; l
= f
, f
= f
->next_avail
)
791 if (f
->entry_capacity
>= cnt
)
796 l
->next_avail
= f
->next_avail
;
798 avail_tree_table
[hc
] = f
->next_avail
;
800 cnt
= cnt
& 7 ? ((cnt
/ 8) + 1) * 8 : cnt
;
801 f
= pool_alloc(sizeof(*t
) + sizeof(t
->entries
[0]) * cnt
);
802 f
->entry_capacity
= cnt
;
805 t
= (struct tree_content
*)f
;
811 static void release_tree_entry(struct tree_entry
*e
);
812 static void release_tree_content(struct tree_content
*t
)
814 struct avail_tree_content
*f
= (struct avail_tree_content
*)t
;
815 unsigned int hc
= hc_entries(f
->entry_capacity
);
816 f
->next_avail
= avail_tree_table
[hc
];
817 avail_tree_table
[hc
] = f
;
820 static void release_tree_content_recursive(struct tree_content
*t
)
823 for (i
= 0; i
< t
->entry_count
; i
++)
824 release_tree_entry(t
->entries
[i
]);
825 release_tree_content(t
);
828 static struct tree_content
*grow_tree_content(
829 struct tree_content
*t
,
832 struct tree_content
*r
= new_tree_content(t
->entry_count
+ amt
);
833 r
->entry_count
= t
->entry_count
;
834 r
->delta_depth
= t
->delta_depth
;
835 memcpy(r
->entries
,t
->entries
,t
->entry_count
*sizeof(t
->entries
[0]));
836 release_tree_content(t
);
840 static struct tree_entry
*new_tree_entry(void)
842 struct tree_entry
*e
;
844 if (!avail_tree_entry
) {
845 unsigned int n
= tree_entry_alloc
;
846 total_allocd
+= n
* sizeof(struct tree_entry
);
848 avail_tree_entry
= e
;
850 *((void**)e
) = e
+ 1;
856 e
= avail_tree_entry
;
857 avail_tree_entry
= *((void**)e
);
861 static void release_tree_entry(struct tree_entry
*e
)
864 release_tree_content_recursive(e
->tree
);
865 *((void**)e
) = avail_tree_entry
;
866 avail_tree_entry
= e
;
869 static struct tree_content
*dup_tree_content(struct tree_content
*s
)
871 struct tree_content
*d
;
872 struct tree_entry
*a
, *b
;
877 d
= new_tree_content(s
->entry_count
);
878 for (i
= 0; i
< s
->entry_count
; i
++) {
880 b
= new_tree_entry();
881 memcpy(b
, a
, sizeof(*a
));
882 if (a
->tree
&& is_null_oid(&b
->versions
[1].oid
))
883 b
->tree
= dup_tree_content(a
->tree
);
888 d
->entry_count
= s
->entry_count
;
889 d
->delta_depth
= s
->delta_depth
;
894 static void start_packfile(void)
896 struct strbuf tmp_file
= STRBUF_INIT
;
897 struct packed_git
*p
;
898 struct pack_header hdr
;
901 pack_fd
= odb_mkstemp(&tmp_file
, "pack/tmp_pack_XXXXXX");
902 FLEX_ALLOC_STR(p
, pack_name
, tmp_file
.buf
);
903 strbuf_release(&tmp_file
);
905 p
->pack_fd
= pack_fd
;
907 pack_file
= sha1fd(pack_fd
, p
->pack_name
);
909 hdr
.hdr_signature
= htonl(PACK_SIGNATURE
);
910 hdr
.hdr_version
= htonl(2);
912 sha1write(pack_file
, &hdr
, sizeof(hdr
));
915 pack_size
= sizeof(hdr
);
918 REALLOC_ARRAY(all_packs
, pack_id
+ 1);
919 all_packs
[pack_id
] = p
;
922 static const char *create_index(void)
925 struct pack_idx_entry
**idx
, **c
, **last
;
926 struct object_entry
*e
;
927 struct object_entry_pool
*o
;
929 /* Build the table of object IDs. */
930 ALLOC_ARRAY(idx
, object_count
);
932 for (o
= blocks
; o
; o
= o
->next_pool
)
933 for (e
= o
->next_free
; e
-- != o
->entries
;)
934 if (pack_id
== e
->pack_id
)
936 last
= idx
+ object_count
;
938 die("internal consistency error creating the index");
940 tmpfile
= write_idx_file(NULL
, idx
, object_count
, &pack_idx_opts
, pack_data
->sha1
);
945 static char *keep_pack(const char *curr_index_name
)
947 static const char *keep_msg
= "fast-import";
948 struct strbuf name
= STRBUF_INIT
;
951 odb_pack_name(&name
, pack_data
->sha1
, "keep");
952 keep_fd
= odb_pack_keep(name
.buf
);
954 die_errno("cannot create keep file");
955 write_or_die(keep_fd
, keep_msg
, strlen(keep_msg
));
957 die_errno("failed to write keep file");
959 odb_pack_name(&name
, pack_data
->sha1
, "pack");
960 if (finalize_object_file(pack_data
->pack_name
, name
.buf
))
961 die("cannot store pack file");
963 odb_pack_name(&name
, pack_data
->sha1
, "idx");
964 if (finalize_object_file(curr_index_name
, name
.buf
))
965 die("cannot store index file");
966 free((void *)curr_index_name
);
967 return strbuf_detach(&name
, NULL
);
970 static void unkeep_all_packs(void)
972 struct strbuf name
= STRBUF_INIT
;
975 for (k
= 0; k
< pack_id
; k
++) {
976 struct packed_git
*p
= all_packs
[k
];
977 odb_pack_name(&name
, p
->sha1
, "keep");
978 unlink_or_warn(name
.buf
);
980 strbuf_release(&name
);
983 static int loosen_small_pack(const struct packed_git
*p
)
985 struct child_process unpack
= CHILD_PROCESS_INIT
;
987 if (lseek(p
->pack_fd
, 0, SEEK_SET
) < 0)
988 die_errno("Failed seeking to start of '%s'", p
->pack_name
);
990 unpack
.in
= p
->pack_fd
;
992 unpack
.stdout_to_stderr
= 1;
993 argv_array_push(&unpack
.args
, "unpack-objects");
995 argv_array_push(&unpack
.args
, "-q");
997 return run_command(&unpack
);
1000 static void end_packfile(void)
1004 if (running
|| !pack_data
)
1008 clear_delta_base_cache();
1010 struct packed_git
*new_p
;
1011 struct object_id cur_pack_oid
;
1017 close_pack_windows(pack_data
);
1018 sha1close(pack_file
, cur_pack_oid
.hash
, 0);
1019 fixup_pack_header_footer(pack_data
->pack_fd
, pack_data
->sha1
,
1020 pack_data
->pack_name
, object_count
,
1021 cur_pack_oid
.hash
, pack_size
);
1023 if (object_count
<= unpack_limit
) {
1024 if (!loosen_small_pack(pack_data
)) {
1025 invalidate_pack_id(pack_id
);
1030 close(pack_data
->pack_fd
);
1031 idx_name
= keep_pack(create_index());
1033 /* Register the packfile with core git's machinery. */
1034 new_p
= add_packed_git(idx_name
, strlen(idx_name
), 1);
1036 die("core git rejected index %s", idx_name
);
1037 all_packs
[pack_id
] = new_p
;
1038 install_packed_git(new_p
);
1041 /* Print the boundary */
1043 fprintf(pack_edges
, "%s:", new_p
->pack_name
);
1044 for (i
= 0; i
< branch_table_sz
; i
++) {
1045 for (b
= branch_table
[i
]; b
; b
= b
->table_next_branch
) {
1046 if (b
->pack_id
== pack_id
)
1047 fprintf(pack_edges
, " %s",
1048 oid_to_hex(&b
->oid
));
1051 for (t
= first_tag
; t
; t
= t
->next_tag
) {
1052 if (t
->pack_id
== pack_id
)
1053 fprintf(pack_edges
, " %s",
1054 oid_to_hex(&t
->oid
));
1056 fputc('\n', pack_edges
);
1064 close(pack_data
->pack_fd
);
1065 unlink_or_warn(pack_data
->pack_name
);
1071 /* We can't carry a delta across packfiles. */
1072 strbuf_release(&last_blob
.data
);
1073 last_blob
.offset
= 0;
1074 last_blob
.depth
= 0;
1077 static void cycle_packfile(void)
1083 static int store_object(
1084 enum object_type type
,
1086 struct last_object
*last
,
1087 struct object_id
*oidout
,
1091 struct object_entry
*e
;
1092 unsigned char hdr
[96];
1093 struct object_id oid
;
1094 unsigned long hdrlen
, deltalen
;
1098 hdrlen
= xsnprintf((char *)hdr
, sizeof(hdr
), "%s %lu",
1099 typename(type
), (unsigned long)dat
->len
) + 1;
1101 git_SHA1_Update(&c
, hdr
, hdrlen
);
1102 git_SHA1_Update(&c
, dat
->buf
, dat
->len
);
1103 git_SHA1_Final(oid
.hash
, &c
);
1105 oidcpy(oidout
, &oid
);
1107 e
= insert_object(&oid
);
1109 insert_mark(mark
, e
);
1110 if (e
->idx
.offset
) {
1111 duplicate_count_by_type
[type
]++;
1113 } else if (find_sha1_pack(oid
.hash
, packed_git
)) {
1115 e
->pack_id
= MAX_PACK_ID
;
1116 e
->idx
.offset
= 1; /* just not zero! */
1117 duplicate_count_by_type
[type
]++;
1121 if (last
&& last
->data
.buf
&& last
->depth
< max_depth
&& dat
->len
> 20) {
1122 delta_count_attempts_by_type
[type
]++;
1123 delta
= diff_delta(last
->data
.buf
, last
->data
.len
,
1125 &deltalen
, dat
->len
- 20);
1129 git_deflate_init(&s
, pack_compression_level
);
1132 s
.avail_in
= deltalen
;
1134 s
.next_in
= (void *)dat
->buf
;
1135 s
.avail_in
= dat
->len
;
1137 s
.avail_out
= git_deflate_bound(&s
, s
.avail_in
);
1138 s
.next_out
= out
= xmalloc(s
.avail_out
);
1139 while (git_deflate(&s
, Z_FINISH
) == Z_OK
)
1141 git_deflate_end(&s
);
1143 /* Determine if we should auto-checkpoint. */
1144 if ((max_packsize
&& (pack_size
+ 60 + s
.total_out
) > max_packsize
)
1145 || (pack_size
+ 60 + s
.total_out
) < pack_size
) {
1147 /* This new object needs to *not* have the current pack_id. */
1148 e
->pack_id
= pack_id
+ 1;
1151 /* We cannot carry a delta into the new pack. */
1156 git_deflate_init(&s
, pack_compression_level
);
1157 s
.next_in
= (void *)dat
->buf
;
1158 s
.avail_in
= dat
->len
;
1159 s
.avail_out
= git_deflate_bound(&s
, s
.avail_in
);
1160 s
.next_out
= out
= xrealloc(out
, s
.avail_out
);
1161 while (git_deflate(&s
, Z_FINISH
) == Z_OK
)
1163 git_deflate_end(&s
);
1168 e
->pack_id
= pack_id
;
1169 e
->idx
.offset
= pack_size
;
1171 object_count_by_type
[type
]++;
1173 crc32_begin(pack_file
);
1176 off_t ofs
= e
->idx
.offset
- last
->offset
;
1177 unsigned pos
= sizeof(hdr
) - 1;
1179 delta_count_by_type
[type
]++;
1180 e
->depth
= last
->depth
+ 1;
1182 hdrlen
= encode_in_pack_object_header(hdr
, sizeof(hdr
),
1183 OBJ_OFS_DELTA
, deltalen
);
1184 sha1write(pack_file
, hdr
, hdrlen
);
1185 pack_size
+= hdrlen
;
1187 hdr
[pos
] = ofs
& 127;
1189 hdr
[--pos
] = 128 | (--ofs
& 127);
1190 sha1write(pack_file
, hdr
+ pos
, sizeof(hdr
) - pos
);
1191 pack_size
+= sizeof(hdr
) - pos
;
1194 hdrlen
= encode_in_pack_object_header(hdr
, sizeof(hdr
),
1196 sha1write(pack_file
, hdr
, hdrlen
);
1197 pack_size
+= hdrlen
;
1200 sha1write(pack_file
, out
, s
.total_out
);
1201 pack_size
+= s
.total_out
;
1203 e
->idx
.crc32
= crc32_end(pack_file
);
1208 if (last
->no_swap
) {
1211 strbuf_swap(&last
->data
, dat
);
1213 last
->offset
= e
->idx
.offset
;
1214 last
->depth
= e
->depth
;
1219 static void truncate_pack(struct sha1file_checkpoint
*checkpoint
)
1221 if (sha1file_truncate(pack_file
, checkpoint
))
1222 die_errno("cannot truncate pack to skip duplicate");
1223 pack_size
= checkpoint
->offset
;
1226 static void stream_blob(uintmax_t len
, struct object_id
*oidout
, uintmax_t mark
)
1228 size_t in_sz
= 64 * 1024, out_sz
= 64 * 1024;
1229 unsigned char *in_buf
= xmalloc(in_sz
);
1230 unsigned char *out_buf
= xmalloc(out_sz
);
1231 struct object_entry
*e
;
1232 struct object_id oid
;
1233 unsigned long hdrlen
;
1237 struct sha1file_checkpoint checkpoint
;
1240 /* Determine if we should auto-checkpoint. */
1241 if ((max_packsize
&& (pack_size
+ 60 + len
) > max_packsize
)
1242 || (pack_size
+ 60 + len
) < pack_size
)
1245 sha1file_checkpoint(pack_file
, &checkpoint
);
1246 offset
= checkpoint
.offset
;
1248 hdrlen
= xsnprintf((char *)out_buf
, out_sz
, "blob %" PRIuMAX
, len
) + 1;
1251 git_SHA1_Update(&c
, out_buf
, hdrlen
);
1253 crc32_begin(pack_file
);
1255 git_deflate_init(&s
, pack_compression_level
);
1257 hdrlen
= encode_in_pack_object_header(out_buf
, out_sz
, OBJ_BLOB
, len
);
1259 s
.next_out
= out_buf
+ hdrlen
;
1260 s
.avail_out
= out_sz
- hdrlen
;
1262 while (status
!= Z_STREAM_END
) {
1263 if (0 < len
&& !s
.avail_in
) {
1264 size_t cnt
= in_sz
< len
? in_sz
: (size_t)len
;
1265 size_t n
= fread(in_buf
, 1, cnt
, stdin
);
1266 if (!n
&& feof(stdin
))
1267 die("EOF in data (%" PRIuMAX
" bytes remaining)", len
);
1269 git_SHA1_Update(&c
, in_buf
, n
);
1275 status
= git_deflate(&s
, len
? 0 : Z_FINISH
);
1277 if (!s
.avail_out
|| status
== Z_STREAM_END
) {
1278 size_t n
= s
.next_out
- out_buf
;
1279 sha1write(pack_file
, out_buf
, n
);
1281 s
.next_out
= out_buf
;
1282 s
.avail_out
= out_sz
;
1291 die("unexpected deflate failure: %d", status
);
1294 git_deflate_end(&s
);
1295 git_SHA1_Final(oid
.hash
, &c
);
1298 oidcpy(oidout
, &oid
);
1300 e
= insert_object(&oid
);
1303 insert_mark(mark
, e
);
1305 if (e
->idx
.offset
) {
1306 duplicate_count_by_type
[OBJ_BLOB
]++;
1307 truncate_pack(&checkpoint
);
1309 } else if (find_sha1_pack(oid
.hash
, packed_git
)) {
1311 e
->pack_id
= MAX_PACK_ID
;
1312 e
->idx
.offset
= 1; /* just not zero! */
1313 duplicate_count_by_type
[OBJ_BLOB
]++;
1314 truncate_pack(&checkpoint
);
1319 e
->pack_id
= pack_id
;
1320 e
->idx
.offset
= offset
;
1321 e
->idx
.crc32
= crc32_end(pack_file
);
1323 object_count_by_type
[OBJ_BLOB
]++;
1330 /* All calls must be guarded by find_object() or find_mark() to
1331 * ensure the 'struct object_entry' passed was written by this
1332 * process instance. We unpack the entry by the offset, avoiding
1333 * the need for the corresponding .idx file. This unpacking rule
1334 * works because we only use OBJ_REF_DELTA within the packfiles
1335 * created by fast-import.
1337 * oe must not be NULL. Such an oe usually comes from giving
1338 * an unknown SHA-1 to find_object() or an undefined mark to
1339 * find_mark(). Callers must test for this condition and use
1340 * the standard read_sha1_file() when it happens.
1342 * oe->pack_id must not be MAX_PACK_ID. Such an oe is usually from
1343 * find_mark(), where the mark was reloaded from an existing marks
1344 * file and is referencing an object that this fast-import process
1345 * instance did not write out to a packfile. Callers must test for
1346 * this condition and use read_sha1_file() instead.
1348 static void *gfi_unpack_entry(
1349 struct object_entry
*oe
,
1350 unsigned long *sizep
)
1352 enum object_type type
;
1353 struct packed_git
*p
= all_packs
[oe
->pack_id
];
1354 if (p
== pack_data
&& p
->pack_size
< (pack_size
+ 20)) {
1355 /* The object is stored in the packfile we are writing to
1356 * and we have modified it since the last time we scanned
1357 * back to read a previously written object. If an old
1358 * window covered [p->pack_size, p->pack_size + 20) its
1359 * data is stale and is not valid. Closing all windows
1360 * and updating the packfile length ensures we can read
1361 * the newly written data.
1363 close_pack_windows(p
);
1364 sha1flush(pack_file
);
1366 /* We have to offer 20 bytes additional on the end of
1367 * the packfile as the core unpacker code assumes the
1368 * footer is present at the file end and must promise
1369 * at least 20 bytes within any window it maps. But
1370 * we don't actually create the footer here.
1372 p
->pack_size
= pack_size
+ 20;
1374 return unpack_entry(p
, oe
->idx
.offset
, &type
, sizep
);
1377 static const char *get_mode(const char *str
, uint16_t *modep
)
1382 while ((c
= *str
++) != ' ') {
1383 if (c
< '0' || c
> '7')
1385 mode
= (mode
<< 3) + (c
- '0');
1391 static void load_tree(struct tree_entry
*root
)
1393 struct object_id
*oid
= &root
->versions
[1].oid
;
1394 struct object_entry
*myoe
;
1395 struct tree_content
*t
;
1400 root
->tree
= t
= new_tree_content(8);
1401 if (is_null_oid(oid
))
1404 myoe
= find_object(oid
);
1405 if (myoe
&& myoe
->pack_id
!= MAX_PACK_ID
) {
1406 if (myoe
->type
!= OBJ_TREE
)
1407 die("Not a tree: %s", oid_to_hex(oid
));
1408 t
->delta_depth
= myoe
->depth
;
1409 buf
= gfi_unpack_entry(myoe
, &size
);
1411 die("Can't load tree %s", oid_to_hex(oid
));
1413 enum object_type type
;
1414 buf
= read_sha1_file(oid
->hash
, &type
, &size
);
1415 if (!buf
|| type
!= OBJ_TREE
)
1416 die("Can't load tree %s", oid_to_hex(oid
));
1420 while (c
!= (buf
+ size
)) {
1421 struct tree_entry
*e
= new_tree_entry();
1423 if (t
->entry_count
== t
->entry_capacity
)
1424 root
->tree
= t
= grow_tree_content(t
, t
->entry_count
);
1425 t
->entries
[t
->entry_count
++] = e
;
1428 c
= get_mode(c
, &e
->versions
[1].mode
);
1430 die("Corrupt mode in %s", oid_to_hex(oid
));
1431 e
->versions
[0].mode
= e
->versions
[1].mode
;
1432 e
->name
= to_atom(c
, strlen(c
));
1433 c
+= e
->name
->str_len
+ 1;
1434 hashcpy(e
->versions
[0].oid
.hash
, (unsigned char *)c
);
1435 hashcpy(e
->versions
[1].oid
.hash
, (unsigned char *)c
);
1436 c
+= GIT_SHA1_RAWSZ
;
1441 static int tecmp0 (const void *_a
, const void *_b
)
1443 struct tree_entry
*a
= *((struct tree_entry
**)_a
);
1444 struct tree_entry
*b
= *((struct tree_entry
**)_b
);
1445 return base_name_compare(
1446 a
->name
->str_dat
, a
->name
->str_len
, a
->versions
[0].mode
,
1447 b
->name
->str_dat
, b
->name
->str_len
, b
->versions
[0].mode
);
1450 static int tecmp1 (const void *_a
, const void *_b
)
1452 struct tree_entry
*a
= *((struct tree_entry
**)_a
);
1453 struct tree_entry
*b
= *((struct tree_entry
**)_b
);
1454 return base_name_compare(
1455 a
->name
->str_dat
, a
->name
->str_len
, a
->versions
[1].mode
,
1456 b
->name
->str_dat
, b
->name
->str_len
, b
->versions
[1].mode
);
1459 static void mktree(struct tree_content
*t
, int v
, struct strbuf
*b
)
1465 QSORT(t
->entries
, t
->entry_count
, tecmp0
);
1467 QSORT(t
->entries
, t
->entry_count
, tecmp1
);
1469 for (i
= 0; i
< t
->entry_count
; i
++) {
1470 if (t
->entries
[i
]->versions
[v
].mode
)
1471 maxlen
+= t
->entries
[i
]->name
->str_len
+ 34;
1475 strbuf_grow(b
, maxlen
);
1476 for (i
= 0; i
< t
->entry_count
; i
++) {
1477 struct tree_entry
*e
= t
->entries
[i
];
1478 if (!e
->versions
[v
].mode
)
1480 strbuf_addf(b
, "%o %s%c",
1481 (unsigned int)(e
->versions
[v
].mode
& ~NO_DELTA
),
1482 e
->name
->str_dat
, '\0');
1483 strbuf_add(b
, e
->versions
[v
].oid
.hash
, GIT_SHA1_RAWSZ
);
1487 static void store_tree(struct tree_entry
*root
)
1489 struct tree_content
*t
;
1490 unsigned int i
, j
, del
;
1491 struct last_object lo
= { STRBUF_INIT
, 0, 0, /* no_swap */ 1 };
1492 struct object_entry
*le
= NULL
;
1494 if (!is_null_oid(&root
->versions
[1].oid
))
1501 for (i
= 0; i
< t
->entry_count
; i
++) {
1502 if (t
->entries
[i
]->tree
)
1503 store_tree(t
->entries
[i
]);
1506 if (!(root
->versions
[0].mode
& NO_DELTA
))
1507 le
= find_object(&root
->versions
[0].oid
);
1508 if (S_ISDIR(root
->versions
[0].mode
) && le
&& le
->pack_id
== pack_id
) {
1509 mktree(t
, 0, &old_tree
);
1511 lo
.offset
= le
->idx
.offset
;
1512 lo
.depth
= t
->delta_depth
;
1515 mktree(t
, 1, &new_tree
);
1516 store_object(OBJ_TREE
, &new_tree
, &lo
, &root
->versions
[1].oid
, 0);
1518 t
->delta_depth
= lo
.depth
;
1519 for (i
= 0, j
= 0, del
= 0; i
< t
->entry_count
; i
++) {
1520 struct tree_entry
*e
= t
->entries
[i
];
1521 if (e
->versions
[1].mode
) {
1522 e
->versions
[0].mode
= e
->versions
[1].mode
;
1523 oidcpy(&e
->versions
[0].oid
, &e
->versions
[1].oid
);
1524 t
->entries
[j
++] = e
;
1526 release_tree_entry(e
);
1530 t
->entry_count
-= del
;
1533 static void tree_content_replace(
1534 struct tree_entry
*root
,
1535 const struct object_id
*oid
,
1536 const uint16_t mode
,
1537 struct tree_content
*newtree
)
1540 die("Root cannot be a non-directory");
1541 oidclr(&root
->versions
[0].oid
);
1542 oidcpy(&root
->versions
[1].oid
, oid
);
1544 release_tree_content_recursive(root
->tree
);
1545 root
->tree
= newtree
;
1548 static int tree_content_set(
1549 struct tree_entry
*root
,
1551 const struct object_id
*oid
,
1552 const uint16_t mode
,
1553 struct tree_content
*subtree
)
1555 struct tree_content
*t
;
1558 struct tree_entry
*e
;
1560 slash1
= strchrnul(p
, '/');
1563 die("Empty path component found in input");
1564 if (!*slash1
&& !S_ISDIR(mode
) && subtree
)
1565 die("Non-directories cannot have subtrees");
1570 for (i
= 0; i
< t
->entry_count
; i
++) {
1572 if (e
->name
->str_len
== n
&& !fspathncmp(p
, e
->name
->str_dat
, n
)) {
1575 && e
->versions
[1].mode
== mode
1576 && !oidcmp(&e
->versions
[1].oid
, oid
))
1578 e
->versions
[1].mode
= mode
;
1579 oidcpy(&e
->versions
[1].oid
, oid
);
1581 release_tree_content_recursive(e
->tree
);
1585 * We need to leave e->versions[0].sha1 alone
1586 * to avoid modifying the preimage tree used
1587 * when writing out the parent directory.
1588 * But after replacing the subdir with a
1589 * completely different one, it's not a good
1590 * delta base any more, and besides, we've
1591 * thrown away the tree entries needed to
1592 * make a delta against it.
1594 * So let's just explicitly disable deltas
1597 if (S_ISDIR(e
->versions
[0].mode
))
1598 e
->versions
[0].mode
|= NO_DELTA
;
1600 oidclr(&root
->versions
[1].oid
);
1603 if (!S_ISDIR(e
->versions
[1].mode
)) {
1604 e
->tree
= new_tree_content(8);
1605 e
->versions
[1].mode
= S_IFDIR
;
1609 if (tree_content_set(e
, slash1
+ 1, oid
, mode
, subtree
)) {
1610 oidclr(&root
->versions
[1].oid
);
1617 if (t
->entry_count
== t
->entry_capacity
)
1618 root
->tree
= t
= grow_tree_content(t
, t
->entry_count
);
1619 e
= new_tree_entry();
1620 e
->name
= to_atom(p
, n
);
1621 e
->versions
[0].mode
= 0;
1622 oidclr(&e
->versions
[0].oid
);
1623 t
->entries
[t
->entry_count
++] = e
;
1625 e
->tree
= new_tree_content(8);
1626 e
->versions
[1].mode
= S_IFDIR
;
1627 tree_content_set(e
, slash1
+ 1, oid
, mode
, subtree
);
1630 e
->versions
[1].mode
= mode
;
1631 oidcpy(&e
->versions
[1].oid
, oid
);
1633 oidclr(&root
->versions
[1].oid
);
1637 static int tree_content_remove(
1638 struct tree_entry
*root
,
1640 struct tree_entry
*backup_leaf
,
1643 struct tree_content
*t
;
1646 struct tree_entry
*e
;
1648 slash1
= strchrnul(p
, '/');
1654 if (!*p
&& allow_root
) {
1660 for (i
= 0; i
< t
->entry_count
; i
++) {
1662 if (e
->name
->str_len
== n
&& !fspathncmp(p
, e
->name
->str_dat
, n
)) {
1663 if (*slash1
&& !S_ISDIR(e
->versions
[1].mode
))
1665 * If p names a file in some subdirectory, and a
1666 * file or symlink matching the name of the
1667 * parent directory of p exists, then p cannot
1668 * exist and need not be deleted.
1671 if (!*slash1
|| !S_ISDIR(e
->versions
[1].mode
))
1675 if (tree_content_remove(e
, slash1
+ 1, backup_leaf
, 0)) {
1676 for (n
= 0; n
< e
->tree
->entry_count
; n
++) {
1677 if (e
->tree
->entries
[n
]->versions
[1].mode
) {
1678 oidclr(&root
->versions
[1].oid
);
1692 memcpy(backup_leaf
, e
, sizeof(*backup_leaf
));
1694 release_tree_content_recursive(e
->tree
);
1696 e
->versions
[1].mode
= 0;
1697 oidclr(&e
->versions
[1].oid
);
1698 oidclr(&root
->versions
[1].oid
);
1702 static int tree_content_get(
1703 struct tree_entry
*root
,
1705 struct tree_entry
*leaf
,
1708 struct tree_content
*t
;
1711 struct tree_entry
*e
;
1713 slash1
= strchrnul(p
, '/');
1715 if (!n
&& !allow_root
)
1716 die("Empty path component found in input");
1727 for (i
= 0; i
< t
->entry_count
; i
++) {
1729 if (e
->name
->str_len
== n
&& !fspathncmp(p
, e
->name
->str_dat
, n
)) {
1732 if (!S_ISDIR(e
->versions
[1].mode
))
1736 return tree_content_get(e
, slash1
+ 1, leaf
, 0);
1742 memcpy(leaf
, e
, sizeof(*leaf
));
1743 if (e
->tree
&& is_null_oid(&e
->versions
[1].oid
))
1744 leaf
->tree
= dup_tree_content(e
->tree
);
1750 static int update_branch(struct branch
*b
)
1752 static const char *msg
= "fast-import";
1753 struct ref_transaction
*transaction
;
1754 struct object_id old_oid
;
1755 struct strbuf err
= STRBUF_INIT
;
1757 if (is_null_oid(&b
->oid
)) {
1759 delete_ref(NULL
, b
->name
, NULL
, 0);
1762 if (read_ref(b
->name
, old_oid
.hash
))
1764 if (!force_update
&& !is_null_oid(&old_oid
)) {
1765 struct commit
*old_cmit
, *new_cmit
;
1767 old_cmit
= lookup_commit_reference_gently(&old_oid
, 0);
1768 new_cmit
= lookup_commit_reference_gently(&b
->oid
, 0);
1769 if (!old_cmit
|| !new_cmit
)
1770 return error("Branch %s is missing commits.", b
->name
);
1772 if (!in_merge_bases(old_cmit
, new_cmit
)) {
1773 warning("Not updating %s"
1774 " (new tip %s does not contain %s)",
1775 b
->name
, oid_to_hex(&b
->oid
),
1776 oid_to_hex(&old_oid
));
1780 transaction
= ref_transaction_begin(&err
);
1782 ref_transaction_update(transaction
, b
->name
, b
->oid
.hash
, old_oid
.hash
,
1784 ref_transaction_commit(transaction
, &err
)) {
1785 ref_transaction_free(transaction
);
1786 error("%s", err
.buf
);
1787 strbuf_release(&err
);
1790 ref_transaction_free(transaction
);
1791 strbuf_release(&err
);
1795 static void dump_branches(void)
1800 for (i
= 0; i
< branch_table_sz
; i
++) {
1801 for (b
= branch_table
[i
]; b
; b
= b
->table_next_branch
)
1802 failure
|= update_branch(b
);
1806 static void dump_tags(void)
1808 static const char *msg
= "fast-import";
1810 struct strbuf ref_name
= STRBUF_INIT
;
1811 struct strbuf err
= STRBUF_INIT
;
1812 struct ref_transaction
*transaction
;
1814 transaction
= ref_transaction_begin(&err
);
1816 failure
|= error("%s", err
.buf
);
1819 for (t
= first_tag
; t
; t
= t
->next_tag
) {
1820 strbuf_reset(&ref_name
);
1821 strbuf_addf(&ref_name
, "refs/tags/%s", t
->name
);
1823 if (ref_transaction_update(transaction
, ref_name
.buf
,
1824 t
->oid
.hash
, NULL
, 0, msg
, &err
)) {
1825 failure
|= error("%s", err
.buf
);
1829 if (ref_transaction_commit(transaction
, &err
))
1830 failure
|= error("%s", err
.buf
);
1833 ref_transaction_free(transaction
);
1834 strbuf_release(&ref_name
);
1835 strbuf_release(&err
);
1838 static void dump_marks_helper(FILE *f
,
1844 for (k
= 0; k
< 1024; k
++) {
1845 if (m
->data
.sets
[k
])
1846 dump_marks_helper(f
, base
+ (k
<< m
->shift
),
1850 for (k
= 0; k
< 1024; k
++) {
1851 if (m
->data
.marked
[k
])
1852 fprintf(f
, ":%" PRIuMAX
" %s\n", base
+ k
,
1853 oid_to_hex(&m
->data
.marked
[k
]->idx
.oid
));
1858 static void dump_marks(void)
1860 static struct lock_file mark_lock
;
1863 if (!export_marks_file
|| (import_marks_file
&& !import_marks_file_done
))
1866 if (hold_lock_file_for_update(&mark_lock
, export_marks_file
, 0) < 0) {
1867 failure
|= error_errno("Unable to write marks file %s",
1872 f
= fdopen_lock_file(&mark_lock
, "w");
1874 int saved_errno
= errno
;
1875 rollback_lock_file(&mark_lock
);
1876 failure
|= error("Unable to write marks file %s: %s",
1877 export_marks_file
, strerror(saved_errno
));
1881 dump_marks_helper(f
, 0, marks
);
1882 if (commit_lock_file(&mark_lock
)) {
1883 failure
|= error_errno("Unable to write file %s",
1889 static void read_marks(void)
1892 FILE *f
= fopen(import_marks_file
, "r");
1895 else if (import_marks_file_ignore_missing
&& errno
== ENOENT
)
1896 goto done
; /* Marks file does not exist */
1898 die_errno("cannot read '%s'", import_marks_file
);
1899 while (fgets(line
, sizeof(line
), f
)) {
1902 struct object_id oid
;
1903 struct object_entry
*e
;
1905 end
= strchr(line
, '\n');
1906 if (line
[0] != ':' || !end
)
1907 die("corrupt mark line: %s", line
);
1909 mark
= strtoumax(line
+ 1, &end
, 10);
1910 if (!mark
|| end
== line
+ 1
1911 || *end
!= ' ' || get_oid_hex(end
+ 1, &oid
))
1912 die("corrupt mark line: %s", line
);
1913 e
= find_object(&oid
);
1915 enum object_type type
= sha1_object_info(oid
.hash
, NULL
);
1917 die("object not found: %s", oid_to_hex(&oid
));
1918 e
= insert_object(&oid
);
1920 e
->pack_id
= MAX_PACK_ID
;
1921 e
->idx
.offset
= 1; /* just not zero! */
1923 insert_mark(mark
, e
);
1927 import_marks_file_done
= 1;
1931 static int read_next_command(void)
1933 static int stdin_eof
= 0;
1936 unread_command_buf
= 0;
1943 if (unread_command_buf
) {
1944 unread_command_buf
= 0;
1946 struct recent_command
*rc
;
1948 strbuf_detach(&command_buf
, NULL
);
1949 stdin_eof
= strbuf_getline_lf(&command_buf
, stdin
);
1953 if (!seen_data_command
1954 && !starts_with(command_buf
.buf
, "feature ")
1955 && !starts_with(command_buf
.buf
, "option ")) {
1964 cmd_hist
.next
= rc
->next
;
1965 cmd_hist
.next
->prev
= &cmd_hist
;
1969 rc
->buf
= command_buf
.buf
;
1970 rc
->prev
= cmd_tail
;
1971 rc
->next
= cmd_hist
.prev
;
1972 rc
->prev
->next
= rc
;
1975 if (skip_prefix(command_buf
.buf
, "get-mark ", &p
)) {
1979 if (skip_prefix(command_buf
.buf
, "cat-blob ", &p
)) {
1983 if (command_buf
.buf
[0] == '#')
1989 static void skip_optional_lf(void)
1991 int term_char
= fgetc(stdin
);
1992 if (term_char
!= '\n' && term_char
!= EOF
)
1993 ungetc(term_char
, stdin
);
1996 static void parse_mark(void)
1999 if (skip_prefix(command_buf
.buf
, "mark :", &v
)) {
2000 next_mark
= strtoumax(v
, NULL
, 10);
2001 read_next_command();
2007 static int parse_data(struct strbuf
*sb
, uintmax_t limit
, uintmax_t *len_res
)
2012 if (!skip_prefix(command_buf
.buf
, "data ", &data
))
2013 die("Expected 'data n' command, found: %s", command_buf
.buf
);
2015 if (skip_prefix(data
, "<<", &data
)) {
2016 char *term
= xstrdup(data
);
2017 size_t term_len
= command_buf
.len
- (data
- command_buf
.buf
);
2019 strbuf_detach(&command_buf
, NULL
);
2021 if (strbuf_getline_lf(&command_buf
, stdin
) == EOF
)
2022 die("EOF in data (terminator '%s' not found)", term
);
2023 if (term_len
== command_buf
.len
2024 && !strcmp(term
, command_buf
.buf
))
2026 strbuf_addbuf(sb
, &command_buf
);
2027 strbuf_addch(sb
, '\n');
2032 uintmax_t len
= strtoumax(data
, NULL
, 10);
2033 size_t n
= 0, length
= (size_t)len
;
2035 if (limit
&& limit
< len
) {
2040 die("data is too large to use in this context");
2042 while (n
< length
) {
2043 size_t s
= strbuf_fread(sb
, length
- n
, stdin
);
2044 if (!s
&& feof(stdin
))
2045 die("EOF in data (%lu bytes remaining)",
2046 (unsigned long)(length
- n
));
2055 static int validate_raw_date(const char *src
, struct strbuf
*result
)
2057 const char *orig_src
= src
;
2063 num
= strtoul(src
, &endp
, 10);
2064 /* NEEDSWORK: perhaps check for reasonable values? */
2065 if (errno
|| endp
== src
|| *endp
!= ' ')
2069 if (*src
!= '-' && *src
!= '+')
2072 num
= strtoul(src
+ 1, &endp
, 10);
2073 if (errno
|| endp
== src
+ 1 || *endp
|| 1400 < num
)
2076 strbuf_addstr(result
, orig_src
);
2080 static char *parse_ident(const char *buf
)
2084 struct strbuf ident
= STRBUF_INIT
;
2086 /* ensure there is a space delimiter even if there is no name */
2090 ltgt
= buf
+ strcspn(buf
, "<>");
2092 die("Missing < in ident string: %s", buf
);
2093 if (ltgt
!= buf
&& ltgt
[-1] != ' ')
2094 die("Missing space before < in ident string: %s", buf
);
2095 ltgt
= ltgt
+ 1 + strcspn(ltgt
+ 1, "<>");
2097 die("Missing > in ident string: %s", buf
);
2100 die("Missing space after > in ident string: %s", buf
);
2102 name_len
= ltgt
- buf
;
2103 strbuf_add(&ident
, buf
, name_len
);
2107 if (validate_raw_date(ltgt
, &ident
) < 0)
2108 die("Invalid raw date \"%s\" in ident: %s", ltgt
, buf
);
2110 case WHENSPEC_RFC2822
:
2111 if (parse_date(ltgt
, &ident
) < 0)
2112 die("Invalid rfc2822 date \"%s\" in ident: %s", ltgt
, buf
);
2115 if (strcmp("now", ltgt
))
2116 die("Date in ident must be 'now': %s", buf
);
2121 return strbuf_detach(&ident
, NULL
);
2124 static void parse_and_store_blob(
2125 struct last_object
*last
,
2126 struct object_id
*oidout
,
2129 static struct strbuf buf
= STRBUF_INIT
;
2132 if (parse_data(&buf
, big_file_threshold
, &len
))
2133 store_object(OBJ_BLOB
, &buf
, last
, oidout
, mark
);
2136 strbuf_release(&last
->data
);
2140 stream_blob(len
, oidout
, mark
);
2145 static void parse_new_blob(void)
2147 read_next_command();
2149 parse_and_store_blob(&last_blob
, NULL
, next_mark
);
2152 static void unload_one_branch(void)
2154 while (cur_active_branches
2155 && cur_active_branches
>= max_active_branches
) {
2156 uintmax_t min_commit
= ULONG_MAX
;
2157 struct branch
*e
, *l
= NULL
, *p
= NULL
;
2159 for (e
= active_branches
; e
; e
= e
->active_next_branch
) {
2160 if (e
->last_commit
< min_commit
) {
2162 min_commit
= e
->last_commit
;
2168 e
= p
->active_next_branch
;
2169 p
->active_next_branch
= e
->active_next_branch
;
2171 e
= active_branches
;
2172 active_branches
= e
->active_next_branch
;
2175 e
->active_next_branch
= NULL
;
2176 if (e
->branch_tree
.tree
) {
2177 release_tree_content_recursive(e
->branch_tree
.tree
);
2178 e
->branch_tree
.tree
= NULL
;
2180 cur_active_branches
--;
2184 static void load_branch(struct branch
*b
)
2186 load_tree(&b
->branch_tree
);
2189 b
->active_next_branch
= active_branches
;
2190 active_branches
= b
;
2191 cur_active_branches
++;
2192 branch_load_count
++;
2196 static unsigned char convert_num_notes_to_fanout(uintmax_t num_notes
)
2198 unsigned char fanout
= 0;
2199 while ((num_notes
>>= 8))
2204 static void construct_path_with_fanout(const char *hex_sha1
,
2205 unsigned char fanout
, char *path
)
2207 unsigned int i
= 0, j
= 0;
2209 die("Too large fanout (%u)", fanout
);
2211 path
[i
++] = hex_sha1
[j
++];
2212 path
[i
++] = hex_sha1
[j
++];
2216 memcpy(path
+ i
, hex_sha1
+ j
, GIT_SHA1_HEXSZ
- j
);
2217 path
[i
+ GIT_SHA1_HEXSZ
- j
] = '\0';
2220 static uintmax_t do_change_note_fanout(
2221 struct tree_entry
*orig_root
, struct tree_entry
*root
,
2222 char *hex_oid
, unsigned int hex_oid_len
,
2223 char *fullpath
, unsigned int fullpath_len
,
2224 unsigned char fanout
)
2226 struct tree_content
*t
;
2227 struct tree_entry
*e
, leaf
;
2228 unsigned int i
, tmp_hex_oid_len
, tmp_fullpath_len
;
2229 uintmax_t num_notes
= 0;
2230 struct object_id oid
;
2237 for (i
= 0; t
&& i
< t
->entry_count
; i
++) {
2239 tmp_hex_oid_len
= hex_oid_len
+ e
->name
->str_len
;
2240 tmp_fullpath_len
= fullpath_len
;
2243 * We're interested in EITHER existing note entries (entries
2244 * with exactly 40 hex chars in path, not including directory
2245 * separators), OR directory entries that may contain note
2246 * entries (with < 40 hex chars in path).
2247 * Also, each path component in a note entry must be a multiple
2250 if (!e
->versions
[1].mode
||
2251 tmp_hex_oid_len
> GIT_SHA1_HEXSZ
||
2252 e
->name
->str_len
% 2)
2255 /* This _may_ be a note entry, or a subdir containing notes */
2256 memcpy(hex_oid
+ hex_oid_len
, e
->name
->str_dat
,
2258 if (tmp_fullpath_len
)
2259 fullpath
[tmp_fullpath_len
++] = '/';
2260 memcpy(fullpath
+ tmp_fullpath_len
, e
->name
->str_dat
,
2262 tmp_fullpath_len
+= e
->name
->str_len
;
2263 fullpath
[tmp_fullpath_len
] = '\0';
2265 if (tmp_hex_oid_len
== GIT_SHA1_HEXSZ
&& !get_oid_hex(hex_oid
, &oid
)) {
2266 /* This is a note entry */
2267 if (fanout
== 0xff) {
2268 /* Counting mode, no rename */
2272 construct_path_with_fanout(hex_oid
, fanout
, realpath
);
2273 if (!strcmp(fullpath
, realpath
)) {
2274 /* Note entry is in correct location */
2279 /* Rename fullpath to realpath */
2280 if (!tree_content_remove(orig_root
, fullpath
, &leaf
, 0))
2281 die("Failed to remove path %s", fullpath
);
2282 tree_content_set(orig_root
, realpath
,
2283 &leaf
.versions
[1].oid
,
2284 leaf
.versions
[1].mode
,
2286 } else if (S_ISDIR(e
->versions
[1].mode
)) {
2287 /* This is a subdir that may contain note entries */
2288 num_notes
+= do_change_note_fanout(orig_root
, e
,
2289 hex_oid
, tmp_hex_oid_len
,
2290 fullpath
, tmp_fullpath_len
, fanout
);
2293 /* The above may have reallocated the current tree_content */
2299 static uintmax_t change_note_fanout(struct tree_entry
*root
,
2300 unsigned char fanout
)
2303 * The size of path is due to one slash between every two hex digits,
2304 * plus the terminating NUL. Note that there is no slash at the end, so
2305 * the number of slashes is one less than half the number of hex
2308 char hex_oid
[GIT_MAX_HEXSZ
], path
[GIT_MAX_HEXSZ
+ (GIT_MAX_HEXSZ
/ 2) - 1 + 1];
2309 return do_change_note_fanout(root
, root
, hex_oid
, 0, path
, 0, fanout
);
2313 * Given a pointer into a string, parse a mark reference:
2315 * idnum ::= ':' bigint;
2317 * Return the first character after the value in *endptr.
2319 * Complain if the following character is not what is expected,
2320 * either a space or end of the string.
2322 static uintmax_t parse_mark_ref(const char *p
, char **endptr
)
2328 mark
= strtoumax(p
, endptr
, 10);
2330 die("No value after ':' in mark: %s", command_buf
.buf
);
2335 * Parse the mark reference, and complain if this is not the end of
2338 static uintmax_t parse_mark_ref_eol(const char *p
)
2343 mark
= parse_mark_ref(p
, &end
);
2345 die("Garbage after mark: %s", command_buf
.buf
);
2350 * Parse the mark reference, demanding a trailing space. Return a
2351 * pointer to the space.
2353 static uintmax_t parse_mark_ref_space(const char **p
)
2358 mark
= parse_mark_ref(*p
, &end
);
2360 die("Missing space after mark: %s", command_buf
.buf
);
2365 static void file_change_m(const char *p
, struct branch
*b
)
2367 static struct strbuf uq
= STRBUF_INIT
;
2369 struct object_entry
*oe
;
2370 struct object_id oid
;
2371 uint16_t mode
, inline_data
= 0;
2373 p
= get_mode(p
, &mode
);
2375 die("Corrupt mode: %s", command_buf
.buf
);
2380 case S_IFREG
| 0644:
2381 case S_IFREG
| 0755:
2388 die("Corrupt mode: %s", command_buf
.buf
);
2392 oe
= find_mark(parse_mark_ref_space(&p
));
2393 oidcpy(&oid
, &oe
->idx
.oid
);
2394 } else if (skip_prefix(p
, "inline ", &p
)) {
2396 oe
= NULL
; /* not used with inline_data, but makes gcc happy */
2398 if (parse_oid_hex(p
, &oid
, &p
))
2399 die("Invalid dataref: %s", command_buf
.buf
);
2400 oe
= find_object(&oid
);
2402 die("Missing space after SHA1: %s", command_buf
.buf
);
2406 if (!unquote_c_style(&uq
, p
, &endp
)) {
2408 die("Garbage after path in: %s", command_buf
.buf
);
2412 /* Git does not track empty, non-toplevel directories. */
2413 if (S_ISDIR(mode
) && is_empty_tree_oid(&oid
) && *p
) {
2414 tree_content_remove(&b
->branch_tree
, p
, NULL
, 0);
2418 if (S_ISGITLINK(mode
)) {
2420 die("Git links cannot be specified 'inline': %s",
2423 if (oe
->type
!= OBJ_COMMIT
)
2424 die("Not a commit (actually a %s): %s",
2425 typename(oe
->type
), command_buf
.buf
);
2428 * Accept the sha1 without checking; it expected to be in
2429 * another repository.
2431 } else if (inline_data
) {
2433 die("Directories cannot be specified 'inline': %s",
2436 strbuf_addstr(&uq
, p
);
2439 read_next_command();
2440 parse_and_store_blob(&last_blob
, &oid
, 0);
2442 enum object_type expected
= S_ISDIR(mode
) ?
2444 enum object_type type
= oe
? oe
->type
:
2445 sha1_object_info(oid
.hash
, NULL
);
2447 die("%s not found: %s",
2448 S_ISDIR(mode
) ? "Tree" : "Blob",
2450 if (type
!= expected
)
2451 die("Not a %s (actually a %s): %s",
2452 typename(expected
), typename(type
),
2457 tree_content_replace(&b
->branch_tree
, &oid
, mode
, NULL
);
2460 tree_content_set(&b
->branch_tree
, p
, &oid
, mode
, NULL
);
2463 static void file_change_d(const char *p
, struct branch
*b
)
2465 static struct strbuf uq
= STRBUF_INIT
;
2469 if (!unquote_c_style(&uq
, p
, &endp
)) {
2471 die("Garbage after path in: %s", command_buf
.buf
);
2474 tree_content_remove(&b
->branch_tree
, p
, NULL
, 1);
2477 static void file_change_cr(const char *s
, struct branch
*b
, int rename
)
2480 static struct strbuf s_uq
= STRBUF_INIT
;
2481 static struct strbuf d_uq
= STRBUF_INIT
;
2483 struct tree_entry leaf
;
2485 strbuf_reset(&s_uq
);
2486 if (!unquote_c_style(&s_uq
, s
, &endp
)) {
2488 die("Missing space after source: %s", command_buf
.buf
);
2490 endp
= strchr(s
, ' ');
2492 die("Missing space after source: %s", command_buf
.buf
);
2493 strbuf_add(&s_uq
, s
, endp
- s
);
2499 die("Missing dest: %s", command_buf
.buf
);
2502 strbuf_reset(&d_uq
);
2503 if (!unquote_c_style(&d_uq
, d
, &endp
)) {
2505 die("Garbage after dest in: %s", command_buf
.buf
);
2509 memset(&leaf
, 0, sizeof(leaf
));
2511 tree_content_remove(&b
->branch_tree
, s
, &leaf
, 1);
2513 tree_content_get(&b
->branch_tree
, s
, &leaf
, 1);
2514 if (!leaf
.versions
[1].mode
)
2515 die("Path %s not in branch", s
);
2516 if (!*d
) { /* C "path/to/subdir" "" */
2517 tree_content_replace(&b
->branch_tree
,
2518 &leaf
.versions
[1].oid
,
2519 leaf
.versions
[1].mode
,
2523 tree_content_set(&b
->branch_tree
, d
,
2524 &leaf
.versions
[1].oid
,
2525 leaf
.versions
[1].mode
,
2529 static void note_change_n(const char *p
, struct branch
*b
, unsigned char *old_fanout
)
2531 static struct strbuf uq
= STRBUF_INIT
;
2532 struct object_entry
*oe
;
2534 struct object_id oid
, commit_oid
;
2536 uint16_t inline_data
= 0;
2537 unsigned char new_fanout
;
2540 * When loading a branch, we don't traverse its tree to count the real
2541 * number of notes (too expensive to do this for all non-note refs).
2542 * This means that recently loaded notes refs might incorrectly have
2543 * b->num_notes == 0, and consequently, old_fanout might be wrong.
2545 * Fix this by traversing the tree and counting the number of notes
2546 * when b->num_notes == 0. If the notes tree is truly empty, the
2547 * calculation should not take long.
2549 if (b
->num_notes
== 0 && *old_fanout
== 0) {
2550 /* Invoke change_note_fanout() in "counting mode". */
2551 b
->num_notes
= change_note_fanout(&b
->branch_tree
, 0xff);
2552 *old_fanout
= convert_num_notes_to_fanout(b
->num_notes
);
2555 /* Now parse the notemodify command. */
2556 /* <dataref> or 'inline' */
2558 oe
= find_mark(parse_mark_ref_space(&p
));
2559 oidcpy(&oid
, &oe
->idx
.oid
);
2560 } else if (skip_prefix(p
, "inline ", &p
)) {
2562 oe
= NULL
; /* not used with inline_data, but makes gcc happy */
2564 if (parse_oid_hex(p
, &oid
, &p
))
2565 die("Invalid dataref: %s", command_buf
.buf
);
2566 oe
= find_object(&oid
);
2568 die("Missing space after SHA1: %s", command_buf
.buf
);
2572 s
= lookup_branch(p
);
2574 if (is_null_oid(&s
->oid
))
2575 die("Can't add a note on empty branch.");
2576 oidcpy(&commit_oid
, &s
->oid
);
2577 } else if (*p
== ':') {
2578 uintmax_t commit_mark
= parse_mark_ref_eol(p
);
2579 struct object_entry
*commit_oe
= find_mark(commit_mark
);
2580 if (commit_oe
->type
!= OBJ_COMMIT
)
2581 die("Mark :%" PRIuMAX
" not a commit", commit_mark
);
2582 oidcpy(&commit_oid
, &commit_oe
->idx
.oid
);
2583 } else if (!get_oid(p
, &commit_oid
)) {
2585 char *buf
= read_object_with_reference(commit_oid
.hash
,
2586 commit_type
, &size
, commit_oid
.hash
);
2587 if (!buf
|| size
< 46)
2588 die("Not a valid commit: %s", p
);
2591 die("Invalid ref name or SHA1 expression: %s", p
);
2595 strbuf_addstr(&uq
, p
);
2598 read_next_command();
2599 parse_and_store_blob(&last_blob
, &oid
, 0);
2601 if (oe
->type
!= OBJ_BLOB
)
2602 die("Not a blob (actually a %s): %s",
2603 typename(oe
->type
), command_buf
.buf
);
2604 } else if (!is_null_oid(&oid
)) {
2605 enum object_type type
= sha1_object_info(oid
.hash
, NULL
);
2607 die("Blob not found: %s", command_buf
.buf
);
2608 if (type
!= OBJ_BLOB
)
2609 die("Not a blob (actually a %s): %s",
2610 typename(type
), command_buf
.buf
);
2613 construct_path_with_fanout(oid_to_hex(&commit_oid
), *old_fanout
, path
);
2614 if (tree_content_remove(&b
->branch_tree
, path
, NULL
, 0))
2617 if (is_null_oid(&oid
))
2618 return; /* nothing to insert */
2621 new_fanout
= convert_num_notes_to_fanout(b
->num_notes
);
2622 construct_path_with_fanout(oid_to_hex(&commit_oid
), new_fanout
, path
);
2623 tree_content_set(&b
->branch_tree
, path
, &oid
, S_IFREG
| 0644, NULL
);
2626 static void file_change_deleteall(struct branch
*b
)
2628 release_tree_content_recursive(b
->branch_tree
.tree
);
2629 oidclr(&b
->branch_tree
.versions
[0].oid
);
2630 oidclr(&b
->branch_tree
.versions
[1].oid
);
2631 load_tree(&b
->branch_tree
);
2635 static void parse_from_commit(struct branch
*b
, char *buf
, unsigned long size
)
2637 if (!buf
|| size
< GIT_SHA1_HEXSZ
+ 6)
2638 die("Not a valid commit: %s", oid_to_hex(&b
->oid
));
2639 if (memcmp("tree ", buf
, 5)
2640 || get_oid_hex(buf
+ 5, &b
->branch_tree
.versions
[1].oid
))
2641 die("The commit %s is corrupt", oid_to_hex(&b
->oid
));
2642 oidcpy(&b
->branch_tree
.versions
[0].oid
,
2643 &b
->branch_tree
.versions
[1].oid
);
2646 static void parse_from_existing(struct branch
*b
)
2648 if (is_null_oid(&b
->oid
)) {
2649 oidclr(&b
->branch_tree
.versions
[0].oid
);
2650 oidclr(&b
->branch_tree
.versions
[1].oid
);
2655 buf
= read_object_with_reference(b
->oid
.hash
,
2658 parse_from_commit(b
, buf
, size
);
2663 static int parse_from(struct branch
*b
)
2667 struct object_id oid
;
2669 if (!skip_prefix(command_buf
.buf
, "from ", &from
))
2672 oidcpy(&oid
, &b
->branch_tree
.versions
[1].oid
);
2674 s
= lookup_branch(from
);
2676 die("Can't create a branch from itself: %s", b
->name
);
2678 struct object_id
*t
= &s
->branch_tree
.versions
[1].oid
;
2679 oidcpy(&b
->oid
, &s
->oid
);
2680 oidcpy(&b
->branch_tree
.versions
[0].oid
, t
);
2681 oidcpy(&b
->branch_tree
.versions
[1].oid
, t
);
2682 } else if (*from
== ':') {
2683 uintmax_t idnum
= parse_mark_ref_eol(from
);
2684 struct object_entry
*oe
= find_mark(idnum
);
2685 if (oe
->type
!= OBJ_COMMIT
)
2686 die("Mark :%" PRIuMAX
" not a commit", idnum
);
2687 if (oidcmp(&b
->oid
, &oe
->idx
.oid
)) {
2688 oidcpy(&b
->oid
, &oe
->idx
.oid
);
2689 if (oe
->pack_id
!= MAX_PACK_ID
) {
2691 char *buf
= gfi_unpack_entry(oe
, &size
);
2692 parse_from_commit(b
, buf
, size
);
2695 parse_from_existing(b
);
2697 } else if (!get_oid(from
, &b
->oid
)) {
2698 parse_from_existing(b
);
2699 if (is_null_oid(&b
->oid
))
2703 die("Invalid ref name or SHA1 expression: %s", from
);
2705 if (b
->branch_tree
.tree
&& oidcmp(&oid
, &b
->branch_tree
.versions
[1].oid
)) {
2706 release_tree_content_recursive(b
->branch_tree
.tree
);
2707 b
->branch_tree
.tree
= NULL
;
2710 read_next_command();
2714 static struct hash_list
*parse_merge(unsigned int *count
)
2716 struct hash_list
*list
= NULL
, **tail
= &list
, *n
;
2721 while (skip_prefix(command_buf
.buf
, "merge ", &from
)) {
2722 n
= xmalloc(sizeof(*n
));
2723 s
= lookup_branch(from
);
2725 oidcpy(&n
->oid
, &s
->oid
);
2726 else if (*from
== ':') {
2727 uintmax_t idnum
= parse_mark_ref_eol(from
);
2728 struct object_entry
*oe
= find_mark(idnum
);
2729 if (oe
->type
!= OBJ_COMMIT
)
2730 die("Mark :%" PRIuMAX
" not a commit", idnum
);
2731 oidcpy(&n
->oid
, &oe
->idx
.oid
);
2732 } else if (!get_oid(from
, &n
->oid
)) {
2734 char *buf
= read_object_with_reference(n
->oid
.hash
,
2735 commit_type
, &size
, n
->oid
.hash
);
2736 if (!buf
|| size
< 46)
2737 die("Not a valid commit: %s", from
);
2740 die("Invalid ref name or SHA1 expression: %s", from
);
2747 read_next_command();
2752 static void parse_new_commit(const char *arg
)
2754 static struct strbuf msg
= STRBUF_INIT
;
2756 char *author
= NULL
;
2757 char *committer
= NULL
;
2758 struct hash_list
*merge_list
= NULL
;
2759 unsigned int merge_count
;
2760 unsigned char prev_fanout
, new_fanout
;
2763 b
= lookup_branch(arg
);
2765 b
= new_branch(arg
);
2767 read_next_command();
2769 if (skip_prefix(command_buf
.buf
, "author ", &v
)) {
2770 author
= parse_ident(v
);
2771 read_next_command();
2773 if (skip_prefix(command_buf
.buf
, "committer ", &v
)) {
2774 committer
= parse_ident(v
);
2775 read_next_command();
2778 die("Expected committer but didn't get one");
2779 parse_data(&msg
, 0, NULL
);
2780 read_next_command();
2782 merge_list
= parse_merge(&merge_count
);
2784 /* ensure the branch is active/loaded */
2785 if (!b
->branch_tree
.tree
|| !max_active_branches
) {
2786 unload_one_branch();
2790 prev_fanout
= convert_num_notes_to_fanout(b
->num_notes
);
2793 while (command_buf
.len
> 0) {
2794 if (skip_prefix(command_buf
.buf
, "M ", &v
))
2795 file_change_m(v
, b
);
2796 else if (skip_prefix(command_buf
.buf
, "D ", &v
))
2797 file_change_d(v
, b
);
2798 else if (skip_prefix(command_buf
.buf
, "R ", &v
))
2799 file_change_cr(v
, b
, 1);
2800 else if (skip_prefix(command_buf
.buf
, "C ", &v
))
2801 file_change_cr(v
, b
, 0);
2802 else if (skip_prefix(command_buf
.buf
, "N ", &v
))
2803 note_change_n(v
, b
, &prev_fanout
);
2804 else if (!strcmp("deleteall", command_buf
.buf
))
2805 file_change_deleteall(b
);
2806 else if (skip_prefix(command_buf
.buf
, "ls ", &v
))
2809 unread_command_buf
= 1;
2812 if (read_next_command() == EOF
)
2816 new_fanout
= convert_num_notes_to_fanout(b
->num_notes
);
2817 if (new_fanout
!= prev_fanout
)
2818 b
->num_notes
= change_note_fanout(&b
->branch_tree
, new_fanout
);
2820 /* build the tree and the commit */
2821 store_tree(&b
->branch_tree
);
2822 oidcpy(&b
->branch_tree
.versions
[0].oid
,
2823 &b
->branch_tree
.versions
[1].oid
);
2825 strbuf_reset(&new_data
);
2826 strbuf_addf(&new_data
, "tree %s\n",
2827 oid_to_hex(&b
->branch_tree
.versions
[1].oid
));
2828 if (!is_null_oid(&b
->oid
))
2829 strbuf_addf(&new_data
, "parent %s\n",
2830 oid_to_hex(&b
->oid
));
2831 while (merge_list
) {
2832 struct hash_list
*next
= merge_list
->next
;
2833 strbuf_addf(&new_data
, "parent %s\n",
2834 oid_to_hex(&merge_list
->oid
));
2838 strbuf_addf(&new_data
,
2842 author
? author
: committer
, committer
);
2843 strbuf_addbuf(&new_data
, &msg
);
2847 if (!store_object(OBJ_COMMIT
, &new_data
, NULL
, &b
->oid
, next_mark
))
2848 b
->pack_id
= pack_id
;
2849 b
->last_commit
= object_count_by_type
[OBJ_COMMIT
];
2852 static void parse_new_tag(const char *arg
)
2854 static struct strbuf msg
= STRBUF_INIT
;
2859 uintmax_t from_mark
= 0;
2860 struct object_id oid
;
2861 enum object_type type
;
2864 t
= pool_alloc(sizeof(struct tag
));
2865 memset(t
, 0, sizeof(struct tag
));
2866 t
->name
= pool_strdup(arg
);
2868 last_tag
->next_tag
= t
;
2872 read_next_command();
2875 if (!skip_prefix(command_buf
.buf
, "from ", &from
))
2876 die("Expected from command, got %s", command_buf
.buf
);
2877 s
= lookup_branch(from
);
2879 if (is_null_oid(&s
->oid
))
2880 die("Can't tag an empty branch.");
2881 oidcpy(&oid
, &s
->oid
);
2883 } else if (*from
== ':') {
2884 struct object_entry
*oe
;
2885 from_mark
= parse_mark_ref_eol(from
);
2886 oe
= find_mark(from_mark
);
2888 oidcpy(&oid
, &oe
->idx
.oid
);
2889 } else if (!get_oid(from
, &oid
)) {
2890 struct object_entry
*oe
= find_object(&oid
);
2892 type
= sha1_object_info(oid
.hash
, NULL
);
2894 die("Not a valid object: %s", from
);
2898 die("Invalid ref name or SHA1 expression: %s", from
);
2899 read_next_command();
2902 if (skip_prefix(command_buf
.buf
, "tagger ", &v
)) {
2903 tagger
= parse_ident(v
);
2904 read_next_command();
2908 /* tag payload/message */
2909 parse_data(&msg
, 0, NULL
);
2911 /* build the tag object */
2912 strbuf_reset(&new_data
);
2914 strbuf_addf(&new_data
,
2918 oid_to_hex(&oid
), typename(type
), t
->name
);
2920 strbuf_addf(&new_data
,
2921 "tagger %s\n", tagger
);
2922 strbuf_addch(&new_data
, '\n');
2923 strbuf_addbuf(&new_data
, &msg
);
2926 if (store_object(OBJ_TAG
, &new_data
, NULL
, &t
->oid
, 0))
2927 t
->pack_id
= MAX_PACK_ID
;
2929 t
->pack_id
= pack_id
;
2932 static void parse_reset_branch(const char *arg
)
2936 b
= lookup_branch(arg
);
2939 oidclr(&b
->branch_tree
.versions
[0].oid
);
2940 oidclr(&b
->branch_tree
.versions
[1].oid
);
2941 if (b
->branch_tree
.tree
) {
2942 release_tree_content_recursive(b
->branch_tree
.tree
);
2943 b
->branch_tree
.tree
= NULL
;
2947 b
= new_branch(arg
);
2948 read_next_command();
2950 if (command_buf
.len
> 0)
2951 unread_command_buf
= 1;
2954 static void cat_blob_write(const char *buf
, unsigned long size
)
2956 if (write_in_full(cat_blob_fd
, buf
, size
) != size
)
2957 die_errno("Write to frontend failed");
2960 static void cat_blob(struct object_entry
*oe
, struct object_id
*oid
)
2962 struct strbuf line
= STRBUF_INIT
;
2964 enum object_type type
= 0;
2967 if (!oe
|| oe
->pack_id
== MAX_PACK_ID
) {
2968 buf
= read_sha1_file(oid
->hash
, &type
, &size
);
2971 buf
= gfi_unpack_entry(oe
, &size
);
2975 * Output based on batch_one_object() from cat-file.c.
2978 strbuf_reset(&line
);
2979 strbuf_addf(&line
, "%s missing\n", oid_to_hex(oid
));
2980 cat_blob_write(line
.buf
, line
.len
);
2981 strbuf_release(&line
);
2986 die("Can't read object %s", oid_to_hex(oid
));
2987 if (type
!= OBJ_BLOB
)
2988 die("Object %s is a %s but a blob was expected.",
2989 oid_to_hex(oid
), typename(type
));
2990 strbuf_reset(&line
);
2991 strbuf_addf(&line
, "%s %s %lu\n", oid_to_hex(oid
),
2992 typename(type
), size
);
2993 cat_blob_write(line
.buf
, line
.len
);
2994 strbuf_release(&line
);
2995 cat_blob_write(buf
, size
);
2996 cat_blob_write("\n", 1);
2997 if (oe
&& oe
->pack_id
== pack_id
) {
2998 last_blob
.offset
= oe
->idx
.offset
;
2999 strbuf_attach(&last_blob
.data
, buf
, size
, size
);
3000 last_blob
.depth
= oe
->depth
;
3005 static void parse_get_mark(const char *p
)
3007 struct object_entry
*oe
= oe
;
3008 char output
[GIT_MAX_HEXSZ
+ 2];
3010 /* get-mark SP <object> LF */
3012 die("Not a mark: %s", p
);
3014 oe
= find_mark(parse_mark_ref_eol(p
));
3016 die("Unknown mark: %s", command_buf
.buf
);
3018 xsnprintf(output
, sizeof(output
), "%s\n", oid_to_hex(&oe
->idx
.oid
));
3019 cat_blob_write(output
, GIT_SHA1_HEXSZ
+ 1);
3022 static void parse_cat_blob(const char *p
)
3024 struct object_entry
*oe
= oe
;
3025 struct object_id oid
;
3027 /* cat-blob SP <object> LF */
3029 oe
= find_mark(parse_mark_ref_eol(p
));
3031 die("Unknown mark: %s", command_buf
.buf
);
3032 oidcpy(&oid
, &oe
->idx
.oid
);
3034 if (parse_oid_hex(p
, &oid
, &p
))
3035 die("Invalid dataref: %s", command_buf
.buf
);
3037 die("Garbage after SHA1: %s", command_buf
.buf
);
3038 oe
= find_object(&oid
);
3044 static struct object_entry
*dereference(struct object_entry
*oe
,
3045 struct object_id
*oid
)
3050 enum object_type type
= sha1_object_info(oid
->hash
, NULL
);
3052 die("object not found: %s", oid_to_hex(oid
));
3054 oe
= insert_object(oid
);
3056 oe
->pack_id
= MAX_PACK_ID
;
3060 case OBJ_TREE
: /* easy case. */
3066 die("Not a tree-ish: %s", command_buf
.buf
);
3069 if (oe
->pack_id
!= MAX_PACK_ID
) { /* in a pack being written */
3070 buf
= gfi_unpack_entry(oe
, &size
);
3072 enum object_type unused
;
3073 buf
= read_sha1_file(oid
->hash
, &unused
, &size
);
3076 die("Can't load object %s", oid_to_hex(oid
));
3078 /* Peel one layer. */
3081 if (size
< GIT_SHA1_HEXSZ
+ strlen("object ") ||
3082 get_oid_hex(buf
+ strlen("object "), oid
))
3083 die("Invalid SHA1 in tag: %s", command_buf
.buf
);
3086 if (size
< GIT_SHA1_HEXSZ
+ strlen("tree ") ||
3087 get_oid_hex(buf
+ strlen("tree "), oid
))
3088 die("Invalid SHA1 in commit: %s", command_buf
.buf
);
3092 return find_object(oid
);
3095 static struct object_entry
*parse_treeish_dataref(const char **p
)
3097 struct object_id oid
;
3098 struct object_entry
*e
;
3100 if (**p
== ':') { /* <mark> */
3101 e
= find_mark(parse_mark_ref_space(p
));
3103 die("Unknown mark: %s", command_buf
.buf
);
3104 oidcpy(&oid
, &e
->idx
.oid
);
3105 } else { /* <sha1> */
3106 if (parse_oid_hex(*p
, &oid
, p
))
3107 die("Invalid dataref: %s", command_buf
.buf
);
3108 e
= find_object(&oid
);
3110 die("Missing space after tree-ish: %s", command_buf
.buf
);
3113 while (!e
|| e
->type
!= OBJ_TREE
)
3114 e
= dereference(e
, &oid
);
3118 static void print_ls(int mode
, const unsigned char *sha1
, const char *path
)
3120 static struct strbuf line
= STRBUF_INIT
;
3122 /* See show_tree(). */
3124 S_ISGITLINK(mode
) ? commit_type
:
3125 S_ISDIR(mode
) ? tree_type
:
3129 /* missing SP path LF */
3130 strbuf_reset(&line
);
3131 strbuf_addstr(&line
, "missing ");
3132 quote_c_style(path
, &line
, NULL
, 0);
3133 strbuf_addch(&line
, '\n');
3135 /* mode SP type SP object_name TAB path LF */
3136 strbuf_reset(&line
);
3137 strbuf_addf(&line
, "%06o %s %s\t",
3138 mode
& ~NO_DELTA
, type
, sha1_to_hex(sha1
));
3139 quote_c_style(path
, &line
, NULL
, 0);
3140 strbuf_addch(&line
, '\n');
3142 cat_blob_write(line
.buf
, line
.len
);
3145 static void parse_ls(const char *p
, struct branch
*b
)
3147 struct tree_entry
*root
= NULL
;
3148 struct tree_entry leaf
= {NULL
};
3150 /* ls SP (<tree-ish> SP)? <path> */
3153 die("Not in a commit: %s", command_buf
.buf
);
3154 root
= &b
->branch_tree
;
3156 struct object_entry
*e
= parse_treeish_dataref(&p
);
3157 root
= new_tree_entry();
3158 oidcpy(&root
->versions
[1].oid
, &e
->idx
.oid
);
3159 if (!is_null_oid(&root
->versions
[1].oid
))
3160 root
->versions
[1].mode
= S_IFDIR
;
3164 static struct strbuf uq
= STRBUF_INIT
;
3167 if (unquote_c_style(&uq
, p
, &endp
))
3168 die("Invalid path: %s", command_buf
.buf
);
3170 die("Garbage after path in: %s", command_buf
.buf
);
3173 tree_content_get(root
, p
, &leaf
, 1);
3175 * A directory in preparation would have a sha1 of zero
3176 * until it is saved. Save, for simplicity.
3178 if (S_ISDIR(leaf
.versions
[1].mode
))
3181 print_ls(leaf
.versions
[1].mode
, leaf
.versions
[1].oid
.hash
, p
);
3183 release_tree_content_recursive(leaf
.tree
);
3184 if (!b
|| root
!= &b
->branch_tree
)
3185 release_tree_entry(root
);
3188 static void checkpoint(void)
3190 checkpoint_requested
= 0;
3199 static void parse_checkpoint(void)
3201 checkpoint_requested
= 1;
3205 static void parse_progress(void)
3207 fwrite(command_buf
.buf
, 1, command_buf
.len
, stdout
);
3208 fputc('\n', stdout
);
3213 static char* make_fast_import_path(const char *path
)
3215 if (!relative_marks_paths
|| is_absolute_path(path
))
3216 return xstrdup(path
);
3217 return git_pathdup("info/fast-import/%s", path
);
3220 static void option_import_marks(const char *marks
,
3221 int from_stream
, int ignore_missing
)
3223 if (import_marks_file
) {
3225 die("Only one import-marks command allowed per stream");
3227 /* read previous mark file */
3228 if(!import_marks_file_from_stream
)
3232 import_marks_file
= make_fast_import_path(marks
);
3233 safe_create_leading_directories_const(import_marks_file
);
3234 import_marks_file_from_stream
= from_stream
;
3235 import_marks_file_ignore_missing
= ignore_missing
;
3238 static void option_date_format(const char *fmt
)
3240 if (!strcmp(fmt
, "raw"))
3241 whenspec
= WHENSPEC_RAW
;
3242 else if (!strcmp(fmt
, "rfc2822"))
3243 whenspec
= WHENSPEC_RFC2822
;
3244 else if (!strcmp(fmt
, "now"))
3245 whenspec
= WHENSPEC_NOW
;
3247 die("unknown --date-format argument %s", fmt
);
3250 static unsigned long ulong_arg(const char *option
, const char *arg
)
3253 unsigned long rv
= strtoul(arg
, &endptr
, 0);
3254 if (strchr(arg
, '-') || endptr
== arg
|| *endptr
)
3255 die("%s: argument must be a non-negative integer", option
);
3259 static void option_depth(const char *depth
)
3261 max_depth
= ulong_arg("--depth", depth
);
3262 if (max_depth
> MAX_DEPTH
)
3263 die("--depth cannot exceed %u", MAX_DEPTH
);
3266 static void option_active_branches(const char *branches
)
3268 max_active_branches
= ulong_arg("--active-branches", branches
);
3271 static void option_export_marks(const char *marks
)
3273 export_marks_file
= make_fast_import_path(marks
);
3274 safe_create_leading_directories_const(export_marks_file
);
3277 static void option_cat_blob_fd(const char *fd
)
3279 unsigned long n
= ulong_arg("--cat-blob-fd", fd
);
3280 if (n
> (unsigned long) INT_MAX
)
3281 die("--cat-blob-fd cannot exceed %d", INT_MAX
);
3282 cat_blob_fd
= (int) n
;
3285 static void option_export_pack_edges(const char *edges
)
3289 pack_edges
= xfopen(edges
, "a");
3292 static int parse_one_option(const char *option
)
3294 if (skip_prefix(option
, "max-pack-size=", &option
)) {
3296 if (!git_parse_ulong(option
, &v
))
3299 warning("max-pack-size is now in bytes, assuming --max-pack-size=%lum", v
);
3301 } else if (v
< 1024 * 1024) {
3302 warning("minimum max-pack-size is 1 MiB");
3306 } else if (skip_prefix(option
, "big-file-threshold=", &option
)) {
3308 if (!git_parse_ulong(option
, &v
))
3310 big_file_threshold
= v
;
3311 } else if (skip_prefix(option
, "depth=", &option
)) {
3312 option_depth(option
);
3313 } else if (skip_prefix(option
, "active-branches=", &option
)) {
3314 option_active_branches(option
);
3315 } else if (skip_prefix(option
, "export-pack-edges=", &option
)) {
3316 option_export_pack_edges(option
);
3317 } else if (starts_with(option
, "quiet")) {
3319 } else if (starts_with(option
, "stats")) {
3328 static int parse_one_feature(const char *feature
, int from_stream
)
3332 if (skip_prefix(feature
, "date-format=", &arg
)) {
3333 option_date_format(arg
);
3334 } else if (skip_prefix(feature
, "import-marks=", &arg
)) {
3335 option_import_marks(arg
, from_stream
, 0);
3336 } else if (skip_prefix(feature
, "import-marks-if-exists=", &arg
)) {
3337 option_import_marks(arg
, from_stream
, 1);
3338 } else if (skip_prefix(feature
, "export-marks=", &arg
)) {
3339 option_export_marks(arg
);
3340 } else if (!strcmp(feature
, "get-mark")) {
3341 ; /* Don't die - this feature is supported */
3342 } else if (!strcmp(feature
, "cat-blob")) {
3343 ; /* Don't die - this feature is supported */
3344 } else if (!strcmp(feature
, "relative-marks")) {
3345 relative_marks_paths
= 1;
3346 } else if (!strcmp(feature
, "no-relative-marks")) {
3347 relative_marks_paths
= 0;
3348 } else if (!strcmp(feature
, "done")) {
3349 require_explicit_termination
= 1;
3350 } else if (!strcmp(feature
, "force")) {
3352 } else if (!strcmp(feature
, "notes") || !strcmp(feature
, "ls")) {
3353 ; /* do nothing; we have the feature */
3361 static void parse_feature(const char *feature
)
3363 if (seen_data_command
)
3364 die("Got feature command '%s' after data command", feature
);
3366 if (parse_one_feature(feature
, 1))
3369 die("This version of fast-import does not support feature %s.", feature
);
3372 static void parse_option(const char *option
)
3374 if (seen_data_command
)
3375 die("Got option command '%s' after data command", option
);
3377 if (parse_one_option(option
))
3380 die("This version of fast-import does not support option: %s", option
);
3383 static void git_pack_config(void)
3385 int indexversion_value
;
3387 unsigned long packsizelimit_value
;
3389 if (!git_config_get_ulong("pack.depth", &max_depth
)) {
3390 if (max_depth
> MAX_DEPTH
)
3391 max_depth
= MAX_DEPTH
;
3393 if (!git_config_get_int("pack.indexversion", &indexversion_value
)) {
3394 pack_idx_opts
.version
= indexversion_value
;
3395 if (pack_idx_opts
.version
> 2)
3396 git_die_config("pack.indexversion",
3397 "bad pack.indexversion=%"PRIu32
, pack_idx_opts
.version
);
3399 if (!git_config_get_ulong("pack.packsizelimit", &packsizelimit_value
))
3400 max_packsize
= packsizelimit_value
;
3402 if (!git_config_get_int("fastimport.unpacklimit", &limit
))
3403 unpack_limit
= limit
;
3404 else if (!git_config_get_int("transfer.unpacklimit", &limit
))
3405 unpack_limit
= limit
;
3407 git_config(git_default_config
, NULL
);
3410 static const char fast_import_usage
[] =
3411 "git fast-import [--date-format=<f>] [--max-pack-size=<n>] [--big-file-threshold=<n>] [--depth=<n>] [--active-branches=<n>] [--export-marks=<marks.file>]";
3413 static void parse_argv(void)
3417 for (i
= 1; i
< global_argc
; i
++) {
3418 const char *a
= global_argv
[i
];
3420 if (*a
!= '-' || !strcmp(a
, "--"))
3423 if (!skip_prefix(a
, "--", &a
))
3424 die("unknown option %s", a
);
3426 if (parse_one_option(a
))
3429 if (parse_one_feature(a
, 0))
3432 if (skip_prefix(a
, "cat-blob-fd=", &a
)) {
3433 option_cat_blob_fd(a
);
3437 die("unknown option --%s", a
);
3439 if (i
!= global_argc
)
3440 usage(fast_import_usage
);
3442 seen_data_command
= 1;
3443 if (import_marks_file
)
3447 int cmd_main(int argc
, const char **argv
)
3451 if (argc
== 2 && !strcmp(argv
[1], "-h"))
3452 usage(fast_import_usage
);
3454 setup_git_directory();
3455 reset_pack_idx_option(&pack_idx_opts
);
3458 alloc_objects(object_entry_alloc
);
3459 strbuf_init(&command_buf
, 0);
3460 atom_table
= xcalloc(atom_table_sz
, sizeof(struct atom_str
*));
3461 branch_table
= xcalloc(branch_table_sz
, sizeof(struct branch
*));
3462 avail_tree_table
= xcalloc(avail_tree_table_sz
, sizeof(struct avail_tree_content
*));
3463 marks
= pool_calloc(1, sizeof(struct mark_set
));
3468 rc_free
= pool_alloc(cmd_save
* sizeof(*rc_free
));
3469 for (i
= 0; i
< (cmd_save
- 1); i
++)
3470 rc_free
[i
].next
= &rc_free
[i
+ 1];
3471 rc_free
[cmd_save
- 1].next
= NULL
;
3473 prepare_packed_git();
3475 set_die_routine(die_nicely
);
3476 set_checkpoint_signal();
3477 while (read_next_command() != EOF
) {
3479 if (!strcmp("blob", command_buf
.buf
))
3481 else if (skip_prefix(command_buf
.buf
, "ls ", &v
))
3483 else if (skip_prefix(command_buf
.buf
, "commit ", &v
))
3484 parse_new_commit(v
);
3485 else if (skip_prefix(command_buf
.buf
, "tag ", &v
))
3487 else if (skip_prefix(command_buf
.buf
, "reset ", &v
))
3488 parse_reset_branch(v
);
3489 else if (!strcmp("checkpoint", command_buf
.buf
))
3491 else if (!strcmp("done", command_buf
.buf
))
3493 else if (starts_with(command_buf
.buf
, "progress "))
3495 else if (skip_prefix(command_buf
.buf
, "feature ", &v
))
3497 else if (skip_prefix(command_buf
.buf
, "option git ", &v
))
3499 else if (starts_with(command_buf
.buf
, "option "))
3500 /* ignore non-git options*/;
3502 die("Unsupported command: %s", command_buf
.buf
);
3504 if (checkpoint_requested
)
3508 /* argv hasn't been parsed yet, do so */
3509 if (!seen_data_command
)
3512 if (require_explicit_termination
&& feof(stdin
))
3513 die("stream ends early");
3526 uintmax_t total_count
= 0, duplicate_count
= 0;
3527 for (i
= 0; i
< ARRAY_SIZE(object_count_by_type
); i
++)
3528 total_count
+= object_count_by_type
[i
];
3529 for (i
= 0; i
< ARRAY_SIZE(duplicate_count_by_type
); i
++)
3530 duplicate_count
+= duplicate_count_by_type
[i
];
3532 fprintf(stderr
, "%s statistics:\n", argv
[0]);
3533 fprintf(stderr
, "---------------------------------------------------------------------\n");
3534 fprintf(stderr
, "Alloc'd objects: %10" PRIuMAX
"\n", alloc_count
);
3535 fprintf(stderr
, "Total objects: %10" PRIuMAX
" (%10" PRIuMAX
" duplicates )\n", total_count
, duplicate_count
);
3536 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
]);
3537 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
]);
3538 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
]);
3539 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
]);
3540 fprintf(stderr
, "Total branches: %10lu (%10lu loads )\n", branch_count
, branch_load_count
);
3541 fprintf(stderr
, " marks: %10" PRIuMAX
" (%10" PRIuMAX
" unique )\n", (((uintmax_t)1) << marks
->shift
) * 1024, marks_set_count
);
3542 fprintf(stderr
, " atoms: %10u\n", atom_cnt
);
3543 fprintf(stderr
, "Memory total: %10" PRIuMAX
" KiB\n", (total_allocd
+ alloc_count
*sizeof(struct object_entry
))/1024);
3544 fprintf(stderr
, " pools: %10lu KiB\n", (unsigned long)(total_allocd
/1024));
3545 fprintf(stderr
, " objects: %10" PRIuMAX
" KiB\n", (alloc_count
*sizeof(struct object_entry
))/1024);
3546 fprintf(stderr
, "---------------------------------------------------------------------\n");
3548 fprintf(stderr
, "---------------------------------------------------------------------\n");
3549 fprintf(stderr
, "\n");
3552 return failure
? 1 : 0;