]>
Commit | Line | Data |
---|---|---|
1b0c7174 JH |
1 | #ifndef TREE_WALK_H |
2 | #define TREE_WALK_H | |
3 | ||
ea82b2a0 | 4 | #include "cache.h" |
ef3ca954 | 5 | |
bbcfa300 HW |
6 | /** |
7 | * The tree walking API is used to traverse and inspect trees. | |
8 | */ | |
9 | ||
10 | /** | |
11 | * An entry in a tree. Each entry has a sha1 identifier, pathname, and mode. | |
12 | */ | |
1b0c7174 | 13 | struct name_entry { |
ea82b2a0 | 14 | struct object_id oid; |
1b0c7174 | 15 | const char *path; |
ea82b2a0 | 16 | int pathlen; |
1b0c7174 | 17 | unsigned int mode; |
1b0c7174 JH |
18 | }; |
19 | ||
bbcfa300 HW |
20 | /** |
21 | * A semi-opaque data structure used to maintain the current state of the walk. | |
22 | */ | |
4651ece8 | 23 | struct tree_desc { |
bbcfa300 HW |
24 | /* |
25 | * pointer into the memory representation of the tree. It always | |
26 | * points at the current entry being visited. | |
27 | */ | |
4651ece8 | 28 | const void *buffer; |
bbcfa300 HW |
29 | |
30 | /* points to the current entry being visited. */ | |
4651ece8 | 31 | struct name_entry entry; |
bbcfa300 HW |
32 | |
33 | /* counts the number of bytes left in the `buffer`. */ | |
4651ece8 LT |
34 | unsigned int size; |
35 | }; | |
36 | ||
bbcfa300 HW |
37 | /** |
38 | * Decode the entry currently being visited (the one pointed to by | |
39 | * `tree_desc's` `entry` member) and return the sha1 of the entry. The | |
40 | * `pathp` and `modep` arguments are set to the entry's pathname and mode | |
41 | * respectively. | |
42 | */ | |
5ec1e728 | 43 | static inline const struct object_id *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned short *modep) |
4651ece8 LT |
44 | { |
45 | *pathp = desc->entry.path; | |
7146e66f | 46 | *modep = desc->entry.mode; |
ea82b2a0 | 47 | return &desc->entry.oid; |
4651ece8 LT |
48 | } |
49 | ||
bbcfa300 HW |
50 | /** |
51 | * Calculate the length of a tree entry's pathname. This utilizes the | |
52 | * memory structure of a tree entry to avoid the overhead of using a | |
53 | * generic strlen(). | |
54 | */ | |
0de16337 | 55 | static inline int tree_entry_len(const struct name_entry *ne) |
304de2d2 | 56 | { |
ea82b2a0 | 57 | return ne->pathlen; |
304de2d2 LT |
58 | } |
59 | ||
8354fa3d DT |
60 | /* |
61 | * The _gently versions of these functions warn and return false on a | |
62 | * corrupt tree entry rather than dying, | |
63 | */ | |
64 | ||
bbcfa300 HW |
65 | /** |
66 | * Walk to the next entry in a tree. This is commonly used in conjunction | |
67 | * with `tree_entry_extract` to inspect the current entry. | |
68 | */ | |
1b0c7174 | 69 | void update_tree_entry(struct tree_desc *); |
bbcfa300 | 70 | |
8354fa3d | 71 | int update_tree_entry_gently(struct tree_desc *); |
bbcfa300 HW |
72 | |
73 | /** | |
74 | * Initialize a `tree_desc` and decode its first entry. The buffer and | |
75 | * size parameters are assumed to be the same as the buffer and size | |
76 | * members of `struct tree`. | |
77 | */ | |
6fda5e51 | 78 | void init_tree_desc(struct tree_desc *desc, const void *buf, unsigned long size); |
bbcfa300 | 79 | |
8354fa3d | 80 | int init_tree_desc_gently(struct tree_desc *desc, const void *buf, unsigned long size); |
1b0c7174 | 81 | |
2244eab0 | 82 | /* |
bbcfa300 HW |
83 | * Visit the next entry in a tree. Returns 1 when there are more entries |
84 | * left to visit and 0 when all entries have been visited. This is | |
85 | * commonly used in the test of a while loop. | |
2244eab0 | 86 | */ |
4c068a98 | 87 | int tree_entry(struct tree_desc *, struct name_entry *); |
bbcfa300 | 88 | |
8354fa3d | 89 | int tree_entry_gently(struct tree_desc *, struct name_entry *); |
4c068a98 | 90 | |
bbcfa300 HW |
91 | /** |
92 | * Initialize a `tree_desc` and decode its first entry given the | |
93 | * object ID of a tree. Returns the `buffer` member if the latter | |
94 | * is a valid tree identifier and NULL otherwise. | |
95 | */ | |
5e575807 NTND |
96 | void *fill_tree_descriptor(struct repository *r, |
97 | struct tree_desc *desc, | |
98 | const struct object_id *oid); | |
1b0c7174 | 99 | |
40d934df | 100 | struct traverse_info; |
91e4f036 | 101 | typedef int (*traverse_callback_t)(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *); |
bbcfa300 HW |
102 | |
103 | /** | |
104 | * Traverse `n` number of trees in parallel. The `fn` callback member of | |
105 | * `traverse_info` is called once for each tree entry. | |
106 | */ | |
67022e02 | 107 | int traverse_trees(struct index_state *istate, int n, struct tree_desc *t, struct traverse_info *info); |
1b0c7174 | 108 | |
0dd1f0c3 | 109 | enum get_oid_result get_tree_entry_follow_symlinks(struct repository *r, struct object_id *tree_oid, const char *name, struct object_id *result, struct strbuf *result_path, unsigned short *mode); |
275721c2 | 110 | |
bbcfa300 HW |
111 | /** |
112 | * A structure used to maintain the state of a traversal. | |
113 | */ | |
40d934df | 114 | struct traverse_info { |
d9c2bd56 | 115 | const char *traverse_path; |
bbcfa300 HW |
116 | |
117 | /* | |
118 | * points to the traverse_info which was used to descend into the | |
119 | * current tree. If this is the top-level tree `prev` will point to | |
120 | * a dummy traverse_info. | |
121 | */ | |
40d934df | 122 | struct traverse_info *prev; |
bbcfa300 HW |
123 | |
124 | /* is the entry for the current tree (if the tree is a subtree). */ | |
90553847 | 125 | const char *name; |
bbcfa300 | 126 | |
90553847 JK |
127 | size_t namelen; |
128 | unsigned mode; | |
129 | ||
bbcfa300 | 130 | /* is the length of the full path for the current tree. */ |
37806080 | 131 | size_t pathlen; |
bbcfa300 | 132 | |
2842c0f9 | 133 | struct pathspec *pathspec; |
40d934df | 134 | |
bbcfa300 | 135 | /* can be used by callbacks to maintain directory-file conflicts. */ |
603d2498 | 136 | unsigned long df_conflicts; |
bbcfa300 HW |
137 | |
138 | /* a callback called for each entry in the tree. | |
139 | * | |
140 | * The arguments passed to the traverse callback are as follows: | |
141 | * | |
142 | * - `n` counts the number of trees being traversed. | |
143 | * | |
144 | * - `mask` has its nth bit set if something exists in the nth entry. | |
145 | * | |
146 | * - `dirmask` has its nth bit set if the nth tree's entry is a directory. | |
147 | * | |
148 | * - `entry` is an array of size `n` where the nth entry is from the nth tree. | |
149 | * | |
150 | * - `info` maintains the state of the traversal. | |
151 | * | |
152 | * Returning a negative value will terminate the traversal. Otherwise the | |
153 | * return value is treated as an update mask. If the nth bit is set the nth tree | |
154 | * will be updated and if the bit is not set the nth tree entry will be the | |
155 | * same in the next callback invocation. | |
156 | */ | |
40d934df | 157 | traverse_callback_t fn; |
bbcfa300 HW |
158 | |
159 | /* can be anything the `fn` callback would want to use. */ | |
40d934df | 160 | void *data; |
bbcfa300 HW |
161 | |
162 | /* tells whether to stop at the first error or not. */ | |
e6c111b4 | 163 | int show_all_errors; |
40d934df | 164 | }; |
1b0c7174 | 165 | |
bbcfa300 HW |
166 | /** |
167 | * Find an entry in a tree given a pathname and the sha1 of a tree to | |
168 | * search. Returns 0 if the entry is found and -1 otherwise. The third | |
169 | * and fourth parameters are set to the entry's sha1 and mode respectively. | |
170 | */ | |
50ddb089 | 171 | int get_tree_entry(struct repository *, const struct object_id *, const char *, struct object_id *, unsigned short *); |
bbcfa300 HW |
172 | |
173 | /** | |
174 | * Generate the full pathname of a tree entry based from the root of the | |
175 | * traversal. For example, if the traversal has recursed into another | |
176 | * tree named "bar" the pathname of an entry "baz" in the "bar" | |
177 | * tree would be "bar/baz". | |
178 | */ | |
5aa02f98 | 179 | char *make_traverse_path(char *path, size_t pathlen, const struct traverse_info *info, |
90553847 | 180 | const char *name, size_t namelen); |
bbcfa300 HW |
181 | |
182 | /** | |
183 | * Convenience wrapper to `make_traverse_path` into a strbuf. | |
184 | */ | |
c43ab062 JK |
185 | void strbuf_make_traverse_path(struct strbuf *out, |
186 | const struct traverse_info *info, | |
187 | const char *name, size_t namelen); | |
bbcfa300 HW |
188 | |
189 | /** | |
190 | * Initialize a `traverse_info` given the pathname of the tree to start | |
191 | * traversing from. | |
192 | */ | |
55454427 | 193 | void setup_traverse_info(struct traverse_info *info, const char *base); |
40d934df | 194 | |
bbcfa300 HW |
195 | /** |
196 | * Calculate the length of a pathname returned by `make_traverse_path`. | |
197 | * This utilizes the memory structure of a tree entry to avoid the | |
198 | * overhead of using a generic strlen(). | |
199 | */ | |
b3b3cbcb JK |
200 | static inline size_t traverse_path_len(const struct traverse_info *info, |
201 | size_t namelen) | |
40d934df | 202 | { |
b3b3cbcb | 203 | return st_add(info->pathlen, namelen); |
40d934df | 204 | } |
4dcff634 | 205 | |
d688cf07 NTND |
206 | /* in general, positive means "kind of interesting" */ |
207 | enum interesting { | |
208 | all_entries_not_interesting = -1, /* no, and no subsequent entries will be either */ | |
209 | entry_not_interesting = 0, | |
210 | entry_interesting = 1, | |
211 | all_entries_interesting = 2 /* yes, and all subsequent entries will be */ | |
212 | }; | |
213 | ||
67022e02 NTND |
214 | enum interesting tree_entry_interesting(struct index_state *istate, |
215 | const struct name_entry *, | |
216 | struct strbuf *, int, | |
217 | const struct pathspec *ps); | |
2c389fc8 | 218 | |
1b0c7174 | 219 | #endif |