summaryrefslogtreecommitdiffstats
path: root/lldb/packages/Python/lldbsuite/test/lang/cpp/call-function/main.cpp
diff options
context:
space:
mode:
authorEnrico Granata <egranata@apple.com>2015-12-04 20:12:46 +0000
committerEnrico Granata <egranata@apple.com>2015-12-04 20:12:46 +0000
commit26935d9a092a1bcd1c386b5804e66ef9cd900691 (patch)
treec73ba444f62a977b9e6aca291ef528f30ead4364 /lldb/packages/Python/lldbsuite/test/lang/cpp/call-function/main.cpp
parent4c8a5e37e2d97e135d13bbe6a574cb71bff083a4 (diff)
downloadbcm5719-llvm-26935d9a092a1bcd1c386b5804e66ef9cd900691.tar.gz
bcm5719-llvm-26935d9a092a1bcd1c386b5804e66ef9cd900691.zip
Cache the incremental iterators as you traverse the list, so that you don't have to keep recomputing them
If memory turns out to be a problem, which I don't think it will in practice because all these ValueObjects, we'd be keeping alive anyway, I can always resort to caching the farthest-most iterator only This gains us an order of magnitude in my benchmark, cutting the time to traverse a 1500-elements list from 22 seconds down to 2 llvm-svn: 254762
Diffstat (limited to 'lldb/packages/Python/lldbsuite/test/lang/cpp/call-function/main.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud