mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-07-18 12:29:27 +00:00
Next stage into switch lowering refactoring
1. Fix some bugs in the jump table lowering threshold 2. Implement much better metric for optimal pivot selection 3. Tune thresholds for different lowering methods 4. Implement shift-and trick for lowering small (<machine word length) cases with few destinations. Good testcase will follow. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@35816 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Anton Korobeynikov
parent
a9f120bd9f
commit
4198c58c71
@ -125,6 +125,32 @@ public:
|
||||
};
|
||||
typedef std::pair<JumpTableHeader, JumpTable> JumpTableBlock;
|
||||
|
||||
struct BitTestCase {
|
||||
BitTestCase(uint64_t M, MachineBasicBlock* T, MachineBasicBlock* Tr):
|
||||
Mask(M), ThisBB(T), TargetBB(Tr) { };
|
||||
uint64_t Mask;
|
||||
MachineBasicBlock* ThisBB;
|
||||
MachineBasicBlock* TargetBB;
|
||||
};
|
||||
|
||||
typedef SmallVector<BitTestCase, 3> BitTestInfo;
|
||||
|
||||
struct BitTestBlock {
|
||||
BitTestBlock(uint64_t F, uint64_t R, Value* SV,
|
||||
unsigned Rg, bool E,
|
||||
MachineBasicBlock* P, MachineBasicBlock* D,
|
||||
const BitTestInfo& C):
|
||||
First(F), Range(R), SValue(SV), Reg(Rg), Emitted(E),
|
||||
Parent(P), Default(D), Cases(C) { };
|
||||
uint64_t First;
|
||||
uint64_t Range;
|
||||
Value *SValue;
|
||||
unsigned Reg;
|
||||
bool Emitted;
|
||||
MachineBasicBlock *Parent;
|
||||
MachineBasicBlock *Default;
|
||||
BitTestInfo Cases;
|
||||
};
|
||||
protected:
|
||||
/// Pick a safe ordering and emit instructions for each target node in the
|
||||
/// graph.
|
||||
@ -157,6 +183,8 @@ private:
|
||||
/// JTCases - Vector of JumpTable structures which holds necessary information
|
||||
/// for emitting a jump tables during SwitchInst code generation.
|
||||
std::vector<JumpTableBlock> JTCases;
|
||||
|
||||
std::vector<BitTestBlock> BitTestCases;
|
||||
};
|
||||
|
||||
}
|
||||
|
||||
@ -378,7 +378,17 @@ class SelectionDAGLowering {
|
||||
}
|
||||
};
|
||||
|
||||
struct CaseBits {
|
||||
uint64_t Mask;
|
||||
MachineBasicBlock* BB;
|
||||
unsigned Bits;
|
||||
|
||||
CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits):
|
||||
Mask(mask), BB(bb), Bits(bits) { }
|
||||
};
|
||||
|
||||
typedef std::vector<Case> CaseVector;
|
||||
typedef std::vector<CaseBits> CaseBitsVector;
|
||||
typedef CaseVector::iterator CaseItr;
|
||||
typedef std::pair<CaseItr, CaseItr> CaseRange;
|
||||
|
||||
@ -404,9 +414,7 @@ class SelectionDAGLowering {
|
||||
/// The comparison function for sorting the switch case values in the vector.
|
||||
/// WARNING: Case ranges should be disjoint!
|
||||
struct CaseCmp {
|
||||
bool operator () (const Case& C1,
|
||||
const Case& C2) {
|
||||
|
||||
bool operator () (const Case& C1, const Case& C2) {
|
||||
assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High));
|
||||
const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low);
|
||||
const ConstantInt* CI2 = cast<const ConstantInt>(C2.High);
|
||||
@ -414,6 +422,12 @@ class SelectionDAGLowering {
|
||||
}
|
||||
};
|
||||
|
||||
struct CaseBitsCmp {
|
||||
bool operator () (const CaseBits& C1, const CaseBits& C2) {
|
||||
return C1.Bits > C2.Bits;
|
||||
}
|
||||
};
|
||||
|
||||
unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI);
|
||||
|
||||
public:
|
||||
@ -430,6 +444,7 @@ public:
|
||||
/// JTCases - Vector of JumpTable structures used to communicate
|
||||
/// SwitchInst code generation information.
|
||||
std::vector<SelectionDAGISel::JumpTableBlock> JTCases;
|
||||
std::vector<SelectionDAGISel::BitTestBlock> BitTestCases;
|
||||
|
||||
/// FuncInfo - Information about the function as a whole.
|
||||
///
|
||||
@ -531,7 +546,15 @@ public:
|
||||
CaseRecVector& WorkList,
|
||||
Value* SV,
|
||||
MachineBasicBlock* Default);
|
||||
bool handleBitTestsSwitchCase(CaseRec& CR,
|
||||
CaseRecVector& WorkList,
|
||||
Value* SV,
|
||||
MachineBasicBlock* Default);
|
||||
void visitSwitchCase(SelectionDAGISel::CaseBlock &CB);
|
||||
void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B);
|
||||
void visitBitTestCase(MachineBasicBlock* NextMBB,
|
||||
unsigned Reg,
|
||||
SelectionDAGISel::BitTestCase &B);
|
||||
void visitJumpTable(SelectionDAGISel::JumpTable &JT);
|
||||
void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT,
|
||||
SelectionDAGISel::JumpTableHeader &JTH);
|
||||
@ -1211,8 +1234,97 @@ void SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT,
|
||||
else
|
||||
DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond,
|
||||
DAG.getBasicBlock(JT.MBB)));
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
/// visitBitTestHeader - This function emits necessary code to produce value
|
||||
/// suitable for "bit tests"
|
||||
void SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) {
|
||||
// Subtract the minimum value
|
||||
SDOperand SwitchOp = getValue(B.SValue);
|
||||
MVT::ValueType VT = SwitchOp.getValueType();
|
||||
SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp,
|
||||
DAG.getConstant(B.First, VT));
|
||||
|
||||
// Check range
|
||||
SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultTy(), SUB,
|
||||
DAG.getConstant(B.Range, VT),
|
||||
ISD::SETUGT);
|
||||
|
||||
SDOperand ShiftOp;
|
||||
if (VT > TLI.getShiftAmountTy())
|
||||
ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB);
|
||||
else
|
||||
ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB);
|
||||
|
||||
// Make desired shift
|
||||
SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(),
|
||||
DAG.getConstant(1, TLI.getPointerTy()),
|
||||
ShiftOp);
|
||||
|
||||
unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy());
|
||||
SDOperand CopyTo = DAG.getCopyToReg(getRoot(), SwitchReg, SwitchVal);
|
||||
B.Reg = SwitchReg;
|
||||
|
||||
SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp,
|
||||
DAG.getBasicBlock(B.Default));
|
||||
|
||||
// Set NextBlock to be the MBB immediately after the current one, if any.
|
||||
// This is used to avoid emitting unnecessary branches to the next block.
|
||||
MachineBasicBlock *NextBlock = 0;
|
||||
MachineFunction::iterator BBI = CurMBB;
|
||||
if (++BBI != CurMBB->getParent()->end())
|
||||
NextBlock = BBI;
|
||||
|
||||
MachineBasicBlock* MBB = B.Cases[0].ThisBB;
|
||||
if (MBB == NextBlock)
|
||||
DAG.setRoot(BrRange);
|
||||
else
|
||||
DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo,
|
||||
DAG.getBasicBlock(MBB)));
|
||||
|
||||
CurMBB->addSuccessor(B.Default);
|
||||
CurMBB->addSuccessor(MBB);
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
/// visitBitTestCase - this function produces one "bit test"
|
||||
void SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB,
|
||||
unsigned Reg,
|
||||
SelectionDAGISel::BitTestCase &B) {
|
||||
// Emit bit tests and jumps
|
||||
SDOperand SwitchVal = DAG.getCopyFromReg(getRoot(), Reg, TLI.getPointerTy());
|
||||
|
||||
SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(),
|
||||
SwitchVal,
|
||||
DAG.getConstant(B.Mask,
|
||||
TLI.getPointerTy()));
|
||||
SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultTy(), AndOp,
|
||||
DAG.getConstant(0, TLI.getPointerTy()),
|
||||
ISD::SETNE);
|
||||
SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(),
|
||||
AndCmp, DAG.getBasicBlock(B.TargetBB));
|
||||
|
||||
// Set NextBlock to be the MBB immediately after the current one, if any.
|
||||
// This is used to avoid emitting unnecessary branches to the next block.
|
||||
MachineBasicBlock *NextBlock = 0;
|
||||
MachineFunction::iterator BBI = CurMBB;
|
||||
if (++BBI != CurMBB->getParent()->end())
|
||||
NextBlock = BBI;
|
||||
|
||||
if (NextMBB == NextBlock)
|
||||
DAG.setRoot(BrAnd);
|
||||
else
|
||||
DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd,
|
||||
DAG.getBasicBlock(NextMBB)));
|
||||
|
||||
CurMBB->addSuccessor(B.TargetBB);
|
||||
CurMBB->addSuccessor(NextMBB);
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
void SelectionDAGLowering::visitInvoke(InvokeInst &I) {
|
||||
assert(0 && "Should never be visited directly");
|
||||
@ -1273,7 +1385,7 @@ bool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR,
|
||||
|
||||
// Size is the number of Cases represented by this range.
|
||||
unsigned Size = CR.Range.second - CR.Range.first;
|
||||
if (Size >=3)
|
||||
if (Size > 3)
|
||||
return false;
|
||||
|
||||
// Get the MachineFunction which holds the current MBB. This is used when
|
||||
@ -1354,9 +1466,6 @@ bool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR,
|
||||
Case& FrontCase = *CR.Range.first;
|
||||
Case& BackCase = *(CR.Range.second-1);
|
||||
|
||||
// Size is the number of Cases represented by this range.
|
||||
unsigned Size = CR.Range.second - CR.Range.first;
|
||||
|
||||
int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue();
|
||||
int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue();
|
||||
|
||||
@ -1367,7 +1476,7 @@ bool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR,
|
||||
|
||||
if ((!TLI.isOperationLegal(ISD::BR_JT, MVT::Other) &&
|
||||
!TLI.isOperationLegal(ISD::BRIND, MVT::Other)) ||
|
||||
Size <= 5)
|
||||
TSize <= 3)
|
||||
return false;
|
||||
|
||||
double Density = (double)TSize / (double)((Last - First) + 1ULL);
|
||||
@ -1376,7 +1485,7 @@ bool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR,
|
||||
|
||||
DOUT << "Lowering jump table\n"
|
||||
<< "First entry: " << First << ". Last entry: " << Last << "\n"
|
||||
<< "Size: " << TSize << ". Density: " << Density << "\n";
|
||||
<< "Size: " << TSize << ". Density: " << Density << "\n\n";
|
||||
|
||||
// Get the MachineFunction which holds the current MBB. This is used when
|
||||
// inserting any additional MBBs necessary to represent the switch.
|
||||
@ -1472,7 +1581,7 @@ bool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR,
|
||||
|
||||
int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue();
|
||||
int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue();
|
||||
double Density = 0;
|
||||
double FMetric = 0;
|
||||
CaseItr Pivot = CR.Range.first + Size/2;
|
||||
|
||||
// Select optimal pivot, maximizing sum density of LHS and RHS. This will
|
||||
@ -1484,20 +1593,33 @@ bool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR,
|
||||
|
||||
uint64_t LSize = FrontCase.size();
|
||||
uint64_t RSize = TSize-LSize;
|
||||
DOUT << "Selecting best pivot: \n"
|
||||
<< "First: " << First << ", Last: " << Last <<"\n"
|
||||
<< "LSize: " << LSize << ", RSize: " << RSize << "\n";
|
||||
for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
|
||||
J!=E; ++I, ++J) {
|
||||
int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue();
|
||||
int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue();
|
||||
assert((RBegin-LEnd>=1) && "Invalid case distance");
|
||||
double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL);
|
||||
double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL);
|
||||
if (Density < (LDensity + RDensity)) {
|
||||
double Metric = log(RBegin-LEnd)*(LDensity+RDensity);
|
||||
// Should always split in some non-trivial place
|
||||
DOUT <<"=>Step\n"
|
||||
<< "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n"
|
||||
<< "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n"
|
||||
<< "Metric: " << Metric << "\n";
|
||||
if (FMetric < Metric) {
|
||||
Pivot = J;
|
||||
Density = LDensity + RDensity;
|
||||
FMetric = Metric;
|
||||
DOUT << "Current metric set to: " << FMetric << "\n";
|
||||
}
|
||||
|
||||
LSize += J->size();
|
||||
RSize -= J->size();
|
||||
}
|
||||
// If our case is dense we *really* should handle it earlier!
|
||||
assert((FMetric != 0) && "Should handle dense range earlier!");
|
||||
|
||||
CaseRange LHSR(CR.Range.first, Pivot);
|
||||
CaseRange RHSR(Pivot, CR.Range.second);
|
||||
@ -1549,6 +1671,130 @@ bool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR,
|
||||
return true;
|
||||
}
|
||||
|
||||
/// handleBitTestsSwitchCase - if current case range has few destination and
|
||||
/// range span less, than machine word bitwidth, encode case range into series
|
||||
/// of masks and emit bit tests with these masks.
|
||||
bool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR,
|
||||
CaseRecVector& WorkList,
|
||||
Value* SV,
|
||||
MachineBasicBlock* Default) {
|
||||
unsigned IntPtrBits = getSizeInBits(TLI.getPointerTy());
|
||||
|
||||
Case& FrontCase = *CR.Range.first;
|
||||
Case& BackCase = *(CR.Range.second-1);
|
||||
|
||||
// Get the MachineFunction which holds the current MBB. This is used when
|
||||
// inserting any additional MBBs necessary to represent the switch.
|
||||
MachineFunction *CurMF = CurMBB->getParent();
|
||||
|
||||
unsigned numCmps = 0;
|
||||
for (CaseItr I = CR.Range.first, E = CR.Range.second;
|
||||
I!=E; ++I) {
|
||||
// Single case counts one, case range - two.
|
||||
if (I->Low == I->High)
|
||||
numCmps +=1;
|
||||
else
|
||||
numCmps +=2;
|
||||
}
|
||||
|
||||
// Count unique destinations
|
||||
SmallSet<MachineBasicBlock*, 4> Dests;
|
||||
for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
|
||||
Dests.insert(I->BB);
|
||||
if (Dests.size() > 3)
|
||||
// Don't bother the code below, if there are too much unique destinations
|
||||
return false;
|
||||
}
|
||||
DOUT << "Total number of unique destinations: " << Dests.size() << "\n"
|
||||
<< "Total number of comparisons: " << numCmps << "\n";
|
||||
|
||||
// Compute span of values.
|
||||
Constant* minValue = FrontCase.Low;
|
||||
Constant* maxValue = BackCase.High;
|
||||
uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() -
|
||||
cast<ConstantInt>(minValue)->getSExtValue();
|
||||
DOUT << "Compare range: " << range << "\n"
|
||||
<< "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n"
|
||||
<< "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n";
|
||||
|
||||
if (range>IntPtrBits ||
|
||||
(!(Dests.size() == 1 && numCmps >= 3) &&
|
||||
!(Dests.size() == 2 && numCmps >= 5) &&
|
||||
!(Dests.size() >= 3 && numCmps >= 6)))
|
||||
return false;
|
||||
|
||||
DOUT << "Emitting bit tests\n";
|
||||
int64_t lowBound = 0;
|
||||
|
||||
// Optimize the case where all the case values fit in a
|
||||
// word without having to subtract minValue. In this case,
|
||||
// we can optimize away the subtraction.
|
||||
if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 &&
|
||||
cast<ConstantInt>(maxValue)->getSExtValue() <= IntPtrBits) {
|
||||
range = cast<ConstantInt>(maxValue)->getSExtValue();
|
||||
} else {
|
||||
lowBound = cast<ConstantInt>(minValue)->getSExtValue();
|
||||
}
|
||||
|
||||
CaseBitsVector CasesBits;
|
||||
unsigned i, count = 0;
|
||||
|
||||
for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) {
|
||||
MachineBasicBlock* Dest = I->BB;
|
||||
for (i = 0; i < count; ++i)
|
||||
if (Dest == CasesBits[i].BB)
|
||||
break;
|
||||
|
||||
if (i == count) {
|
||||
assert((count < 3) && "Too much destinations to test!");
|
||||
CasesBits.push_back(CaseBits(0, Dest, 0));
|
||||
count++;
|
||||
}
|
||||
|
||||
uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound;
|
||||
uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound;
|
||||
|
||||
for (uint64_t j = lo; j <= hi; j++) {
|
||||
CasesBits[i].Mask |= 1 << j;
|
||||
CasesBits[i].Bits++;
|
||||
}
|
||||
|
||||
}
|
||||
std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp());
|
||||
|
||||
SelectionDAGISel::BitTestInfo BTC;
|
||||
|
||||
// Figure out which block is immediately after the current one.
|
||||
MachineFunction::iterator BBI = CR.CaseBB;
|
||||
++BBI;
|
||||
|
||||
const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
|
||||
|
||||
DOUT << "Cases:\n";
|
||||
for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
|
||||
DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits
|
||||
<< ", BB: " << CasesBits[i].BB << "\n";
|
||||
|
||||
MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB);
|
||||
CurMF->getBasicBlockList().insert(BBI, CaseBB);
|
||||
BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask,
|
||||
CaseBB,
|
||||
CasesBits[i].BB));
|
||||
}
|
||||
|
||||
SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV,
|
||||
-1ULL, (CR.CaseBB == CurMBB),
|
||||
CR.CaseBB, Default, BTC);
|
||||
|
||||
if (CR.CaseBB == CurMBB)
|
||||
visitBitTestHeader(BTB);
|
||||
|
||||
BitTestCases.push_back(BTB);
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
// Clusterify - Transform simple list of Cases into list of CaseRange's
|
||||
unsigned SelectionDAGLowering::Clusterify(CaseVector& Cases,
|
||||
const SwitchInst& SI) {
|
||||
@ -1633,12 +1879,15 @@ void SelectionDAGLowering::visitSwitch(SwitchInst &SI) {
|
||||
CaseRec CR = WorkList.back();
|
||||
WorkList.pop_back();
|
||||
|
||||
if (handleBitTestsSwitchCase(CR, WorkList, SV, Default))
|
||||
continue;
|
||||
|
||||
// If the range has few cases (two or less) emit a series of specific
|
||||
// tests.
|
||||
if (handleSmallSwitchRange(CR, WorkList, SV, Default))
|
||||
continue;
|
||||
|
||||
// If the switch has more than 5 blocks, and at least 31.25% dense, and the
|
||||
// If the switch has more than 5 blocks, and at least 40% dense, and the
|
||||
// target supports indirect branches, then emit a jump table rather than
|
||||
// lowering the switch to a binary tree of conditional branches.
|
||||
if (handleJTSwitchCase(CR, WorkList, SV, Default))
|
||||
@ -4244,6 +4493,8 @@ void SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB,
|
||||
SwitchCases = SDL.SwitchCases;
|
||||
JTCases.clear();
|
||||
JTCases = SDL.JTCases;
|
||||
BitTestCases.clear();
|
||||
BitTestCases = SDL.BitTestCases;
|
||||
|
||||
// Make sure the root of the DAG is up-to-date.
|
||||
DAG.setRoot(SDL.getRoot());
|
||||
@ -4294,9 +4545,15 @@ void SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF,
|
||||
CodeGenAndEmitDAG(DAG);
|
||||
}
|
||||
|
||||
DOUT << "Total amount of phi nodes to update: "
|
||||
<< PHINodesToUpdate.size() << "\n";
|
||||
DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i)
|
||||
DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first
|
||||
<< ", " << PHINodesToUpdate[i].second << ")\n";);
|
||||
|
||||
// Next, now that we know what the last MBB the LLVM BB expanded is, update
|
||||
// PHI nodes in successors.
|
||||
if (SwitchCases.empty() && JTCases.empty()) {
|
||||
if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) {
|
||||
for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) {
|
||||
MachineInstr *PHI = PHINodesToUpdate[i].first;
|
||||
assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
|
||||
@ -4307,6 +4564,68 @@ void SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF,
|
||||
return;
|
||||
}
|
||||
|
||||
for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) {
|
||||
// Lower header first, if it wasn't already lowered
|
||||
if (!BitTestCases[i].Emitted) {
|
||||
SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>());
|
||||
CurDAG = &HSDAG;
|
||||
SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo);
|
||||
// Set the current basic block to the mbb we wish to insert the code into
|
||||
BB = BitTestCases[i].Parent;
|
||||
HSDL.setCurrentBasicBlock(BB);
|
||||
// Emit the code
|
||||
HSDL.visitBitTestHeader(BitTestCases[i]);
|
||||
HSDAG.setRoot(HSDL.getRoot());
|
||||
CodeGenAndEmitDAG(HSDAG);
|
||||
}
|
||||
|
||||
for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) {
|
||||
SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>());
|
||||
CurDAG = &BSDAG;
|
||||
SelectionDAGLowering BSDL(BSDAG, TLI, FuncInfo);
|
||||
// Set the current basic block to the mbb we wish to insert the code into
|
||||
BB = BitTestCases[i].Cases[j].ThisBB;
|
||||
BSDL.setCurrentBasicBlock(BB);
|
||||
// Emit the code
|
||||
if (j+1 != ej)
|
||||
BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB,
|
||||
BitTestCases[i].Reg,
|
||||
BitTestCases[i].Cases[j]);
|
||||
else
|
||||
BSDL.visitBitTestCase(BitTestCases[i].Default,
|
||||
BitTestCases[i].Reg,
|
||||
BitTestCases[i].Cases[j]);
|
||||
|
||||
|
||||
BSDAG.setRoot(BSDL.getRoot());
|
||||
CodeGenAndEmitDAG(BSDAG);
|
||||
}
|
||||
|
||||
// Update PHI Nodes
|
||||
for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) {
|
||||
MachineInstr *PHI = PHINodesToUpdate[pi].first;
|
||||
MachineBasicBlock *PHIBB = PHI->getParent();
|
||||
assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
|
||||
"This is not a machine PHI node that we are updating!");
|
||||
// This is "default" BB. We have two jumps to it. From "header" BB and
|
||||
// from last "case" BB.
|
||||
if (PHIBB == BitTestCases[i].Default) {
|
||||
PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
|
||||
PHI->addMachineBasicBlockOperand(BitTestCases[i].Parent);
|
||||
PHI->addMachineBasicBlockOperand(BitTestCases[i].Cases.back().ThisBB);
|
||||
}
|
||||
// One of "cases" BB.
|
||||
for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) {
|
||||
MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB;
|
||||
if (cBB->succ_end() !=
|
||||
std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) {
|
||||
PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
|
||||
PHI->addMachineBasicBlockOperand(cBB);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// If the JumpTable record is filled in, then we need to emit a jump table.
|
||||
// Updating the PHI nodes is tricky in this case, since we need to determine
|
||||
// whether the PHI is a successor of the range check MBB or the jump table MBB
|
||||
@ -4342,10 +4661,12 @@ void SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF,
|
||||
MachineBasicBlock *PHIBB = PHI->getParent();
|
||||
assert(PHI->getOpcode() == TargetInstrInfo::PHI &&
|
||||
"This is not a machine PHI node that we are updating!");
|
||||
// "default" BB. We can go there only from header BB.
|
||||
if (PHIBB == JTCases[i].second.Default) {
|
||||
PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
|
||||
PHI->addMachineBasicBlockOperand(JTCases[i].first.HeaderBB);
|
||||
}
|
||||
// JT BB. Just iterate over successors here
|
||||
if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) {
|
||||
PHI->addRegOperand(PHINodesToUpdate[pi].second, false);
|
||||
PHI->addMachineBasicBlockOperand(BB);
|
||||
|
||||
@ -2,7 +2,7 @@
|
||||
; RUN: llvm-as < %s | llc | grep jmp | wc -l | grep 0
|
||||
; PR 1200
|
||||
|
||||
; ModuleID = 'bugpoint.test.bc'
|
||||
; ModuleID = '<stdin>'
|
||||
target datalayout = "e-p:32:32"
|
||||
target triple = "i686-apple-darwin8"
|
||||
%struct.FILE = type { i8*, i32, i32, i16, i16, %struct.__sbuf, i32, i8*, i32 (i8*)*, i32 (i8*, i8*, i32)*, i64 (i8*, i64, i32)*, i32 (i8*, i8*, i32)*, %struct.__sbuf, %struct.__sFILEX*, i32, [3 x i8], [1 x i8], %struct.__sbuf, i32, i64 }
|
||||
@ -25,30 +25,32 @@ target triple = "i686-apple-darwin8"
|
||||
@outfile = external global %struct.FILE* ; <%struct.FILE**> [#uses=1]
|
||||
@str1 = external global [11 x i8] ; <[11 x i8]*> [#uses=1]
|
||||
|
||||
|
||||
declare i32 @fprintf(%struct.FILE*, i8*, ...)
|
||||
|
||||
define i16 @main_bb_2E_i9_2E_i_2E_i932_2E_ce(%struct.list* %l_addr.01.0.i2.i.i929, %struct.operator** %tmp66.i62.i.out) {
|
||||
newFuncRoot:
|
||||
br label %bb.i9.i.i932.ce
|
||||
|
||||
bb36.i.i.exitStub: ; preds = %bb.i9.i.i932.ce
|
||||
NewDefault: ; preds = %LeafBlock, %LeafBlock1, %LeafBlock2, %LeafBlock3
|
||||
br label %bb36.i.i.exitStub
|
||||
|
||||
bb36.i.i.exitStub: ; preds = %NewDefault
|
||||
store %struct.operator* %tmp66.i62.i, %struct.operator** %tmp66.i62.i.out
|
||||
ret i16 0
|
||||
|
||||
bb.i14.i.exitStub: ; preds = %bb.i9.i.i932.ce
|
||||
bb.i14.i.exitStub: ; preds = %LeafBlock
|
||||
store %struct.operator* %tmp66.i62.i, %struct.operator** %tmp66.i62.i.out
|
||||
ret i16 1
|
||||
|
||||
bb12.i.i935.exitStub: ; preds = %bb.i9.i.i932.ce
|
||||
bb12.i.i935.exitStub: ; preds = %LeafBlock1
|
||||
store %struct.operator* %tmp66.i62.i, %struct.operator** %tmp66.i62.i.out
|
||||
ret i16 2
|
||||
|
||||
bb20.i.i937.exitStub: ; preds = %bb.i9.i.i932.ce
|
||||
bb20.i.i937.exitStub: ; preds = %LeafBlock2
|
||||
store %struct.operator* %tmp66.i62.i, %struct.operator** %tmp66.i62.i.out
|
||||
ret i16 3
|
||||
|
||||
bb28.i.i938.exitStub: ; preds = %bb.i9.i.i932.ce
|
||||
bb28.i.i938.exitStub: ; preds = %LeafBlock3
|
||||
store %struct.operator* %tmp66.i62.i, %struct.operator** %tmp66.i62.i.out
|
||||
ret i16 4
|
||||
|
||||
@ -61,11 +63,34 @@ bb.i9.i.i932.ce: ; preds = %newFuncRoot
|
||||
%tmp3.i8.i = load %struct.FILE** @outfile ; <%struct.FILE*> [#uses=1]
|
||||
%tmp5.i9.i = call i32 (%struct.FILE*, i8*, ...)* @fprintf( %struct.FILE* %tmp3.i8.i, i8* getelementptr ([11 x i8]* @str1, i32 0, i32 0), i32 %tmp2.i7.i ) ; <i32> [#uses=0]
|
||||
%tmp7.i10.i = getelementptr %struct.operator* %tmp66.i62.i, i32 0, i32 5 ; <i32*> [#uses=1]
|
||||
%tmp8.i11.i = load i32* %tmp7.i10.i ; <i32> [#uses=1]
|
||||
switch i32 %tmp8.i11.i, label %bb36.i.i.exitStub [
|
||||
i32 -1, label %bb.i14.i.exitStub
|
||||
i32 0, label %bb12.i.i935.exitStub
|
||||
i32 1, label %bb20.i.i937.exitStub
|
||||
i32 2, label %bb28.i.i938.exitStub
|
||||
]
|
||||
%tmp8.i11.i = load i32* %tmp7.i10.i ; <i32> [#uses=7]
|
||||
br label %NodeBlock5
|
||||
|
||||
NodeBlock5: ; preds = %bb.i9.i.i932.ce
|
||||
icmp slt i32 %tmp8.i11.i, 1 ; <i1>:0 [#uses=1]
|
||||
br i1 %0, label %NodeBlock, label %NodeBlock4
|
||||
|
||||
NodeBlock4: ; preds = %NodeBlock5
|
||||
icmp slt i32 %tmp8.i11.i, 2 ; <i1>:1 [#uses=1]
|
||||
br i1 %1, label %LeafBlock2, label %LeafBlock3
|
||||
|
||||
LeafBlock3: ; preds = %NodeBlock4
|
||||
icmp eq i32 %tmp8.i11.i, 2 ; <i1>:2 [#uses=1]
|
||||
br i1 %2, label %bb28.i.i938.exitStub, label %NewDefault
|
||||
|
||||
LeafBlock2: ; preds = %NodeBlock4
|
||||
icmp eq i32 %tmp8.i11.i, 1 ; <i1>:3 [#uses=1]
|
||||
br i1 %3, label %bb20.i.i937.exitStub, label %NewDefault
|
||||
|
||||
NodeBlock: ; preds = %NodeBlock5
|
||||
icmp slt i32 %tmp8.i11.i, 0 ; <i1>:4 [#uses=1]
|
||||
br i1 %4, label %LeafBlock, label %LeafBlock1
|
||||
|
||||
LeafBlock1: ; preds = %NodeBlock
|
||||
icmp eq i32 %tmp8.i11.i, 0 ; <i1>:5 [#uses=1]
|
||||
br i1 %5, label %bb12.i.i935.exitStub, label %NewDefault
|
||||
|
||||
LeafBlock: ; preds = %NodeBlock
|
||||
icmp eq i32 %tmp8.i11.i, -1 ; <i1>:6 [#uses=1]
|
||||
br i1 %6, label %bb.i14.i.exitStub, label %NewDefault
|
||||
}
|
||||
|
||||
@ -1,10 +1,7 @@
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep \$7 | wc -l | grep 1 &&
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep \$6 | wc -l | grep 1 &&
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep 1024 | wc -l | grep 1 &&
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep 1023 | wc -l | grep 1 &&
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep jg | wc -l | grep 1 &&
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep jb | wc -l | grep 1 &&
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep jae | wc -l | grep 1 &&
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep jb | wc -l | grep 2 &&
|
||||
; RUN: llvm-as < %s | llc -march=x86 -o - | grep je | wc -l | grep 1
|
||||
|
||||
define i32 @main(i32 %tmp158) {
|
||||
|
||||
Loading…
Reference in New Issue
Block a user