4 #include "cache-tree.h"
10 struct cache_tree
*cache_tree(void)
12 struct cache_tree
*it
= xcalloc(1, sizeof(struct cache_tree
));
17 void cache_tree_free(struct cache_tree
**it_p
)
20 struct cache_tree
*it
= *it_p
;
24 for (i
= 0; i
< it
->subtree_nr
; i
++)
26 cache_tree_free(&it
->down
[i
]->cache_tree
);
34 static int subtree_name_cmp(const char *one
, int onelen
,
35 const char *two
, int twolen
)
41 return memcmp(one
, two
, onelen
);
44 static int subtree_pos(struct cache_tree
*it
, const char *path
, int pathlen
)
46 struct cache_tree_sub
**down
= it
->down
;
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
);
65 static struct cache_tree_sub
*find_subtree(struct cache_tree
*it
,
70 struct cache_tree_sub
*down
;
71 int pos
= subtree_pos(it
, path
, pathlen
);
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
*
85 down
= xmalloc(sizeof(*down
) + pathlen
+ 1);
86 down
->cache_tree
= NULL
;
87 down
->namelen
= pathlen
;
88 memcpy(down
->name
, path
, pathlen
);
89 down
->name
[pathlen
] = 0;
91 if (pos
< it
->subtree_nr
)
92 memmove(it
->down
+ pos
+ 1,
94 sizeof(down
) * (it
->subtree_nr
- pos
- 1));
99 struct cache_tree_sub
*cache_tree_sub(struct cache_tree
*it
, const char *path
)
101 int pathlen
= strlen(path
);
102 return find_subtree(it
, path
, pathlen
, 1);
105 void cache_tree_invalidate_path(struct cache_tree
*it
, const char *path
)
108 * ==> invalidate self
109 * ==> find "a", have it invalidate "b/c"
111 * ==> invalidate self
112 * ==> if "a" exists as a subtree, remove it.
116 struct cache_tree_sub
*down
;
119 fprintf(stderr
, "cache-tree invalidate <%s>\n", path
);
124 slash
= strchr(path
, '/');
125 it
->entry_count
= -1;
128 namelen
= strlen(path
);
129 pos
= subtree_pos(it
, path
, namelen
);
131 cache_tree_free(&it
->down
[pos
]->cache_tree
);
136 * move 4 and 5 up one place (2 entries)
137 * 2 = 6 - 3 - 1 = subtree_nr - pos - 1
139 memmove(it
->down
+pos
, it
->down
+pos
+1,
140 sizeof(struct cache_tree_sub
*) *
141 (it
->subtree_nr
- pos
- 1));
146 namelen
= slash
- path
;
147 down
= find_subtree(it
, path
, namelen
, 0);
149 cache_tree_invalidate_path(down
->cache_tree
, slash
+ 1);
152 static int verify_cache(struct cache_entry
**cache
,
153 int entries
, int flags
)
156 int silent
= flags
& WRITE_TREE_SILENT
;
158 /* Verify that the tree is merged */
160 for (i
= 0; i
< entries
; i
++) {
161 struct cache_entry
*ce
= cache
[i
];
166 fprintf(stderr
, "...\n");
169 fprintf(stderr
, "%s: unmerged (%s)\n",
170 ce
->name
, sha1_to_hex(ce
->sha1
));
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
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.
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
] == '/') {
193 fprintf(stderr
, "...\n");
196 fprintf(stderr
, "You have both %s and %s\n",
197 this_name
, next_name
);
205 static void discard_unused_subtrees(struct cache_tree
*it
)
207 struct cache_tree_sub
**down
= it
->down
;
208 int nr
= it
->subtree_nr
;
210 for (dst
= src
= 0; src
< nr
; src
++) {
211 struct cache_tree_sub
*s
= down
[src
];
215 cache_tree_free(&s
->cache_tree
);
222 int cache_tree_fully_valid(struct cache_tree
*it
)
227 if (it
->entry_count
< 0 || !has_sha1_file(it
->sha1
))
229 for (i
= 0; i
< it
->subtree_nr
; i
++) {
230 if (!cache_tree_fully_valid(it
->down
[i
]->cache_tree
))
236 static int update_one(struct cache_tree
*it
,
237 struct cache_entry
**cache
,
243 struct strbuf buffer
;
244 int missing_ok
= flags
& WRITE_TREE_MISSING_OK
;
245 int dryrun
= flags
& WRITE_TREE_DRY_RUN
;
248 if (0 <= it
->entry_count
&& has_sha1_file(it
->sha1
))
249 return it
->entry_count
;
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.
256 for (i
= 0; i
< it
->subtree_nr
; i
++)
257 it
->down
[i
]->used
= 0;
260 * Find the subtrees and update them.
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
;
269 pathlen
= ce_namelen(ce
);
270 if (pathlen
<= baselen
|| memcmp(base
, path
, baselen
))
271 break; /* at the end of this level */
273 slash
= strchr(path
+ baselen
, '/');
277 * a/bbb/c (base = a/, slash = /c)
279 * path+baselen = bbb/c, sublen = 3
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
,
288 baselen
+ sublen
+ 1,
296 discard_unused_subtrees(it
);
299 * Then write out the tree object for this level.
301 strbuf_init(&buffer
, 8192);
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
;
308 const unsigned char *sha1
;
312 pathlen
= ce_namelen(ce
);
313 if (pathlen
<= baselen
|| memcmp(base
, path
, baselen
))
314 break; /* at the end of this level */
316 slash
= strchr(path
+ baselen
, '/');
318 entlen
= slash
- (path
+ baselen
);
319 sub
= find_subtree(it
, path
+ baselen
, entlen
, 0);
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
;
330 entlen
= pathlen
- baselen
;
332 if (mode
!= S_IFGITLINK
&& !missing_ok
&& !has_sha1_file(sha1
)) {
333 strbuf_release(&buffer
);
334 return error("invalid object %06o %s for '%.*s'",
335 mode
, sha1_to_hex(sha1
), entlen
+baselen
, path
);
338 if (ce
->ce_flags
& (CE_REMOVE
| CE_INTENT_TO_ADD
))
339 continue; /* entry being removed or placeholder */
341 strbuf_grow(&buffer
, entlen
+ 100);
342 strbuf_addf(&buffer
, "%o %.*s%c", mode
, entlen
, path
+ baselen
, '\0');
343 strbuf_add(&buffer
, sha1
, 20);
346 fprintf(stderr
, "cache-tree update-one %o %.*s\n",
347 mode
, entlen
, path
+ baselen
);
352 hash_sha1_file(buffer
.buf
, buffer
.len
, tree_type
, it
->sha1
);
353 else if (write_sha1_file(buffer
.buf
, buffer
.len
, tree_type
, it
->sha1
)) {
354 strbuf_release(&buffer
);
358 strbuf_release(&buffer
);
361 fprintf(stderr
, "cache-tree update-one (%d ent, %d subtree) %s\n",
362 it
->entry_count
, it
->subtree_nr
,
363 sha1_to_hex(it
->sha1
));
368 int cache_tree_update(struct cache_tree
*it
,
369 struct cache_entry
**cache
,
374 i
= verify_cache(cache
, entries
, flags
);
377 i
= update_one(it
, cache
, entries
, "", 0, flags
);
383 static void write_one(struct strbuf
*buffer
, struct cache_tree
*it
,
384 const char *path
, int pathlen
)
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.
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
);
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
));
404 fprintf(stderr
, "cache-tree <%.*s> (%d subtree) invalid\n",
405 pathlen
, path
, it
->subtree_nr
);
408 if (0 <= it
->entry_count
) {
409 strbuf_add(buffer
, it
->sha1
, 20);
411 for (i
= 0; i
< it
->subtree_nr
; i
++) {
412 struct cache_tree_sub
*down
= it
->down
[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");
419 write_one(buffer
, down
->cache_tree
, down
->name
, down
->namelen
);
423 void cache_tree_write(struct strbuf
*sb
, struct cache_tree
*root
)
425 write_one(sb
, root
, "", 0);
428 static struct cache_tree
*read_one(const char **buffer
, unsigned long *size_p
)
430 const char *buf
= *buffer
;
431 unsigned long size
= *size_p
;
434 struct cache_tree
*it
;
438 /* skip name, but make sure name exists */
439 while (size
&& *buf
) {
449 it
->entry_count
= strtol(cp
, &ep
, 10);
453 subtree_nr
= strtol(cp
, &ep
, 10);
456 while (size
&& *buf
&& *buf
!= '\n') {
463 if (0 <= it
->entry_count
) {
466 hashcpy(it
->sha1
, (const unsigned char*)buf
);
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
));
477 fprintf(stderr
, "cache-tree <%s> (%d subtrees) invalid\n",
478 *buffer
, subtree_nr
);
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,
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
;
491 struct cache_tree_sub
*subtree
;
492 const char *name
= buf
;
494 sub
= read_one(&buf
, &size
);
497 subtree
= cache_tree_sub(it
, name
);
498 subtree
->cache_tree
= sub
;
500 if (subtree_nr
!= it
->subtree_nr
)
501 die("cache-tree: internal error");
507 cache_tree_free(&it
);
511 struct cache_tree
*cache_tree_read(const char *buffer
, unsigned long size
)
514 return NULL
; /* not the whole tree */
515 return read_one(&buffer
, &size
);
518 static struct cache_tree
*cache_tree_find(struct cache_tree
*it
, const char *path
)
524 struct cache_tree_sub
*sub
;
526 slash
= strchr(path
, '/');
528 slash
= path
+ strlen(path
);
529 /* between path and slash is the name of the
530 * subtree to look for.
532 sub
= find_subtree(it
, path
, slash
- path
, 0);
535 it
= sub
->cache_tree
;
537 while (*slash
&& *slash
== '/')
539 if (!slash
|| !*slash
)
540 return it
; /* prefix ended with slashes */
546 int write_cache_as_tree(unsigned char *sha1
, int flags
, const char *prefix
)
548 int entries
, was_valid
, newfd
;
549 struct lock_file
*lock_file
;
552 * We can't free this memory, it becomes part of a linked list
555 lock_file
= xcalloc(1, sizeof(struct lock_file
));
557 newfd
= hold_locked_index(lock_file
, 1);
559 entries
= read_cache();
561 return WRITE_TREE_UNREADABLE_INDEX
;
562 if (flags
& WRITE_TREE_IGNORE_CACHE_TREE
)
563 cache_tree_free(&(active_cache_tree
));
565 if (!active_cache_tree
)
566 active_cache_tree
= cache_tree();
568 was_valid
= cache_tree_fully_valid(active_cache_tree
);
570 if (cache_tree_update(active_cache_tree
,
571 active_cache
, active_nr
,
573 return WRITE_TREE_UNMERGED_INDEX
;
575 if (!write_cache(newfd
, active_cache
, active_nr
) &&
576 !commit_lock_file(lock_file
))
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.
588 struct cache_tree
*subtree
=
589 cache_tree_find(active_cache_tree
, prefix
);
591 return WRITE_TREE_PREFIX_ERROR
;
592 hashcpy(sha1
, subtree
->sha1
);
595 hashcpy(sha1
, active_cache_tree
->sha1
);
598 rollback_lock_file(lock_file
);
603 static void prime_cache_tree_rec(struct cache_tree
*it
, struct tree
*tree
)
605 struct tree_desc desc
;
606 struct name_entry entry
;
609 hashcpy(it
->sha1
, tree
->object
.sha1
);
610 init_tree_desc(&desc
, tree
->buffer
, tree
->size
);
612 while (tree_entry(&desc
, &entry
)) {
613 if (!S_ISDIR(entry
.mode
))
616 struct cache_tree_sub
*sub
;
617 struct tree
*subtree
= lookup_tree(entry
.sha1
);
618 if (!subtree
->object
.parsed
)
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
;
626 it
->entry_count
= cnt
;
629 void prime_cache_tree(struct cache_tree
**it
, struct tree
*tree
)
633 prime_cache_tree_rec(*it
, tree
);
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.
644 static struct cache_tree
*find_cache_tree_from_traversal(struct cache_tree
*root
,
645 struct traverse_info
*info
)
647 struct cache_tree
*our_parent
;
651 our_parent
= find_cache_tree_from_traversal(root
, info
->prev
);
652 return cache_tree_find(our_parent
, info
->name
.path
);
655 int cache_tree_matches_traversal(struct cache_tree
*root
,
656 struct name_entry
*ent
,
657 struct traverse_info
*info
)
659 struct cache_tree
*it
;
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
;
668 int update_main_cache_tree(int flags
)
670 if (!the_index
.cache_tree
)
671 the_index
.cache_tree
= cache_tree();
672 return cache_tree_update(the_index
.cache_tree
,
673 the_index
.cache
, the_index
.cache_nr
, flags
);