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 /builtin-ls-tree.c | |
| parent | 1ccf5a345a6e7974ec0380eed735c2db97e50b4c (diff) | |
| download | git-2d9c58c69d1bab601e67b036d0546e85abcee7eb.tar.gz git-2d9c58c69d1bab601e67b036d0546e85abcee7eb.tar.xz | |
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 'builtin-ls-tree.c')
| -rw-r--r-- | builtin-ls-tree.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/builtin-ls-tree.c b/builtin-ls-tree.c index 48385d59f..b8d0d88ba 100644 --- a/builtin-ls-tree.c +++ b/builtin-ls-tree.c @@ -53,7 +53,7 @@ static int show_recursive(const char *base, int baselen, const char *pathname) } } -static int show_tree(unsigned char *sha1, const char *base, int baselen, +static int show_tree(const unsigned char *sha1, const char *base, int baselen, const char *pathname, unsigned mode, int stage) { int retval = 0; |