| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
This allows it to add subregister ranges into the union.
llvm-svn: 223890
|
|
|
|
|
|
|
|
|
|
|
|
| |
define below all header includes in the lib/CodeGen/... tree. While the
current modules implementation doesn't check for this kind of ODR
violation yet, it is likely to grow support for it in the future. It
also removes one layer of macro pollution across all the included
headers.
Other sub-trees will follow.
llvm-svn: 206837
|
|
|
|
|
|
| |
instead of comparing to nullptr.
llvm-svn: 206142
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Sooooo many of these had incorrect or strange main module includes.
I have manually inspected all of these, and fixed the main module
include to be the nearest plausible thing I could find. If you own or
care about any of these source files, I encourage you to take some time
and check that these edits were sensible. I can't have broken anything
(I strictly added headers, and reordered them, never removed), but they
may not be the headers you'd really like to identify as containing the
API being implemented.
Many forward declarations and missing includes were added to a header
files to allow them to parse cleanly when included first. The main
module rule does in fact have its merits. =]
llvm-svn: 169131
|
|
|
|
|
|
|
|
|
|
|
| |
No functional change, just moved header files.
Targets can inject custom passes between register allocation and
rewriting. This makes it possible to tweak the register allocation
before rewriting, using the full global interference checking available
from LiveRegMatrix.
llvm-svn: 168806
|
|
|
|
| |
llvm-svn: 168659
|
|
|
|
|
|
| |
It is useful outside RegAllocBase.
llvm-svn: 158041
|
|
|
|
|
|
|
|
| |
Soon we'll be making LiveIntervalUnions for register units as well.
This was the only place using the RepReg member, so just remove it.
llvm-svn: 158038
|
|
|
|
|
|
| |
include to LiveIntervalUnion.cpp file.
llvm-svn: 147089
|
|
|
|
|
|
|
| |
This is possible now that we now longer provide an interface to iterate
the interference overlaps.
llvm-svn: 137397
|
|
|
|
|
|
|
|
| |
The Query class now holds two iterators instead of an InterferenceResult
instance. The iterators are used as bookmarks for repeated
collectInterferingVRegs calls.
llvm-svn: 137380
|
|
|
|
|
|
|
| |
collectInterferingVRegs will be the primary function for interference
checks.
llvm-svn: 137354
|
|
|
|
|
|
|
|
| |
The InterferenceResult iterator turned out to be less important than we
thought it would be. LiveIntervalUnion clients want higher level
information, like the list of interfering virtual registers.
llvm-svn: 137346
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
RAGreedy::tryAssign will now evict interference from the preferred
register even when another register is free.
To support this, add the EvictionCost struct that counts how many hints
are broken by an eviction. We don't want to break one hint just to
satisfy another.
Rename canEvict to shouldEvict, and add the first bit of eviction policy
that doesn't depend on spill weights: Always make room in the preferred
register as long as the evictees can be split and aren't already
assigned to their preferred register.
Also make the CSR avoidance more accurate. When looking for a cheaper
register it is OK to use a new volatile register. Only CSR aliases that
have never been used before should be avoided.
llvm-svn: 134735
|
|
|
|
|
|
| |
weight limit has been exceeded.
llvm-svn: 129305
|
|
|
|
|
|
| |
This particularly helps with the initial transfer of fixed intervals.
llvm-svn: 129277
|
|
|
|
|
|
|
| |
The tag is updated whenever the live interval union is changed, and it is tested
before using cached information.
llvm-svn: 125224
|
|
|
|
|
|
|
|
|
|
| |
without a TRI instance.
Print virtual registers numbered from 0 instead of the arbitrary
FirstVirtualRegister. The first virtual register is printed as %vreg0.
TRI::NoRegister is printed as %noreg.
llvm-svn: 123107
|
|
|
|
|
|
| |
interference.
llvm-svn: 122108
|
|
|
|
|
|
|
|
| |
This is a three-way interval list intersection between a virtual register, a
live interval union, and a loop. It will be used to identify interference-free
loops for live range splitting.
llvm-svn: 122034
|
|
|
|
|
|
|
|
| |
live range splitting around loops guided by register pressure.
So far, trySplit() simply prints a lot of debug output.
llvm-svn: 121918
|
|
|
|
| |
llvm-svn: 121783
|
|
|
|
|
|
| |
LiveIntervalUnions.
llvm-svn: 121781
|
|
|
|
| |
llvm-svn: 121410
|
|
|
|
|
|
|
| |
heuristic to reshuffle register assignments when we can't find an
available reg.
llvm-svn: 121388
|
|
|
|
|
|
|
|
|
|
|
| |
references instead.
Similarly, IntervalMap::begin() is almost as expensive as find(), so use find(x)
instead of begin().advanceTo(x);
This makes RegAllocBasic run another 5% faster.
llvm-svn: 121344
|
|
|
|
| |
llvm-svn: 121319
|
|
|
|
|
|
|
| |
This speeds up RegAllocBasic by 20%, not counting releaseMemory which becomes
way faster.
llvm-svn: 121201
|
|
|
|
| |
llvm-svn: 120504
|
|
|
|
|
|
|
|
| |
in favor of the widespread llvm style. Capitalize variables and add
newlines for visual parsing. Rename variables for readability.
And other cleanup.
llvm-svn: 120490
|
|
|
|
|
|
|
|
|
| |
benchmarks hitting an assertion.
Adds LiveIntervalUnion::collectInterferingVRegs.
Fixes "late spilling" by checking for any unspillable live vregs among
all physReg aliases.
llvm-svn: 118701
|
|
|
|
|
|
| |
(retry now that the windows build is green)
llvm-svn: 118630
|
|
|
|
| |
llvm-svn: 118613
|
|
|
|
| |
llvm-svn: 118604
|
|
|
|
|
|
|
|
|
| |
handle cases in which a register is unavailable for spill code.
Adds LiveIntervalUnion::extract. While processing interferences on a
live virtual register, reuses the same Query object for each
physcial reg.
llvm-svn: 118423
|
|
|
|
|
|
|
| |
them, but hopefully we won't. And this is not the right data structure
to do it anyway.
llvm-svn: 117412
|
|
|
|
| |
llvm-svn: 117384
|
|
|
|
|
|
| |
was found by a GCC warning. ;]
llvm-svn: 117199
|
|
framework. It's purpose is not to improve register allocation per se,
but to make it easier to develop powerful live range splitting. I call
it the basic allocator because it is as simple as a global allocator
can be but provides the building blocks for sophisticated register
allocation with live range splitting.
A minimal implementation is provided that trivially spills whenever it
runs out of registers. I'm checking in now to get high-level design
and style feedback. I've only done minimal testing. The next step is
implementing a "greedy" allocation algorithm that does some register
reassignment and makes better splitting decisions.
llvm-svn: 117174
|