| 1 | #ifndef TREE_H |
| 2 | #define TREE_H |
| 3 | |
| 4 | #include "object.h" |
| 5 | |
| 6 | struct repository; |
| 7 | struct strbuf; |
| 8 | |
| 9 | struct tree { |
| 10 | struct object object; |
| 11 | void *buffer; |
| 12 | unsigned long size; |
| 13 | }; |
| 14 | |
| 15 | extern const char *tree_type; |
| 16 | |
| 17 | struct tree *lookup_tree(struct repository *r, const struct object_id *oid); |
| 18 | |
| 19 | int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size); |
| 20 | |
| 21 | int parse_tree_gently(struct tree *tree, int quiet_on_missing); |
| 22 | static inline int parse_tree(struct tree *tree) |
| 23 | { |
| 24 | return parse_tree_gently(tree, 0); |
| 25 | } |
| 26 | void free_tree_buffer(struct tree *tree); |
| 27 | |
| 28 | /* Parses and returns the tree in the given ent, chasing tags and commits. */ |
| 29 | struct tree *parse_tree_indirect(const struct object_id *oid); |
| 30 | |
| 31 | #define READ_TREE_RECURSIVE 1 |
| 32 | typedef int (*read_tree_fn_t)(const struct object_id *, struct strbuf *, const char *, unsigned int, int, void *); |
| 33 | |
| 34 | int read_tree_recursive(struct repository *r, |
| 35 | struct tree *tree, |
| 36 | const char *base, int baselen, |
| 37 | int stage, const struct pathspec *pathspec, |
| 38 | read_tree_fn_t fn, void *context); |
| 39 | |
| 40 | int read_tree(struct repository *r, struct tree *tree, |
| 41 | int stage, struct pathspec *pathspec, |
| 42 | struct index_state *istate); |
| 43 | |
| 44 | #endif /* TREE_H */ |