blob: db0fbdc701f1ef63cdc1a8b7d5c5e72322f91426 [file] [log] [blame]
Junio C Hamano1b0c7172006-03-29 22:55:43 -08001#ifndef TREE_WALK_H
2#define TREE_WALK_H
3
Junio C Hamano1b0c7172006-03-29 22:55:43 -08004struct name_entry {
5 const unsigned char *sha1;
6 const char *path;
7 unsigned int mode;
Junio C Hamano1b0c7172006-03-29 22:55:43 -08008};
9
Linus Torvalds4651ece2007-03-21 10:09:56 -070010struct tree_desc {
11 const void *buffer;
12 struct name_entry entry;
13 unsigned int size;
14};
15
16static inline const unsigned char *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned int *modep)
17{
18 *pathp = desc->entry.path;
19 *modep = canon_mode(desc->entry.mode);
20 return desc->entry.sha1;
21}
22
Linus Torvalds304de2d2007-03-17 20:06:24 -070023static inline int tree_entry_len(const char *name, const unsigned char *sha1)
24{
Junio C Hamano63daae42007-06-22 23:19:43 -070025 return (const char *)sha1 - name - 1;
Linus Torvalds304de2d2007-03-17 20:06:24 -070026}
27
Junio C Hamano1b0c7172006-03-29 22:55:43 -080028void update_tree_entry(struct tree_desc *);
Linus Torvalds6fda5e52007-03-21 10:08:25 -070029void init_tree_desc(struct tree_desc *desc, const void *buf, unsigned long size);
Junio C Hamano1b0c7172006-03-29 22:55:43 -080030
Linus Torvalds4c068a92006-05-30 09:45:45 -070031/* Helper function that does both of the above and returns true for success */
32int tree_entry(struct tree_desc *, struct name_entry *);
33
Junio C Hamano1b0c7172006-03-29 22:55:43 -080034void *fill_tree_descriptor(struct tree_desc *desc, const unsigned char *sha1);
35
36typedef void (*traverse_callback_t)(int n, unsigned long mask, struct name_entry *entry, const char *base);
37
38void traverse_trees(int n, struct tree_desc *t, const char *base, traverse_callback_t callback);
39
Junio C Hamano4dcff632006-04-19 14:05:47 -070040int get_tree_entry(const unsigned char *, const char *, unsigned char *, unsigned *);
41
Junio C Hamano1b0c7172006-03-29 22:55:43 -080042#endif