| /external/swiftshader/third_party/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)) {
|
| Sink.cpp | 266 BasicBlock::iterator InsertPos = SuccToSinkTo->begin();
267 while (InsertPos != SuccToSinkTo->end() && isa<PHINode>(InsertPos))
268 ++InsertPos;
271 Inst->moveBefore(InsertPos);
|
| /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);
247 void *InsertPos;
[all...] |
| SymbolManager.cpp | 154 void *InsertPos;
155 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
159 DataSet.InsertNode(SD, InsertPos);
173 void *InsertPos;
174 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
178 DataSet.InsertNode(SD, InsertPos);
191 void *InsertPos;
192 SymExpr *SD = DataSet.FindNodeOrInsertPos(profile, InsertPos);
196 DataSet.InsertNode(SD, InsertPos);
207 void *InsertPos;
[all...] |
| /external/llvm/unittests/ADT/ |
| FoldingSet.cpp | 55 void *InsertPos = nullptr;
58 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos);
60 EXPECT_EQ(nullptr, InsertPos);
70 void *InsertPos = nullptr;
73 TrivialPair *N = Trivial.FindNodeOrInsertPos(ID, InsertPos);
75 EXPECT_NE(nullptr, InsertPos);
120 void *InsertPos = nullptr;
124 Trivial.FindNodeOrInsertPos(ID, InsertPos);
127 Trivial.InsertNode(&T, InsertPos);
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 360 MachineBasicBlock::iterator InsertPos;
365 InsertPos = Header->begin();
366 while (InsertPos->getOpcode() != WebAssembly::LOOP)
367 ++InsertPos;
371 InsertPos = Header->getFirstTerminator();
372 while (InsertPos != Header->begin() && IsChild(*prev(InsertPos), MFI) &&
373 prev(InsertPos)->getOpcode() != WebAssembly::LOOP &&
374 prev(InsertPos)->getOpcode() != WebAssembly::END_BLOCK &&
375 prev(InsertPos)->getOpcode() != WebAssembly::END_LOOP
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScheduleDAGEmit.cpp | 32 TII->insertNoop(*BB, InsertPos);
54 BuildMI(*BB, InsertPos, DebugLoc(), TII->get(TargetOpcode::COPY), Reg)
63 BuildMI(*BB, InsertPos, DebugLoc(), TII->get(TargetOpcode::COPY), VRBase)
|
| /external/swiftshader/third_party/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| FoldingSet.h | 212 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos);
215 /// it is not already in the folding set. InsertPos must be obtained from
217 void InsertNode(Node *N, void *InsertPos);
450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
451 return static_cast<T *>(FoldingSetBase::FindNodeOrInsertPos(ID, InsertPos));
455 /// it is not already in the folding set. InsertPos must be obtained from
457 void InsertNode(T *N, void *InsertPos) {
458 FoldingSetBase::InsertNode(N, InsertPos);
590 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) {
591 return Set.FindNodeOrInsertPos(ID, InsertPos);
[all...] |
| /external/clang/lib/AST/ |
| DeclTemplate.cpp | 165 void *&InsertPos) {
169 EntryType *Entry = Specs.FindNodeOrInsertPos(ID, InsertPos);
176 void *InsertPos) {
178 if (InsertPos) {
184 InsertPos == CorrectInsertPos &&
185 "given incorrect InsertPos for specialization");
187 Specializations.InsertNode(Entry, InsertPos);
292 void *&InsertPos) {
293 return findSpecializationImpl(getSpecializations(), Args, InsertPos);
297 FunctionTemplateSpecializationInfo *Info, void *InsertPos) {
[all...] |
| /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/AsmPrinter/ |
| DwarfFile.cpp | 36 void *InsertPos;
38 AbbreviationsSet.FindNodeOrInsertPos(ID, InsertPos)) {
50 AbbreviationsSet.InsertNode(New, InsertPos);
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| ImmutableList.h | 170 void* InsertPos;
174 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
183 Cache.InsertNode(L, InsertPos);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| ImmutableList.h | 172 void* InsertPos;
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
185 Cache.InsertNode(L, InsertPos);
|
