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