mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-07-22 07:24:47 +00:00
Refactor code into a separate method.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41826 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -89,6 +89,13 @@ namespace {
|
|||||||
};
|
};
|
||||||
|
|
||||||
private:
|
private:
|
||||||
|
|
||||||
|
// safeIcmpInst - CI is considered safe instruction if one of the operand
|
||||||
|
// is SCEVAddRecExpr based on induction variable and other operand is
|
||||||
|
// loop invariant. If CI is safe then populate SplitInfo object SD appropriately
|
||||||
|
// and return true;
|
||||||
|
bool safeICmpInst(ICmpInst *CI, SplitInfo &SD);
|
||||||
|
|
||||||
/// Find condition inside a loop that is suitable candidate for index split.
|
/// Find condition inside a loop that is suitable candidate for index split.
|
||||||
void findSplitCondition();
|
void findSplitCondition();
|
||||||
|
|
||||||
@@ -411,37 +418,49 @@ void LoopIndexSplit::findSplitCondition() {
|
|||||||
|
|
||||||
// If one operand is loop invariant and second operand is SCEVAddRecExpr
|
// If one operand is loop invariant and second operand is SCEVAddRecExpr
|
||||||
// based on induction variable then CI is a candidate split condition.
|
// based on induction variable then CI is a candidate split condition.
|
||||||
Value *V0 = CI->getOperand(0);
|
if (safeICmpInst(CI, SD))
|
||||||
Value *V1 = CI->getOperand(1);
|
SplitData.push_back(SD);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
SCEVHandle SH0 = SE->getSCEV(V0);
|
// safeIcmpInst - CI is considered safe instruction if one of the operand
|
||||||
SCEVHandle SH1 = SE->getSCEV(V1);
|
// is SCEVAddRecExpr based on induction variable and other operand is
|
||||||
|
// loop invariant. If CI is safe then populate SplitInfo object SD appropriately
|
||||||
|
// and return true;
|
||||||
|
bool LoopIndexSplit::safeICmpInst(ICmpInst *CI, SplitInfo &SD) {
|
||||||
|
|
||||||
if (SH0->isLoopInvariant(L) && isa<SCEVAddRecExpr>(SH1)) {
|
Value *V0 = CI->getOperand(0);
|
||||||
SD.SplitValue = V0;
|
Value *V1 = CI->getOperand(1);
|
||||||
SD.SplitCondition = CI;
|
|
||||||
if (PHINode *PN = dyn_cast<PHINode>(V1)) {
|
SCEVHandle SH0 = SE->getSCEV(V0);
|
||||||
if (PN == IndVar)
|
SCEVHandle SH1 = SE->getSCEV(V1);
|
||||||
SplitData.push_back(SD);
|
|
||||||
}
|
if (SH0->isLoopInvariant(L) && isa<SCEVAddRecExpr>(SH1)) {
|
||||||
else if (Instruction *Insn = dyn_cast<Instruction>(V1)) {
|
SD.SplitValue = V0;
|
||||||
if (IndVarIncrement && IndVarIncrement == Insn)
|
SD.SplitCondition = CI;
|
||||||
SplitData.push_back(SD);
|
if (PHINode *PN = dyn_cast<PHINode>(V1)) {
|
||||||
}
|
if (PN == IndVar)
|
||||||
|
return true;
|
||||||
}
|
}
|
||||||
else if (SH1->isLoopInvariant(L) && isa<SCEVAddRecExpr>(SH0)) {
|
else if (Instruction *Insn = dyn_cast<Instruction>(V1)) {
|
||||||
SD.SplitValue = V1;
|
if (IndVarIncrement && IndVarIncrement == Insn)
|
||||||
SD.SplitCondition = CI;
|
return true;
|
||||||
if (PHINode *PN = dyn_cast<PHINode>(V0)) {
|
|
||||||
if (PN == IndVar)
|
|
||||||
SplitData.push_back(SD);
|
|
||||||
}
|
|
||||||
else if (Instruction *Insn = dyn_cast<Instruction>(V0)) {
|
|
||||||
if (IndVarIncrement && IndVarIncrement == Insn)
|
|
||||||
SplitData.push_back(SD);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
else if (SH1->isLoopInvariant(L) && isa<SCEVAddRecExpr>(SH0)) {
|
||||||
|
SD.SplitValue = V1;
|
||||||
|
SD.SplitCondition = CI;
|
||||||
|
if (PHINode *PN = dyn_cast<PHINode>(V0)) {
|
||||||
|
if (PN == IndVar)
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
else if (Instruction *Insn = dyn_cast<Instruction>(V0)) {
|
||||||
|
if (IndVarIncrement && IndVarIncrement == Insn)
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// processOneIterationLoop - Current loop L contains compare instruction
|
/// processOneIterationLoop - Current loop L contains compare instruction
|
||||||
|
Reference in New Issue
Block a user