summaryrefslogtreecommitdiff
path: root/tests/diff/binary.c
diff options
context:
space:
mode:
authorCarlos Martín Nieto <cmn@dwim.me>2014-05-06 19:20:33 +0200
committerCarlos Martín Nieto <cmn@dwim.me>2014-05-09 09:40:29 +0200
commit2acdf4b854bf55ba2630c7342d09b136d919d6ad (patch)
tree2848d19b198d10ecb3c1a75c215dd61ec08f2079 /tests/diff/binary.c
parentae0817393c0aaff5c4b085c46ed11acc0ab64198 (diff)
downloadlibgit2-2acdf4b854bf55ba2630c7342d09b136d919d6ad.tar.gz
pack: unpack using a loop
We currently make use of recursive function calls to unpack an object, resolving the deltas as we come back down the chain. This means that we have unbounded stack growth as we look up objects in a pack. This is now done in two steps: first we figure out what the dependency chain is by looking up the delta bases until we reach a non-delta object, pushing the information we need onto a stack and then we pop from that stack and apply the deltas until there are no more left. This version of the code does not make use of the delta base cache so it is slower than what's in the mainline. A later commit will reintroduce it.
Diffstat (limited to 'tests/diff/binary.c')
0 files changed, 0 insertions, 0 deletions