Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp177 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl() local
179 Updates.reserve(IndirectBrSuccs.size()); in runImpl()
183 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl()
189 assert(Updates.size() == IndirectBrSuccs.size() && in runImpl()
191 DTU->applyUpdates(Updates); in runImpl()
215 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl() local
224 Updates.reserve(IndirectBrSuccs.size()); in runImpl()
226 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl()
227 assert(Updates.size() == IndirectBrSuccs.size() && in runImpl()
243 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); in runImpl()
[all …]
H A DDwarfEHPrepare.cpp267 std::vector<DominatorTree::UpdateType> Updates; in InsertUnwindResumeCalls() local
268 Updates.reserve(Resumes.size()); in InsertUnwindResumeCalls()
281 Updates.push_back({DominatorTree::Insert, Parent, UnwindBB}); in InsertUnwindResumeCalls()
309 DTU->applyUpdates(Updates); in InsertUnwindResumeCalls()
H A DScheduleDAG.cpp473 Updates.clear(); in InitDAGTopologicalSorting()
536 for (auto &U : Updates) in FixOrder()
538 Updates.clear(); in FixOrder()
545 Dirty = Dirty || Updates.size() > 10; in AddPredQueued()
550 Updates.emplace_back(Y, X); in AddPredQueued()
/freebsd/contrib/llvm-project/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.emplace_back(DominatorTree::Insert, BB, NewRetBlock); in unifyReturnBlockSet()
172 DTU.applyUpdates(Updates); in unifyReturnBlockSet()
173 Updates.clear(); in unifyReturnBlockSet()
203 std::vector<DominatorTree::UpdateType> Updates; in run() local
241 Updates.emplace_back(DominatorTree::Insert, BB, DummyReturnBB); in run()
248 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in run()
252 Updates.emplace_back(DominatorTree::Insert, BB, TransitionBB); in run()
254 Updates.emplace_back(DominatorTree::Insert, TransitionBB, Successor); in run()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp63 SmallVectorImpl<DominatorTree::UpdateType> *Updates, in detachDeadBlocks() argument
71 if (Updates && UniqueSuccessors.insert(Succ).second) in detachDeadBlocks()
72 Updates->push_back({DominatorTree::Delete, BB, Succ}); in detachDeadBlocks()
111 SmallVector<DominatorTree::UpdateType, 4> Updates; in DeleteDeadBlocks() local
112 detachDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs); in DeleteDeadBlocks()
115 DTU->applyUpdates(Updates); in DeleteDeadBlocks()
246 std::vector<DominatorTree::UpdateType> Updates; in MergeBlockIntoPredecessor() local
253 Updates.reserve(Updates.size() + 2 * succ_size(BB) + 1); in MergeBlockIntoPredecessor()
264 Updates.push_back({DominatorTree::Insert, PredBB, SuccOfBB}); in MergeBlockIntoPredecessor()
268 Updates.push_back({DominatorTree::Delete, BB, SuccOfBB}); in MergeBlockIntoPredecessor()
[all …]
H A DControlFlowUtils.cpp296 SmallVector<DominatorTree::UpdateType, 16> Updates; in finalize() local
300 Updates.push_back({DominatorTree::Delete, BB, Succ0}); in finalize()
302 Updates.push_back({DominatorTree::Delete, BB, Succ1}); in finalize()
321 Updates.push_back({DominatorTree::Insert, BB, FirstGuardBlock}); in finalize()
324 Updates.push_back({DominatorTree::Insert, GuardBlocks[I], Outgoing[I]}); in finalize()
325 Updates.push_back( in finalize()
330 Updates.push_back({DominatorTree::Insert, GuardBlocks[NumGuards - 1], in finalize()
332 Updates.push_back({DominatorTree::Insert, GuardBlocks[NumGuards - 1], in finalize()
334 DTU->applyUpdates(Updates); in finalize()
H A DSimplifyCFG.cpp1001 std::vector<DominatorTree::UpdateType> Updates; in simplifyEqualityComparisonWithOnlyPredecessor() local
1004 Updates.push_back({DominatorTree::Delete, PredDef, I.first}); in simplifyEqualityComparisonWithOnlyPredecessor()
1005 DTU->applyUpdates(Updates); in simplifyEqualityComparisonWithOnlyPredecessor()
1059 SmallVector<DominatorTree::UpdateType, 2> Updates; in simplifyEqualityComparisonWithOnlyPredecessor() local
1060 Updates.reserve(RemovedSuccs.size()); in simplifyEqualityComparisonWithOnlyPredecessor()
1062 Updates.push_back({DominatorTree::Delete, TIBB, RemovedSucc}); in simplifyEqualityComparisonWithOnlyPredecessor()
1063 DTU->applyUpdates(Updates); in simplifyEqualityComparisonWithOnlyPredecessor()
1204 SmallVector<DominatorTree::UpdateType, 32> Updates; in performValueComparisonIntoPredecessorFolding() local
1270 Updates.push_back({DominatorTree::Delete, Pred, PredDefault}); in performValueComparisonIntoPredecessorFolding()
1348 Updates.reserve(Updates.size() + NewSuccessors.size()); in performValueComparisonIntoPredecessorFolding()
[all …]
H A DBreakCriticalEdges.cpp250 SmallVector<DominatorTree::UpdateType, 3> Updates; in SplitKnownCriticalEdge() local
251 Updates.push_back({DominatorTree::Insert, TIBB, NewBB}); in SplitKnownCriticalEdge()
252 Updates.push_back({DominatorTree::Insert, NewBB, DestBB}); in SplitKnownCriticalEdge()
254 Updates.push_back({DominatorTree::Delete, TIBB, DestBB}); in SplitKnownCriticalEdge()
257 DT->applyUpdates(Updates); in SplitKnownCriticalEdge()
259 PDT->applyUpdates(Updates); in SplitKnownCriticalEdge()
H A DLocal.cpp299 std::vector<DominatorTree::UpdateType> Updates; in ConstantFoldTerminator() local
300 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator()
302 Updates.push_back({DominatorTree::Delete, BB, RemovedSuccessor}); in ConstantFoldTerminator()
303 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
382 std::vector<DominatorTree::UpdateType> Updates; in ConstantFoldTerminator() local
383 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator()
385 Updates.push_back({DominatorTree::Delete, BB, RemovedSuccessor}); in ConstantFoldTerminator()
386 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
789 SmallVector<DominatorTree::UpdateType, 32> Updates; in MergeBasicBlockIntoOnlyPred() local
794 Updates.reserve(Updates.size() + 2 * pred_size(PredBB) + 1); in MergeBasicBlockIntoOnlyPred()
[all …]
H A DSCCPSolver.cpp309 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
313 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
317 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
321 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
332 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
338 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
341 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
358 Updates.push_back({DominatorTree::Delete, BB, DefaultDest}); in removeNonFeasibleEdges()
359 Updates.push_back({DominatorTree::Insert, BB, NewUnreachableBB}); in removeNonFeasibleEdges()
370 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DGenericDomTreeUpdaterImpl.h60 ArrayRef<UpdateT> Updates) { in applyUpdates() argument
65 PendUpdates.reserve(PendUpdates.size() + Updates.size()); in applyUpdates()
66 for (const auto &U : Updates) in applyUpdates()
74 DT->applyUpdates(Updates); in applyUpdates()
76 PDT->applyUpdates(Updates); in applyUpdates()
81 applyUpdatesPermissive(ArrayRef<UpdateT> Updates) { in applyUpdatesPermissive() argument
87 for (const auto &U : Updates) { in applyUpdatesPermissive()
453 std::vector<UpdateT> Updates; in splitPDTCriticalEdges() local
455 Updates.push_back({PostDomTreeT::Insert, Edge.FromBB, Edge.NewBB}); in splitPDTCriticalEdges()
456 Updates.push_back({PostDomTreeT::Insert, Edge.NewBB, Edge.ToBB}); in splitPDTCriticalEdges()
[all …]
H A DGenericDomTreeUpdater.h150 void applyUpdates(ArrayRef<UpdateT> Updates);
178 void applyUpdatesPermissive(ArrayRef<UpdateT> Updates);
272 void splitDTCriticalEdges(ArrayRef<CriticalEdge> Updates);
273 void splitPDTCriticalEdges(ArrayRef<CriticalEdge> Updates);
H A DMemorySSAUpdater.h125 LLVM_ABI void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT,
128 LLVM_ABI void applyInsertUpdates(ArrayRef<CFGUpdate> Updates,
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp91 std::vector<DominatorTree::UpdateType> *Updates) { in performBlockTailMerging() argument
99 if (Updates) in performBlockTailMerging()
100 Updates->reserve(Updates->size() + BBs.size()); in performBlockTailMerging()
155 if (Updates) in performBlockTailMerging()
156 Updates->push_back({DominatorTree::Insert, BB, CanonicalBB}); in performBlockTailMerging()
217 std::vector<DominatorTree::UpdateType> Updates; in tailMergeBlocksWithSimilarFunctionTerminators() local
220 Changed |= performBlockTailMerging(F, BBs, DTU ? &Updates : nullptr); in tailMergeBlocksWithSimilarFunctionTerminators()
223 DTU->applyUpdates(Updates); in tailMergeBlocksWithSimilarFunctionTerminators()
H A DJumpThreading.cpp1012 std::vector<DominatorTree::UpdateType> Updates; in processBlock() local
1016 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1021 Updates.push_back({DominatorTree::Delete, BB, Succ}); in processBlock()
1030 DTU->applyUpdatesPermissive(Updates); in processBlock()
1643 std::vector <DominatorTree::UpdateType> Updates; in processThreadableEdges() local
1644 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in processThreadableEdges()
1650 Updates.push_back({DominatorTree::Delete, BB, SuccBB}); in processThreadableEdges()
1660 DTU->applyUpdatesPermissive(Updates); in processThreadableEdges()
2515 std::vector<DominatorTree::UpdateType> Updates; in splitBlockPreds() local
2516 Updates.reserve((2 * Preds.size()) + NewBBs.size()); in splitBlockPreds()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PromoteConstant.cpp198 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()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DPGOMemOPSizeOpt.cpp406 std::vector<DominatorTree::UpdateType> Updates; in perform() local
408 Updates.reserve(2 * SizeIds.size()); in perform()
426 Updates.push_back({DominatorTree::Insert, CaseBB, MergeBB}); in perform()
427 Updates.push_back({DominatorTree::Insert, BB, CaseBB}); in perform()
431 DTU.applyUpdates(Updates); in perform()
432 Updates.clear(); in perform()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DGlobalDCE.cpp101 SmallVectorImpl<GlobalValue *> *Updates) { in MarkLive() argument
106 if (Updates) in MarkLive()
107 Updates->push_back(&GV); in MarkLive()
110 MarkLive(*CM.second, Updates); // Recursion depth is only two because only in MarkLive()
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DStmtOpenMP.cpp318 Dir->setUpdates(Exprs.Updates); in Create()
361 Dir->setUpdates(Exprs.Updates); in Create()
537 Dir->setUpdates(Exprs.Updates); in Create()
684 Dir->setUpdates(Exprs.Updates); in Create()
729 Dir->setUpdates(Exprs.Updates); in Create()
1078 Dir->setUpdates(Exprs.Updates); in Create()
1182 Dir->setUpdates(Exprs.Updates); in Create()
1227 Dir->setUpdates(Exprs.Updates); in Create()
1270 Dir->setUpdates(Exprs.Updates); in Create()
1315 Dir->setUpdates(Exprs.Updates); in Create()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombine.cpp1167 SmallVector<DominatorTree::UpdateType, 8> Updates; in inlineCompare() local
1168 Updates.push_back({DominatorTree::Insert, BBCI, BBSubs[0]}); in inlineCompare()
1171 Updates.push_back({DominatorTree::Insert, BBSubs[i], BBSubs[i + 1]}); in inlineCompare()
1172 Updates.push_back({DominatorTree::Insert, BBSubs[i], BBNE}); in inlineCompare()
1174 Updates.push_back({DominatorTree::Insert, BBNE, BBTail}); in inlineCompare()
1175 Updates.push_back({DominatorTree::Delete, BBCI, BBTail}); in inlineCompare()
1176 DTU->applyUpdates(Updates); in inlineCompare()
1213 SmallVector<DominatorTree::UpdateType, 8> Updates; in foldMemChr() local
1222 Updates.push_back({DominatorTree::Insert, BBSuccess, BBNext}); in foldMemChr()
1237 Updates.push_back({DominatorTree::Insert, BB, BBCase}); in foldMemChr()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DMemorySSAUpdater.cpp760 SmallVector<CFGUpdate, 4> Updates; in privateUpdateExitBlocksForClonedLoop() local
766 Updates.push_back({DT.Insert, NewExit, ExitSucc}); in privateUpdateExitBlocksForClonedLoop()
768 applyInsertUpdates(Updates, DT); in privateUpdateExitBlocksForClonedLoop()
793 void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates, in applyUpdates() argument
798 for (const auto &Update : Updates) { in applyUpdates()
816 DT.applyUpdates(Updates, RevDeleteUpdates); in applyUpdates()
834 DT.applyUpdates(Updates); in applyUpdates()
844 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyInsertUpdates() argument
847 applyInsertUpdates(Updates, DT, &GD); in applyInsertUpdates()
850 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyInsertUpdates() argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h197 ArrayRef<typename DomTreeT::UpdateType> Updates);
612 void applyUpdates(ArrayRef<UpdateType> Updates) {
614 Updates, /*ReverseApplyUpdates=*/true);
623 void applyUpdates(ArrayRef<UpdateType> Updates,
625 if (Updates.empty()) {
634 SmallVector<UpdateType> AllUpdates(Updates);
865 void recalculate(ParentType &Func, ArrayRef<UpdateType> Updates) {
868 DomTreeBuilder::CalculateWithUpdates(*this, Updates);
H A DCFGDiff.h95 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates,
97 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph);
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DGlobalDCE.h72 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
/freebsd/packages/ufs/
H A Dufs.ucl26 features such as Soft Updates, journaling, and snapshots.

123