]>
Commit | Line | Data |
---|---|---|
1b0c7174 JH |
1 | #ifndef TREE_WALK_H |
2 | #define TREE_WALK_H | |
3 | ||
1b0c7174 | 4 | struct name_entry { |
7d924c91 | 5 | const struct object_id *oid; |
1b0c7174 JH |
6 | const char *path; |
7 | unsigned int mode; | |
1b0c7174 JH |
8 | }; |
9 | ||
4651ece8 LT |
10 | struct tree_desc { |
11 | const void *buffer; | |
12 | struct name_entry entry; | |
13 | unsigned int size; | |
14 | }; | |
15 | ||
ce6663a9 | 16 | static inline const struct object_id *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned int *modep) |
4651ece8 LT |
17 | { |
18 | *pathp = desc->entry.path; | |
7146e66f | 19 | *modep = desc->entry.mode; |
ce6663a9 | 20 | return desc->entry.oid; |
4651ece8 LT |
21 | } |
22 | ||
0de16337 | 23 | static inline int tree_entry_len(const struct name_entry *ne) |
304de2d2 | 24 | { |
7d924c91 | 25 | return (const char *)ne->oid - ne->path - 1; |
304de2d2 LT |
26 | } |
27 | ||
1b0c7174 | 28 | void update_tree_entry(struct tree_desc *); |
6fda5e51 | 29 | void init_tree_desc(struct tree_desc *desc, const void *buf, unsigned long size); |
1b0c7174 | 30 | |
2244eab0 EN |
31 | /* |
32 | * Helper function that does both tree_entry_extract() and update_tree_entry() | |
33 | * and returns true for success | |
34 | */ | |
4c068a98 LT |
35 | int tree_entry(struct tree_desc *, struct name_entry *); |
36 | ||
1b0c7174 JH |
37 | void *fill_tree_descriptor(struct tree_desc *desc, const unsigned char *sha1); |
38 | ||
40d934df | 39 | struct traverse_info; |
91e4f036 | 40 | typedef int (*traverse_callback_t)(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *); |
5803c6f8 | 41 | int traverse_trees(int n, struct tree_desc *t, struct traverse_info *info); |
1b0c7174 | 42 | |
275721c2 DT |
43 | enum follow_symlinks_result { |
44 | FOUND = 0, /* This includes out-of-tree links */ | |
45 | MISSING_OBJECT = -1, /* The initial symlink is missing */ | |
46 | DANGLING_SYMLINK = -2, /* | |
47 | * The initial symlink is there, but | |
48 | * (transitively) points to a missing | |
49 | * in-tree file | |
50 | */ | |
51 | SYMLINK_LOOP = -3, | |
52 | NOT_DIR = -4, /* | |
53 | * Somewhere along the symlink chain, a path is | |
54 | * requested which contains a file as a | |
55 | * non-final element. | |
56 | */ | |
57 | }; | |
58 | ||
59 | enum follow_symlinks_result get_tree_entry_follow_symlinks(unsigned char *tree_sha1, const char *name, unsigned char *result, struct strbuf *result_path, unsigned *mode); | |
60 | ||
40d934df | 61 | struct traverse_info { |
d9c2bd56 | 62 | const char *traverse_path; |
40d934df LT |
63 | struct traverse_info *prev; |
64 | struct name_entry name; | |
65 | int 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 | |
4dcff634 | 74 | int get_tree_entry(const unsigned char *, const char *, unsigned char *, unsigned *); |
40d934df LT |
75 | extern char *make_traverse_path(char *path, const struct traverse_info *info, const struct name_entry *n); |
76 | extern void setup_traverse_info(struct traverse_info *info, const char *base); | |
77 | ||
78 | static inline int traverse_path_len(const struct traverse_info *info, const struct name_entry *n) | |
79 | { | |
0de16337 | 80 | return info->pathlen + tree_entry_len(n); |
40d934df | 81 | } |
4dcff634 | 82 | |
d688cf07 NTND |
83 | /* in general, positive means "kind of interesting" */ |
84 | enum interesting { | |
85 | all_entries_not_interesting = -1, /* no, and no subsequent entries will be either */ | |
86 | entry_not_interesting = 0, | |
87 | entry_interesting = 1, | |
88 | all_entries_interesting = 2 /* yes, and all subsequent entries will be */ | |
89 | }; | |
90 | ||
91 | extern enum interesting tree_entry_interesting(const struct name_entry *, | |
92 | struct strbuf *, int, | |
93 | const struct pathspec *ps); | |
2c389fc8 | 94 | |
1b0c7174 | 95 | #endif |