- Nov 18, 2004
-
-
Chris Lattner authored
* Eliminate the releaseMemory method, this is not an analysis * Change the fixed, active, and inactive lists of intervals to maintain an iterator for the current position in the interval. This allows us to do constant time increments of the iterator instead of having to do a binary search to find our liverange in our liveinterval all of the time, which substantially speeds up cases where LiveIntervals have many LiveRanges - which is very common for physical registers. On targets with many physregs, this can make a noticable difference. With a release build of LLC for PPC, this halves the time in processInactiveIntervals and processActiveIntervals, from 1.5s to .75s. This also lays the ground for more to come. llvm-svn: 17933
-
Chris Lattner authored
iterator/begin/end members. llvm-svn: 17930
-
- Nov 05, 2004
-
-
Chris Lattner authored
llvm-svn: 17483
-
- Sep 30, 2004
-
-
Chris Lattner authored
the beginning of processing the next one. llvm-svn: 16605
-
- Sep 03, 2004
-
-
Alkis Evlogimenos authored
Patch contributed by Paolo Invernizzi! llvm-svn: 16152
-
- Sep 02, 2004
-
-
Alkis Evlogimenos authored
free allocatable register, we prefer the a free one with the most uses of inactive intervals. This causes less spills and performes a bit better compared to gcc: Program | GCC/LLC (Before)| GCC/LLC (After) 164.gzip/164.gzip | 0.59 | 0.60 175.vpr/175.vpr | 0.57 | 0.58 176.gcc/176.gcc | 0.59 | 0.61 181.mcf/181.mcf | 0.94 | 0.95 186.crafty/186.crafty | 0.62 | 0.62 197.parser/197.parser | 0.89 | 0.88 252.eon/252.eon | 0.61 | 0.66 253.perlbmk/253.perlbmk | 0.79 | 0.84 254.gap/254.gap | 0.81 | 0.81 255.vortex/255.vortex | 0.92 | 0.93 256.bzip2/256.bzip2 | 0.69 | 0.69 300.twolf/300.twolf | 0.91 | 0.90 llvm-svn: 16147
-
Alkis Evlogimenos authored
stored in a binary heap. llvm-svn: 16143
-
Reid Spencer authored
Move include/Config and include/Support into include/llvm/Config, include/llvm/ADT and include/llvm/Support. From here on out, all LLVM public header files must be under include/llvm/. llvm-svn: 16137
-
Alkis Evlogimenos authored
lists. Instead of scanning the vector backwards, scan it forward and swap each element we want to erase. Then at the end erase all removed intervals at once. This doesn't save much: 0.08s out of 4s when compiling 176.gcc. llvm-svn: 16136
-
- Aug 27, 2004
-
-
Alkis Evlogimenos authored
LiveVariables. llvm-svn: 16076
-
Alkis Evlogimenos authored
investicated further as the linearscan variants don't really need LiveVariables... llvm-svn: 16074
-
Alkis Evlogimenos authored
llvm-svn: 16071
-
- Aug 04, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 15489
-
- Jul 25, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 15200
-
- Jul 24, 2004
-
-
Alkis Evlogimenos authored
LiveInterval>. This saves some space and removes the pointer indirection caused by following the pointer. llvm-svn: 15167
-
Chris Lattner authored
ownership of the intervals. llvm-svn: 15155
-
- Jul 23, 2004
-
-
Chris Lattner authored
llvm-svn: 15135
-
- Jul 22, 2004
-
-
Alkis Evlogimenos authored
compilation of gcc: * Use vectors instead of lists for the intervals sets * Use a heap for the unhandled set to keep intervals always sorted and makes insertions back to the heap very fast (compared to scanning a list) llvm-svn: 15103
-
- Jul 21, 2004
-
-
Brian Gaeke authored
llvm-svn: 15089
-
- Jul 20, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 15011
-
- Jul 19, 2004
-
-
Chris Lattner authored
llvm-svn: 14991
-
Chris Lattner authored
is sorted. This is not the case currently, which is causing no end of problems. llvm-svn: 14990
-
- Jul 04, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 14626
-
Alkis Evlogimenos authored
llvm-svn: 14590
-
- Jun 21, 2004
-
-
Chris Lattner authored
existing llvm::Interval class. Patch contributed by Vladimir Prus! http://mail.cs.uiuc.edu/pipermail/llvmbugs/2004-June/000710.html llvm-svn: 14281
-
- May 30, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 13910
-
Alkis Evlogimenos authored
spills. This allows for more flexibility when allocating registers for spill code. llvm-svn: 13907
-
- May 08, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 13417
-
- May 06, 2004
-
-
Chris Lattner authored
workaround, use the C HUGE_VAL macro instead. llvm-svn: 13377
-
- Mar 17, 2004
-
-
Alkis Evlogimenos authored
unhandled + handled. So unhandled is now including all fixed intervals and fixed intervals never changes when processing a function. llvm-svn: 12462
-
- Mar 02, 2004
-
-
Alkis Evlogimenos authored
Add a spiller option to llc. A simple spiller will come soon. When we get CFG in the machine code represenation a global spiller will also be possible. Also document the linear scan register allocator but mark it as experimental for now. llvm-svn: 12062
-
- Mar 01, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 12058
-
- Feb 27, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 11898
-
- Feb 25, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 11841
-
Chris Lattner authored
llvm-svn: 11830
-
- Feb 24, 2004
-
-
Alkis Evlogimenos authored
allocator. The implementation is completely rewritten and now employs several optimizations not exercised before. For example for 164.gzip we have 997 loads and 699 stores vs the 1221 loads and 880 stores we have before. llvm-svn: 11798
-
Alkis Evlogimenos authored
llvm-svn: 11781
-
Alkis Evlogimenos authored
251 (providing a generic machine code rewriter/spiller). llvm-svn: 11780
-
- Feb 23, 2004
-
-
Alkis Evlogimenos authored
llvm-svn: 11759
-
Alkis Evlogimenos authored
llvm-svn: 11755
-