| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyDebugValueManager.h | 31 void move(MachineInstr *Insert);
33 void clone(MachineInstr *Insert, unsigned NewReg);
|
| WebAssemblyDebugValueManager.cpp | 58 void WebAssemblyDebugValueManager::move(MachineInstr *Insert) {
59 MachineBasicBlock *MBB = Insert->getParent();
61 MBB->splice(Insert, DBI->getParent(), DBI);
71 void WebAssemblyDebugValueManager::clone(MachineInstr *Insert,
73 MachineBasicBlock *MBB = Insert->getParent();
79 MBB->insert(Insert, Clone);
|
| WebAssemblyRegStackify.cpp | 266 static MachineInstr *getVRegDef(unsigned Reg, const MachineInstr *Insert,
275 LIS.getInstructionIndex(*Insert)))
308 // Test whether it's safe to move Def to just before Insert.
314 const MachineInstr *Insert, AliasAnalysis &AA,
319 assert(DefI->getParent() == Insert->getParent());
320 assert(UseI->getParent() == Insert->getParent());
354 if (NextI == Insert)
369 // If the register is dead here and at Insert, ignore it.
370 if (MO.isDead() && Insert->definesRegister(Reg) &&
371 !Insert->readsRegister(Reg)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| LiveRangeShrink.cpp | 168 MachineInstr *Insert = nullptr;
183 Insert = nullptr;
189 Insert = nullptr;
203 Insert = FindDominatedInstruction(DefInstr, Insert, IOM);
205 Insert = nullptr;
211 // after Insert, if yes, then we should not hoist.
212 for (MachineInstr *I = Insert; I && IOM[I] == Barrier;
215 Insert = nullptr;
219 if (DefMO && Insert && NumEligibleUse > 1 && Barrier <= IOM[Insert])
[all...] |
| ExpandMemCmp.cpp | 353 {{DominatorTree::Insert, BB, EndBlock},
354 {DominatorTree::Insert, BB, LoadCmpBlocks[BlockIndex + 1]}});
355 Builder.Insert(CmpBr);
360 DTU->applyUpdates({{DominatorTree::Insert, BB, EndBlock}});
361 Builder.Insert(CmpBr);
447 Builder.Insert(CmpBr);
449 DTU->applyUpdates({{DominatorTree::Insert, BB, ResBlock.BB},
450 {DominatorTree::Insert, BB, NextBB}});
505 Builder.Insert(CmpBr);
507 DTU->applyUpdates({{DominatorTree::Insert, BB, NextBB}
[all...] |
| IndirectBrExpandPass.cpp | 119 IndirectBrSuccs.insert(SuccBB);
244 Updates.push_back({DominatorTree::Insert, IBr->getParent(), SwitchBB});
266 Updates.push_back({DominatorTree::Insert, SwitchBB, BB});
|
| /src/external/apache2/llvm/dist/clang/include/clang-c/ |
| Rewrite.h | 28 * Insert the specified string at the specified location in the original buffer.
31 const char *Insert);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| CFGUpdate.h | 9 // This file defines a CFG Edge Update: Insert or Delete, and two Nodes as the
25 enum class UpdateKind : unsigned char { Insert, Delete };
44 OS << (getKind() == UpdateKind::Insert ? "Insert " : "Delete ");
79 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1);
90 NumInsertions > 0 ? UpdateKind::Insert : UpdateKind::Delete;
|
| CFGDiff.h | 77 StringRef DIText[2] = {"Delete", "Insert"};
100 (U.getKind() == cfg::UpdateKind::Insert) == !ReverseApplyUpdates;
117 (U.getKind() == cfg::UpdateKind::Insert) == !UpdatedAreReverseApplied;
164 OS << "Children to delete/insert:\n\t";
166 OS << "Inverse_children to delete/insert:\n\t";
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| IRBuilder.h | 70 if (BB) BB->getInstList().insert(InsertPt, I);
147 /// Insert and return the specified instruction.
149 InstTy *Insert(InstTy *I, const Twine &Name = "") const {
156 Constant *Insert(Constant *C, const Twine& = "") const {
160 Value *Insert(Value *V, const Twine &Name = "") const {
162 return Insert(I, Name);
263 /// Returns true if this insert point is set.
270 /// Returns the current insert point.
275 /// Returns the current insert point, clearing it in the process.
282 /// Sets the current insert point to a previously-saved location
[all...] |
| /src/external/apache2/llvm/dist/clang/tools/libclang/ |
| Rewrite.cpp | 28 const char *Insert) {
31 R.InsertTextBefore(clang::cxloc::translateSourceLocation(Loc), Insert);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| MatrixUtils.cpp | 53 {DominatorTree::Insert, Header, Body},
54 {DominatorTree::Insert, Body, Latch},
55 {DominatorTree::Insert, Latch, Header},
56 {DominatorTree::Insert, Latch, Exit},
57 {DominatorTree::Insert, Preheader, Header},
|
| BasicBlockUtils.cpp | 65 if (Updates && UniqueSuccessors.insert(Succ).second)
235 // Add insert edges first. Experimentally, for the particular case of two
237 // respectively, it is beneficial to have all insert updates first. Deleting
244 Updates.push_back({DominatorTree::Insert, PredBB, SuccOfBB});
364 auto R = VariableSet.insert(Key);
480 // Insert the new instruction into the basic block...
481 BasicBlock::iterator New = BIL.insert(BI, I);
650 Updates.push_back({DominatorTree::Insert, BB, NewBB});
651 Updates.push_back({DominatorTree::Insert, NewBB, Succ});
788 Updates.push_back({DominatorTree::Insert, Old, New})
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| X86MachineFunctionInfo.h | 216 auto Insert = PreallocatedIds.insert({CS, PreallocatedIds.size()});
217 if (Insert.second) {
221 return Insert.first->second;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUUnifyDivergentExitNodes.cpp | 128 if (Visited.insert(Pred).second)
154 // Otherwise, we need to insert a new basic block into the function, add a PHI
201 Updates.push_back({DominatorTree::Insert, BB, NewRetBlock});
226 // insert an export in that case.
267 // infinite loop and we insert a return ourselves, we need to uphold
303 Updates.push_back({DominatorTree::Insert, BB, DummyReturnBB});
314 Updates.push_back({DominatorTree::Insert, BB, TransitionBB});
316 Updates.push_back({DominatorTree::Insert, TransitionBB, Successor});
324 Updates.push_back({DominatorTree::Insert, BB, DummyReturnBB});
345 Updates.push_back({DominatorTree::Insert, BB, UnreachableBlock})
[all...] |
| SIAnnotateControlFlow.cpp | 227 Instruction *Insert;
229 Insert = Parent->getTerminator();
231 Insert = L->getHeader()->getFirstNonPHIOrDbgOrLifetime();
235 return CallInst::Create(IfBreak, Args, "", Insert);
238 // Insert IfBreak in the loop header TERM for constant COND other than true.
240 Instruction *Insert = Cond == BoolTrue ?
244 return CallInst::Create(IfBreak, Args, "", Insert);
291 // We can't insert an EndCF call into a loop header, because it will
|
| SILateBranchLowering.cpp | 61 "SI insert s_cbranch_execz instructions", false, false)
64 "SI insert s_cbranch_execz instructions", false, false)
95 DTUpdates.push_back({DomTreeT::Insert, SplitBB, Succ});
98 DTUpdates.push_back({DomTreeT::Insert, &MBB, SplitBB});
167 MF.insert(MF.end(), EarlyExitBlock);
194 MF.insert(MF.end(), EmptyMBBAtEnd);
206 MF.insert(MF.end(), EmptyMBBAtEnd);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/asan/ |
| asan_memory_profile.cc | 42 Insert(id, cv.UsedSize());
86 void Insert(u32 id, uptr size) {
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/asan/ |
| asan_memory_profile.cpp | 41 Insert(id, cv.UsedSize());
85 void Insert(u32 id, uptr size) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomTreeUpdater.cpp | 41 if (Kind == DominatorTree::Insert && !HasEdge)
180 DeletedBBs.insert(DelBB);
194 DeletedBBs.insert(DelBB);
263 // existed before. If the first update to an edge is "Insert", it means
266 // For example, if the user submits {{Delete, A, B}, {Insert, A, B}},
274 // a. If the edge still exists, because the user cannot insert an existent
275 // edge, so both {Delete, A, B}, {Insert, A, B} actually happened and
278 // actually happened but {Insert, A, B} was an invalid update which never
281 Seen.insert(Edge);
320 assert(isUpdateValid({DominatorTree::Insert, From, To}) &
[all...] |
| BlockFrequencyInfoImpl.cpp | 770 LoopData *OuterLoop, std::list<LoopData>::iterator Insert,
779 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(),
793 std::list<LoopData>::iterator Insert) {
794 assert((OuterLoop == nullptr) == (Insert == Loops.begin()));
795 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end();
802 createIrreducibleLoop(*this, G, OuterLoop, Insert, *I);
806 return make_range(std::next(Prev), Insert);
807 return make_range(Loops.begin(), Insert);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/ASTDiff/ |
| ASTDiff.h | 31 Insert, // (Src, Dst, Pos): insert Src as child of Dst at offset Pos.
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
| RegBankSelect.h | 110 /// before we actually need to insert something.
113 /// Tell if the insert point has already been materialized.
147 /// MachineBasicBlock::insert. I.e., additional code happens
166 /// MachineBasicBlock::insert and ::getPoint. The new code should
179 /// Insert \p MI in the just before ::getPoint()
180 MachineBasicBlock::iterator insert(MachineInstr &MI) { function in class:llvm::RegBankSelect::InsertPoint
181 return getInsertMBB().insert(getPoint(), &MI);
257 // If we try to insert before phis, we should use the insertion
261 // If we try to insert after the terminators, we should use the
321 Insert,
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 249 Visited.insert(PredBB);
419 Unreachable.insert(&BB);
615 LoopHeaders.insert(Edge.second);
651 if (!RecursionSet.insert(V).second)
768 LHSKnownBBs.insert(LHSVal.second);
1205 // we see one, check to see if it's partially redundant. If so, insert a PHI
1382 if (!PredsScanned.insert(PredBB).second)
1437 // predecessor, we want to insert a merge block for those common predecessors.
1438 // This ensures that we only have to insert one reload, thus not increasing
1469 AvailablePredSet.insert(AvailablePred.first)
[all...] |
| PartiallyInlineLibCalls.cpp | 60 // back to split-off tail of CurrBB) into which we'll insert a libcall.
76 // Finally, insert the libcall into 'else' block.
81 Builder.Insert(LibCall);
87 // Insert a FP compare instruction and use it as the CurrBB branch condition.
|
