diff options
author | Linus Torvalds <torvalds@osdl.org> | 2006-05-29 12:18:33 -0700 |
---|---|---|
committer | Junio C Hamano <junkio@cox.net> | 2006-05-29 19:06:59 -0700 |
commit | 2d9c58c69d1bab601e67b036d0546e85abcee7eb (patch) | |
tree | 18151bcd75d61a73f72522fc21c85552e49bae2f /tree.h | |
parent | 1ccf5a345a6e7974ec0380eed735c2db97e50b4c (diff) | |
download | git-2d9c58c69d1bab601e67b036d0546e85abcee7eb.tar.gz |
Remove "tree->entries" tree-entry list from tree parser
Instead, just use the tree buffer directly, and use the tree-walk
infrastructure to walk the buffers instead of the tree-entry list.
The tree-entry list is inefficient, and generates tons of small
allocations for no good reason. The tree-walk infrastructure is
generally no harder to use than following a linked list, and allows
us to do most tree parsing in-place.
Some programs still use the old tree-entry lists, and are a bit
painful to convert without major surgery. For them we have a helper
function that creates a temporary tree-entry list on demand.
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Signed-off-by: Junio C Hamano <junkio@cox.net>
Diffstat (limited to 'tree.h')
-rw-r--r-- | tree.h | 4 |
1 files changed, 3 insertions, 1 deletions
@@ -20,9 +20,11 @@ struct tree { struct object object; void *buffer; unsigned long size; - struct tree_entry_list *entries; }; +struct tree_entry_list *create_tree_entry_list(struct tree *); +void free_tree_entry_list(struct tree_entry_list *); + struct tree *lookup_tree(const unsigned char *sha1); int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size); |