mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-11-02 07:17:36 +00:00
Prefer non-virtual calls to ConstantInt::isZero over virtual calls to
Constant::isNullValue() in situations where it is possible. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@34821 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -139,7 +139,7 @@ void CondProp::SimplifyPredecessors(BranchInst *BI) {
|
||||
// ultimate destination.
|
||||
bool PHIGone = PN->getNumIncomingValues() == 2;
|
||||
RevectorBlockTo(PN->getIncomingBlock(i-1),
|
||||
BI->getSuccessor(CB->isNullValue()));
|
||||
BI->getSuccessor(CB->isZero()));
|
||||
++NumBrThread;
|
||||
|
||||
// If there were two predecessors before this simplification, the PHI node
|
||||
|
||||
@@ -178,9 +178,9 @@ void IndVarSimplify::EliminatePointerRecurrence(PHINode *PN,
|
||||
Constant *NCE = ConstantExpr::getGetElementPtr(CE->getOperand(0),
|
||||
&CEIdxs[0],
|
||||
CEIdxs.size());
|
||||
GetElementPtrInst *NGEPI =
|
||||
new GetElementPtrInst(NCE, Constant::getNullValue(Type::Int32Ty),
|
||||
NewAdd, GEPI->getName(), GEPI);
|
||||
GetElementPtrInst *NGEPI = new GetElementPtrInst(
|
||||
NCE, Constant::getNullValue(Type::Int32Ty), NewAdd,
|
||||
GEPI->getName(), GEPI);
|
||||
GEPI->replaceAllUsesWith(NGEPI);
|
||||
GEPI->eraseFromParent();
|
||||
GEPI = NGEPI;
|
||||
|
||||
@@ -540,7 +540,7 @@ Value *BasedUser::InsertCodeForBaseAtPosition(const SCEVHandle &NewBase,
|
||||
|
||||
// If there is no immediate value, skip the next part.
|
||||
if (SCEVConstant *SC = dyn_cast<SCEVConstant>(Imm))
|
||||
if (SC->getValue()->isNullValue())
|
||||
if (SC->getValue()->isZero())
|
||||
return Rewriter.expandCodeFor(NewBase, BaseInsertPt,
|
||||
OperandValToReplace->getType());
|
||||
|
||||
@@ -779,7 +779,7 @@ static void SeparateSubExprs(std::vector<SCEVHandle> &SubExprs,
|
||||
SeparateSubExprs(SubExprs, SARE->getOperand(0));
|
||||
}
|
||||
} else if (!isa<SCEVConstant>(Expr) ||
|
||||
!cast<SCEVConstant>(Expr)->getValue()->isNullValue()) {
|
||||
!cast<SCEVConstant>(Expr)->getValue()->isZero()) {
|
||||
// Do not add zero.
|
||||
SubExprs.push_back(Expr);
|
||||
}
|
||||
@@ -869,7 +869,7 @@ RemoveCommonExpressionsFromUseBases(std::vector<BasedUser> &Uses) {
|
||||
///
|
||||
static bool isZero(SCEVHandle &V) {
|
||||
if (SCEVConstant *SC = dyn_cast<SCEVConstant>(V))
|
||||
return SC->getValue()->getZExtValue() == 0;
|
||||
return SC->getValue()->isZero();
|
||||
return false;
|
||||
}
|
||||
|
||||
@@ -883,17 +883,18 @@ unsigned LoopStrengthReduce::CheckForIVReuse(const SCEVHandle &Stride,
|
||||
if (!TLI) return 0;
|
||||
|
||||
if (SCEVConstant *SC = dyn_cast<SCEVConstant>(Stride)) {
|
||||
int64_t SInt = SC->getValue()->getSExtValue();
|
||||
if (SInt == 1) return 0;
|
||||
const APInt &SInt = SC->getValue()->getValue();
|
||||
if (SInt == 1)
|
||||
return 0;
|
||||
|
||||
for (TargetLowering::legal_am_scale_iterator
|
||||
I = TLI->legal_am_scale_begin(), E = TLI->legal_am_scale_end();
|
||||
I != E; ++I) {
|
||||
unsigned Scale = *I;
|
||||
if (unsigned(abs(SInt)) < Scale || (SInt % Scale) != 0)
|
||||
APInt Scale(SInt.getBitWidth(), *I);
|
||||
if (SInt.abs().ult(Scale) || SInt.srem(Scale) != 0)
|
||||
continue;
|
||||
std::map<SCEVHandle, IVsOfOneStride>::iterator SI =
|
||||
IVsByStride.find(SCEVUnknown::getIntegerSCEV(SInt/Scale, UIntPtrTy));
|
||||
IVsByStride.find(SCEVUnknown::getIntegerSCEV(SInt.sdiv(Scale)));
|
||||
if (SI == IVsByStride.end())
|
||||
continue;
|
||||
for (std::vector<IVExpr>::iterator II = SI->second.IVs.begin(),
|
||||
@@ -902,7 +903,7 @@ unsigned LoopStrengthReduce::CheckForIVReuse(const SCEVHandle &Stride,
|
||||
// Only reuse previous IV if it would not require a type conversion.
|
||||
if (isZero(II->Base) && II->Base->getType() == Ty) {
|
||||
IV = *II;
|
||||
return Scale;
|
||||
return Scale.getZExtValue();
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -1148,14 +1149,14 @@ void LoopStrengthReduce::StrengthReduceStridedIVUsers(const SCEVHandle &Stride,
|
||||
// are reusing an IV, it has not been used to initialize the PHI node.
|
||||
// Add it to the expression used to rewrite the uses.
|
||||
if (!isa<ConstantInt>(CommonBaseV) ||
|
||||
!cast<ConstantInt>(CommonBaseV)->isNullValue())
|
||||
!cast<ConstantInt>(CommonBaseV)->isZero())
|
||||
RewriteExpr = SCEVAddExpr::get(RewriteExpr,
|
||||
SCEVUnknown::get(CommonBaseV));
|
||||
}
|
||||
|
||||
// Now that we know what we need to do, insert code before User for the
|
||||
// immediate and any loop-variant expressions.
|
||||
if (!isa<ConstantInt>(BaseV) || !cast<ConstantInt>(BaseV)->isNullValue())
|
||||
if (!isa<ConstantInt>(BaseV) || !cast<ConstantInt>(BaseV)->isZero())
|
||||
// Add BaseV to the PHI value if needed.
|
||||
RewriteExpr = SCEVAddExpr::get(RewriteExpr, SCEVUnknown::get(BaseV));
|
||||
|
||||
@@ -1257,14 +1258,17 @@ namespace {
|
||||
SCEVConstant *LHSC = dyn_cast<SCEVConstant>(LHS);
|
||||
SCEVConstant *RHSC = dyn_cast<SCEVConstant>(RHS);
|
||||
if (LHSC && RHSC) {
|
||||
int64_t LV = LHSC->getValue()->getSExtValue();
|
||||
int64_t RV = RHSC->getValue()->getSExtValue();
|
||||
uint64_t ALV = (LV < 0) ? -LV : LV;
|
||||
uint64_t ARV = (RV < 0) ? -RV : RV;
|
||||
APInt LV(LHSC->getValue()->getValue());
|
||||
APInt RV(RHSC->getValue()->getValue());
|
||||
uint32_t MaxWidth = std::max(LV.getBitWidth(), RV.getBitWidth());
|
||||
LV.sextOrTrunc(MaxWidth);
|
||||
RV.sextOrTrunc(MaxWidth);
|
||||
APInt ALV(LV.abs());
|
||||
APInt ARV(RV.abs());
|
||||
if (ALV == ARV)
|
||||
return LV > RV;
|
||||
return LV.sgt(RV);
|
||||
else
|
||||
return ALV < ARV;
|
||||
return ALV.ult(ARV);
|
||||
}
|
||||
return (LHSC && !RHSC);
|
||||
}
|
||||
|
||||
@@ -536,7 +536,7 @@ Value *Reassociate::OptimizeExpression(BinaryOperator *I,
|
||||
switch (Opcode) {
|
||||
default: break;
|
||||
case Instruction::And:
|
||||
if (CstVal->isNullValue()) { // ... & 0 -> 0
|
||||
if (CstVal->isZero()) { // ... & 0 -> 0
|
||||
++NumAnnihil;
|
||||
return CstVal;
|
||||
} else if (CstVal->isAllOnesValue()) { // ... & -1 -> ...
|
||||
@@ -544,10 +544,10 @@ Value *Reassociate::OptimizeExpression(BinaryOperator *I,
|
||||
}
|
||||
break;
|
||||
case Instruction::Mul:
|
||||
if (CstVal->isNullValue()) { // ... * 0 -> 0
|
||||
if (CstVal->isZero()) { // ... * 0 -> 0
|
||||
++NumAnnihil;
|
||||
return CstVal;
|
||||
} else if (cast<ConstantInt>(CstVal)->isUnitValue()) {
|
||||
} else if (cast<ConstantInt>(CstVal)->isOne()) {
|
||||
Ops.pop_back(); // ... * 1 -> ...
|
||||
}
|
||||
break;
|
||||
@@ -559,7 +559,7 @@ Value *Reassociate::OptimizeExpression(BinaryOperator *I,
|
||||
// FALLTHROUGH!
|
||||
case Instruction::Add:
|
||||
case Instruction::Xor:
|
||||
if (CstVal->isNullValue()) // ... [|^+] 0 -> ...
|
||||
if (CstVal->isZero()) // ... [|^+] 0 -> ...
|
||||
Ops.pop_back();
|
||||
break;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user