]>
Commit | Line | Data |
---|---|---|
74986462 | 1 | #include "cache.h" |
697cc8ef | 2 | #include "lockfile.h" |
74986462 | 3 | #include "tree.h" |
b9d37a54 | 4 | #include "tree-walk.h" |
74986462 JH |
5 | #include "cache-tree.h" |
6 | ||
4903161f | 7 | #ifndef DEBUG |
74986462 | 8 | #define DEBUG 0 |
4903161f | 9 | #endif |
74986462 JH |
10 | |
11 | struct cache_tree *cache_tree(void) | |
12 | { | |
13 | struct cache_tree *it = xcalloc(1, sizeof(struct cache_tree)); | |
14 | it->entry_count = -1; | |
15 | return it; | |
16 | } | |
17 | ||
bad68ec9 | 18 | void cache_tree_free(struct cache_tree **it_p) |
74986462 JH |
19 | { |
20 | int i; | |
bad68ec9 | 21 | struct cache_tree *it = *it_p; |
74986462 JH |
22 | |
23 | if (!it) | |
24 | return; | |
25 | for (i = 0; i < it->subtree_nr; i++) | |
e92fa514 | 26 | if (it->down[i]) { |
61fa3097 | 27 | cache_tree_free(&it->down[i]->cache_tree); |
e92fa514 EN |
28 | free(it->down[i]); |
29 | } | |
74986462 JH |
30 | free(it->down); |
31 | free(it); | |
bad68ec9 | 32 | *it_p = NULL; |
74986462 JH |
33 | } |
34 | ||
61fa3097 JH |
35 | static int subtree_name_cmp(const char *one, int onelen, |
36 | const char *two, int twolen) | |
37 | { | |
38 | if (onelen < twolen) | |
39 | return -1; | |
40 | if (twolen < onelen) | |
41 | return 1; | |
42 | return memcmp(one, two, onelen); | |
43 | } | |
44 | ||
45 | static int subtree_pos(struct cache_tree *it, const char *path, int pathlen) | |
46 | { | |
47 | struct cache_tree_sub **down = it->down; | |
48 | int lo, hi; | |
49 | lo = 0; | |
50 | hi = it->subtree_nr; | |
51 | while (lo < hi) { | |
19716b21 | 52 | int mi = lo + (hi - lo) / 2; |
61fa3097 JH |
53 | struct cache_tree_sub *mdl = down[mi]; |
54 | int cmp = subtree_name_cmp(path, pathlen, | |
55 | mdl->name, mdl->namelen); | |
56 | if (!cmp) | |
57 | return mi; | |
58 | if (cmp < 0) | |
59 | hi = mi; | |
60 | else | |
61 | lo = mi + 1; | |
62 | } | |
63 | return -lo-1; | |
64 | } | |
65 | ||
74986462 JH |
66 | static struct cache_tree_sub *find_subtree(struct cache_tree *it, |
67 | const char *path, | |
68 | int pathlen, | |
69 | int create) | |
70 | { | |
74986462 | 71 | struct cache_tree_sub *down; |
61fa3097 JH |
72 | int pos = subtree_pos(it, path, pathlen); |
73 | if (0 <= pos) | |
74 | return it->down[pos]; | |
74986462 JH |
75 | if (!create) |
76 | return NULL; | |
61fa3097 JH |
77 | |
78 | pos = -pos-1; | |
bcc7a032 | 79 | ALLOC_GROW(it->down, it->subtree_nr + 1, it->subtree_alloc); |
61fa3097 JH |
80 | it->subtree_nr++; |
81 | ||
96ffc06f | 82 | FLEX_ALLOC_MEM(down, name, path, pathlen); |
61fa3097 | 83 | down->cache_tree = NULL; |
74986462 | 84 | down->namelen = pathlen; |
61fa3097 JH |
85 | |
86 | if (pos < it->subtree_nr) | |
87 | memmove(it->down + pos + 1, | |
88 | it->down + pos, | |
89 | sizeof(down) * (it->subtree_nr - pos - 1)); | |
90 | it->down[pos] = down; | |
74986462 JH |
91 | return down; |
92 | } | |
93 | ||
7927a55d JH |
94 | struct cache_tree_sub *cache_tree_sub(struct cache_tree *it, const char *path) |
95 | { | |
96 | int pathlen = strlen(path); | |
97 | return find_subtree(it, path, pathlen, 1); | |
98 | } | |
99 | ||
a5400efe | 100 | static int do_invalidate_path(struct cache_tree *it, const char *path) |
74986462 JH |
101 | { |
102 | /* a/b/c | |
103 | * ==> invalidate self | |
104 | * ==> find "a", have it invalidate "b/c" | |
105 | * a | |
106 | * ==> invalidate self | |
107 | * ==> if "a" exists as a subtree, remove it. | |
108 | */ | |
109 | const char *slash; | |
110 | int namelen; | |
111 | struct cache_tree_sub *down; | |
112 | ||
00703e6d JH |
113 | #if DEBUG |
114 | fprintf(stderr, "cache-tree invalidate <%s>\n", path); | |
115 | #endif | |
116 | ||
74986462 | 117 | if (!it) |
a5400efe | 118 | return 0; |
2c5495f7 RM |
119 | slash = strchrnul(path, '/'); |
120 | namelen = slash - path; | |
74986462 | 121 | it->entry_count = -1; |
2c5495f7 | 122 | if (!*slash) { |
61fa3097 | 123 | int pos; |
61fa3097 JH |
124 | pos = subtree_pos(it, path, namelen); |
125 | if (0 <= pos) { | |
126 | cache_tree_free(&it->down[pos]->cache_tree); | |
127 | free(it->down[pos]); | |
74986462 JH |
128 | /* 0 1 2 3 4 5 |
129 | * ^ ^subtree_nr = 6 | |
61fa3097 | 130 | * pos |
74986462 | 131 | * move 4 and 5 up one place (2 entries) |
61fa3097 | 132 | * 2 = 6 - 3 - 1 = subtree_nr - pos - 1 |
74986462 | 133 | */ |
f331ab9d RS |
134 | MOVE_ARRAY(it->down + pos, it->down + pos + 1, |
135 | it->subtree_nr - pos - 1); | |
74986462 JH |
136 | it->subtree_nr--; |
137 | } | |
a5400efe | 138 | return 1; |
74986462 | 139 | } |
74986462 JH |
140 | down = find_subtree(it, path, namelen, 0); |
141 | if (down) | |
a5400efe NTND |
142 | do_invalidate_path(down->cache_tree, slash + 1); |
143 | return 1; | |
144 | } | |
145 | ||
146 | void cache_tree_invalidate_path(struct index_state *istate, const char *path) | |
147 | { | |
148 | if (do_invalidate_path(istate->cache_tree, path)) | |
149 | istate->cache_changed |= CACHE_TREE_CHANGED; | |
74986462 JH |
150 | } |
151 | ||
d0cfc3e8 | 152 | static int verify_cache(struct cache_entry **cache, |
e859c69b | 153 | int entries, int flags) |
74986462 JH |
154 | { |
155 | int i, funny; | |
e859c69b | 156 | int silent = flags & WRITE_TREE_SILENT; |
74986462 JH |
157 | |
158 | /* Verify that the tree is merged */ | |
159 | funny = 0; | |
160 | for (i = 0; i < entries; i++) { | |
9c5e6c80 | 161 | const struct cache_entry *ce = cache[i]; |
3f6d56de | 162 | if (ce_stage(ce)) { |
996277c5 TR |
163 | if (silent) |
164 | return -1; | |
74986462 JH |
165 | if (10 < ++funny) { |
166 | fprintf(stderr, "...\n"); | |
167 | break; | |
168 | } | |
dbc3904e | 169 | fprintf(stderr, "%s: unmerged (%s)\n", |
99d1a986 | 170 | ce->name, oid_to_hex(&ce->oid)); |
74986462 JH |
171 | } |
172 | } | |
173 | if (funny) | |
174 | return -1; | |
175 | ||
176 | /* Also verify that the cache does not have path and path/file | |
177 | * at the same time. At this point we know the cache has only | |
178 | * stage 0 entries. | |
179 | */ | |
180 | funny = 0; | |
181 | for (i = 0; i < entries - 1; i++) { | |
182 | /* path/file always comes after path because of the way | |
183 | * the cache is sorted. Also path can appear only once, | |
184 | * which means conflicting one would immediately follow. | |
185 | */ | |
186 | const char *this_name = cache[i]->name; | |
187 | const char *next_name = cache[i+1]->name; | |
188 | int this_len = strlen(this_name); | |
189 | if (this_len < strlen(next_name) && | |
190 | strncmp(this_name, next_name, this_len) == 0 && | |
191 | next_name[this_len] == '/') { | |
192 | if (10 < ++funny) { | |
193 | fprintf(stderr, "...\n"); | |
194 | break; | |
195 | } | |
196 | fprintf(stderr, "You have both %s and %s\n", | |
197 | this_name, next_name); | |
198 | } | |
199 | } | |
200 | if (funny) | |
201 | return -1; | |
202 | return 0; | |
203 | } | |
204 | ||
205 | static void discard_unused_subtrees(struct cache_tree *it) | |
206 | { | |
207 | struct cache_tree_sub **down = it->down; | |
208 | int nr = it->subtree_nr; | |
209 | int dst, src; | |
210 | for (dst = src = 0; src < nr; src++) { | |
211 | struct cache_tree_sub *s = down[src]; | |
212 | if (s->used) | |
213 | down[dst++] = s; | |
214 | else { | |
bad68ec9 | 215 | cache_tree_free(&s->cache_tree); |
74986462 JH |
216 | free(s); |
217 | it->subtree_nr--; | |
218 | } | |
219 | } | |
220 | } | |
221 | ||
bad68ec9 JH |
222 | int cache_tree_fully_valid(struct cache_tree *it) |
223 | { | |
224 | int i; | |
225 | if (!it) | |
226 | return 0; | |
e0a92804 | 227 | if (it->entry_count < 0 || !has_sha1_file(it->oid.hash)) |
bad68ec9 JH |
228 | return 0; |
229 | for (i = 0; i < it->subtree_nr; i++) { | |
230 | if (!cache_tree_fully_valid(it->down[i]->cache_tree)) | |
231 | return 0; | |
232 | } | |
233 | return 1; | |
234 | } | |
235 | ||
74986462 | 236 | static int update_one(struct cache_tree *it, |
d0cfc3e8 | 237 | struct cache_entry **cache, |
74986462 JH |
238 | int entries, |
239 | const char *base, | |
240 | int baselen, | |
3cf773e4 | 241 | int *skip_count, |
e859c69b | 242 | int flags) |
74986462 | 243 | { |
5242bcbb | 244 | struct strbuf buffer; |
e859c69b NTND |
245 | int missing_ok = flags & WRITE_TREE_MISSING_OK; |
246 | int dryrun = flags & WRITE_TREE_DRY_RUN; | |
aecf567c | 247 | int repair = flags & WRITE_TREE_REPAIR; |
eec3e7e4 | 248 | int to_invalidate = 0; |
74986462 JH |
249 | int i; |
250 | ||
aecf567c DT |
251 | assert(!(dryrun && repair)); |
252 | ||
3cf773e4 NTND |
253 | *skip_count = 0; |
254 | ||
e0a92804 | 255 | if (0 <= it->entry_count && has_sha1_file(it->oid.hash)) |
74986462 JH |
256 | return it->entry_count; |
257 | ||
258 | /* | |
259 | * We first scan for subtrees and update them; we start by | |
260 | * marking existing subtrees -- the ones that are unmarked | |
261 | * should not be in the result. | |
262 | */ | |
263 | for (i = 0; i < it->subtree_nr; i++) | |
264 | it->down[i]->used = 0; | |
265 | ||
266 | /* | |
267 | * Find the subtrees and update them. | |
268 | */ | |
386cc8b0 NTND |
269 | i = 0; |
270 | while (i < entries) { | |
9c5e6c80 | 271 | const struct cache_entry *ce = cache[i]; |
74986462 JH |
272 | struct cache_tree_sub *sub; |
273 | const char *path, *slash; | |
3cf773e4 | 274 | int pathlen, sublen, subcnt, subskip; |
74986462 JH |
275 | |
276 | path = ce->name; | |
277 | pathlen = ce_namelen(ce); | |
278 | if (pathlen <= baselen || memcmp(base, path, baselen)) | |
279 | break; /* at the end of this level */ | |
280 | ||
281 | slash = strchr(path + baselen, '/'); | |
386cc8b0 NTND |
282 | if (!slash) { |
283 | i++; | |
74986462 | 284 | continue; |
386cc8b0 | 285 | } |
74986462 JH |
286 | /* |
287 | * a/bbb/c (base = a/, slash = /c) | |
288 | * ==> | |
289 | * path+baselen = bbb/c, sublen = 3 | |
290 | */ | |
291 | sublen = slash - (path + baselen); | |
292 | sub = find_subtree(it, path + baselen, sublen, 1); | |
293 | if (!sub->cache_tree) | |
294 | sub->cache_tree = cache_tree(); | |
295 | subcnt = update_one(sub->cache_tree, | |
296 | cache + i, entries - i, | |
297 | path, | |
298 | baselen + sublen + 1, | |
3cf773e4 | 299 | &subskip, |
e859c69b | 300 | flags); |
3d12d0cf JS |
301 | if (subcnt < 0) |
302 | return subcnt; | |
729dbbd9 JK |
303 | if (!subcnt) |
304 | die("index cache-tree records empty sub-tree"); | |
386cc8b0 | 305 | i += subcnt; |
3cf773e4 NTND |
306 | sub->count = subcnt; /* to be used in the next loop */ |
307 | *skip_count += subskip; | |
74986462 JH |
308 | sub->used = 1; |
309 | } | |
310 | ||
311 | discard_unused_subtrees(it); | |
312 | ||
313 | /* | |
314 | * Then write out the tree object for this level. | |
315 | */ | |
f1696ee3 | 316 | strbuf_init(&buffer, 8192); |
74986462 | 317 | |
386cc8b0 NTND |
318 | i = 0; |
319 | while (i < entries) { | |
9c5e6c80 | 320 | const struct cache_entry *ce = cache[i]; |
c041d54a | 321 | struct cache_tree_sub *sub = NULL; |
74986462 JH |
322 | const char *path, *slash; |
323 | int pathlen, entlen; | |
324 | const unsigned char *sha1; | |
325 | unsigned mode; | |
4ed115e9 | 326 | int expected_missing = 0; |
6d6a782f | 327 | int contains_ita = 0; |
74986462 JH |
328 | |
329 | path = ce->name; | |
330 | pathlen = ce_namelen(ce); | |
331 | if (pathlen <= baselen || memcmp(base, path, baselen)) | |
332 | break; /* at the end of this level */ | |
333 | ||
334 | slash = strchr(path + baselen, '/'); | |
335 | if (slash) { | |
336 | entlen = slash - (path + baselen); | |
337 | sub = find_subtree(it, path + baselen, entlen, 0); | |
338 | if (!sub) | |
339 | die("cache-tree.c: '%.*s' in '%s' not found", | |
340 | entlen, path + baselen, path); | |
3cf773e4 | 341 | i += sub->count; |
e0a92804 | 342 | sha1 = sub->cache_tree->oid.hash; |
74986462 | 343 | mode = S_IFDIR; |
6d6a782f NTND |
344 | contains_ita = sub->cache_tree->entry_count < 0; |
345 | if (contains_ita) { | |
eec3e7e4 | 346 | to_invalidate = 1; |
4ed115e9 JH |
347 | expected_missing = 1; |
348 | } | |
74986462 JH |
349 | } |
350 | else { | |
99d1a986 | 351 | sha1 = ce->oid.hash; |
7a51ed66 | 352 | mode = ce->ce_mode; |
74986462 | 353 | entlen = pathlen - baselen; |
386cc8b0 | 354 | i++; |
74986462 | 355 | } |
a96d3cc3 JK |
356 | |
357 | if (is_null_sha1(sha1) || | |
358 | (mode != S_IFGITLINK && !missing_ok && !has_sha1_file(sha1))) { | |
b6b56ace | 359 | strbuf_release(&buffer); |
4ed115e9 JH |
360 | if (expected_missing) |
361 | return -1; | |
a3883734 LT |
362 | return error("invalid object %06o %s for '%.*s'", |
363 | mode, sha1_to_hex(sha1), entlen+baselen, path); | |
b6b56ace | 364 | } |
74986462 | 365 | |
3cf773e4 NTND |
366 | /* |
367 | * CE_REMOVE entries are removed before the index is | |
368 | * written to disk. Skip them to remain consistent | |
369 | * with the future on-disk index. | |
370 | */ | |
371 | if (ce->ce_flags & CE_REMOVE) { | |
372 | *skip_count = *skip_count + 1; | |
373 | continue; | |
374 | } | |
375 | ||
eec3e7e4 NTND |
376 | /* |
377 | * CE_INTENT_TO_ADD entries exist on on-disk index but | |
378 | * they are not part of generated trees. Invalidate up | |
379 | * to root to force cache-tree users to read elsewhere. | |
380 | */ | |
c041d54a | 381 | if (!sub && ce_intent_to_add(ce)) { |
eec3e7e4 | 382 | to_invalidate = 1; |
3cf773e4 | 383 | continue; |
eec3e7e4 | 384 | } |
74986462 | 385 | |
6d6a782f NTND |
386 | /* |
387 | * "sub" can be an empty tree if all subentries are i-t-a. | |
388 | */ | |
389 | if (contains_ita && !hashcmp(sha1, EMPTY_TREE_SHA1_BIN)) | |
390 | continue; | |
391 | ||
5242bcbb PH |
392 | strbuf_grow(&buffer, entlen + 100); |
393 | strbuf_addf(&buffer, "%o %.*s%c", mode, entlen, path + baselen, '\0'); | |
394 | strbuf_add(&buffer, sha1, 20); | |
74986462 JH |
395 | |
396 | #if DEBUG | |
00703e6d | 397 | fprintf(stderr, "cache-tree update-one %o %.*s\n", |
74986462 JH |
398 | mode, entlen, path + baselen); |
399 | #endif | |
400 | } | |
401 | ||
aecf567c DT |
402 | if (repair) { |
403 | unsigned char sha1[20]; | |
404 | hash_sha1_file(buffer.buf, buffer.len, tree_type, sha1); | |
405 | if (has_sha1_file(sha1)) | |
e0a92804 | 406 | hashcpy(it->oid.hash, sha1); |
aecf567c DT |
407 | else |
408 | to_invalidate = 1; | |
409 | } else if (dryrun) | |
e0a92804 | 410 | hash_sha1_file(buffer.buf, buffer.len, tree_type, |
411 | it->oid.hash); | |
412 | else if (write_sha1_file(buffer.buf, buffer.len, tree_type, it->oid.hash)) { | |
edae5f0c JH |
413 | strbuf_release(&buffer); |
414 | return -1; | |
415 | } | |
416 | ||
5242bcbb | 417 | strbuf_release(&buffer); |
eec3e7e4 | 418 | it->entry_count = to_invalidate ? -1 : i - *skip_count; |
74986462 | 419 | #if DEBUG |
00703e6d | 420 | fprintf(stderr, "cache-tree update-one (%d ent, %d subtree) %s\n", |
74986462 | 421 | it->entry_count, it->subtree_nr, |
e0a92804 | 422 | oid_to_hex(&it->oid)); |
74986462 JH |
423 | #endif |
424 | return i; | |
425 | } | |
426 | ||
d0cfc3e8 | 427 | int cache_tree_update(struct index_state *istate, int flags) |
74986462 | 428 | { |
d0cfc3e8 NTND |
429 | struct cache_tree *it = istate->cache_tree; |
430 | struct cache_entry **cache = istate->cache; | |
431 | int entries = istate->cache_nr; | |
432 | int skip, i = verify_cache(cache, entries, flags); | |
433 | ||
74986462 JH |
434 | if (i) |
435 | return i; | |
3cf773e4 | 436 | i = update_one(it, cache, entries, "", 0, &skip, flags); |
74986462 JH |
437 | if (i < 0) |
438 | return i; | |
d0cfc3e8 | 439 | istate->cache_changed |= CACHE_TREE_CHANGED; |
74986462 JH |
440 | return 0; |
441 | } | |
442 | ||
1dffb8fa PH |
443 | static void write_one(struct strbuf *buffer, struct cache_tree *it, |
444 | const char *path, int pathlen) | |
74986462 JH |
445 | { |
446 | int i; | |
447 | ||
448 | /* One "cache-tree" entry consists of the following: | |
449 | * path (NUL terminated) | |
450 | * entry_count, subtree_nr ("%d %d\n") | |
451 | * tree-sha1 (missing if invalid) | |
452 | * subtree_nr "cache-tree" entries for subtrees. | |
453 | */ | |
5242bcbb PH |
454 | strbuf_grow(buffer, pathlen + 100); |
455 | strbuf_add(buffer, path, pathlen); | |
456 | strbuf_addf(buffer, "%c%d %d\n", 0, it->entry_count, it->subtree_nr); | |
74986462 JH |
457 | |
458 | #if DEBUG | |
459 | if (0 <= it->entry_count) | |
460 | fprintf(stderr, "cache-tree <%.*s> (%d ent, %d subtree) %s\n", | |
461 | pathlen, path, it->entry_count, it->subtree_nr, | |
e0a92804 | 462 | oid_to_hex(&it->oid)); |
74986462 JH |
463 | else |
464 | fprintf(stderr, "cache-tree <%.*s> (%d subtree) invalid\n", | |
465 | pathlen, path, it->subtree_nr); | |
466 | #endif | |
467 | ||
468 | if (0 <= it->entry_count) { | |
e0a92804 | 469 | strbuf_add(buffer, it->oid.hash, 20); |
74986462 JH |
470 | } |
471 | for (i = 0; i < it->subtree_nr; i++) { | |
472 | struct cache_tree_sub *down = it->down[i]; | |
61fa3097 JH |
473 | if (i) { |
474 | struct cache_tree_sub *prev = it->down[i-1]; | |
475 | if (subtree_name_cmp(down->name, down->namelen, | |
476 | prev->name, prev->namelen) <= 0) | |
477 | die("fatal - unsorted cache subtree"); | |
478 | } | |
1dffb8fa | 479 | write_one(buffer, down->cache_tree, down->name, down->namelen); |
74986462 | 480 | } |
74986462 JH |
481 | } |
482 | ||
1dffb8fa | 483 | void cache_tree_write(struct strbuf *sb, struct cache_tree *root) |
74986462 | 484 | { |
1dffb8fa | 485 | write_one(sb, root, "", 0); |
74986462 JH |
486 | } |
487 | ||
488 | static struct cache_tree *read_one(const char **buffer, unsigned long *size_p) | |
489 | { | |
490 | const char *buf = *buffer; | |
491 | unsigned long size = *size_p; | |
0111ea38 JS |
492 | const char *cp; |
493 | char *ep; | |
74986462 JH |
494 | struct cache_tree *it; |
495 | int i, subtree_nr; | |
496 | ||
497 | it = NULL; | |
498 | /* skip name, but make sure name exists */ | |
499 | while (size && *buf) { | |
500 | size--; | |
501 | buf++; | |
502 | } | |
503 | if (!size) | |
504 | goto free_return; | |
505 | buf++; size--; | |
506 | it = cache_tree(); | |
0111ea38 JS |
507 | |
508 | cp = buf; | |
509 | it->entry_count = strtol(cp, &ep, 10); | |
510 | if (cp == ep) | |
511 | goto free_return; | |
512 | cp = ep; | |
513 | subtree_nr = strtol(cp, &ep, 10); | |
514 | if (cp == ep) | |
74986462 JH |
515 | goto free_return; |
516 | while (size && *buf && *buf != '\n') { | |
517 | size--; | |
518 | buf++; | |
519 | } | |
520 | if (!size) | |
521 | goto free_return; | |
522 | buf++; size--; | |
523 | if (0 <= it->entry_count) { | |
524 | if (size < 20) | |
525 | goto free_return; | |
e0a92804 | 526 | hashcpy(it->oid.hash, (const unsigned char*)buf); |
74986462 JH |
527 | buf += 20; |
528 | size -= 20; | |
529 | } | |
530 | ||
531 | #if DEBUG | |
532 | if (0 <= it->entry_count) | |
533 | fprintf(stderr, "cache-tree <%s> (%d ent, %d subtree) %s\n", | |
534 | *buffer, it->entry_count, subtree_nr, | |
e0a92804 | 535 | oid_to_hex(&it->oid)); |
74986462 JH |
536 | else |
537 | fprintf(stderr, "cache-tree <%s> (%d subtrees) invalid\n", | |
538 | *buffer, subtree_nr); | |
539 | #endif | |
540 | ||
541 | /* | |
542 | * Just a heuristic -- we do not add directories that often but | |
543 | * we do not want to have to extend it immediately when we do, | |
544 | * hence +2. | |
545 | */ | |
546 | it->subtree_alloc = subtree_nr + 2; | |
547 | it->down = xcalloc(it->subtree_alloc, sizeof(struct cache_tree_sub *)); | |
548 | for (i = 0; i < subtree_nr; i++) { | |
549 | /* read each subtree */ | |
550 | struct cache_tree *sub; | |
61fa3097 | 551 | struct cache_tree_sub *subtree; |
74986462 | 552 | const char *name = buf; |
7927a55d | 553 | |
74986462 JH |
554 | sub = read_one(&buf, &size); |
555 | if (!sub) | |
556 | goto free_return; | |
7927a55d | 557 | subtree = cache_tree_sub(it, name); |
61fa3097 | 558 | subtree->cache_tree = sub; |
74986462 JH |
559 | } |
560 | if (subtree_nr != it->subtree_nr) | |
561 | die("cache-tree: internal error"); | |
562 | *buffer = buf; | |
563 | *size_p = size; | |
564 | return it; | |
565 | ||
566 | free_return: | |
bad68ec9 | 567 | cache_tree_free(&it); |
74986462 JH |
568 | return NULL; |
569 | } | |
570 | ||
bad68ec9 | 571 | struct cache_tree *cache_tree_read(const char *buffer, unsigned long size) |
74986462 | 572 | { |
bad68ec9 | 573 | if (buffer[0]) |
74986462 | 574 | return NULL; /* not the whole tree */ |
74986462 JH |
575 | return read_one(&buffer, &size); |
576 | } | |
6bd20358 | 577 | |
7ba04d9f | 578 | static struct cache_tree *cache_tree_find(struct cache_tree *it, const char *path) |
6bd20358 | 579 | { |
b87fc964 JH |
580 | if (!it) |
581 | return NULL; | |
6bd20358 JH |
582 | while (*path) { |
583 | const char *slash; | |
584 | struct cache_tree_sub *sub; | |
585 | ||
17e22ddc | 586 | slash = strchrnul(path, '/'); |
79192b87 MH |
587 | /* |
588 | * Between path and slash is the name of the subtree | |
589 | * to look for. | |
6bd20358 JH |
590 | */ |
591 | sub = find_subtree(it, path, slash - path, 0); | |
592 | if (!sub) | |
593 | return NULL; | |
594 | it = sub->cache_tree; | |
3491047e | 595 | |
6bd20358 | 596 | path = slash; |
3491047e MH |
597 | while (*path == '/') |
598 | path++; | |
6bd20358 JH |
599 | } |
600 | return it; | |
601 | } | |
45525bd0 | 602 | |
d23a5117 | 603 | int write_index_as_tree(unsigned char *sha1, struct index_state *index_state, const char *index_path, int flags, const char *prefix) |
45525bd0 | 604 | { |
2954e5ec | 605 | int entries, was_valid; |
bfffb48c | 606 | struct lock_file lock_file = LOCK_INIT; |
c82c75b9 | 607 | int ret = 0; |
45525bd0 | 608 | |
2954e5ec | 609 | hold_lock_file_for_update(&lock_file, index_path, LOCK_DIE_ON_ERROR); |
45525bd0 | 610 | |
a125a223 | 611 | entries = read_index_from(index_state, index_path, get_git_dir()); |
c82c75b9 JK |
612 | if (entries < 0) { |
613 | ret = WRITE_TREE_UNREADABLE_INDEX; | |
614 | goto out; | |
615 | } | |
d11b8d34 | 616 | if (flags & WRITE_TREE_IGNORE_CACHE_TREE) |
d23a5117 | 617 | cache_tree_free(&index_state->cache_tree); |
45525bd0 | 618 | |
d23a5117 PT |
619 | if (!index_state->cache_tree) |
620 | index_state->cache_tree = cache_tree(); | |
45525bd0 | 621 | |
d23a5117 | 622 | was_valid = cache_tree_fully_valid(index_state->cache_tree); |
45525bd0 | 623 | if (!was_valid) { |
c82c75b9 JK |
624 | if (cache_tree_update(index_state, flags) < 0) { |
625 | ret = WRITE_TREE_UNMERGED_INDEX; | |
626 | goto out; | |
627 | } | |
2954e5ec | 628 | write_locked_index(index_state, &lock_file, COMMIT_LOCK); |
45525bd0 JH |
629 | /* Not being able to write is fine -- we are only interested |
630 | * in updating the cache-tree part, and if the next caller | |
631 | * ends up using the old index with unupdated cache-tree part | |
632 | * it misses the work we did here, but that is just a | |
633 | * performance penalty and not a big deal. | |
634 | */ | |
635 | } | |
636 | ||
637 | if (prefix) { | |
d23a5117 PT |
638 | struct cache_tree *subtree; |
639 | subtree = cache_tree_find(index_state->cache_tree, prefix); | |
c82c75b9 JK |
640 | if (!subtree) { |
641 | ret = WRITE_TREE_PREFIX_ERROR; | |
642 | goto out; | |
643 | } | |
e0a92804 | 644 | hashcpy(sha1, subtree->oid.hash); |
45525bd0 JH |
645 | } |
646 | else | |
e0a92804 | 647 | hashcpy(sha1, index_state->cache_tree->oid.hash); |
45525bd0 | 648 | |
c82c75b9 | 649 | out: |
2954e5ec | 650 | rollback_lock_file(&lock_file); |
c82c75b9 | 651 | return ret; |
45525bd0 | 652 | } |
b9d37a54 | 653 | |
d23a5117 PT |
654 | int write_cache_as_tree(unsigned char *sha1, int flags, const char *prefix) |
655 | { | |
656 | return write_index_as_tree(sha1, &the_index, get_index_file(), flags, prefix); | |
657 | } | |
658 | ||
b9d37a54 JH |
659 | static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree) |
660 | { | |
661 | struct tree_desc desc; | |
662 | struct name_entry entry; | |
663 | int cnt; | |
664 | ||
e0a92804 | 665 | oidcpy(&it->oid, &tree->object.oid); |
b9d37a54 JH |
666 | init_tree_desc(&desc, tree->buffer, tree->size); |
667 | cnt = 0; | |
668 | while (tree_entry(&desc, &entry)) { | |
669 | if (!S_ISDIR(entry.mode)) | |
670 | cnt++; | |
671 | else { | |
672 | struct cache_tree_sub *sub; | |
740ee055 | 673 | struct tree *subtree = lookup_tree(entry.oid); |
b9d37a54 JH |
674 | if (!subtree->object.parsed) |
675 | parse_tree(subtree); | |
676 | sub = cache_tree_sub(it, entry.path); | |
677 | sub->cache_tree = cache_tree(); | |
678 | prime_cache_tree_rec(sub->cache_tree, subtree); | |
679 | cnt += sub->cache_tree->entry_count; | |
680 | } | |
681 | } | |
682 | it->entry_count = cnt; | |
683 | } | |
684 | ||
e6c286e8 | 685 | void prime_cache_tree(struct index_state *istate, struct tree *tree) |
b9d37a54 | 686 | { |
e6c286e8 NTND |
687 | cache_tree_free(&istate->cache_tree); |
688 | istate->cache_tree = cache_tree(); | |
689 | prime_cache_tree_rec(istate->cache_tree, tree); | |
690 | istate->cache_changed |= CACHE_TREE_CHANGED; | |
b9d37a54 | 691 | } |
b65982b6 JH |
692 | |
693 | /* | |
694 | * find the cache_tree that corresponds to the current level without | |
695 | * exploding the full path into textual form. The root of the | |
696 | * cache tree is given as "root", and our current level is "info". | |
697 | * (1) When at root level, info->prev is NULL, so it is "root" itself. | |
698 | * (2) Otherwise, find the cache_tree that corresponds to one level | |
699 | * above us, and find ourselves in there. | |
700 | */ | |
701 | static struct cache_tree *find_cache_tree_from_traversal(struct cache_tree *root, | |
702 | struct traverse_info *info) | |
703 | { | |
704 | struct cache_tree *our_parent; | |
705 | ||
706 | if (!info->prev) | |
707 | return root; | |
708 | our_parent = find_cache_tree_from_traversal(root, info->prev); | |
709 | return cache_tree_find(our_parent, info->name.path); | |
710 | } | |
711 | ||
712 | int cache_tree_matches_traversal(struct cache_tree *root, | |
713 | struct name_entry *ent, | |
714 | struct traverse_info *info) | |
715 | { | |
716 | struct cache_tree *it; | |
717 | ||
718 | it = find_cache_tree_from_traversal(root, info); | |
719 | it = cache_tree_find(it, ent->path); | |
e0a92804 | 720 | if (it && it->entry_count > 0 && !oidcmp(ent->oid, &it->oid)) |
b65982b6 JH |
721 | return it->entry_count; |
722 | return 0; | |
723 | } | |
996277c5 | 724 | |
e859c69b | 725 | int update_main_cache_tree(int flags) |
996277c5 TR |
726 | { |
727 | if (!the_index.cache_tree) | |
728 | the_index.cache_tree = cache_tree(); | |
d0cfc3e8 | 729 | return cache_tree_update(&the_index, flags); |
996277c5 | 730 | } |