]>
Commit | Line | Data |
---|---|---|
1 | #ifndef TREE_WALK_H | |
2 | #define TREE_WALK_H | |
3 | ||
4 | struct name_entry { | |
5 | const unsigned char *sha1; | |
6 | const char *path; | |
7 | unsigned int mode; | |
8 | }; | |
9 | ||
10 | struct tree_desc { | |
11 | const void *buffer; | |
12 | struct name_entry entry; | |
13 | unsigned int size; | |
14 | }; | |
15 | ||
16 | static inline const unsigned char *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned int *modep) | |
17 | { | |
18 | *pathp = desc->entry.path; | |
19 | *modep = canon_mode(desc->entry.mode); | |
20 | return desc->entry.sha1; | |
21 | } | |
22 | ||
23 | static inline int tree_entry_len(const char *name, const unsigned char *sha1) | |
24 | { | |
25 | return (const char *)sha1 - name - 1; | |
26 | } | |
27 | ||
28 | void update_tree_entry(struct tree_desc *); | |
29 | void init_tree_desc(struct tree_desc *desc, const void *buf, unsigned long size); | |
30 | ||
31 | /* Helper function that does both of the above and returns true for success */ | |
32 | int tree_entry(struct tree_desc *, struct name_entry *); | |
33 | ||
34 | void *fill_tree_descriptor(struct tree_desc *desc, const unsigned char *sha1); | |
35 | ||
36 | struct traverse_info; | |
37 | typedef int (*traverse_callback_t)(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *); | |
38 | int traverse_trees(int n, struct tree_desc *t, struct traverse_info *info); | |
39 | ||
40 | struct traverse_info { | |
41 | struct traverse_info *prev; | |
42 | struct name_entry name; | |
43 | int pathlen; | |
44 | ||
45 | unsigned long conflicts; | |
46 | traverse_callback_t fn; | |
47 | void *data; | |
48 | }; | |
49 | ||
50 | int get_tree_entry(const unsigned char *, const char *, unsigned char *, unsigned *); | |
51 | extern char *make_traverse_path(char *path, const struct traverse_info *info, const struct name_entry *n); | |
52 | extern void setup_traverse_info(struct traverse_info *info, const char *base); | |
53 | ||
54 | static inline int traverse_path_len(const struct traverse_info *info, const struct name_entry *n) | |
55 | { | |
56 | return info->pathlen + tree_entry_len(n->path, n->sha1); | |
57 | } | |
58 | ||
59 | #endif |