forked from OSchip/llvm-project
[LoopUnrollAnalyzer] Fix a crash in analyzeLoopUnrollCost.
Condition might be simplified to a Constant, but it doesn't have to be ConstantInt, so we should dyn_cast, instead of cast. This fixes PR27886. llvm-svn: 270924
This commit is contained in:
parent
7509d54b21
commit
1ecdedad8d
|
@ -464,41 +464,37 @@ analyzeLoopUnrollCost(const Loop *L, unsigned TripCount, DominatorTree &DT,
|
|||
|
||||
// Add in the live successors by first checking whether we have terminator
|
||||
// that may be simplified based on the values simplified by this call.
|
||||
BasicBlock *KnownSucc = nullptr;
|
||||
if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
|
||||
if (BI->isConditional()) {
|
||||
if (Constant *SimpleCond =
|
||||
SimplifiedValues.lookup(BI->getCondition())) {
|
||||
BasicBlock *Succ = nullptr;
|
||||
// Just take the first successor if condition is undef
|
||||
if (isa<UndefValue>(SimpleCond))
|
||||
Succ = BI->getSuccessor(0);
|
||||
else
|
||||
Succ = BI->getSuccessor(
|
||||
cast<ConstantInt>(SimpleCond)->isZero() ? 1 : 0);
|
||||
if (L->contains(Succ))
|
||||
BBWorklist.insert(Succ);
|
||||
else
|
||||
ExitWorklist.insert({BB, Succ});
|
||||
continue;
|
||||
KnownSucc = BI->getSuccessor(0);
|
||||
else if (ConstantInt *SimpleCondVal =
|
||||
dyn_cast<ConstantInt>(SimpleCond))
|
||||
KnownSucc = BI->getSuccessor(SimpleCondVal->isZero() ? 1 : 0);
|
||||
}
|
||||
}
|
||||
} else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
|
||||
if (Constant *SimpleCond =
|
||||
SimplifiedValues.lookup(SI->getCondition())) {
|
||||
BasicBlock *Succ = nullptr;
|
||||
// Just take the first successor if condition is undef
|
||||
if (isa<UndefValue>(SimpleCond))
|
||||
Succ = SI->getSuccessor(0);
|
||||
else
|
||||
Succ = SI->findCaseValue(cast<ConstantInt>(SimpleCond))
|
||||
.getCaseSuccessor();
|
||||
if (L->contains(Succ))
|
||||
BBWorklist.insert(Succ);
|
||||
else
|
||||
ExitWorklist.insert({BB, Succ});
|
||||
continue;
|
||||
KnownSucc = SI->getSuccessor(0);
|
||||
else if (ConstantInt *SimpleCondVal =
|
||||
dyn_cast<ConstantInt>(SimpleCond))
|
||||
KnownSucc = SI->findCaseValue(SimpleCondVal).getCaseSuccessor();
|
||||
}
|
||||
}
|
||||
if (KnownSucc) {
|
||||
if (L->contains(KnownSucc))
|
||||
BBWorklist.insert(KnownSucc);
|
||||
else
|
||||
ExitWorklist.insert({BB, KnownSucc});
|
||||
continue;
|
||||
}
|
||||
|
||||
// Add BB's successors to the worklist.
|
||||
for (BasicBlock *Succ : successors(BB))
|
||||
|
|
|
@ -137,3 +137,33 @@ for.body:
|
|||
exit:
|
||||
ret void
|
||||
}
|
||||
|
||||
@i = external global i32, align 4
|
||||
|
||||
define void @folded_not_to_constantint() {
|
||||
entry:
|
||||
br label %for.body
|
||||
|
||||
for.body:
|
||||
%iv = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
|
||||
%m = phi i32* [ @i, %entry ], [ %m, %for.inc ]
|
||||
br i1 undef, label %if.else, label %if.then
|
||||
|
||||
if.then:
|
||||
unreachable
|
||||
|
||||
if.else:
|
||||
%cmp = icmp ult i32* %m, null
|
||||
br i1 %cmp, label %cond.false, label %for.inc
|
||||
|
||||
cond.false:
|
||||
unreachable
|
||||
|
||||
for.inc:
|
||||
%inc = add nuw nsw i32 %iv, 1
|
||||
%cmp2 = icmp ult i32 %inc, 10
|
||||
br i1 %cmp2, label %for.body, label %for.end
|
||||
|
||||
for.end:
|
||||
ret void
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue