cache_tree        580 builtin/checkout.c 		active_cache_tree = cache_tree();
cache_tree        614 builtin/fsck.c static int fsck_cache_tree(struct cache_tree *it)
cache_tree        636 builtin/fsck.c 		err |= fsck_cache_tree(it->down[i]->cache_tree);
cache_tree         11 cache-tree.c   struct cache_tree *cache_tree(void)
cache_tree         13 cache-tree.c   	struct cache_tree *it = xcalloc(1, sizeof(struct cache_tree));
cache_tree         18 cache-tree.c   void cache_tree_free(struct cache_tree **it_p)
cache_tree         21 cache-tree.c   	struct cache_tree *it = *it_p;
cache_tree         27 cache-tree.c   			cache_tree_free(&it->down[i]->cache_tree);
cache_tree         45 cache-tree.c   static int subtree_pos(struct cache_tree *it, const char *path, int pathlen)
cache_tree         66 cache-tree.c   static struct cache_tree_sub *find_subtree(struct cache_tree *it,
cache_tree         83 cache-tree.c   	down->cache_tree = NULL;
cache_tree         96 cache-tree.c   struct cache_tree_sub *cache_tree_sub(struct cache_tree *it, const char *path)
cache_tree        102 cache-tree.c   static int do_invalidate_path(struct cache_tree *it, const char *path)
cache_tree        128 cache-tree.c   			cache_tree_free(&it->down[pos]->cache_tree);
cache_tree        145 cache-tree.c   		do_invalidate_path(down->cache_tree, slash + 1);
cache_tree        151 cache-tree.c   	if (do_invalidate_path(istate->cache_tree, path))
cache_tree        208 cache-tree.c   static void discard_unused_subtrees(struct cache_tree *it)
cache_tree        218 cache-tree.c   			cache_tree_free(&s->cache_tree);
cache_tree        225 cache-tree.c   int cache_tree_fully_valid(struct cache_tree *it)
cache_tree        233 cache-tree.c   		if (!cache_tree_fully_valid(it->down[i]->cache_tree))
cache_tree        239 cache-tree.c   static int update_one(struct cache_tree *it,
cache_tree        296 cache-tree.c   		if (!sub->cache_tree)
cache_tree        297 cache-tree.c   			sub->cache_tree = cache_tree();
cache_tree        298 cache-tree.c   		subcnt = update_one(sub->cache_tree,
cache_tree        344 cache-tree.c   			sha1 = sub->cache_tree->sha1;
cache_tree        346 cache-tree.c   			if (sub->cache_tree->entry_count < 0) {
cache_tree        421 cache-tree.c   	struct cache_tree *it = istate->cache_tree;
cache_tree        435 cache-tree.c   static void write_one(struct strbuf *buffer, struct cache_tree *it,
cache_tree        471 cache-tree.c   		write_one(buffer, down->cache_tree, down->name, down->namelen);
cache_tree        475 cache-tree.c   void cache_tree_write(struct strbuf *sb, struct cache_tree *root)
cache_tree        480 cache-tree.c   static struct cache_tree *read_one(const char **buffer, unsigned long *size_p)
cache_tree        486 cache-tree.c   	struct cache_tree *it;
cache_tree        498 cache-tree.c   	it = cache_tree();
cache_tree        542 cache-tree.c   		struct cache_tree *sub;
cache_tree        550 cache-tree.c   		subtree->cache_tree = sub;
cache_tree        563 cache-tree.c   struct cache_tree *cache_tree_read(const char *buffer, unsigned long size)
cache_tree        570 cache-tree.c   static struct cache_tree *cache_tree_find(struct cache_tree *it, const char *path)
cache_tree        586 cache-tree.c   		it = sub->cache_tree;
cache_tree        612 cache-tree.c   		cache_tree_free(&index_state->cache_tree);
cache_tree        614 cache-tree.c   	if (!index_state->cache_tree)
cache_tree        615 cache-tree.c   		index_state->cache_tree = cache_tree();
cache_tree        617 cache-tree.c   	was_valid = cache_tree_fully_valid(index_state->cache_tree);
cache_tree        634 cache-tree.c   		struct cache_tree *subtree;
cache_tree        635 cache-tree.c   		subtree = cache_tree_find(index_state->cache_tree, prefix);
cache_tree        641 cache-tree.c   		hashcpy(sha1, index_state->cache_tree->sha1);
cache_tree        654 cache-tree.c   static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree)
cache_tree        672 cache-tree.c   			sub->cache_tree = cache_tree();
cache_tree        673 cache-tree.c   			prime_cache_tree_rec(sub->cache_tree, subtree);
cache_tree        674 cache-tree.c   			cnt += sub->cache_tree->entry_count;
cache_tree        682 cache-tree.c   	cache_tree_free(&istate->cache_tree);
cache_tree        683 cache-tree.c   	istate->cache_tree = cache_tree();
cache_tree        684 cache-tree.c   	prime_cache_tree_rec(istate->cache_tree, tree);
cache_tree        696 cache-tree.c   static struct cache_tree *find_cache_tree_from_traversal(struct cache_tree *root,
cache_tree        699 cache-tree.c   	struct cache_tree *our_parent;
cache_tree        707 cache-tree.c   int cache_tree_matches_traversal(struct cache_tree *root,
cache_tree        711 cache-tree.c   	struct cache_tree *it;
cache_tree        722 cache-tree.c   	if (!the_index.cache_tree)
cache_tree        723 cache-tree.c   		the_index.cache_tree = cache_tree();
cache_tree          7 cache-tree.h   struct cache_tree;
cache_tree          9 cache-tree.h   	struct cache_tree *cache_tree;
cache_tree         24 cache-tree.h   struct cache_tree *cache_tree(void);
cache_tree         25 cache-tree.h   void cache_tree_free(struct cache_tree **);
cache_tree         27 cache-tree.h   struct cache_tree_sub *cache_tree_sub(struct cache_tree *, const char *);
cache_tree         29 cache-tree.h   void cache_tree_write(struct strbuf *, struct cache_tree *root);
cache_tree         30 cache-tree.h   struct cache_tree *cache_tree_read(const char *buffer, unsigned long size);
cache_tree         32 cache-tree.h   int cache_tree_fully_valid(struct cache_tree *);
cache_tree         53 cache-tree.h   extern int cache_tree_matches_traversal(struct cache_tree *, struct name_entry *ent, struct traverse_info *info);
cache_tree        310 cache.h        	struct cache_tree *cache_tree;
cache_tree        334 cache.h        #define active_cache_tree (the_index.cache_tree)
cache_tree        266 merge-recursive.c 		active_cache_tree = cache_tree();
cache_tree       1373 read-cache.c   		istate->cache_tree = cache_tree_read(data, sz);
cache_tree       1674 read-cache.c   	cache_tree_free(&(istate->cache_tree));
cache_tree       2047 read-cache.c   	if (!strip_extensions && istate->cache_tree) {
cache_tree       2050 read-cache.c   		cache_tree_write(&sb, istate->cache_tree);
cache_tree       1319 revision.c     static void add_cache_tree(struct cache_tree *it, struct rev_info *revs,
cache_tree       1334 revision.c     		add_cache_tree(sub->cache_tree, revs, path);
cache_tree        343 sequencer.c    		active_cache_tree = cache_tree();
cache_tree          6 test-dump-cache-tree.c static void dump_one(struct cache_tree *it, const char *pfx, const char *x)
cache_tree         17 test-dump-cache-tree.c static int dump_cache_tree(struct cache_tree *it,
cache_tree         18 test-dump-cache-tree.c 			   struct cache_tree *ref,
cache_tree         51 test-dump-cache-tree.c 		if (dump_cache_tree(down->cache_tree, rdwn->cache_tree, path))
cache_tree         60 test-dump-cache-tree.c 	struct cache_tree *another = cache_tree();
cache_tree         64 test-dump-cache-tree.c 	istate.cache_tree = another;
cache_tree        806 unpack-trees.c 			matches = cache_tree_matches_traversal(o->src_index->cache_tree,
cache_tree       1166 unpack-trees.c 			if (!o->result.cache_tree)
cache_tree       1167 unpack-trees.c 				o->result.cache_tree = cache_tree();
cache_tree       1168 unpack-trees.c 			if (!cache_tree_fully_valid(o->result.cache_tree))