Searched defs:InsertPos (Results 1 - 25 of 45) sorted by relevance

12

/external/llvm/lib/CodeGen/SelectionDAG/
H A DInstrEmitter.h37 MachineBasicBlock::iterator InsertPos; member in class:llvm::InstrEmitter
127 MachineBasicBlock::iterator getInsertPos() { return InsertPos; }
/external/llvm/lib/Transforms/Scalar/
H A DBasicBlockPlacement.cpp68 /// InsertPos - This an iterator to the next place we want to insert a
70 Function::iterator InsertPos; member in struct:__anon9076::BlockPlacement
91 InsertPos = F.begin();
109 if (&*InsertPos != BB) {
114 Blocks.splice(InsertPos, Blocks, BB);
119 ++InsertPos;
143 (Count == MaxExecutionCount && *SI == &*InsertPos)) {
H A DTailRecursionElimination.cpp497 Instruction *InsertPos = OldEntry->begin(); local
501 I->getName() + ".tr", InsertPos);
H A DLICM.cpp695 Instruction *InsertPos = LoopInsertPts[i]; local
696 StoreInst *NewSI = new StoreInst(LiveInValue, SomePtr, InsertPos);
/external/clang/lib/StaticAnalyzer/Core/
H A DBasicValueFactory.cpp74 void *InsertPos; local
78 FoldNodeTy* P = APSIntSet.FindNodeOrInsertPos(ID, InsertPos);
83 APSIntSet.InsertNode(P, InsertPos);
113 void *InsertPos; local
115 CompoundValData* D = CompoundValDataSet.FindNodeOrInsertPos(ID, InsertPos);
120 CompoundValDataSet.InsertNode(D, InsertPos);
131 void *InsertPos; local
134 LazyCompoundValDataSet.FindNodeOrInsertPos(ID, InsertPos);
139 LazyCompoundValDataSet.InsertNode(D, InsertPos);
243 void *InsertPos; local
268 void *InsertPos; local
[all...]
H A DExplodedGraph.cpp270 void *InsertPos = 0; local
273 NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos);
291 Nodes.InsertNode(V, InsertPos);
H A DSymbolManager.cpp174 void *InsertPos; local
175 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
179 DataSet.InsertNode(SD, InsertPos);
193 void *InsertPos; local
194 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
198 DataSet.InsertNode(SD, InsertPos);
211 void *InsertPos; local
212 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
216 DataSet.InsertNode(SD, InsertPos);
227 void *InsertPos; local
245 void *InsertPos; local
262 void *InsertPos; local
279 void *InsertPos; local
297 void *InsertPos; local
315 void *InsertPos; local
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DProfilingUtils.cpp47 BasicBlock::iterator InsertPos = Entry->begin(); local
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() : local
112 while (isa<AllocaInst>(InsertPos))
113 ++InsertPos;
125 Value *OldVal = new LoadInst(ElementPtr, "OldFuncCounter", InsertPos);
128 "NewFuncCounter", InsertPos);
[all...]
/external/clang/lib/AST/
H A DDeclarationName.cpp398 void *InsertPos = 0; local
399 if (CXXSpecialName *Name = SpecialNames->FindNodeOrInsertPos(ID, InsertPos))
407 SpecialNames->InsertNode(SpecialName, InsertPos);
425 void *InsertPos = 0; local
427 LiteralNames->FindNodeOrInsertPos(ID, InsertPos))
435 LiteralNames->InsertNode(LiteralName, InsertPos);
H A DNestedNameSpecifier.cpp33 void *InsertPos = 0; local
35 = Context.NestedNameSpecifiers.FindNodeOrInsertPos(ID, InsertPos);
39 Context.NestedNameSpecifiers.InsertNode(NNS, InsertPos);
/external/llvm/include/llvm/ADT/
H A DImmutableList.h170 void* InsertPos; local
174 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
183 Cache.InsertNode(L, InsertPos);
H A DFoldingSet.h162 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
165 /// it is not already in the folding set. InsertPos must be obtained from
167 void InsertNode(Node *N, void *InsertPos);
444 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) { argument
445 return static_cast<T *>(FoldingSetImpl::FindNodeOrInsertPos(ID, InsertPos));
524 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) { argument
525 return static_cast<T *>(FoldingSetImpl::FindNodeOrInsertPos(ID, InsertPos));
599 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) { argument
600 return Set.FindNodeOrInsertPos(ID, InsertPos);
613 /// it is not already in the folding set. InsertPos mus
615 InsertNode(T *N, void *InsertPos) argument
[all...]
/external/llvm/lib/CodeGen/
H A DPHIElimination.cpp314 MachineBasicBlock::iterator InsertPos = local
323 BuildMI(opBlock, InsertPos, MPhi->getDebugLoc(),
331 BuildMI(opBlock, InsertPos, MPhi->getDebugLoc(),
385 KillInst = prior(InsertPos);
H A DMachineSink.cpp689 MachineBasicBlock::iterator InsertPos = SuccToSinkTo->begin(); local
690 while (InsertPos != SuccToSinkTo->end() && InsertPos->isPHI())
691 ++InsertPos;
698 SuccToSinkTo->splice(InsertPos, ParentBlock, MI,
705 SuccToSinkTo->splice(InsertPos, ParentBlock, DbgMI,
H A DMachineBlockPlacement.cpp966 MachineFunction::iterator InsertPos = F.begin(); local
973 if (InsertPos != MachineFunction::iterator(*BI))
974 F.splice(InsertPos, *BI);
976 ++InsertPos;
/external/llvm/lib/Support/
H A DFoldingSet.cpp285 void *&InsertPos) {
290 InsertPos = 0;
301 // Didn't find the node, return null with the bucket as the InsertPos.
302 InsertPos = Bucket;
307 /// is not already in the map. InsertPos must be obtained from
309 void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { argument
315 InsertPos = GetBucketFor(ComputeNodeHash(N, TempID), Buckets, NumBuckets);
321 void **Bucket = static_cast<void**>(InsertPos);
284 FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) argument
/external/llvm/lib/Target/ARM/
H A DThumb2ITBlockPass.cpp189 MachineBasicBlock::iterator InsertPos = MIB; local
218 MBB.insert(InsertPos, NMI);
239 finalizeBundle(MBB, InsertPos.getInstrIterator(), llvm::next(LI));
/external/llvm/lib/VMCore/
H A DAttributes.cpp187 void *InsertPos; local
192 AttributesLists->FindNodeOrInsertPos(ID, InsertPos);
198 AttributesLists->InsertNode(PAL, InsertPos);
H A DInstruction.cpp77 void Instruction::insertBefore(Instruction *InsertPos) { argument
78 InsertPos->getParent()->getInstList().insert(InsertPos, this);
83 void Instruction::insertAfter(Instruction *InsertPos) { argument
84 InsertPos->getParent()->getInstList().insertAfter(InsertPos, this);
/external/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp681 Function::iterator InsertPos = BackedgeBlocks.back(); ++InsertPos; local
682 F->getBasicBlockList().splice(InsertPos, F->getBasicBlockList(), BEBlock);
/external/clang/lib/Analysis/
H A DAnalysisDeclContext.cpp270 void *InsertPos; local
272 LOC *L = cast_or_null<LOC>(Contexts.FindNodeOrInsertPos(ID, InsertPos));
276 Contexts.InsertNode(L, InsertPos);
288 void *InsertPos; local
290 cast_or_null<StackFrameContext>(Contexts.FindNodeOrInsertPos(ID, InsertPos));
293 Contexts.InsertNode(L, InsertPos);
312 void *InsertPos; local
315 InsertPos));
318 Contexts.InsertNode(L, InsertPos);
/external/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp456 MachineBasicBlock::iterator InsertPos = Preheader->getFirstTerminator(); local
488 BuildMI(*Preheader, InsertPos, InsertPos->getDebugLoc(),
493 BuildMI(*Preheader, InsertPos, InsertPos->getDebugLoc(),
498 BuildMI(*Preheader, InsertPos, InsertPos->getDebugLoc(),
504 BuildMI(*Preheader, InsertPos, InsertPos->getDebugLoc(),
H A DHexagonMachineScheduler.cpp117 MachineBasicBlock::iterator InsertPos) {
123 BB->splice(InsertPos, BB, MI);
129 if (RegionBegin == InsertPos)
116 moveInstruction(MachineInstr *MI, MachineBasicBlock::iterator InsertPos) argument
/external/llvm/lib/Target/PowerPC/
H A DPPCCTRLoops.cpp594 MachineBasicBlock::iterator InsertPos = Preheader->getFirstTerminator(); local
597 if (InsertPos != Preheader->end())
598 dl = InsertPos->getDebugLoc();
641 BuildMI(*Preheader, InsertPos, dl,
646 BuildMI(*Preheader, InsertPos, dl,
659 BuildMI(*Preheader, InsertPos, dl,
664 BuildMI(*Preheader, InsertPos, dl,
668 BuildMI(*Preheader, InsertPos, dl,
675 BuildMI(*Preheader, InsertPos, dl,
/external/clang/lib/Basic/
H A DIdentifierTable.cpp495 void *InsertPos = 0; local
497 SelTabImpl.Table.FindNodeOrInsertPos(ID, InsertPos))
507 SelTabImpl.Table.InsertNode(SI, InsertPos);

Completed in 410 milliseconds

12