diff options
| author | Alkis Evlogimenos <alkis@evlogimenos.com> | 2004-01-31 16:54:54 +0000 |
|---|---|---|
| committer | Alkis Evlogimenos <alkis@evlogimenos.com> | 2004-01-31 16:54:54 +0000 |
| commit | 97017de1872e08ffcdde2fccdfd399647c1ccc4a (patch) | |
| tree | 8bf105a6bd5f7ec301ea4250cbcc81478f2b704f /lib/Analysis/DataStructure/BottomUpClosure.cpp | |
| parent | 4d46e1e521c0df1990ea50f8146d22bd77ea71a6 (diff) | |
Optimize liveAt() and overlaps(). We now use a binary search instead
of a linear search to find the first range for comparisons. This cuts
down the linear scan register allocator running time by a factor of 3
in 254.perlbmk and by a factor of 2.2 in 176.gcc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@11030 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/BottomUpClosure.cpp')
0 files changed, 0 insertions, 0 deletions