mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-21 18:29:46 +00:00
(1) An int CC live range must be spilled if there are any interferences, even if no other "neighbour" in the interf. graph has been allocated that reg. yet. This is actually true of any class with only one reg! (2) SparcIntCCRegClass::colorIGNode sets the color even if the LR must be spilled so that the machine-independent spill code doesn't have to make the machine-dependent decision of which CC name to use based on operand type: %xcc or %icc. (These are two halves of the same register.) (3) LR->isMarkedForSpill() is no longer the same as LR->hasColor(). These should never have been the same, and this is necessary now for #2. (4) All RDCCR and WRCCR instructions are directly generated with the phony number for %ccr so that EmitAssembly/EmitBinary doesn't have to deal with this. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7151 91177308-0d34-0410-b5e6-96231b3b80d8
307 lines
11 KiB
C++
307 lines
11 KiB
C++
//===-- SparcRegClassInfo.cpp - Register class def'ns for Sparc -----------===//
|
|
//
|
|
// This file defines the register classes used by the Sparc target description.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "SparcRegClassInfo.h"
|
|
#include "llvm/Type.h"
|
|
#include "../../CodeGen/RegAlloc/RegAllocCommon.h" // FIXME!
|
|
|
|
//-----------------------------------------------------------------------------
|
|
// Int Register Class - method for coloring a node in the interference graph.
|
|
//
|
|
// Algorithm:
|
|
// Record the colors/suggested colors of all neighbors.
|
|
//
|
|
// If there is a suggested color, try to allocate it
|
|
// If there is no call interf, try to allocate volatile, then non volatile
|
|
// If there is call interf, try to allocate non-volatile. If that fails
|
|
// try to allocate a volatile and insert save across calls
|
|
// If both above fail, spill.
|
|
//
|
|
//-----------------------------------------------------------------------------
|
|
void SparcIntRegClass::colorIGNode(IGNode * Node,
|
|
std::vector<bool> &IsColorUsedArr) const
|
|
{
|
|
LiveRange *LR = Node->getParentLR();
|
|
|
|
if (DEBUG_RA) {
|
|
std::cerr << "\nColoring LR [CallInt=" << LR->isCallInterference() <<"]:";
|
|
printSet(*LR);
|
|
}
|
|
|
|
if (LR->hasSuggestedColor()) {
|
|
unsigned SugCol = LR->getSuggestedColor();
|
|
if (!IsColorUsedArr[SugCol]) {
|
|
if (LR->isSuggestedColorUsable()) {
|
|
// if the suggested color is volatile, we should use it only if
|
|
// there are no call interferences. Otherwise, it will get spilled.
|
|
if (DEBUG_RA)
|
|
std::cerr << "\n -Coloring with sug color: " << SugCol;
|
|
|
|
LR->setColor(LR->getSuggestedColor());
|
|
return;
|
|
} else if(DEBUG_RA) {
|
|
std::cerr << "\n Couldn't alloc Sug col - LR volatile & calls interf";
|
|
}
|
|
} else if (DEBUG_RA) { // can't allocate the suggested col
|
|
std::cerr << "\n Could NOT allocate the suggested color (already used) ";
|
|
printSet(*LR); std::cerr << "\n";
|
|
}
|
|
}
|
|
|
|
unsigned SearchStart; // start pos of color in pref-order
|
|
bool ColorFound= false; // have we found a color yet?
|
|
|
|
//if this Node is between calls
|
|
if (! LR->isCallInterference()) {
|
|
// start with volatiles (we can allocate volatiles safely)
|
|
SearchStart = SparcIntRegClass::StartOfAllRegs;
|
|
} else {
|
|
// start with non volatiles (no non-volatiles)
|
|
SearchStart = SparcIntRegClass::StartOfNonVolatileRegs;
|
|
}
|
|
|
|
unsigned c=0; // color
|
|
|
|
// find first unused color
|
|
for (c=SearchStart; c < SparcIntRegClass::NumOfAvailRegs; c++) {
|
|
if (!IsColorUsedArr[c]) {
|
|
ColorFound = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (ColorFound) {
|
|
LR->setColor(c); // first color found in preffered order
|
|
if (DEBUG_RA) std::cerr << "\n Colored after first search with col " << c;
|
|
}
|
|
|
|
// if color is not found because of call interference
|
|
// try even finding a volatile color and insert save across calls
|
|
//
|
|
else if (LR->isCallInterference()) {
|
|
// start from 0 - try to find even a volatile this time
|
|
SearchStart = SparcIntRegClass::StartOfAllRegs;
|
|
|
|
// find first unused volatile color
|
|
for(c=SearchStart; c < SparcIntRegClass::StartOfNonVolatileRegs; c++) {
|
|
if (! IsColorUsedArr[c]) {
|
|
ColorFound = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (ColorFound) {
|
|
LR->setColor(c);
|
|
// get the live range corresponding to live var
|
|
// since LR span across calls, must save across calls
|
|
//
|
|
LR->markForSaveAcrossCalls();
|
|
if (DEBUG_RA)
|
|
std::cerr << "\n Colored after SECOND search with col " << c;
|
|
}
|
|
}
|
|
|
|
|
|
// If we couldn't find a color regardless of call interference - i.e., we
|
|
// don't have either a volatile or non-volatile color left
|
|
//
|
|
if (!ColorFound)
|
|
LR->markForSpill(); // no color found - must spill
|
|
}
|
|
|
|
//-----------------------------------------------------------------------------
|
|
// Int CC Register Class - method for coloring a node in the interference graph.
|
|
//
|
|
// Algorithm:
|
|
//
|
|
// If (node has any interferences)
|
|
// /* all interference operations can use only one register! */
|
|
// mark the LR for spilling
|
|
// else {
|
|
// if (the LR is a 64-bit comparison) use %xcc
|
|
// else /*32-bit or smaller*/ use %icc
|
|
// }
|
|
//
|
|
// Note: The third name (%ccr) is essentially an assembly mnemonic and
|
|
// depends solely on the opcode, so the name can be chosen in EmitAssembly.
|
|
//-----------------------------------------------------------------------------
|
|
void SparcIntCCRegClass::colorIGNode(IGNode *Node,
|
|
std::vector<bool> &IsColorUsedArr) const
|
|
{
|
|
if (Node->getNumOfNeighbors() > 0)
|
|
Node->getParentLR()->markForSpill();
|
|
|
|
// Mark the appropriate register in any case (even if it needs to be spilled)
|
|
// because there is only one possible register, but more importantly, the
|
|
// spill algorithm cannot find it. In particular, we have to choose
|
|
// whether to use %xcc or %icc based on type of value compared
|
|
//
|
|
const LiveRange* ccLR = Node->getParentLR();
|
|
const Type* setCCType = (* ccLR->begin())->getType(); // any Value in LR
|
|
assert(setCCType->isIntegral() || isa<PointerType>(setCCType));
|
|
int ccReg = ((isa<PointerType>(setCCType) || setCCType == Type::LongTy)
|
|
? xcc : icc);
|
|
|
|
#ifndef NDEBUG
|
|
// Let's just make sure values of two different types have not been
|
|
// coalesced into this LR.
|
|
for (ValueSet::const_iterator I=ccLR->begin(), E=ccLR->end(); I!=E; ++I) {
|
|
const Type* ccType = (*I)->getType();
|
|
assert((ccReg == xcc && (isa<PointerType>(ccType)
|
|
|| ccType == Type::LongTy)) ||
|
|
(ccReg == icc && ccType->isIntegral() && ccType != Type::LongTy)
|
|
&& "Comparisons needing different intCC regs coalesced in LR!");
|
|
}
|
|
#endif
|
|
|
|
Node->setColor(ccReg); // only one int cc reg is available
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
// Float Register Class - method for coloring a node in the interference graph.
|
|
//
|
|
// Algorithm:
|
|
//
|
|
// If the LR is a double try to allocate f32 - f63
|
|
// If the above fails or LR is single precision
|
|
// If the LR does not interfere with a call
|
|
// start allocating from f0
|
|
// Else start allocating from f6
|
|
// If a color is still not found because LR interferes with a call
|
|
// Search in f0 - f6. If found mark for spill across calls.
|
|
// If a color is still not fond, mark for spilling
|
|
//
|
|
//----------------------------------------------------------------------------
|
|
void SparcFloatRegClass::colorIGNode(IGNode * Node,
|
|
std::vector<bool> &IsColorUsedArr) const
|
|
{
|
|
LiveRange *LR = Node->getParentLR();
|
|
|
|
// Mark the second color for double-precision registers:
|
|
// This is UGLY and should be merged into nearly identical code
|
|
// in RegClass::colorIGNode that handles the first color.
|
|
//
|
|
unsigned NumNeighbors = Node->getNumOfNeighbors(); // total # of neighbors
|
|
for(unsigned n=0; n < NumNeighbors; n++) { // for each neigh
|
|
IGNode *NeighIGNode = Node->getAdjIGNode(n);
|
|
LiveRange *NeighLR = NeighIGNode->getParentLR();
|
|
|
|
if (NeighLR->hasColor() &&
|
|
NeighLR->getType() == Type::DoubleTy) {
|
|
IsColorUsedArr[ (NeighLR->getColor()) + 1 ] = true;
|
|
|
|
} else if (NeighLR->hasSuggestedColor() &&
|
|
NeighLR-> isSuggestedColorUsable() ) {
|
|
|
|
// if the neighbour can use the suggested color
|
|
IsColorUsedArr[ NeighLR->getSuggestedColor() ] = true;
|
|
if (NeighLR->getType() == Type::DoubleTy)
|
|
IsColorUsedArr[ (NeighLR->getSuggestedColor()) + 1 ] = true;
|
|
}
|
|
}
|
|
|
|
// **NOTE: We don't check for call interferences in allocating suggested
|
|
// color in this class since ALL registers are volatile. If this fact
|
|
// changes, we should change the following part
|
|
//- see SparcIntRegClass::colorIGNode()
|
|
//
|
|
if( LR->hasSuggestedColor() ) {
|
|
if( ! IsColorUsedArr[ LR->getSuggestedColor() ] ) {
|
|
LR->setColor( LR->getSuggestedColor() );
|
|
return;
|
|
} else if (DEBUG_RA) { // can't allocate the suggested col
|
|
std::cerr << " Could NOT allocate the suggested color for LR ";
|
|
printSet(*LR); std::cerr << "\n";
|
|
}
|
|
}
|
|
|
|
|
|
int ColorFound = -1; // have we found a color yet?
|
|
bool isCallInterf = LR->isCallInterference();
|
|
|
|
// if value is a double - search the double only region (f32 - f63)
|
|
// i.e. we try to allocate f32 - f63 first for doubles since singles
|
|
// cannot go there. By doing that, we provide more space for singles
|
|
// in f0 - f31
|
|
//
|
|
if (LR->getType() == Type::DoubleTy)
|
|
ColorFound = findFloatColor( LR, 32, 64, IsColorUsedArr );
|
|
|
|
if (ColorFound >= 0) { // if we could find a color
|
|
LR->setColor(ColorFound);
|
|
return;
|
|
} else {
|
|
|
|
// if we didn't find a color becuase the LR was single precision or
|
|
// all f32-f63 range is filled, we try to allocate a register from
|
|
// the f0 - f31 region
|
|
|
|
unsigned SearchStart; // start pos of color in pref-order
|
|
|
|
//if this Node is between calls (i.e., no call interferences )
|
|
if (! isCallInterf) {
|
|
// start with volatiles (we can allocate volatiles safely)
|
|
SearchStart = SparcFloatRegClass::StartOfAllRegs;
|
|
} else {
|
|
// start with non volatiles (no non-volatiles)
|
|
SearchStart = SparcFloatRegClass::StartOfNonVolatileRegs;
|
|
}
|
|
|
|
ColorFound = findFloatColor(LR, SearchStart, 32, IsColorUsedArr);
|
|
}
|
|
|
|
if (ColorFound >= 0) { // if we could find a color
|
|
LR->setColor(ColorFound);
|
|
return;
|
|
} else if (isCallInterf) {
|
|
// We are here because there is a call interference and no non-volatile
|
|
// color could be found.
|
|
// Now try to allocate even a volatile color
|
|
ColorFound = findFloatColor(LR, SparcFloatRegClass::StartOfAllRegs,
|
|
SparcFloatRegClass::StartOfNonVolatileRegs,
|
|
IsColorUsedArr);
|
|
}
|
|
|
|
if (ColorFound >= 0) {
|
|
LR->setColor(ColorFound); // first color found in prefered order
|
|
LR->markForSaveAcrossCalls();
|
|
} else {
|
|
// we are here because no color could be found
|
|
LR->markForSpill(); // no color found - must spill
|
|
}
|
|
}
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
// Helper method for coloring a node of Float Reg class.
|
|
// Finds the first available color in the range [Start,End] depending on the
|
|
// type of the Node (i.e., float/double)
|
|
//-----------------------------------------------------------------------------
|
|
|
|
int SparcFloatRegClass::findFloatColor(const LiveRange *LR,
|
|
unsigned Start,
|
|
unsigned End,
|
|
std::vector<bool> &IsColorUsedArr) const
|
|
{
|
|
bool ColorFound = false;
|
|
unsigned c;
|
|
|
|
if (LR->getType() == Type::DoubleTy) {
|
|
// find first unused color for a double
|
|
for (c=Start; c < End ; c+= 2)
|
|
if (!IsColorUsedArr[c] && !IsColorUsedArr[c+1])
|
|
return c;
|
|
} else {
|
|
// find first unused color for a single
|
|
for (c = Start; c < End; c++)
|
|
if (!IsColorUsedArr[c])
|
|
return c;
|
|
}
|
|
|
|
return -1;
|
|
}
|