]>
git.ipfire.org Git - thirdparty/git.git/blob - fast-import.c
2953e80cde573ffe461e7917b47c576f74e04612
2 Format of STDIN stream:
12 new_blob ::= 'blob' lf
15 file_content ::= data;
17 new_branch ::= 'branch' sp ref_str lf
18 ('from' sp (ref_str | hexsha1 | sha1exp_str | idnum) lf)?
21 new_commit ::= 'commit' sp ref_str lf
23 ('author' sp name '<' email '>' ts tz lf)?
24 'committer' sp name '<' email '>' ts tz lf
30 file_change ::= 'M' sp mode sp (hexsha1 | idnum) sp path_str lf
33 mode ::= '644' | '755';
35 new_tag ::= 'tag' sp tag_str lf
36 'from' sp (ref_str | hexsha1 | sha1exp_str | idnum) lf
37 'tagger' sp name '<' email '>' ts tz lf
41 # note: the first idnum in a stream should be 1 and subsequent
42 # idnums should not have gaps between values as this will cause
43 # the stream parser to reserve space for the gapped values. An
44 # idnum can be updated in the future to a new object by issuing
45 # a new mark directive with the old idnum.
47 mark ::= 'mark' sp idnum lf;
49 # note: declen indicates the length of binary_data in bytes.
50 # declen does not include the lf preceeding or trailing the
53 data ::= 'data' sp declen lf
57 # note: quoted strings are C-style quoting supporting \c for
58 # common escapes of 'c' (e..g \n, \t, \\, \") or \nnn where nnn
59 # is the signed byte value in octal. Note that the only
60 # characters which must actually be escaped to protect the
61 # stream formatting is: \, " and LF. Otherwise these values
64 ref_str ::= ref | '"' quoted(ref) '"' ;
65 sha1exp_str ::= sha1exp | '"' quoted(sha1exp) '"' ;
66 tag_str ::= tag | '"' quoted(tag) '"' ;
67 path_str ::= path | '"' quoted(path) '"' ;
69 declen ::= # unsigned 32 bit value, ascii base10 notation;
70 binary_data ::= # file content, not interpreted;
72 sp ::= # ASCII space character;
73 lf ::= # ASCII newline (LF) character;
75 # note: a colon (':') must precede the numerical value assigned to
76 # an idnum. This is to distinguish it from a ref or tag name as
77 # GIT does not permit ':' in ref or tag strings.
80 path ::= # GIT style file path, e.g. "a/b/c";
81 ref ::= # GIT ref name, e.g. "refs/heads/MOZ_GECKO_EXPERIMENT";
82 tag ::= # GIT tag name, e.g. "FIREFOX_1_5";
83 sha1exp ::= # Any valid GIT SHA1 expression;
84 hexsha1 ::= # SHA1 in hexadecimal format;
86 # note: name and email are UTF8 strings, however name must not
87 # contain '<' or lf and email must not contain any of the
88 # following: '<', '>', lf.
90 name ::= # valid GIT author/committer name;
91 email ::= # valid GIT author/committer email;
92 ts ::= # time since the epoch in seconds, ascii base10 notation;
93 tz ::= # GIT style timezone;
104 #include "csum-file.h"
110 struct object_entry
*next
;
111 enum object_type type
;
112 unsigned long offset
;
113 unsigned char sha1
[20];
116 struct object_entry_pool
118 struct object_entry_pool
*next_pool
;
119 struct object_entry
*next_free
;
120 struct object_entry
*end
;
121 struct object_entry entries
[FLEX_ARRAY
]; /* more */
129 unsigned char sha1
[20];
134 struct mem_pool
*next_pool
;
137 char space
[FLEX_ARRAY
]; /* more */
142 struct atom_str
*next_atom
;
144 char str_dat
[FLEX_ARRAY
]; /* more */
150 struct tree_content
*tree
;
151 struct atom_str
* name
;
153 unsigned char sha1
[20];
158 unsigned int entry_capacity
; /* must match avail_tree_content */
159 unsigned int entry_count
;
160 struct tree_entry
*entries
[FLEX_ARRAY
]; /* more */
163 struct avail_tree_content
165 unsigned int entry_capacity
; /* must match tree_content */
166 struct avail_tree_content
*next_avail
;
171 struct branch
*table_next_branch
;
172 struct branch
*active_next_branch
;
174 unsigned long last_commit
;
175 struct tree_entry branch_tree
;
176 unsigned char sha1
[20];
180 /* Stats and misc. counters */
181 static int max_depth
= 10;
182 static unsigned long alloc_count
;
183 static unsigned long branch_count
;
184 static unsigned long object_count
;
185 static unsigned long duplicate_count
;
186 static unsigned long object_count_by_type
[9];
187 static unsigned long duplicate_count_by_type
[9];
190 static size_t mem_pool_alloc
= 2*1024*1024 - sizeof(struct mem_pool
);
191 static size_t total_allocd
;
192 static struct mem_pool
*mem_pool
;
194 /* Atom management */
195 static unsigned int atom_table_sz
= 4451;
196 static unsigned int atom_cnt
;
197 static struct atom_str
**atom_table
;
199 /* The .pack file being generated */
201 static unsigned long pack_offset
;
202 static unsigned char pack_sha1
[20];
204 /* Table of objects we've written. */
205 static unsigned int object_entry_alloc
= 1000;
206 static struct object_entry_pool
*blocks
;
207 static struct object_entry
*object_table
[1 << 16];
210 static struct last_object last_blob
;
212 /* Tree management */
213 static unsigned int tree_entry_alloc
= 1000;
214 static void *avail_tree_entry
;
215 static unsigned int avail_tree_table_sz
= 100;
216 static struct avail_tree_content
**avail_tree_table
;
219 static unsigned int max_active_branches
= 5;
220 static unsigned int cur_active_branches
;
221 static unsigned int branch_table_sz
= 1039;
222 static struct branch
**branch_table
;
223 static struct branch
*active_branches
;
225 /* Input stream parsing */
226 static struct strbuf command_buf
;
227 static unsigned long command_mark
;
230 static void alloc_objects(int cnt
)
232 struct object_entry_pool
*b
;
234 b
= xmalloc(sizeof(struct object_entry_pool
)
235 + cnt
* sizeof(struct object_entry
));
236 b
->next_pool
= blocks
;
237 b
->next_free
= b
->entries
;
238 b
->end
= b
->entries
+ cnt
;
243 static struct object_entry
* new_object(unsigned char *sha1
)
245 struct object_entry
*e
;
247 if (blocks
->next_free
== blocks
->end
)
248 alloc_objects(object_entry_alloc
);
250 e
= blocks
->next_free
++;
251 memcpy(e
->sha1
, sha1
, sizeof(e
->sha1
));
255 static struct object_entry
* find_object(unsigned char *sha1
)
257 unsigned int h
= sha1
[0] << 8 | sha1
[1];
258 struct object_entry
*e
;
259 for (e
= object_table
[h
]; e
; e
= e
->next
)
260 if (!memcmp(sha1
, e
->sha1
, sizeof(e
->sha1
)))
265 static struct object_entry
* insert_object(unsigned char *sha1
)
267 unsigned int h
= sha1
[0] << 8 | sha1
[1];
268 struct object_entry
*e
= object_table
[h
];
269 struct object_entry
*p
= NULL
;
272 if (!memcmp(sha1
, e
->sha1
, sizeof(e
->sha1
)))
278 e
= new_object(sha1
);
288 static unsigned int hc_str(const char *s
, size_t len
)
296 static void* pool_alloc(size_t len
)
301 for (p
= mem_pool
; p
; p
= p
->next_pool
)
302 if ((p
->end
- p
->next_free
>= len
))
306 if (len
>= (mem_pool_alloc
/2)) {
310 total_allocd
+= sizeof(struct mem_pool
) + mem_pool_alloc
;
311 p
= xmalloc(sizeof(struct mem_pool
) + mem_pool_alloc
);
312 p
->next_pool
= mem_pool
;
313 p
->next_free
= p
->space
;
314 p
->end
= p
->next_free
+ mem_pool_alloc
;
323 static void* pool_calloc(size_t count
, size_t size
)
325 size_t len
= count
* size
;
326 void *r
= pool_alloc(len
);
331 static char* pool_strdup(const char *s
)
333 char *r
= pool_alloc(strlen(s
) + 1);
338 static struct atom_str
* to_atom(const char *s
, size_t len
)
340 unsigned int hc
= hc_str(s
, len
) % atom_table_sz
;
343 for (c
= atom_table
[hc
]; c
; c
= c
->next_atom
)
344 if (c
->str_len
== len
&& !strncmp(s
, c
->str_dat
, len
))
347 c
= pool_alloc(sizeof(struct atom_str
) + len
+ 1);
349 strncpy(c
->str_dat
, s
, len
);
351 c
->next_atom
= atom_table
[hc
];
357 static struct branch
* lookup_branch(const char *name
)
359 unsigned int hc
= hc_str(name
, strlen(name
)) % branch_table_sz
;
362 for (b
= branch_table
[hc
]; b
; b
= b
->table_next_branch
)
363 if (!strcmp(name
, b
->name
))
368 static struct branch
* new_branch(const char *name
)
370 unsigned int hc
= hc_str(name
, strlen(name
)) % branch_table_sz
;
371 struct branch
* b
= lookup_branch(name
);
374 die("Invalid attempt to create duplicate branch: %s", name
);
375 if (check_ref_format(name
))
376 die("Branch name doesn't conform to GIT standards: %s", name
);
378 b
= pool_calloc(1, sizeof(struct branch
));
379 b
->name
= pool_strdup(name
);
380 b
->table_next_branch
= branch_table
[hc
];
381 branch_table
[hc
] = b
;
386 static unsigned int hc_entries(unsigned int cnt
)
388 cnt
= cnt
& 7 ? (cnt
/ 8) + 1 : cnt
/ 8;
389 return cnt
< avail_tree_table_sz
? cnt
: avail_tree_table_sz
- 1;
392 static struct tree_content
* new_tree_content(unsigned int cnt
)
394 struct avail_tree_content
*f
, *l
= NULL
;
395 struct tree_content
*t
;
396 unsigned int hc
= hc_entries(cnt
);
398 for (f
= avail_tree_table
[hc
]; f
; l
= f
, f
= f
->next_avail
)
399 if (f
->entry_capacity
>= cnt
)
404 l
->next_avail
= f
->next_avail
;
406 avail_tree_table
[hc
] = f
->next_avail
;
408 cnt
= cnt
& 7 ? ((cnt
/ 8) + 1) * 8 : cnt
;
409 f
= pool_alloc(sizeof(*t
) + sizeof(t
->entries
[0]) * cnt
);
410 f
->entry_capacity
= cnt
;
413 t
= (struct tree_content
*)f
;
418 static void release_tree_entry(struct tree_entry
*e
);
419 static void release_tree_content(struct tree_content
*t
)
421 struct avail_tree_content
*f
= (struct avail_tree_content
*)t
;
422 unsigned int hc
= hc_entries(f
->entry_capacity
);
424 for (i
= 0; i
< t
->entry_count
; i
++)
425 release_tree_entry(t
->entries
[i
]);
426 f
->next_avail
= avail_tree_table
[hc
];
427 avail_tree_table
[hc
] = f
;
430 static struct tree_content
* grow_tree_content(
431 struct tree_content
*t
,
434 struct tree_content
*r
= new_tree_content(t
->entry_count
+ amt
);
435 r
->entry_count
= t
->entry_count
;
436 memcpy(r
->entries
,t
->entries
,t
->entry_count
*sizeof(t
->entries
[0]));
437 release_tree_content(t
);
441 static struct tree_entry
* new_tree_entry()
443 struct tree_entry
*e
;
445 if (!avail_tree_entry
) {
446 unsigned int n
= tree_entry_alloc
;
447 avail_tree_entry
= e
= xmalloc(n
* sizeof(struct tree_entry
));
449 *((void**)e
) = e
+ 1;
454 e
= avail_tree_entry
;
455 avail_tree_entry
= *((void**)e
);
459 static void release_tree_entry(struct tree_entry
*e
)
462 release_tree_content(e
->tree
);
463 *((void**)e
) = avail_tree_entry
;
464 avail_tree_entry
= e
;
467 static void yread(int fd
, void *buffer
, size_t length
)
470 while (ret
< length
) {
471 ssize_t size
= xread(fd
, (char *) buffer
+ ret
, length
- ret
);
473 die("Read from descriptor %i: end of stream", fd
);
475 die("Read from descriptor %i: %s", fd
, strerror(errno
));
480 static void ywrite(int fd
, void *buffer
, size_t length
)
483 while (ret
< length
) {
484 ssize_t size
= xwrite(fd
, (char *) buffer
+ ret
, length
- ret
);
486 die("Write to descriptor %i: end of file", fd
);
488 die("Write to descriptor %i: %s", fd
, strerror(errno
));
493 static size_t encode_header(
494 enum object_type type
,
501 if (type
< OBJ_COMMIT
|| type
> OBJ_DELTA
)
502 die("bad type %d", type
);
504 c
= (type
<< 4) | (size
& 15);
516 static int store_object(
517 enum object_type type
,
520 struct last_object
*last
,
521 unsigned char *sha1out
)
524 struct object_entry
*e
;
525 unsigned char hdr
[96];
526 unsigned char sha1
[20];
527 unsigned long hdrlen
, deltalen
;
531 hdrlen
= sprintf((char*)hdr
,"%s %lu",type_names
[type
],datlen
) + 1;
533 SHA1_Update(&c
, hdr
, hdrlen
);
534 SHA1_Update(&c
, dat
, datlen
);
535 SHA1_Final(sha1
, &c
);
537 memcpy(sha1out
, sha1
, sizeof(sha1
));
539 e
= insert_object(sha1
);
542 duplicate_count_by_type
[type
]++;
546 e
->offset
= pack_offset
;
548 object_count_by_type
[type
]++;
550 if (last
&& last
->data
&& last
->depth
< max_depth
)
551 delta
= diff_delta(last
->data
, last
->len
,
557 memset(&s
, 0, sizeof(s
));
558 deflateInit(&s
, zlib_compression_level
);
563 s
.avail_in
= deltalen
;
564 hdrlen
= encode_header(OBJ_DELTA
, deltalen
, hdr
);
565 ywrite(pack_fd
, hdr
, hdrlen
);
566 ywrite(pack_fd
, last
->sha1
, sizeof(sha1
));
567 pack_offset
+= hdrlen
+ sizeof(sha1
);
573 hdrlen
= encode_header(type
, datlen
, hdr
);
574 ywrite(pack_fd
, hdr
, hdrlen
);
575 pack_offset
+= hdrlen
;
578 s
.avail_out
= deflateBound(&s
, s
.avail_in
);
579 s
.next_out
= out
= xmalloc(s
.avail_out
);
580 while (deflate(&s
, Z_FINISH
) == Z_OK
)
584 ywrite(pack_fd
, out
, s
.total_out
);
585 pack_offset
+= s
.total_out
;
595 memcpy(last
->sha1
, sha1
, sizeof(sha1
));
600 static const char *get_mode(const char *str
, unsigned int *modep
)
603 unsigned int mode
= 0;
605 while ((c
= *str
++) != ' ') {
606 if (c
< '0' || c
> '7')
608 mode
= (mode
<< 3) + (c
- '0');
614 static void load_tree(struct tree_entry
*root
)
616 struct object_entry
*myoe
;
617 struct tree_content
*t
;
623 root
->tree
= t
= new_tree_content(8);
624 if (!memcmp(root
->sha1
, null_sha1
, 20))
627 myoe
= find_object(root
->sha1
);
631 buf
= read_sha1_file(root
->sha1
, type
, &size
);
632 if (!buf
|| strcmp(type
, tree_type
))
633 die("Can't load existing tree %s", sha1_to_hex(root
->sha1
));
637 while (c
!= (buf
+ size
)) {
638 struct tree_entry
*e
= new_tree_entry();
640 if (t
->entry_count
== t
->entry_capacity
)
641 root
->tree
= t
= grow_tree_content(t
, 8);
642 t
->entries
[t
->entry_count
++] = e
;
645 c
= get_mode(c
, &e
->mode
);
647 die("Corrupt mode in %s", sha1_to_hex(root
->sha1
));
648 e
->name
= to_atom(c
, strlen(c
));
649 c
+= e
->name
->str_len
+ 1;
650 memcpy(e
->sha1
, c
, sizeof(e
->sha1
));
656 static int tecmp (const void *_a
, const void *_b
)
658 struct tree_entry
*a
= *((struct tree_entry
**)_a
);
659 struct tree_entry
*b
= *((struct tree_entry
**)_b
);
660 return base_name_compare(
661 a
->name
->str_dat
, a
->name
->str_len
, a
->mode
,
662 b
->name
->str_dat
, b
->name
->str_len
, b
->mode
);
665 static void store_tree(struct tree_entry
*root
)
667 struct tree_content
*t
= root
->tree
;
672 if (memcmp(root
->sha1
, null_sha1
, 20))
676 for (i
= 0; i
< t
->entry_count
; i
++) {
677 maxlen
+= t
->entries
[i
]->name
->str_len
+ 34;
678 if (t
->entries
[i
]->tree
)
679 store_tree(t
->entries
[i
]);
682 qsort(t
->entries
, t
->entry_count
, sizeof(t
->entries
[0]), tecmp
);
683 buf
= c
= xmalloc(maxlen
);
684 for (i
= 0; i
< t
->entry_count
; i
++) {
685 struct tree_entry
*e
= t
->entries
[i
];
686 c
+= sprintf(c
, "%o", e
->mode
);
688 strcpy(c
, e
->name
->str_dat
);
689 c
+= e
->name
->str_len
+ 1;
690 memcpy(c
, e
->sha1
, 20);
693 store_object(OBJ_TREE
, buf
, c
- buf
, NULL
, root
->sha1
);
697 static int tree_content_set(
698 struct tree_entry
*root
,
700 const unsigned char *sha1
,
701 const unsigned int mode
)
703 struct tree_content
*t
= root
->tree
;
706 struct tree_entry
*e
;
708 slash1
= strchr(p
, '/');
714 for (i
= 0; i
< t
->entry_count
; i
++) {
716 if (e
->name
->str_len
== n
&& !strncmp(p
, e
->name
->str_dat
, n
)) {
718 if (e
->mode
== mode
&& !memcmp(e
->sha1
, sha1
, 20))
721 memcpy(e
->sha1
, sha1
, 20);
723 release_tree_content(e
->tree
);
726 memcpy(root
->sha1
, null_sha1
, 20);
729 if (!S_ISDIR(e
->mode
)) {
730 e
->tree
= new_tree_content(8);
735 if (tree_content_set(e
, slash1
+ 1, sha1
, mode
)) {
736 memcpy(root
->sha1
, null_sha1
, 20);
743 if (t
->entry_count
== t
->entry_capacity
)
744 root
->tree
= t
= grow_tree_content(t
, 8);
745 e
= new_tree_entry();
746 e
->name
= to_atom(p
, n
);
747 t
->entries
[t
->entry_count
++] = e
;
749 e
->tree
= new_tree_content(8);
751 tree_content_set(e
, slash1
+ 1, sha1
, mode
);
755 memcpy(e
->sha1
, sha1
, 20);
757 memcpy(root
->sha1
, null_sha1
, 20);
761 static int tree_content_remove(struct tree_entry
*root
, const char *p
)
763 struct tree_content
*t
= root
->tree
;
766 struct tree_entry
*e
;
768 slash1
= strchr(p
, '/');
774 for (i
= 0; i
< t
->entry_count
; i
++) {
776 if (e
->name
->str_len
== n
&& !strncmp(p
, e
->name
->str_dat
, n
)) {
777 if (!slash1
|| !S_ISDIR(e
->mode
))
781 if (tree_content_remove(e
, slash1
+ 1)) {
782 if (!e
->tree
->entry_count
)
784 memcpy(root
->sha1
, null_sha1
, 20);
793 for (i
++; i
< t
->entry_count
; i
++)
794 t
->entries
[i
-1] = t
->entries
[i
];
796 release_tree_entry(e
);
797 memcpy(root
->sha1
, null_sha1
, 20);
801 static void init_pack_header()
803 const char* magic
= "PACK";
804 unsigned long version
= 3;
805 unsigned long zero
= 0;
807 version
= htonl(version
);
808 ywrite(pack_fd
, (char*)magic
, 4);
809 ywrite(pack_fd
, &version
, 4);
810 ywrite(pack_fd
, &zero
, 4);
814 static void fixup_header_footer()
822 if (lseek(pack_fd
, 0, SEEK_SET
) != 0)
823 die("Failed seeking to start: %s", strerror(errno
));
826 yread(pack_fd
, hdr
, 8);
827 SHA1_Update(&c
, hdr
, 8);
829 cnt
= htonl(object_count
);
830 SHA1_Update(&c
, &cnt
, 4);
831 ywrite(pack_fd
, &cnt
, 4);
833 buf
= xmalloc(128 * 1024);
835 n
= xread(pack_fd
, buf
, 128 * 1024);
838 SHA1_Update(&c
, buf
, n
);
842 SHA1_Final(pack_sha1
, &c
);
843 ywrite(pack_fd
, pack_sha1
, sizeof(pack_sha1
));
846 static int oecmp (const void *_a
, const void *_b
)
848 struct object_entry
*a
= *((struct object_entry
**)_a
);
849 struct object_entry
*b
= *((struct object_entry
**)_b
);
850 return memcmp(a
->sha1
, b
->sha1
, sizeof(a
->sha1
));
853 static void write_index(const char *idx_name
)
856 struct object_entry
**idx
, **c
, **last
;
857 struct object_entry
*e
;
858 struct object_entry_pool
*o
;
859 unsigned int array
[256];
862 /* Build the sorted table of object IDs. */
863 idx
= xmalloc(object_count
* sizeof(struct object_entry
*));
865 for (o
= blocks
; o
; o
= o
->next_pool
)
866 for (e
= o
->entries
; e
!= o
->next_free
; e
++)
868 last
= idx
+ object_count
;
869 qsort(idx
, object_count
, sizeof(struct object_entry
*), oecmp
);
871 /* Generate the fan-out array. */
873 for (i
= 0; i
< 256; i
++) {
874 struct object_entry
**next
= c
;;
875 while (next
< last
) {
876 if ((*next
)->sha1
[0] != i
)
880 array
[i
] = htonl(next
- idx
);
884 f
= sha1create("%s", idx_name
);
885 sha1write(f
, array
, 256 * sizeof(int));
886 for (c
= idx
; c
!= last
; c
++) {
887 unsigned int offset
= htonl((*c
)->offset
);
888 sha1write(f
, &offset
, 4);
889 sha1write(f
, (*c
)->sha1
, sizeof((*c
)->sha1
));
891 sha1write(f
, pack_sha1
, sizeof(pack_sha1
));
892 sha1close(f
, NULL
, 1);
896 static void dump_branches()
898 static const char *msg
= "fast-import";
901 struct ref_lock
*lock
;
903 for (i
= 0; i
< branch_table_sz
; i
++) {
904 for (b
= branch_table
[i
]; b
; b
= b
->table_next_branch
) {
905 lock
= lock_any_ref_for_update(b
->name
, NULL
, 0);
906 if (!lock
|| write_ref_sha1(lock
, b
->sha1
, msg
) < 0)
907 die("Can't write %s", b
->name
);
912 static void read_next_command()
914 read_line(&command_buf
, stdin
, '\n');
917 static void cmd_mark()
919 if (!strncmp("mark :", command_buf
.buf
, 6)) {
920 command_mark
= strtoul(command_buf
.buf
+ 6, NULL
, 10);
927 static void* cmd_data (size_t *size
)
933 if (strncmp("data ", command_buf
.buf
, 5))
934 die("Expected 'data n' command, found: %s", command_buf
.buf
);
936 length
= strtoul(command_buf
.buf
+ 5, NULL
, 10);
937 buffer
= xmalloc(length
);
940 size_t s
= fread((char*)buffer
+ n
, 1, length
- n
, stdin
);
941 if (!s
&& feof(stdin
))
942 die("EOF in data (%lu bytes remaining)", length
- n
);
946 if (fgetc(stdin
) != '\n')
947 die("An lf did not trail the binary data as expected.");
953 static void cmd_new_blob()
957 unsigned char sha1
[20];
961 dat
= cmd_data(&datlen
);
963 if (store_object(OBJ_BLOB
, dat
, datlen
, &last_blob
, sha1
))
967 static void unload_one_branch()
969 while (cur_active_branches
>= max_active_branches
) {
970 unsigned long min_commit
= ULONG_MAX
;
971 struct branch
*e
, *l
= NULL
, *p
= NULL
;
973 for (e
= active_branches
; e
; e
= e
->active_next_branch
) {
974 if (e
->last_commit
< min_commit
) {
976 min_commit
= e
->last_commit
;
982 e
= p
->active_next_branch
;
983 p
->active_next_branch
= e
->active_next_branch
;
986 active_branches
= e
->active_next_branch
;
988 e
->active_next_branch
= NULL
;
989 if (e
->branch_tree
.tree
) {
990 release_tree_content(e
->branch_tree
.tree
);
991 e
->branch_tree
.tree
= NULL
;
993 cur_active_branches
--;
997 static void load_branch(struct branch
*b
)
999 load_tree(&b
->branch_tree
);
1000 b
->active_next_branch
= active_branches
;
1001 active_branches
= b
;
1002 cur_active_branches
++;
1005 static void file_change_m(struct branch
*b
)
1007 const char *p
= command_buf
.buf
+ 2;
1010 struct object_entry
*oe
;
1011 unsigned char sha1
[20];
1015 p
= get_mode(p
, &mode
);
1017 die("Corrupt mode: %s", command_buf
.buf
);
1019 case S_IFREG
| 0644:
1020 case S_IFREG
| 0755:
1026 die("Corrupt mode: %s", command_buf
.buf
);
1029 if (get_sha1_hex(p
, sha1
))
1030 die("Invalid SHA1: %s", command_buf
.buf
);
1033 die("Missing space after SHA1: %s", command_buf
.buf
);
1035 p_uq
= unquote_c_style(p
, &endp
);
1038 die("Garbage after path in: %s", command_buf
.buf
);
1042 oe
= find_object(sha1
);
1044 if (oe
->type
!= OBJ_BLOB
)
1045 die("Not a blob (actually a %s): %s",
1046 command_buf
.buf
, type_names
[oe
->type
]);
1048 if (sha1_object_info(sha1
, type
, NULL
))
1049 die("Blob not found: %s", command_buf
.buf
);
1050 if (strcmp(blob_type
, type
))
1051 die("Not a blob (actually a %s): %s",
1052 command_buf
.buf
, type
);
1055 tree_content_set(&b
->branch_tree
, p
, sha1
, S_IFREG
| mode
);
1061 static void file_change_d(struct branch
*b
)
1063 const char *p
= command_buf
.buf
+ 2;
1067 p_uq
= unquote_c_style(p
, &endp
);
1070 die("Garbage after path in: %s", command_buf
.buf
);
1073 tree_content_remove(&b
->branch_tree
, p
);
1078 static void cmd_new_commit()
1086 char *author
= NULL
;
1087 char *committer
= NULL
;
1090 /* Obtain the branch name from the rest of our command */
1091 sp
= strchr(command_buf
.buf
, ' ') + 1;
1092 str_uq
= unquote_c_style(sp
, &endp
);
1095 die("Garbage after ref in: %s", command_buf
.buf
);
1098 b
= lookup_branch(sp
);
1100 die("Branch not declared: %s", sp
);
1104 read_next_command();
1106 if (!strncmp("author ", command_buf
.buf
, 7)) {
1107 author
= strdup(command_buf
.buf
);
1108 read_next_command();
1110 if (!strncmp("committer ", command_buf
.buf
, 10)) {
1111 committer
= strdup(command_buf
.buf
);
1112 read_next_command();
1115 die("Expected committer but didn't get one");
1116 msg
= cmd_data(&msglen
);
1118 /* ensure the branch is active/loaded */
1119 if (!b
->branch_tree
.tree
) {
1120 unload_one_branch();
1126 read_next_command();
1127 if (1 == command_buf
.len
)
1129 else if (!strncmp("M ", command_buf
.buf
, 2))
1131 else if (!strncmp("D ", command_buf
.buf
, 2))
1134 die("Unsupported file_change: %s", command_buf
.buf
);
1137 /* build the tree and the commit */
1138 store_tree(&b
->branch_tree
);
1139 body
= xmalloc(97 + msglen
1141 ? strlen(author
) + strlen(committer
)
1142 : 2 * strlen(committer
)));
1144 sp
+= sprintf(sp
, "tree %s\n", sha1_to_hex(b
->branch_tree
.sha1
));
1145 if (memcmp(b
->sha1
, null_sha1
, 20))
1146 sp
+= sprintf(sp
, "parent %s\n", sha1_to_hex(b
->sha1
));
1148 sp
+= sprintf(sp
, "%s\n", author
);
1150 sp
+= sprintf(sp
, "author %s\n", committer
+ 10);
1151 sp
+= sprintf(sp
, "%s\n\n", committer
);
1152 memcpy(sp
, msg
, msglen
);
1159 store_object(OBJ_COMMIT
, body
, sp
- body
, NULL
, b
->sha1
);
1161 b
->last_commit
= object_count_by_type
[OBJ_COMMIT
];
1164 static void cmd_new_branch()
1171 /* Obtain the new branch name from the rest of our command */
1172 sp
= strchr(command_buf
.buf
, ' ') + 1;
1173 str_uq
= unquote_c_style(sp
, &endp
);
1176 die("Garbage after ref in: %s", command_buf
.buf
);
1182 read_next_command();
1185 if (!strncmp("from ", command_buf
.buf
, 5)) {
1189 from
= strchr(command_buf
.buf
, ' ') + 1;
1190 str_uq
= unquote_c_style(from
, &endp
);
1193 die("Garbage after string in: %s", command_buf
.buf
);
1197 s
= lookup_branch(from
);
1199 die("Can't create a branch from itself: %s", b
->name
);
1201 memcpy(b
->sha1
, s
->sha1
, 20);
1202 memcpy(b
->branch_tree
.sha1
, s
->branch_tree
.sha1
, 20);
1203 } else if (!get_sha1(from
, b
->sha1
)) {
1204 if (!memcmp(b
->sha1
, null_sha1
, 20))
1205 memcpy(b
->branch_tree
.sha1
, null_sha1
, 20);
1210 buf
= read_object_with_reference(b
->sha1
,
1211 type_names
[OBJ_COMMIT
], &size
, b
->sha1
);
1212 if (!buf
|| size
< 46)
1213 die("Not a valid commit: %s", from
);
1214 if (memcmp("tree ", buf
, 5)
1215 || get_sha1_hex(buf
+ 5, b
->branch_tree
.sha1
))
1216 die("The commit %s is corrupt", sha1_to_hex(b
->sha1
));
1220 die("Invalid ref name or SHA1 expression: %s", from
);
1224 read_next_command();
1226 memcpy(b
->sha1
, null_sha1
, 20);
1227 memcpy(b
->branch_tree
.sha1
, null_sha1
, 20);
1230 if (command_buf
.eof
|| command_buf
.len
> 1)
1231 die("An lf did not terminate the branch command as expected.");
1234 int main(int argc
, const char **argv
)
1236 const char *base_name
= argv
[1];
1237 int est_obj_cnt
= atoi(argv
[2]);
1243 git_config(git_default_config
);
1245 pack_name
= xmalloc(strlen(base_name
) + 6);
1246 sprintf(pack_name
, "%s.pack", base_name
);
1247 idx_name
= xmalloc(strlen(base_name
) + 5);
1248 sprintf(idx_name
, "%s.idx", base_name
);
1250 pack_fd
= open(pack_name
, O_RDWR
|O_CREAT
|O_EXCL
, 0666);
1252 die("Can't create %s: %s", pack_name
, strerror(errno
));
1255 alloc_objects(est_obj_cnt
);
1256 strbuf_init(&command_buf
);
1258 atom_table
= xcalloc(atom_table_sz
, sizeof(struct atom_str
*));
1259 branch_table
= xcalloc(branch_table_sz
, sizeof(struct branch
*));
1260 avail_tree_table
= xcalloc(avail_tree_table_sz
, sizeof(struct avail_tree_content
*));
1263 read_next_command();
1264 if (command_buf
.eof
)
1266 else if (!strcmp("blob", command_buf
.buf
))
1268 else if (!strncmp("branch ", command_buf
.buf
, 7))
1270 else if (!strncmp("commit ", command_buf
.buf
, 7))
1273 die("Unsupported command: %s", command_buf
.buf
);
1276 fixup_header_footer();
1278 write_index(idx_name
);
1281 fprintf(stderr
, "%s statistics:\n", argv
[0]);
1282 fprintf(stderr
, "---------------------------------------------------\n");
1283 fprintf(stderr
, "Alloc'd objects: %10lu (%10lu overflow )\n", alloc_count
, alloc_count
- est_obj_cnt
);
1284 fprintf(stderr
, "Total objects: %10lu (%10lu duplicates)\n", object_count
, duplicate_count
);
1285 fprintf(stderr
, " blobs : %10lu (%10lu duplicates)\n", object_count_by_type
[OBJ_BLOB
], duplicate_count_by_type
[OBJ_BLOB
]);
1286 fprintf(stderr
, " trees : %10lu (%10lu duplicates)\n", object_count_by_type
[OBJ_TREE
], duplicate_count_by_type
[OBJ_TREE
]);
1287 fprintf(stderr
, " commits: %10lu (%10lu duplicates)\n", object_count_by_type
[OBJ_COMMIT
], duplicate_count_by_type
[OBJ_COMMIT
]);
1288 fprintf(stderr
, " tags : %10lu (%10lu duplicates)\n", object_count_by_type
[OBJ_TAG
], duplicate_count_by_type
[OBJ_TAG
]);
1289 fprintf(stderr
, "Total branches: %10lu\n", branch_count
);
1290 fprintf(stderr
, "Total atoms: %10u\n", atom_cnt
);
1291 fprintf(stderr
, "Memory total: %10lu KiB\n", (total_allocd
+ alloc_count
*sizeof(struct object_entry
))/1024);
1292 fprintf(stderr
, " pools: %10lu KiB\n", total_allocd
/1024);
1293 fprintf(stderr
, " objects: %10lu KiB\n", (alloc_count
*sizeof(struct object_entry
))/1024);
1294 fprintf(stderr
, "---------------------------------------------------\n");
1296 stat(pack_name
, &sb
);
1297 fprintf(stderr
, "Pack size: %10lu KiB\n", (unsigned long)(sb
.st_size
/1024));
1298 stat(idx_name
, &sb
);
1299 fprintf(stderr
, "Index size: %10lu KiB\n", (unsigned long)(sb
.st_size
/1024));
1301 fprintf(stderr
, "\n");