tree-walk: drop oid from traverse_info
[git/git.git] / tree-walk.h
... / ...
CommitLineData
1#ifndef TREE_WALK_H
2#define TREE_WALK_H
3
4#include "cache.h"
5
6struct name_entry {
7 struct object_id oid;
8 const char *path;
9 int pathlen;
10 unsigned int mode;
11};
12
13struct tree_desc {
14 const void *buffer;
15 struct name_entry entry;
16 unsigned int size;
17};
18
19static inline const struct object_id *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned short *modep)
20{
21 *pathp = desc->entry.path;
22 *modep = desc->entry.mode;
23 return &desc->entry.oid;
24}
25
26static inline int tree_entry_len(const struct name_entry *ne)
27{
28 return ne->pathlen;
29}
30
31/*
32 * The _gently versions of these functions warn and return false on a
33 * corrupt tree entry rather than dying,
34 */
35
36void update_tree_entry(struct tree_desc *);
37int update_tree_entry_gently(struct tree_desc *);
38void init_tree_desc(struct tree_desc *desc, const void *buf, unsigned long size);
39int init_tree_desc_gently(struct tree_desc *desc, const void *buf, unsigned long size);
40
41/*
42 * Helper function that does both tree_entry_extract() and update_tree_entry()
43 * and returns true for success
44 */
45int tree_entry(struct tree_desc *, struct name_entry *);
46int tree_entry_gently(struct tree_desc *, struct name_entry *);
47
48void *fill_tree_descriptor(struct tree_desc *desc, const struct object_id *oid);
49
50struct traverse_info;
51typedef int (*traverse_callback_t)(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *);
52int traverse_trees(struct index_state *istate, int n, struct tree_desc *t, struct traverse_info *info);
53
54enum get_oid_result get_tree_entry_follow_symlinks(struct object_id *tree_oid, const char *name, struct object_id *result, struct strbuf *result_path, unsigned short *mode);
55
56struct traverse_info {
57 const char *traverse_path;
58 struct traverse_info *prev;
59 const char *name;
60 size_t namelen;
61 unsigned mode;
62
63 int pathlen;
64 struct pathspec *pathspec;
65
66 unsigned long df_conflicts;
67 traverse_callback_t fn;
68 void *data;
69 int show_all_errors;
70};
71
72int get_tree_entry(const struct object_id *, const char *, struct object_id *, unsigned short *);
73char *make_traverse_path(char *path, const struct traverse_info *info,
74 const char *name, size_t namelen);
75void setup_traverse_info(struct traverse_info *info, const char *base);
76
77static inline int traverse_path_len(const struct traverse_info *info, const struct name_entry *n)
78{
79 return info->pathlen + tree_entry_len(n);
80}
81
82/* in general, positive means "kind of interesting" */
83enum interesting {
84 all_entries_not_interesting = -1, /* no, and no subsequent entries will be either */
85 entry_not_interesting = 0,
86 entry_interesting = 1,
87 all_entries_interesting = 2 /* yes, and all subsequent entries will be */
88};
89
90enum interesting tree_entry_interesting(struct index_state *istate,
91 const struct name_entry *,
92 struct strbuf *, int,
93 const struct pathspec *ps);
94
95#endif