| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| IndirectBrExpandPass.cpp | 174 SmallVector<DominatorTree::UpdateType, 8> Updates;
176 Updates.reserve(IndirectBrSuccs.size());
180 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB});
186 assert(Updates.size() == IndirectBrSuccs.size() &&
188 DTU->applyUpdates(Updates);
211 SmallVector<DominatorTree::UpdateType, 8> Updates;
220 Updates.reserve(IndirectBrSuccs.size());
222 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB});
223 assert(Updates.size() == IndirectBrSuccs.size() &&
239 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size())
[all...] |
| DwarfEHPrepare.cpp | 217 std::vector<DominatorTree::UpdateType> Updates;
218 Updates.reserve(Resumes.size());
229 Updates.push_back({DominatorTree::Insert, Parent, UnwindBB});
246 DTU->applyUpdates(Updates);
|
| ScheduleDAG.cpp | 466 // Cancel pending updates, mark as valid.
468 Updates.clear();
530 // Otherwise apply updates one-by-one.
531 for (auto &U : Updates)
533 Updates.clear();
538 // updates one-by-one for too many updates. The current cut-off is arbitrarily
540 Dirty = Dirty || Updates.size() > 10;
545 Updates.emplace_back(Y, X);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUUnifyDivergentExitNodes.cpp | 190 std::vector<DominatorTree::UpdateType> Updates;
191 Updates.reserve(ReturningBlocks.size());
201 Updates.push_back({DominatorTree::Insert, BB, NewRetBlock});
205 DTU.applyUpdates(Updates);
206 Updates.clear();
245 std::vector<DominatorTree::UpdateType> Updates;
303 Updates.push_back({DominatorTree::Insert, BB, DummyReturnBB});
310 Updates.reserve(Updates.size() + 2 * Successors.size() + 2);
314 Updates.push_back({DominatorTree::Insert, BB, TransitionBB})
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 57 SmallVectorImpl<DominatorTree::UpdateType> *Updates,
65 if (Updates && UniqueSuccessors.insert(Succ).second)
66 Updates->push_back({DominatorTree::Delete, BB, Succ});
85 "applying corresponding DTU updates.");
105 SmallVector<DominatorTree::UpdateType, 4> Updates;
106 DetatchDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs);
109 DTU->applyUpdates(Updates);
150 MemDep->removeInstruction(PN); // Memdep updates AA itself.
229 std::vector<DominatorTree::UpdateType> Updates;
234 Updates.reserve(Updates.size() + 2 * SuccsOfBB.size() + 1)
[all...] |
| SimplifyCFG.cpp | 930 std::vector<DominatorTree::UpdateType> Updates;
933 Updates.push_back({DominatorTree::Delete, PredDef, I.first});
934 DTU->applyUpdates(Updates);
988 SmallVector<DominatorTree::UpdateType, 2> Updates;
989 Updates.reserve(RemovedSuccs.size());
991 Updates.push_back({DominatorTree::Delete, TIBB, RemovedSucc});
992 DTU->applyUpdates(Updates);
1120 SmallVector<DominatorTree::UpdateType, 32> Updates;
1186 Updates.push_back({DominatorTree::Delete, Pred, PredDefault});
1264 Updates.reserve(Updates.size() + NewSuccessors.size())
[all...] |
| BreakCriticalEdges.cpp | 250 SmallVector<DominatorTree::UpdateType, 3> Updates;
251 Updates.push_back({DominatorTree::Insert, TIBB, NewBB});
252 Updates.push_back({DominatorTree::Insert, NewBB, DestBB});
254 Updates.push_back({DominatorTree::Delete, TIBB, DestBB});
257 DT->applyUpdates(Updates);
259 PDT->applyUpdates(Updates);
|
| LoopRotationUtils.cpp | 583 SmallVector<DominatorTree::UpdateType, 3> Updates;
584 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit});
585 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader});
586 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader});
589 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true);
593 DT->applyUpdates(Updates);
|
| Local.cpp | 291 std::vector<DominatorTree::UpdateType> Updates;
292 Updates.reserve(RemovedSuccessors.size());
294 Updates.push_back({DominatorTree::Delete, BB, RemovedSuccessor});
295 DTU->applyUpdates(Updates);
378 std::vector<DominatorTree::UpdateType> Updates;
379 Updates.reserve(RemovedSuccessors.size());
381 Updates.push_back({DominatorTree::Delete, BB, RemovedSuccessor});
382 DTU->applyUpdates(Updates);
743 // DTU updates: Collect all the edges that enter
745 SmallVector<DominatorTree::UpdateType, 32> Updates;
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/util/ |
| openssl-update-copyright | 31 Updates the year ranges of all OpenSSL copyright statements in the given
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 85 std::vector<DominatorTree::UpdateType> Updates;
149 Updates.reserve(Updates.size() + 2 * PredsOfBB.size());
154 Updates.push_back({DominatorTree::Insert, Predecessor, RetBlock});
156 Updates.push_back({DominatorTree::Delete, Predecessor, &BB});
184 Updates.push_back({DominatorTree::Insert, &BB, RetBlock});
188 DTU->applyUpdates(Updates);
|
| JumpThreading.cpp | 1097 std::vector<DominatorTree::UpdateType> Updates;
1101 Updates.reserve(BBTerm->getNumSuccessors());
1106 Updates.push_back({DominatorTree::Delete, BB, Succ});
1114 DTU->applyUpdatesPermissive(Updates);
1720 std::vector <DominatorTree::UpdateType> Updates;
1721 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1);
1727 Updates.push_back({DominatorTree::Delete, BB, SuccBB});
1736 DTU->applyUpdatesPermissive(Updates);
2425 // Enqueue required DT updates.
2469 std::vector<DominatorTree::UpdateType> Updates;
[all...] |
| SCCP.cpp | 372 SmallVector<DominatorTree::UpdateType, 8> Updates;
383 Updates.push_back({DominatorTree::Delete, BB, Succ});
388 DTU.applyUpdatesPermissive(Updates);
391 SmallVector<DominatorTree::UpdateType, 8> Updates;
400 Updates.push_back({DominatorTree::Delete, BB, Succ});
405 DTU.applyUpdatesPermissive(Updates);
|
| LoopUnswitch.cpp | 1065 SmallVector<DominatorTree::UpdateType, 3> Updates;
1067 Updates.push_back({DominatorTree::Insert, OldBranchParent, TrueDest});
1069 Updates.push_back({DominatorTree::Insert, OldBranchParent, FalseDest});
1073 Updates.push_back({DominatorTree::Delete, OldBranchParent, OldBranchSucc});
1077 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true);
1079 DT->applyUpdates(Updates);
1734 // Make the LPM and Worklist updates specific to LoopUnswitch.
1746 // Merge the block and make the remaining analyses updates.
|
| /src/external/apache2/llvm/dist/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,
537 Function &F, SmallVectorImpl<UpdateRecord> &Updates,
540 for (auto U = Updates.begin(), E = Updates.end(); U != E;) {
560 SmallVector<UpdateRecord, 64> Updates;
582 Updates.emplace_back(Cst, &I, OpNo);
586 if (Updates.empty())
589 promoteConstants(F, Updates, PromotionCache);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/ |
| GlobalDCE.h | 56 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomTreeUpdater.cpp | 31 // Discard updates by inspecting the current state of successors of From.
33 // altered we can determine if the update is unnecessary for batch updates
38 // 1. In batch updates, this update is unnecessary.
62 // Only apply updates not are applied by DomTree.
66 assert(I < E && "Iterator range invalid; there should be DomTree updates.");
83 // Only apply updates not are applied by PostDomTree.
88 "Iterator range invalid; there should be PostDomTree updates.");
172 // The DT and PDT require the nodes related to updates
230 void DomTreeUpdater::applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates) {
235 PendUpdates.reserve(PendUpdates.size() + Updates.size())
[all...] |
| MemorySSAUpdater.cpp | 777 SmallVector<CFGUpdate, 4> Updates;
783 Updates.push_back({DT.Insert, NewExit, ExitSucc});
785 applyInsertUpdates(Updates, DT);
810 void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates,
815 for (auto &Update : Updates) {
831 // Apply all updates, with the RevDeleteUpdates as PostCFGView.
832 DT.applyUpdates(Updates, RevDeleteUpdates);
837 // updates above; for "children" purposes they are equivalent; but the
838 // updates themselves convey the desired update, used inside DT only.
846 DT.applyUpdates(Updates);
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| DomTreeUpdater.h | 74 /// as having no pending updates. This function does not check
79 /// Returns true if there are DominatorTree updates queued.
83 /// Returns true if there are PostDominatorTree updates queued.
90 /// These methods provide APIs for submitting updates to the DominatorTree and
95 /// 1. Eager UpdateStrategy: Updates are submitted and then flushed
97 /// 2. Lazy UpdateStrategy: Updates are submitted but only flushed when you
99 /// when you submit a bunch of updates multiple times which can then
100 /// add up to a large number of updates between two queries on the
101 /// DominatorTree. The incremental updater can reschedule the updates or
103 /// process depending on the number of updates
[all...] |
| MemorySSAUpdater.h | 12 // automatically updates the MemorySSA IR to be correct.
122 /// Apply CFG updates, analogous with the DT edge updates. By default, the
124 /// update the DT with the same updates.
125 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT,
127 /// Apply CFG insert updates, analogous with the DT edge updates.
128 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| CFGDiff.h | 28 // also equivalent to applying updates in reverse.
53 // a getChildren method to get a Node's children based on the additional updates
65 // By default, it is assumed that, given a CFG and a set of updates, we wish
66 // to apply these updates as given. If UpdatedAreReverseApplied is set, the
67 // updates will be applied in reverse: deleted edges are considered re-added
71 // Keep the list of legalized updates for a deterministic order of updates
72 // when using a GraphDiff for incremental updates in the DominatorTree.
95 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates,
97 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph)
[all...] |
| GenericDomTree.h | 202 ArrayRef<typename DomTreeT::UpdateType> Updates);
516 /// This function should be used when there were multiple CFG updates after
517 /// the last dominator tree update. It takes care of performing the updates
520 /// The functions expects the sequence of updates to be balanced. Eg.:
530 /// The applyUpdates function can reorder the updates and remove redundant
536 /// updates on reverse edges internally (so there's no need to swap the
538 /// The type of updates is the same for DomTreeBase<T> and PostDomTreeBase<T>
541 /// \param Updates An unordered sequence of updates to perform. The current
542 /// CFG and the reverse of these updates provides the pre-view of the CFG
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| PGOMemOPSizeOpt.cpp | 461 std::vector<DominatorTree::UpdateType> Updates;
463 Updates.reserve(2 * SizeIds.size());
481 Updates.push_back({DominatorTree::Insert, CaseBB, MergeBB});
482 Updates.push_back({DominatorTree::Insert, BB, CaseBB});
486 DTU.applyUpdates(Updates);
487 Updates.clear();
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| GlobalDCE.cpp | 145 SmallVectorImpl<GlobalValue *> *Updates) {
150 if (Updates)
151 Updates->push_back(&GV);
154 MarkLive(*CM.second, Updates); // Recursion depth is only two because only
|
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| StmtOpenMP.cpp | 208 "Number of counter updates is not the same as the collapsed number");
274 Dir->setUpdates(Exprs.Updates);
317 Dir->setUpdates(Exprs.Updates);
384 Dir->setUpdates(Exprs.Updates);
514 Dir->setUpdates(Exprs.Updates);
559 Dir->setUpdates(Exprs.Updates);
852 Dir->setUpdates(Exprs.Updates);
956 Dir->setUpdates(Exprs.Updates);
1001 Dir->setUpdates(Exprs.Updates);
1044 Dir->setUpdates(Exprs.Updates);
[all...] |
