Home
last modified time | relevance | path

Searched refs:Updates (Results 1 – 25 of 42) sorted by relevance

12

/llvm-project-15.0.7/llvm/unittests/IR/
H A DDominatorTreeBatchUpdatesTest.cpp55 std::vector<DomUpdate> Updates = { in TEST() local
78 std::vector<DomUpdate> Updates = { in TEST() local
107 DT.applyUpdates(Updates); in TEST()
109 PDT.applyUpdates(Updates); in TEST()
129 DT.applyUpdates(Updates); in TEST()
131 PDT.applyUpdates(Updates); in TEST()
160 DT.applyUpdates(Updates); in TEST()
162 PDT.applyUpdates(Updates); in TEST()
187 DT.applyUpdates(Updates); in TEST()
189 PDT.applyUpdates(Updates); in TEST()
[all …]
H A DCFGBuilder.cpp32 : F(F), Updates(std::move(Updates)) { in CFGBuilder()
130 if (UpdateIdx == Updates.size()) in getNextUpdate()
132 return Updates[UpdateIdx]; in getNextUpdate()
136 if (UpdateIdx == Updates.size()) in applyUpdate()
138 Update NextUpdate = Updates[UpdateIdx++]; in applyUpdate()
155 for (const auto &U : Updates) { in dump()
191 const size_t NumUpdates = Updates.size(); in TEST()
193 CFGBuilder B(Holder.F, {}, Updates); in TEST()
220 const size_t NumUpdates = Updates.size(); in TEST()
222 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
[all …]
H A DDominatorTreeTest.cpp719 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
745 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
773 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
796 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
824 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
852 while (std::next_permutation(Updates.begin(), Updates.end(), CompUpdates)) { in TEST()
854 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
881 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
907 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
937 CFGBuilder B(Holder.F, Arcs, Updates); in TEST()
[all …]
H A DCFGBuilder.h72 std::vector<Update> Updates);
88 std::vector<Update> Updates; variable
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp170 SmallVector<DominatorTree::UpdateType, 8> Updates; in runOnFunction() local
172 Updates.reserve(IndirectBrSuccs.size()); in runOnFunction()
182 assert(Updates.size() == IndirectBrSuccs.size() && in runOnFunction()
184 DTU->applyUpdates(Updates); in runOnFunction()
207 SmallVector<DominatorTree::UpdateType, 8> Updates; in runOnFunction() local
216 Updates.reserve(IndirectBrSuccs.size()); in runOnFunction()
219 assert(Updates.size() == IndirectBrSuccs.size() && in runOnFunction()
235 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); in runOnFunction()
260 Updates.reserve(Updates.size() + BBs.size()); in runOnFunction()
263 Updates.push_back({DominatorTree::Insert, SwitchBB, BB}); in runOnFunction()
[all …]
H A DDwarfEHPrepare.cpp266 std::vector<DominatorTree::UpdateType> Updates; in InsertUnwindResumeCalls() local
267 Updates.reserve(Resumes.size()); in InsertUnwindResumeCalls()
280 Updates.push_back({DominatorTree::Insert, Parent, UnwindBB}); in InsertUnwindResumeCalls()
301 DTU->applyUpdates(Updates); in InsertUnwindResumeCalls()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp157 std::vector<DominatorTree::UpdateType> Updates; in unifyReturnBlockSet() local
158 Updates.reserve(ReturningBlocks.size()); in unifyReturnBlockSet()
168 Updates.push_back({DominatorTree::Insert, BB, NewRetBlock}); in unifyReturnBlockSet()
172 DTU.applyUpdates(Updates); in unifyReturnBlockSet()
173 Updates.clear(); in unifyReturnBlockSet()
207 std::vector<DominatorTree::UpdateType> Updates; in runOnFunction() local
240 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in runOnFunction()
247 Updates.push_back({DominatorTree::Delete, BB, Successor}); in runOnFunction()
270 Updates.reserve(Updates.size() + UnreachableBlocks.size()); in runOnFunction()
308 DTU.applyUpdates(Updates); in runOnFunction()
[all …]
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DDomTreeUpdaterTest.cpp81 Updates.reserve(4); in TEST()
105 DTU.applyUpdatesPermissive(Updates); in TEST()
261 Updates.reserve(4); in TEST()
278 DTU.applyUpdatesPermissive(Updates); in TEST()
397 Updates.reserve(4); in TEST()
425 DTU.applyUpdatesPermissive(Updates); in TEST()
478 Updates.reserve(4); in TEST()
510 DTU.applyUpdatesPermissive(Updates); in TEST()
651 Updates.reserve(1); in TEST()
669 DTU.applyUpdates(Updates); in TEST()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp114 DTU->applyUpdates(Updates); in DeleteDeadBlocks()
242 Updates.reserve(Updates.size() + 2 * succ_size(BB) + 1); in MergeBlockIntoPredecessor()
312 DTU->applyUpdates(Updates); in MergeBlockIntoPredecessor()
676 DTU.applyUpdates(Updates); in ehAwareSplitEdge()
811 Updates.reserve(Updates.size() + 2 * succ_size(New)); in SplitBlockImpl()
818 DTU->applyUpdates(Updates); in SplitBlockImpl()
917 Updates.reserve(Updates.size() + 2 * Preds.size()); in UpdateAnalysisInformation()
1386 Updates.reserve(Updates.size() + 2 * succ_size(Tail)); in SplitBlockAndInsertIfThenImpl()
1417 DTU->applyUpdates(Updates); in SplitBlockAndInsertIfThenImpl()
1802 Updates.push_back( in CreateControlFlowHub()
[all …]
H A DSimplifyCFG.cpp1026 DTU->applyUpdates(Updates); in SimplifyEqualityComparisonWithOnlyPredecessor()
1308 Updates.reserve(Updates.size() + NewSuccessors.size()); in PerformValueComparisonIntoPredecessorFolding()
1357 Updates.push_back( in PerformValueComparisonIntoPredecessorFolding()
1369 DTU->applyUpdates(Updates); in PerformValueComparisonIntoPredecessorFolding()
1672 DTU->applyUpdates(Updates); in HoistThenElseCodeToIf()
2426 Updates.push_back( in MergeCompatibleInvokesImpl()
2439 Updates.push_back( in MergeCompatibleInvokesImpl()
4865 Updates.clear(); in removeEmptyCleanup()
5022 Updates.clear(); in simplifyUnreachable()
5031 Updates.clear(); in simplifyUnreachable()
[all …]
H A DBreakCriticalEdges.cpp244 SmallVector<DominatorTree::UpdateType, 3> Updates; in SplitKnownCriticalEdge() local
245 Updates.push_back({DominatorTree::Insert, TIBB, NewBB}); in SplitKnownCriticalEdge()
246 Updates.push_back({DominatorTree::Insert, NewBB, DestBB}); in SplitKnownCriticalEdge()
248 Updates.push_back({DominatorTree::Delete, TIBB, DestBB}); in SplitKnownCriticalEdge()
251 DT->applyUpdates(Updates); in SplitKnownCriticalEdge()
253 PDT->applyUpdates(Updates); in SplitKnownCriticalEdge()
H A DLocal.cpp289 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator()
292 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
376 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator()
379 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
772 Updates.reserve(Updates.size() + 2 * pred_size(PredBB) + 1); in MergeBasicBlockIntoOnlyPred()
814 DTU->applyUpdatesPermissive(Updates); in MergeBasicBlockIntoOnlyPred()
1113 Updates.reserve(Updates.size() + 2 * pred_size(BB) + 1); in TryToSimplifyUncondBranchFromEmptyBlock()
1177 DTU->applyUpdates(Updates); in TryToSimplifyUncondBranchFromEmptyBlock()
2154 Updates.reserve(UniqueSuccessors.size()); in changeToUnreachable()
2157 DTU->applyUpdates(Updates); in changeToUnreachable()
[all …]
H A DLoopRotationUtils.cpp578 SmallVector<DominatorTree::UpdateType, 3> Updates; in rotateLoop() local
579 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit}); in rotateLoop()
580 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader}); in rotateLoop()
581 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader}); in rotateLoop()
584 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true); in rotateLoop()
588 DT->applyUpdates(Updates); in rotateLoop()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp85 std::vector<DominatorTree::UpdateType> *Updates) { in performBlockTailMerging() argument
93 if (Updates) in performBlockTailMerging()
94 Updates->reserve(Updates->size() + BBs.size()); in performBlockTailMerging()
147 if (Updates) in performBlockTailMerging()
148 Updates->push_back({DominatorTree::Insert, BB, CanonicalBB}); in performBlockTailMerging()
209 std::vector<DominatorTree::UpdateType> Updates; in tailMergeBlocksWithSimilarFunctionTerminators() local
212 Changed |= performBlockTailMerging(F, BBs, DTU ? &Updates : nullptr); in tailMergeBlocksWithSimilarFunctionTerminators()
215 DTU->applyUpdates(Updates); in tailMergeBlocksWithSimilarFunctionTerminators()
H A DSCCP.cpp398 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
402 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
406 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
410 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
421 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
426 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
429 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
443 Updates.push_back({DominatorTree::Delete, BB, DefaultDest}); in removeNonFeasibleEdges()
444 Updates.push_back({DominatorTree::Insert, BB, NewUnreachableBB}); in removeNonFeasibleEdges()
455 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
[all …]
H A DJumpThreading.cpp1089 std::vector<DominatorTree::UpdateType> Updates; in processBlock() local
1093 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1106 DTU->applyUpdatesPermissive(Updates); in processBlock()
1703 std::vector <DominatorTree::UpdateType> Updates; in processThreadableEdges() local
1719 DTU->applyUpdatesPermissive(Updates); in processThreadableEdges()
2453 std::vector<DominatorTree::UpdateType> Updates; in splitBlockPreds() local
2468 DTU->applyUpdatesPermissive(Updates); in splitBlockPreds()
2612 std::vector<DominatorTree::UpdateType> Updates; in duplicateCondBranchOnPHIIntoPred() local
2706 DTU->applyUpdatesPermissive(Updates); in duplicateCondBranchOnPHIIntoPred()
2917 std::vector<DominatorTree::UpdateType> Updates; in tryToUnfoldSelectInCurrBB() local
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp231 void DomTreeUpdater::applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates) { in applyUpdates() argument
236 PendUpdates.reserve(PendUpdates.size() + Updates.size()); in applyUpdates()
237 for (const auto &U : Updates) in applyUpdates()
245 DT->applyUpdates(Updates); in applyUpdates()
247 PDT->applyUpdates(Updates); in applyUpdates()
251 ArrayRef<DominatorTree::UpdateType> Updates) { in applyUpdatesPermissive() argument
257 for (const auto &U : Updates) { in applyUpdatesPermissive()
H A DMemorySSAUpdater.cpp776 SmallVector<CFGUpdate, 4> Updates; in privateUpdateExitBlocksForClonedLoop() local
782 Updates.push_back({DT.Insert, NewExit, ExitSucc}); in privateUpdateExitBlocksForClonedLoop()
784 applyInsertUpdates(Updates, DT); in privateUpdateExitBlocksForClonedLoop()
809 void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates, in applyUpdates() argument
814 for (const auto &Update : Updates) { in applyUpdates()
832 DT.applyUpdates(Updates, RevDeleteUpdates); in applyUpdates()
850 DT.applyUpdates(Updates); in applyUpdates()
860 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyInsertUpdates() argument
863 applyInsertUpdates(Updates, DT, &GD); in applyInsertUpdates()
961 for (const auto &Edge : Updates) { in applyInsertUpdates()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64PromoteConstant.cpp202 void promoteConstants(Function &F, SmallVectorImpl<UpdateRecord> &Updates,
537 Function &F, SmallVectorImpl<UpdateRecord> &Updates, in promoteConstants() argument
540 for (auto U = Updates.begin(), E = Updates.end(); U != E;) { in promoteConstants()
560 SmallVector<UpdateRecord, 64> Updates; in runOnFunction() local
582 Updates.emplace_back(Cst, &I, OpNo); in runOnFunction()
586 if (Updates.empty()) in runOnFunction()
589 promoteConstants(F, Updates, PromotionCache); in runOnFunction()
/llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/
H A DPGOMemOPSizeOpt.cpp415 std::vector<DominatorTree::UpdateType> Updates; in perform() local
417 Updates.reserve(2 * SizeIds.size()); in perform()
435 Updates.push_back({DominatorTree::Insert, CaseBB, MergeBB}); in perform()
436 Updates.push_back({DominatorTree::Insert, BB, CaseBB}); in perform()
440 DTU.applyUpdates(Updates); in perform()
441 Updates.clear(); in perform()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DGenericDomTree.h202 ArrayRef<typename DomTreeT::UpdateType> Updates);
544 void applyUpdates(ArrayRef<UpdateType> Updates) {
546 Updates, /*ReverseApplyUpdates=*/true);
555 void applyUpdates(ArrayRef<UpdateType> Updates,
557 if (Updates.empty()) {
566 SmallVector<UpdateType> AllUpdates(Updates.begin(), Updates.end());
783 void recalculate(ParentType &Func, ArrayRef<UpdateType> Updates) {
785 DomTreeBuilder::CalculateWithUpdates(*this, Updates);
/llvm-project-15.0.7/clang/lib/AST/
H A DStmtOpenMP.cpp318 Dir->setUpdates(Exprs.Updates); in Create()
361 Dir->setUpdates(Exprs.Updates); in Create()
476 Dir->setUpdates(Exprs.Updates); in Create()
606 Dir->setUpdates(Exprs.Updates); in Create()
651 Dir->setUpdates(Exprs.Updates); in Create()
968 Dir->setUpdates(Exprs.Updates); in Create()
1072 Dir->setUpdates(Exprs.Updates); in Create()
1117 Dir->setUpdates(Exprs.Updates); in Create()
1160 Dir->setUpdates(Exprs.Updates); in Create()
1205 Dir->setUpdates(Exprs.Updates); in Create()
[all …]
/llvm-project-15.0.7/libcxx/docs/Status/
H A DRangesPaper.csv13 `[iterator.traits] <https://wg21.link/iterator.traits>`_,`Updates to iterator_traits <https://llvm.…
78 | `Updates to reverse_iterator <https://llvm.org/D120180>`_
79 | `Updates to back_insert_iterator <https://llvm.org/D103273>`_
80 | `Updates to front_insert_iterator <https://llvm.org/D103273>`_
81 | `Updates to move_iterator <https://llvm.org/D117656>`_","| [iterator.concepts]
94 | `Updates to istream_iterator <https://llvm.org/D119620>`_
95 | `Updates to ostream_iterator <https://llvm.org/D103273>`_
96 | `Updates to istreambuf_iterator <https://llvm.org/D119620>`_
97 | `Updates to ostreambuf_iterator <https://llvm.org/D103273>`_
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDomTreeUpdater.h123 void applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates);
146 void applyUpdatesPermissive(ArrayRef<DominatorTree::UpdateType> Updates);
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DGlobalDCE.cpp147 SmallVectorImpl<GlobalValue *> *Updates) { in MarkLive() argument
152 if (Updates) in MarkLive()
153 Updates->push_back(&GV); in MarkLive()
156 MarkLive(*CM.second, Updates); // Recursion depth is only two because only in MarkLive()

12