33 lines
921 B
33 lines
921 B
#ifndef CACHE_TREE_H |
|
#define CACHE_TREE_H |
|
|
|
struct cache_tree; |
|
struct cache_tree_sub { |
|
struct cache_tree *cache_tree; |
|
int namelen; |
|
int used; |
|
char name[FLEX_ARRAY]; |
|
}; |
|
|
|
struct cache_tree { |
|
int entry_count; /* negative means "invalid" */ |
|
unsigned char sha1[20]; |
|
int subtree_nr; |
|
int subtree_alloc; |
|
struct cache_tree_sub **down; |
|
}; |
|
|
|
struct cache_tree *cache_tree(void); |
|
void cache_tree_free(struct cache_tree **); |
|
void cache_tree_invalidate_path(struct cache_tree *, const char *); |
|
struct cache_tree_sub *cache_tree_sub(struct cache_tree *, const char *); |
|
|
|
void *cache_tree_write(struct cache_tree *root, unsigned long *size_p); |
|
struct cache_tree *cache_tree_read(const char *buffer, unsigned long size); |
|
|
|
int cache_tree_fully_valid(struct cache_tree *); |
|
int cache_tree_update(struct cache_tree *, struct cache_entry **, int, int, int); |
|
|
|
struct cache_tree *cache_tree_find(struct cache_tree *, const char *); |
|
|
|
#endif
|
|
|