]>
Commit | Line | Data |
---|---|---|
463acbe1 | 1 | /* |
98e1a418 | 2 | (See Documentation/git-fast-import.txt for maintained documentation.) |
463acbe1 SP |
3 | Format of STDIN stream: |
4 | ||
5 | stream ::= cmd*; | |
6 | ||
7 | cmd ::= new_blob | |
c44cdc7e | 8 | | new_commit |
463acbe1 | 9 | | new_tag |
5fced8dc | 10 | | reset_branch |
8c1f22da | 11 | | checkpoint |
ac053c02 | 12 | | progress |
463acbe1 SP |
13 | ; |
14 | ||
c44cdc7e | 15 | new_blob ::= 'blob' lf |
c905e090 | 16 | mark? |
c44cdc7e SP |
17 | file_content; |
18 | file_content ::= data; | |
463acbe1 | 19 | |
c44cdc7e | 20 | new_commit ::= 'commit' sp ref_str lf |
00e2b884 | 21 | mark? |
74fbd118 SP |
22 | ('author' (sp name)? sp '<' email '>' sp when lf)? |
23 | 'committer' (sp name)? sp '<' email '>' sp when lf | |
00e2b884 | 24 | commit_msg |
a8a5406a RH |
25 | ('from' sp commit-ish lf)? |
26 | ('merge' sp commit-ish lf)* | |
8dc6a373 | 27 | (file_change | ls)* |
1fdb649c | 28 | lf?; |
c44cdc7e | 29 | commit_msg ::= data; |
463acbe1 | 30 | |
8dc6a373 DB |
31 | ls ::= 'ls' sp '"' quoted(path) '"' lf; |
32 | ||
b6f3481b SP |
33 | file_change ::= file_clr |
34 | | file_del | |
35 | | file_rnm | |
36 | | file_cpy | |
37 | | file_obm | |
38 | | file_inm; | |
825769a8 | 39 | file_clr ::= 'deleteall' lf; |
b715cfbb | 40 | file_del ::= 'D' sp path_str lf; |
f39a946a | 41 | file_rnm ::= 'R' sp path_str sp path_str lf; |
b6f3481b | 42 | file_cpy ::= 'C' sp path_str sp path_str lf; |
b715cfbb SP |
43 | file_obm ::= 'M' sp mode sp (hexsha1 | idnum) sp path_str lf; |
44 | file_inm ::= 'M' sp mode sp 'inline' sp path_str lf | |
45 | data; | |
a8a5406a RH |
46 | note_obm ::= 'N' sp (hexsha1 | idnum) sp commit-ish lf; |
47 | note_inm ::= 'N' sp 'inline' sp commit-ish lf | |
a8dd2e7d | 48 | data; |
c44cdc7e SP |
49 | |
50 | new_tag ::= 'tag' sp tag_str lf | |
a8a5406a | 51 | 'from' sp commit-ish lf |
74fbd118 | 52 | ('tagger' (sp name)? sp '<' email '>' sp when lf)? |
c44cdc7e SP |
53 | tag_msg; |
54 | tag_msg ::= data; | |
55 | ||
9938ffc5 | 56 | reset_branch ::= 'reset' sp ref_str lf |
a8a5406a | 57 | ('from' sp commit-ish lf)? |
1fdb649c | 58 | lf?; |
5fced8dc | 59 | |
7bfe6e26 | 60 | checkpoint ::= 'checkpoint' lf |
1fdb649c | 61 | lf?; |
7bfe6e26 | 62 | |
ac053c02 SP |
63 | progress ::= 'progress' sp not_lf* lf |
64 | lf?; | |
65 | ||
c44cdc7e SP |
66 | # note: the first idnum in a stream should be 1 and subsequent |
67 | # idnums should not have gaps between values as this will cause | |
68 | # the stream parser to reserve space for the gapped values. An | |
c905e090 | 69 | # idnum can be updated in the future to a new object by issuing |
c44cdc7e | 70 | # a new mark directive with the old idnum. |
c905e090 | 71 | # |
c44cdc7e | 72 | mark ::= 'mark' sp idnum lf; |
3b4dce02 | 73 | data ::= (delimited_data | exact_data) |
2c570cde | 74 | lf?; |
3b4dce02 SP |
75 | |
76 | # note: delim may be any string but must not contain lf. | |
77 | # data_line may contain any data but must not be exactly | |
78 | # delim. | |
79 | delimited_data ::= 'data' sp '<<' delim lf | |
80 | (data_line lf)* | |
c905e090 | 81 | delim lf; |
c44cdc7e SP |
82 | |
83 | # note: declen indicates the length of binary_data in bytes. | |
3ea3c215 | 84 | # declen does not include the lf preceding the binary data. |
c44cdc7e | 85 | # |
3b4dce02 SP |
86 | exact_data ::= 'data' sp declen lf |
87 | binary_data; | |
c44cdc7e SP |
88 | |
89 | # note: quoted strings are C-style quoting supporting \c for | |
90 | # common escapes of 'c' (e..g \n, \t, \\, \") or \nnn where nnn | |
c905e090 | 91 | # is the signed byte value in octal. Note that the only |
c44cdc7e SP |
92 | # characters which must actually be escaped to protect the |
93 | # stream formatting is: \, " and LF. Otherwise these values | |
c905e090 | 94 | # are UTF8. |
c44cdc7e | 95 | # |
a8a5406a | 96 | commit-ish ::= (ref_str | hexsha1 | sha1exp_str | idnum); |
6c3aac1c SP |
97 | ref_str ::= ref; |
98 | sha1exp_str ::= sha1exp; | |
99 | tag_str ::= tag; | |
c44cdc7e | 100 | path_str ::= path | '"' quoted(path) '"' ; |
b715cfbb SP |
101 | mode ::= '100644' | '644' |
102 | | '100755' | '755' | |
9981b6d9 | 103 | | '120000' |
b715cfbb | 104 | ; |
c44cdc7e SP |
105 | |
106 | declen ::= # unsigned 32 bit value, ascii base10 notation; | |
2104838b | 107 | bigint ::= # unsigned integer value, ascii base10 notation; |
463acbe1 | 108 | binary_data ::= # file content, not interpreted; |
c44cdc7e | 109 | |
63e0c8b3 SP |
110 | when ::= raw_when | rfc2822_when; |
111 | raw_when ::= ts sp tz; | |
112 | rfc2822_when ::= # Valid RFC 2822 date and time; | |
113 | ||
463acbe1 SP |
114 | sp ::= # ASCII space character; |
115 | lf ::= # ASCII newline (LF) character; | |
c44cdc7e SP |
116 | |
117 | # note: a colon (':') must precede the numerical value assigned to | |
c905e090 | 118 | # an idnum. This is to distinguish it from a ref or tag name as |
c44cdc7e | 119 | # GIT does not permit ':' in ref or tag strings. |
c905e090 | 120 | # |
2104838b | 121 | idnum ::= ':' bigint; |
c44cdc7e SP |
122 | path ::= # GIT style file path, e.g. "a/b/c"; |
123 | ref ::= # GIT ref name, e.g. "refs/heads/MOZ_GECKO_EXPERIMENT"; | |
124 | tag ::= # GIT tag name, e.g. "FIREFOX_1_5"; | |
463acbe1 SP |
125 | sha1exp ::= # Any valid GIT SHA1 expression; |
126 | hexsha1 ::= # SHA1 in hexadecimal format; | |
c44cdc7e SP |
127 | |
128 | # note: name and email are UTF8 strings, however name must not | |
c905e090 | 129 | # contain '<' or lf and email must not contain any of the |
c44cdc7e | 130 | # following: '<', '>', lf. |
c905e090 | 131 | # |
c44cdc7e | 132 | name ::= # valid GIT author/committer name; |
463acbe1 | 133 | email ::= # valid GIT author/committer email; |
c44cdc7e SP |
134 | ts ::= # time since the epoch in seconds, ascii base10 notation; |
135 | tz ::= # GIT style timezone; | |
401d53fa | 136 | |
8dc6a373 | 137 | # note: comments, ls and cat requests may appear anywhere |
777f80d7 JN |
138 | # in the input, except within a data command. Any form |
139 | # of the data command always escapes the related input | |
140 | # from comment processing. | |
401d53fa SP |
141 | # |
142 | # In case it is not clear, the '#' that starts the comment | |
b18cc5a3 | 143 | # must be the first character on that line (an lf |
3ea3c215 | 144 | # preceded it). |
401d53fa | 145 | # |
8dc6a373 | 146 | |
777f80d7 | 147 | cat_blob ::= 'cat-blob' sp (hexsha1 | idnum) lf; |
8dc6a373 | 148 | ls_tree ::= 'ls' sp (hexsha1 | idnum) sp path_str lf; |
777f80d7 | 149 | |
401d53fa SP |
150 | comment ::= '#' not_lf* lf; |
151 | not_lf ::= # Any byte that is not ASCII newline (LF); | |
463acbe1 SP |
152 | */ |
153 | ||
db5e523f SP |
154 | #include "builtin.h" |
155 | #include "cache.h" | |
156 | #include "object.h" | |
157 | #include "blob.h" | |
463acbe1 | 158 | #include "tree.h" |
7073e69e | 159 | #include "commit.h" |
db5e523f SP |
160 | #include "delta.h" |
161 | #include "pack.h" | |
463acbe1 | 162 | #include "refs.h" |
db5e523f | 163 | #include "csum-file.h" |
c44cdc7e | 164 | #include "quote.h" |
2fb3f6db | 165 | #include "exec_cmd.h" |
50906e04 | 166 | #include "dir.h" |
db5e523f | 167 | |
69e74e74 SP |
168 | #define PACK_ID_BITS 16 |
169 | #define MAX_PACK_ID ((1<<PACK_ID_BITS)-1) | |
436e7a74 SP |
170 | #define DEPTH_BITS 13 |
171 | #define MAX_DEPTH ((1<<DEPTH_BITS)-1) | |
69e74e74 | 172 | |
8fb3ad76 DI |
173 | /* |
174 | * We abuse the setuid bit on directories to mean "do not delta". | |
175 | */ | |
176 | #define NO_DELTA S_ISUID | |
177 | ||
9cba13ca | 178 | struct object_entry { |
3fc366bd | 179 | struct pack_idx_entry idx; |
27d6d290 | 180 | struct object_entry *next; |
436e7a74 SP |
181 | uint32_t type : TYPE_BITS, |
182 | pack_id : PACK_ID_BITS, | |
183 | depth : DEPTH_BITS; | |
27d6d290 SP |
184 | }; |
185 | ||
9cba13ca | 186 | struct object_entry_pool { |
463acbe1 | 187 | struct object_entry_pool *next_pool; |
27d6d290 SP |
188 | struct object_entry *next_free; |
189 | struct object_entry *end; | |
ac47a738 | 190 | struct object_entry entries[FLEX_ARRAY]; /* more */ |
27d6d290 SP |
191 | }; |
192 | ||
9cba13ca | 193 | struct mark_set { |
d8397168 SP |
194 | union { |
195 | struct object_entry *marked[1024]; | |
196 | struct mark_set *sets[1024]; | |
197 | } data; | |
6f64f6d9 | 198 | unsigned int shift; |
d8397168 SP |
199 | }; |
200 | ||
9cba13ca | 201 | struct last_object { |
05576569 | 202 | struct strbuf data; |
89e0a3a1 | 203 | off_t offset; |
6bb5b329 | 204 | unsigned int depth; |
05576569 | 205 | unsigned no_swap : 1; |
ac47a738 SP |
206 | }; |
207 | ||
9cba13ca | 208 | struct mem_pool { |
463acbe1 SP |
209 | struct mem_pool *next_pool; |
210 | char *next_free; | |
211 | char *end; | |
69ae5175 | 212 | uintmax_t space[FLEX_ARRAY]; /* more */ |
463acbe1 SP |
213 | }; |
214 | ||
9cba13ca | 215 | struct atom_str { |
463acbe1 | 216 | struct atom_str *next_atom; |
10831c55 | 217 | unsigned short str_len; |
463acbe1 SP |
218 | char str_dat[FLEX_ARRAY]; /* more */ |
219 | }; | |
220 | ||
221 | struct tree_content; | |
9cba13ca | 222 | struct tree_entry { |
463acbe1 | 223 | struct tree_content *tree; |
4b25d091 | 224 | struct atom_str *name; |
9cba13ca | 225 | struct tree_entry_ms { |
10831c55 | 226 | uint16_t mode; |
4cabf858 SP |
227 | unsigned char sha1[20]; |
228 | } versions[2]; | |
6bb5b329 SP |
229 | }; |
230 | ||
9cba13ca | 231 | struct tree_content { |
463acbe1 SP |
232 | unsigned int entry_capacity; /* must match avail_tree_content */ |
233 | unsigned int entry_count; | |
4cabf858 | 234 | unsigned int delta_depth; |
463acbe1 SP |
235 | struct tree_entry *entries[FLEX_ARRAY]; /* more */ |
236 | }; | |
237 | ||
9cba13ca | 238 | struct avail_tree_content { |
463acbe1 SP |
239 | unsigned int entry_capacity; /* must match tree_content */ |
240 | struct avail_tree_content *next_avail; | |
6bb5b329 SP |
241 | }; |
242 | ||
9cba13ca | 243 | struct branch { |
463acbe1 SP |
244 | struct branch *table_next_branch; |
245 | struct branch *active_next_branch; | |
6bb5b329 | 246 | const char *name; |
463acbe1 | 247 | struct tree_entry branch_tree; |
69e74e74 | 248 | uintmax_t last_commit; |
2a113aee | 249 | uintmax_t num_notes; |
734c91f9 SP |
250 | unsigned active : 1; |
251 | unsigned pack_id : PACK_ID_BITS; | |
463acbe1 | 252 | unsigned char sha1[20]; |
6bb5b329 SP |
253 | }; |
254 | ||
9cba13ca | 255 | struct tag { |
72303d44 SP |
256 | struct tag *next_tag; |
257 | const char *name; | |
2369ed79 | 258 | unsigned int pack_id; |
72303d44 SP |
259 | unsigned char sha1[20]; |
260 | }; | |
261 | ||
9cba13ca | 262 | struct hash_list { |
62b6f483 SP |
263 | struct hash_list *next; |
264 | unsigned char sha1[20]; | |
265 | }; | |
463acbe1 | 266 | |
63e0c8b3 SP |
267 | typedef enum { |
268 | WHENSPEC_RAW = 1, | |
269 | WHENSPEC_RFC2822, | |
4b05548f | 270 | WHENSPEC_NOW |
63e0c8b3 SP |
271 | } whenspec_type; |
272 | ||
9cba13ca | 273 | struct recent_command { |
904b1941 SP |
274 | struct recent_command *prev; |
275 | struct recent_command *next; | |
276 | char *buf; | |
277 | }; | |
278 | ||
0ea9f045 | 279 | /* Configured limits on output */ |
d5c57b28 | 280 | static unsigned long max_depth = 10; |
89e0a3a1 | 281 | static off_t max_packsize; |
7073e69e | 282 | static int force_update; |
bb23fdfa SP |
283 | static int pack_compression_level = Z_DEFAULT_COMPRESSION; |
284 | static int pack_compression_seen; | |
0ea9f045 SP |
285 | |
286 | /* Stats and misc. counters */ | |
287 | static uintmax_t alloc_count; | |
0ea9f045 SP |
288 | static uintmax_t marks_set_count; |
289 | static uintmax_t object_count_by_type[1 << TYPE_BITS]; | |
290 | static uintmax_t duplicate_count_by_type[1 << TYPE_BITS]; | |
291 | static uintmax_t delta_count_by_type[1 << TYPE_BITS]; | |
94c3b482 | 292 | static uintmax_t delta_count_attempts_by_type[1 << TYPE_BITS]; |
a7ddc487 | 293 | static unsigned long object_count; |
6bb5b329 | 294 | static unsigned long branch_count; |
d6c7eb2c | 295 | static unsigned long branch_load_count; |
7073e69e | 296 | static int failure; |
bdf1c06d | 297 | static FILE *pack_edges; |
0f6927c2 | 298 | static unsigned int show_stats = 1; |
9c8398f0 | 299 | static int global_argc; |
84d32bf7 | 300 | static char **global_argv; |
ac47a738 | 301 | |
463acbe1 SP |
302 | /* Memory pools */ |
303 | static size_t mem_pool_alloc = 2*1024*1024 - sizeof(struct mem_pool); | |
304 | static size_t total_allocd; | |
305 | static struct mem_pool *mem_pool; | |
306 | ||
c44cdc7e | 307 | /* Atom management */ |
463acbe1 SP |
308 | static unsigned int atom_table_sz = 4451; |
309 | static unsigned int atom_cnt; | |
310 | static struct atom_str **atom_table; | |
311 | ||
312 | /* The .pack file being generated */ | |
ebcfb379 | 313 | static struct pack_idx_option pack_idx_opts; |
7bfe6e26 | 314 | static unsigned int pack_id; |
21281816 | 315 | static struct sha1file *pack_file; |
d489bc14 | 316 | static struct packed_git *pack_data; |
7bfe6e26 | 317 | static struct packed_git **all_packs; |
89e0a3a1 | 318 | static off_t pack_size; |
ac47a738 SP |
319 | |
320 | /* Table of objects we've written. */ | |
4cabf858 | 321 | static unsigned int object_entry_alloc = 5000; |
463acbe1 SP |
322 | static struct object_entry_pool *blocks; |
323 | static struct object_entry *object_table[1 << 16]; | |
d8397168 | 324 | static struct mark_set *marks; |
07cd9328 SR |
325 | static const char *export_marks_file; |
326 | static const char *import_marks_file; | |
081751c8 | 327 | static int import_marks_file_from_stream; |
dded4f12 | 328 | static int import_marks_file_ignore_missing; |
bc3c79ae | 329 | static int relative_marks_paths; |
ac47a738 SP |
330 | |
331 | /* Our last blob */ | |
05576569 | 332 | static struct last_object last_blob = { STRBUF_INIT, 0, 0, 0 }; |
463acbe1 SP |
333 | |
334 | /* Tree management */ | |
335 | static unsigned int tree_entry_alloc = 1000; | |
336 | static void *avail_tree_entry; | |
337 | static unsigned int avail_tree_table_sz = 100; | |
338 | static struct avail_tree_content **avail_tree_table; | |
eec813cf PH |
339 | static struct strbuf old_tree = STRBUF_INIT; |
340 | static struct strbuf new_tree = STRBUF_INIT; | |
8bcce301 | 341 | |
6bb5b329 | 342 | /* Branch data */ |
d5c57b28 SP |
343 | static unsigned long max_active_branches = 5; |
344 | static unsigned long cur_active_branches; | |
345 | static unsigned long branch_table_sz = 1039; | |
463acbe1 SP |
346 | static struct branch **branch_table; |
347 | static struct branch *active_branches; | |
348 | ||
72303d44 SP |
349 | /* Tag data */ |
350 | static struct tag *first_tag; | |
351 | static struct tag *last_tag; | |
352 | ||
c44cdc7e | 353 | /* Input stream parsing */ |
63e0c8b3 | 354 | static whenspec_type whenspec = WHENSPEC_RAW; |
4a241d79 | 355 | static struct strbuf command_buf = STRBUF_INIT; |
1fdb649c | 356 | static int unread_command_buf; |
904b1941 SP |
357 | static struct recent_command cmd_hist = {&cmd_hist, &cmd_hist, NULL}; |
358 | static struct recent_command *cmd_tail = &cmd_hist; | |
359 | static struct recent_command *rc_free; | |
360 | static unsigned int cmd_save = 100; | |
0ea9f045 | 361 | static uintmax_t next_mark; |
eec813cf | 362 | static struct strbuf new_data = STRBUF_INIT; |
f963bd5d | 363 | static int seen_data_command; |
be56862f | 364 | static int require_explicit_termination; |
c44cdc7e | 365 | |
dc01f59d JN |
366 | /* Signal handling */ |
367 | static volatile sig_atomic_t checkpoint_requested; | |
368 | ||
85c62395 DB |
369 | /* Where to write output of cat-blob commands */ |
370 | static int cat_blob_fd = STDOUT_FILENO; | |
371 | ||
9c8398f0 | 372 | static void parse_argv(void); |
777f80d7 | 373 | static void parse_cat_blob(void); |
8dc6a373 | 374 | static void parse_ls(struct branch *b); |
c44cdc7e | 375 | |
8acb3297 SP |
376 | static void write_branch_report(FILE *rpt, struct branch *b) |
377 | { | |
378 | fprintf(rpt, "%s:\n", b->name); | |
379 | ||
380 | fprintf(rpt, " status :"); | |
381 | if (b->active) | |
382 | fputs(" active", rpt); | |
383 | if (b->branch_tree.tree) | |
384 | fputs(" loaded", rpt); | |
385 | if (is_null_sha1(b->branch_tree.versions[1].sha1)) | |
386 | fputs(" dirty", rpt); | |
387 | fputc('\n', rpt); | |
388 | ||
389 | fprintf(rpt, " tip commit : %s\n", sha1_to_hex(b->sha1)); | |
390 | fprintf(rpt, " old tree : %s\n", sha1_to_hex(b->branch_tree.versions[0].sha1)); | |
391 | fprintf(rpt, " cur tree : %s\n", sha1_to_hex(b->branch_tree.versions[1].sha1)); | |
392 | fprintf(rpt, " commit clock: %" PRIuMAX "\n", b->last_commit); | |
393 | ||
394 | fputs(" last pack : ", rpt); | |
395 | if (b->pack_id < MAX_PACK_ID) | |
396 | fprintf(rpt, "%u", b->pack_id); | |
397 | fputc('\n', rpt); | |
398 | ||
399 | fputc('\n', rpt); | |
400 | } | |
401 | ||
3b08e5b8 SP |
402 | static void dump_marks_helper(FILE *, uintmax_t, struct mark_set *); |
403 | ||
4bf53833 | 404 | static void write_crash_report(const char *err) |
8acb3297 | 405 | { |
85e72830 | 406 | char *loc = git_path("fast_import_crash_%"PRIuMAX, (uintmax_t) getpid()); |
8acb3297 SP |
407 | FILE *rpt = fopen(loc, "w"); |
408 | struct branch *b; | |
409 | unsigned long lu; | |
904b1941 | 410 | struct recent_command *rc; |
8acb3297 SP |
411 | |
412 | if (!rpt) { | |
413 | error("can't write crash report %s: %s", loc, strerror(errno)); | |
414 | return; | |
415 | } | |
416 | ||
417 | fprintf(stderr, "fast-import: dumping crash report to %s\n", loc); | |
418 | ||
419 | fprintf(rpt, "fast-import crash report:\n"); | |
85e72830 DSP |
420 | fprintf(rpt, " fast-import process: %"PRIuMAX"\n", (uintmax_t) getpid()); |
421 | fprintf(rpt, " parent process : %"PRIuMAX"\n", (uintmax_t) getppid()); | |
8acb3297 SP |
422 | fprintf(rpt, " at %s\n", show_date(time(NULL), 0, DATE_LOCAL)); |
423 | fputc('\n', rpt); | |
424 | ||
425 | fputs("fatal: ", rpt); | |
4bf53833 | 426 | fputs(err, rpt); |
8acb3297 SP |
427 | fputc('\n', rpt); |
428 | ||
904b1941 SP |
429 | fputc('\n', rpt); |
430 | fputs("Most Recent Commands Before Crash\n", rpt); | |
431 | fputs("---------------------------------\n", rpt); | |
432 | for (rc = cmd_hist.next; rc != &cmd_hist; rc = rc->next) { | |
433 | if (rc->next == &cmd_hist) | |
434 | fputs("* ", rpt); | |
435 | else | |
436 | fputs(" ", rpt); | |
437 | fputs(rc->buf, rpt); | |
438 | fputc('\n', rpt); | |
439 | } | |
440 | ||
8acb3297 SP |
441 | fputc('\n', rpt); |
442 | fputs("Active Branch LRU\n", rpt); | |
443 | fputs("-----------------\n", rpt); | |
444 | fprintf(rpt, " active_branches = %lu cur, %lu max\n", | |
445 | cur_active_branches, | |
446 | max_active_branches); | |
447 | fputc('\n', rpt); | |
448 | fputs(" pos clock name\n", rpt); | |
449 | fputs(" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n", rpt); | |
450 | for (b = active_branches, lu = 0; b; b = b->active_next_branch) | |
451 | fprintf(rpt, " %2lu) %6" PRIuMAX" %s\n", | |
452 | ++lu, b->last_commit, b->name); | |
453 | ||
454 | fputc('\n', rpt); | |
455 | fputs("Inactive Branches\n", rpt); | |
456 | fputs("-----------------\n", rpt); | |
457 | for (lu = 0; lu < branch_table_sz; lu++) { | |
458 | for (b = branch_table[lu]; b; b = b->table_next_branch) | |
459 | write_branch_report(rpt, b); | |
460 | } | |
461 | ||
fbc63ea6 SP |
462 | if (first_tag) { |
463 | struct tag *tg; | |
464 | fputc('\n', rpt); | |
465 | fputs("Annotated Tags\n", rpt); | |
466 | fputs("--------------\n", rpt); | |
467 | for (tg = first_tag; tg; tg = tg->next_tag) { | |
468 | fputs(sha1_to_hex(tg->sha1), rpt); | |
469 | fputc(' ', rpt); | |
470 | fputs(tg->name, rpt); | |
471 | fputc('\n', rpt); | |
472 | } | |
473 | } | |
474 | ||
3b08e5b8 SP |
475 | fputc('\n', rpt); |
476 | fputs("Marks\n", rpt); | |
477 | fputs("-----\n", rpt); | |
07cd9328 SR |
478 | if (export_marks_file) |
479 | fprintf(rpt, " exported to %s\n", export_marks_file); | |
3b08e5b8 SP |
480 | else |
481 | dump_marks_helper(rpt, 0, marks); | |
482 | ||
8acb3297 SP |
483 | fputc('\n', rpt); |
484 | fputs("-------------------\n", rpt); | |
485 | fputs("END OF CRASH REPORT\n", rpt); | |
486 | fclose(rpt); | |
487 | } | |
488 | ||
118805b9 SP |
489 | static void end_packfile(void); |
490 | static void unkeep_all_packs(void); | |
491 | static void dump_marks(void); | |
492 | ||
8acb3297 SP |
493 | static NORETURN void die_nicely(const char *err, va_list params) |
494 | { | |
495 | static int zombie; | |
4bf53833 | 496 | char message[2 * PATH_MAX]; |
8acb3297 | 497 | |
4bf53833 | 498 | vsnprintf(message, sizeof(message), err, params); |
8acb3297 | 499 | fputs("fatal: ", stderr); |
4bf53833 | 500 | fputs(message, stderr); |
8acb3297 SP |
501 | fputc('\n', stderr); |
502 | ||
503 | if (!zombie) { | |
504 | zombie = 1; | |
4bf53833 | 505 | write_crash_report(message); |
118805b9 SP |
506 | end_packfile(); |
507 | unkeep_all_packs(); | |
508 | dump_marks(); | |
8acb3297 | 509 | } |
8acb3297 SP |
510 | exit(128); |
511 | } | |
6bb5b329 | 512 | |
dc01f59d JN |
513 | #ifndef SIGUSR1 /* Windows, for example */ |
514 | ||
515 | static void set_checkpoint_signal(void) | |
516 | { | |
517 | } | |
518 | ||
519 | #else | |
520 | ||
521 | static void checkpoint_signal(int signo) | |
522 | { | |
523 | checkpoint_requested = 1; | |
524 | } | |
525 | ||
526 | static void set_checkpoint_signal(void) | |
527 | { | |
528 | struct sigaction sa; | |
529 | ||
530 | memset(&sa, 0, sizeof(sa)); | |
531 | sa.sa_handler = checkpoint_signal; | |
532 | sigemptyset(&sa.sa_mask); | |
533 | sa.sa_flags = SA_RESTART; | |
534 | sigaction(SIGUSR1, &sa, NULL); | |
535 | } | |
536 | ||
537 | #endif | |
538 | ||
03842d8e | 539 | static void alloc_objects(unsigned int cnt) |
8bcce301 | 540 | { |
463acbe1 | 541 | struct object_entry_pool *b; |
27d6d290 | 542 | |
463acbe1 | 543 | b = xmalloc(sizeof(struct object_entry_pool) |
27d6d290 | 544 | + cnt * sizeof(struct object_entry)); |
463acbe1 | 545 | b->next_pool = blocks; |
27d6d290 SP |
546 | b->next_free = b->entries; |
547 | b->end = b->entries + cnt; | |
548 | blocks = b; | |
549 | alloc_count += cnt; | |
550 | } | |
8bcce301 | 551 | |
e5b1444b | 552 | static struct object_entry *new_object(unsigned char *sha1) |
8bcce301 | 553 | { |
27d6d290 | 554 | struct object_entry *e; |
8bcce301 | 555 | |
27d6d290 | 556 | if (blocks->next_free == blocks->end) |
463acbe1 | 557 | alloc_objects(object_entry_alloc); |
8bcce301 | 558 | |
27d6d290 | 559 | e = blocks->next_free++; |
3fc366bd | 560 | hashcpy(e->idx.sha1, sha1); |
27d6d290 | 561 | return e; |
8bcce301 SP |
562 | } |
563 | ||
e5b1444b | 564 | static struct object_entry *find_object(unsigned char *sha1) |
463acbe1 SP |
565 | { |
566 | unsigned int h = sha1[0] << 8 | sha1[1]; | |
567 | struct object_entry *e; | |
568 | for (e = object_table[h]; e; e = e->next) | |
3fc366bd | 569 | if (!hashcmp(sha1, e->idx.sha1)) |
463acbe1 SP |
570 | return e; |
571 | return NULL; | |
572 | } | |
573 | ||
e5b1444b | 574 | static struct object_entry *insert_object(unsigned char *sha1) |
8bcce301 SP |
575 | { |
576 | unsigned int h = sha1[0] << 8 | sha1[1]; | |
27d6d290 | 577 | struct object_entry *e = object_table[h]; |
8bcce301 SP |
578 | |
579 | while (e) { | |
3fc366bd | 580 | if (!hashcmp(sha1, e->idx.sha1)) |
8bcce301 | 581 | return e; |
8bcce301 SP |
582 | e = e->next; |
583 | } | |
584 | ||
585 | e = new_object(sha1); | |
b7c1ce4f | 586 | e->next = object_table[h]; |
3fc366bd | 587 | e->idx.offset = 0; |
b7c1ce4f | 588 | object_table[h] = e; |
8bcce301 SP |
589 | return e; |
590 | } | |
db5e523f | 591 | |
463acbe1 SP |
592 | static unsigned int hc_str(const char *s, size_t len) |
593 | { | |
594 | unsigned int r = 0; | |
595 | while (len-- > 0) | |
596 | r = r * 31 + *s++; | |
597 | return r; | |
598 | } | |
599 | ||
e5b1444b | 600 | static void *pool_alloc(size_t len) |
463acbe1 SP |
601 | { |
602 | struct mem_pool *p; | |
603 | void *r; | |
604 | ||
2fad5329 YT |
605 | /* round up to a 'uintmax_t' alignment */ |
606 | if (len & (sizeof(uintmax_t) - 1)) | |
607 | len += sizeof(uintmax_t) - (len & (sizeof(uintmax_t) - 1)); | |
608 | ||
463acbe1 SP |
609 | for (p = mem_pool; p; p = p->next_pool) |
610 | if ((p->end - p->next_free >= len)) | |
611 | break; | |
612 | ||
613 | if (!p) { | |
614 | if (len >= (mem_pool_alloc/2)) { | |
615 | total_allocd += len; | |
616 | return xmalloc(len); | |
617 | } | |
618 | total_allocd += sizeof(struct mem_pool) + mem_pool_alloc; | |
619 | p = xmalloc(sizeof(struct mem_pool) + mem_pool_alloc); | |
620 | p->next_pool = mem_pool; | |
69ae5175 | 621 | p->next_free = (char *) p->space; |
463acbe1 SP |
622 | p->end = p->next_free + mem_pool_alloc; |
623 | mem_pool = p; | |
624 | } | |
625 | ||
626 | r = p->next_free; | |
627 | p->next_free += len; | |
628 | return r; | |
629 | } | |
630 | ||
e5b1444b | 631 | static void *pool_calloc(size_t count, size_t size) |
463acbe1 SP |
632 | { |
633 | size_t len = count * size; | |
634 | void *r = pool_alloc(len); | |
635 | memset(r, 0, len); | |
636 | return r; | |
637 | } | |
638 | ||
e5b1444b | 639 | static char *pool_strdup(const char *s) |
463acbe1 SP |
640 | { |
641 | char *r = pool_alloc(strlen(s) + 1); | |
642 | strcpy(r, s); | |
643 | return r; | |
644 | } | |
645 | ||
0ea9f045 | 646 | static void insert_mark(uintmax_t idnum, struct object_entry *oe) |
d8397168 SP |
647 | { |
648 | struct mark_set *s = marks; | |
649 | while ((idnum >> s->shift) >= 1024) { | |
650 | s = pool_calloc(1, sizeof(struct mark_set)); | |
651 | s->shift = marks->shift + 10; | |
652 | s->data.sets[0] = marks; | |
653 | marks = s; | |
654 | } | |
655 | while (s->shift) { | |
0ea9f045 | 656 | uintmax_t i = idnum >> s->shift; |
d8397168 SP |
657 | idnum -= i << s->shift; |
658 | if (!s->data.sets[i]) { | |
659 | s->data.sets[i] = pool_calloc(1, sizeof(struct mark_set)); | |
660 | s->data.sets[i]->shift = s->shift - 10; | |
661 | } | |
662 | s = s->data.sets[i]; | |
663 | } | |
664 | if (!s->data.marked[idnum]) | |
665 | marks_set_count++; | |
666 | s->data.marked[idnum] = oe; | |
667 | } | |
668 | ||
e5b1444b | 669 | static struct object_entry *find_mark(uintmax_t idnum) |
d8397168 | 670 | { |
0ea9f045 | 671 | uintmax_t orig_idnum = idnum; |
d8397168 SP |
672 | struct mark_set *s = marks; |
673 | struct object_entry *oe = NULL; | |
674 | if ((idnum >> s->shift) < 1024) { | |
675 | while (s && s->shift) { | |
0ea9f045 | 676 | uintmax_t i = idnum >> s->shift; |
d8397168 SP |
677 | idnum -= i << s->shift; |
678 | s = s->data.sets[i]; | |
679 | } | |
680 | if (s) | |
681 | oe = s->data.marked[idnum]; | |
682 | } | |
683 | if (!oe) | |
3efb1f34 | 684 | die("mark :%" PRIuMAX " not declared", orig_idnum); |
d8397168 SP |
685 | return oe; |
686 | } | |
687 | ||
e5b1444b | 688 | static struct atom_str *to_atom(const char *s, unsigned short len) |
463acbe1 SP |
689 | { |
690 | unsigned int hc = hc_str(s, len) % atom_table_sz; | |
691 | struct atom_str *c; | |
692 | ||
693 | for (c = atom_table[hc]; c; c = c->next_atom) | |
694 | if (c->str_len == len && !strncmp(s, c->str_dat, len)) | |
695 | return c; | |
696 | ||
697 | c = pool_alloc(sizeof(struct atom_str) + len + 1); | |
698 | c->str_len = len; | |
699 | strncpy(c->str_dat, s, len); | |
700 | c->str_dat[len] = 0; | |
701 | c->next_atom = atom_table[hc]; | |
702 | atom_table[hc] = c; | |
703 | atom_cnt++; | |
704 | return c; | |
705 | } | |
706 | ||
e5b1444b | 707 | static struct branch *lookup_branch(const char *name) |
463acbe1 SP |
708 | { |
709 | unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz; | |
710 | struct branch *b; | |
711 | ||
712 | for (b = branch_table[hc]; b; b = b->table_next_branch) | |
713 | if (!strcmp(name, b->name)) | |
714 | return b; | |
715 | return NULL; | |
716 | } | |
717 | ||
e5b1444b | 718 | static struct branch *new_branch(const char *name) |
463acbe1 SP |
719 | { |
720 | unsigned int hc = hc_str(name, strlen(name)) % branch_table_sz; | |
4b25d091 | 721 | struct branch *b = lookup_branch(name); |
463acbe1 SP |
722 | |
723 | if (b) | |
724 | die("Invalid attempt to create duplicate branch: %s", name); | |
8d9c5010 | 725 | if (check_refname_format(name, REFNAME_ALLOW_ONELEVEL)) |
c44cdc7e | 726 | die("Branch name doesn't conform to GIT standards: %s", name); |
463acbe1 SP |
727 | |
728 | b = pool_calloc(1, sizeof(struct branch)); | |
729 | b->name = pool_strdup(name); | |
730 | b->table_next_branch = branch_table[hc]; | |
8a8c55ea SP |
731 | b->branch_tree.versions[0].mode = S_IFDIR; |
732 | b->branch_tree.versions[1].mode = S_IFDIR; | |
2a113aee | 733 | b->num_notes = 0; |
734c91f9 | 734 | b->active = 0; |
69e74e74 | 735 | b->pack_id = MAX_PACK_ID; |
463acbe1 SP |
736 | branch_table[hc] = b; |
737 | branch_count++; | |
738 | return b; | |
739 | } | |
740 | ||
741 | static unsigned int hc_entries(unsigned int cnt) | |
742 | { | |
743 | cnt = cnt & 7 ? (cnt / 8) + 1 : cnt / 8; | |
744 | return cnt < avail_tree_table_sz ? cnt : avail_tree_table_sz - 1; | |
745 | } | |
746 | ||
e5b1444b | 747 | static struct tree_content *new_tree_content(unsigned int cnt) |
463acbe1 SP |
748 | { |
749 | struct avail_tree_content *f, *l = NULL; | |
750 | struct tree_content *t; | |
751 | unsigned int hc = hc_entries(cnt); | |
752 | ||
753 | for (f = avail_tree_table[hc]; f; l = f, f = f->next_avail) | |
754 | if (f->entry_capacity >= cnt) | |
755 | break; | |
756 | ||
757 | if (f) { | |
758 | if (l) | |
759 | l->next_avail = f->next_avail; | |
760 | else | |
761 | avail_tree_table[hc] = f->next_avail; | |
762 | } else { | |
763 | cnt = cnt & 7 ? ((cnt / 8) + 1) * 8 : cnt; | |
764 | f = pool_alloc(sizeof(*t) + sizeof(t->entries[0]) * cnt); | |
765 | f->entry_capacity = cnt; | |
766 | } | |
767 | ||
768 | t = (struct tree_content*)f; | |
769 | t->entry_count = 0; | |
4cabf858 | 770 | t->delta_depth = 0; |
463acbe1 SP |
771 | return t; |
772 | } | |
773 | ||
774 | static void release_tree_entry(struct tree_entry *e); | |
775 | static void release_tree_content(struct tree_content *t) | |
776 | { | |
777 | struct avail_tree_content *f = (struct avail_tree_content*)t; | |
778 | unsigned int hc = hc_entries(f->entry_capacity); | |
afde8dd9 SP |
779 | f->next_avail = avail_tree_table[hc]; |
780 | avail_tree_table[hc] = f; | |
781 | } | |
782 | ||
783 | static void release_tree_content_recursive(struct tree_content *t) | |
784 | { | |
463acbe1 SP |
785 | unsigned int i; |
786 | for (i = 0; i < t->entry_count; i++) | |
787 | release_tree_entry(t->entries[i]); | |
afde8dd9 | 788 | release_tree_content(t); |
463acbe1 SP |
789 | } |
790 | ||
e5b1444b | 791 | static struct tree_content *grow_tree_content( |
463acbe1 SP |
792 | struct tree_content *t, |
793 | int amt) | |
794 | { | |
795 | struct tree_content *r = new_tree_content(t->entry_count + amt); | |
796 | r->entry_count = t->entry_count; | |
4cabf858 | 797 | r->delta_depth = t->delta_depth; |
463acbe1 SP |
798 | memcpy(r->entries,t->entries,t->entry_count*sizeof(t->entries[0])); |
799 | release_tree_content(t); | |
800 | return r; | |
801 | } | |
802 | ||
e5b1444b | 803 | static struct tree_entry *new_tree_entry(void) |
463acbe1 SP |
804 | { |
805 | struct tree_entry *e; | |
806 | ||
807 | if (!avail_tree_entry) { | |
808 | unsigned int n = tree_entry_alloc; | |
8435a9cb | 809 | total_allocd += n * sizeof(struct tree_entry); |
463acbe1 | 810 | avail_tree_entry = e = xmalloc(n * sizeof(struct tree_entry)); |
2eb26d84 | 811 | while (n-- > 1) { |
463acbe1 SP |
812 | *((void**)e) = e + 1; |
813 | e++; | |
814 | } | |
35ef237c | 815 | *((void**)e) = NULL; |
463acbe1 SP |
816 | } |
817 | ||
818 | e = avail_tree_entry; | |
819 | avail_tree_entry = *((void**)e); | |
820 | return e; | |
821 | } | |
822 | ||
823 | static void release_tree_entry(struct tree_entry *e) | |
824 | { | |
825 | if (e->tree) | |
afde8dd9 | 826 | release_tree_content_recursive(e->tree); |
463acbe1 SP |
827 | *((void**)e) = avail_tree_entry; |
828 | avail_tree_entry = e; | |
829 | } | |
830 | ||
b6f3481b SP |
831 | static struct tree_content *dup_tree_content(struct tree_content *s) |
832 | { | |
833 | struct tree_content *d; | |
834 | struct tree_entry *a, *b; | |
835 | unsigned int i; | |
836 | ||
837 | if (!s) | |
838 | return NULL; | |
839 | d = new_tree_content(s->entry_count); | |
840 | for (i = 0; i < s->entry_count; i++) { | |
841 | a = s->entries[i]; | |
842 | b = new_tree_entry(); | |
843 | memcpy(b, a, sizeof(*a)); | |
844 | if (a->tree && is_null_sha1(b->versions[1].sha1)) | |
845 | b->tree = dup_tree_content(a->tree); | |
846 | else | |
847 | b->tree = NULL; | |
848 | d->entries[i] = b; | |
849 | } | |
850 | d->entry_count = s->entry_count; | |
851 | d->delta_depth = s->delta_depth; | |
852 | ||
853 | return d; | |
854 | } | |
855 | ||
fd99224e | 856 | static void start_packfile(void) |
f70b6534 | 857 | { |
ab1900a3 | 858 | static char tmp_file[PATH_MAX]; |
7bfe6e26 | 859 | struct packed_git *p; |
f70b6534 | 860 | struct pack_header hdr; |
0fcbcae7 | 861 | int pack_fd; |
f70b6534 | 862 | |
ab1900a3 | 863 | pack_fd = odb_mkstemp(tmp_file, sizeof(tmp_file), |
6e180cdc | 864 | "pack/tmp_pack_XXXXXX"); |
ab1900a3 ÆAB |
865 | p = xcalloc(1, sizeof(*p) + strlen(tmp_file) + 2); |
866 | strcpy(p->pack_name, tmp_file); | |
7bfe6e26 | 867 | p->pack_fd = pack_fd; |
d131b7af | 868 | p->do_not_close = 1; |
21281816 | 869 | pack_file = sha1fd(pack_fd, p->pack_name); |
f70b6534 SP |
870 | |
871 | hdr.hdr_signature = htonl(PACK_SIGNATURE); | |
872 | hdr.hdr_version = htonl(2); | |
873 | hdr.hdr_entries = 0; | |
21281816 | 874 | sha1write(pack_file, &hdr, sizeof(hdr)); |
7bfe6e26 SP |
875 | |
876 | pack_data = p; | |
f70b6534 SP |
877 | pack_size = sizeof(hdr); |
878 | object_count = 0; | |
7bfe6e26 SP |
879 | |
880 | all_packs = xrealloc(all_packs, sizeof(*all_packs) * (pack_id + 1)); | |
881 | all_packs[pack_id] = p; | |
f70b6534 SP |
882 | } |
883 | ||
427cb22c | 884 | static const char *create_index(void) |
f70b6534 | 885 | { |
427cb22c NP |
886 | const char *tmpfile; |
887 | struct pack_idx_entry **idx, **c, **last; | |
888 | struct object_entry *e; | |
f70b6534 | 889 | struct object_entry_pool *o; |
f70b6534 | 890 | |
427cb22c NP |
891 | /* Build the table of object IDs. */ |
892 | idx = xmalloc(object_count * sizeof(*idx)); | |
f70b6534 SP |
893 | c = idx; |
894 | for (o = blocks; o; o = o->next_pool) | |
d9ee53ce SP |
895 | for (e = o->next_free; e-- != o->entries;) |
896 | if (pack_id == e->pack_id) | |
427cb22c | 897 | *c++ = &e->idx; |
f70b6534 | 898 | last = idx + object_count; |
2fce1f3c SP |
899 | if (c != last) |
900 | die("internal consistency error creating the index"); | |
f70b6534 | 901 | |
ebcfb379 | 902 | tmpfile = write_idx_file(NULL, idx, object_count, &pack_idx_opts, pack_data->sha1); |
f70b6534 | 903 | free(idx); |
8455e484 SP |
904 | return tmpfile; |
905 | } | |
906 | ||
427cb22c | 907 | static char *keep_pack(const char *curr_index_name) |
8455e484 SP |
908 | { |
909 | static char name[PATH_MAX]; | |
3a55602e | 910 | static const char *keep_msg = "fast-import"; |
8455e484 SP |
911 | int keep_fd; |
912 | ||
6e180cdc | 913 | keep_fd = odb_pack_keep(name, sizeof(name), pack_data->sha1); |
8455e484 | 914 | if (keep_fd < 0) |
0721c314 | 915 | die_errno("cannot create keep file"); |
95693d45 JM |
916 | write_or_die(keep_fd, keep_msg, strlen(keep_msg)); |
917 | if (close(keep_fd)) | |
0721c314 | 918 | die_errno("failed to write keep file"); |
8455e484 SP |
919 | |
920 | snprintf(name, sizeof(name), "%s/pack/pack-%s.pack", | |
921 | get_object_directory(), sha1_to_hex(pack_data->sha1)); | |
922 | if (move_temp_to_file(pack_data->pack_name, name)) | |
923 | die("cannot store pack file"); | |
8455e484 SP |
924 | |
925 | snprintf(name, sizeof(name), "%s/pack/pack-%s.idx", | |
926 | get_object_directory(), sha1_to_hex(pack_data->sha1)); | |
927 | if (move_temp_to_file(curr_index_name, name)) | |
928 | die("cannot store index file"); | |
427cb22c | 929 | free((void *)curr_index_name); |
8455e484 SP |
930 | return name; |
931 | } | |
932 | ||
fd99224e | 933 | static void unkeep_all_packs(void) |
8455e484 SP |
934 | { |
935 | static char name[PATH_MAX]; | |
936 | int k; | |
937 | ||
938 | for (k = 0; k < pack_id; k++) { | |
939 | struct packed_git *p = all_packs[k]; | |
940 | snprintf(name, sizeof(name), "%s/pack/pack-%s.keep", | |
941 | get_object_directory(), sha1_to_hex(p->sha1)); | |
691f1a28 | 942 | unlink_or_warn(name); |
8455e484 | 943 | } |
f70b6534 SP |
944 | } |
945 | ||
fd99224e | 946 | static void end_packfile(void) |
f70b6534 | 947 | { |
7bfe6e26 SP |
948 | struct packed_git *old_p = pack_data, *new_p; |
949 | ||
3d20c636 | 950 | clear_delta_base_cache(); |
3e005baf | 951 | if (object_count) { |
21281816 | 952 | unsigned char cur_pack_sha1[20]; |
8455e484 | 953 | char *idx_name; |
2369ed79 SP |
954 | int i; |
955 | struct branch *b; | |
956 | struct tag *t; | |
8455e484 | 957 | |
c9ced051 | 958 | close_pack_windows(pack_data); |
21281816 | 959 | sha1close(pack_file, cur_pack_sha1, 0); |
8b0eca7c | 960 | fixup_pack_header_footer(pack_data->pack_fd, pack_data->sha1, |
abeb40e5 | 961 | pack_data->pack_name, object_count, |
21281816 | 962 | cur_pack_sha1, pack_size); |
8b0eca7c | 963 | close(pack_data->pack_fd); |
8455e484 | 964 | idx_name = keep_pack(create_index()); |
3e005baf | 965 | |
3ea3c215 | 966 | /* Register the packfile with core git's machinery. */ |
3e005baf SP |
967 | new_p = add_packed_git(idx_name, strlen(idx_name), 1); |
968 | if (!new_p) | |
969 | die("core git rejected index %s", idx_name); | |
2369ed79 | 970 | all_packs[pack_id] = new_p; |
3e005baf | 971 | install_packed_git(new_p); |
2369ed79 SP |
972 | |
973 | /* Print the boundary */ | |
bdf1c06d SP |
974 | if (pack_edges) { |
975 | fprintf(pack_edges, "%s:", new_p->pack_name); | |
976 | for (i = 0; i < branch_table_sz; i++) { | |
977 | for (b = branch_table[i]; b; b = b->table_next_branch) { | |
978 | if (b->pack_id == pack_id) | |
979 | fprintf(pack_edges, " %s", sha1_to_hex(b->sha1)); | |
980 | } | |
2369ed79 | 981 | } |
bdf1c06d SP |
982 | for (t = first_tag; t; t = t->next_tag) { |
983 | if (t->pack_id == pack_id) | |
984 | fprintf(pack_edges, " %s", sha1_to_hex(t->sha1)); | |
985 | } | |
986 | fputc('\n', pack_edges); | |
987 | fflush(pack_edges); | |
2369ed79 | 988 | } |
2369ed79 SP |
989 | |
990 | pack_id++; | |
3e005baf | 991 | } |
87c8a56e JS |
992 | else { |
993 | close(old_p->pack_fd); | |
691f1a28 | 994 | unlink_or_warn(old_p->pack_name); |
87c8a56e | 995 | } |
7bfe6e26 | 996 | free(old_p); |
7bfe6e26 SP |
997 | |
998 | /* We can't carry a delta across packfiles. */ | |
05576569 | 999 | strbuf_release(&last_blob.data); |
7bfe6e26 SP |
1000 | last_blob.offset = 0; |
1001 | last_blob.depth = 0; | |
f70b6534 SP |
1002 | } |
1003 | ||
820b9310 | 1004 | static void cycle_packfile(void) |
d9ee53ce SP |
1005 | { |
1006 | end_packfile(); | |
1007 | start_packfile(); | |
1008 | } | |
1009 | ||
ac47a738 SP |
1010 | static int store_object( |
1011 | enum object_type type, | |
eec813cf | 1012 | struct strbuf *dat, |
6bb5b329 | 1013 | struct last_object *last, |
d8397168 | 1014 | unsigned char *sha1out, |
0ea9f045 | 1015 | uintmax_t mark) |
db5e523f | 1016 | { |
db5e523f | 1017 | void *out, *delta; |
ac47a738 SP |
1018 | struct object_entry *e; |
1019 | unsigned char hdr[96]; | |
1020 | unsigned char sha1[20]; | |
db5e523f | 1021 | unsigned long hdrlen, deltalen; |
9126f009 | 1022 | git_SHA_CTX c; |
ef49a7a0 | 1023 | git_zstream s; |
ac47a738 | 1024 | |
4b25d091 | 1025 | hdrlen = sprintf((char *)hdr,"%s %lu", typename(type), |
eec813cf | 1026 | (unsigned long)dat->len) + 1; |
9126f009 NP |
1027 | git_SHA1_Init(&c); |
1028 | git_SHA1_Update(&c, hdr, hdrlen); | |
1029 | git_SHA1_Update(&c, dat->buf, dat->len); | |
1030 | git_SHA1_Final(sha1, &c); | |
6bb5b329 | 1031 | if (sha1out) |
445b8599 | 1032 | hashcpy(sha1out, sha1); |
ac47a738 SP |
1033 | |
1034 | e = insert_object(sha1); | |
d8397168 SP |
1035 | if (mark) |
1036 | insert_mark(mark, e); | |
3fc366bd | 1037 | if (e->idx.offset) { |
6143f064 | 1038 | duplicate_count_by_type[type]++; |
463acbe1 | 1039 | return 1; |
a5c1780a SP |
1040 | } else if (find_sha1_pack(sha1, packed_git)) { |
1041 | e->type = type; | |
1042 | e->pack_id = MAX_PACK_ID; | |
3fc366bd | 1043 | e->idx.offset = 1; /* just not zero! */ |
a5c1780a SP |
1044 | duplicate_count_by_type[type]++; |
1045 | return 1; | |
ac47a738 | 1046 | } |
db5e523f | 1047 | |
b500d5e1 | 1048 | if (last && last->data.buf && last->depth < max_depth && dat->len > 20) { |
94c3b482 | 1049 | delta_count_attempts_by_type[type]++; |
05576569 | 1050 | delta = diff_delta(last->data.buf, last->data.len, |
eec813cf | 1051 | dat->buf, dat->len, |
b500d5e1 | 1052 | &deltalen, dat->len - 20); |
d9ee53ce SP |
1053 | } else |
1054 | delta = NULL; | |
db5e523f SP |
1055 | |
1056 | memset(&s, 0, sizeof(s)); | |
55bb5c91 | 1057 | git_deflate_init(&s, pack_compression_level); |
d9ee53ce SP |
1058 | if (delta) { |
1059 | s.next_in = delta; | |
1060 | s.avail_in = deltalen; | |
1061 | } else { | |
eec813cf PH |
1062 | s.next_in = (void *)dat->buf; |
1063 | s.avail_in = dat->len; | |
d9ee53ce | 1064 | } |
225a6f10 | 1065 | s.avail_out = git_deflate_bound(&s, s.avail_in); |
d9ee53ce | 1066 | s.next_out = out = xmalloc(s.avail_out); |
55bb5c91 JH |
1067 | while (git_deflate(&s, Z_FINISH) == Z_OK) |
1068 | ; /* nothing */ | |
1069 | git_deflate_end(&s); | |
d9ee53ce SP |
1070 | |
1071 | /* Determine if we should auto-checkpoint. */ | |
89e0a3a1 | 1072 | if ((max_packsize && (pack_size + 60 + s.total_out) > max_packsize) |
d9ee53ce SP |
1073 | || (pack_size + 60 + s.total_out) < pack_size) { |
1074 | ||
1075 | /* This new object needs to *not* have the current pack_id. */ | |
1076 | e->pack_id = pack_id + 1; | |
820b9310 | 1077 | cycle_packfile(); |
d9ee53ce SP |
1078 | |
1079 | /* We cannot carry a delta into the new pack. */ | |
1080 | if (delta) { | |
1081 | free(delta); | |
1082 | delta = NULL; | |
5d6f3ef6 SP |
1083 | |
1084 | memset(&s, 0, sizeof(s)); | |
55bb5c91 | 1085 | git_deflate_init(&s, pack_compression_level); |
eec813cf PH |
1086 | s.next_in = (void *)dat->buf; |
1087 | s.avail_in = dat->len; | |
225a6f10 | 1088 | s.avail_out = git_deflate_bound(&s, s.avail_in); |
5d6f3ef6 | 1089 | s.next_out = out = xrealloc(out, s.avail_out); |
55bb5c91 JH |
1090 | while (git_deflate(&s, Z_FINISH) == Z_OK) |
1091 | ; /* nothing */ | |
1092 | git_deflate_end(&s); | |
d9ee53ce | 1093 | } |
d9ee53ce SP |
1094 | } |
1095 | ||
1096 | e->type = type; | |
1097 | e->pack_id = pack_id; | |
3fc366bd | 1098 | e->idx.offset = pack_size; |
d9ee53ce SP |
1099 | object_count++; |
1100 | object_count_by_type[type]++; | |
db5e523f | 1101 | |
427cb22c NP |
1102 | crc32_begin(pack_file); |
1103 | ||
db5e523f | 1104 | if (delta) { |
89e0a3a1 | 1105 | off_t ofs = e->idx.offset - last->offset; |
d489bc14 SP |
1106 | unsigned pos = sizeof(hdr) - 1; |
1107 | ||
4cabf858 | 1108 | delta_count_by_type[type]++; |
436e7a74 | 1109 | e->depth = last->depth + 1; |
d489bc14 | 1110 | |
1b22b6c8 | 1111 | hdrlen = encode_in_pack_object_header(OBJ_OFS_DELTA, deltalen, hdr); |
21281816 | 1112 | sha1write(pack_file, hdr, hdrlen); |
d489bc14 SP |
1113 | pack_size += hdrlen; |
1114 | ||
1115 | hdr[pos] = ofs & 127; | |
1116 | while (ofs >>= 7) | |
1117 | hdr[--pos] = 128 | (--ofs & 127); | |
21281816 | 1118 | sha1write(pack_file, hdr + pos, sizeof(hdr) - pos); |
d489bc14 | 1119 | pack_size += sizeof(hdr) - pos; |
db5e523f | 1120 | } else { |
436e7a74 | 1121 | e->depth = 0; |
1b22b6c8 | 1122 | hdrlen = encode_in_pack_object_header(type, dat->len, hdr); |
21281816 | 1123 | sha1write(pack_file, hdr, hdrlen); |
41e5257f | 1124 | pack_size += hdrlen; |
db5e523f SP |
1125 | } |
1126 | ||
21281816 | 1127 | sha1write(pack_file, out, s.total_out); |
41e5257f | 1128 | pack_size += s.total_out; |
db5e523f | 1129 | |
427cb22c NP |
1130 | e->idx.crc32 = crc32_end(pack_file); |
1131 | ||
db5e523f | 1132 | free(out); |
e7d06a4b | 1133 | free(delta); |
463acbe1 | 1134 | if (last) { |
05576569 PH |
1135 | if (last->no_swap) { |
1136 | last->data = *dat; | |
1137 | } else { | |
c76689df | 1138 | strbuf_swap(&last->data, dat); |
05576569 | 1139 | } |
3fc366bd | 1140 | last->offset = e->idx.offset; |
436e7a74 | 1141 | last->depth = e->depth; |
463acbe1 SP |
1142 | } |
1143 | return 0; | |
1144 | } | |
1145 | ||
6c526148 | 1146 | static void truncate_pack(struct sha1file_checkpoint *checkpoint) |
5eef828b | 1147 | { |
6c526148 | 1148 | if (sha1file_truncate(pack_file, checkpoint)) |
5eef828b | 1149 | die_errno("cannot truncate pack to skip duplicate"); |
6c526148 | 1150 | pack_size = checkpoint->offset; |
5eef828b SP |
1151 | } |
1152 | ||
1153 | static void stream_blob(uintmax_t len, unsigned char *sha1out, uintmax_t mark) | |
1154 | { | |
1155 | size_t in_sz = 64 * 1024, out_sz = 64 * 1024; | |
1156 | unsigned char *in_buf = xmalloc(in_sz); | |
1157 | unsigned char *out_buf = xmalloc(out_sz); | |
1158 | struct object_entry *e; | |
1159 | unsigned char sha1[20]; | |
1160 | unsigned long hdrlen; | |
1161 | off_t offset; | |
1162 | git_SHA_CTX c; | |
ef49a7a0 | 1163 | git_zstream s; |
6c526148 | 1164 | struct sha1file_checkpoint checkpoint; |
5eef828b SP |
1165 | int status = Z_OK; |
1166 | ||
1167 | /* Determine if we should auto-checkpoint. */ | |
89e0a3a1 | 1168 | if ((max_packsize && (pack_size + 60 + len) > max_packsize) |
5eef828b SP |
1169 | || (pack_size + 60 + len) < pack_size) |
1170 | cycle_packfile(); | |
1171 | ||
6c526148 JH |
1172 | sha1file_checkpoint(pack_file, &checkpoint); |
1173 | offset = checkpoint.offset; | |
21281816 | 1174 | |
5eef828b SP |
1175 | hdrlen = snprintf((char *)out_buf, out_sz, "blob %" PRIuMAX, len) + 1; |
1176 | if (out_sz <= hdrlen) | |
1177 | die("impossibly large object header"); | |
1178 | ||
1179 | git_SHA1_Init(&c); | |
1180 | git_SHA1_Update(&c, out_buf, hdrlen); | |
1181 | ||
427cb22c NP |
1182 | crc32_begin(pack_file); |
1183 | ||
5eef828b | 1184 | memset(&s, 0, sizeof(s)); |
55bb5c91 | 1185 | git_deflate_init(&s, pack_compression_level); |
5eef828b | 1186 | |
1b22b6c8 | 1187 | hdrlen = encode_in_pack_object_header(OBJ_BLOB, len, out_buf); |
5eef828b SP |
1188 | if (out_sz <= hdrlen) |
1189 | die("impossibly large object header"); | |
1190 | ||
1191 | s.next_out = out_buf + hdrlen; | |
1192 | s.avail_out = out_sz - hdrlen; | |
1193 | ||
1194 | while (status != Z_STREAM_END) { | |
1195 | if (0 < len && !s.avail_in) { | |
1196 | size_t cnt = in_sz < len ? in_sz : (size_t)len; | |
1197 | size_t n = fread(in_buf, 1, cnt, stdin); | |
1198 | if (!n && feof(stdin)) | |
1199 | die("EOF in data (%" PRIuMAX " bytes remaining)", len); | |
1200 | ||
1201 | git_SHA1_Update(&c, in_buf, n); | |
1202 | s.next_in = in_buf; | |
1203 | s.avail_in = n; | |
1204 | len -= n; | |
1205 | } | |
1206 | ||
55bb5c91 | 1207 | status = git_deflate(&s, len ? 0 : Z_FINISH); |
5eef828b SP |
1208 | |
1209 | if (!s.avail_out || status == Z_STREAM_END) { | |
1210 | size_t n = s.next_out - out_buf; | |
21281816 | 1211 | sha1write(pack_file, out_buf, n); |
5eef828b SP |
1212 | pack_size += n; |
1213 | s.next_out = out_buf; | |
1214 | s.avail_out = out_sz; | |
1215 | } | |
1216 | ||
1217 | switch (status) { | |
1218 | case Z_OK: | |
1219 | case Z_BUF_ERROR: | |
1220 | case Z_STREAM_END: | |
1221 | continue; | |
1222 | default: | |
1223 | die("unexpected deflate failure: %d", status); | |
1224 | } | |
1225 | } | |
55bb5c91 | 1226 | git_deflate_end(&s); |
5eef828b SP |
1227 | git_SHA1_Final(sha1, &c); |
1228 | ||
1229 | if (sha1out) | |
1230 | hashcpy(sha1out, sha1); | |
1231 | ||
1232 | e = insert_object(sha1); | |
1233 | ||
1234 | if (mark) | |
1235 | insert_mark(mark, e); | |
1236 | ||
3fc366bd | 1237 | if (e->idx.offset) { |
5eef828b | 1238 | duplicate_count_by_type[OBJ_BLOB]++; |
6c526148 | 1239 | truncate_pack(&checkpoint); |
5eef828b SP |
1240 | |
1241 | } else if (find_sha1_pack(sha1, packed_git)) { | |
1242 | e->type = OBJ_BLOB; | |
1243 | e->pack_id = MAX_PACK_ID; | |
3fc366bd | 1244 | e->idx.offset = 1; /* just not zero! */ |
5eef828b | 1245 | duplicate_count_by_type[OBJ_BLOB]++; |
6c526148 | 1246 | truncate_pack(&checkpoint); |
5eef828b SP |
1247 | |
1248 | } else { | |
1249 | e->depth = 0; | |
1250 | e->type = OBJ_BLOB; | |
1251 | e->pack_id = pack_id; | |
3fc366bd | 1252 | e->idx.offset = offset; |
427cb22c | 1253 | e->idx.crc32 = crc32_end(pack_file); |
5eef828b SP |
1254 | object_count++; |
1255 | object_count_by_type[OBJ_BLOB]++; | |
1256 | } | |
1257 | ||
1258 | free(in_buf); | |
1259 | free(out_buf); | |
1260 | } | |
1261 | ||
7422bac4 SP |
1262 | /* All calls must be guarded by find_object() or find_mark() to |
1263 | * ensure the 'struct object_entry' passed was written by this | |
1264 | * process instance. We unpack the entry by the offset, avoiding | |
1265 | * the need for the corresponding .idx file. This unpacking rule | |
1266 | * works because we only use OBJ_REF_DELTA within the packfiles | |
1267 | * created by fast-import. | |
1268 | * | |
1269 | * oe must not be NULL. Such an oe usually comes from giving | |
1270 | * an unknown SHA-1 to find_object() or an undefined mark to | |
1271 | * find_mark(). Callers must test for this condition and use | |
1272 | * the standard read_sha1_file() when it happens. | |
1273 | * | |
1274 | * oe->pack_id must not be MAX_PACK_ID. Such an oe is usually from | |
1275 | * find_mark(), where the mark was reloaded from an existing marks | |
1276 | * file and is referencing an object that this fast-import process | |
1277 | * instance did not write out to a packfile. Callers must test for | |
1278 | * this condition and use read_sha1_file() instead. | |
1279 | */ | |
7bfe6e26 SP |
1280 | static void *gfi_unpack_entry( |
1281 | struct object_entry *oe, | |
1282 | unsigned long *sizep) | |
41e5257f | 1283 | { |
21666f1a | 1284 | enum object_type type; |
7bfe6e26 | 1285 | struct packed_git *p = all_packs[oe->pack_id]; |
c9ced051 | 1286 | if (p == pack_data && p->pack_size < (pack_size + 20)) { |
7422bac4 SP |
1287 | /* The object is stored in the packfile we are writing to |
1288 | * and we have modified it since the last time we scanned | |
1289 | * back to read a previously written object. If an old | |
1290 | * window covered [p->pack_size, p->pack_size + 20) its | |
1291 | * data is stale and is not valid. Closing all windows | |
1292 | * and updating the packfile length ensures we can read | |
1293 | * the newly written data. | |
1294 | */ | |
c9ced051 | 1295 | close_pack_windows(p); |
21281816 | 1296 | sha1flush(pack_file); |
7422bac4 SP |
1297 | |
1298 | /* We have to offer 20 bytes additional on the end of | |
1299 | * the packfile as the core unpacker code assumes the | |
1300 | * footer is present at the file end and must promise | |
1301 | * at least 20 bytes within any window it maps. But | |
1302 | * we don't actually create the footer here. | |
1303 | */ | |
7bfe6e26 | 1304 | p->pack_size = pack_size + 20; |
c9ced051 | 1305 | } |
3fc366bd | 1306 | return unpack_entry(p, oe->idx.offset, &type, sizep); |
41e5257f SP |
1307 | } |
1308 | ||
10831c55 | 1309 | static const char *get_mode(const char *str, uint16_t *modep) |
463acbe1 SP |
1310 | { |
1311 | unsigned char c; | |
10831c55 | 1312 | uint16_t mode = 0; |
463acbe1 SP |
1313 | |
1314 | while ((c = *str++) != ' ') { | |
1315 | if (c < '0' || c > '7') | |
1316 | return NULL; | |
1317 | mode = (mode << 3) + (c - '0'); | |
1318 | } | |
1319 | *modep = mode; | |
1320 | return str; | |
1321 | } | |
1322 | ||
1323 | static void load_tree(struct tree_entry *root) | |
1324 | { | |
4b25d091 | 1325 | unsigned char *sha1 = root->versions[1].sha1; |
463acbe1 SP |
1326 | struct object_entry *myoe; |
1327 | struct tree_content *t; | |
1328 | unsigned long size; | |
1329 | char *buf; | |
1330 | const char *c; | |
463acbe1 SP |
1331 | |
1332 | root->tree = t = new_tree_content(8); | |
4cabf858 | 1333 | if (is_null_sha1(sha1)) |
463acbe1 SP |
1334 | return; |
1335 | ||
4cabf858 | 1336 | myoe = find_object(sha1); |
20f546a8 | 1337 | if (myoe && myoe->pack_id != MAX_PACK_ID) { |
41e5257f | 1338 | if (myoe->type != OBJ_TREE) |
4cabf858 | 1339 | die("Not a tree: %s", sha1_to_hex(sha1)); |
436e7a74 | 1340 | t->delta_depth = myoe->depth; |
7bfe6e26 | 1341 | buf = gfi_unpack_entry(myoe, &size); |
e8b32e06 SP |
1342 | if (!buf) |
1343 | die("Can't load tree %s", sha1_to_hex(sha1)); | |
463acbe1 | 1344 | } else { |
21666f1a NP |
1345 | enum object_type type; |
1346 | buf = read_sha1_file(sha1, &type, &size); | |
1347 | if (!buf || type != OBJ_TREE) | |
4cabf858 | 1348 | die("Can't load tree %s", sha1_to_hex(sha1)); |
463acbe1 SP |
1349 | } |
1350 | ||
1351 | c = buf; | |
1352 | while (c != (buf + size)) { | |
1353 | struct tree_entry *e = new_tree_entry(); | |
1354 | ||
1355 | if (t->entry_count == t->entry_capacity) | |
f022f85f | 1356 | root->tree = t = grow_tree_content(t, t->entry_count); |
463acbe1 SP |
1357 | t->entries[t->entry_count++] = e; |
1358 | ||
1359 | e->tree = NULL; | |
4cabf858 | 1360 | c = get_mode(c, &e->versions[1].mode); |
463acbe1 | 1361 | if (!c) |
4cabf858 SP |
1362 | die("Corrupt mode in %s", sha1_to_hex(sha1)); |
1363 | e->versions[0].mode = e->versions[1].mode; | |
061e35c5 | 1364 | e->name = to_atom(c, strlen(c)); |
463acbe1 | 1365 | c += e->name->str_len + 1; |
4b25d091 FC |
1366 | hashcpy(e->versions[0].sha1, (unsigned char *)c); |
1367 | hashcpy(e->versions[1].sha1, (unsigned char *)c); | |
463acbe1 SP |
1368 | c += 20; |
1369 | } | |
1370 | free(buf); | |
1371 | } | |
1372 | ||
4cabf858 | 1373 | static int tecmp0 (const void *_a, const void *_b) |
463acbe1 SP |
1374 | { |
1375 | struct tree_entry *a = *((struct tree_entry**)_a); | |
1376 | struct tree_entry *b = *((struct tree_entry**)_b); | |
1377 | return base_name_compare( | |
4cabf858 SP |
1378 | a->name->str_dat, a->name->str_len, a->versions[0].mode, |
1379 | b->name->str_dat, b->name->str_len, b->versions[0].mode); | |
463acbe1 SP |
1380 | } |
1381 | ||
4cabf858 | 1382 | static int tecmp1 (const void *_a, const void *_b) |
463acbe1 | 1383 | { |
4cabf858 SP |
1384 | struct tree_entry *a = *((struct tree_entry**)_a); |
1385 | struct tree_entry *b = *((struct tree_entry**)_b); | |
1386 | return base_name_compare( | |
1387 | a->name->str_dat, a->name->str_len, a->versions[1].mode, | |
1388 | b->name->str_dat, b->name->str_len, b->versions[1].mode); | |
1389 | } | |
1390 | ||
eec813cf | 1391 | static void mktree(struct tree_content *t, int v, struct strbuf *b) |
4cabf858 SP |
1392 | { |
1393 | size_t maxlen = 0; | |
463acbe1 | 1394 | unsigned int i; |
463acbe1 | 1395 | |
4cabf858 SP |
1396 | if (!v) |
1397 | qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp0); | |
1398 | else | |
1399 | qsort(t->entries,t->entry_count,sizeof(t->entries[0]),tecmp1); | |
463acbe1 | 1400 | |
463acbe1 | 1401 | for (i = 0; i < t->entry_count; i++) { |
4cabf858 SP |
1402 | if (t->entries[i]->versions[v].mode) |
1403 | maxlen += t->entries[i]->name->str_len + 34; | |
463acbe1 SP |
1404 | } |
1405 | ||
eec813cf PH |
1406 | strbuf_reset(b); |
1407 | strbuf_grow(b, maxlen); | |
463acbe1 SP |
1408 | for (i = 0; i < t->entry_count; i++) { |
1409 | struct tree_entry *e = t->entries[i]; | |
4cabf858 SP |
1410 | if (!e->versions[v].mode) |
1411 | continue; | |
8fb3ad76 DI |
1412 | strbuf_addf(b, "%o %s%c", |
1413 | (unsigned int)(e->versions[v].mode & ~NO_DELTA), | |
1414 | e->name->str_dat, '\0'); | |
eec813cf | 1415 | strbuf_add(b, e->versions[v].sha1, 20); |
463acbe1 | 1416 | } |
4cabf858 SP |
1417 | } |
1418 | ||
1419 | static void store_tree(struct tree_entry *root) | |
1420 | { | |
1421 | struct tree_content *t = root->tree; | |
1422 | unsigned int i, j, del; | |
05576569 | 1423 | struct last_object lo = { STRBUF_INIT, 0, 0, /* no_swap */ 1 }; |
8fb3ad76 | 1424 | struct object_entry *le = NULL; |
4cabf858 SP |
1425 | |
1426 | if (!is_null_sha1(root->versions[1].sha1)) | |
1427 | return; | |
1428 | ||
1429 | for (i = 0; i < t->entry_count; i++) { | |
1430 | if (t->entries[i]->tree) | |
1431 | store_tree(t->entries[i]); | |
1432 | } | |
1433 | ||
8fb3ad76 DI |
1434 | if (!(root->versions[0].mode & NO_DELTA)) |
1435 | le = find_object(root->versions[0].sha1); | |
05576569 | 1436 | if (S_ISDIR(root->versions[0].mode) && le && le->pack_id == pack_id) { |
eec813cf | 1437 | mktree(t, 0, &old_tree); |
05576569 | 1438 | lo.data = old_tree; |
3fc366bd | 1439 | lo.offset = le->idx.offset; |
4cabf858 | 1440 | lo.depth = t->delta_depth; |
4cabf858 | 1441 | } |
4cabf858 | 1442 | |
eec813cf PH |
1443 | mktree(t, 1, &new_tree); |
1444 | store_object(OBJ_TREE, &new_tree, &lo, root->versions[1].sha1, 0); | |
4cabf858 SP |
1445 | |
1446 | t->delta_depth = lo.depth; | |
4cabf858 SP |
1447 | for (i = 0, j = 0, del = 0; i < t->entry_count; i++) { |
1448 | struct tree_entry *e = t->entries[i]; | |
1449 | if (e->versions[1].mode) { | |
1450 | e->versions[0].mode = e->versions[1].mode; | |
1451 | hashcpy(e->versions[0].sha1, e->versions[1].sha1); | |
1452 | t->entries[j++] = e; | |
1453 | } else { | |
1454 | release_tree_entry(e); | |
1455 | del++; | |
1456 | } | |
1457 | } | |
1458 | t->entry_count -= del; | |
463acbe1 SP |
1459 | } |
1460 | ||
34215783 JN |
1461 | static void tree_content_replace( |
1462 | struct tree_entry *root, | |
1463 | const unsigned char *sha1, | |
1464 | const uint16_t mode, | |
1465 | struct tree_content *newtree) | |
1466 | { | |
1467 | if (!S_ISDIR(mode)) | |
1468 | die("Root cannot be a non-directory"); | |
8fb3ad76 | 1469 | hashclr(root->versions[0].sha1); |
34215783 JN |
1470 | hashcpy(root->versions[1].sha1, sha1); |
1471 | if (root->tree) | |
1472 | release_tree_content_recursive(root->tree); | |
1473 | root->tree = newtree; | |
1474 | } | |
1475 | ||
463acbe1 SP |
1476 | static int tree_content_set( |
1477 | struct tree_entry *root, | |
1478 | const char *p, | |
1479 | const unsigned char *sha1, | |
f39a946a SP |
1480 | const uint16_t mode, |
1481 | struct tree_content *subtree) | |
463acbe1 | 1482 | { |
5edde510 | 1483 | struct tree_content *t; |
463acbe1 SP |
1484 | const char *slash1; |
1485 | unsigned int i, n; | |
1486 | struct tree_entry *e; | |
1487 | ||
1488 | slash1 = strchr(p, '/'); | |
1489 | if (slash1) | |
1490 | n = slash1 - p; | |
1491 | else | |
1492 | n = strlen(p); | |
475d1b33 SP |
1493 | if (!n) |
1494 | die("Empty path component found in input"); | |
f39a946a SP |
1495 | if (!slash1 && !S_ISDIR(mode) && subtree) |
1496 | die("Non-directories cannot have subtrees"); | |
463acbe1 | 1497 | |
5edde510 JN |
1498 | if (!root->tree) |
1499 | load_tree(root); | |
1500 | t = root->tree; | |
463acbe1 SP |
1501 | for (i = 0; i < t->entry_count; i++) { |
1502 | e = t->entries[i]; | |
50906e04 | 1503 | if (e->name->str_len == n && !strncmp_icase(p, e->name->str_dat, n)) { |
463acbe1 | 1504 | if (!slash1) { |
f39a946a SP |
1505 | if (!S_ISDIR(mode) |
1506 | && e->versions[1].mode == mode | |
4cabf858 | 1507 | && !hashcmp(e->versions[1].sha1, sha1)) |
463acbe1 | 1508 | return 0; |
4cabf858 SP |
1509 | e->versions[1].mode = mode; |
1510 | hashcpy(e->versions[1].sha1, sha1); | |
f39a946a | 1511 | if (e->tree) |
afde8dd9 | 1512 | release_tree_content_recursive(e->tree); |
f39a946a | 1513 | e->tree = subtree; |
8fb3ad76 DI |
1514 | |
1515 | /* | |
1516 | * We need to leave e->versions[0].sha1 alone | |
1517 | * to avoid modifying the preimage tree used | |
1518 | * when writing out the parent directory. | |
1519 | * But after replacing the subdir with a | |
1520 | * completely different one, it's not a good | |
1521 | * delta base any more, and besides, we've | |
1522 | * thrown away the tree entries needed to | |
1523 | * make a delta against it. | |
1524 | * | |
1525 | * So let's just explicitly disable deltas | |
1526 | * for the subtree. | |
1527 | */ | |
1528 | if (S_ISDIR(e->versions[0].mode)) | |
1529 | e->versions[0].mode |= NO_DELTA; | |
1530 | ||
4cabf858 | 1531 | hashclr(root->versions[1].sha1); |
463acbe1 SP |
1532 | return 1; |
1533 | } | |
4cabf858 | 1534 | if (!S_ISDIR(e->versions[1].mode)) { |
463acbe1 | 1535 | e->tree = new_tree_content(8); |
4cabf858 | 1536 | e->versions[1].mode = S_IFDIR; |
463acbe1 SP |
1537 | } |
1538 | if (!e->tree) | |
1539 | load_tree(e); | |
f39a946a | 1540 | if (tree_content_set(e, slash1 + 1, sha1, mode, subtree)) { |
4cabf858 | 1541 | hashclr(root->versions[1].sha1); |
463acbe1 SP |
1542 | return 1; |
1543 | } | |
1544 | return 0; | |
1545 | } | |
1546 | } | |
1547 | ||
1548 | if (t->entry_count == t->entry_capacity) | |
f022f85f | 1549 | root->tree = t = grow_tree_content(t, t->entry_count); |
463acbe1 | 1550 | e = new_tree_entry(); |
061e35c5 | 1551 | e->name = to_atom(p, n); |
4cabf858 SP |
1552 | e->versions[0].mode = 0; |
1553 | hashclr(e->versions[0].sha1); | |
463acbe1 SP |
1554 | t->entries[t->entry_count++] = e; |
1555 | if (slash1) { | |
1556 | e->tree = new_tree_content(8); | |
4cabf858 | 1557 | e->versions[1].mode = S_IFDIR; |
f39a946a | 1558 | tree_content_set(e, slash1 + 1, sha1, mode, subtree); |
463acbe1 | 1559 | } else { |
f39a946a | 1560 | e->tree = subtree; |
4cabf858 SP |
1561 | e->versions[1].mode = mode; |
1562 | hashcpy(e->versions[1].sha1, sha1); | |
463acbe1 | 1563 | } |
4cabf858 | 1564 | hashclr(root->versions[1].sha1); |
463acbe1 SP |
1565 | return 1; |
1566 | } | |
1567 | ||
f39a946a SP |
1568 | static int tree_content_remove( |
1569 | struct tree_entry *root, | |
1570 | const char *p, | |
62bfa11c JK |
1571 | struct tree_entry *backup_leaf, |
1572 | int allow_root) | |
463acbe1 | 1573 | { |
5edde510 | 1574 | struct tree_content *t; |
463acbe1 SP |
1575 | const char *slash1; |
1576 | unsigned int i, n; | |
1577 | struct tree_entry *e; | |
1578 | ||
1579 | slash1 = strchr(p, '/'); | |
1580 | if (slash1) | |
1581 | n = slash1 - p; | |
1582 | else | |
1583 | n = strlen(p); | |
1584 | ||
5edde510 JN |
1585 | if (!root->tree) |
1586 | load_tree(root); | |
62bfa11c JK |
1587 | |
1588 | if (!*p && allow_root) { | |
1589 | e = root; | |
1590 | goto del_entry; | |
1591 | } | |
1592 | ||
5edde510 | 1593 | t = root->tree; |
463acbe1 SP |
1594 | for (i = 0; i < t->entry_count; i++) { |
1595 | e = t->entries[i]; | |
50906e04 | 1596 | if (e->name->str_len == n && !strncmp_icase(p, e->name->str_dat, n)) { |
253fb5f8 EN |
1597 | if (slash1 && !S_ISDIR(e->versions[1].mode)) |
1598 | /* | |
1599 | * If p names a file in some subdirectory, and a | |
1600 | * file or symlink matching the name of the | |
1601 | * parent directory of p exists, then p cannot | |
1602 | * exist and need not be deleted. | |
1603 | */ | |
1604 | return 1; | |
4cabf858 | 1605 | if (!slash1 || !S_ISDIR(e->versions[1].mode)) |
463acbe1 SP |
1606 | goto del_entry; |
1607 | if (!e->tree) | |
1608 | load_tree(e); | |
62bfa11c | 1609 | if (tree_content_remove(e, slash1 + 1, backup_leaf, 0)) { |
b54d6422 SP |
1610 | for (n = 0; n < e->tree->entry_count; n++) { |
1611 | if (e->tree->entries[n]->versions[1].mode) { | |
1612 | hashclr(root->versions[1].sha1); | |
1613 | return 1; | |
1614 | } | |
1615 | } | |
f39a946a | 1616 | backup_leaf = NULL; |
b54d6422 | 1617 | goto del_entry; |
463acbe1 SP |
1618 | } |
1619 | return 0; | |
1620 | } | |
1621 | } | |
1622 | return 0; | |
1623 | ||
1624 | del_entry: | |
f39a946a SP |
1625 | if (backup_leaf) |
1626 | memcpy(backup_leaf, e, sizeof(*backup_leaf)); | |
1627 | else if (e->tree) | |
4cabf858 | 1628 | release_tree_content_recursive(e->tree); |
f39a946a | 1629 | e->tree = NULL; |
4cabf858 SP |
1630 | e->versions[1].mode = 0; |
1631 | hashclr(e->versions[1].sha1); | |
1632 | hashclr(root->versions[1].sha1); | |
ac47a738 | 1633 | return 1; |
db5e523f SP |
1634 | } |
1635 | ||
b6f3481b SP |
1636 | static int tree_content_get( |
1637 | struct tree_entry *root, | |
1638 | const char *p, | |
e0eb6b97 JK |
1639 | struct tree_entry *leaf, |
1640 | int allow_root) | |
b6f3481b | 1641 | { |
5edde510 | 1642 | struct tree_content *t; |
b6f3481b SP |
1643 | const char *slash1; |
1644 | unsigned int i, n; | |
1645 | struct tree_entry *e; | |
1646 | ||
1647 | slash1 = strchr(p, '/'); | |
1648 | if (slash1) | |
1649 | n = slash1 - p; | |
1650 | else | |
1651 | n = strlen(p); | |
e0eb6b97 | 1652 | if (!n && !allow_root) |
178e1dea | 1653 | die("Empty path component found in input"); |
b6f3481b | 1654 | |
5edde510 JN |
1655 | if (!root->tree) |
1656 | load_tree(root); | |
e0eb6b97 JK |
1657 | |
1658 | if (!n) { | |
1659 | e = root; | |
1660 | goto found_entry; | |
1661 | } | |
1662 | ||
5edde510 | 1663 | t = root->tree; |
b6f3481b SP |
1664 | for (i = 0; i < t->entry_count; i++) { |
1665 | e = t->entries[i]; | |
50906e04 | 1666 | if (e->name->str_len == n && !strncmp_icase(p, e->name->str_dat, n)) { |
e0eb6b97 JK |
1667 | if (!slash1) |
1668 | goto found_entry; | |
b6f3481b SP |
1669 | if (!S_ISDIR(e->versions[1].mode)) |
1670 | return 0; | |
1671 | if (!e->tree) | |
1672 | load_tree(e); | |
e0eb6b97 | 1673 | return tree_content_get(e, slash1 + 1, leaf, 0); |
b6f3481b SP |
1674 | } |
1675 | } | |
1676 | return 0; | |
e0eb6b97 JK |
1677 | |
1678 | found_entry: | |
1679 | memcpy(leaf, e, sizeof(*leaf)); | |
1680 | if (e->tree && is_null_sha1(e->versions[1].sha1)) | |
1681 | leaf->tree = dup_tree_content(e->tree); | |
1682 | else | |
1683 | leaf->tree = NULL; | |
1684 | return 1; | |
b6f3481b SP |
1685 | } |
1686 | ||
7073e69e | 1687 | static int update_branch(struct branch *b) |
463acbe1 SP |
1688 | { |
1689 | static const char *msg = "fast-import"; | |
7073e69e SP |
1690 | struct ref_lock *lock; |
1691 | unsigned char old_sha1[20]; | |
1692 | ||
198724ad EB |
1693 | if (is_null_sha1(b->sha1)) |
1694 | return 0; | |
7073e69e SP |
1695 | if (read_ref(b->name, old_sha1)) |
1696 | hashclr(old_sha1); | |
9bbb0fa1 | 1697 | lock = lock_any_ref_for_update(b->name, old_sha1, 0, NULL); |
7073e69e SP |
1698 | if (!lock) |
1699 | return error("Unable to lock %s", b->name); | |
1700 | if (!force_update && !is_null_sha1(old_sha1)) { | |
1701 | struct commit *old_cmit, *new_cmit; | |
1702 | ||
1703 | old_cmit = lookup_commit_reference_gently(old_sha1, 0); | |
1704 | new_cmit = lookup_commit_reference_gently(b->sha1, 0); | |
1705 | if (!old_cmit || !new_cmit) { | |
1706 | unlock_ref(lock); | |
1707 | return error("Branch %s is missing commits.", b->name); | |
1708 | } | |
1709 | ||
a20efee9 | 1710 | if (!in_merge_bases(old_cmit, new_cmit)) { |
7073e69e | 1711 | unlock_ref(lock); |
46efd2d9 | 1712 | warning("Not updating %s" |
7073e69e SP |
1713 | " (new tip %s does not contain %s)", |
1714 | b->name, sha1_to_hex(b->sha1), sha1_to_hex(old_sha1)); | |
1715 | return -1; | |
1716 | } | |
1717 | } | |
1718 | if (write_ref_sha1(lock, b->sha1, msg) < 0) | |
1719 | return error("Unable to update %s", b->name); | |
1720 | return 0; | |
1721 | } | |
1722 | ||
1723 | static void dump_branches(void) | |
1724 | { | |
463acbe1 SP |
1725 | unsigned int i; |
1726 | struct branch *b; | |
463acbe1 SP |
1727 | |
1728 | for (i = 0; i < branch_table_sz; i++) { | |
7073e69e SP |
1729 | for (b = branch_table[i]; b; b = b->table_next_branch) |
1730 | failure |= update_branch(b); | |
463acbe1 SP |
1731 | } |
1732 | } | |
1733 | ||
fd99224e | 1734 | static void dump_tags(void) |
72303d44 SP |
1735 | { |
1736 | static const char *msg = "fast-import"; | |
1737 | struct tag *t; | |
1738 | struct ref_lock *lock; | |
7073e69e | 1739 | char ref_name[PATH_MAX]; |
72303d44 SP |
1740 | |
1741 | for (t = first_tag; t; t = t->next_tag) { | |
7073e69e SP |
1742 | sprintf(ref_name, "tags/%s", t->name); |
1743 | lock = lock_ref_sha1(ref_name, NULL); | |
72303d44 | 1744 | if (!lock || write_ref_sha1(lock, t->sha1, msg) < 0) |
7073e69e | 1745 | failure |= error("Unable to update %s", ref_name); |
72303d44 SP |
1746 | } |
1747 | } | |
1748 | ||
a6a1a831 | 1749 | static void dump_marks_helper(FILE *f, |
0ea9f045 | 1750 | uintmax_t base, |
a6a1a831 SP |
1751 | struct mark_set *m) |
1752 | { | |
0ea9f045 | 1753 | uintmax_t k; |
a6a1a831 SP |
1754 | if (m->shift) { |
1755 | for (k = 0; k < 1024; k++) { | |
1756 | if (m->data.sets[k]) | |
7e7db5e4 | 1757 | dump_marks_helper(f, base + (k << m->shift), |
a6a1a831 SP |
1758 | m->data.sets[k]); |
1759 | } | |
1760 | } else { | |
1761 | for (k = 0; k < 1024; k++) { | |
1762 | if (m->data.marked[k]) | |
3efb1f34 | 1763 | fprintf(f, ":%" PRIuMAX " %s\n", base + k, |
3fc366bd | 1764 | sha1_to_hex(m->data.marked[k]->idx.sha1)); |
a6a1a831 SP |
1765 | } |
1766 | } | |
1767 | } | |
1768 | ||
fd99224e | 1769 | static void dump_marks(void) |
a6a1a831 | 1770 | { |
60b9004c SP |
1771 | static struct lock_file mark_lock; |
1772 | int mark_fd; | |
1773 | FILE *f; | |
1774 | ||
07cd9328 | 1775 | if (!export_marks_file) |
60b9004c SP |
1776 | return; |
1777 | ||
07cd9328 | 1778 | mark_fd = hold_lock_file_for_update(&mark_lock, export_marks_file, 0); |
60b9004c SP |
1779 | if (mark_fd < 0) { |
1780 | failure |= error("Unable to write marks file %s: %s", | |
07cd9328 | 1781 | export_marks_file, strerror(errno)); |
60b9004c | 1782 | return; |
a6a1a831 | 1783 | } |
60b9004c SP |
1784 | |
1785 | f = fdopen(mark_fd, "w"); | |
1786 | if (!f) { | |
5a7b1b57 | 1787 | int saved_errno = errno; |
60b9004c SP |
1788 | rollback_lock_file(&mark_lock); |
1789 | failure |= error("Unable to write marks file %s: %s", | |
07cd9328 | 1790 | export_marks_file, strerror(saved_errno)); |
60b9004c | 1791 | return; |
a6a1a831 | 1792 | } |
60b9004c | 1793 | |
4ed7cd3a | 1794 | /* |
fb54abd6 BC |
1795 | * Since the lock file was fdopen()'ed, it should not be close()'ed. |
1796 | * Assign -1 to the lock file descriptor so that commit_lock_file() | |
4ed7cd3a BC |
1797 | * won't try to close() it. |
1798 | */ | |
1799 | mark_lock.fd = -1; | |
fb54abd6 BC |
1800 | |
1801 | dump_marks_helper(f, 0, marks); | |
1802 | if (ferror(f) || fclose(f)) { | |
5a7b1b57 | 1803 | int saved_errno = errno; |
fb54abd6 BC |
1804 | rollback_lock_file(&mark_lock); |
1805 | failure |= error("Unable to write marks file %s: %s", | |
07cd9328 | 1806 | export_marks_file, strerror(saved_errno)); |
fb54abd6 BC |
1807 | return; |
1808 | } | |
1809 | ||
1810 | if (commit_lock_file(&mark_lock)) { | |
5a7b1b57 | 1811 | int saved_errno = errno; |
fb54abd6 BC |
1812 | rollback_lock_file(&mark_lock); |
1813 | failure |= error("Unable to commit marks file %s: %s", | |
07cd9328 | 1814 | export_marks_file, strerror(saved_errno)); |
fb54abd6 BC |
1815 | return; |
1816 | } | |
a6a1a831 SP |
1817 | } |
1818 | ||
07cd9328 SR |
1819 | static void read_marks(void) |
1820 | { | |
1821 | char line[512]; | |
1822 | FILE *f = fopen(import_marks_file, "r"); | |
dded4f12 RR |
1823 | if (f) |
1824 | ; | |
1825 | else if (import_marks_file_ignore_missing && errno == ENOENT) | |
1826 | return; /* Marks file does not exist */ | |
1827 | else | |
07cd9328 SR |
1828 | die_errno("cannot read '%s'", import_marks_file); |
1829 | while (fgets(line, sizeof(line), f)) { | |
1830 | uintmax_t mark; | |
1831 | char *end; | |
1832 | unsigned char sha1[20]; | |
1833 | struct object_entry *e; | |
1834 | ||
1835 | end = strchr(line, '\n'); | |
1836 | if (line[0] != ':' || !end) | |
1837 | die("corrupt mark line: %s", line); | |
1838 | *end = 0; | |
1839 | mark = strtoumax(line + 1, &end, 10); | |
1840 | if (!mark || end == line + 1 | |
45c5d4a5 | 1841 | || *end != ' ' || get_sha1_hex(end + 1, sha1)) |
07cd9328 SR |
1842 | die("corrupt mark line: %s", line); |
1843 | e = find_object(sha1); | |
1844 | if (!e) { | |
1845 | enum object_type type = sha1_object_info(sha1, NULL); | |
1846 | if (type < 0) | |
1847 | die("object not found: %s", sha1_to_hex(sha1)); | |
1848 | e = insert_object(sha1); | |
1849 | e->type = type; | |
1850 | e->pack_id = MAX_PACK_ID; | |
3fc366bd | 1851 | e->idx.offset = 1; /* just not zero! */ |
07cd9328 SR |
1852 | } |
1853 | insert_mark(mark, e); | |
1854 | } | |
1855 | fclose(f); | |
1856 | } | |
1857 | ||
1858 | ||
e6c019d0 | 1859 | static int read_next_command(void) |
c44cdc7e | 1860 | { |
e6c019d0 PH |
1861 | static int stdin_eof = 0; |
1862 | ||
1863 | if (stdin_eof) { | |
1864 | unread_command_buf = 0; | |
1865 | return EOF; | |
1866 | } | |
1867 | ||
777f80d7 | 1868 | for (;;) { |
904b1941 | 1869 | if (unread_command_buf) { |
1fdb649c | 1870 | unread_command_buf = 0; |
904b1941 SP |
1871 | } else { |
1872 | struct recent_command *rc; | |
1873 | ||
b315c5c0 | 1874 | strbuf_detach(&command_buf, NULL); |
e6c019d0 PH |
1875 | stdin_eof = strbuf_getline(&command_buf, stdin, '\n'); |
1876 | if (stdin_eof) | |
1877 | return EOF; | |
904b1941 | 1878 | |
f963bd5d | 1879 | if (!seen_data_command |
9c8398f0 SR |
1880 | && prefixcmp(command_buf.buf, "feature ") |
1881 | && prefixcmp(command_buf.buf, "option ")) { | |
1882 | parse_argv(); | |
f963bd5d SR |
1883 | } |
1884 | ||
904b1941 SP |
1885 | rc = rc_free; |
1886 | if (rc) | |
1887 | rc_free = rc->next; | |
1888 | else { | |
1889 | rc = cmd_hist.next; | |
1890 | cmd_hist.next = rc->next; | |
1891 | cmd_hist.next->prev = &cmd_hist; | |
1892 | free(rc->buf); | |
1893 | } | |
1894 | ||
1895 | rc->buf = command_buf.buf; | |
1896 | rc->prev = cmd_tail; | |
1897 | rc->next = cmd_hist.prev; | |
1898 | rc->prev->next = rc; | |
1899 | cmd_tail = rc; | |
1900 | } | |
777f80d7 JN |
1901 | if (!prefixcmp(command_buf.buf, "cat-blob ")) { |
1902 | parse_cat_blob(); | |
1903 | continue; | |
1904 | } | |
1905 | if (command_buf.buf[0] == '#') | |
1906 | continue; | |
1907 | return 0; | |
1908 | } | |
c44cdc7e SP |
1909 | } |
1910 | ||
7e5dcea8 | 1911 | static void skip_optional_lf(void) |
2c570cde SP |
1912 | { |
1913 | int term_char = fgetc(stdin); | |
1914 | if (term_char != '\n' && term_char != EOF) | |
1915 | ungetc(term_char, stdin); | |
1916 | } | |
1917 | ||
b3031781 | 1918 | static void parse_mark(void) |
c44cdc7e | 1919 | { |
599065a3 | 1920 | if (!prefixcmp(command_buf.buf, "mark :")) { |
0ea9f045 | 1921 | next_mark = strtoumax(command_buf.buf + 6, NULL, 10); |
c44cdc7e SP |
1922 | read_next_command(); |
1923 | } | |
1924 | else | |
d8397168 | 1925 | next_mark = 0; |
c44cdc7e SP |
1926 | } |
1927 | ||
5eef828b | 1928 | static int parse_data(struct strbuf *sb, uintmax_t limit, uintmax_t *len_res) |
c44cdc7e | 1929 | { |
eec813cf | 1930 | strbuf_reset(sb); |
c44cdc7e | 1931 | |
599065a3 | 1932 | if (prefixcmp(command_buf.buf, "data ")) |
c44cdc7e SP |
1933 | die("Expected 'data n' command, found: %s", command_buf.buf); |
1934 | ||
599065a3 | 1935 | if (!prefixcmp(command_buf.buf + 5, "<<")) { |
3b4dce02 | 1936 | char *term = xstrdup(command_buf.buf + 5 + 2); |
4a241d79 PH |
1937 | size_t term_len = command_buf.len - 5 - 2; |
1938 | ||
c2e6b6d0 | 1939 | strbuf_detach(&command_buf, NULL); |
3b4dce02 | 1940 | for (;;) { |
e6c019d0 | 1941 | if (strbuf_getline(&command_buf, stdin, '\n') == EOF) |
3b4dce02 SP |
1942 | die("EOF in data (terminator '%s' not found)", term); |
1943 | if (term_len == command_buf.len | |
1944 | && !strcmp(term, command_buf.buf)) | |
1945 | break; | |
eec813cf PH |
1946 | strbuf_addbuf(sb, &command_buf); |
1947 | strbuf_addch(sb, '\n'); | |
3b4dce02 SP |
1948 | } |
1949 | free(term); | |
1950 | } | |
1951 | else { | |
5eef828b SP |
1952 | uintmax_t len = strtoumax(command_buf.buf + 5, NULL, 10); |
1953 | size_t n = 0, length = (size_t)len; | |
4a241d79 | 1954 | |
5eef828b SP |
1955 | if (limit && limit < len) { |
1956 | *len_res = len; | |
1957 | return 0; | |
1958 | } | |
1959 | if (length < len) | |
1960 | die("data is too large to use in this context"); | |
4a241d79 | 1961 | |
3b4dce02 | 1962 | while (n < length) { |
eec813cf | 1963 | size_t s = strbuf_fread(sb, length - n, stdin); |
3b4dce02 | 1964 | if (!s && feof(stdin)) |
40db58b8 JS |
1965 | die("EOF in data (%lu bytes remaining)", |
1966 | (unsigned long)(length - n)); | |
3b4dce02 SP |
1967 | n += s; |
1968 | } | |
c44cdc7e SP |
1969 | } |
1970 | ||
2c570cde | 1971 | skip_optional_lf(); |
5eef828b | 1972 | return 1; |
c44cdc7e SP |
1973 | } |
1974 | ||
63e0c8b3 SP |
1975 | static int validate_raw_date(const char *src, char *result, int maxlen) |
1976 | { | |
1977 | const char *orig_src = src; | |
eb3a9dd3 | 1978 | char *endp; |
1cd749cc | 1979 | unsigned long num; |
63e0c8b3 | 1980 | |
c55fae43 RS |
1981 | errno = 0; |
1982 | ||
1cd749cc JH |
1983 | num = strtoul(src, &endp, 10); |
1984 | /* NEEDSWORK: perhaps check for reasonable values? */ | |
c55fae43 | 1985 | if (errno || endp == src || *endp != ' ') |
63e0c8b3 SP |
1986 | return -1; |
1987 | ||
1988 | src = endp + 1; | |
1989 | if (*src != '-' && *src != '+') | |
1990 | return -1; | |
63e0c8b3 | 1991 | |
1cd749cc JH |
1992 | num = strtoul(src + 1, &endp, 10); |
1993 | if (errno || endp == src + 1 || *endp || (endp - orig_src) >= maxlen || | |
1994 | 1400 < num) | |
63e0c8b3 SP |
1995 | return -1; |
1996 | ||
1997 | strcpy(result, orig_src); | |
1998 | return 0; | |
1999 | } | |
2000 | ||
2001 | static char *parse_ident(const char *buf) | |
2002 | { | |
4b4963c0 | 2003 | const char *ltgt; |
63e0c8b3 SP |
2004 | size_t name_len; |
2005 | char *ident; | |
2006 | ||
17fb0072 DI |
2007 | /* ensure there is a space delimiter even if there is no name */ |
2008 | if (*buf == '<') | |
2009 | --buf; | |
2010 | ||
4b4963c0 DI |
2011 | ltgt = buf + strcspn(buf, "<>"); |
2012 | if (*ltgt != '<') | |
2013 | die("Missing < in ident string: %s", buf); | |
2014 | if (ltgt != buf && ltgt[-1] != ' ') | |
2015 | die("Missing space before < in ident string: %s", buf); | |
2016 | ltgt = ltgt + 1 + strcspn(ltgt + 1, "<>"); | |
2017 | if (*ltgt != '>') | |
63e0c8b3 | 2018 | die("Missing > in ident string: %s", buf); |
4b4963c0 DI |
2019 | ltgt++; |
2020 | if (*ltgt != ' ') | |
63e0c8b3 | 2021 | die("Missing space after > in ident string: %s", buf); |
4b4963c0 DI |
2022 | ltgt++; |
2023 | name_len = ltgt - buf; | |
63e0c8b3 SP |
2024 | ident = xmalloc(name_len + 24); |
2025 | strncpy(ident, buf, name_len); | |
2026 | ||
2027 | switch (whenspec) { | |
2028 | case WHENSPEC_RAW: | |
4b4963c0 DI |
2029 | if (validate_raw_date(ltgt, ident + name_len, 24) < 0) |
2030 | die("Invalid raw date \"%s\" in ident: %s", ltgt, buf); | |
63e0c8b3 SP |
2031 | break; |
2032 | case WHENSPEC_RFC2822: | |
4b4963c0 DI |
2033 | if (parse_date(ltgt, ident + name_len, 24) < 0) |
2034 | die("Invalid rfc2822 date \"%s\" in ident: %s", ltgt, buf); | |
63e0c8b3 SP |
2035 | break; |
2036 | case WHENSPEC_NOW: | |
4b4963c0 | 2037 | if (strcmp("now", ltgt)) |
63e0c8b3 SP |
2038 | die("Date in ident must be 'now': %s", buf); |
2039 | datestamp(ident + name_len, 24); | |
2040 | break; | |
2041 | } | |
2042 | ||
2043 | return ident; | |
2044 | } | |
2045 | ||
5eef828b SP |
2046 | static void parse_and_store_blob( |
2047 | struct last_object *last, | |
2048 | unsigned char *sha1out, | |
2049 | uintmax_t mark) | |
6143f064 | 2050 | { |
05576569 | 2051 | static struct strbuf buf = STRBUF_INIT; |
5eef828b | 2052 | uintmax_t len; |
c44cdc7e | 2053 | |
5eef828b SP |
2054 | if (parse_data(&buf, big_file_threshold, &len)) |
2055 | store_object(OBJ_BLOB, &buf, last, sha1out, mark); | |
2056 | else { | |
2057 | if (last) { | |
2058 | strbuf_release(&last->data); | |
2059 | last->offset = 0; | |
2060 | last->depth = 0; | |
2061 | } | |
2062 | stream_blob(len, sha1out, mark); | |
2063 | skip_optional_lf(); | |
2064 | } | |
2065 | } | |
2066 | ||
2067 | static void parse_new_blob(void) | |
2068 | { | |
c44cdc7e | 2069 | read_next_command(); |
b3031781 | 2070 | parse_mark(); |
5eef828b | 2071 | parse_and_store_blob(&last_blob, NULL, next_mark); |
6143f064 SP |
2072 | } |
2073 | ||
fd99224e | 2074 | static void unload_one_branch(void) |
6bb5b329 | 2075 | { |
41e5257f SP |
2076 | while (cur_active_branches |
2077 | && cur_active_branches >= max_active_branches) { | |
6777a59f | 2078 | uintmax_t min_commit = ULONG_MAX; |
463acbe1 SP |
2079 | struct branch *e, *l = NULL, *p = NULL; |
2080 | ||
2081 | for (e = active_branches; e; e = e->active_next_branch) { | |
2082 | if (e->last_commit < min_commit) { | |
2083 | p = l; | |
2084 | min_commit = e->last_commit; | |
2085 | } | |
2086 | l = e; | |
2087 | } | |
2088 | ||
2089 | if (p) { | |
2090 | e = p->active_next_branch; | |
2091 | p->active_next_branch = e->active_next_branch; | |
2092 | } else { | |
2093 | e = active_branches; | |
2094 | active_branches = e->active_next_branch; | |
2095 | } | |
734c91f9 | 2096 | e->active = 0; |
463acbe1 SP |
2097 | e->active_next_branch = NULL; |
2098 | if (e->branch_tree.tree) { | |
afde8dd9 | 2099 | release_tree_content_recursive(e->branch_tree.tree); |
463acbe1 SP |
2100 | e->branch_tree.tree = NULL; |
2101 | } | |
2102 | cur_active_branches--; | |
6bb5b329 | 2103 | } |
6bb5b329 SP |
2104 | } |
2105 | ||
463acbe1 | 2106 | static void load_branch(struct branch *b) |
6bb5b329 | 2107 | { |
463acbe1 | 2108 | load_tree(&b->branch_tree); |
734c91f9 SP |
2109 | if (!b->active) { |
2110 | b->active = 1; | |
2111 | b->active_next_branch = active_branches; | |
2112 | active_branches = b; | |
2113 | cur_active_branches++; | |
2114 | branch_load_count++; | |
2115 | } | |
6bb5b329 SP |
2116 | } |
2117 | ||
2a113aee JH |
2118 | static unsigned char convert_num_notes_to_fanout(uintmax_t num_notes) |
2119 | { | |
2120 | unsigned char fanout = 0; | |
2121 | while ((num_notes >>= 8)) | |
2122 | fanout++; | |
2123 | return fanout; | |
2124 | } | |
2125 | ||
2126 | static void construct_path_with_fanout(const char *hex_sha1, | |
2127 | unsigned char fanout, char *path) | |
2128 | { | |
2129 | unsigned int i = 0, j = 0; | |
2130 | if (fanout >= 20) | |
2131 | die("Too large fanout (%u)", fanout); | |
2132 | while (fanout) { | |
2133 | path[i++] = hex_sha1[j++]; | |
2134 | path[i++] = hex_sha1[j++]; | |
2135 | path[i++] = '/'; | |
2136 | fanout--; | |
2137 | } | |
2138 | memcpy(path + i, hex_sha1 + j, 40 - j); | |
2139 | path[i + 40 - j] = '\0'; | |
2140 | } | |
2141 | ||
2142 | static uintmax_t do_change_note_fanout( | |
2143 | struct tree_entry *orig_root, struct tree_entry *root, | |
2144 | char *hex_sha1, unsigned int hex_sha1_len, | |
2145 | char *fullpath, unsigned int fullpath_len, | |
2146 | unsigned char fanout) | |
2147 | { | |
2148 | struct tree_content *t = root->tree; | |
2149 | struct tree_entry *e, leaf; | |
2150 | unsigned int i, tmp_hex_sha1_len, tmp_fullpath_len; | |
2151 | uintmax_t num_notes = 0; | |
2152 | unsigned char sha1[20]; | |
2153 | char realpath[60]; | |
2154 | ||
2155 | for (i = 0; t && i < t->entry_count; i++) { | |
2156 | e = t->entries[i]; | |
2157 | tmp_hex_sha1_len = hex_sha1_len + e->name->str_len; | |
2158 | tmp_fullpath_len = fullpath_len; | |
2159 | ||
2160 | /* | |
2161 | * We're interested in EITHER existing note entries (entries | |
2162 | * with exactly 40 hex chars in path, not including directory | |
2163 | * separators), OR directory entries that may contain note | |
2164 | * entries (with < 40 hex chars in path). | |
2165 | * Also, each path component in a note entry must be a multiple | |
2166 | * of 2 chars. | |
2167 | */ | |
2168 | if (!e->versions[1].mode || | |
2169 | tmp_hex_sha1_len > 40 || | |
2170 | e->name->str_len % 2) | |
2171 | continue; | |
2172 | ||
2173 | /* This _may_ be a note entry, or a subdir containing notes */ | |
2174 | memcpy(hex_sha1 + hex_sha1_len, e->name->str_dat, | |
2175 | e->name->str_len); | |
2176 | if (tmp_fullpath_len) | |
2177 | fullpath[tmp_fullpath_len++] = '/'; | |
2178 | memcpy(fullpath + tmp_fullpath_len, e->name->str_dat, | |
2179 | e->name->str_len); | |
2180 | tmp_fullpath_len += e->name->str_len; | |
2181 | fullpath[tmp_fullpath_len] = '\0'; | |
2182 | ||
2183 | if (tmp_hex_sha1_len == 40 && !get_sha1_hex(hex_sha1, sha1)) { | |
2184 | /* This is a note entry */ | |
18386857 JH |
2185 | if (fanout == 0xff) { |
2186 | /* Counting mode, no rename */ | |
2187 | num_notes++; | |
2188 | continue; | |
2189 | } | |
2a113aee JH |
2190 | construct_path_with_fanout(hex_sha1, fanout, realpath); |
2191 | if (!strcmp(fullpath, realpath)) { | |
2192 | /* Note entry is in correct location */ | |
2193 | num_notes++; | |
2194 | continue; | |
2195 | } | |
2196 | ||
2197 | /* Rename fullpath to realpath */ | |
62bfa11c | 2198 | if (!tree_content_remove(orig_root, fullpath, &leaf, 0)) |
2a113aee JH |
2199 | die("Failed to remove path %s", fullpath); |
2200 | tree_content_set(orig_root, realpath, | |
2201 | leaf.versions[1].sha1, | |
2202 | leaf.versions[1].mode, | |
2203 | leaf.tree); | |
2204 | } else if (S_ISDIR(e->versions[1].mode)) { | |
2205 | /* This is a subdir that may contain note entries */ | |
2206 | if (!e->tree) | |
2207 | load_tree(e); | |
2208 | num_notes += do_change_note_fanout(orig_root, e, | |
2209 | hex_sha1, tmp_hex_sha1_len, | |
2210 | fullpath, tmp_fullpath_len, fanout); | |
2211 | } | |
2212 | ||
2213 | /* The above may have reallocated the current tree_content */ | |
2214 | t = root->tree; | |
2215 | } | |
2216 | return num_notes; | |
2217 | } | |
2218 | ||
2219 | static uintmax_t change_note_fanout(struct tree_entry *root, | |
2220 | unsigned char fanout) | |
2221 | { | |
2222 | char hex_sha1[40], path[60]; | |
2223 | return do_change_note_fanout(root, root, hex_sha1, 0, path, 0, fanout); | |
2224 | } | |
2225 | ||
06454cb9 PW |
2226 | /* |
2227 | * Given a pointer into a string, parse a mark reference: | |
2228 | * | |
2229 | * idnum ::= ':' bigint; | |
2230 | * | |
2231 | * Return the first character after the value in *endptr. | |
2232 | * | |
2233 | * Complain if the following character is not what is expected, | |
2234 | * either a space or end of the string. | |
2235 | */ | |
2236 | static uintmax_t parse_mark_ref(const char *p, char **endptr) | |
2237 | { | |
2238 | uintmax_t mark; | |
2239 | ||
2240 | assert(*p == ':'); | |
2241 | p++; | |
2242 | mark = strtoumax(p, endptr, 10); | |
2243 | if (*endptr == p) | |
2244 | die("No value after ':' in mark: %s", command_buf.buf); | |
2245 | return mark; | |
2246 | } | |
2247 | ||
2248 | /* | |
2249 | * Parse the mark reference, and complain if this is not the end of | |
2250 | * the string. | |
2251 | */ | |
2252 | static uintmax_t parse_mark_ref_eol(const char *p) | |
2253 | { | |
2254 | char *end; | |
2255 | uintmax_t mark; | |
2256 | ||
2257 | mark = parse_mark_ref(p, &end); | |
2258 | if (*end != '\0') | |
2259 | die("Garbage after mark: %s", command_buf.buf); | |
2260 | return mark; | |
2261 | } | |
2262 | ||
2263 | /* | |
2264 | * Parse the mark reference, demanding a trailing space. Return a | |
2265 | * pointer to the space. | |
2266 | */ | |
2267 | static uintmax_t parse_mark_ref_space(const char **p) | |
2268 | { | |
2269 | uintmax_t mark; | |
2270 | char *end; | |
2271 | ||
2272 | mark = parse_mark_ref(*p, &end); | |
2273 | if (*end != ' ') | |
2274 | die("Missing space after mark: %s", command_buf.buf); | |
2275 | *p = end; | |
2276 | return mark; | |
2277 | } | |
2278 | ||
463acbe1 | 2279 | static void file_change_m(struct branch *b) |
6bb5b329 | 2280 | { |
c44cdc7e | 2281 | const char *p = command_buf.buf + 2; |
7fb1011e | 2282 | static struct strbuf uq = STRBUF_INIT; |
c44cdc7e | 2283 | const char *endp; |
3aa99df8 | 2284 | struct object_entry *oe; |
463acbe1 | 2285 | unsigned char sha1[20]; |
10831c55 | 2286 | uint16_t mode, inline_data = 0; |
6bb5b329 | 2287 | |
c44cdc7e SP |
2288 | p = get_mode(p, &mode); |
2289 | if (!p) | |
2290 | die("Corrupt mode: %s", command_buf.buf); | |
2291 | switch (mode) { | |
3d1d81eb FC |
2292 | case 0644: |
2293 | case 0755: | |
2294 | mode |= S_IFREG; | |
c44cdc7e SP |
2295 | case S_IFREG | 0644: |
2296 | case S_IFREG | 0755: | |
ace4a9d1 | 2297 | case S_IFLNK: |
334fba65 | 2298 | case S_IFDIR: |
03db4525 | 2299 | case S_IFGITLINK: |
c44cdc7e SP |
2300 | /* ok */ |
2301 | break; | |
2302 | default: | |
2303 | die("Corrupt mode: %s", command_buf.buf); | |
2304 | } | |
2305 | ||
d8397168 | 2306 | if (*p == ':') { |
06454cb9 | 2307 | oe = find_mark(parse_mark_ref_space(&p)); |
3fc366bd | 2308 | hashcpy(sha1, oe->idx.sha1); |
06454cb9 | 2309 | } else if (!prefixcmp(p, "inline ")) { |
b715cfbb | 2310 | inline_data = 1; |
3aa99df8 | 2311 | oe = NULL; /* not used with inline_data, but makes gcc happy */ |
06454cb9 | 2312 | p += strlen("inline"); /* advance to space */ |
d8397168 SP |
2313 | } else { |
2314 | if (get_sha1_hex(p, sha1)) | |
06454cb9 | 2315 | die("Invalid dataref: %s", command_buf.buf); |
d8397168 SP |
2316 | oe = find_object(sha1); |
2317 | p += 40; | |
06454cb9 PW |
2318 | if (*p != ' ') |
2319 | die("Missing space after SHA1: %s", command_buf.buf); | |
d8397168 | 2320 | } |
06454cb9 PW |
2321 | assert(*p == ' '); |
2322 | p++; /* skip space */ | |
c44cdc7e | 2323 | |
7fb1011e PH |
2324 | strbuf_reset(&uq); |
2325 | if (!unquote_c_style(&uq, p, &endp)) { | |
c44cdc7e SP |
2326 | if (*endp) |
2327 | die("Garbage after path in: %s", command_buf.buf); | |
7fb1011e | 2328 | p = uq.buf; |
c44cdc7e | 2329 | } |
6bb5b329 | 2330 | |
8fe533f6 JN |
2331 | /* Git does not track empty, non-toplevel directories. */ |
2332 | if (S_ISDIR(mode) && !memcmp(sha1, EMPTY_TREE_SHA1_BIN, 20) && *p) { | |
62bfa11c | 2333 | tree_content_remove(&b->branch_tree, p, NULL, 0); |
8fe533f6 JN |
2334 | return; |
2335 | } | |
2336 | ||
03db4525 AG |
2337 | if (S_ISGITLINK(mode)) { |
2338 | if (inline_data) | |
2339 | die("Git links cannot be specified 'inline': %s", | |
2340 | command_buf.buf); | |
2341 | else if (oe) { | |
2342 | if (oe->type != OBJ_COMMIT) | |
2343 | die("Not a commit (actually a %s): %s", | |
2344 | typename(oe->type), command_buf.buf); | |
2345 | } | |
2346 | /* | |
2347 | * Accept the sha1 without checking; it expected to be in | |
2348 | * another repository. | |
2349 | */ | |
2350 | } else if (inline_data) { | |
334fba65 JN |
2351 | if (S_ISDIR(mode)) |
2352 | die("Directories cannot be specified 'inline': %s", | |
2353 | command_buf.buf); | |
7fb1011e PH |
2354 | if (p != uq.buf) { |
2355 | strbuf_addstr(&uq, p); | |
2356 | p = uq.buf; | |
2357 | } | |
b715cfbb | 2358 | read_next_command(); |
5eef828b | 2359 | parse_and_store_blob(&last_blob, sha1, 0); |
7111feed | 2360 | } else { |
334fba65 JN |
2361 | enum object_type expected = S_ISDIR(mode) ? |
2362 | OBJ_TREE: OBJ_BLOB; | |
2363 | enum object_type type = oe ? oe->type : | |
2364 | sha1_object_info(sha1, NULL); | |
21666f1a | 2365 | if (type < 0) |
334fba65 JN |
2366 | die("%s not found: %s", |
2367 | S_ISDIR(mode) ? "Tree" : "Blob", | |
2368 | command_buf.buf); | |
2369 | if (type != expected) | |
2370 | die("Not a %s (actually a %s): %s", | |
2371 | typename(expected), typename(type), | |
2372 | command_buf.buf); | |
7111feed | 2373 | } |
6bb5b329 | 2374 | |
34215783 JN |
2375 | if (!*p) { |
2376 | tree_content_replace(&b->branch_tree, sha1, mode, NULL); | |
2377 | return; | |
2378 | } | |
3d1d81eb | 2379 | tree_content_set(&b->branch_tree, p, sha1, mode, NULL); |
463acbe1 | 2380 | } |
6bb5b329 | 2381 | |
463acbe1 SP |
2382 | static void file_change_d(struct branch *b) |
2383 | { | |
c44cdc7e | 2384 | const char *p = command_buf.buf + 2; |
7fb1011e | 2385 | static struct strbuf uq = STRBUF_INIT; |
c44cdc7e SP |
2386 | const char *endp; |
2387 | ||
7fb1011e PH |
2388 | strbuf_reset(&uq); |
2389 | if (!unquote_c_style(&uq, p, &endp)) { | |
c44cdc7e SP |
2390 | if (*endp) |
2391 | die("Garbage after path in: %s", command_buf.buf); | |
7fb1011e | 2392 | p = uq.buf; |
c44cdc7e | 2393 | } |
62bfa11c | 2394 | tree_content_remove(&b->branch_tree, p, NULL, 1); |
6bb5b329 SP |
2395 | } |
2396 | ||
b6f3481b | 2397 | static void file_change_cr(struct branch *b, int rename) |
f39a946a SP |
2398 | { |
2399 | const char *s, *d; | |
7fb1011e PH |
2400 | static struct strbuf s_uq = STRBUF_INIT; |
2401 | static struct strbuf d_uq = STRBUF_INIT; | |
f39a946a SP |
2402 | const char *endp; |
2403 | struct tree_entry leaf; | |
2404 | ||
2405 | s = command_buf.buf + 2; | |
7fb1011e PH |
2406 | strbuf_reset(&s_uq); |
2407 | if (!unquote_c_style(&s_uq, s, &endp)) { | |
f39a946a SP |
2408 | if (*endp != ' ') |
2409 | die("Missing space after source: %s", command_buf.buf); | |
7fb1011e | 2410 | } else { |
f39a946a SP |
2411 | endp = strchr(s, ' '); |
2412 | if (!endp) | |
2413 | die("Missing space after source: %s", command_buf.buf); | |
7fb1011e | 2414 | strbuf_add(&s_uq, s, endp - s); |
f39a946a | 2415 | } |
7fb1011e | 2416 | s = s_uq.buf; |
f39a946a SP |
2417 | |
2418 | endp++; | |
2419 | if (!*endp) | |
2420 | die("Missing dest: %s", command_buf.buf); | |
2421 | ||
2422 | d = endp; | |
7fb1011e PH |
2423 | strbuf_reset(&d_uq); |
2424 | if (!unquote_c_style(&d_uq, d, &endp)) { | |
f39a946a SP |
2425 | if (*endp) |
2426 | die("Garbage after dest in: %s", command_buf.buf); | |
7fb1011e | 2427 | d = d_uq.buf; |
f39a946a SP |
2428 | } |
2429 | ||
2430 | memset(&leaf, 0, sizeof(leaf)); | |
b6f3481b | 2431 | if (rename) |
62bfa11c | 2432 | tree_content_remove(&b->branch_tree, s, &leaf, 1); |
b6f3481b | 2433 | else |
e0eb6b97 | 2434 | tree_content_get(&b->branch_tree, s, &leaf, 1); |
f39a946a SP |
2435 | if (!leaf.versions[1].mode) |
2436 | die("Path %s not in branch", s); | |
34215783 JN |
2437 | if (!*d) { /* C "path/to/subdir" "" */ |
2438 | tree_content_replace(&b->branch_tree, | |
2439 | leaf.versions[1].sha1, | |
2440 | leaf.versions[1].mode, | |
2441 | leaf.tree); | |
2442 | return; | |
2443 | } | |
f39a946a SP |
2444 | tree_content_set(&b->branch_tree, d, |
2445 | leaf.versions[1].sha1, | |
2446 | leaf.versions[1].mode, | |
2447 | leaf.tree); | |
f39a946a SP |
2448 | } |
2449 | ||
18386857 | 2450 | static void note_change_n(struct branch *b, unsigned char *old_fanout) |
a8dd2e7d JH |
2451 | { |
2452 | const char *p = command_buf.buf + 2; | |
2453 | static struct strbuf uq = STRBUF_INIT; | |
cbfd5e1c | 2454 | struct object_entry *oe; |
a8dd2e7d JH |
2455 | struct branch *s; |
2456 | unsigned char sha1[20], commit_sha1[20]; | |
2a113aee | 2457 | char path[60]; |
a8dd2e7d | 2458 | uint16_t inline_data = 0; |
2a113aee | 2459 | unsigned char new_fanout; |
a8dd2e7d | 2460 | |
18386857 JH |
2461 | /* |
2462 | * When loading a branch, we don't traverse its tree to count the real | |
2463 | * number of notes (too expensive to do this for all non-note refs). | |
2464 | * This means that recently loaded notes refs might incorrectly have | |
2465 | * b->num_notes == 0, and consequently, old_fanout might be wrong. | |
2466 | * | |
2467 | * Fix this by traversing the tree and counting the number of notes | |
2468 | * when b->num_notes == 0. If the notes tree is truly empty, the | |
2469 | * calculation should not take long. | |
2470 | */ | |
2471 | if (b->num_notes == 0 && *old_fanout == 0) { | |
2472 | /* Invoke change_note_fanout() in "counting mode". */ | |
2473 | b->num_notes = change_note_fanout(&b->branch_tree, 0xff); | |
2474 | *old_fanout = convert_num_notes_to_fanout(b->num_notes); | |
2475 | } | |
2476 | ||
2477 | /* Now parse the notemodify command. */ | |
a8dd2e7d JH |
2478 | /* <dataref> or 'inline' */ |
2479 | if (*p == ':') { | |
06454cb9 | 2480 | oe = find_mark(parse_mark_ref_space(&p)); |
3fc366bd | 2481 | hashcpy(sha1, oe->idx.sha1); |
06454cb9 | 2482 | } else if (!prefixcmp(p, "inline ")) { |
a8dd2e7d | 2483 | inline_data = 1; |
0a34594c | 2484 | oe = NULL; /* not used with inline_data, but makes gcc happy */ |
06454cb9 | 2485 | p += strlen("inline"); /* advance to space */ |
a8dd2e7d JH |
2486 | } else { |
2487 | if (get_sha1_hex(p, sha1)) | |
06454cb9 | 2488 | die("Invalid dataref: %s", command_buf.buf); |
a8dd2e7d JH |
2489 | oe = find_object(sha1); |
2490 | p += 40; | |
06454cb9 PW |
2491 | if (*p != ' ') |
2492 | die("Missing space after SHA1: %s", command_buf.buf); | |
a8dd2e7d | 2493 | } |
06454cb9 PW |
2494 | assert(*p == ' '); |
2495 | p++; /* skip space */ | |
a8dd2e7d | 2496 | |
a8a5406a | 2497 | /* <commit-ish> */ |
a8dd2e7d JH |
2498 | s = lookup_branch(p); |
2499 | if (s) { | |
0bc69881 DI |
2500 | if (is_null_sha1(s->sha1)) |
2501 | die("Can't add a note on empty branch."); | |
a8dd2e7d JH |
2502 | hashcpy(commit_sha1, s->sha1); |
2503 | } else if (*p == ':') { | |
06454cb9 | 2504 | uintmax_t commit_mark = parse_mark_ref_eol(p); |
a8dd2e7d JH |
2505 | struct object_entry *commit_oe = find_mark(commit_mark); |
2506 | if (commit_oe->type != OBJ_COMMIT) | |
2507 | die("Mark :%" PRIuMAX " not a commit", commit_mark); | |
3fc366bd | 2508 | hashcpy(commit_sha1, commit_oe->idx.sha1); |
a8dd2e7d JH |
2509 | } else if (!get_sha1(p, commit_sha1)) { |
2510 | unsigned long size; | |
2511 | char *buf = read_object_with_reference(commit_sha1, | |
2512 | commit_type, &size, commit_sha1); | |
2513 | if (!buf || size < 46) | |
2514 | die("Not a valid commit: %s", p); | |
2515 | free(buf); | |
2516 | } else | |
2517 | die("Invalid ref name or SHA1 expression: %s", p); | |
2518 | ||
2519 | if (inline_data) { | |
a8dd2e7d JH |
2520 | if (p != uq.buf) { |
2521 | strbuf_addstr(&uq, p); | |
2522 | p = uq.buf; | |
2523 | } | |
2524 | read_next_command(); | |
5eef828b | 2525 | parse_and_store_blob(&last_blob, sha1, 0); |
a8dd2e7d JH |
2526 | } else if (oe) { |
2527 | if (oe->type != OBJ_BLOB) | |
2528 | die("Not a blob (actually a %s): %s", | |
2529 | typename(oe->type), command_buf.buf); | |
2a113aee | 2530 | } else if (!is_null_sha1(sha1)) { |
a8dd2e7d JH |
2531 | enum object_type type = sha1_object_info(sha1, NULL); |
2532 | if (type < 0) | |
2533 | die("Blob not found: %s", command_buf.buf); | |
2534 | if (type != OBJ_BLOB) | |
2535 | die("Not a blob (actually a %s): %s", | |
2536 | typename(type), command_buf.buf); | |
2537 | } | |
2538 | ||
18386857 | 2539 | construct_path_with_fanout(sha1_to_hex(commit_sha1), *old_fanout, path); |
62bfa11c | 2540 | if (tree_content_remove(&b->branch_tree, path, NULL, 0)) |
2a113aee JH |
2541 | b->num_notes--; |
2542 | ||
2543 | if (is_null_sha1(sha1)) | |
2544 | return; /* nothing to insert */ | |
2545 | ||
2546 | b->num_notes++; | |
2547 | new_fanout = convert_num_notes_to_fanout(b->num_notes); | |
2548 | construct_path_with_fanout(sha1_to_hex(commit_sha1), new_fanout, path); | |
2549 | tree_content_set(&b->branch_tree, path, sha1, S_IFREG | 0644, NULL); | |
a8dd2e7d JH |
2550 | } |
2551 | ||
825769a8 SP |
2552 | static void file_change_deleteall(struct branch *b) |
2553 | { | |
2554 | release_tree_content_recursive(b->branch_tree.tree); | |
2555 | hashclr(b->branch_tree.versions[0].sha1); | |
2556 | hashclr(b->branch_tree.versions[1].sha1); | |
2557 | load_tree(&b->branch_tree); | |
2a113aee | 2558 | b->num_notes = 0; |
825769a8 SP |
2559 | } |
2560 | ||
b3031781 | 2561 | static void parse_from_commit(struct branch *b, char *buf, unsigned long size) |
654aaa37 SP |
2562 | { |
2563 | if (!buf || size < 46) | |
2564 | die("Not a valid commit: %s", sha1_to_hex(b->sha1)); | |
2565 | if (memcmp("tree ", buf, 5) | |
2566 | || get_sha1_hex(buf + 5, b->branch_tree.versions[1].sha1)) | |
2567 | die("The commit %s is corrupt", sha1_to_hex(b->sha1)); | |
2568 | hashcpy(b->branch_tree.versions[0].sha1, | |
2569 | b->branch_tree.versions[1].sha1); | |
2570 | } | |
2571 | ||
b3031781 | 2572 | static void parse_from_existing(struct branch *b) |
654aaa37 SP |
2573 | { |
2574 | if (is_null_sha1(b->sha1)) { | |
2575 | hashclr(b->branch_tree.versions[0].sha1); | |
2576 | hashclr(b->branch_tree.versions[1].sha1); | |
2577 | } else { | |
2578 | unsigned long size; | |
2579 | char *buf; | |
2580 | ||
2581 | buf = read_object_with_reference(b->sha1, | |
2582 | commit_type, &size, b->sha1); | |
b3031781 | 2583 | parse_from_commit(b, buf, size); |
654aaa37 SP |
2584 | free(buf); |
2585 | } | |
2586 | } | |
2587 | ||
b3031781 | 2588 | static int parse_from(struct branch *b) |
00e2b884 | 2589 | { |
6c3aac1c | 2590 | const char *from; |
00e2b884 SP |
2591 | struct branch *s; |
2592 | ||
599065a3 | 2593 | if (prefixcmp(command_buf.buf, "from ")) |
1fdb649c | 2594 | return 0; |
00e2b884 | 2595 | |
ea5e370a SP |
2596 | if (b->branch_tree.tree) { |
2597 | release_tree_content_recursive(b->branch_tree.tree); | |
2598 | b->branch_tree.tree = NULL; | |
2599 | } | |
00e2b884 SP |
2600 | |
2601 | from = strchr(command_buf.buf, ' ') + 1; | |
00e2b884 SP |
2602 | s = lookup_branch(from); |
2603 | if (b == s) | |
2604 | die("Can't create a branch from itself: %s", b->name); | |
2605 | else if (s) { | |
4cabf858 | 2606 | unsigned char *t = s->branch_tree.versions[1].sha1; |
445b8599 | 2607 | hashcpy(b->sha1, s->sha1); |
4cabf858 SP |
2608 | hashcpy(b->branch_tree.versions[0].sha1, t); |
2609 | hashcpy(b->branch_tree.versions[1].sha1, t); | |
00e2b884 | 2610 | } else if (*from == ':') { |
06454cb9 | 2611 | uintmax_t idnum = parse_mark_ref_eol(from); |
00e2b884 | 2612 | struct object_entry *oe = find_mark(idnum); |
00e2b884 | 2613 | if (oe->type != OBJ_COMMIT) |
3efb1f34 | 2614 | die("Mark :%" PRIuMAX " not a commit", idnum); |
3fc366bd | 2615 | hashcpy(b->sha1, oe->idx.sha1); |
aac65ed1 | 2616 | if (oe->pack_id != MAX_PACK_ID) { |
00e2b884 | 2617 | unsigned long size; |
aac65ed1 | 2618 | char *buf = gfi_unpack_entry(oe, &size); |
b3031781 | 2619 | parse_from_commit(b, buf, size); |
00e2b884 | 2620 | free(buf); |
aac65ed1 | 2621 | } else |
b3031781 | 2622 | parse_from_existing(b); |
654aaa37 | 2623 | } else if (!get_sha1(from, b->sha1)) |
b3031781 | 2624 | parse_from_existing(b); |
654aaa37 | 2625 | else |
00e2b884 SP |
2626 | die("Invalid ref name or SHA1 expression: %s", from); |
2627 | ||
2628 | read_next_command(); | |
1fdb649c | 2629 | return 1; |
00e2b884 SP |
2630 | } |
2631 | ||
b3031781 | 2632 | static struct hash_list *parse_merge(unsigned int *count) |
62b6f483 | 2633 | { |
4db34cc1 | 2634 | struct hash_list *list = NULL, **tail = &list, *n; |
6c3aac1c | 2635 | const char *from; |
62b6f483 SP |
2636 | struct branch *s; |
2637 | ||
2638 | *count = 0; | |
599065a3 | 2639 | while (!prefixcmp(command_buf.buf, "merge ")) { |
62b6f483 | 2640 | from = strchr(command_buf.buf, ' ') + 1; |
62b6f483 SP |
2641 | n = xmalloc(sizeof(*n)); |
2642 | s = lookup_branch(from); | |
2643 | if (s) | |
2644 | hashcpy(n->sha1, s->sha1); | |
2645 | else if (*from == ':') { | |
06454cb9 | 2646 | uintmax_t idnum = parse_mark_ref_eol(from); |
62b6f483 SP |
2647 | struct object_entry *oe = find_mark(idnum); |
2648 | if (oe->type != OBJ_COMMIT) | |
3efb1f34 | 2649 | die("Mark :%" PRIuMAX " not a commit", idnum); |
3fc366bd | 2650 | hashcpy(n->sha1, oe->idx.sha1); |
2f6dc35d SP |
2651 | } else if (!get_sha1(from, n->sha1)) { |
2652 | unsigned long size; | |
2653 | char *buf = read_object_with_reference(n->sha1, | |
6b4318e6 | 2654 | commit_type, &size, n->sha1); |
2f6dc35d SP |
2655 | if (!buf || size < 46) |
2656 | die("Not a valid commit: %s", from); | |
2657 | free(buf); | |
2658 | } else | |
62b6f483 SP |
2659 | die("Invalid ref name or SHA1 expression: %s", from); |
2660 | ||
2661 | n->next = NULL; | |
4db34cc1 JK |
2662 | *tail = n; |
2663 | tail = &n->next; | |
2664 | ||
10e8d688 | 2665 | (*count)++; |
62b6f483 SP |
2666 | read_next_command(); |
2667 | } | |
2668 | return list; | |
2669 | } | |
2670 | ||
b3031781 | 2671 | static void parse_new_commit(void) |
6bb5b329 | 2672 | { |
eec813cf | 2673 | static struct strbuf msg = STRBUF_INIT; |
c44cdc7e | 2674 | struct branch *b; |
c44cdc7e SP |
2675 | char *sp; |
2676 | char *author = NULL; | |
2677 | char *committer = NULL; | |
62b6f483 SP |
2678 | struct hash_list *merge_list = NULL; |
2679 | unsigned int merge_count; | |
2a113aee | 2680 | unsigned char prev_fanout, new_fanout; |
c44cdc7e SP |
2681 | |
2682 | /* Obtain the branch name from the rest of our command */ | |
2683 | sp = strchr(command_buf.buf, ' ') + 1; | |
c44cdc7e | 2684 | b = lookup_branch(sp); |
463acbe1 | 2685 | if (!b) |
00e2b884 | 2686 | b = new_branch(sp); |
c44cdc7e SP |
2687 | |
2688 | read_next_command(); | |
b3031781 | 2689 | parse_mark(); |
599065a3 | 2690 | if (!prefixcmp(command_buf.buf, "author ")) { |
63e0c8b3 | 2691 | author = parse_ident(command_buf.buf + 7); |
c44cdc7e SP |
2692 | read_next_command(); |
2693 | } | |
599065a3 | 2694 | if (!prefixcmp(command_buf.buf, "committer ")) { |
63e0c8b3 | 2695 | committer = parse_ident(command_buf.buf + 10); |
c44cdc7e SP |
2696 | read_next_command(); |
2697 | } | |
2698 | if (!committer) | |
2699 | die("Expected committer but didn't get one"); | |
5eef828b | 2700 | parse_data(&msg, 0, NULL); |
02f3389d | 2701 | read_next_command(); |
b3031781 MV |
2702 | parse_from(b); |
2703 | merge_list = parse_merge(&merge_count); | |
c44cdc7e SP |
2704 | |
2705 | /* ensure the branch is active/loaded */ | |
41e5257f | 2706 | if (!b->branch_tree.tree || !max_active_branches) { |
463acbe1 SP |
2707 | unload_one_branch(); |
2708 | load_branch(b); | |
2709 | } | |
6bb5b329 | 2710 | |
2a113aee JH |
2711 | prev_fanout = convert_num_notes_to_fanout(b->num_notes); |
2712 | ||
463acbe1 | 2713 | /* file_change* */ |
e6c019d0 | 2714 | while (command_buf.len > 0) { |
1fdb649c | 2715 | if (!prefixcmp(command_buf.buf, "M ")) |
463acbe1 | 2716 | file_change_m(b); |
599065a3 | 2717 | else if (!prefixcmp(command_buf.buf, "D ")) |
463acbe1 | 2718 | file_change_d(b); |
f39a946a | 2719 | else if (!prefixcmp(command_buf.buf, "R ")) |
b6f3481b SP |
2720 | file_change_cr(b, 1); |
2721 | else if (!prefixcmp(command_buf.buf, "C ")) | |
2722 | file_change_cr(b, 0); | |
a8dd2e7d | 2723 | else if (!prefixcmp(command_buf.buf, "N ")) |
18386857 | 2724 | note_change_n(b, &prev_fanout); |
825769a8 SP |
2725 | else if (!strcmp("deleteall", command_buf.buf)) |
2726 | file_change_deleteall(b); | |
8dc6a373 DB |
2727 | else if (!prefixcmp(command_buf.buf, "ls ")) |
2728 | parse_ls(b); | |
1fdb649c SP |
2729 | else { |
2730 | unread_command_buf = 1; | |
2731 | break; | |
2732 | } | |
e6c019d0 PH |
2733 | if (read_next_command() == EOF) |
2734 | break; | |
6bb5b329 | 2735 | } |
6bb5b329 | 2736 | |
2a113aee JH |
2737 | new_fanout = convert_num_notes_to_fanout(b->num_notes); |
2738 | if (new_fanout != prev_fanout) | |
2739 | b->num_notes = change_note_fanout(&b->branch_tree, new_fanout); | |
2740 | ||
c44cdc7e | 2741 | /* build the tree and the commit */ |
463acbe1 | 2742 | store_tree(&b->branch_tree); |
8a8c55ea SP |
2743 | hashcpy(b->branch_tree.versions[0].sha1, |
2744 | b->branch_tree.versions[1].sha1); | |
eec813cf PH |
2745 | |
2746 | strbuf_reset(&new_data); | |
2747 | strbuf_addf(&new_data, "tree %s\n", | |
4cabf858 | 2748 | sha1_to_hex(b->branch_tree.versions[1].sha1)); |
445b8599 | 2749 | if (!is_null_sha1(b->sha1)) |
eec813cf | 2750 | strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(b->sha1)); |
62b6f483 SP |
2751 | while (merge_list) { |
2752 | struct hash_list *next = merge_list->next; | |
eec813cf | 2753 | strbuf_addf(&new_data, "parent %s\n", sha1_to_hex(merge_list->sha1)); |
62b6f483 SP |
2754 | free(merge_list); |
2755 | merge_list = next; | |
2756 | } | |
eec813cf PH |
2757 | strbuf_addf(&new_data, |
2758 | "author %s\n" | |
2759 | "committer %s\n" | |
2760 | "\n", | |
2761 | author ? author : committer, committer); | |
2762 | strbuf_addbuf(&new_data, &msg); | |
e7d06a4b | 2763 | free(author); |
c44cdc7e | 2764 | free(committer); |
c44cdc7e | 2765 | |
eec813cf | 2766 | if (!store_object(OBJ_COMMIT, &new_data, NULL, b->sha1, next_mark)) |
69e74e74 | 2767 | b->pack_id = pack_id; |
463acbe1 | 2768 | b->last_commit = object_count_by_type[OBJ_COMMIT]; |
6bb5b329 SP |
2769 | } |
2770 | ||
b3031781 | 2771 | static void parse_new_tag(void) |
72303d44 | 2772 | { |
eec813cf | 2773 | static struct strbuf msg = STRBUF_INIT; |
72303d44 SP |
2774 | char *sp; |
2775 | const char *from; | |
2776 | char *tagger; | |
2777 | struct branch *s; | |
72303d44 | 2778 | struct tag *t; |
0ea9f045 | 2779 | uintmax_t from_mark = 0; |
72303d44 | 2780 | unsigned char sha1[20]; |
8db751a8 | 2781 | enum object_type type; |
72303d44 SP |
2782 | |
2783 | /* Obtain the new tag name from the rest of our command */ | |
2784 | sp = strchr(command_buf.buf, ' ') + 1; | |
72303d44 | 2785 | t = pool_alloc(sizeof(struct tag)); |
a8ea1b7a | 2786 | memset(t, 0, sizeof(struct tag)); |
72303d44 SP |
2787 | t->name = pool_strdup(sp); |
2788 | if (last_tag) | |
2789 | last_tag->next_tag = t; | |
2790 | else | |
2791 | first_tag = t; | |
2792 | last_tag = t; | |
72303d44 SP |
2793 | read_next_command(); |
2794 | ||
2795 | /* from ... */ | |
599065a3 | 2796 | if (prefixcmp(command_buf.buf, "from ")) |
72303d44 | 2797 | die("Expected from command, got %s", command_buf.buf); |
72303d44 | 2798 | from = strchr(command_buf.buf, ' ') + 1; |
72303d44 SP |
2799 | s = lookup_branch(from); |
2800 | if (s) { | |
2c9c8ee2 DI |
2801 | if (is_null_sha1(s->sha1)) |
2802 | die("Can't tag an empty branch."); | |
445b8599 | 2803 | hashcpy(sha1, s->sha1); |
8db751a8 | 2804 | type = OBJ_COMMIT; |
72303d44 | 2805 | } else if (*from == ':') { |
10e8d688 | 2806 | struct object_entry *oe; |
06454cb9 | 2807 | from_mark = parse_mark_ref_eol(from); |
10e8d688 | 2808 | oe = find_mark(from_mark); |
8db751a8 | 2809 | type = oe->type; |
3fc366bd | 2810 | hashcpy(sha1, oe->idx.sha1); |
72303d44 | 2811 | } else if (!get_sha1(from, sha1)) { |
6c447f63 DI |
2812 | struct object_entry *oe = find_object(sha1); |
2813 | if (!oe) { | |
2814 | type = sha1_object_info(sha1, NULL); | |
2815 | if (type < 0) | |
2816 | die("Not a valid object: %s", from); | |
2817 | } else | |
2818 | type = oe->type; | |
72303d44 SP |
2819 | } else |
2820 | die("Invalid ref name or SHA1 expression: %s", from); | |
72303d44 SP |
2821 | read_next_command(); |
2822 | ||
2823 | /* tagger ... */ | |
88fbf67b JH |
2824 | if (!prefixcmp(command_buf.buf, "tagger ")) { |
2825 | tagger = parse_ident(command_buf.buf + 7); | |
2826 | read_next_command(); | |
2827 | } else | |
2828 | tagger = NULL; | |
72303d44 SP |
2829 | |
2830 | /* tag payload/message */ | |
5eef828b | 2831 | parse_data(&msg, 0, NULL); |
72303d44 SP |
2832 | |
2833 | /* build the tag object */ | |
eec813cf | 2834 | strbuf_reset(&new_data); |
88fbf67b | 2835 | |
eec813cf | 2836 | strbuf_addf(&new_data, |
88fbf67b JH |
2837 | "object %s\n" |
2838 | "type %s\n" | |
2839 | "tag %s\n", | |
8db751a8 | 2840 | sha1_to_hex(sha1), typename(type), t->name); |
88fbf67b JH |
2841 | if (tagger) |
2842 | strbuf_addf(&new_data, | |
2843 | "tagger %s\n", tagger); | |
2844 | strbuf_addch(&new_data, '\n'); | |
eec813cf | 2845 | strbuf_addbuf(&new_data, &msg); |
72303d44 | 2846 | free(tagger); |
72303d44 | 2847 | |
eec813cf | 2848 | if (store_object(OBJ_TAG, &new_data, NULL, t->sha1, 0)) |
69e74e74 SP |
2849 | t->pack_id = MAX_PACK_ID; |
2850 | else | |
2851 | t->pack_id = pack_id; | |
72303d44 SP |
2852 | } |
2853 | ||
b3031781 | 2854 | static void parse_reset_branch(void) |
5fced8dc SP |
2855 | { |
2856 | struct branch *b; | |
5fced8dc SP |
2857 | char *sp; |
2858 | ||
2859 | /* Obtain the branch name from the rest of our command */ | |
2860 | sp = strchr(command_buf.buf, ' ') + 1; | |
5fced8dc SP |
2861 | b = lookup_branch(sp); |
2862 | if (b) { | |
ea5e370a SP |
2863 | hashclr(b->sha1); |
2864 | hashclr(b->branch_tree.versions[0].sha1); | |
2865 | hashclr(b->branch_tree.versions[1].sha1); | |
5fced8dc SP |
2866 | if (b->branch_tree.tree) { |
2867 | release_tree_content_recursive(b->branch_tree.tree); | |
2868 | b->branch_tree.tree = NULL; | |
2869 | } | |
2870 | } | |
9938ffc5 SP |
2871 | else |
2872 | b = new_branch(sp); | |
9938ffc5 | 2873 | read_next_command(); |
b3031781 | 2874 | parse_from(b); |
655e8515 | 2875 | if (command_buf.len > 0) |
1fdb649c | 2876 | unread_command_buf = 1; |
5fced8dc SP |
2877 | } |
2878 | ||
85c62395 DB |
2879 | static void cat_blob_write(const char *buf, unsigned long size) |
2880 | { | |
2881 | if (write_in_full(cat_blob_fd, buf, size) != size) | |
2882 | die_errno("Write to frontend failed"); | |
2883 | } | |
2884 | ||
2885 | static void cat_blob(struct object_entry *oe, unsigned char sha1[20]) | |
2886 | { | |
2887 | struct strbuf line = STRBUF_INIT; | |
2888 | unsigned long size; | |
2889 | enum object_type type = 0; | |
2890 | char *buf; | |
2891 | ||
2892 | if (!oe || oe->pack_id == MAX_PACK_ID) { | |
2893 | buf = read_sha1_file(sha1, &type, &size); | |
2894 | } else { | |
2895 | type = oe->type; | |
2896 | buf = gfi_unpack_entry(oe, &size); | |
2897 | } | |
2898 | ||
2899 | /* | |
2900 | * Output based on batch_one_object() from cat-file.c. | |
2901 | */ | |
2902 | if (type <= 0) { | |
2903 | strbuf_reset(&line); | |
2904 | strbuf_addf(&line, "%s missing\n", sha1_to_hex(sha1)); | |
2905 | cat_blob_write(line.buf, line.len); | |
2906 | strbuf_release(&line); | |
2907 | free(buf); | |
2908 | return; | |
2909 | } | |
2910 | if (!buf) | |
2911 | die("Can't read object %s", sha1_to_hex(sha1)); | |
2912 | if (type != OBJ_BLOB) | |
2913 | die("Object %s is a %s but a blob was expected.", | |
2914 | sha1_to_hex(sha1), typename(type)); | |
2915 | strbuf_reset(&line); | |
2916 | strbuf_addf(&line, "%s %s %lu\n", sha1_to_hex(sha1), | |
2917 | typename(type), size); | |
2918 | cat_blob_write(line.buf, line.len); | |
2919 | strbuf_release(&line); | |
2920 | cat_blob_write(buf, size); | |
2921 | cat_blob_write("\n", 1); | |
a7e9c341 DI |
2922 | if (oe && oe->pack_id == pack_id) { |
2923 | last_blob.offset = oe->idx.offset; | |
2924 | strbuf_attach(&last_blob.data, buf, size, size); | |
2925 | last_blob.depth = oe->depth; | |
2926 | } else | |
2927 | free(buf); | |
85c62395 DB |
2928 | } |
2929 | ||
2930 | static void parse_cat_blob(void) | |
2931 | { | |
2932 | const char *p; | |
2933 | struct object_entry *oe = oe; | |
2934 | unsigned char sha1[20]; | |
2935 | ||
2936 | /* cat-blob SP <object> LF */ | |
2937 | p = command_buf.buf + strlen("cat-blob "); | |
2938 | if (*p == ':') { | |
06454cb9 | 2939 | oe = find_mark(parse_mark_ref_eol(p)); |
85c62395 DB |
2940 | if (!oe) |
2941 | die("Unknown mark: %s", command_buf.buf); | |
85c62395 DB |
2942 | hashcpy(sha1, oe->idx.sha1); |
2943 | } else { | |
2944 | if (get_sha1_hex(p, sha1)) | |
06454cb9 | 2945 | die("Invalid dataref: %s", command_buf.buf); |
85c62395 DB |
2946 | if (p[40]) |
2947 | die("Garbage after SHA1: %s", command_buf.buf); | |
2948 | oe = find_object(sha1); | |
2949 | } | |
2950 | ||
2951 | cat_blob(oe, sha1); | |
2952 | } | |
2953 | ||
8dc6a373 DB |
2954 | static struct object_entry *dereference(struct object_entry *oe, |
2955 | unsigned char sha1[20]) | |
2956 | { | |
2957 | unsigned long size; | |
6288e3e1 | 2958 | char *buf = NULL; |
8dc6a373 DB |
2959 | if (!oe) { |
2960 | enum object_type type = sha1_object_info(sha1, NULL); | |
2961 | if (type < 0) | |
2962 | die("object not found: %s", sha1_to_hex(sha1)); | |
2963 | /* cache it! */ | |
2964 | oe = insert_object(sha1); | |
2965 | oe->type = type; | |
2966 | oe->pack_id = MAX_PACK_ID; | |
2967 | oe->idx.offset = 1; | |
2968 | } | |
2969 | switch (oe->type) { | |
2970 | case OBJ_TREE: /* easy case. */ | |
2971 | return oe; | |
2972 | case OBJ_COMMIT: | |
2973 | case OBJ_TAG: | |
2974 | break; | |
2975 | default: | |
bb8040f9 | 2976 | die("Not a tree-ish: %s", command_buf.buf); |
8dc6a373 DB |
2977 | } |
2978 | ||
2979 | if (oe->pack_id != MAX_PACK_ID) { /* in a pack being written */ | |
2980 | buf = gfi_unpack_entry(oe, &size); | |
2981 | } else { | |
2982 | enum object_type unused; | |
2983 | buf = read_sha1_file(sha1, &unused, &size); | |
2984 | } | |
2985 | if (!buf) | |
2986 | die("Can't load object %s", sha1_to_hex(sha1)); | |
2987 | ||
2988 | /* Peel one layer. */ | |
2989 | switch (oe->type) { | |
2990 | case OBJ_TAG: | |
2991 | if (size < 40 + strlen("object ") || | |
2992 | get_sha1_hex(buf + strlen("object "), sha1)) | |
2993 | die("Invalid SHA1 in tag: %s", command_buf.buf); | |
2994 | break; | |
2995 | case OBJ_COMMIT: | |
2996 | if (size < 40 + strlen("tree ") || | |
2997 | get_sha1_hex(buf + strlen("tree "), sha1)) | |
2998 | die("Invalid SHA1 in commit: %s", command_buf.buf); | |
2999 | } | |
3000 | ||
3001 | free(buf); | |
3002 | return find_object(sha1); | |
3003 | } | |
3004 | ||
3005 | static struct object_entry *parse_treeish_dataref(const char **p) | |
3006 | { | |
3007 | unsigned char sha1[20]; | |
3008 | struct object_entry *e; | |
3009 | ||
3010 | if (**p == ':') { /* <mark> */ | |
06454cb9 | 3011 | e = find_mark(parse_mark_ref_space(p)); |
8dc6a373 DB |
3012 | if (!e) |
3013 | die("Unknown mark: %s", command_buf.buf); | |
8dc6a373 DB |
3014 | hashcpy(sha1, e->idx.sha1); |
3015 | } else { /* <sha1> */ | |
3016 | if (get_sha1_hex(*p, sha1)) | |
06454cb9 | 3017 | die("Invalid dataref: %s", command_buf.buf); |
8dc6a373 DB |
3018 | e = find_object(sha1); |
3019 | *p += 40; | |
3020 | } | |
3021 | ||
3022 | while (!e || e->type != OBJ_TREE) | |
3023 | e = dereference(e, sha1); | |
3024 | return e; | |
3025 | } | |
3026 | ||
3027 | static void print_ls(int mode, const unsigned char *sha1, const char *path) | |
3028 | { | |
3029 | static struct strbuf line = STRBUF_INIT; | |
3030 | ||
3031 | /* See show_tree(). */ | |
3032 | const char *type = | |
3033 | S_ISGITLINK(mode) ? commit_type : | |
3034 | S_ISDIR(mode) ? tree_type : | |
3035 | blob_type; | |
3036 | ||
3037 | if (!mode) { | |
3038 | /* missing SP path LF */ | |
3039 | strbuf_reset(&line); | |
3040 | strbuf_addstr(&line, "missing "); | |
3041 | quote_c_style(path, &line, NULL, 0); | |
3042 | strbuf_addch(&line, '\n'); | |
3043 | } else { | |
3044 | /* mode SP type SP object_name TAB path LF */ | |
3045 | strbuf_reset(&line); | |
3046 | strbuf_addf(&line, "%06o %s %s\t", | |
8fb3ad76 | 3047 | mode & ~NO_DELTA, type, sha1_to_hex(sha1)); |
8dc6a373 DB |
3048 | quote_c_style(path, &line, NULL, 0); |
3049 | strbuf_addch(&line, '\n'); | |
3050 | } | |
3051 | cat_blob_write(line.buf, line.len); | |
3052 | } | |
3053 | ||
3054 | static void parse_ls(struct branch *b) | |
3055 | { | |
3056 | const char *p; | |
3057 | struct tree_entry *root = NULL; | |
c2e86add | 3058 | struct tree_entry leaf = {NULL}; |
8dc6a373 | 3059 | |
bb8040f9 | 3060 | /* ls SP (<tree-ish> SP)? <path> */ |
8dc6a373 DB |
3061 | p = command_buf.buf + strlen("ls "); |
3062 | if (*p == '"') { | |
3063 | if (!b) | |
3064 | die("Not in a commit: %s", command_buf.buf); | |
3065 | root = &b->branch_tree; | |
3066 | } else { | |
3067 | struct object_entry *e = parse_treeish_dataref(&p); | |
3068 | root = new_tree_entry(); | |
3069 | hashcpy(root->versions[1].sha1, e->idx.sha1); | |
adefdba5 JK |
3070 | if (!is_null_sha1(root->versions[1].sha1)) |
3071 | root->versions[1].mode = S_IFDIR; | |
8dc6a373 DB |
3072 | load_tree(root); |
3073 | if (*p++ != ' ') | |
3074 | die("Missing space after tree-ish: %s", command_buf.buf); | |
3075 | } | |
3076 | if (*p == '"') { | |
3077 | static struct strbuf uq = STRBUF_INIT; | |
3078 | const char *endp; | |
3079 | strbuf_reset(&uq); | |
3080 | if (unquote_c_style(&uq, p, &endp)) | |
3081 | die("Invalid path: %s", command_buf.buf); | |
3082 | if (*endp) | |
3083 | die("Garbage after path in: %s", command_buf.buf); | |
3084 | p = uq.buf; | |
3085 | } | |
e0eb6b97 | 3086 | tree_content_get(root, p, &leaf, 1); |
8dc6a373 DB |
3087 | /* |
3088 | * A directory in preparation would have a sha1 of zero | |
3089 | * until it is saved. Save, for simplicity. | |
3090 | */ | |
3091 | if (S_ISDIR(leaf.versions[1].mode)) | |
3092 | store_tree(&leaf); | |
3093 | ||
3094 | print_ls(leaf.versions[1].mode, leaf.versions[1].sha1, p); | |
c27e559d JN |
3095 | if (leaf.tree) |
3096 | release_tree_content_recursive(leaf.tree); | |
8dc6a373 DB |
3097 | if (!b || root != &b->branch_tree) |
3098 | release_tree_entry(root); | |
3099 | } | |
3100 | ||
dc01f59d | 3101 | static void checkpoint(void) |
7bfe6e26 | 3102 | { |
dc01f59d | 3103 | checkpoint_requested = 0; |
820b9310 SP |
3104 | if (object_count) { |
3105 | cycle_packfile(); | |
3106 | dump_branches(); | |
3107 | dump_tags(); | |
3108 | dump_marks(); | |
3109 | } | |
dc01f59d JN |
3110 | } |
3111 | ||
3112 | static void parse_checkpoint(void) | |
3113 | { | |
3114 | checkpoint_requested = 1; | |
1fdb649c | 3115 | skip_optional_lf(); |
7bfe6e26 SP |
3116 | } |
3117 | ||
b3031781 | 3118 | static void parse_progress(void) |
ac053c02 | 3119 | { |
b449f4cf | 3120 | fwrite(command_buf.buf, 1, command_buf.len, stdout); |
ac053c02 SP |
3121 | fputc('\n', stdout); |
3122 | fflush(stdout); | |
3123 | skip_optional_lf(); | |
3124 | } | |
3125 | ||
bc3c79ae | 3126 | static char* make_fast_import_path(const char *path) |
e8438420 | 3127 | { |
bc3c79ae | 3128 | struct strbuf abs_path = STRBUF_INIT; |
e8438420 | 3129 | |
bc3c79ae SR |
3130 | if (!relative_marks_paths || is_absolute_path(path)) |
3131 | return xstrdup(path); | |
3132 | strbuf_addf(&abs_path, "%s/info/fast-import/%s", get_git_dir(), path); | |
3133 | return strbuf_detach(&abs_path, NULL); | |
3134 | } | |
3135 | ||
dded4f12 RR |
3136 | static void option_import_marks(const char *marks, |
3137 | int from_stream, int ignore_missing) | |
e8438420 | 3138 | { |
081751c8 SR |
3139 | if (import_marks_file) { |
3140 | if (from_stream) | |
3141 | die("Only one import-marks command allowed per stream"); | |
3142 | ||
3143 | /* read previous mark file */ | |
3144 | if(!import_marks_file_from_stream) | |
3145 | read_marks(); | |
e8438420 | 3146 | } |
081751c8 | 3147 | |
bc3c79ae | 3148 | import_marks_file = make_fast_import_path(marks); |
580d5f83 | 3149 | safe_create_leading_directories_const(import_marks_file); |
081751c8 | 3150 | import_marks_file_from_stream = from_stream; |
dded4f12 | 3151 | import_marks_file_ignore_missing = ignore_missing; |
e8438420 SP |
3152 | } |
3153 | ||
0f6927c2 SR |
3154 | static void option_date_format(const char *fmt) |
3155 | { | |
3156 | if (!strcmp(fmt, "raw")) | |
3157 | whenspec = WHENSPEC_RAW; | |
3158 | else if (!strcmp(fmt, "rfc2822")) | |
3159 | whenspec = WHENSPEC_RFC2822; | |
3160 | else if (!strcmp(fmt, "now")) | |
3161 | whenspec = WHENSPEC_NOW; | |
3162 | else | |
3163 | die("unknown --date-format argument %s", fmt); | |
3164 | } | |
3165 | ||
a9ff277e JN |
3166 | static unsigned long ulong_arg(const char *option, const char *arg) |
3167 | { | |
3168 | char *endptr; | |
3169 | unsigned long rv = strtoul(arg, &endptr, 0); | |
3170 | if (strchr(arg, '-') || endptr == arg || *endptr) | |
3171 | die("%s: argument must be a non-negative integer", option); | |
3172 | return rv; | |
3173 | } | |
3174 | ||
0f6927c2 SR |
3175 | static void option_depth(const char *depth) |
3176 | { | |
a9ff277e | 3177 | max_depth = ulong_arg("--depth", depth); |
0f6927c2 SR |
3178 | if (max_depth > MAX_DEPTH) |
3179 | die("--depth cannot exceed %u", MAX_DEPTH); | |
3180 | } | |
3181 | ||
3182 | static void option_active_branches(const char *branches) | |
3183 | { | |
a9ff277e | 3184 | max_active_branches = ulong_arg("--active-branches", branches); |
0f6927c2 SR |
3185 | } |
3186 | ||
3187 | static void option_export_marks(const char *marks) | |
3188 | { | |
bc3c79ae | 3189 | export_marks_file = make_fast_import_path(marks); |
580d5f83 | 3190 | safe_create_leading_directories_const(export_marks_file); |
0f6927c2 SR |
3191 | } |
3192 | ||
85c62395 DB |
3193 | static void option_cat_blob_fd(const char *fd) |
3194 | { | |
3195 | unsigned long n = ulong_arg("--cat-blob-fd", fd); | |
3196 | if (n > (unsigned long) INT_MAX) | |
3197 | die("--cat-blob-fd cannot exceed %d", INT_MAX); | |
3198 | cat_blob_fd = (int) n; | |
3199 | } | |
3200 | ||
0f6927c2 SR |
3201 | static void option_export_pack_edges(const char *edges) |
3202 | { | |
3203 | if (pack_edges) | |
3204 | fclose(pack_edges); | |
3205 | pack_edges = fopen(edges, "a"); | |
3206 | if (!pack_edges) | |
3207 | die_errno("Cannot open '%s'", edges); | |
3208 | } | |
3209 | ||
9c8398f0 | 3210 | static int parse_one_option(const char *option) |
0f6927c2 | 3211 | { |
9c8398f0 | 3212 | if (!prefixcmp(option, "max-pack-size=")) { |
4d0cc224 JH |
3213 | unsigned long v; |
3214 | if (!git_parse_ulong(option + 14, &v)) | |
3215 | return 0; | |
3216 | if (v < 8192) { | |
3217 | warning("max-pack-size is now in bytes, assuming --max-pack-size=%lum", v); | |
3218 | v *= 1024 * 1024; | |
3219 | } else if (v < 1024 * 1024) { | |
3220 | warning("minimum max-pack-size is 1 MiB"); | |
3221 | v = 1024 * 1024; | |
3222 | } | |
3223 | max_packsize = v; | |
844ad3d9 | 3224 | } else if (!prefixcmp(option, "big-file-threshold=")) { |
76ea93cc JH |
3225 | unsigned long v; |
3226 | if (!git_parse_ulong(option + 19, &v)) | |
3227 | return 0; | |
3228 | big_file_threshold = v; | |
0f6927c2 SR |
3229 | } else if (!prefixcmp(option, "depth=")) { |
3230 | option_depth(option + 6); | |
3231 | } else if (!prefixcmp(option, "active-branches=")) { | |
3232 | option_active_branches(option + 16); | |
0f6927c2 SR |
3233 | } else if (!prefixcmp(option, "export-pack-edges=")) { |
3234 | option_export_pack_edges(option + 18); | |
0f6927c2 SR |
3235 | } else if (!prefixcmp(option, "quiet")) { |
3236 | show_stats = 0; | |
3237 | } else if (!prefixcmp(option, "stats")) { | |
3238 | show_stats = 1; | |
3239 | } else { | |
9c8398f0 | 3240 | return 0; |
0f6927c2 | 3241 | } |
9c8398f0 SR |
3242 | |
3243 | return 1; | |
0f6927c2 SR |
3244 | } |
3245 | ||
081751c8 | 3246 | static int parse_one_feature(const char *feature, int from_stream) |
f963bd5d SR |
3247 | { |
3248 | if (!prefixcmp(feature, "date-format=")) { | |
3249 | option_date_format(feature + 12); | |
3250 | } else if (!prefixcmp(feature, "import-marks=")) { | |
dded4f12 RR |
3251 | option_import_marks(feature + 13, from_stream, 0); |
3252 | } else if (!prefixcmp(feature, "import-marks-if-exists=")) { | |
3253 | option_import_marks(feature + strlen("import-marks-if-exists="), | |
3254 | from_stream, 1); | |
f963bd5d SR |
3255 | } else if (!prefixcmp(feature, "export-marks=")) { |
3256 | option_export_marks(feature + 13); | |
85c62395 DB |
3257 | } else if (!strcmp(feature, "cat-blob")) { |
3258 | ; /* Don't die - this feature is supported */ | |
4cce4ef2 | 3259 | } else if (!strcmp(feature, "relative-marks")) { |
bc3c79ae | 3260 | relative_marks_paths = 1; |
4cce4ef2 | 3261 | } else if (!strcmp(feature, "no-relative-marks")) { |
bc3c79ae | 3262 | relative_marks_paths = 0; |
be56862f SR |
3263 | } else if (!strcmp(feature, "done")) { |
3264 | require_explicit_termination = 1; | |
4cce4ef2 | 3265 | } else if (!strcmp(feature, "force")) { |
f963bd5d | 3266 | force_update = 1; |
8dc6a373 | 3267 | } else if (!strcmp(feature, "notes") || !strcmp(feature, "ls")) { |
547e8b92 | 3268 | ; /* do nothing; we have the feature */ |
f963bd5d SR |
3269 | } else { |
3270 | return 0; | |
3271 | } | |
3272 | ||
3273 | return 1; | |
3274 | } | |
3275 | ||
3276 | static void parse_feature(void) | |
3277 | { | |
3278 | char *feature = command_buf.buf + 8; | |
3279 | ||
3280 | if (seen_data_command) | |
3281 | die("Got feature command '%s' after data command", feature); | |
3282 | ||
081751c8 | 3283 | if (parse_one_feature(feature, 1)) |
f963bd5d SR |
3284 | return; |
3285 | ||
3286 | die("This version of fast-import does not support feature %s.", feature); | |
3287 | } | |
3288 | ||
9c8398f0 SR |
3289 | static void parse_option(void) |
3290 | { | |
3291 | char *option = command_buf.buf + 11; | |
3292 | ||
3293 | if (seen_data_command) | |
3294 | die("Got option command '%s' after data command", option); | |
3295 | ||
3296 | if (parse_one_option(option)) | |
3297 | return; | |
3298 | ||
3299 | die("This version of fast-import does not support option: %s", option); | |
e8438420 SP |
3300 | } |
3301 | ||
ef90d6d4 | 3302 | static int git_pack_config(const char *k, const char *v, void *cb) |
bb23fdfa SP |
3303 | { |
3304 | if (!strcmp(k, "pack.depth")) { | |
3305 | max_depth = git_config_int(k, v); | |
3306 | if (max_depth > MAX_DEPTH) | |
3307 | max_depth = MAX_DEPTH; | |
3308 | return 0; | |
3309 | } | |
3310 | if (!strcmp(k, "pack.compression")) { | |
3311 | int level = git_config_int(k, v); | |
3312 | if (level == -1) | |
3313 | level = Z_DEFAULT_COMPRESSION; | |
3314 | else if (level < 0 || level > Z_BEST_COMPRESSION) | |
3315 | die("bad pack compression level %d", level); | |
3316 | pack_compression_level = level; | |
3317 | pack_compression_seen = 1; | |
3318 | return 0; | |
3319 | } | |
8c2ca8dd | 3320 | if (!strcmp(k, "pack.indexversion")) { |
ebcfb379 JH |
3321 | pack_idx_opts.version = git_config_int(k, v); |
3322 | if (pack_idx_opts.version > 2) | |
8c2ca8dd | 3323 | die("bad pack.indexversion=%"PRIu32, |
ebcfb379 | 3324 | pack_idx_opts.version); |
8c2ca8dd NP |
3325 | return 0; |
3326 | } | |
3327 | if (!strcmp(k, "pack.packsizelimit")) { | |
3328 | max_packsize = git_config_ulong(k, v); | |
3329 | return 0; | |
3330 | } | |
ef90d6d4 | 3331 | return git_default_config(k, v, cb); |
bb23fdfa SP |
3332 | } |
3333 | ||
d5c57b28 | 3334 | static const char fast_import_usage[] = |
62b4698e | 3335 | "git fast-import [--date-format=<f>] [--max-pack-size=<n>] [--big-file-threshold=<n>] [--depth=<n>] [--active-branches=<n>] [--export-marks=<marks.file>]"; |
d5c57b28 | 3336 | |
9c8398f0 SR |
3337 | static void parse_argv(void) |
3338 | { | |
3339 | unsigned int i; | |
3340 | ||
3341 | for (i = 1; i < global_argc; i++) { | |
3342 | const char *a = global_argv[i]; | |
3343 | ||
3344 | if (*a != '-' || !strcmp(a, "--")) | |
3345 | break; | |
3346 | ||
3347 | if (parse_one_option(a + 2)) | |
3348 | continue; | |
3349 | ||
081751c8 | 3350 | if (parse_one_feature(a + 2, 0)) |
9c8398f0 SR |
3351 | continue; |
3352 | ||
85c62395 DB |
3353 | if (!prefixcmp(a + 2, "cat-blob-fd=")) { |
3354 | option_cat_blob_fd(a + 2 + strlen("cat-blob-fd=")); | |
3355 | continue; | |
3356 | } | |
3357 | ||
9c8398f0 SR |
3358 | die("unknown option %s", a); |
3359 | } | |
3360 | if (i != global_argc) | |
3361 | usage(fast_import_usage); | |
3362 | ||
3363 | seen_data_command = 1; | |
3364 | if (import_marks_file) | |
3365 | read_marks(); | |
3366 | } | |
3367 | ||
84d32bf7 | 3368 | int main(int argc, char **argv) |
8bcce301 | 3369 | { |
0f6927c2 | 3370 | unsigned int i; |
8bcce301 | 3371 | |
2fb3f6db SP |
3372 | git_extract_argv0_path(argv[0]); |
3373 | ||
5e9637c6 ÆAB |
3374 | git_setup_gettext(); |
3375 | ||
71a04a8b JN |
3376 | if (argc == 2 && !strcmp(argv[1], "-h")) |
3377 | usage(fast_import_usage); | |
3378 | ||
733ee2b7 | 3379 | setup_git_directory(); |
ebcfb379 | 3380 | reset_pack_idx_option(&pack_idx_opts); |
ef90d6d4 | 3381 | git_config(git_pack_config, NULL); |
bb23fdfa SP |
3382 | if (!pack_compression_seen && core_compression_seen) |
3383 | pack_compression_level = core_compression_level; | |
3384 | ||
93e72d8d | 3385 | alloc_objects(object_entry_alloc); |
f1696ee3 | 3386 | strbuf_init(&command_buf, 0); |
93e72d8d SP |
3387 | atom_table = xcalloc(atom_table_sz, sizeof(struct atom_str*)); |
3388 | branch_table = xcalloc(branch_table_sz, sizeof(struct branch*)); | |
3389 | avail_tree_table = xcalloc(avail_tree_table_sz, sizeof(struct avail_tree_content*)); | |
3390 | marks = pool_calloc(1, sizeof(struct mark_set)); | |
463acbe1 | 3391 | |
9c8398f0 SR |
3392 | global_argc = argc; |
3393 | global_argv = argv; | |
d5c57b28 | 3394 | |
904b1941 SP |
3395 | rc_free = pool_alloc(cmd_save * sizeof(*rc_free)); |
3396 | for (i = 0; i < (cmd_save - 1); i++) | |
3397 | rc_free[i].next = &rc_free[i + 1]; | |
3398 | rc_free[cmd_save - 1].next = NULL; | |
3399 | ||
a5c1780a | 3400 | prepare_packed_git(); |
f70b6534 | 3401 | start_packfile(); |
8acb3297 | 3402 | set_die_routine(die_nicely); |
dc01f59d | 3403 | set_checkpoint_signal(); |
e6c019d0 PH |
3404 | while (read_next_command() != EOF) { |
3405 | if (!strcmp("blob", command_buf.buf)) | |
b3031781 | 3406 | parse_new_blob(); |
8dc6a373 DB |
3407 | else if (!prefixcmp(command_buf.buf, "ls ")) |
3408 | parse_ls(NULL); | |
599065a3 | 3409 | else if (!prefixcmp(command_buf.buf, "commit ")) |
b3031781 | 3410 | parse_new_commit(); |
599065a3 | 3411 | else if (!prefixcmp(command_buf.buf, "tag ")) |
b3031781 | 3412 | parse_new_tag(); |
599065a3 | 3413 | else if (!prefixcmp(command_buf.buf, "reset ")) |
b3031781 | 3414 | parse_reset_branch(); |
7bfe6e26 | 3415 | else if (!strcmp("checkpoint", command_buf.buf)) |
b3031781 | 3416 | parse_checkpoint(); |
be56862f SR |
3417 | else if (!strcmp("done", command_buf.buf)) |
3418 | break; | |
ac053c02 | 3419 | else if (!prefixcmp(command_buf.buf, "progress ")) |
b3031781 | 3420 | parse_progress(); |
f963bd5d SR |
3421 | else if (!prefixcmp(command_buf.buf, "feature ")) |
3422 | parse_feature(); | |
9c8398f0 SR |
3423 | else if (!prefixcmp(command_buf.buf, "option git ")) |
3424 | parse_option(); | |
3425 | else if (!prefixcmp(command_buf.buf, "option ")) | |
3426 | /* ignore non-git options*/; | |
c44cdc7e SP |
3427 | else |
3428 | die("Unsupported command: %s", command_buf.buf); | |
dc01f59d JN |
3429 | |
3430 | if (checkpoint_requested) | |
3431 | checkpoint(); | |
db5e523f | 3432 | } |
9c8398f0 SR |
3433 | |
3434 | /* argv hasn't been parsed yet, do so */ | |
3435 | if (!seen_data_command) | |
3436 | parse_argv(); | |
3437 | ||
be56862f SR |
3438 | if (require_explicit_termination && feof(stdin)) |
3439 | die("stream ends early"); | |
3440 | ||
f70b6534 | 3441 | end_packfile(); |
c44cdc7e | 3442 | |
463acbe1 | 3443 | dump_branches(); |
72303d44 | 3444 | dump_tags(); |
8455e484 | 3445 | unkeep_all_packs(); |
a6a1a831 | 3446 | dump_marks(); |
8bcce301 | 3447 | |
bdf1c06d SP |
3448 | if (pack_edges) |
3449 | fclose(pack_edges); | |
3450 | ||
c499d768 SP |
3451 | if (show_stats) { |
3452 | uintmax_t total_count = 0, duplicate_count = 0; | |
3453 | for (i = 0; i < ARRAY_SIZE(object_count_by_type); i++) | |
3454 | total_count += object_count_by_type[i]; | |
3455 | for (i = 0; i < ARRAY_SIZE(duplicate_count_by_type); i++) | |
3456 | duplicate_count += duplicate_count_by_type[i]; | |
3457 | ||
3458 | fprintf(stderr, "%s statistics:\n", argv[0]); | |
3459 | fprintf(stderr, "---------------------------------------------------------------------\n"); | |
3efb1f34 JR |
3460 | fprintf(stderr, "Alloc'd objects: %10" PRIuMAX "\n", alloc_count); |
3461 | fprintf(stderr, "Total objects: %10" PRIuMAX " (%10" PRIuMAX " duplicates )\n", total_count, duplicate_count); | |
94c3b482 DI |
3462 | fprintf(stderr, " blobs : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas of %10" PRIuMAX" attempts)\n", object_count_by_type[OBJ_BLOB], duplicate_count_by_type[OBJ_BLOB], delta_count_by_type[OBJ_BLOB], delta_count_attempts_by_type[OBJ_BLOB]); |
3463 | fprintf(stderr, " trees : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas of %10" PRIuMAX" attempts)\n", object_count_by_type[OBJ_TREE], duplicate_count_by_type[OBJ_TREE], delta_count_by_type[OBJ_TREE], delta_count_attempts_by_type[OBJ_TREE]); | |
3464 | fprintf(stderr, " commits: %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas of %10" PRIuMAX" attempts)\n", object_count_by_type[OBJ_COMMIT], duplicate_count_by_type[OBJ_COMMIT], delta_count_by_type[OBJ_COMMIT], delta_count_attempts_by_type[OBJ_COMMIT]); | |
3465 | fprintf(stderr, " tags : %10" PRIuMAX " (%10" PRIuMAX " duplicates %10" PRIuMAX " deltas of %10" PRIuMAX" attempts)\n", object_count_by_type[OBJ_TAG], duplicate_count_by_type[OBJ_TAG], delta_count_by_type[OBJ_TAG], delta_count_attempts_by_type[OBJ_TAG]); | |
c499d768 | 3466 | fprintf(stderr, "Total branches: %10lu (%10lu loads )\n", branch_count, branch_load_count); |
3efb1f34 | 3467 | fprintf(stderr, " marks: %10" PRIuMAX " (%10" PRIuMAX " unique )\n", (((uintmax_t)1) << marks->shift) * 1024, marks_set_count); |
c499d768 | 3468 | fprintf(stderr, " atoms: %10u\n", atom_cnt); |
3efb1f34 | 3469 | fprintf(stderr, "Memory total: %10" PRIuMAX " KiB\n", (total_allocd + alloc_count*sizeof(struct object_entry))/1024); |
40db58b8 | 3470 | fprintf(stderr, " pools: %10lu KiB\n", (unsigned long)(total_allocd/1024)); |
3efb1f34 | 3471 | fprintf(stderr, " objects: %10" PRIuMAX " KiB\n", (alloc_count*sizeof(struct object_entry))/1024); |
c499d768 SP |
3472 | fprintf(stderr, "---------------------------------------------------------------------\n"); |
3473 | pack_report(); | |
3474 | fprintf(stderr, "---------------------------------------------------------------------\n"); | |
3475 | fprintf(stderr, "\n"); | |
3476 | } | |
db5e523f | 3477 | |
7073e69e | 3478 | return failure ? 1 : 0; |
db5e523f | 3479 | } |