Daniel Barkalow | 6eb8ae0 | 2005-04-18 11:39:48 -0700 | [diff] [blame] | 1 | #ifndef TREE_H |
| 2 | #define TREE_H |
| 3 | |
| 4 | #include "object.h" |
| 5 | |
| 6 | extern const char *tree_type; |
| 7 | |
Daniel Barkalow | 0869216 | 2005-04-23 18:47:23 -0700 | [diff] [blame] | 8 | struct tree_entry_list { |
| 9 | struct tree_entry_list *next; |
| 10 | unsigned directory : 1; |
| 11 | unsigned executable : 1; |
Linus Torvalds | 42ea9cb | 2005-05-05 16:18:48 -0700 | [diff] [blame] | 12 | unsigned symlink : 1; |
Linus Torvalds | 6407180 | 2005-07-27 16:08:43 -0700 | [diff] [blame] | 13 | unsigned zeropad : 1; |
Linus Torvalds | 42ea9cb | 2005-05-05 16:18:48 -0700 | [diff] [blame] | 14 | unsigned int mode; |
Daniel Barkalow | 0869216 | 2005-04-23 18:47:23 -0700 | [diff] [blame] | 15 | char *name; |
| 16 | union { |
barkalow@iabervon.org | 66e481b | 2005-08-02 19:45:48 -0400 | [diff] [blame] | 17 | struct object *any; |
Daniel Barkalow | 0869216 | 2005-04-23 18:47:23 -0700 | [diff] [blame] | 18 | struct tree *tree; |
| 19 | struct blob *blob; |
| 20 | } item; |
| 21 | }; |
| 22 | |
Daniel Barkalow | 6eb8ae0 | 2005-04-18 11:39:48 -0700 | [diff] [blame] | 23 | struct tree { |
| 24 | struct object object; |
Daniel Barkalow | 0869216 | 2005-04-23 18:47:23 -0700 | [diff] [blame] | 25 | struct tree_entry_list *entries; |
Daniel Barkalow | 6eb8ae0 | 2005-04-18 11:39:48 -0700 | [diff] [blame] | 26 | }; |
| 27 | |
Jason McMullan | 5d6ccf5 | 2005-06-03 11:05:39 -0400 | [diff] [blame] | 28 | struct tree *lookup_tree(const unsigned char *sha1); |
Daniel Barkalow | 6eb8ae0 | 2005-04-18 11:39:48 -0700 | [diff] [blame] | 29 | |
Nicolas Pitre | bd2c39f | 2005-05-06 13:48:34 -0400 | [diff] [blame] | 30 | int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size); |
| 31 | |
Daniel Barkalow | 6eb8ae0 | 2005-04-18 11:39:48 -0700 | [diff] [blame] | 32 | int parse_tree(struct tree *tree); |
| 33 | |
Daniel Barkalow | 77675e2 | 2005-09-05 02:03:51 -0400 | [diff] [blame] | 34 | /* Parses and returns the tree in the given ent, chasing tags and commits. */ |
| 35 | struct tree *parse_tree_indirect(const unsigned char *sha1); |
| 36 | |
Linus Torvalds | 3c5e846 | 2005-11-26 09:38:20 -0800 | [diff] [blame] | 37 | #define READ_TREE_RECURSIVE 1 |
| 38 | typedef int (*read_tree_fn_t)(unsigned char *, const char *, int, const char *, unsigned int, int); |
| 39 | |
Daniel Barkalow | 521698b | 2006-01-26 01:13:36 -0500 | [diff] [blame] | 40 | extern int read_tree_recursive(struct tree *tree, |
| 41 | const char *base, int baselen, |
| 42 | int stage, const char **match, |
| 43 | read_tree_fn_t fn); |
Linus Torvalds | 3c5e846 | 2005-11-26 09:38:20 -0800 | [diff] [blame] | 44 | |
Daniel Barkalow | 521698b | 2006-01-26 01:13:36 -0500 | [diff] [blame] | 45 | extern int read_tree(struct tree *tree, int stage, const char **paths); |
Linus Torvalds | 3c5e846 | 2005-11-26 09:38:20 -0800 | [diff] [blame] | 46 | |
Daniel Barkalow | 6eb8ae0 | 2005-04-18 11:39:48 -0700 | [diff] [blame] | 47 | #endif /* TREE_H */ |