summaryrefslogtreecommitdiff
path: root/test
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2006-08-12 05:02:03 +0000
committerChris Lattner <sabre@nondot.org>2006-08-12 05:02:03 +0000
commit69b3992154d4a136cd18448b4fc796afd1efb5ea (patch)
tree0bb4dded3f22d77608f3d96b3c342577bbef3726 /test
parentfa78946482a2cc73a1485887dfd12edd12b742a4 (diff)
downloadllvm-69b3992154d4a136cd18448b4fc796afd1efb5ea.tar.gz
llvm-69b3992154d4a136cd18448b4fc796afd1efb5ea.tar.bz2
llvm-69b3992154d4a136cd18448b4fc796afd1efb5ea.tar.xz
Make Loop::getExitBlocks significantly faster for large loops. Instead of
pounding on Loop::contains (which is O(n) in the size of the loop), use a sorted vector, which is O(log(N)) for each query. This speeds up Duraid's horrible testcase from ~72s to ~31s in a debug build. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29645 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test')
0 files changed, 0 insertions, 0 deletions