1#ifndef CACHE_TREE_H
2#define CACHE_TREE_H
3
4struct cache_tree;
5struct cache_tree_sub {
6 struct cache_tree *cache_tree;
7 int namelen;
8 int used;
9 char name[FLEX_ARRAY];
10};
11
12struct cache_tree {
13 int entry_count; /* negative means "invalid" */
14 unsigned char sha1[20];
15 int subtree_nr;
16 int subtree_alloc;
17 struct cache_tree_sub **down;
18};
19
20struct cache_tree *cache_tree(void);
21void cache_tree_free(struct cache_tree **);
22void cache_tree_invalidate_path(struct cache_tree *, const char *);
23struct cache_tree_sub *cache_tree_sub(struct cache_tree *, const char *);
24
25void cache_tree_write(struct strbuf *, struct cache_tree *root);
26struct cache_tree *cache_tree_read(const char *buffer, unsigned long size);
27
28int cache_tree_fully_valid(struct cache_tree *);
29int cache_tree_update(struct cache_tree *, struct cache_entry **, int, int, int);
30
31struct cache_tree *cache_tree_find(struct cache_tree *, const char *);
32
33#endif