]>
Commit | Line | Data |
---|---|---|
1b0c7174 JH |
1 | #ifndef TREE_WALK_H |
2 | #define TREE_WALK_H | |
3 | ||
ea82b2a0 | 4 | #include "cache.h" |
ef3ca954 | 5 | |
1b0c7174 | 6 | struct name_entry { |
ea82b2a0 | 7 | struct object_id oid; |
1b0c7174 | 8 | const char *path; |
ea82b2a0 | 9 | int pathlen; |
1b0c7174 | 10 | unsigned int mode; |
1b0c7174 JH |
11 | }; |
12 | ||
4651ece8 LT |
13 | struct tree_desc { |
14 | const void *buffer; | |
15 | struct name_entry entry; | |
16 | unsigned int size; | |
17 | }; | |
18 | ||
5ec1e728 | 19 | static inline const struct object_id *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned short *modep) |
4651ece8 LT |
20 | { |
21 | *pathp = desc->entry.path; | |
7146e66f | 22 | *modep = desc->entry.mode; |
ea82b2a0 | 23 | return &desc->entry.oid; |
4651ece8 LT |
24 | } |
25 | ||
0de16337 | 26 | static inline int tree_entry_len(const struct name_entry *ne) |
304de2d2 | 27 | { |
ea82b2a0 | 28 | return ne->pathlen; |
304de2d2 LT |
29 | } |
30 | ||
8354fa3d DT |
31 | /* |
32 | * The _gently versions of these functions warn and return false on a | |
33 | * corrupt tree entry rather than dying, | |
34 | */ | |
35 | ||
1b0c7174 | 36 | void update_tree_entry(struct tree_desc *); |
8354fa3d | 37 | int update_tree_entry_gently(struct tree_desc *); |
6fda5e51 | 38 | void init_tree_desc(struct tree_desc *desc, const void *buf, unsigned long size); |
8354fa3d | 39 | int init_tree_desc_gently(struct tree_desc *desc, const void *buf, unsigned long size); |
1b0c7174 | 40 | |
2244eab0 EN |
41 | /* |
42 | * Helper function that does both tree_entry_extract() and update_tree_entry() | |
43 | * and returns true for success | |
44 | */ | |
4c068a98 | 45 | int tree_entry(struct tree_desc *, struct name_entry *); |
8354fa3d | 46 | int tree_entry_gently(struct tree_desc *, struct name_entry *); |
4c068a98 | 47 | |
5e575807 NTND |
48 | void *fill_tree_descriptor(struct repository *r, |
49 | struct tree_desc *desc, | |
50 | const struct object_id *oid); | |
1b0c7174 | 51 | |
40d934df | 52 | struct traverse_info; |
91e4f036 | 53 | typedef int (*traverse_callback_t)(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *); |
67022e02 | 54 | int traverse_trees(struct index_state *istate, int n, struct tree_desc *t, struct traverse_info *info); |
1b0c7174 | 55 | |
0dd1f0c3 | 56 | 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 | 57 | |
40d934df | 58 | struct traverse_info { |
d9c2bd56 | 59 | const char *traverse_path; |
40d934df | 60 | struct traverse_info *prev; |
90553847 JK |
61 | const char *name; |
62 | size_t namelen; | |
63 | unsigned mode; | |
64 | ||
37806080 | 65 | size_t pathlen; |
2842c0f9 | 66 | struct pathspec *pathspec; |
40d934df | 67 | |
603d2498 | 68 | unsigned long df_conflicts; |
40d934df LT |
69 | traverse_callback_t fn; |
70 | void *data; | |
e6c111b4 | 71 | int show_all_errors; |
40d934df | 72 | }; |
1b0c7174 | 73 | |
50ddb089 | 74 | int get_tree_entry(struct repository *, const struct object_id *, const char *, struct object_id *, unsigned short *); |
5aa02f98 | 75 | char *make_traverse_path(char *path, size_t pathlen, const struct traverse_info *info, |
90553847 | 76 | const char *name, size_t namelen); |
c43ab062 JK |
77 | void strbuf_make_traverse_path(struct strbuf *out, |
78 | const struct traverse_info *info, | |
79 | const char *name, size_t namelen); | |
55454427 | 80 | void setup_traverse_info(struct traverse_info *info, const char *base); |
40d934df | 81 | |
b3b3cbcb JK |
82 | static inline size_t traverse_path_len(const struct traverse_info *info, |
83 | size_t namelen) | |
40d934df | 84 | { |
b3b3cbcb | 85 | return st_add(info->pathlen, namelen); |
40d934df | 86 | } |
4dcff634 | 87 | |
d688cf07 NTND |
88 | /* in general, positive means "kind of interesting" */ |
89 | enum interesting { | |
90 | all_entries_not_interesting = -1, /* no, and no subsequent entries will be either */ | |
91 | entry_not_interesting = 0, | |
92 | entry_interesting = 1, | |
93 | all_entries_interesting = 2 /* yes, and all subsequent entries will be */ | |
94 | }; | |
95 | ||
67022e02 NTND |
96 | enum interesting tree_entry_interesting(struct index_state *istate, |
97 | const struct name_entry *, | |
98 | struct strbuf *, int, | |
99 | const struct pathspec *ps); | |
2c389fc8 | 100 | |
1b0c7174 | 101 | #endif |