cache-tree: remove dead i-t-a code in verify_cache()
[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;
74986462
JH
78 if (it->subtree_alloc <= it->subtree_nr) {
79 it->subtree_alloc = alloc_nr(it->subtree_alloc);
80 it->down = xrealloc(it->down, it->subtree_alloc *
81 sizeof(*it->down));
82 }
61fa3097
JH
83 it->subtree_nr++;
84
74986462 85 down = xmalloc(sizeof(*down) + pathlen + 1);
61fa3097 86 down->cache_tree = NULL;
74986462
JH
87 down->namelen = pathlen;
88 memcpy(down->name, path, pathlen);
61fa3097
JH
89 down->name[pathlen] = 0;
90
91 if (pos < it->subtree_nr)
92 memmove(it->down + pos + 1,
93 it->down + pos,
94 sizeof(down) * (it->subtree_nr - pos - 1));
95 it->down[pos] = down;
74986462
JH
96 return down;
97}
98
7927a55d
JH
99struct cache_tree_sub *cache_tree_sub(struct cache_tree *it, const char *path)
100{
101 int pathlen = strlen(path);
102 return find_subtree(it, path, pathlen, 1);
103}
104
74986462
JH
105void cache_tree_invalidate_path(struct cache_tree *it, const char *path)
106{
107 /* a/b/c
108 * ==> invalidate self
109 * ==> find "a", have it invalidate "b/c"
110 * a
111 * ==> invalidate self
112 * ==> if "a" exists as a subtree, remove it.
113 */
114 const char *slash;
115 int namelen;
116 struct cache_tree_sub *down;
117
00703e6d
JH
118#if DEBUG
119 fprintf(stderr, "cache-tree invalidate <%s>\n", path);
120#endif
121
74986462
JH
122 if (!it)
123 return;
124 slash = strchr(path, '/');
125 it->entry_count = -1;
126 if (!slash) {
61fa3097 127 int pos;
74986462 128 namelen = strlen(path);
61fa3097
JH
129 pos = subtree_pos(it, path, namelen);
130 if (0 <= pos) {
131 cache_tree_free(&it->down[pos]->cache_tree);
132 free(it->down[pos]);
74986462
JH
133 /* 0 1 2 3 4 5
134 * ^ ^subtree_nr = 6
61fa3097 135 * pos
74986462 136 * move 4 and 5 up one place (2 entries)
61fa3097 137 * 2 = 6 - 3 - 1 = subtree_nr - pos - 1
74986462 138 */
61fa3097 139 memmove(it->down+pos, it->down+pos+1,
74986462 140 sizeof(struct cache_tree_sub *) *
61fa3097 141 (it->subtree_nr - pos - 1));
74986462
JH
142 it->subtree_nr--;
143 }
144 return;
145 }
146 namelen = slash - path;
147 down = find_subtree(it, path, namelen, 0);
148 if (down)
149 cache_tree_invalidate_path(down->cache_tree, slash + 1);
150}
151
152static 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++) {
161 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
NTND
169 fprintf(stderr, "%s: unmerged (%s)\n",
170 ce->name, sha1_to_hex(ce->sha1));
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
205static 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
222int 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->sha1))
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
JH
236static int update_one(struct cache_tree *it,
237 struct cache_entry **cache,
238 int entries,
239 const char *base,
240 int baselen,
e859c69b 241 int flags)
74986462 242{
5242bcbb 243 struct strbuf buffer;
e859c69b
NTND
244 int missing_ok = flags & WRITE_TREE_MISSING_OK;
245 int dryrun = flags & WRITE_TREE_DRY_RUN;
74986462
JH
246 int i;
247
dd0c34c4 248 if (0 <= it->entry_count && has_sha1_file(it->sha1))
74986462
JH
249 return it->entry_count;
250
251 /*
252 * We first scan for subtrees and update them; we start by
253 * marking existing subtrees -- the ones that are unmarked
254 * should not be in the result.
255 */
256 for (i = 0; i < it->subtree_nr; i++)
257 it->down[i]->used = 0;
258
259 /*
260 * Find the subtrees and update them.
261 */
262 for (i = 0; i < entries; i++) {
263 struct cache_entry *ce = cache[i];
264 struct cache_tree_sub *sub;
265 const char *path, *slash;
266 int pathlen, sublen, subcnt;
267
268 path = ce->name;
269 pathlen = ce_namelen(ce);
270 if (pathlen <= baselen || memcmp(base, path, baselen))
271 break; /* at the end of this level */
272
273 slash = strchr(path + baselen, '/');
274 if (!slash)
275 continue;
276 /*
277 * a/bbb/c (base = a/, slash = /c)
278 * ==>
279 * path+baselen = bbb/c, sublen = 3
280 */
281 sublen = slash - (path + baselen);
282 sub = find_subtree(it, path + baselen, sublen, 1);
283 if (!sub->cache_tree)
284 sub->cache_tree = cache_tree();
285 subcnt = update_one(sub->cache_tree,
286 cache + i, entries - i,
287 path,
288 baselen + sublen + 1,
e859c69b 289 flags);
3d12d0cf
JS
290 if (subcnt < 0)
291 return subcnt;
74986462
JH
292 i += subcnt - 1;
293 sub->used = 1;
294 }
295
296 discard_unused_subtrees(it);
297
298 /*
299 * Then write out the tree object for this level.
300 */
f1696ee3 301 strbuf_init(&buffer, 8192);
74986462
JH
302
303 for (i = 0; i < entries; i++) {
304 struct cache_entry *ce = cache[i];
305 struct cache_tree_sub *sub;
306 const char *path, *slash;
307 int pathlen, entlen;
308 const unsigned char *sha1;
309 unsigned mode;
310
311 path = ce->name;
312 pathlen = ce_namelen(ce);
313 if (pathlen <= baselen || memcmp(base, path, baselen))
314 break; /* at the end of this level */
315
316 slash = strchr(path + baselen, '/');
317 if (slash) {
318 entlen = slash - (path + baselen);
319 sub = find_subtree(it, path + baselen, entlen, 0);
320 if (!sub)
321 die("cache-tree.c: '%.*s' in '%s' not found",
322 entlen, path + baselen, path);
323 i += sub->cache_tree->entry_count - 1;
324 sha1 = sub->cache_tree->sha1;
325 mode = S_IFDIR;
326 }
327 else {
328 sha1 = ce->sha1;
7a51ed66 329 mode = ce->ce_mode;
74986462
JH
330 entlen = pathlen - baselen;
331 }
b6b56ace
JN
332 if (mode != S_IFGITLINK && !missing_ok && !has_sha1_file(sha1)) {
333 strbuf_release(&buffer);
a3883734
LT
334 return error("invalid object %06o %s for '%.*s'",
335 mode, sha1_to_hex(sha1), entlen+baselen, path);
b6b56ace 336 }
74986462 337
3f6d56de
JH
338 if (ce->ce_flags & (CE_REMOVE | CE_INTENT_TO_ADD))
339 continue; /* entry being removed or placeholder */
74986462 340
5242bcbb
PH
341 strbuf_grow(&buffer, entlen + 100);
342 strbuf_addf(&buffer, "%o %.*s%c", mode, entlen, path + baselen, '\0');
343 strbuf_add(&buffer, sha1, 20);
74986462
JH
344
345#if DEBUG
00703e6d 346 fprintf(stderr, "cache-tree update-one %o %.*s\n",
74986462
JH
347 mode, entlen, path + baselen);
348#endif
349 }
350
abdc3fc8 351 if (dryrun)
5242bcbb 352 hash_sha1_file(buffer.buf, buffer.len, tree_type, it->sha1);
edae5f0c
JH
353 else if (write_sha1_file(buffer.buf, buffer.len, tree_type, it->sha1)) {
354 strbuf_release(&buffer);
355 return -1;
356 }
357
5242bcbb 358 strbuf_release(&buffer);
74986462
JH
359 it->entry_count = i;
360#if DEBUG
00703e6d 361 fprintf(stderr, "cache-tree update-one (%d ent, %d subtree) %s\n",
74986462
JH
362 it->entry_count, it->subtree_nr,
363 sha1_to_hex(it->sha1));
364#endif
365 return i;
366}
367
368int cache_tree_update(struct cache_tree *it,
369 struct cache_entry **cache,
370 int entries,
e859c69b 371 int flags)
74986462
JH
372{
373 int i;
e859c69b 374 i = verify_cache(cache, entries, flags);
74986462
JH
375 if (i)
376 return i;
e859c69b 377 i = update_one(it, cache, entries, "", 0, flags);
74986462
JH
378 if (i < 0)
379 return i;
380 return 0;
381}
382
1dffb8fa
PH
383static void write_one(struct strbuf *buffer, struct cache_tree *it,
384 const char *path, int pathlen)
74986462
JH
385{
386 int i;
387
388 /* One "cache-tree" entry consists of the following:
389 * path (NUL terminated)
390 * entry_count, subtree_nr ("%d %d\n")
391 * tree-sha1 (missing if invalid)
392 * subtree_nr "cache-tree" entries for subtrees.
393 */
5242bcbb
PH
394 strbuf_grow(buffer, pathlen + 100);
395 strbuf_add(buffer, path, pathlen);
396 strbuf_addf(buffer, "%c%d %d\n", 0, it->entry_count, it->subtree_nr);
74986462
JH
397
398#if DEBUG
399 if (0 <= it->entry_count)
400 fprintf(stderr, "cache-tree <%.*s> (%d ent, %d subtree) %s\n",
401 pathlen, path, it->entry_count, it->subtree_nr,
402 sha1_to_hex(it->sha1));
403 else
404 fprintf(stderr, "cache-tree <%.*s> (%d subtree) invalid\n",
405 pathlen, path, it->subtree_nr);
406#endif
407
408 if (0 <= it->entry_count) {
5242bcbb 409 strbuf_add(buffer, it->sha1, 20);
74986462
JH
410 }
411 for (i = 0; i < it->subtree_nr; i++) {
412 struct cache_tree_sub *down = it->down[i];
61fa3097
JH
413 if (i) {
414 struct cache_tree_sub *prev = it->down[i-1];
415 if (subtree_name_cmp(down->name, down->namelen,
416 prev->name, prev->namelen) <= 0)
417 die("fatal - unsorted cache subtree");
418 }
1dffb8fa 419 write_one(buffer, down->cache_tree, down->name, down->namelen);
74986462 420 }
74986462
JH
421}
422
1dffb8fa 423void cache_tree_write(struct strbuf *sb, struct cache_tree *root)
74986462 424{
1dffb8fa 425 write_one(sb, root, "", 0);
74986462
JH
426}
427
428static struct cache_tree *read_one(const char **buffer, unsigned long *size_p)
429{
430 const char *buf = *buffer;
431 unsigned long size = *size_p;
0111ea38
JS
432 const char *cp;
433 char *ep;
74986462
JH
434 struct cache_tree *it;
435 int i, subtree_nr;
436
437 it = NULL;
438 /* skip name, but make sure name exists */
439 while (size && *buf) {
440 size--;
441 buf++;
442 }
443 if (!size)
444 goto free_return;
445 buf++; size--;
446 it = cache_tree();
0111ea38
JS
447
448 cp = buf;
449 it->entry_count = strtol(cp, &ep, 10);
450 if (cp == ep)
451 goto free_return;
452 cp = ep;
453 subtree_nr = strtol(cp, &ep, 10);
454 if (cp == ep)
74986462
JH
455 goto free_return;
456 while (size && *buf && *buf != '\n') {
457 size--;
458 buf++;
459 }
460 if (!size)
461 goto free_return;
462 buf++; size--;
463 if (0 <= it->entry_count) {
464 if (size < 20)
465 goto free_return;
63daae47 466 hashcpy(it->sha1, (const unsigned char*)buf);
74986462
JH
467 buf += 20;
468 size -= 20;
469 }
470
471#if DEBUG
472 if (0 <= it->entry_count)
473 fprintf(stderr, "cache-tree <%s> (%d ent, %d subtree) %s\n",
474 *buffer, it->entry_count, subtree_nr,
475 sha1_to_hex(it->sha1));
476 else
477 fprintf(stderr, "cache-tree <%s> (%d subtrees) invalid\n",
478 *buffer, subtree_nr);
479#endif
480
481 /*
482 * Just a heuristic -- we do not add directories that often but
483 * we do not want to have to extend it immediately when we do,
484 * hence +2.
485 */
486 it->subtree_alloc = subtree_nr + 2;
487 it->down = xcalloc(it->subtree_alloc, sizeof(struct cache_tree_sub *));
488 for (i = 0; i < subtree_nr; i++) {
489 /* read each subtree */
490 struct cache_tree *sub;
61fa3097 491 struct cache_tree_sub *subtree;
74986462 492 const char *name = buf;
7927a55d 493
74986462
JH
494 sub = read_one(&buf, &size);
495 if (!sub)
496 goto free_return;
7927a55d 497 subtree = cache_tree_sub(it, name);
61fa3097 498 subtree->cache_tree = sub;
74986462
JH
499 }
500 if (subtree_nr != it->subtree_nr)
501 die("cache-tree: internal error");
502 *buffer = buf;
503 *size_p = size;
504 return it;
505
506 free_return:
bad68ec9 507 cache_tree_free(&it);
74986462
JH
508 return NULL;
509}
510
bad68ec9 511struct cache_tree *cache_tree_read(const char *buffer, unsigned long size)
74986462 512{
bad68ec9 513 if (buffer[0])
74986462 514 return NULL; /* not the whole tree */
74986462
JH
515 return read_one(&buffer, &size);
516}
6bd20358 517
7ba04d9f 518static struct cache_tree *cache_tree_find(struct cache_tree *it, const char *path)
6bd20358 519{
b87fc964
JH
520 if (!it)
521 return NULL;
6bd20358
JH
522 while (*path) {
523 const char *slash;
524 struct cache_tree_sub *sub;
525
526 slash = strchr(path, '/');
527 if (!slash)
528 slash = path + strlen(path);
529 /* between path and slash is the name of the
530 * subtree to look for.
531 */
532 sub = find_subtree(it, path, slash - path, 0);
533 if (!sub)
534 return NULL;
535 it = sub->cache_tree;
536 if (slash)
537 while (*slash && *slash == '/')
538 slash++;
539 if (!slash || !*slash)
540 return it; /* prefix ended with slashes */
541 path = slash;
542 }
543 return it;
544}
45525bd0 545
d11b8d34 546int write_cache_as_tree(unsigned char *sha1, int flags, const char *prefix)
45525bd0
JH
547{
548 int entries, was_valid, newfd;
d11b8d34 549 struct lock_file *lock_file;
45525bd0
JH
550
551 /*
552 * We can't free this memory, it becomes part of a linked list
553 * parsed atexit()
554 */
d11b8d34 555 lock_file = xcalloc(1, sizeof(struct lock_file));
45525bd0
JH
556
557 newfd = hold_locked_index(lock_file, 1);
558
559 entries = read_cache();
560 if (entries < 0)
561 return WRITE_TREE_UNREADABLE_INDEX;
d11b8d34
JH
562 if (flags & WRITE_TREE_IGNORE_CACHE_TREE)
563 cache_tree_free(&(active_cache_tree));
45525bd0
JH
564
565 if (!active_cache_tree)
566 active_cache_tree = cache_tree();
567
568 was_valid = cache_tree_fully_valid(active_cache_tree);
45525bd0
JH
569 if (!was_valid) {
570 if (cache_tree_update(active_cache_tree,
571 active_cache, active_nr,
e859c69b 572 flags) < 0)
45525bd0
JH
573 return WRITE_TREE_UNMERGED_INDEX;
574 if (0 <= newfd) {
575 if (!write_cache(newfd, active_cache, active_nr) &&
576 !commit_lock_file(lock_file))
577 newfd = -1;
578 }
579 /* Not being able to write is fine -- we are only interested
580 * in updating the cache-tree part, and if the next caller
581 * ends up using the old index with unupdated cache-tree part
582 * it misses the work we did here, but that is just a
583 * performance penalty and not a big deal.
584 */
585 }
586
587 if (prefix) {
588 struct cache_tree *subtree =
589 cache_tree_find(active_cache_tree, prefix);
590 if (!subtree)
591 return WRITE_TREE_PREFIX_ERROR;
592 hashcpy(sha1, subtree->sha1);
593 }
594 else
595 hashcpy(sha1, active_cache_tree->sha1);
596
597 if (0 <= newfd)
598 rollback_lock_file(lock_file);
599
600 return 0;
601}
b9d37a54
JH
602
603static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree)
604{
605 struct tree_desc desc;
606 struct name_entry entry;
607 int cnt;
608
609 hashcpy(it->sha1, tree->object.sha1);
610 init_tree_desc(&desc, tree->buffer, tree->size);
611 cnt = 0;
612 while (tree_entry(&desc, &entry)) {
613 if (!S_ISDIR(entry.mode))
614 cnt++;
615 else {
616 struct cache_tree_sub *sub;
617 struct tree *subtree = lookup_tree(entry.sha1);
618 if (!subtree->object.parsed)
619 parse_tree(subtree);
620 sub = cache_tree_sub(it, entry.path);
621 sub->cache_tree = cache_tree();
622 prime_cache_tree_rec(sub->cache_tree, subtree);
623 cnt += sub->cache_tree->entry_count;
624 }
625 }
626 it->entry_count = cnt;
627}
628
629void prime_cache_tree(struct cache_tree **it, struct tree *tree)
630{
631 cache_tree_free(it);
632 *it = cache_tree();
633 prime_cache_tree_rec(*it, tree);
634}
b65982b6
JH
635
636/*
637 * find the cache_tree that corresponds to the current level without
638 * exploding the full path into textual form. The root of the
639 * cache tree is given as "root", and our current level is "info".
640 * (1) When at root level, info->prev is NULL, so it is "root" itself.
641 * (2) Otherwise, find the cache_tree that corresponds to one level
642 * above us, and find ourselves in there.
643 */
644static struct cache_tree *find_cache_tree_from_traversal(struct cache_tree *root,
645 struct traverse_info *info)
646{
647 struct cache_tree *our_parent;
648
649 if (!info->prev)
650 return root;
651 our_parent = find_cache_tree_from_traversal(root, info->prev);
652 return cache_tree_find(our_parent, info->name.path);
653}
654
655int cache_tree_matches_traversal(struct cache_tree *root,
656 struct name_entry *ent,
657 struct traverse_info *info)
658{
659 struct cache_tree *it;
660
661 it = find_cache_tree_from_traversal(root, info);
662 it = cache_tree_find(it, ent->path);
663 if (it && it->entry_count > 0 && !hashcmp(ent->sha1, it->sha1))
664 return it->entry_count;
665 return 0;
666}
996277c5 667
e859c69b 668int update_main_cache_tree(int flags)
996277c5
TR
669{
670 if (!the_index.cache_tree)
671 the_index.cache_tree = cache_tree();
672 return cache_tree_update(the_index.cache_tree,
e859c69b 673 the_index.cache, the_index.cache_nr, flags);
996277c5 674}