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