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