5 const unsigned char *sha1;
12 struct name_entry entry;
16 static inline const unsigned char *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned int *modep)
18 *pathp = desc->entry.path;
19 *modep = canon_mode(desc->entry.mode);
20 return desc->entry.sha1;
23 static inline int tree_entry_len(const char *name, const unsigned char *sha1)
25 return (const char *)sha1 - name - 1;
28 void update_tree_entry(struct tree_desc *);
29 void init_tree_desc(struct tree_desc *desc, const void *buf, unsigned long size);
32 * Helper function that does both tree_entry_extract() and update_tree_entry()
33 * and returns true for success
35 int tree_entry(struct tree_desc *, struct name_entry *);
37 void *fill_tree_descriptor(struct tree_desc *desc, const unsigned char *sha1);
40 typedef int (*traverse_callback_t)(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *);
41 int traverse_trees(int n, struct tree_desc *t, struct traverse_info *info);
43 struct traverse_info {
44 struct traverse_info *prev;
45 struct name_entry name;
48 unsigned long conflicts;
49 traverse_callback_t fn;
54 int get_tree_entry(const unsigned char *, const char *, unsigned char *, unsigned *);
55 extern char *make_traverse_path(char *path, const struct traverse_info *info, const struct name_entry *n);
56 extern void setup_traverse_info(struct traverse_info *info, const char *base);
58 static inline int traverse_path_len(const struct traverse_info *info, const struct name_entry *n)
60 return info->pathlen + tree_entry_len(n->path, n->sha1);