mirror of
https://git.proxmox.com/git/libgit2
synced 2025-05-06 19:37:29 +00:00
0c46863384
This updates the tree iterator internals to be more efficient. The tree_iterator_entry objects are now kept as pointers that are allocated from a git_pool, so that we may use git__tsort_r for sorting (which is better than qsort, given that the tree is likely mostly ordered already). Those tree_iterator_entry objects now keep direct pointers to the data they refer to instead of keeping indirect index values. This simplifies a lot of the data structure traversal code. This also adds bsearch to find the start item position for range- limited tree iterators, and is more explicit about using git_path_cmp instead of reimplementing it. The git_path_cmp changed a bit to make it easier for tree_iterators to use it (but it was barely being used previously, so not a big deal). This adds a git_pool_free_array function that efficiently frees a list of pool allocated pointers (which the tree_iterator keeps). Also, added new tests for the git_pool free list functionality that was not previously being tested (or used). |
||
|---|---|---|
| .. | ||
| buffer.c | ||
| copy.c | ||
| dirent.c | ||
| env.c | ||
| errors.c | ||
| filebuf.c | ||
| hex.c | ||
| mkdir.c | ||
| oid.c | ||
| opts.c | ||
| path.c | ||
| pool.c | ||
| rmdir.c | ||
| stat.c | ||
| string.c | ||
| strmap.c | ||
| strtol.c | ||
| vector.c | ||