RelNotes 1.5.3 updates before -rc4
[git/haiku.git] / tree-walk.h
blobdb0fbdc701f1ef63cdc1a8b7d5c5e72322f91426
1 #ifndef TREE_WALK_H
2 #define TREE_WALK_H
4 struct name_entry {
5 const unsigned char *sha1;
6 const char *path;
7 unsigned int mode;
8 };
10 struct tree_desc {
11 const void *buffer;
12 struct name_entry entry;
13 unsigned int size;
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);
31 /* Helper function that does both of the above and returns true for success */
32 int tree_entry(struct tree_desc *, struct name_entry *);
34 void *fill_tree_descriptor(struct tree_desc *desc, const unsigned char *sha1);
36 typedef void (*traverse_callback_t)(int n, unsigned long mask, struct name_entry *entry, const char *base);
38 void traverse_trees(int n, struct tree_desc *t, const char *base, traverse_callback_t callback);
40 int get_tree_entry(const unsigned char *, const char *, unsigned char *, unsigned *);
42 #endif