| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/ |
| DominatorTreeBatchUpdatesTest.cpp | 57 std::vector<DomUpdate> Updates = {
61 DomSNCA::LegalizeUpdates(Updates, Legalized);
62 LLVM_DEBUG(dbgs() << "Legalized updates:\t");
80 std::vector<DomUpdate> Updates = {
84 PostDomSNCA::LegalizeUpdates(Updates, Legalized);
85 LLVM_DEBUG(dbgs() << "Legalized postdom updates:\t");
105 std::vector<DomUpdate> Updates = {{Insert, B, C}};
109 DT.applyUpdates(Updates);
111 PDT.applyUpdates(Updates);
127 std::vector<DomUpdate> Updates = {{Delete, B, C}}
[all...] |
| CFGBuilder.cpp | 32 std::vector<Update> Updates)
33 : F(F), Updates(std::move(Updates)) {
131 if (UpdateIdx == Updates.size())
133 return Updates[UpdateIdx];
137 if (UpdateIdx == Updates.size())
139 Update NextUpdate = Updates[UpdateIdx++];
154 OS << "Updates:\n";
156 for (const auto &U : Updates) {
182 EXPECT_FALSE(B.getNextUpdate()); // No updates to apply
[all...] |
| DeferredDominanceTest.cpp | 64 // Test discards of invalid self-domination updates. These use the single
71 std::vector<DominatorTree::UpdateType> Updates;
72 Updates.reserve(4);
73 Updates.push_back({DominatorTree::Delete, BB0, BB3});
74 Updates.push_back({DominatorTree::Delete, BB0, BB3});
77 Updates.push_back({DominatorTree::Insert, BB1, BB2});
79 Updates.push_back({DominatorTree::Delete, BB0, BB1});
91 // or analysis as it's part of the actual CFG. We only defer updates to the
101 // Verify. Updates to DDT must be applied *after* all changes to the CFG
103 DDT.applyUpdates(Updates);
[all...] |
| DomTreeUpdaterTest.cpp | 80 std::vector<DominatorTree::UpdateType> Updates;
81 Updates.reserve(4);
82 Updates.push_back({DominatorTree::Delete, BB0, BB3});
83 Updates.push_back({DominatorTree::Delete, BB0, BB3});
86 Updates.push_back({DominatorTree::Insert, BB1, BB2});
88 Updates.push_back({DominatorTree::Delete, BB0, BB1});
105 DTU.applyUpdates(Updates, /*ForceRemoveDuplicates*/ true);
260 std::vector<DominatorTree::UpdateType> Updates;
261 Updates.reserve(4);
262 Updates.push_back({DominatorTree::Delete, BB0, BB3})
[all...] |
| CFGBuilder.h | 48 /// It's able to apply the provided updates and automatically modify the IR.
73 std::vector<Update> Updates);
89 std::vector<Update> Updates;
|
| DominatorTreeTest.cpp | 685 std::vector<CFGBuilder::Update> Updates = {{Insert, {"12", "10"}},
689 CFGBuilder B(Holder.F, Arcs, Updates);
714 std::vector<CFGBuilder::Update> Updates = {{Insert, {"10", "7"}}};
715 CFGBuilder B(Holder.F, Arcs, Updates);
739 std::vector<CFGBuilder::Update> Updates = {{Insert, {"4", "5"}},
743 CFGBuilder B(Holder.F, Arcs, Updates);
765 std::vector<CFGBuilder::Update> Updates = {{Insert, {"3", "5"}}};
766 CFGBuilder B(Holder.F, Arcs, Updates);
790 std::vector<CFGBuilder::Update> Updates = {
794 CFGBuilder B(Holder.F, Arcs, Updates);
[all...] |
| /external/grpc-grpc/src/ruby/ |
| CHANGELOG.md | 6 * Updates to version 0.4 of googleauth. ([@tbetbetbe][])
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/IPO/ |
| GlobalDCE.h | 49 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64PromoteConstant.cpp | 189 /// Do the constant promotion indicated by the Updates records, keeping track
191 void promoteConstants(Function &F, SmallVectorImpl<UpdateRecord> &Updates,
515 Function &F, SmallVectorImpl<UpdateRecord> &Updates,
518 for (auto U = Updates.begin(), E = Updates.end(); U != E;) {
538 SmallVector<UpdateRecord, 64> Updates;
559 Updates.emplace_back(Cst, &I, OpNo);
563 if (Updates.empty())
566 promoteConstants(F, Updates, PromotionCache);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AArch64/ |
| AArch64PromoteConstant.cpp | 200 /// Do the constant promotion indicated by the Updates records, keeping track
202 void promoteConstants(Function &F, SmallVectorImpl<UpdateRecord> &Updates,
522 Function &F, SmallVectorImpl<UpdateRecord> &Updates,
525 for (auto U = Updates.begin(), E = Updates.end(); U != E;) {
545 SmallVector<UpdateRecord, 64> Updates;
566 Updates.emplace_back(Cst, &I, OpNo);
570 if (Updates.empty())
573 promoteConstants(F, Updates, PromotionCache);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/ |
| GlobalDCE.cpp | 123 SmallVectorImpl<GlobalValue *> *Updates) {
128 if (Updates)
129 Updates->push_back(&GV);
132 MarkLive(*CM.second, Updates); // Recursion depth is only two because only
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/ |
| PGOMemOPSizeOpt.cpp | 369 std::vector<DominatorTree::UpdateType> Updates;
371 Updates.reserve(2 * SizeIds.size());
388 Updates.push_back({DominatorTree::Insert, CaseBB, MergeBB});
389 Updates.push_back({DominatorTree::Insert, BB, CaseBB});
393 DTU.applyUpdates(Updates);
394 Updates.clear();
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | [all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 214 SmallVector<DominatorTree::UpdateType, 3> Updates;
215 Updates.push_back({DominatorTree::Insert, TIBB, NewBB});
216 Updates.push_back({DominatorTree::Insert, NewBB, DestBB});
218 Updates.push_back({DominatorTree::Delete, TIBB, DestBB});
220 DT->applyUpdates(Updates);
|
| Local.cpp | 231 std::vector <DominatorTree::UpdateType> Updates;
233 Updates.reserve(SI->getNumSuccessors() - 1);
243 Updates.push_back({DominatorTree::Delete, BB, Succ});
253 DDT->applyUpdates(Updates);
299 std::vector <DominatorTree::UpdateType> Updates;
301 Updates.reserve(IBI->getNumDestinations() - 1);
314 Updates.push_back({DominatorTree::Delete, ParentBB, DestBB});
331 DDT->applyUpdates(Updates);
682 std::vector <DominatorTree::UpdateType> Updates;
684 Updates.reserve(1 + (2 * pred_size(PredBB)))
[all...] |
| BasicBlockUtils.cpp | 53 std::vector<DominatorTree::UpdateType> Updates;
58 Updates.reserve(BBTerm->getNumSuccessors());
62 Updates.push_back({DominatorTree::Delete, BB, Succ});
79 DDT->applyUpdates(Updates);
97 MemDep->removeInstruction(PN); // Memdep updates AA itself.
159 std::vector<DominatorTree::UpdateType> Updates;
161 Updates.reserve(1 + (2 * succ_size(BB)));
162 Updates.push_back({DominatorTree::Delete, PredBB, BB});
164 Updates.push_back({DominatorTree::Delete, BB, *I});
165 Updates.push_back({DominatorTree::Insert, PredBB, *I})
[all...] |
| LoopRotationUtils.cpp | 409 SmallVector<DominatorTree::UpdateType, 3> Updates;
410 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit});
411 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader});
412 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader});
413 DT->applyUpdates(Updates);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/ |
| DomTreeUpdater.cpp | 30 // Discard updates by inspecting the current state of successors of From.
32 // altered we can determine if the update is unnecessary for batch updates
38 // 1. In batch updates, this update is unnecessary.
63 // Analyze pending updates to determine if the update is unnecessary.
69 // Only check duplicates in updates that are not applied by both trees.
78 return false; // Discard duplicate updates.
97 // Only apply updates not are applied by DomTree.
101 assert(I < E && "Iterator range invalid; there should be DomTree updates.");
118 // Only apply updates not are applied by PostDomTree.
123 "Iterator range invalid; there should be PostDomTree updates.")
[all...] |
| Dominators.cpp | 380 // one to queue updates to a DominatorTree.
384 /// Queues multiple updates and discards duplicates.
386 ArrayRef<DominatorTree::UpdateType> Updates) {
388 for (auto U : Updates)
398 /// to batch updates and call applyUpdates to quickly remove duplicate edges.
406 /// to batch updates and call applyUpdates to quickly remove duplicate edges.
438 /// Returns true if pending DT updates are queued for a flush() event.
441 /// Flushes all pending updates and block deletions. Returns a
444 // Updates to DT must happen before blocks are deleted below. Otherwise the
467 /// Debug method to help view the state of pending updates
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 24 /// updates (insertion and deletions). The implemented algorithm is based on
75 SmallVector<UpdateT, 4> Updates;
79 // DominatorTree last knew about, use the list of updates to reconstruct
122 // Depth Based Search algorithm to perform incremental updates in lockstep
123 // with updates to the CFG. We emulated lockstep CFG updates by getting its
124 // next snapshots by reverse-applying future updates.
131 // reverse-apply the future updates to get the node's children at the
569 dbgs() << "DomTree recalculated, skipping future batch updates\n");
691 // Updates the set of roots after insertion or deletion. This ensures tha
[all...] |
| /external/curl/scripts/ |
| updatemanpages.pl | 322 Updates the man pages with the version number and optional date. If the date
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
| DomTreeUpdater.h | 73 /// as having no pending updates. This function does not check
78 /// Returns true if there are DominatorTree updates queued.
82 /// Returns true if there are PostDominatorTree updates queued.
86 /// Apply updates on all available trees. Under Eager UpdateStrategy with
88 /// discard duplicated updates and self-dominance updates. If both DT and PDT
89 /// are nullptrs, this function discards all updates. The Eager Strategy
90 /// applies the updates immediately while the Lazy Strategy queues the
91 /// updates. It is required for the state of the LLVM IR to be updated
92 /// *before* applying the Updates because the internal update routine wil
[all...] |
| Dominators.h | 281 /// Class to defer updates to a DominatorTree.
283 /// Definition: Applying updates to every edge insertion and deletion is
286 /// advantage of the DominatorTree inspecting the set of updates to find
287 /// duplicates or unnecessary subtree updates.
291 /// It is not necessary for the user to scrub the updates for duplicates or
292 /// updates that point to the same block (Delete, BB_A, BB_A). Performance
293 /// can be gained if the caller attempts to batch updates before submitting
298 /// submitting updates. The update routines must analyze the current state
311 /// Queues multiple updates and discards duplicates.
312 void applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates);
[all...] |
| /external/clang/lib/AST/ |
| StmtOpenMP.cpp | 47 "Number of counter updates is not the same as the collapsed number");
106 Dir->setUpdates(Exprs.Updates);
158 Dir->setUpdates(Exprs.Updates);
211 Dir->setUpdates(Exprs.Updates);
380 Dir->setUpdates(Exprs.Updates);
431 Dir->setUpdates(Exprs.Updates);
[all...] |
| /external/vulkan-validation-layers/ |
| GOVERNANCE.md | 12 - Updates of validation layer functionality should be available in a timely fashion
|
