mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-10-20 09:24:58 +00:00
Add a bool to isEdgeFeasible that tells it whether to treat unknown
value as undef or untracked. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@51295 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
638e378f2c
commit
28a8dbc35f
@ -147,8 +147,12 @@ public:
|
|||||||
LatticeVal getOrInitValueState(Value *V);
|
LatticeVal getOrInitValueState(Value *V);
|
||||||
|
|
||||||
/// isEdgeFeasible - Return true if the control flow edge from the 'From'
|
/// isEdgeFeasible - Return true if the control flow edge from the 'From'
|
||||||
/// basic block to the 'To' basic block is currently feasible...
|
/// basic block to the 'To' basic block is currently feasible. If
|
||||||
bool isEdgeFeasible(BasicBlock *From, BasicBlock *To);
|
/// AggressiveUndef is true, then this treats values with unknown lattice
|
||||||
|
/// values as undefined. This is generally only useful when solving the
|
||||||
|
/// lattice, not when querying it.
|
||||||
|
bool isEdgeFeasible(BasicBlock *From, BasicBlock *To,
|
||||||
|
bool AggressiveUndef = false);
|
||||||
|
|
||||||
private:
|
private:
|
||||||
/// UpdateState - When the state for some instruction is potentially updated,
|
/// UpdateState - When the state for some instruction is potentially updated,
|
||||||
@ -165,7 +169,8 @@ private:
|
|||||||
|
|
||||||
/// getFeasibleSuccessors - Return a vector of booleans to indicate which
|
/// getFeasibleSuccessors - Return a vector of booleans to indicate which
|
||||||
/// successors are reachable from a given terminator instruction.
|
/// successors are reachable from a given terminator instruction.
|
||||||
void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
|
void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
|
||||||
|
bool AggressiveUndef);
|
||||||
|
|
||||||
void visitInst(Instruction &I);
|
void visitInst(Instruction &I);
|
||||||
void visitPHINode(PHINode &I);
|
void visitPHINode(PHINode &I);
|
||||||
|
@ -115,7 +115,8 @@ void SparseSolver::markEdgeExecutable(BasicBlock *Source, BasicBlock *Dest) {
|
|||||||
/// getFeasibleSuccessors - Return a vector of booleans to indicate which
|
/// getFeasibleSuccessors - Return a vector of booleans to indicate which
|
||||||
/// successors are reachable from a given terminator instruction.
|
/// successors are reachable from a given terminator instruction.
|
||||||
void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI,
|
void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI,
|
||||||
SmallVectorImpl<bool> &Succs) {
|
SmallVectorImpl<bool> &Succs,
|
||||||
|
bool AggressiveUndef) {
|
||||||
Succs.resize(TI.getNumSuccessors());
|
Succs.resize(TI.getNumSuccessors());
|
||||||
if (TI.getNumSuccessors() == 0) return;
|
if (TI.getNumSuccessors() == 0) return;
|
||||||
|
|
||||||
@ -125,7 +126,12 @@ void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI,
|
|||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
LatticeVal BCValue = getOrInitValueState(BI->getCondition());
|
LatticeVal BCValue;
|
||||||
|
if (AggressiveUndef)
|
||||||
|
BCValue = getOrInitValueState(BI->getCondition());
|
||||||
|
else
|
||||||
|
BCValue = getLatticeState(BI->getCondition());
|
||||||
|
|
||||||
if (BCValue == LatticeFunc->getOverdefinedVal() ||
|
if (BCValue == LatticeFunc->getOverdefinedVal() ||
|
||||||
BCValue == LatticeFunc->getUntrackedVal()) {
|
BCValue == LatticeFunc->getUntrackedVal()) {
|
||||||
// Overdefined condition variables can branch either way.
|
// Overdefined condition variables can branch either way.
|
||||||
@ -157,7 +163,12 @@ void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI,
|
|||||||
}
|
}
|
||||||
|
|
||||||
SwitchInst &SI = cast<SwitchInst>(TI);
|
SwitchInst &SI = cast<SwitchInst>(TI);
|
||||||
LatticeVal SCValue = getOrInitValueState(SI.getCondition());
|
LatticeVal SCValue;
|
||||||
|
if (AggressiveUndef)
|
||||||
|
SCValue = getOrInitValueState(SI.getCondition());
|
||||||
|
else
|
||||||
|
SCValue = getLatticeState(SI.getCondition());
|
||||||
|
|
||||||
if (SCValue == LatticeFunc->getOverdefinedVal() ||
|
if (SCValue == LatticeFunc->getOverdefinedVal() ||
|
||||||
SCValue == LatticeFunc->getUntrackedVal()) {
|
SCValue == LatticeFunc->getUntrackedVal()) {
|
||||||
// All destinations are executable!
|
// All destinations are executable!
|
||||||
@ -182,10 +193,11 @@ void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI,
|
|||||||
|
|
||||||
/// isEdgeFeasible - Return true if the control flow edge from the 'From'
|
/// isEdgeFeasible - Return true if the control flow edge from the 'From'
|
||||||
/// basic block to the 'To' basic block is currently feasible...
|
/// basic block to the 'To' basic block is currently feasible...
|
||||||
bool SparseSolver::isEdgeFeasible(BasicBlock *From, BasicBlock *To) {
|
bool SparseSolver::isEdgeFeasible(BasicBlock *From, BasicBlock *To,
|
||||||
|
bool AggressiveUndef) {
|
||||||
SmallVector<bool, 16> SuccFeasible;
|
SmallVector<bool, 16> SuccFeasible;
|
||||||
TerminatorInst *TI = From->getTerminator();
|
TerminatorInst *TI = From->getTerminator();
|
||||||
getFeasibleSuccessors(*TI, SuccFeasible);
|
getFeasibleSuccessors(*TI, SuccFeasible, AggressiveUndef);
|
||||||
|
|
||||||
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
|
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
|
||||||
if (TI->getSuccessor(i) == To && SuccFeasible[i])
|
if (TI->getSuccessor(i) == To && SuccFeasible[i])
|
||||||
@ -196,7 +208,7 @@ bool SparseSolver::isEdgeFeasible(BasicBlock *From, BasicBlock *To) {
|
|||||||
|
|
||||||
void SparseSolver::visitTerminatorInst(TerminatorInst &TI) {
|
void SparseSolver::visitTerminatorInst(TerminatorInst &TI) {
|
||||||
SmallVector<bool, 16> SuccFeasible;
|
SmallVector<bool, 16> SuccFeasible;
|
||||||
getFeasibleSuccessors(TI, SuccFeasible);
|
getFeasibleSuccessors(TI, SuccFeasible, true);
|
||||||
|
|
||||||
BasicBlock *BB = TI.getParent();
|
BasicBlock *BB = TI.getParent();
|
||||||
|
|
||||||
@ -226,7 +238,7 @@ void SparseSolver::visitPHINode(PHINode &PN) {
|
|||||||
// transfer function to give us the merge of the incoming values.
|
// transfer function to give us the merge of the incoming values.
|
||||||
for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
|
for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
|
||||||
// If the edge is not yet known to be feasible, it doesn't impact the PHI.
|
// If the edge is not yet known to be feasible, it doesn't impact the PHI.
|
||||||
if (!isEdgeFeasible(PN.getIncomingBlock(i), PN.getParent()))
|
if (!isEdgeFeasible(PN.getIncomingBlock(i), PN.getParent(), true))
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
// Merge in this value.
|
// Merge in this value.
|
||||||
|
Loading…
Reference in New Issue
Block a user