#include "llvm/Pass.h"
#include "Support/StatisticReporter.h"
-static Statistic<> NumAdded("lowerrefs\t\t- New instructions added");
-
namespace {
- struct DecomposePass : public BasicBlockPass {
- virtual bool runOnBasicBlock(BasicBlock &BB);
+ Statistic<> NumAdded("lowerrefs\t\t- # of getelementptr instructions added");
- private:
- static bool decomposeArrayRef(BasicBlock::iterator &BBI);
+ class DecomposePass : public BasicBlockPass {
+ static bool decomposeArrayRef(GetElementPtrInst &GEP);
+ public:
+ virtual bool runOnBasicBlock(BasicBlock &BB);
};
RegisterOpt<DecomposePass> X("lowerrefs", "Decompose multi-dimensional "
{
bool Changed = false;
for (BasicBlock::iterator II = BB.begin(); II != BB.end(); ) {
- if (MemAccessInst *MAI = dyn_cast<MemAccessInst>(&*II))
- if (MAI->getNumIndices() >= 2) {
- Changed |= decomposeArrayRef(II); // always modifies II
- continue;
- }
+ Instruction *I = II;
++II;
+ if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(I))
+ if (GEP->getNumIndices() >= 2)
+ Changed |= decomposeArrayRef(*GEP); // always modifies II
}
return Changed;
}
-// Check for a constant (uint) 0.
-inline bool
-IsZero(Value* idx)
-{
- return (isa<ConstantInt>(idx) && cast<ConstantInt>(idx)->isNullValue());
-}
-
-// For any MemAccessInst with 2 or more array and structure indices:
+// For any GetElementPtrInst with 2 or more array and structure indices:
//
// opCode CompositeType* P, [uint|ubyte] idx1, ..., [uint|ubyte] idxN
//
// Return value: true if the instruction was replaced; false otherwise.
//
bool
-DecomposePass::decomposeArrayRef(BasicBlock::iterator &BBI)
+DecomposePass::decomposeArrayRef(GetElementPtrInst &GEP)
{
- MemAccessInst &MAI = cast<MemAccessInst>(*BBI);
- BasicBlock *BB = MAI.getParent();
- Value *LastPtr = MAI.getPointerOperand();
-
- // Remove the instruction from the stream
- BB->getInstList().remove(BBI);
-
- // The vector of new instructions to be created
- std::vector<Instruction*> NewInsts;
+ BasicBlock *BB = GEP.getParent();
+ Value *LastPtr = GEP.getPointerOperand();
+ Instruction *InsertPoint = GEP.getNext(); // Insert before the next insn
// Process each index except the last one.
- User::const_op_iterator OI = MAI.idx_begin(), OE = MAI.idx_end();
+ User::const_op_iterator OI = GEP.idx_begin(), OE = GEP.idx_end();
for (; OI+1 != OE; ++OI) {
std::vector<Value*> Indices;
// If this is the first index and is 0, skip it and move on!
- if (OI == MAI.idx_begin()) {
- if (IsZero(*OI)) continue;
- } else
+ if (OI == GEP.idx_begin()) {
+ if (*OI == ConstantInt::getNullValue((*OI)->getType()))
+ continue;
+ } else {
// Not the first index: include initial [0] to deref the last ptr
Indices.push_back(Constant::getNullValue(Type::UIntTy));
+ }
Indices.push_back(*OI);
// New Instruction: nextPtr1 = GetElementPtr LastPtr, Indices
- LastPtr = new GetElementPtrInst(LastPtr, Indices, "ptr1");
- NewInsts.push_back(cast<Instruction>(LastPtr));
+ LastPtr = new GetElementPtrInst(LastPtr, Indices, "ptr1", InsertPoint);
++NumAdded;
}
Indices.push_back(Constant::getNullValue(Type::UIntTy));
Indices.push_back(*OI);
- Instruction *NewI = 0;
- switch(MAI.getOpcode()) {
- case Instruction::GetElementPtr:
- NewI = new GetElementPtrInst(LastPtr, Indices, MAI.getName());
- break;
- default:
- assert(0 && "Unrecognized memory access instruction");
- }
- NewInsts.push_back(NewI);
+ Value *NewVal = new GetElementPtrInst(LastPtr, Indices, GEP.getName(),
+ InsertPoint);
// Replace all uses of the old instruction with the new
- MAI.replaceAllUsesWith(NewI);
-
- // Now delete the old instruction...
- delete &MAI;
-
- // Insert all of the new instructions...
- BB->getInstList().insert(BBI, NewInsts.begin(), NewInsts.end());
+ GEP.replaceAllUsesWith(NewVal);
- // Advance the iterator to the instruction following the one just inserted...
- BBI = NewInsts.back();
- ++BBI;
+ // Now remove and delete the old instruction...
+ BB->getInstList().erase(&GEP);
return true;
}