summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2004-10-07 19:20:48 +0000
committerChris Lattner <sabre@nondot.org>2004-10-07 19:20:48 +0000
commit251093ca5db40a5f377bda8f4d1897a529049ee7 (patch)
treea28a56d4f9557ed587f0524e14eca1c99edf0e4d /llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp
parentd299ffee016902799d9cf2a67223d1c207b3659f (diff)
downloadbcm5719-llvm-251093ca5db40a5f377bda8f4d1897a529049ee7.tar.gz
bcm5719-llvm-251093ca5db40a5f377bda8f4d1897a529049ee7.zip
Unfortunately the fix for the previous bug introduced the previous
exponential behavior (bork!). This patch processes stuff with an explicit SCC finder, allowing the algorithm to be more clear, efficient, and also (as a bonus) correct! This gets us back to taking 0.6s to disassemble my horrible .bc file that previously took something > 30 mins. llvm-svn: 16811
Diffstat (limited to 'llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud