8 struct cache_tree_sub {
9 struct cache_tree *cache_tree;
12 char name[FLEX_ARRAY];
16 int entry_count; /* negative means "invalid" */
17 unsigned char sha1[20];
20 struct cache_tree_sub **down;
23 struct cache_tree *cache_tree(void);
24 void cache_tree_free(struct cache_tree **);
25 void cache_tree_invalidate_path(struct cache_tree *, const char *);
26 struct cache_tree_sub *cache_tree_sub(struct cache_tree *, const char *);
28 void cache_tree_write(struct strbuf *, struct cache_tree *root);
29 struct cache_tree *cache_tree_read(const char *buffer, unsigned long size);
31 int cache_tree_fully_valid(struct cache_tree *);
32 int cache_tree_update(struct cache_tree *, struct cache_entry **, int, int);
34 int update_main_cache_tree(int);
36 /* bitmasks to write_cache_as_tree flags */
37 #define WRITE_TREE_MISSING_OK 1
38 #define WRITE_TREE_IGNORE_CACHE_TREE 2
39 #define WRITE_TREE_DRY_RUN 4
40 #define WRITE_TREE_SILENT 8
42 /* error return codes */
43 #define WRITE_TREE_UNREADABLE_INDEX (-1)
44 #define WRITE_TREE_UNMERGED_INDEX (-2)
45 #define WRITE_TREE_PREFIX_ERROR (-3)
47 int write_cache_as_tree(unsigned char *sha1, int flags, const char *prefix);
48 void prime_cache_tree(struct cache_tree **, struct tree *);
50 extern int cache_tree_matches_traversal(struct cache_tree *, struct name_entry *ent, struct traverse_info *info);