]>
git.ipfire.org Git - thirdparty/git.git/blob - fast-import.c
2 Format of STDIN stream:
12 new_blob ::= 'blob' lf
15 file_content ::= data;
17 new_commit ::= 'commit' sp ref_str lf
19 ('author' sp name '<' email '>' ts tz lf)?
20 'committer' sp name '<' email '>' ts tz lf
22 ('from' sp (ref_str | hexsha1 | sha1exp_str | idnum) lf)?
27 file_change ::= 'M' sp mode sp (hexsha1 | idnum) sp path_str lf
30 mode ::= '644' | '755';
32 new_tag ::= 'tag' sp tag_str lf
33 'from' sp (ref_str | hexsha1 | sha1exp_str | idnum) lf
34 'tagger' sp name '<' email '>' ts tz lf
38 reset_branch ::= 'reset' sp ref_str lf;
40 # note: the first idnum in a stream should be 1 and subsequent
41 # idnums should not have gaps between values as this will cause
42 # the stream parser to reserve space for the gapped values. An
43 # idnum can be updated in the future to a new object by issuing
44 # a new mark directive with the old idnum.
46 mark ::= 'mark' sp idnum lf;
48 # note: declen indicates the length of binary_data in bytes.
49 # declen does not include the lf preceeding or trailing the
52 data ::= 'data' sp declen lf
56 # note: quoted strings are C-style quoting supporting \c for
57 # common escapes of 'c' (e..g \n, \t, \\, \") or \nnn where nnn
58 # is the signed byte value in octal. Note that the only
59 # characters which must actually be escaped to protect the
60 # stream formatting is: \, " and LF. Otherwise these values
63 ref_str ::= ref | '"' quoted(ref) '"' ;
64 sha1exp_str ::= sha1exp | '"' quoted(sha1exp) '"' ;
65 tag_str ::= tag | '"' quoted(tag) '"' ;
66 path_str ::= path | '"' quoted(path) '"' ;
68 declen ::= # unsigned 32 bit value, ascii base10 notation;
69 binary_data ::= # file content, not interpreted;
71 sp ::= # ASCII space character;
72 lf ::= # ASCII newline (LF) character;
74 # note: a colon (':') must precede the numerical value assigned to
75 # an idnum. This is to distinguish it from a ref or tag name as
76 # GIT does not permit ':' in ref or tag strings.
79 path ::= # GIT style file path, e.g. "a/b/c";
80 ref ::= # GIT ref name, e.g. "refs/heads/MOZ_GECKO_EXPERIMENT";
81 tag ::= # GIT tag name, e.g. "FIREFOX_1_5";
82 sha1exp ::= # Any valid GIT SHA1 expression;
83 hexsha1 ::= # SHA1 in hexadecimal format;
85 # note: name and email are UTF8 strings, however name must not
86 # contain '<' or lf and email must not contain any of the
87 # following: '<', '>', lf.
89 name ::= # valid GIT author/committer name;
90 email ::= # valid GIT author/committer email;
91 ts ::= # time since the epoch in seconds, ascii base10 notation;
92 tz ::= # GIT style timezone;
103 #include "csum-file.h"
109 struct object_entry
*next
;
110 enum object_type type
;
111 unsigned long offset
;
112 unsigned char sha1
[20];
115 struct object_entry_pool
117 struct object_entry_pool
*next_pool
;
118 struct object_entry
*next_free
;
119 struct object_entry
*end
;
120 struct object_entry entries
[FLEX_ARRAY
]; /* more */
127 struct object_entry
*marked
[1024];
128 struct mark_set
*sets
[1024];
138 unsigned char sha1
[20];
143 struct mem_pool
*next_pool
;
146 char space
[FLEX_ARRAY
]; /* more */
151 struct atom_str
*next_atom
;
153 char str_dat
[FLEX_ARRAY
]; /* more */
159 struct tree_content
*tree
;
160 struct atom_str
* name
;
164 unsigned char sha1
[20];
170 unsigned int entry_capacity
; /* must match avail_tree_content */
171 unsigned int entry_count
;
172 unsigned int delta_depth
;
173 struct tree_entry
*entries
[FLEX_ARRAY
]; /* more */
176 struct avail_tree_content
178 unsigned int entry_capacity
; /* must match tree_content */
179 struct avail_tree_content
*next_avail
;
184 struct branch
*table_next_branch
;
185 struct branch
*active_next_branch
;
187 unsigned long last_commit
;
188 struct tree_entry branch_tree
;
189 unsigned char sha1
[20];
194 struct tag
*next_tag
;
196 unsigned char sha1
[20];
206 /* Stats and misc. counters */
207 static unsigned long max_depth
= 10;
208 static unsigned long alloc_count
;
209 static unsigned long branch_count
;
210 static unsigned long branch_load_count
;
211 static unsigned long remap_count
;
212 static unsigned long object_count
;
213 static unsigned long duplicate_count
;
214 static unsigned long marks_set_count
;
215 static unsigned long object_count_by_type
[9];
216 static unsigned long duplicate_count_by_type
[9];
217 static unsigned long delta_count_by_type
[9];
220 static size_t mem_pool_alloc
= 2*1024*1024 - sizeof(struct mem_pool
);
221 static size_t total_allocd
;
222 static struct mem_pool
*mem_pool
;
224 /* Atom management */
225 static unsigned int atom_table_sz
= 4451;
226 static unsigned int atom_cnt
;
227 static struct atom_str
**atom_table
;
229 /* The .pack file being generated */
231 static unsigned long pack_size
;
232 static unsigned char pack_sha1
[20];
233 static unsigned char* pack_base
;
234 static unsigned long pack_moff
;
235 static unsigned long pack_mlen
= 128*1024*1024;
236 static unsigned long page_size
;
238 /* Table of objects we've written. */
239 static unsigned int object_entry_alloc
= 5000;
240 static struct object_entry_pool
*blocks
;
241 static struct object_entry
*object_table
[1 << 16];
242 static struct mark_set
*marks
;
243 static const char* mark_file
;
246 static struct last_object last_blob
;
248 /* Tree management */
249 static unsigned int tree_entry_alloc
= 1000;
250 static void *avail_tree_entry
;
251 static unsigned int avail_tree_table_sz
= 100;
252 static struct avail_tree_content
**avail_tree_table
;
253 static struct dbuf old_tree
;
254 static struct dbuf new_tree
;
257 static unsigned long max_active_branches
= 5;
258 static unsigned long cur_active_branches
;
259 static unsigned long branch_table_sz
= 1039;
260 static struct branch
**branch_table
;
261 static struct branch
*active_branches
;
264 static struct tag
*first_tag
;
265 static struct tag
*last_tag
;
267 /* Input stream parsing */
268 static struct strbuf command_buf
;
269 static unsigned long next_mark
;
270 static FILE* branch_log
;
273 static void alloc_objects(int cnt
)
275 struct object_entry_pool
*b
;
277 b
= xmalloc(sizeof(struct object_entry_pool
)
278 + cnt
* sizeof(struct object_entry
));
279 b
->next_pool
= blocks
;
280 b
->next_free
= b
->entries
;
281 b
->end
= b
->entries
+ cnt
;
286 static struct object_entry
* new_object(unsigned char *sha1
)
288 struct object_entry
*e
;
290 if (blocks
->next_free
== blocks
->end
)
291 alloc_objects(object_entry_alloc
);
293 e
= blocks
->next_free
++;
294 hashcpy(e
->sha1
, sha1
);
298 static struct object_entry
* find_object(unsigned char *sha1
)
300 unsigned int h
= sha1
[0] << 8 | sha1
[1];
301 struct object_entry
*e
;
302 for (e
= object_table
[h
]; e
; e
= e
->next
)
303 if (!hashcmp(sha1
, e
->sha1
))
308 static struct object_entry
* insert_object(unsigned char *sha1
)
310 unsigned int h
= sha1
[0] << 8 | sha1
[1];
311 struct object_entry
*e
= object_table
[h
];
312 struct object_entry
*p
= NULL
;
315 if (!hashcmp(sha1
, e
->sha1
))
321 e
= new_object(sha1
);
331 static unsigned int hc_str(const char *s
, size_t len
)
339 static void* pool_alloc(size_t len
)
344 for (p
= mem_pool
; p
; p
= p
->next_pool
)
345 if ((p
->end
- p
->next_free
>= len
))
349 if (len
>= (mem_pool_alloc
/2)) {
353 total_allocd
+= sizeof(struct mem_pool
) + mem_pool_alloc
;
354 p
= xmalloc(sizeof(struct mem_pool
) + mem_pool_alloc
);
355 p
->next_pool
= mem_pool
;
356 p
->next_free
= p
->space
;
357 p
->end
= p
->next_free
+ mem_pool_alloc
;
362 /* round out to a pointer alignment */
363 if (len
& (sizeof(void*) - 1))
364 len
+= sizeof(void*) - (len
& (sizeof(void*) - 1));
369 static void* pool_calloc(size_t count
, size_t size
)
371 size_t len
= count
* size
;
372 void *r
= pool_alloc(len
);
377 static char* pool_strdup(const char *s
)
379 char *r
= pool_alloc(strlen(s
) + 1);
384 static void insert_mark(unsigned long idnum
, struct object_entry
*oe
)
386 struct mark_set
*s
= marks
;
387 while ((idnum
>> s
->shift
) >= 1024) {
388 s
= pool_calloc(1, sizeof(struct mark_set
));
389 s
->shift
= marks
->shift
+ 10;
390 s
->data
.sets
[0] = marks
;
394 unsigned long i
= idnum
>> s
->shift
;
395 idnum
-= i
<< s
->shift
;
396 if (!s
->data
.sets
[i
]) {
397 s
->data
.sets
[i
] = pool_calloc(1, sizeof(struct mark_set
));
398 s
->data
.sets
[i
]->shift
= s
->shift
- 10;
402 if (!s
->data
.marked
[idnum
])
404 s
->data
.marked
[idnum
] = oe
;
407 static struct object_entry
* find_mark(unsigned long idnum
)
409 unsigned long orig_idnum
= idnum
;
410 struct mark_set
*s
= marks
;
411 struct object_entry
*oe
= NULL
;
412 if ((idnum
>> s
->shift
) < 1024) {
413 while (s
&& s
->shift
) {
414 unsigned long i
= idnum
>> s
->shift
;
415 idnum
-= i
<< s
->shift
;
419 oe
= s
->data
.marked
[idnum
];
422 die("mark :%lu not declared", orig_idnum
);
426 static struct atom_str
* to_atom(const char *s
, size_t len
)
428 unsigned int hc
= hc_str(s
, len
) % atom_table_sz
;
431 for (c
= atom_table
[hc
]; c
; c
= c
->next_atom
)
432 if (c
->str_len
== len
&& !strncmp(s
, c
->str_dat
, len
))
435 c
= pool_alloc(sizeof(struct atom_str
) + len
+ 1);
437 strncpy(c
->str_dat
, s
, len
);
439 c
->next_atom
= atom_table
[hc
];
445 static struct branch
* lookup_branch(const char *name
)
447 unsigned int hc
= hc_str(name
, strlen(name
)) % branch_table_sz
;
450 for (b
= branch_table
[hc
]; b
; b
= b
->table_next_branch
)
451 if (!strcmp(name
, b
->name
))
456 static struct branch
* new_branch(const char *name
)
458 unsigned int hc
= hc_str(name
, strlen(name
)) % branch_table_sz
;
459 struct branch
* b
= lookup_branch(name
);
462 die("Invalid attempt to create duplicate branch: %s", name
);
463 if (check_ref_format(name
))
464 die("Branch name doesn't conform to GIT standards: %s", name
);
466 b
= pool_calloc(1, sizeof(struct branch
));
467 b
->name
= pool_strdup(name
);
468 b
->table_next_branch
= branch_table
[hc
];
469 branch_table
[hc
] = b
;
474 static unsigned int hc_entries(unsigned int cnt
)
476 cnt
= cnt
& 7 ? (cnt
/ 8) + 1 : cnt
/ 8;
477 return cnt
< avail_tree_table_sz
? cnt
: avail_tree_table_sz
- 1;
480 static struct tree_content
* new_tree_content(unsigned int cnt
)
482 struct avail_tree_content
*f
, *l
= NULL
;
483 struct tree_content
*t
;
484 unsigned int hc
= hc_entries(cnt
);
486 for (f
= avail_tree_table
[hc
]; f
; l
= f
, f
= f
->next_avail
)
487 if (f
->entry_capacity
>= cnt
)
492 l
->next_avail
= f
->next_avail
;
494 avail_tree_table
[hc
] = f
->next_avail
;
496 cnt
= cnt
& 7 ? ((cnt
/ 8) + 1) * 8 : cnt
;
497 f
= pool_alloc(sizeof(*t
) + sizeof(t
->entries
[0]) * cnt
);
498 f
->entry_capacity
= cnt
;
501 t
= (struct tree_content
*)f
;
507 static void release_tree_entry(struct tree_entry
*e
);
508 static void release_tree_content(struct tree_content
*t
)
510 struct avail_tree_content
*f
= (struct avail_tree_content
*)t
;
511 unsigned int hc
= hc_entries(f
->entry_capacity
);
512 f
->next_avail
= avail_tree_table
[hc
];
513 avail_tree_table
[hc
] = f
;
516 static void release_tree_content_recursive(struct tree_content
*t
)
519 for (i
= 0; i
< t
->entry_count
; i
++)
520 release_tree_entry(t
->entries
[i
]);
521 release_tree_content(t
);
524 static struct tree_content
* grow_tree_content(
525 struct tree_content
*t
,
528 struct tree_content
*r
= new_tree_content(t
->entry_count
+ amt
);
529 r
->entry_count
= t
->entry_count
;
530 r
->delta_depth
= t
->delta_depth
;
531 memcpy(r
->entries
,t
->entries
,t
->entry_count
*sizeof(t
->entries
[0]));
532 release_tree_content(t
);
536 static struct tree_entry
* new_tree_entry()
538 struct tree_entry
*e
;
540 if (!avail_tree_entry
) {
541 unsigned int n
= tree_entry_alloc
;
542 total_allocd
+= n
* sizeof(struct tree_entry
);
543 avail_tree_entry
= e
= xmalloc(n
* sizeof(struct tree_entry
));
545 *((void**)e
) = e
+ 1;
551 e
= avail_tree_entry
;
552 avail_tree_entry
= *((void**)e
);
556 static void release_tree_entry(struct tree_entry
*e
)
559 release_tree_content_recursive(e
->tree
);
560 *((void**)e
) = avail_tree_entry
;
561 avail_tree_entry
= e
;
564 static void yread(int fd
, void *buffer
, size_t length
)
567 while (ret
< length
) {
568 ssize_t size
= xread(fd
, (char *) buffer
+ ret
, length
- ret
);
570 die("Read from descriptor %i: end of stream", fd
);
572 die("Read from descriptor %i: %s", fd
, strerror(errno
));
577 static void ywrite(int fd
, void *buffer
, size_t length
)
580 while (ret
< length
) {
581 ssize_t size
= xwrite(fd
, (char *) buffer
+ ret
, length
- ret
);
583 die("Write to descriptor %i: end of file", fd
);
585 die("Write to descriptor %i: %s", fd
, strerror(errno
));
590 static size_t encode_header(
591 enum object_type type
,
598 if (type
< OBJ_COMMIT
|| type
> OBJ_DELTA
)
599 die("bad type %d", type
);
601 c
= (type
<< 4) | (size
& 15);
613 static int store_object(
614 enum object_type type
,
617 struct last_object
*last
,
618 unsigned char *sha1out
,
622 struct object_entry
*e
;
623 unsigned char hdr
[96];
624 unsigned char sha1
[20];
625 unsigned long hdrlen
, deltalen
;
629 hdrlen
= sprintf((char*)hdr
,"%s %lu",type_names
[type
],datlen
) + 1;
631 SHA1_Update(&c
, hdr
, hdrlen
);
632 SHA1_Update(&c
, dat
, datlen
);
633 SHA1_Final(sha1
, &c
);
635 hashcpy(sha1out
, sha1
);
637 e
= insert_object(sha1
);
639 insert_mark(mark
, e
);
642 duplicate_count_by_type
[type
]++;
646 e
->offset
= pack_size
;
648 object_count_by_type
[type
]++;
650 if (last
&& last
->data
&& last
->depth
< max_depth
)
651 delta
= diff_delta(last
->data
, last
->len
,
657 memset(&s
, 0, sizeof(s
));
658 deflateInit(&s
, zlib_compression_level
);
661 delta_count_by_type
[type
]++;
664 s
.avail_in
= deltalen
;
665 hdrlen
= encode_header(OBJ_DELTA
, deltalen
, hdr
);
666 ywrite(pack_fd
, hdr
, hdrlen
);
667 ywrite(pack_fd
, last
->sha1
, sizeof(sha1
));
668 pack_size
+= hdrlen
+ sizeof(sha1
);
674 hdrlen
= encode_header(type
, datlen
, hdr
);
675 ywrite(pack_fd
, hdr
, hdrlen
);
679 s
.avail_out
= deflateBound(&s
, s
.avail_in
);
680 s
.next_out
= out
= xmalloc(s
.avail_out
);
681 while (deflate(&s
, Z_FINISH
) == Z_OK
)
685 ywrite(pack_fd
, out
, s
.total_out
);
686 pack_size
+= s
.total_out
;
692 if (last
->data
&& !last
->no_free
)
696 hashcpy(last
->sha1
, sha1
);
701 static unsigned char* map_pack(unsigned long offset
, unsigned int *left
)
703 if (offset
>= pack_size
)
704 die("object offset outside of pack file");
706 || offset
< pack_moff
707 || (offset
+ 20) >= (pack_moff
+ pack_mlen
)) {
709 munmap(pack_base
, pack_mlen
);
710 pack_moff
= (offset
/ page_size
) * page_size
;
711 pack_base
= mmap(NULL
,pack_mlen
,PROT_READ
,MAP_SHARED
,
713 if (pack_base
== MAP_FAILED
)
714 die("Failed to map generated pack: %s", strerror(errno
));
719 *left
= pack_mlen
- offset
;
720 return pack_base
+ offset
;
723 static unsigned long unpack_object_header(unsigned long offset
,
724 enum object_type
*type
,
725 unsigned long *sizep
)
731 c
= *map_pack(offset
++, NULL
);
732 *type
= (c
>> 4) & 7;
736 c
= *map_pack(offset
++, NULL
);
737 size
+= (c
& 0x7f) << shift
;
744 static void *unpack_non_delta_entry(unsigned long o
, unsigned long sz
)
747 unsigned char *result
;
749 result
= xmalloc(sz
+ 1);
752 memset(&stream
, 0, sizeof(stream
));
753 stream
.next_in
= map_pack(o
, &stream
.avail_in
);
754 stream
.next_out
= result
;
755 stream
.avail_out
= sz
;
757 inflateInit(&stream
);
759 int st
= inflate(&stream
, Z_FINISH
);
760 if (st
== Z_STREAM_END
)
762 if (st
== Z_OK
|| st
== Z_BUF_ERROR
) {
763 o
= stream
.next_in
- pack_base
+ pack_moff
;
764 stream
.next_in
= map_pack(o
, &stream
.avail_in
);
767 die("Error %i from zlib during inflate.", st
);
770 if (stream
.total_out
!= sz
)
771 die("Error after inflate: sizes mismatch");
775 static void *unpack_entry(unsigned long offset
,
776 unsigned long *sizep
,
777 unsigned int *delta_depth
);
779 static void *unpack_delta_entry(unsigned long offset
,
780 unsigned long delta_size
,
781 unsigned long *sizep
,
782 unsigned int *delta_depth
)
784 struct object_entry
*base_oe
;
785 unsigned char *base_sha1
;
786 void *delta_data
, *base
, *result
;
787 unsigned long base_size
, result_size
;
789 base_sha1
= map_pack(offset
, NULL
);
790 base_oe
= find_object(base_sha1
);
792 die("I'm broken; I can't find a base I know must be here.");
793 base
= unpack_entry(base_oe
->offset
, &base_size
, delta_depth
);
794 delta_data
= unpack_non_delta_entry(offset
+ 20, delta_size
);
795 result
= patch_delta(base
, base_size
,
796 delta_data
, delta_size
,
799 die("failed to apply delta");
802 *sizep
= result_size
;
807 static void *unpack_entry(unsigned long offset
,
808 unsigned long *sizep
,
809 unsigned int *delta_depth
)
812 enum object_type kind
;
814 offset
= unpack_object_header(offset
, &kind
, &size
);
817 return unpack_delta_entry(offset
, size
, sizep
, delta_depth
);
824 return unpack_non_delta_entry(offset
, size
);
826 die("I created an object I can't read!");
830 static const char *get_mode(const char *str
, unsigned int *modep
)
833 unsigned int mode
= 0;
835 while ((c
= *str
++) != ' ') {
836 if (c
< '0' || c
> '7')
838 mode
= (mode
<< 3) + (c
- '0');
844 static void load_tree(struct tree_entry
*root
)
846 unsigned char* sha1
= root
->versions
[1].sha1
;
847 struct object_entry
*myoe
;
848 struct tree_content
*t
;
853 root
->tree
= t
= new_tree_content(8);
854 if (is_null_sha1(sha1
))
857 myoe
= find_object(sha1
);
859 if (myoe
->type
!= OBJ_TREE
)
860 die("Not a tree: %s", sha1_to_hex(sha1
));
861 buf
= unpack_entry(myoe
->offset
, &size
, &t
->delta_depth
);
864 buf
= read_sha1_file(sha1
, type
, &size
);
865 if (!buf
|| strcmp(type
, tree_type
))
866 die("Can't load tree %s", sha1_to_hex(sha1
));
870 while (c
!= (buf
+ size
)) {
871 struct tree_entry
*e
= new_tree_entry();
873 if (t
->entry_count
== t
->entry_capacity
)
874 root
->tree
= t
= grow_tree_content(t
, 8);
875 t
->entries
[t
->entry_count
++] = e
;
878 c
= get_mode(c
, &e
->versions
[1].mode
);
880 die("Corrupt mode in %s", sha1_to_hex(sha1
));
881 e
->versions
[0].mode
= e
->versions
[1].mode
;
882 e
->name
= to_atom(c
, strlen(c
));
883 c
+= e
->name
->str_len
+ 1;
884 hashcpy(e
->versions
[0].sha1
, (unsigned char*)c
);
885 hashcpy(e
->versions
[1].sha1
, (unsigned char*)c
);
891 static int tecmp0 (const void *_a
, const void *_b
)
893 struct tree_entry
*a
= *((struct tree_entry
**)_a
);
894 struct tree_entry
*b
= *((struct tree_entry
**)_b
);
895 return base_name_compare(
896 a
->name
->str_dat
, a
->name
->str_len
, a
->versions
[0].mode
,
897 b
->name
->str_dat
, b
->name
->str_len
, b
->versions
[0].mode
);
900 static int tecmp1 (const void *_a
, const void *_b
)
902 struct tree_entry
*a
= *((struct tree_entry
**)_a
);
903 struct tree_entry
*b
= *((struct tree_entry
**)_b
);
904 return base_name_compare(
905 a
->name
->str_dat
, a
->name
->str_len
, a
->versions
[1].mode
,
906 b
->name
->str_dat
, b
->name
->str_len
, b
->versions
[1].mode
);
909 static void mktree(struct tree_content
*t
,
919 qsort(t
->entries
,t
->entry_count
,sizeof(t
->entries
[0]),tecmp0
);
921 qsort(t
->entries
,t
->entry_count
,sizeof(t
->entries
[0]),tecmp1
);
923 for (i
= 0; i
< t
->entry_count
; i
++) {
924 if (t
->entries
[i
]->versions
[v
].mode
)
925 maxlen
+= t
->entries
[i
]->name
->str_len
+ 34;
929 if (b
->capacity
< maxlen
)
930 b
->capacity
= ((maxlen
/ 1024) + 1) * 1024;
931 b
->buffer
= xrealloc(b
->buffer
, b
->capacity
);
933 b
->capacity
= ((maxlen
/ 1024) + 1) * 1024;
934 b
->buffer
= xmalloc(b
->capacity
);
938 for (i
= 0; i
< t
->entry_count
; i
++) {
939 struct tree_entry
*e
= t
->entries
[i
];
940 if (!e
->versions
[v
].mode
)
942 c
+= sprintf(c
, "%o", e
->versions
[v
].mode
);
944 strcpy(c
, e
->name
->str_dat
);
945 c
+= e
->name
->str_len
+ 1;
946 hashcpy((unsigned char*)c
, e
->versions
[v
].sha1
);
949 *szp
= c
- (char*)b
->buffer
;
952 static void store_tree(struct tree_entry
*root
)
954 struct tree_content
*t
= root
->tree
;
955 unsigned int i
, j
, del
;
956 unsigned long new_len
;
957 struct last_object lo
;
959 if (!is_null_sha1(root
->versions
[1].sha1
))
962 for (i
= 0; i
< t
->entry_count
; i
++) {
963 if (t
->entries
[i
]->tree
)
964 store_tree(t
->entries
[i
]);
967 if (is_null_sha1(root
->versions
[0].sha1
)
968 || !find_object(root
->versions
[0].sha1
)) {
972 mktree(t
, 0, &lo
.len
, &old_tree
);
973 lo
.data
= old_tree
.buffer
;
974 lo
.depth
= t
->delta_depth
;
976 hashcpy(lo
.sha1
, root
->versions
[0].sha1
);
978 mktree(t
, 1, &new_len
, &new_tree
);
980 store_object(OBJ_TREE
, new_tree
.buffer
, new_len
,
981 &lo
, root
->versions
[1].sha1
, 0);
983 t
->delta_depth
= lo
.depth
;
984 hashcpy(root
->versions
[0].sha1
, root
->versions
[1].sha1
);
985 for (i
= 0, j
= 0, del
= 0; i
< t
->entry_count
; i
++) {
986 struct tree_entry
*e
= t
->entries
[i
];
987 if (e
->versions
[1].mode
) {
988 e
->versions
[0].mode
= e
->versions
[1].mode
;
989 hashcpy(e
->versions
[0].sha1
, e
->versions
[1].sha1
);
992 release_tree_entry(e
);
996 t
->entry_count
-= del
;
999 static int tree_content_set(
1000 struct tree_entry
*root
,
1002 const unsigned char *sha1
,
1003 const unsigned int mode
)
1005 struct tree_content
*t
= root
->tree
;
1008 struct tree_entry
*e
;
1010 slash1
= strchr(p
, '/');
1016 for (i
= 0; i
< t
->entry_count
; i
++) {
1018 if (e
->name
->str_len
== n
&& !strncmp(p
, e
->name
->str_dat
, n
)) {
1020 if (e
->versions
[1].mode
== mode
1021 && !hashcmp(e
->versions
[1].sha1
, sha1
))
1023 e
->versions
[1].mode
= mode
;
1024 hashcpy(e
->versions
[1].sha1
, sha1
);
1026 release_tree_content_recursive(e
->tree
);
1029 hashclr(root
->versions
[1].sha1
);
1032 if (!S_ISDIR(e
->versions
[1].mode
)) {
1033 e
->tree
= new_tree_content(8);
1034 e
->versions
[1].mode
= S_IFDIR
;
1038 if (tree_content_set(e
, slash1
+ 1, sha1
, mode
)) {
1039 hashclr(root
->versions
[1].sha1
);
1046 if (t
->entry_count
== t
->entry_capacity
)
1047 root
->tree
= t
= grow_tree_content(t
, 8);
1048 e
= new_tree_entry();
1049 e
->name
= to_atom(p
, n
);
1050 e
->versions
[0].mode
= 0;
1051 hashclr(e
->versions
[0].sha1
);
1052 t
->entries
[t
->entry_count
++] = e
;
1054 e
->tree
= new_tree_content(8);
1055 e
->versions
[1].mode
= S_IFDIR
;
1056 tree_content_set(e
, slash1
+ 1, sha1
, mode
);
1059 e
->versions
[1].mode
= mode
;
1060 hashcpy(e
->versions
[1].sha1
, sha1
);
1062 hashclr(root
->versions
[1].sha1
);
1066 static int tree_content_remove(struct tree_entry
*root
, const char *p
)
1068 struct tree_content
*t
= root
->tree
;
1071 struct tree_entry
*e
;
1073 slash1
= strchr(p
, '/');
1079 for (i
= 0; i
< t
->entry_count
; i
++) {
1081 if (e
->name
->str_len
== n
&& !strncmp(p
, e
->name
->str_dat
, n
)) {
1082 if (!slash1
|| !S_ISDIR(e
->versions
[1].mode
))
1086 if (tree_content_remove(e
, slash1
+ 1)) {
1087 if (!e
->tree
->entry_count
)
1089 hashclr(root
->versions
[1].sha1
);
1099 release_tree_content_recursive(e
->tree
);
1102 e
->versions
[1].mode
= 0;
1103 hashclr(e
->versions
[1].sha1
);
1104 hashclr(root
->versions
[1].sha1
);
1108 static void init_pack_header()
1110 struct pack_header hdr
;
1112 hdr
.hdr_signature
= htonl(PACK_SIGNATURE
);
1113 hdr
.hdr_version
= htonl(2);
1114 hdr
.hdr_entries
= 0;
1116 ywrite(pack_fd
, &hdr
, sizeof(hdr
));
1117 pack_size
= sizeof(hdr
);
1120 static void fixup_header_footer()
1128 if (lseek(pack_fd
, 0, SEEK_SET
) != 0)
1129 die("Failed seeking to start: %s", strerror(errno
));
1132 yread(pack_fd
, hdr
, 8);
1133 SHA1_Update(&c
, hdr
, 8);
1135 cnt
= htonl(object_count
);
1136 SHA1_Update(&c
, &cnt
, 4);
1137 ywrite(pack_fd
, &cnt
, 4);
1139 buf
= xmalloc(128 * 1024);
1141 n
= xread(pack_fd
, buf
, 128 * 1024);
1144 SHA1_Update(&c
, buf
, n
);
1148 SHA1_Final(pack_sha1
, &c
);
1149 ywrite(pack_fd
, pack_sha1
, sizeof(pack_sha1
));
1152 static int oecmp (const void *_a
, const void *_b
)
1154 struct object_entry
*a
= *((struct object_entry
**)_a
);
1155 struct object_entry
*b
= *((struct object_entry
**)_b
);
1156 return hashcmp(a
->sha1
, b
->sha1
);
1159 static void write_index(const char *idx_name
)
1162 struct object_entry
**idx
, **c
, **last
;
1163 struct object_entry
*e
;
1164 struct object_entry_pool
*o
;
1165 unsigned int array
[256];
1168 /* Build the sorted table of object IDs. */
1169 idx
= xmalloc(object_count
* sizeof(struct object_entry
*));
1171 for (o
= blocks
; o
; o
= o
->next_pool
)
1172 for (e
= o
->entries
; e
!= o
->next_free
; e
++)
1174 last
= idx
+ object_count
;
1175 qsort(idx
, object_count
, sizeof(struct object_entry
*), oecmp
);
1177 /* Generate the fan-out array. */
1179 for (i
= 0; i
< 256; i
++) {
1180 struct object_entry
**next
= c
;;
1181 while (next
< last
) {
1182 if ((*next
)->sha1
[0] != i
)
1186 array
[i
] = htonl(next
- idx
);
1190 f
= sha1create("%s", idx_name
);
1191 sha1write(f
, array
, 256 * sizeof(int));
1192 for (c
= idx
; c
!= last
; c
++) {
1193 unsigned int offset
= htonl((*c
)->offset
);
1194 sha1write(f
, &offset
, 4);
1195 sha1write(f
, (*c
)->sha1
, sizeof((*c
)->sha1
));
1197 sha1write(f
, pack_sha1
, sizeof(pack_sha1
));
1198 sha1close(f
, NULL
, 1);
1202 static void dump_branches()
1204 static const char *msg
= "fast-import";
1207 struct ref_lock
*lock
;
1209 for (i
= 0; i
< branch_table_sz
; i
++) {
1210 for (b
= branch_table
[i
]; b
; b
= b
->table_next_branch
) {
1211 lock
= lock_any_ref_for_update(b
->name
, NULL
, 0);
1212 if (!lock
|| write_ref_sha1(lock
, b
->sha1
, msg
) < 0)
1213 die("Can't write %s", b
->name
);
1218 static void dump_tags()
1220 static const char *msg
= "fast-import";
1222 struct ref_lock
*lock
;
1223 char path
[PATH_MAX
];
1225 for (t
= first_tag
; t
; t
= t
->next_tag
) {
1226 sprintf(path
, "refs/tags/%s", t
->name
);
1227 lock
= lock_any_ref_for_update(path
, NULL
, 0);
1228 if (!lock
|| write_ref_sha1(lock
, t
->sha1
, msg
) < 0)
1229 die("Can't write %s", path
);
1233 static void dump_marks_helper(FILE *f
,
1239 for (k
= 0; k
< 1024; k
++) {
1240 if (m
->data
.sets
[k
])
1241 dump_marks_helper(f
, (base
+ k
) << m
->shift
,
1245 for (k
= 0; k
< 1024; k
++) {
1246 if (m
->data
.marked
[k
])
1247 fprintf(f
, ":%lu %s\n", base
+ k
,
1248 sha1_to_hex(m
->data
.marked
[k
]->sha1
));
1253 static void dump_marks()
1257 FILE *f
= fopen(mark_file
, "w");
1258 dump_marks_helper(f
, 0, marks
);
1263 static void read_next_command()
1265 read_line(&command_buf
, stdin
, '\n');
1268 static void cmd_mark()
1270 if (!strncmp("mark :", command_buf
.buf
, 6)) {
1271 next_mark
= strtoul(command_buf
.buf
+ 6, NULL
, 10);
1272 read_next_command();
1278 static void* cmd_data (size_t *size
)
1284 if (strncmp("data ", command_buf
.buf
, 5))
1285 die("Expected 'data n' command, found: %s", command_buf
.buf
);
1287 length
= strtoul(command_buf
.buf
+ 5, NULL
, 10);
1288 buffer
= xmalloc(length
);
1290 while (n
< length
) {
1291 size_t s
= fread((char*)buffer
+ n
, 1, length
- n
, stdin
);
1292 if (!s
&& feof(stdin
))
1293 die("EOF in data (%lu bytes remaining)", length
- n
);
1297 if (fgetc(stdin
) != '\n')
1298 die("An lf did not trail the binary data as expected.");
1304 static void cmd_new_blob()
1309 read_next_command();
1313 if (store_object(OBJ_BLOB
, d
, l
, &last_blob
, NULL
, next_mark
))
1317 static void unload_one_branch()
1319 while (cur_active_branches
1320 && cur_active_branches
>= max_active_branches
) {
1321 unsigned long min_commit
= ULONG_MAX
;
1322 struct branch
*e
, *l
= NULL
, *p
= NULL
;
1324 for (e
= active_branches
; e
; e
= e
->active_next_branch
) {
1325 if (e
->last_commit
< min_commit
) {
1327 min_commit
= e
->last_commit
;
1333 e
= p
->active_next_branch
;
1334 p
->active_next_branch
= e
->active_next_branch
;
1336 e
= active_branches
;
1337 active_branches
= e
->active_next_branch
;
1339 e
->active_next_branch
= NULL
;
1340 if (e
->branch_tree
.tree
) {
1341 release_tree_content_recursive(e
->branch_tree
.tree
);
1342 e
->branch_tree
.tree
= NULL
;
1344 cur_active_branches
--;
1348 static void load_branch(struct branch
*b
)
1350 load_tree(&b
->branch_tree
);
1351 b
->active_next_branch
= active_branches
;
1352 active_branches
= b
;
1353 cur_active_branches
++;
1354 branch_load_count
++;
1357 static void file_change_m(struct branch
*b
)
1359 const char *p
= command_buf
.buf
+ 2;
1362 struct object_entry
*oe
;
1363 unsigned char sha1
[20];
1367 p
= get_mode(p
, &mode
);
1369 die("Corrupt mode: %s", command_buf
.buf
);
1371 case S_IFREG
| 0644:
1372 case S_IFREG
| 0755:
1379 die("Corrupt mode: %s", command_buf
.buf
);
1384 oe
= find_mark(strtoul(p
+ 1, &x
, 10));
1387 if (get_sha1_hex(p
, sha1
))
1388 die("Invalid SHA1: %s", command_buf
.buf
);
1389 oe
= find_object(sha1
);
1393 die("Missing space after SHA1: %s", command_buf
.buf
);
1395 p_uq
= unquote_c_style(p
, &endp
);
1398 die("Garbage after path in: %s", command_buf
.buf
);
1403 if (oe
->type
!= OBJ_BLOB
)
1404 die("Not a blob (actually a %s): %s",
1405 command_buf
.buf
, type_names
[oe
->type
]);
1407 if (sha1_object_info(sha1
, type
, NULL
))
1408 die("Blob not found: %s", command_buf
.buf
);
1409 if (strcmp(blob_type
, type
))
1410 die("Not a blob (actually a %s): %s",
1411 command_buf
.buf
, type
);
1414 tree_content_set(&b
->branch_tree
, p
, sha1
, S_IFREG
| mode
);
1420 static void file_change_d(struct branch
*b
)
1422 const char *p
= command_buf
.buf
+ 2;
1426 p_uq
= unquote_c_style(p
, &endp
);
1429 die("Garbage after path in: %s", command_buf
.buf
);
1432 tree_content_remove(&b
->branch_tree
, p
);
1437 static void cmd_from(struct branch
*b
)
1439 const char *from
, *endp
;
1443 if (strncmp("from ", command_buf
.buf
, 5))
1447 die("Can't reinitailize branch %s", b
->name
);
1449 from
= strchr(command_buf
.buf
, ' ') + 1;
1450 str_uq
= unquote_c_style(from
, &endp
);
1453 die("Garbage after string in: %s", command_buf
.buf
);
1457 s
= lookup_branch(from
);
1459 die("Can't create a branch from itself: %s", b
->name
);
1461 unsigned char *t
= s
->branch_tree
.versions
[1].sha1
;
1462 hashcpy(b
->sha1
, s
->sha1
);
1463 hashcpy(b
->branch_tree
.versions
[0].sha1
, t
);
1464 hashcpy(b
->branch_tree
.versions
[1].sha1
, t
);
1465 } else if (*from
== ':') {
1466 unsigned long idnum
= strtoul(from
+ 1, NULL
, 10);
1467 struct object_entry
*oe
= find_mark(idnum
);
1471 if (oe
->type
!= OBJ_COMMIT
)
1472 die("Mark :%lu not a commit", idnum
);
1473 hashcpy(b
->sha1
, oe
->sha1
);
1474 buf
= unpack_entry(oe
->offset
, &size
, &depth
);
1475 if (!buf
|| size
< 46)
1476 die("Not a valid commit: %s", from
);
1477 if (memcmp("tree ", buf
, 5)
1478 || get_sha1_hex(buf
+ 5, b
->branch_tree
.versions
[1].sha1
))
1479 die("The commit %s is corrupt", sha1_to_hex(b
->sha1
));
1481 hashcpy(b
->branch_tree
.versions
[0].sha1
,
1482 b
->branch_tree
.versions
[1].sha1
);
1483 } else if (!get_sha1(from
, b
->sha1
)) {
1484 if (is_null_sha1(b
->sha1
)) {
1485 hashclr(b
->branch_tree
.versions
[0].sha1
);
1486 hashclr(b
->branch_tree
.versions
[1].sha1
);
1491 buf
= read_object_with_reference(b
->sha1
,
1492 type_names
[OBJ_COMMIT
], &size
, b
->sha1
);
1493 if (!buf
|| size
< 46)
1494 die("Not a valid commit: %s", from
);
1495 if (memcmp("tree ", buf
, 5)
1496 || get_sha1_hex(buf
+ 5, b
->branch_tree
.versions
[1].sha1
))
1497 die("The commit %s is corrupt", sha1_to_hex(b
->sha1
));
1499 hashcpy(b
->branch_tree
.versions
[0].sha1
,
1500 b
->branch_tree
.versions
[1].sha1
);
1503 die("Invalid ref name or SHA1 expression: %s", from
);
1505 read_next_command();
1508 static void cmd_new_commit()
1516 char *author
= NULL
;
1517 char *committer
= NULL
;
1520 /* Obtain the branch name from the rest of our command */
1521 sp
= strchr(command_buf
.buf
, ' ') + 1;
1522 str_uq
= unquote_c_style(sp
, &endp
);
1525 die("Garbage after ref in: %s", command_buf
.buf
);
1528 b
= lookup_branch(sp
);
1534 read_next_command();
1536 if (!strncmp("author ", command_buf
.buf
, 7)) {
1537 author
= strdup(command_buf
.buf
);
1538 read_next_command();
1540 if (!strncmp("committer ", command_buf
.buf
, 10)) {
1541 committer
= strdup(command_buf
.buf
);
1542 read_next_command();
1545 die("Expected committer but didn't get one");
1546 msg
= cmd_data(&msglen
);
1547 read_next_command();
1550 /* ensure the branch is active/loaded */
1551 if (!b
->branch_tree
.tree
|| !max_active_branches
) {
1552 unload_one_branch();
1558 if (1 == command_buf
.len
)
1560 else if (!strncmp("M ", command_buf
.buf
, 2))
1562 else if (!strncmp("D ", command_buf
.buf
, 2))
1565 die("Unsupported file_change: %s", command_buf
.buf
);
1566 read_next_command();
1569 /* build the tree and the commit */
1570 store_tree(&b
->branch_tree
);
1571 body
= xmalloc(97 + msglen
1573 ? strlen(author
) + strlen(committer
)
1574 : 2 * strlen(committer
)));
1576 sp
+= sprintf(sp
, "tree %s\n",
1577 sha1_to_hex(b
->branch_tree
.versions
[1].sha1
));
1578 if (!is_null_sha1(b
->sha1
))
1579 sp
+= sprintf(sp
, "parent %s\n", sha1_to_hex(b
->sha1
));
1581 sp
+= sprintf(sp
, "%s\n", author
);
1583 sp
+= sprintf(sp
, "author %s\n", committer
+ 10);
1584 sp
+= sprintf(sp
, "%s\n\n", committer
);
1585 memcpy(sp
, msg
, msglen
);
1592 store_object(OBJ_COMMIT
, body
, sp
- body
, NULL
, b
->sha1
, next_mark
);
1594 b
->last_commit
= object_count_by_type
[OBJ_COMMIT
];
1597 int need_dq
= quote_c_style(b
->name
, NULL
, NULL
, 0);
1598 fprintf(branch_log
, "commit ");
1600 fputc('"', branch_log
);
1601 quote_c_style(b
->name
, NULL
, branch_log
, 0);
1602 fputc('"', branch_log
);
1604 fprintf(branch_log
, "%s", b
->name
);
1605 fprintf(branch_log
," :%lu %s\n",next_mark
,sha1_to_hex(b
->sha1
));
1609 static void cmd_new_tag()
1621 unsigned long from_mark
= 0;
1622 unsigned char sha1
[20];
1624 /* Obtain the new tag name from the rest of our command */
1625 sp
= strchr(command_buf
.buf
, ' ') + 1;
1626 str_uq
= unquote_c_style(sp
, &endp
);
1629 die("Garbage after tag name in: %s", command_buf
.buf
);
1632 t
= pool_alloc(sizeof(struct tag
));
1634 t
->name
= pool_strdup(sp
);
1636 last_tag
->next_tag
= t
;
1642 read_next_command();
1645 if (strncmp("from ", command_buf
.buf
, 5))
1646 die("Expected from command, got %s", command_buf
.buf
);
1648 from
= strchr(command_buf
.buf
, ' ') + 1;
1649 str_uq
= unquote_c_style(from
, &endp
);
1652 die("Garbage after string in: %s", command_buf
.buf
);
1656 s
= lookup_branch(from
);
1658 hashcpy(sha1
, s
->sha1
);
1659 } else if (*from
== ':') {
1660 from_mark
= strtoul(from
+ 1, NULL
, 10);
1661 struct object_entry
*oe
= find_mark(from_mark
);
1662 if (oe
->type
!= OBJ_COMMIT
)
1663 die("Mark :%lu not a commit", from_mark
);
1664 hashcpy(sha1
, oe
->sha1
);
1665 } else if (!get_sha1(from
, sha1
)) {
1669 buf
= read_object_with_reference(sha1
,
1670 type_names
[OBJ_COMMIT
], &size
, sha1
);
1671 if (!buf
|| size
< 46)
1672 die("Not a valid commit: %s", from
);
1675 die("Invalid ref name or SHA1 expression: %s", from
);
1679 read_next_command();
1682 if (strncmp("tagger ", command_buf
.buf
, 7))
1683 die("Expected tagger command, got %s", command_buf
.buf
);
1684 tagger
= strdup(command_buf
.buf
);
1686 /* tag payload/message */
1687 read_next_command();
1688 msg
= cmd_data(&msglen
);
1690 /* build the tag object */
1691 body
= xmalloc(67 + strlen(t
->name
) + strlen(tagger
) + msglen
);
1693 sp
+= sprintf(sp
, "object %s\n", sha1_to_hex(sha1
));
1694 sp
+= sprintf(sp
, "type %s\n", type_names
[OBJ_COMMIT
]);
1695 sp
+= sprintf(sp
, "tag %s\n", t
->name
);
1696 sp
+= sprintf(sp
, "%s\n\n", tagger
);
1697 memcpy(sp
, msg
, msglen
);
1702 store_object(OBJ_TAG
, body
, sp
- body
, NULL
, t
->sha1
, 0);
1706 int need_dq
= quote_c_style(t
->name
, NULL
, NULL
, 0);
1707 fprintf(branch_log
, "tag ");
1709 fputc('"', branch_log
);
1710 quote_c_style(t
->name
, NULL
, branch_log
, 0);
1711 fputc('"', branch_log
);
1713 fprintf(branch_log
, "%s", t
->name
);
1714 fprintf(branch_log
," :%lu %s\n",from_mark
,sha1_to_hex(t
->sha1
));
1718 static void cmd_reset_branch()
1725 /* Obtain the branch name from the rest of our command */
1726 sp
= strchr(command_buf
.buf
, ' ') + 1;
1727 str_uq
= unquote_c_style(sp
, &endp
);
1730 die("Garbage after ref in: %s", command_buf
.buf
);
1733 b
= lookup_branch(sp
);
1736 if (b
->branch_tree
.tree
) {
1737 release_tree_content_recursive(b
->branch_tree
.tree
);
1738 b
->branch_tree
.tree
= NULL
;
1745 static const char fast_import_usage
[] =
1746 "git-fast-import [--objects=n] [--depth=n] [--active-branches=n] [--export-marks=marks.file] [--branch-log=log] temp.pack";
1748 int main(int argc
, const char **argv
)
1750 const char *base_name
;
1752 unsigned long est_obj_cnt
= 1000;
1758 git_config(git_default_config
);
1759 page_size
= getpagesize();
1761 for (i
= 1; i
< argc
; i
++) {
1762 const char *a
= argv
[i
];
1764 if (*a
!= '-' || !strcmp(a
, "--"))
1766 else if (!strncmp(a
, "--objects=", 10))
1767 est_obj_cnt
= strtoul(a
+ 10, NULL
, 0);
1768 else if (!strncmp(a
, "--depth=", 8))
1769 max_depth
= strtoul(a
+ 8, NULL
, 0);
1770 else if (!strncmp(a
, "--active-branches=", 18))
1771 max_active_branches
= strtoul(a
+ 18, NULL
, 0);
1772 else if (!strncmp(a
, "--export-marks=", 15))
1774 else if (!strncmp(a
, "--branch-log=", 13)) {
1775 branch_log
= fopen(a
+ 13, "w");
1777 die("Can't create %s: %s", a
+ 13, strerror(errno
));
1780 die("unknown option %s", a
);
1783 usage(fast_import_usage
);
1784 base_name
= argv
[i
];
1786 pack_name
= xmalloc(strlen(base_name
) + 6);
1787 sprintf(pack_name
, "%s.pack", base_name
);
1788 idx_name
= xmalloc(strlen(base_name
) + 5);
1789 sprintf(idx_name
, "%s.idx", base_name
);
1791 pack_fd
= open(pack_name
, O_RDWR
|O_CREAT
|O_EXCL
, 0666);
1793 die("Can't create %s: %s", pack_name
, strerror(errno
));
1796 alloc_objects(est_obj_cnt
);
1797 strbuf_init(&command_buf
);
1799 atom_table
= xcalloc(atom_table_sz
, sizeof(struct atom_str
*));
1800 branch_table
= xcalloc(branch_table_sz
, sizeof(struct branch
*));
1801 avail_tree_table
= xcalloc(avail_tree_table_sz
, sizeof(struct avail_tree_content
*));
1802 marks
= pool_calloc(1, sizeof(struct mark_set
));
1805 read_next_command();
1806 if (command_buf
.eof
)
1808 else if (!strcmp("blob", command_buf
.buf
))
1810 else if (!strncmp("commit ", command_buf
.buf
, 7))
1812 else if (!strncmp("tag ", command_buf
.buf
, 4))
1814 else if (!strncmp("reset ", command_buf
.buf
, 6))
1817 die("Unsupported command: %s", command_buf
.buf
);
1820 fixup_header_footer();
1822 write_index(idx_name
);
1829 fprintf(stderr
, "%s statistics:\n", argv
[0]);
1830 fprintf(stderr
, "---------------------------------------------------\n");
1831 fprintf(stderr
, "Alloc'd objects: %10lu (%10lu overflow )\n", alloc_count
, alloc_count
- est_obj_cnt
);
1832 fprintf(stderr
, "Total objects: %10lu (%10lu duplicates)\n", object_count
, duplicate_count
);
1833 fprintf(stderr
, " blobs : %10lu (%10lu duplicates %10lu deltas)\n", object_count_by_type
[OBJ_BLOB
], duplicate_count_by_type
[OBJ_BLOB
], delta_count_by_type
[OBJ_BLOB
]);
1834 fprintf(stderr
, " trees : %10lu (%10lu duplicates %10lu deltas)\n", object_count_by_type
[OBJ_TREE
], duplicate_count_by_type
[OBJ_TREE
], delta_count_by_type
[OBJ_TREE
]);
1835 fprintf(stderr
, " commits: %10lu (%10lu duplicates %10lu deltas)\n", object_count_by_type
[OBJ_COMMIT
], duplicate_count_by_type
[OBJ_COMMIT
], delta_count_by_type
[OBJ_COMMIT
]);
1836 fprintf(stderr
, " tags : %10lu (%10lu duplicates %10lu deltas)\n", object_count_by_type
[OBJ_TAG
], duplicate_count_by_type
[OBJ_TAG
], delta_count_by_type
[OBJ_TAG
]);
1837 fprintf(stderr
, "Total branches: %10lu (%10lu loads )\n", branch_count
, branch_load_count
);
1838 fprintf(stderr
, " marks: %10u (%10lu unique )\n", (1 << marks
->shift
) * 1024, marks_set_count
);
1839 fprintf(stderr
, " atoms: %10u\n", atom_cnt
);
1840 fprintf(stderr
, "Memory total: %10lu KiB\n", (total_allocd
+ alloc_count
*sizeof(struct object_entry
))/1024);
1841 fprintf(stderr
, " pools: %10lu KiB\n", total_allocd
/1024);
1842 fprintf(stderr
, " objects: %10lu KiB\n", (alloc_count
*sizeof(struct object_entry
))/1024);
1843 fprintf(stderr
, "Pack remaps: %10lu\n", remap_count
);
1844 fprintf(stderr
, "---------------------------------------------------\n");
1846 stat(pack_name
, &sb
);
1847 fprintf(stderr
, "Pack size: %10lu KiB\n", (unsigned long)(sb
.st_size
/1024));
1848 stat(idx_name
, &sb
);
1849 fprintf(stderr
, "Index size: %10lu KiB\n", (unsigned long)(sb
.st_size
/1024));
1851 fprintf(stderr
, "\n");