3 #include "cache-tree.h"
7 struct cache_tree *cache_tree(void)
9 struct cache_tree *it = xcalloc(1, sizeof(struct cache_tree));
14 void cache_tree_free(struct cache_tree **it_p)
17 struct cache_tree *it = *it_p;
21 for (i = 0; i < it->subtree_nr; i++)
23 cache_tree_free(&it->down[i]->cache_tree);
29 static int subtree_name_cmp(const char *one, int onelen,
30 const char *two, int twolen)
36 return memcmp(one, two, onelen);
39 static int subtree_pos(struct cache_tree *it, const char *path, int pathlen)
41 struct cache_tree_sub **down = it->down;
46 int mi = (lo + hi) / 2;
47 struct cache_tree_sub *mdl = down[mi];
48 int cmp = subtree_name_cmp(path, pathlen,
49 mdl->name, mdl->namelen);
60 static struct cache_tree_sub *find_subtree(struct cache_tree *it,
65 struct cache_tree_sub *down;
66 int pos = subtree_pos(it, path, pathlen);
73 if (it->subtree_alloc <= it->subtree_nr) {
74 it->subtree_alloc = alloc_nr(it->subtree_alloc);
75 it->down = xrealloc(it->down, it->subtree_alloc *
80 down = xmalloc(sizeof(*down) + pathlen + 1);
81 down->cache_tree = NULL;
82 down->namelen = pathlen;
83 memcpy(down->name, path, pathlen);
84 down->name[pathlen] = 0;
86 if (pos < it->subtree_nr)
87 memmove(it->down + pos + 1,
89 sizeof(down) * (it->subtree_nr - pos - 1));
94 struct cache_tree_sub *cache_tree_sub(struct cache_tree *it, const char *path)
96 int pathlen = strlen(path);
97 return find_subtree(it, path, pathlen, 1);
100 void cache_tree_invalidate_path(struct cache_tree *it, const char *path)
103 * ==> invalidate self
104 * ==> find "a", have it invalidate "b/c"
106 * ==> invalidate self
107 * ==> if "a" exists as a subtree, remove it.
111 struct cache_tree_sub *down;
115 slash = strchr(path, '/');
116 it->entry_count = -1;
119 namelen = strlen(path);
120 pos = subtree_pos(it, path, namelen);
122 cache_tree_free(&it->down[pos]->cache_tree);
127 * move 4 and 5 up one place (2 entries)
128 * 2 = 6 - 3 - 1 = subtree_nr - pos - 1
130 memmove(it->down+pos, it->down+pos+1,
131 sizeof(struct cache_tree_sub *) *
132 (it->subtree_nr - pos - 1));
137 namelen = slash - path;
138 down = find_subtree(it, path, namelen, 0);
140 cache_tree_invalidate_path(down->cache_tree, slash + 1);
143 static int verify_cache(struct cache_entry **cache,
148 /* Verify that the tree is merged */
150 for (i = 0; i < entries; i++) {
151 struct cache_entry *ce = cache[i];
154 fprintf(stderr, "...\n");
157 fprintf(stderr, "%s: unmerged (%s)\n",
158 ce->name, sha1_to_hex(ce->sha1));
164 /* Also verify that the cache does not have path and path/file
165 * at the same time. At this point we know the cache has only
169 for (i = 0; i < entries - 1; i++) {
170 /* path/file always comes after path because of the way
171 * the cache is sorted. Also path can appear only once,
172 * which means conflicting one would immediately follow.
174 const char *this_name = cache[i]->name;
175 const char *next_name = cache[i+1]->name;
176 int this_len = strlen(this_name);
177 if (this_len < strlen(next_name) &&
178 strncmp(this_name, next_name, this_len) == 0 &&
179 next_name[this_len] == '/') {
181 fprintf(stderr, "...\n");
184 fprintf(stderr, "You have both %s and %s\n",
185 this_name, next_name);
193 static void discard_unused_subtrees(struct cache_tree *it)
195 struct cache_tree_sub **down = it->down;
196 int nr = it->subtree_nr;
198 for (dst = src = 0; src < nr; src++) {
199 struct cache_tree_sub *s = down[src];
203 cache_tree_free(&s->cache_tree);
210 int cache_tree_fully_valid(struct cache_tree *it)
215 if (it->entry_count < 0 || !has_sha1_file(it->sha1))
217 for (i = 0; i < it->subtree_nr; i++) {
218 if (!cache_tree_fully_valid(it->down[i]->cache_tree))
224 static int update_one(struct cache_tree *it,
225 struct cache_entry **cache,
231 unsigned long size, offset;
235 if (0 <= it->entry_count && has_sha1_file(it->sha1))
236 return it->entry_count;
239 * We first scan for subtrees and update them; we start by
240 * marking existing subtrees -- the ones that are unmarked
241 * should not be in the result.
243 for (i = 0; i < it->subtree_nr; i++)
244 it->down[i]->used = 0;
247 * Find the subtrees and update them.
249 for (i = 0; i < entries; i++) {
250 struct cache_entry *ce = cache[i];
251 struct cache_tree_sub *sub;
252 const char *path, *slash;
253 int pathlen, sublen, subcnt;
256 pathlen = ce_namelen(ce);
257 if (pathlen <= baselen || memcmp(base, path, baselen))
258 break; /* at the end of this level */
260 slash = strchr(path + baselen, '/');
264 * a/bbb/c (base = a/, slash = /c)
266 * path+baselen = bbb/c, sublen = 3
268 sublen = slash - (path + baselen);
269 sub = find_subtree(it, path + baselen, sublen, 1);
270 if (!sub->cache_tree)
271 sub->cache_tree = cache_tree();
272 subcnt = update_one(sub->cache_tree,
273 cache + i, entries - i,
275 baselen + sublen + 1,
281 discard_unused_subtrees(it);
284 * Then write out the tree object for this level.
287 buffer = xmalloc(size);
290 for (i = 0; i < entries; i++) {
291 struct cache_entry *ce = cache[i];
292 struct cache_tree_sub *sub;
293 const char *path, *slash;
295 const unsigned char *sha1;
299 pathlen = ce_namelen(ce);
300 if (pathlen <= baselen || memcmp(base, path, baselen))
301 break; /* at the end of this level */
303 slash = strchr(path + baselen, '/');
305 entlen = slash - (path + baselen);
306 sub = find_subtree(it, path + baselen, entlen, 0);
308 die("cache-tree.c: '%.*s' in '%s' not found",
309 entlen, path + baselen, path);
310 i += sub->cache_tree->entry_count - 1;
311 sha1 = sub->cache_tree->sha1;
316 mode = ntohl(ce->ce_mode);
317 entlen = pathlen - baselen;
319 if (!missing_ok && !has_sha1_file(sha1))
320 return error("invalid object %s", sha1_to_hex(sha1));
323 continue; /* entry being removed */
325 if (size < offset + entlen + 100) {
326 size = alloc_nr(offset + entlen + 100);
327 buffer = xrealloc(buffer, size);
329 offset += sprintf(buffer + offset,
330 "%o %.*s", mode, entlen, path + baselen);
331 buffer[offset++] = 0;
332 memcpy(buffer + offset, sha1, 20);
336 fprintf(stderr, "cache-tree %o %.*s\n",
337 mode, entlen, path + baselen);
341 write_sha1_file(buffer, offset, tree_type, it->sha1);
345 fprintf(stderr, "cache-tree (%d ent, %d subtree) %s\n",
346 it->entry_count, it->subtree_nr,
347 sha1_to_hex(it->sha1));
352 int cache_tree_update(struct cache_tree *it,
353 struct cache_entry **cache,
358 i = verify_cache(cache, entries);
361 i = update_one(it, cache, entries, "", 0, missing_ok);
367 static void *write_one(struct cache_tree *it,
372 unsigned long *offset)
376 /* One "cache-tree" entry consists of the following:
377 * path (NUL terminated)
378 * entry_count, subtree_nr ("%d %d\n")
379 * tree-sha1 (missing if invalid)
380 * subtree_nr "cache-tree" entries for subtrees.
382 if (*size < *offset + pathlen + 100) {
383 *size = alloc_nr(*offset + pathlen + 100);
384 buffer = xrealloc(buffer, *size);
386 *offset += sprintf(buffer + *offset, "%.*s%c%d %d\n",
388 it->entry_count, it->subtree_nr);
391 if (0 <= it->entry_count)
392 fprintf(stderr, "cache-tree <%.*s> (%d ent, %d subtree) %s\n",
393 pathlen, path, it->entry_count, it->subtree_nr,
394 sha1_to_hex(it->sha1));
396 fprintf(stderr, "cache-tree <%.*s> (%d subtree) invalid\n",
397 pathlen, path, it->subtree_nr);
400 if (0 <= it->entry_count) {
401 memcpy(buffer + *offset, it->sha1, 20);
404 for (i = 0; i < it->subtree_nr; i++) {
405 struct cache_tree_sub *down = it->down[i];
407 struct cache_tree_sub *prev = it->down[i-1];
408 if (subtree_name_cmp(down->name, down->namelen,
409 prev->name, prev->namelen) <= 0)
410 die("fatal - unsorted cache subtree");
412 buffer = write_one(down->cache_tree, down->name, down->namelen,
413 buffer, size, offset);
418 void *cache_tree_write(struct cache_tree *root, unsigned long *size_p)
421 unsigned long size = 8192;
422 char *buffer = xmalloc(size);
426 return write_one(root, path, 0, buffer, &size, size_p);
429 static struct cache_tree *read_one(const char **buffer, unsigned long *size_p)
431 const char *buf = *buffer;
432 unsigned long size = *size_p;
433 struct cache_tree *it;
437 /* skip name, but make sure name exists */
438 while (size && *buf) {
446 if (sscanf(buf, "%d %d\n", &it->entry_count, &subtree_nr) != 2)
448 while (size && *buf && *buf != '\n') {
455 if (0 <= it->entry_count) {
458 memcpy(it->sha1, buf, 20);
464 if (0 <= it->entry_count)
465 fprintf(stderr, "cache-tree <%s> (%d ent, %d subtree) %s\n",
466 *buffer, it->entry_count, subtree_nr,
467 sha1_to_hex(it->sha1));
469 fprintf(stderr, "cache-tree <%s> (%d subtrees) invalid\n",
470 *buffer, subtree_nr);
474 * Just a heuristic -- we do not add directories that often but
475 * we do not want to have to extend it immediately when we do,
478 it->subtree_alloc = subtree_nr + 2;
479 it->down = xcalloc(it->subtree_alloc, sizeof(struct cache_tree_sub *));
480 for (i = 0; i < subtree_nr; i++) {
481 /* read each subtree */
482 struct cache_tree *sub;
483 struct cache_tree_sub *subtree;
484 const char *name = buf;
486 sub = read_one(&buf, &size);
489 subtree = cache_tree_sub(it, name);
490 subtree->cache_tree = sub;
492 if (subtree_nr != it->subtree_nr)
493 die("cache-tree: internal error");
499 cache_tree_free(&it);
503 struct cache_tree *cache_tree_read(const char *buffer, unsigned long size)
506 return NULL; /* not the whole tree */
507 return read_one(&buffer, &size);