| /external/llvm/lib/Transforms/Utils/ |
| DemoteRegToStack.cpp | 76 BasicBlock::iterator InsertPt;
78 InsertPt = &I;
79 ++InsertPt;
86 InsertPt = II.getNormalDest()->begin();
89 for (; isa<PHINode>(InsertPt) || isa<LandingPadInst>(InsertPt); ++InsertPt)
92 new StoreInst(&I, Slot, InsertPt);
|
| LoopUnrollRuntime.cpp | 108 Instruction *InsertPt = PrologEnd->getTerminator();
110 new ICmpInst(InsertPt, ICmpInst::ICMP_ULT, TripCount,
124 BranchInst::Create(Exit, NewPH, BrLoopExit, InsertPt);
125 InsertPt->eraseFromParent();
|
| SimplifyCFG.cpp | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| FastISel.h | 130 /// recomputeInsertPt - Reset InsertPt to prepare for inserting instructions
135 MachineBasicBlock::iterator InsertPt;
139 /// enterLocalValueArea - Prepare InsertPt to begin inserting instructions
143 /// leaveLocalValueArea - Reset InsertPt to the given old insert position.
|
| FunctionLoweringInfo.h | 96 MachineBasicBlock::iterator InsertPt;
|
| /external/llvm/lib/CodeGen/ |
| CodePlacementOpt.cpp | 53 MachineFunction::iterator InsertPt,
126 /// InsertPt. Update branch instructions as needed to account for broken
131 MachineFunction::iterator InsertPt,
134 assert(Begin != MF.begin() && End != MF.begin() && InsertPt != MF.begin() &&
139 MF.splice(InsertPt, Begin, End);
257 MachineFunction::iterator InsertPt =
263 InsertPt = TopMBB;
275 if (InsertPt != MF.begin() && HasAnalyzableTerminator(prior(InsertPt)))
326 Splice(MF, InsertPt, Begin, End)
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonFrameLowering.cpp | 95 MachineBasicBlock::iterator InsertPt = MBB.begin();
149 BuildMI(MBB, InsertPt, dl, TII.get(Hexagon::ALLOCFRAME)).addImm(0);
152 BuildMI(MBB, InsertPt, dl, TII.get(Hexagon::CONST32_Int_Real),
154 BuildMI(MBB, InsertPt, dl, TII.get(Hexagon::SUB_rr),
159 BuildMI(MBB, InsertPt, dl, TII.get(Hexagon::ALLOCFRAME)).addImm(NumBytes);
|
| /external/llvm/lib/VMCore/ |
| BasicBlock.cpp | 171 iterator InsertPt = getFirstNonPHI();
172 if (isa<LandingPadInst>(InsertPt)) ++InsertPt;
173 return InsertPt;
|
| /external/llvm/lib/Transforms/IPO/ |
| ArgumentPromotion.cpp | 785 Instruction *InsertPt = NF->begin()->begin();
[all...] |
| DeadArgumentElimination.cpp | 851 Instruction *InsertPt = Call;
855 InsertPt = IP;
[all...] |
| GlobalOpt.cpp | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 547 BasicBlock::iterator InsertPt = ExitBlock->getFirstInsertionPt();
554 I.moveBefore(InsertPt);
560 ExitBlock->getInstList().insert(InsertPt, New);
[all...] |
| Reassociate.cpp | [all...] |
| CodeGenPrepare.cpp | 502 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
505 InsertPt);
558 BasicBlock::iterator InsertPt = UserBB->getFirstInsertionPt();
562 CI->getOperand(1), "", InsertPt);
[all...] |
| IndVarSimplify.cpp | 196 Instruction *InsertPt = 0;
202 if (!InsertPt) {
203 InsertPt = InsertBB->getTerminator();
206 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB);
207 InsertPt = InsertBB->getTerminator();
209 assert(InsertPt && "Missing phi operand");
211 DT->dominates(cast<Instruction>(Def), InsertPt)) &&
213 return InsertPt;
[all...] |
| LoopStrengthReduce.cpp | [all...] |
| ObjCARC.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 505 BasicBlock::iterator InsertPt =
507 IRBuilder<> Builder(InsertPt);
|
| /external/llvm/include/llvm/ |
| IRBuilder.h | 37 BasicBlock *BB, BasicBlock::iterator InsertPt) const {
38 if (BB) BB->getInstList().insert(InsertPt, I);
49 BasicBlock::iterator InsertPt;
69 BasicBlock::iterator GetInsertPoint() const { return InsertPt; }
76 InsertPt = BB->end();
83 InsertPt = I;
91 InsertPt = IP;
399 this->InsertHelper(I, Name, BB, InsertPt);
[all...] |
