forked from OSchip/llvm-project
Speculatively revert r97010, "Add an argument to PHITranslateValue to specify
the DominatorTree. ...", in hopes of restoring poor old PPC bootstrap. llvm-svn: 97027
This commit is contained in:
parent
3860521406
commit
0a2031e5b6
|
@ -66,11 +66,9 @@ public:
|
|||
bool IsPotentiallyPHITranslatable() const;
|
||||
|
||||
/// PHITranslateValue - PHI translate the current address up the CFG from
|
||||
/// CurBB to Pred, updating our state to reflect any needed changes. If the
|
||||
/// dominator tree DT is non-null, the translated value must dominate
|
||||
/// PredBB. This returns true on failure and sets Addr to null.
|
||||
bool PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB,
|
||||
const DominatorTree *DT);
|
||||
/// CurBB to Pred, updating our state the reflect any needed changes. This
|
||||
/// returns true on failure and sets Addr to null.
|
||||
bool PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB);
|
||||
|
||||
/// PHITranslateWithInsertion - PHI translate this value into the specified
|
||||
/// predecessor block, inserting a computation of the value if it is
|
||||
|
@ -90,8 +88,14 @@ public:
|
|||
/// returns false.
|
||||
bool Verify() const;
|
||||
private:
|
||||
Value *PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB,
|
||||
const DominatorTree *DT);
|
||||
Value *PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB);
|
||||
|
||||
|
||||
/// GetAvailablePHITranslatedSubExpr - Return the value computed by
|
||||
/// PHITranslateSubExpr if it dominates PredBB, otherwise return null.
|
||||
Value *GetAvailablePHITranslatedSubExpr(Value *V,
|
||||
BasicBlock *CurBB, BasicBlock *PredBB,
|
||||
const DominatorTree &DT) const;
|
||||
|
||||
/// InsertPHITranslatedSubExpr - Insert a computation of the PHI translated
|
||||
/// version of 'V' for the edge PredBB->CurBB into the end of the PredBB
|
||||
|
|
|
@ -861,7 +861,7 @@ getNonLocalPointerDepFromBB(const PHITransAddr &Pointer, uint64_t PointeeSize,
|
|||
// Get the PHI translated pointer in this predecessor. This can fail if
|
||||
// not translatable, in which case the getAddr() returns null.
|
||||
PHITransAddr PredPointer(Pointer);
|
||||
PredPointer.PHITranslateValue(BB, Pred, 0);
|
||||
PredPointer.PHITranslateValue(BB, Pred);
|
||||
|
||||
Value *PredPtrVal = PredPointer.getAddr();
|
||||
|
||||
|
|
|
@ -134,8 +134,7 @@ static void RemoveInstInputs(Value *V,
|
|||
}
|
||||
|
||||
Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
|
||||
BasicBlock *PredBB,
|
||||
const DominatorTree *DT) {
|
||||
BasicBlock *PredBB) {
|
||||
// If this is a non-instruction value, it can't require PHI translation.
|
||||
Instruction *Inst = dyn_cast<Instruction>(V);
|
||||
if (Inst == 0) return V;
|
||||
|
@ -178,7 +177,7 @@ Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
|
|||
// operands need to be phi translated, and if so, reconstruct it.
|
||||
|
||||
if (BitCastInst *BC = dyn_cast<BitCastInst>(Inst)) {
|
||||
Value *PHIIn = PHITranslateSubExpr(BC->getOperand(0), CurBB, PredBB, DT);
|
||||
Value *PHIIn = PHITranslateSubExpr(BC->getOperand(0), CurBB, PredBB);
|
||||
if (PHIIn == 0) return 0;
|
||||
if (PHIIn == BC->getOperand(0))
|
||||
return BC;
|
||||
|
@ -194,8 +193,7 @@ Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
|
|||
for (Value::use_iterator UI = PHIIn->use_begin(), E = PHIIn->use_end();
|
||||
UI != E; ++UI) {
|
||||
if (BitCastInst *BCI = dyn_cast<BitCastInst>(*UI))
|
||||
if (BCI->getType() == BC->getType() &&
|
||||
(!DT || DT->dominates(BCI->getParent(), PredBB)))
|
||||
if (BCI->getType() == BC->getType())
|
||||
return BCI;
|
||||
}
|
||||
return 0;
|
||||
|
@ -206,7 +204,7 @@ Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
|
|||
SmallVector<Value*, 8> GEPOps;
|
||||
bool AnyChanged = false;
|
||||
for (unsigned i = 0, e = GEP->getNumOperands(); i != e; ++i) {
|
||||
Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT);
|
||||
Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB);
|
||||
if (GEPOp == 0) return 0;
|
||||
|
||||
AnyChanged |= GEPOp != GEP->getOperand(i);
|
||||
|
@ -231,8 +229,7 @@ Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
|
|||
if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(*UI))
|
||||
if (GEPI->getType() == GEP->getType() &&
|
||||
GEPI->getNumOperands() == GEPOps.size() &&
|
||||
GEPI->getParent()->getParent() == CurBB->getParent() &&
|
||||
(!DT || DT->dominates(GEPI->getParent(), PredBB))) {
|
||||
GEPI->getParent()->getParent() == CurBB->getParent()) {
|
||||
bool Mismatch = false;
|
||||
for (unsigned i = 0, e = GEPOps.size(); i != e; ++i)
|
||||
if (GEPI->getOperand(i) != GEPOps[i]) {
|
||||
|
@ -254,7 +251,7 @@ Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
|
|||
bool isNSW = cast<BinaryOperator>(Inst)->hasNoSignedWrap();
|
||||
bool isNUW = cast<BinaryOperator>(Inst)->hasNoUnsignedWrap();
|
||||
|
||||
Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
|
||||
Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB);
|
||||
if (LHS == 0) return 0;
|
||||
|
||||
// If the PHI translated LHS is an add of a constant, fold the immediates.
|
||||
|
@ -290,8 +287,7 @@ Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
|
|||
if (BinaryOperator *BO = dyn_cast<BinaryOperator>(*UI))
|
||||
if (BO->getOpcode() == Instruction::Add &&
|
||||
BO->getOperand(0) == LHS && BO->getOperand(1) == RHS &&
|
||||
BO->getParent()->getParent() == CurBB->getParent() &&
|
||||
(!DT || DT->dominates(BO->getParent(), PredBB)))
|
||||
BO->getParent()->getParent() == CurBB->getParent())
|
||||
return BO;
|
||||
}
|
||||
|
||||
|
@ -304,25 +300,34 @@ Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
|
|||
|
||||
|
||||
/// PHITranslateValue - PHI translate the current address up the CFG from
|
||||
/// CurBB to Pred, updating our state to reflect any needed changes. If the
|
||||
/// dominator tree DT is non-null, the translated value must dominate
|
||||
/// PredBB. This returns true on failure and sets Addr to null.
|
||||
bool PHITransAddr::PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB,
|
||||
const DominatorTree *DT) {
|
||||
/// CurBB to Pred, updating our state the reflect any needed changes. This
|
||||
/// returns true on failure and sets Addr to null.
|
||||
bool PHITransAddr::PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB) {
|
||||
assert(Verify() && "Invalid PHITransAddr!");
|
||||
Addr = PHITranslateSubExpr(Addr, CurBB, PredBB, DT);
|
||||
Addr = PHITranslateSubExpr(Addr, CurBB, PredBB);
|
||||
assert(Verify() && "Invalid PHITransAddr!");
|
||||
|
||||
if (DT) {
|
||||
// Make sure the value is live in the predecessor.
|
||||
if (Instruction *Inst = dyn_cast_or_null<Instruction>(Addr))
|
||||
if (!DT->dominates(Inst->getParent(), PredBB))
|
||||
Addr = 0;
|
||||
}
|
||||
|
||||
return Addr == 0;
|
||||
}
|
||||
|
||||
/// GetAvailablePHITranslatedSubExpr - Return the value computed by
|
||||
/// PHITranslateSubExpr if it dominates PredBB, otherwise return null.
|
||||
Value *PHITransAddr::
|
||||
GetAvailablePHITranslatedSubExpr(Value *V, BasicBlock *CurBB,BasicBlock *PredBB,
|
||||
const DominatorTree &DT) const {
|
||||
PHITransAddr Tmp(V, TD);
|
||||
Tmp.PHITranslateValue(CurBB, PredBB);
|
||||
|
||||
// See if PHI translation succeeds.
|
||||
V = Tmp.getAddr();
|
||||
|
||||
// Make sure the value is live in the predecessor.
|
||||
if (Instruction *Inst = dyn_cast_or_null<Instruction>(V))
|
||||
if (!DT.dominates(Inst->getParent(), PredBB))
|
||||
return 0;
|
||||
return V;
|
||||
}
|
||||
|
||||
|
||||
/// PHITranslateWithInsertion - PHI translate this value into the specified
|
||||
/// predecessor block, inserting a computation of the value if it is
|
||||
/// unavailable.
|
||||
|
@ -360,9 +365,8 @@ InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB,
|
|||
SmallVectorImpl<Instruction*> &NewInsts) {
|
||||
// See if we have a version of this value already available and dominating
|
||||
// PredBB. If so, there is no need to insert a new instance of it.
|
||||
PHITransAddr Tmp(InVal, TD);
|
||||
if (!Tmp.PHITranslateValue(CurBB, PredBB, &DT))
|
||||
return Tmp.getAddr();
|
||||
if (Value *Res = GetAvailablePHITranslatedSubExpr(InVal, CurBB, PredBB, DT))
|
||||
return Res;
|
||||
|
||||
// If we don't have an available version of this value, it must be an
|
||||
// instruction.
|
||||
|
|
|
@ -1633,8 +1633,13 @@ bool GVN::processNonLocalLoad(LoadInst *LI,
|
|||
LoadPtr = Address.PHITranslateWithInsertion(LoadBB, UnavailablePred,
|
||||
*DT, NewInsts);
|
||||
} else {
|
||||
Address.PHITranslateValue(LoadBB, UnavailablePred, DT);
|
||||
Address.PHITranslateValue(LoadBB, UnavailablePred);
|
||||
LoadPtr = Address.getAddr();
|
||||
|
||||
// Make sure the value is live in the predecessor.
|
||||
if (Instruction *Inst = dyn_cast_or_null<Instruction>(LoadPtr))
|
||||
if (!DT->dominates(Inst->getParent(), UnavailablePred))
|
||||
LoadPtr = 0;
|
||||
}
|
||||
|
||||
// If we couldn't find or insert a computation of this phi translated value,
|
||||
|
|
Loading…
Reference in New Issue