| /external/llvm/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.h | 38 MachineBasicBlock::iterator InsertPos;
131 MachineBasicBlock::iterator getInsertPos() { return InsertPos; }
135 InstrEmitter(MachineBasicBlock *mbb, MachineBasicBlock::iterator insertpos);
|
| /external/llvm/lib/Transforms/Scalar/ |
| BasicBlockPlacement.cpp | 68 /// InsertPos - This an iterator to the next place we want to insert a
70 Function::iterator InsertPos;
91 InsertPos = F.begin();
109 if (&*InsertPos != BB) {
114 Blocks.splice(InsertPos, Blocks, BB);
119 ++InsertPos;
143 (Count == MaxExecutionCount && *SI == &*InsertPos)) {
|
| TailRecursionElimination.cpp | 534 Instruction *InsertPos = OldEntry->begin();
538 I->getName() + ".tr", InsertPos);
|
| LICM.cpp | 699 Instruction *InsertPos = LoopInsertPts[i];
700 StoreInst *NewSI = new StoreInst(LiveInValue, SomePtr, InsertPos);
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BasicValueFactory.cpp | 74 void *InsertPos;
78 FoldNodeTy* P = APSIntSet.FindNodeOrInsertPos(ID, InsertPos);
83 APSIntSet.InsertNode(P, InsertPos);
113 void *InsertPos;
115 CompoundValData* D = CompoundValDataSet.FindNodeOrInsertPos(ID, InsertPos);
120 CompoundValDataSet.InsertNode(D, InsertPos);
131 void *InsertPos;
134 LazyCompoundValDataSet.FindNodeOrInsertPos(ID, InsertPos);
139 LazyCompoundValDataSet.InsertNode(D, InsertPos);
243 void *InsertPos;
[all...] |
| ExplodedGraph.cpp | 302 void *InsertPos = 0;
305 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos);
323 Nodes.InsertNode(V, InsertPos);
|
| SymbolManager.cpp | 155 void *InsertPos;
156 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
160 DataSet.InsertNode(SD, InsertPos);
174 void *InsertPos;
175 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
179 DataSet.InsertNode(SD, InsertPos);
192 void *InsertPos;
193 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
197 DataSet.InsertNode(SD, InsertPos);
208 void *InsertPos;
[all...] |
| ProgramState.cpp | 406 void *InsertPos;
408 if (ProgramState *I = StateSet.FindNodeOrInsertPos(ID, InsertPos))
420 StateSet.InsertNode(newState, InsertPos);
|
| MemRegion.cpp | 44 void *InsertPos;
46 InsertPos));
51 Regions.InsertNode(R, InsertPos);
62 void *InsertPos;
64 InsertPos));
69 Regions.InsertNode(R, InsertPos);
83 void *InsertPos;
85 InsertPos));
90 Regions.InsertNode(R, InsertPos);
102 void *InsertPos;
[all...] |
| PathDiagnostic.cpp | 262 void *InsertPos = 0;
264 if (PathDiagnostic *orig = Diags.FindNodeOrInsertPos(profile, InsertPos)) {
467 void *InsertPos;
468 PDFileEntry *Entry = FindNodeOrInsertPos(NodeID, InsertPos);
472 InsertNode(Entry, InsertPos);
488 void *InsertPos;
489 PDFileEntry *Entry = FindNodeOrInsertPos(NodeID, InsertPos);
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| ProfilingUtils.cpp | 47 BasicBlock::iterator InsertPos = Entry->begin();
48 while (isa<AllocaInst>(InsertPos)) ++InsertPos;
64 CallInst *InitCall = CallInst::Create(InitFn, Args, "newargc", InsertPos);
91 CastInst::Create(opcode, InitCall, AI->getType(), "", InsertPos));
110 BasicBlock::iterator InsertPos = beginning ? BB->getFirstInsertionPt() :
112 while (isa<AllocaInst>(InsertPos))
113 ++InsertPos;
125 Value *OldVal = new LoadInst(ElementPtr, "OldFuncCounter", InsertPos);
128 "NewFuncCounter", InsertPos);
[all...] |
| /external/llvm/lib/DebugInfo/ |
| DWARFDebugAranges.cpp | 54 DWARFDebugAranges::RangeColl::iterator InsertPos =
57 RangeCollection.insert(InsertPos, Range);
|
| /external/clang/lib/AST/ |
| DeclarationName.cpp | 402 void *InsertPos = 0;
403 if (CXXSpecialName *Name = SpecialNames->FindNodeOrInsertPos(ID, InsertPos))
411 SpecialNames->InsertNode(SpecialName, InsertPos);
429 void *InsertPos = 0;
431 LiteralNames->FindNodeOrInsertPos(ID, InsertPos))
439 LiteralNames->InsertNode(LiteralName, InsertPos);
|
| NestedNameSpecifier.cpp | 33 void *InsertPos = 0;
35 = Context.NestedNameSpecifiers.FindNodeOrInsertPos(ID, InsertPos);
39 Context.NestedNameSpecifiers.InsertNode(NNS, InsertPos);
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableList.h | 169 void* InsertPos;
173 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
182 Cache.InsertNode(L, InsertPos);
|
| /external/llvm/lib/CodeGen/ |
| MachineSink.cpp | 687 MachineBasicBlock::iterator InsertPos = SuccToSinkTo->begin();
688 while (InsertPos != SuccToSinkTo->end() && InsertPos->isPHI())
689 ++InsertPos;
696 SuccToSinkTo->splice(InsertPos, ParentBlock, MI,
703 SuccToSinkTo->splice(InsertPos, ParentBlock, DbgMI,
|
| PHIElimination.cpp | 377 MachineBasicBlock::iterator InsertPos =
387 NewSrcInstr = BuildMI(opBlock, InsertPos, MPhi->getDebugLoc(),
396 NewSrcInstr = BuildMI(opBlock, InsertPos, MPhi->getDebugLoc(),
447 KillInst = prior(InsertPos);
507 KillInst = prior(InsertPos);
|
| MachineBlockPlacement.cpp | [all...] |
| /external/llvm/lib/Target/ARM/ |
| Thumb2ITBlockPass.cpp | 189 MachineBasicBlock::iterator InsertPos = MIB;
218 MBB.insert(InsertPos, NMI);
239 finalizeBundle(MBB, InsertPos.getInstrIterator(), llvm::next(LI));
|
| /external/clang/lib/Analysis/ |
| AnalysisDeclContext.cpp | 330 void *InsertPos;
332 LOC *L = cast_or_null<LOC>(Contexts.FindNodeOrInsertPos(ID, InsertPos));
336 Contexts.InsertNode(L, InsertPos);
348 void *InsertPos;
350 cast_or_null<StackFrameContext>(Contexts.FindNodeOrInsertPos(ID, InsertPos));
353 Contexts.InsertNode(L, InsertPos);
372 void *InsertPos;
375 InsertPos));
378 Contexts.InsertNode(L, InsertPos);
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 689 Function::iterator InsertPos = BackedgeBlocks.back(); ++InsertPos;
690 F->getBasicBlockList().splice(InsertPos, F->getBasicBlockList(), BEBlock);
|
| /external/clang/lib/Basic/ |
| IdentifierTable.cpp | 531 void *InsertPos = 0;
533 SelTabImpl.Table.FindNodeOrInsertPos(ID, InsertPos))
543 SelTabImpl.Table.InsertNode(SI, InsertPos);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineVectorOps.cpp | 159 BasicBlock::iterator InsertPos;
161 InsertPos = pos;
162 ++InsertPos;
164 InsertPos = inBB->getFirstInsertionPt();
167 InsertNewInstWith(newEI, *InsertPos);
[all...] |
| /external/llvm/tools/llvm-ar/ |
| llvm-ar.cpp | 515 int InsertPos = -1;
527 InsertPos = Pos;
529 InsertPos = Pos + 1;
558 if (!RelPos.empty() && InsertPos == -1)
562 InsertPos = Ret.size();
564 assert(unsigned(InsertPos) <= Ret.size());
565 Ret.insert(Ret.begin() + InsertPos, Moved.begin(), Moved.end());
567 Ret.insert(Ret.begin() + InsertPos, Members.size(), NewArchiveIterator());
568 int Pos = InsertPos;
|
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
