class Reassociate : public FunctionPass {
DenseMap<BasicBlock*, unsigned> RankMap;
DenseMap<AssertingVH<>, unsigned> ValueRankMap;
- DenseMap<Value *, DbgValueInst *> DbgValues;
SmallVector<WeakVH, 8> RedoInsts;
SmallVector<WeakVH, 8> DeadInsts;
bool MadeChange;
void ReassociateInst(BasicBlock::iterator &BBI);
void RemoveDeadBinaryOp(Value *V);
-
- /// collectDbgValues - Collect all llvm.dbg.value intrinsics.
- void collectDbgValues(Function &F);
};
}
std::swap(LHS, RHS);
bool Success = !I->swapOperands();
assert(Success && "swapOperands failed");
- Success = false;
+ (void)Success;
MadeChange = true;
} else if (RHSBO) {
// Turn (A+B)+(C+D) -> (((A+B)+C)+D). This guarantees the RHS is not
void Reassociate::RewriteExprTree(BinaryOperator *I,
SmallVectorImpl<ValueEntry> &Ops,
unsigned i) {
- // If this operation was representing debug info of a value then it
- // is no longer true, so remove the dbg.value instrinsic.
- if (DbgValueInst *DVI = DbgValues.lookup(I))
- DeadInsts.push_back(DVI);
-
if (i+2 == Ops.size()) {
if (I->getOperand(0) != Ops[i].Op ||
I->getOperand(1) != Ops[i+1].Op) {
bool Reassociate::runOnFunction(Function &F) {
- collectDbgValues(F);
// Recalculate the rank map for F
BuildRankMap(F);
// Now that we're done, delete any instructions which are no longer used.
while (!DeadInsts.empty())
if (Value *V = DeadInsts.pop_back_val())
- if (!RecursivelyDeleteTriviallyDeadInstructions(V))
- if (DbgValueInst *DVI = dyn_cast<DbgValueInst>(V))
- DVI->eraseFromParent();
+ RecursivelyDeleteTriviallyDeadInstructions(V);
// We are done with the rank map.
RankMap.clear();
ValueRankMap.clear();
- DbgValues.clear();
return MadeChange;
}
-/// collectDbgValues - Collect all llvm.dbg.value intrinsics.
-void Reassociate::collectDbgValues(Function &F) {
- for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI)
- for (BasicBlock::iterator BI = FI->begin(), BE = FI->end();
- BI != BE; ++BI)
- if (DbgValueInst *DVI = dyn_cast<DbgValueInst>(BI))
- DbgValues[DVI->getValue()] = DVI;
-}