6574eeb80dc972b8533363937e072dca0ea61930
1#include "cache.h"
2#include "lockfile.h"
3#include "tree.h"
4#include "tree-walk.h"
5#include "cache-tree.h"
6#ifndef DEBUG
8#define DEBUG 0
9#endif
10struct 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}
17void cache_tree_free(struct cache_tree **it_p)
19{
20 int i;
21 struct cache_tree *it = *it_p;
22 if (!it)
24 return;
25 for (i = 0; i < it->subtree_nr; i++)
26 if (it->down[i]) {
27 cache_tree_free(&it->down[i]->cache_tree);
28 free(it->down[i]);
29 }
30 free(it->down);
31 free(it);
32 *it_p = NULL;
33}
34static 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}
44static 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) {
52 int mi = lo + (hi - lo) / 2;
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}
65static struct cache_tree_sub *find_subtree(struct cache_tree *it,
67 const char *path,
68 int pathlen,
69 int create)
70{
71 struct cache_tree_sub *down;
72 int pos = subtree_pos(it, path, pathlen);
73 if (0 <= pos)
74 return it->down[pos];
75 if (!create)
76 return NULL;
77 pos = -pos-1;
79 ALLOC_GROW(it->down, it->subtree_nr + 1, it->subtree_alloc);
80 it->subtree_nr++;
81 FLEX_ALLOC_MEM(down, name, path, pathlen);
83 down->cache_tree = NULL;
84 down->namelen = pathlen;
85 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;
91 return down;
92}
93struct 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}
99static int do_invalidate_path(struct cache_tree *it, const char *path)
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#if DEBUG
114 fprintf(stderr, "cache-tree invalidate <%s>\n", path);
115#endif
116 if (!it)
118 return 0;
119 slash = strchrnul(path, '/');
120 namelen = slash - path;
121 it->entry_count = -1;
122 if (!*slash) {
123 int pos;
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]);
128 /* 0 1 2 3 4 5
129 * ^ ^subtree_nr = 6
130 * pos
131 * move 4 and 5 up one place (2 entries)
132 * 2 = 6 - 3 - 1 = subtree_nr - pos - 1
133 */
134 MOVE_ARRAY(it->down + pos, it->down + pos + 1,
135 it->subtree_nr - pos - 1);
136 it->subtree_nr--;
137 }
138 return 1;
139 }
140 down = find_subtree(it, path, namelen, 0);
141 if (down)
142 do_invalidate_path(down->cache_tree, slash + 1);
143 return 1;
144}
145void 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;
150}
151static int verify_cache(struct cache_entry **cache,
153 int entries, int flags)
154{
155 int i, funny;
156 int silent = flags & WRITE_TREE_SILENT;
157 /* Verify that the tree is merged */
159 funny = 0;
160 for (i = 0; i < entries; i++) {
161 const struct cache_entry *ce = cache[i];
162 if (ce_stage(ce)) {
163 if (silent)
164 return -1;
165 if (10 < ++funny) {
166 fprintf(stderr, "...\n");
167 break;
168 }
169 fprintf(stderr, "%s: unmerged (%s)\n",
170 ce->name, oid_to_hex(&ce->oid));
171 }
172 }
173 if (funny)
174 return -1;
175 /* 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}
204static 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 {
215 cache_tree_free(&s->cache_tree);
216 free(s);
217 it->subtree_nr--;
218 }
219 }
220}
221int cache_tree_fully_valid(struct cache_tree *it)
223{
224 int i;
225 if (!it)
226 return 0;
227 if (it->entry_count < 0 || !has_sha1_file(it->oid.hash))
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}
235static int update_one(struct cache_tree *it,
237 struct cache_entry **cache,
238 int entries,
239 const char *base,
240 int baselen,
241 int *skip_count,
242 int flags)
243{
244 struct strbuf buffer;
245 int missing_ok = flags & WRITE_TREE_MISSING_OK;
246 int dryrun = flags & WRITE_TREE_DRY_RUN;
247 int repair = flags & WRITE_TREE_REPAIR;
248 int to_invalidate = 0;
249 int i;
250 assert(!(dryrun && repair));
252 *skip_count = 0;
254 if (0 <= it->entry_count && has_sha1_file(it->oid.hash))
256 return it->entry_count;
257 /*
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 /*
267 * Find the subtrees and update them.
268 */
269 i = 0;
270 while (i < entries) {
271 const struct cache_entry *ce = cache[i];
272 struct cache_tree_sub *sub;
273 const char *path, *slash;
274 int pathlen, sublen, subcnt, subskip;
275 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 slash = strchr(path + baselen, '/');
282 if (!slash) {
283 i++;
284 continue;
285 }
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,
299 &subskip,
300 flags);
301 if (subcnt < 0)
302 return subcnt;
303 if (!subcnt)
304 die("index cache-tree records empty sub-tree");
305 i += subcnt;
306 sub->count = subcnt; /* to be used in the next loop */
307 *skip_count += subskip;
308 sub->used = 1;
309 }
310 discard_unused_subtrees(it);
312 /*
314 * Then write out the tree object for this level.
315 */
316 strbuf_init(&buffer, 8192);
317 i = 0;
319 while (i < entries) {
320 const struct cache_entry *ce = cache[i];
321 struct cache_tree_sub *sub = NULL;
322 const char *path, *slash;
323 int pathlen, entlen;
324 const unsigned char *sha1;
325 unsigned mode;
326 int expected_missing = 0;
327 int contains_ita = 0;
328 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 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);
341 i += sub->count;
342 sha1 = sub->cache_tree->oid.hash;
343 mode = S_IFDIR;
344 contains_ita = sub->cache_tree->entry_count < 0;
345 if (contains_ita) {
346 to_invalidate = 1;
347 expected_missing = 1;
348 }
349 }
350 else {
351 sha1 = ce->oid.hash;
352 mode = ce->ce_mode;
353 entlen = pathlen - baselen;
354 i++;
355 }
356 if (is_null_sha1(sha1) ||
358 (mode != S_IFGITLINK && !missing_ok && !has_sha1_file(sha1))) {
359 strbuf_release(&buffer);
360 if (expected_missing)
361 return -1;
362 return error("invalid object %06o %s for '%.*s'",
363 mode, sha1_to_hex(sha1), entlen+baselen, path);
364 }
365 /*
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 /*
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 */
381 if (!sub && ce_intent_to_add(ce)) {
382 to_invalidate = 1;
383 continue;
384 }
385 /*
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 strbuf_grow(&buffer, entlen + 100);
393 strbuf_addf(&buffer, "%o %.*s%c", mode, entlen, path + baselen, '\0');
394 strbuf_add(&buffer, sha1, 20);
395#if DEBUG
397 fprintf(stderr, "cache-tree update-one %o %.*s\n",
398 mode, entlen, path + baselen);
399#endif
400 }
401 if (repair) {
403 struct object_id oid;
404 hash_object_file(buffer.buf, buffer.len, tree_type, &oid);
405 if (has_sha1_file(oid.hash))
406 oidcpy(&it->oid, &oid);
407 else
408 to_invalidate = 1;
409 } else if (dryrun)
410 hash_object_file(buffer.buf, buffer.len, tree_type, &it->oid);
411 else if (write_sha1_file(buffer.buf, buffer.len, tree_type, it->oid.hash)) {
412 strbuf_release(&buffer);
413 return -1;
414 }
415 strbuf_release(&buffer);
417 it->entry_count = to_invalidate ? -1 : i - *skip_count;
418#if DEBUG
419 fprintf(stderr, "cache-tree update-one (%d ent, %d subtree) %s\n",
420 it->entry_count, it->subtree_nr,
421 oid_to_hex(&it->oid));
422#endif
423 return i;
424}
425int cache_tree_update(struct index_state *istate, int flags)
427{
428 struct cache_tree *it = istate->cache_tree;
429 struct cache_entry **cache = istate->cache;
430 int entries = istate->cache_nr;
431 int skip, i = verify_cache(cache, entries, flags);
432 if (i)
434 return i;
435 i = update_one(it, cache, entries, "", 0, &skip, flags);
436 if (i < 0)
437 return i;
438 istate->cache_changed |= CACHE_TREE_CHANGED;
439 return 0;
440}
441static void write_one(struct strbuf *buffer, struct cache_tree *it,
443 const char *path, int pathlen)
444{
445 int i;
446 /* One "cache-tree" entry consists of the following:
448 * path (NUL terminated)
449 * entry_count, subtree_nr ("%d %d\n")
450 * tree-sha1 (missing if invalid)
451 * subtree_nr "cache-tree" entries for subtrees.
452 */
453 strbuf_grow(buffer, pathlen + 100);
454 strbuf_add(buffer, path, pathlen);
455 strbuf_addf(buffer, "%c%d %d\n", 0, it->entry_count, it->subtree_nr);
456#if DEBUG
458 if (0 <= it->entry_count)
459 fprintf(stderr, "cache-tree <%.*s> (%d ent, %d subtree) %s\n",
460 pathlen, path, it->entry_count, it->subtree_nr,
461 oid_to_hex(&it->oid));
462 else
463 fprintf(stderr, "cache-tree <%.*s> (%d subtree) invalid\n",
464 pathlen, path, it->subtree_nr);
465#endif
466 if (0 <= it->entry_count) {
468 strbuf_add(buffer, it->oid.hash, 20);
469 }
470 for (i = 0; i < it->subtree_nr; i++) {
471 struct cache_tree_sub *down = it->down[i];
472 if (i) {
473 struct cache_tree_sub *prev = it->down[i-1];
474 if (subtree_name_cmp(down->name, down->namelen,
475 prev->name, prev->namelen) <= 0)
476 die("fatal - unsorted cache subtree");
477 }
478 write_one(buffer, down->cache_tree, down->name, down->namelen);
479 }
480}
481void cache_tree_write(struct strbuf *sb, struct cache_tree *root)
483{
484 write_one(sb, root, "", 0);
485}
486static struct cache_tree *read_one(const char **buffer, unsigned long *size_p)
488{
489 const char *buf = *buffer;
490 unsigned long size = *size_p;
491 const char *cp;
492 char *ep;
493 struct cache_tree *it;
494 int i, subtree_nr;
495 it = NULL;
497 /* skip name, but make sure name exists */
498 while (size && *buf) {
499 size--;
500 buf++;
501 }
502 if (!size)
503 goto free_return;
504 buf++; size--;
505 it = cache_tree();
506 cp = buf;
508 it->entry_count = strtol(cp, &ep, 10);
509 if (cp == ep)
510 goto free_return;
511 cp = ep;
512 subtree_nr = strtol(cp, &ep, 10);
513 if (cp == ep)
514 goto free_return;
515 while (size && *buf && *buf != '\n') {
516 size--;
517 buf++;
518 }
519 if (!size)
520 goto free_return;
521 buf++; size--;
522 if (0 <= it->entry_count) {
523 if (size < 20)
524 goto free_return;
525 hashcpy(it->oid.hash, (const unsigned char*)buf);
526 buf += 20;
527 size -= 20;
528 }
529#if DEBUG
531 if (0 <= it->entry_count)
532 fprintf(stderr, "cache-tree <%s> (%d ent, %d subtree) %s\n",
533 *buffer, it->entry_count, subtree_nr,
534 oid_to_hex(&it->oid));
535 else
536 fprintf(stderr, "cache-tree <%s> (%d subtrees) invalid\n",
537 *buffer, subtree_nr);
538#endif
539 /*
541 * Just a heuristic -- we do not add directories that often but
542 * we do not want to have to extend it immediately when we do,
543 * hence +2.
544 */
545 it->subtree_alloc = subtree_nr + 2;
546 it->down = xcalloc(it->subtree_alloc, sizeof(struct cache_tree_sub *));
547 for (i = 0; i < subtree_nr; i++) {
548 /* read each subtree */
549 struct cache_tree *sub;
550 struct cache_tree_sub *subtree;
551 const char *name = buf;
552 sub = read_one(&buf, &size);
554 if (!sub)
555 goto free_return;
556 subtree = cache_tree_sub(it, name);
557 subtree->cache_tree = sub;
558 }
559 if (subtree_nr != it->subtree_nr)
560 die("cache-tree: internal error");
561 *buffer = buf;
562 *size_p = size;
563 return it;
564 free_return:
566 cache_tree_free(&it);
567 return NULL;
568}
569struct cache_tree *cache_tree_read(const char *buffer, unsigned long size)
571{
572 if (buffer[0])
573 return NULL; /* not the whole tree */
574 return read_one(&buffer, &size);
575}
576static struct cache_tree *cache_tree_find(struct cache_tree *it, const char *path)
578{
579 if (!it)
580 return NULL;
581 while (*path) {
582 const char *slash;
583 struct cache_tree_sub *sub;
584 slash = strchrnul(path, '/');
586 /*
587 * Between path and slash is the name of the subtree
588 * to look for.
589 */
590 sub = find_subtree(it, path, slash - path, 0);
591 if (!sub)
592 return NULL;
593 it = sub->cache_tree;
594 path = slash;
596 while (*path == '/')
597 path++;
598 }
599 return it;
600}
601int write_index_as_tree(unsigned char *sha1, struct index_state *index_state, const char *index_path, int flags, const char *prefix)
603{
604 int entries, was_valid;
605 struct lock_file lock_file = LOCK_INIT;
606 int ret = 0;
607 hold_lock_file_for_update(&lock_file, index_path, LOCK_DIE_ON_ERROR);
609 entries = read_index_from(index_state, index_path);
611 if (entries < 0) {
612 ret = WRITE_TREE_UNREADABLE_INDEX;
613 goto out;
614 }
615 if (flags & WRITE_TREE_IGNORE_CACHE_TREE)
616 cache_tree_free(&index_state->cache_tree);
617 if (!index_state->cache_tree)
619 index_state->cache_tree = cache_tree();
620 was_valid = cache_tree_fully_valid(index_state->cache_tree);
622 if (!was_valid) {
623 if (cache_tree_update(index_state, flags) < 0) {
624 ret = WRITE_TREE_UNMERGED_INDEX;
625 goto out;
626 }
627 write_locked_index(index_state, &lock_file, COMMIT_LOCK);
628 /* Not being able to write is fine -- we are only interested
629 * in updating the cache-tree part, and if the next caller
630 * ends up using the old index with unupdated cache-tree part
631 * it misses the work we did here, but that is just a
632 * performance penalty and not a big deal.
633 */
634 }
635 if (prefix) {
637 struct cache_tree *subtree;
638 subtree = cache_tree_find(index_state->cache_tree, prefix);
639 if (!subtree) {
640 ret = WRITE_TREE_PREFIX_ERROR;
641 goto out;
642 }
643 hashcpy(sha1, subtree->oid.hash);
644 }
645 else
646 hashcpy(sha1, index_state->cache_tree->oid.hash);
647out:
649 rollback_lock_file(&lock_file);
650 return ret;
651}
652int write_cache_as_tree(unsigned char *sha1, int flags, const char *prefix)
654{
655 return write_index_as_tree(sha1, &the_index, get_index_file(), flags, prefix);
656}
657static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree)
659{
660 struct tree_desc desc;
661 struct name_entry entry;
662 int cnt;
663 oidcpy(&it->oid, &tree->object.oid);
665 init_tree_desc(&desc, tree->buffer, tree->size);
666 cnt = 0;
667 while (tree_entry(&desc, &entry)) {
668 if (!S_ISDIR(entry.mode))
669 cnt++;
670 else {
671 struct cache_tree_sub *sub;
672 struct tree *subtree = lookup_tree(entry.oid);
673 if (!subtree->object.parsed)
674 parse_tree(subtree);
675 sub = cache_tree_sub(it, entry.path);
676 sub->cache_tree = cache_tree();
677 prime_cache_tree_rec(sub->cache_tree, subtree);
678 cnt += sub->cache_tree->entry_count;
679 }
680 }
681 it->entry_count = cnt;
682}
683void prime_cache_tree(struct index_state *istate, struct tree *tree)
685{
686 cache_tree_free(&istate->cache_tree);
687 istate->cache_tree = cache_tree();
688 prime_cache_tree_rec(istate->cache_tree, tree);
689 istate->cache_changed |= CACHE_TREE_CHANGED;
690}
691/*
693 * find the cache_tree that corresponds to the current level without
694 * exploding the full path into textual form. The root of the
695 * cache tree is given as "root", and our current level is "info".
696 * (1) When at root level, info->prev is NULL, so it is "root" itself.
697 * (2) Otherwise, find the cache_tree that corresponds to one level
698 * above us, and find ourselves in there.
699 */
700static struct cache_tree *find_cache_tree_from_traversal(struct cache_tree *root,
701 struct traverse_info *info)
702{
703 struct cache_tree *our_parent;
704 if (!info->prev)
706 return root;
707 our_parent = find_cache_tree_from_traversal(root, info->prev);
708 return cache_tree_find(our_parent, info->name.path);
709}
710int cache_tree_matches_traversal(struct cache_tree *root,
712 struct name_entry *ent,
713 struct traverse_info *info)
714{
715 struct cache_tree *it;
716 it = find_cache_tree_from_traversal(root, info);
718 it = cache_tree_find(it, ent->path);
719 if (it && it->entry_count > 0 && !oidcmp(ent->oid, &it->oid))
720 return it->entry_count;
721 return 0;
722}
723int update_main_cache_tree(int flags)
725{
726 if (!the_index.cache_tree)
727 the_index.cache_tree = cache_tree();
728 return cache_tree_update(&the_index, flags);
729}