| commit | 2d9c58c69d1bab601e67b036d0546e85abcee7eb | |
| author | Linus Torvalds <torvalds@osdl.org> | |
| Mon, 29 May 2006 19:18:33 +0000 (29 12:18 -0700) | ||
| committer | Junio C Hamano <junkio@cox.net> | |
| Tue, 30 May 2006 02:06:59 +0000 (29 19:06 -0700) | ||
| tree | 18151bcd75d61a73f72522fc21c85552e49bae2f | treesnapshot (tar.gz zip) |
| parent | 1ccf5a345a6e7974ec0380eed735c2db97e50b4c | commitdiff |
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>
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>