| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Precompute interference for neighbor blocks as long as there is no interference. | Jakob Stoklund Olesen | 2011-04-09 | 1 | -21/+32 |
| | | | | | | | This doesn't require seeking in the live interval union, so it is very cheap. llvm-svn: 129187 | ||||
| * | Avoid moving iterators when the previous block was just visited. | Jakob Stoklund Olesen | 2011-04-07 | 1 | -8/+13 |
| | | | | | llvm-svn: 129081 | ||||
| * | Add an InterferenceCache class for caching per-block interference ranges. | Jakob Stoklund Olesen | 2011-04-02 | 1 | -0/+139 |
| When the greedy register allocator is splitting multiple global live ranges, it tends to look at the same interference data many times. The InterferenceCache class caches queries for unaltered LiveIntervalUnions. llvm-svn: 128764 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|