Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp178 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl() local
180 Updates.reserve(IndirectBrSuccs.size()); in runImpl()
184 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl()
190 assert(Updates.size() == IndirectBrSuccs.size() && in runImpl()
192 DTU->applyUpdates(Updates); in runImpl()
216 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl() local
225 Updates.reserve(IndirectBrSuccs.size()); in runImpl()
227 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); in runImpl()
228 assert(Updates.size() == IndirectBrSuccs.size() && in runImpl()
244 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); in runImpl()
[all …]
H A DDwarfEHPrepare.cpp268 std::vector<DominatorTree::UpdateType> Updates; in InsertUnwindResumeCalls() local
269 Updates.reserve(Resumes.size()); in InsertUnwindResumeCalls()
282 Updates.push_back({DominatorTree::Insert, Parent, UnwindBB}); in InsertUnwindResumeCalls()
310 DTU->applyUpdates(Updates); in InsertUnwindResumeCalls()
H A DScheduleDAG.cpp471 Updates.clear(); in InitDAGTopologicalSorting()
534 for (auto &U : Updates) in FixOrder()
536 Updates.clear(); in FixOrder()
543 Dirty = Dirty || Updates.size() > 10; in AddPredQueued()
548 Updates.emplace_back(Y, X); in AddPredQueued()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp161 std::vector<DominatorTree::UpdateType> Updates; in unifyReturnBlockSet() local
162 Updates.reserve(ReturningBlocks.size()); in unifyReturnBlockSet()
172 Updates.emplace_back(DominatorTree::Insert, BB, NewRetBlock); in unifyReturnBlockSet()
176 DTU.applyUpdates(Updates); in unifyReturnBlockSet()
177 Updates.clear(); in unifyReturnBlockSet()
207 std::vector<DominatorTree::UpdateType> Updates; in run() local
242 Updates.emplace_back(DominatorTree::Insert, BB, DummyReturnBB); in run()
249 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in run()
253 Updates.emplace_back(DominatorTree::Insert, BB, TransitionBB); in run()
255 Updates.emplace_back(DominatorTree::Insert, TransitionBB, Successor); in run()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp64 SmallVectorImpl<DominatorTree::UpdateType> *Updates, in detachDeadBlocks() argument
72 if (Updates && UniqueSuccessors.insert(Succ).second) in detachDeadBlocks()
73 Updates->push_back({DominatorTree::Delete, BB, Succ}); in detachDeadBlocks()
112 SmallVector<DominatorTree::UpdateType, 4> Updates; in DeleteDeadBlocks() local
113 detachDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs); in DeleteDeadBlocks()
116 DTU->applyUpdates(Updates); in DeleteDeadBlocks()
249 std::vector<DominatorTree::UpdateType> Updates; in MergeBlockIntoPredecessor() local
256 Updates.reserve(Updates.size() + 2 * succ_size(BB) + 1); in MergeBlockIntoPredecessor()
267 Updates.push_back({DominatorTree::Insert, PredBB, SuccOfBB}); in MergeBlockIntoPredecessor()
271 Updates.push_back({DominatorTree::Delete, BB, SuccOfBB}); in MergeBlockIntoPredecessor()
[all …]
H A DSimplifyCFG.cpp976 std::vector<DominatorTree::UpdateType> Updates; in SimplifyEqualityComparisonWithOnlyPredecessor() local
979 Updates.push_back({DominatorTree::Delete, PredDef, I.first}); in SimplifyEqualityComparisonWithOnlyPredecessor()
980 DTU->applyUpdates(Updates); in SimplifyEqualityComparisonWithOnlyPredecessor()
1034 SmallVector<DominatorTree::UpdateType, 2> Updates; in SimplifyEqualityComparisonWithOnlyPredecessor() local
1035 Updates.reserve(RemovedSuccs.size()); in SimplifyEqualityComparisonWithOnlyPredecessor()
1037 Updates.push_back({DominatorTree::Delete, TIBB, RemovedSucc}); in SimplifyEqualityComparisonWithOnlyPredecessor()
1038 DTU->applyUpdates(Updates); in SimplifyEqualityComparisonWithOnlyPredecessor()
1168 SmallVector<DominatorTree::UpdateType, 32> Updates; in PerformValueComparisonIntoPredecessorFolding() local
1234 Updates.push_back({DominatorTree::Delete, Pred, PredDefault}); in PerformValueComparisonIntoPredecessorFolding()
1312 Updates.reserve(Updates.size() + NewSuccessors.size()); in PerformValueComparisonIntoPredecessorFolding()
[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.cpp297 std::vector<DominatorTree::UpdateType> Updates; in ConstantFoldTerminator() local
298 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator()
300 Updates.push_back({DominatorTree::Delete, BB, RemovedSuccessor}); in ConstantFoldTerminator()
301 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
380 std::vector<DominatorTree::UpdateType> Updates; in ConstantFoldTerminator() local
381 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator()
383 Updates.push_back({DominatorTree::Delete, BB, RemovedSuccessor}); in ConstantFoldTerminator()
384 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
790 SmallVector<DominatorTree::UpdateType, 32> Updates; in MergeBasicBlockIntoOnlyPred() local
795 Updates.reserve(Updates.size() + 2 * pred_size(PredBB) + 1); in MergeBasicBlockIntoOnlyPred()
[all …]
H A DLoopRotationUtils.cpp823 SmallVector<DominatorTree::UpdateType, 3> Updates; in rotateLoop() local
824 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit}); in rotateLoop()
825 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader}); in rotateLoop()
826 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader}); in rotateLoop()
829 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true); in rotateLoop()
833 DT->applyUpdates(Updates); in rotateLoop()
H A DSCCPSolver.cpp285 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
289 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
293 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
297 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
308 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
314 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
317 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
332 Updates.push_back({DominatorTree::Delete, BB, DefaultDest}); in removeNonFeasibleEdges()
333 Updates.push_back({DominatorTree::Insert, BB, NewUnreachableBB}); in removeNonFeasibleEdges()
344 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp88 std::vector<DominatorTree::UpdateType> *Updates) { in performBlockTailMerging() argument
96 if (Updates) in performBlockTailMerging()
97 Updates->reserve(Updates->size() + BBs.size()); in performBlockTailMerging()
152 if (Updates) in performBlockTailMerging()
153 Updates->push_back({DominatorTree::Insert, BB, CanonicalBB}); in performBlockTailMerging()
214 std::vector<DominatorTree::UpdateType> Updates; in tailMergeBlocksWithSimilarFunctionTerminators() local
217 Changed |= performBlockTailMerging(F, BBs, DTU ? &Updates : nullptr); in tailMergeBlocksWithSimilarFunctionTerminators()
220 DTU->applyUpdates(Updates); in tailMergeBlocksWithSimilarFunctionTerminators()
H A DJumpThreading.cpp1015 std::vector<DominatorTree::UpdateType> Updates; in processBlock() local
1019 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1024 Updates.push_back({DominatorTree::Delete, BB, Succ}); in processBlock()
1033 DTU->applyUpdatesPermissive(Updates); in processBlock()
1633 std::vector <DominatorTree::UpdateType> Updates; in processThreadableEdges() local
1634 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in processThreadableEdges()
1640 Updates.push_back({DominatorTree::Delete, BB, SuccBB}); in processThreadableEdges()
1650 DTU->applyUpdatesPermissive(Updates); in processThreadableEdges()
2486 std::vector<DominatorTree::UpdateType> Updates; in splitBlockPreds() local
2487 Updates.reserve((2 * Preds.size()) + NewBBs.size()); in splitBlockPreds()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DGenericDomTreeUpdaterImpl.h59 ArrayRef<typename DomTreeT::UpdateType> Updates) { in applyUpdates() argument
64 PendUpdates.reserve(PendUpdates.size() + Updates.size()); in applyUpdates()
65 for (const auto &U : Updates) in applyUpdates()
73 DT->applyUpdates(Updates); in applyUpdates()
75 PDT->applyUpdates(Updates); in applyUpdates()
80 applyUpdatesPermissive(ArrayRef<typename DomTreeT::UpdateType> Updates) { in applyUpdatesPermissive() argument
86 for (const auto &U : Updates) { in applyUpdatesPermissive()
H A DGenericDomTreeUpdater.h149 void applyUpdates(ArrayRef<typename DomTreeT::UpdateType> Updates);
172 void applyUpdatesPermissive(ArrayRef<typename DomTreeT::UpdateType> Updates);
H A DMemorySSAUpdater.h123 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT,
126 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
/freebsd/contrib/llvm-project/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()
/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/include/llvm/Support/
H A DGenericDomTree.h201 ArrayRef<typename DomTreeT::UpdateType> Updates);
559 void applyUpdates(ArrayRef<UpdateType> Updates) {
561 Updates, /*ReverseApplyUpdates=*/true);
570 void applyUpdates(ArrayRef<UpdateType> Updates,
572 if (Updates.empty()) {
581 SmallVector<UpdateType> AllUpdates(Updates.begin(), Updates.end());
798 void recalculate(ParentType &Func, ArrayRef<UpdateType> Updates) {
800 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/clang/lib/AST/
H A DStmtOpenMP.cpp317 Dir->setUpdates(Exprs.Updates); in Create()
362 Dir->setUpdates(Exprs.Updates); in Create()
516 Dir->setUpdates(Exprs.Updates); in Create()
663 Dir->setUpdates(Exprs.Updates); in Create()
708 Dir->setUpdates(Exprs.Updates); in Create()
1040 Dir->setUpdates(Exprs.Updates); in Create()
1144 Dir->setUpdates(Exprs.Updates); in Create()
1189 Dir->setUpdates(Exprs.Updates); in Create()
1232 Dir->setUpdates(Exprs.Updates); in Create()
1277 Dir->setUpdates(Exprs.Updates); in Create()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombine.cpp1098 SmallVector<DominatorTree::UpdateType, 8> Updates; in inlineCompare() local
1099 Updates.push_back({DominatorTree::Insert, BBCI, BBSubs[0]}); in inlineCompare()
1102 Updates.push_back({DominatorTree::Insert, BBSubs[i], BBSubs[i + 1]}); in inlineCompare()
1103 Updates.push_back({DominatorTree::Insert, BBSubs[i], BBNE}); in inlineCompare()
1105 Updates.push_back({DominatorTree::Insert, BBNE, BBTail}); in inlineCompare()
1106 Updates.push_back({DominatorTree::Delete, BBCI, BBTail}); in inlineCompare()
1107 DTU->applyUpdates(Updates); in inlineCompare()
1143 SmallVector<DominatorTree::UpdateType, 8> Updates; in foldMemChr() local
1152 Updates.push_back({DominatorTree::Insert, BBSuccess, BBNext}); in foldMemChr()
1167 Updates.push_back({DominatorTree::Insert, BB, BBCase}); in foldMemChr()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DGlobalDCE.cpp104 SmallVectorImpl<GlobalValue *> *Updates) { in MarkLive() argument
109 if (Updates) in MarkLive()
110 Updates->push_back(&GV); in MarkLive()
113 MarkLive(*CM.second, Updates); // Recursion depth is only two because only in MarkLive()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DMemorySSAUpdater.cpp751 SmallVector<CFGUpdate, 4> Updates; in updateForClonedLoop()
757 Updates.push_back({DT.Insert, NewExit, ExitSucc}); in updateForClonedBlockIntoPred()
759 applyInsertUpdates(Updates, DT); in updateForClonedBlockIntoPred()
784 void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates, in privateUpdateExitBlocksForClonedLoop()
789 for (const auto &Update : Updates) { in updateExitBlocksForClonedLoop()
807 DT.applyUpdates(Updates, RevDeleteUpdates); in updateExitBlocksForClonedLoop()
825 DT.applyUpdates(Updates); in applyUpdates()
835 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyUpdates()
838 applyInsertUpdates(Updates, DT, &GD); in applyUpdates()
841 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyUpdates()
776 SmallVector<CFGUpdate, 4> Updates; privateUpdateExitBlocksForClonedLoop() local
809 applyUpdates(ArrayRef<CFGUpdate> Updates,DominatorTree & DT,bool UpdateDT) applyUpdates() argument
860 applyInsertUpdates(ArrayRef<CFGUpdate> Updates,DominatorTree & DT) applyInsertUpdates() argument
866 applyInsertUpdates(ArrayRef<CFGUpdate> Updates,DominatorTree & DT,const GraphDiff<BasicBlock * > * GD) applyInsertUpdates() argument
[all...]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DGlobalDCE.h70 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
/freebsd/contrib/libpcap/doc/
H A DREADME.aix78 Updates for AIX filesets can be obtained from:

123