/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | IndirectBrExpandPass.cpp | 178 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl() local 180 Updates.reserve(IndirectBrSuccs.size()); in runImpl() 190 assert(Updates.size() == IndirectBrSuccs.size() && in runImpl() 192 DTU->applyUpdates(Updates); in runImpl() 215 SmallVector<DominatorTree::UpdateType, 8> Updates; in runImpl() local 224 Updates.reserve(IndirectBrSuccs.size()); in runImpl() 227 assert(Updates.size() == IndirectBrSuccs.size() && in runImpl() 243 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); in runImpl() 268 Updates.reserve(Updates.size() + BBs.size()); in runImpl() 271 Updates.push_back({DominatorTree::Insert, SwitchBB, BB}); in runImpl() [all …]
|
H A D | DwarfEHPrepare.cpp | 267 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() 302 DTU->applyUpdates(Updates); in InsertUnwindResumeCalls()
|
H A D | ScheduleDAG.cpp | 469 Updates.clear(); in InitDAGTopologicalSorting() 532 for (auto &U : Updates) in FixOrder() 534 Updates.clear(); in FixOrder() 541 Dirty = Dirty || Updates.size() > 10; in AddPredQueued() 546 Updates.emplace_back(Y, X); in AddPredQueued()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUUnifyDivergentExitNodes.cpp | 161 std::vector<DominatorTree::UpdateType> Updates; in unifyReturnBlockSet() local 162 Updates.reserve(ReturningBlocks.size()); in unifyReturnBlockSet() 172 Updates.push_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 249 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in run() 256 Updates.push_back({DominatorTree::Delete, BB, Successor}); in run() 279 Updates.reserve(Updates.size() + UnreachableBlocks.size()); in run() 317 DTU.applyUpdates(Updates); in run() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | BasicBlockUtils.cpp | 116 DTU->applyUpdates(Updates); in DeleteDeadBlocks() 256 Updates.reserve(Updates.size() + 2 * succ_size(BB) + 1); in MergeBlockIntoPredecessor() 325 DTU->applyUpdates(Updates); in MergeBlockIntoPredecessor() 909 DTU.applyUpdates(Updates); in ehAwareSplitEdge() 1046 Updates.reserve(Updates.size() + 2 * succ_size(New)); in SplitBlockImpl() 1053 DTU->applyUpdates(Updates); in SplitBlockImpl() 1152 Updates.reserve(Updates.size() + 2 * Preds.size()); in UpdateAnalysisInformation() 1158 DTU->applyUpdates(Updates); in UpdateAnalysisInformation() 1704 DTU->applyUpdates(Updates); in SplitBlockAndInsertIfThenElse() 2170 Updates.push_back( in CreateControlFlowHub() [all …]
|
H A D | SimplifyCFG.cpp | 1035 DTU->applyUpdates(Updates); in SimplifyEqualityComparisonWithOnlyPredecessor() 1312 Updates.reserve(Updates.size() + NewSuccessors.size()); in PerformValueComparisonIntoPredecessorFolding() 1361 Updates.push_back( in PerformValueComparisonIntoPredecessorFolding() 1373 DTU->applyUpdates(Updates); in PerformValueComparisonIntoPredecessorFolding() 1834 DTU->applyUpdates(Updates); in hoistSuccIdenticalTerminatorToSwitchOrIf() 2609 Updates.push_back( in MergeCompatibleInvokesImpl() 2622 Updates.push_back( in MergeCompatibleInvokesImpl() 5157 Updates.clear(); in removeEmptyCleanup() 5331 Updates.clear(); in simplifyUnreachable() 5342 Updates.clear(); in simplifyUnreachable() [all …]
|
H A D | BreakCriticalEdges.cpp | 244 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 D | Local.cpp | 297 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator() 300 DTU->applyUpdates(Updates); in ConstantFoldTerminator() 380 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator() 383 DTU->applyUpdates(Updates); in ConstantFoldTerminator() 788 Updates.reserve(Updates.size() + 2 * pred_size(PredBB) + 1); in MergeBasicBlockIntoOnlyPred() 830 DTU->applyUpdatesPermissive(Updates); in MergeBasicBlockIntoOnlyPred() 1259 Updates.reserve(Updates.size() + 2 * pred_size(BB) + 1); in TryToSimplifyUncondBranchFromEmptyBlock() 1339 DTU->applyUpdates(Updates); in TryToSimplifyUncondBranchFromEmptyBlock() 2828 Updates.reserve(UniqueSuccessors.size()); in changeToUnreachable() 2831 DTU->applyUpdates(Updates); in changeToUnreachable() [all …]
|
H A D | LoopRotationUtils.cpp | 794 SmallVector<DominatorTree::UpdateType, 3> Updates; in rotateLoop() local 795 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit}); in rotateLoop() 796 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader}); in rotateLoop() 797 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader}); in rotateLoop() 800 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true); in rotateLoop() 804 DT->applyUpdates(Updates); in rotateLoop()
|
H A D | SCCPSolver.cpp | 269 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local 273 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges() 277 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges() 281 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local 292 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges() 297 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges() 300 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local 315 Updates.push_back({DominatorTree::Delete, BB, DefaultDest}); in removeNonFeasibleEdges() 316 Updates.push_back({DominatorTree::Insert, BB, NewUnreachableBB}); in removeNonFeasibleEdges() 327 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SimplifyCFGPass.cpp | 85 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 D | JumpThreading.cpp | 1026 std::vector<DominatorTree::UpdateType> Updates; in processBlock() local 1030 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock() 1043 DTU->applyUpdatesPermissive(Updates); in processBlock() 1645 std::vector <DominatorTree::UpdateType> Updates; in processThreadableEdges() local 1661 DTU->applyUpdatesPermissive(Updates); in processThreadableEdges() 2494 std::vector<DominatorTree::UpdateType> Updates; in splitBlockPreds() local 2509 DTU->applyUpdatesPermissive(Updates); in splitBlockPreds() 2649 std::vector<DominatorTree::UpdateType> Updates; in duplicateCondBranchOnPHIIntoPred() local 2748 DTU->applyUpdatesPermissive(Updates); in duplicateCondBranchOnPHIIntoPred() 2988 std::vector<DominatorTree::UpdateType> Updates; in tryToUnfoldSelectInCurrBB() local [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DomTreeUpdater.cpp | 230 void DomTreeUpdater::applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates) { in applyUpdates() argument 235 PendUpdates.reserve(PendUpdates.size() + Updates.size()); in applyUpdates() 236 for (const auto &U : Updates) in applyUpdates() 244 DT->applyUpdates(Updates); in applyUpdates() 246 PDT->applyUpdates(Updates); in applyUpdates() 250 ArrayRef<DominatorTree::UpdateType> Updates) { in applyUpdatesPermissive() argument 256 for (const auto &U : Updates) { in applyUpdatesPermissive()
|
H A D | MemorySSAUpdater.cpp | 751 SmallVector<CFGUpdate, 4> Updates; in privateUpdateExitBlocksForClonedLoop() local 757 Updates.push_back({DT.Insert, NewExit, ExitSucc}); in privateUpdateExitBlocksForClonedLoop() 759 applyInsertUpdates(Updates, DT); in privateUpdateExitBlocksForClonedLoop() 784 void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates, in applyUpdates() argument 789 for (const auto &Update : Updates) { in applyUpdates() 807 DT.applyUpdates(Updates, RevDeleteUpdates); in applyUpdates() 825 DT.applyUpdates(Updates); in applyUpdates() 835 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyInsertUpdates() argument 838 applyInsertUpdates(Updates, DT, &GD); in applyInsertUpdates() 936 for (const auto &Edge : Updates) { in applyInsertUpdates() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64PromoteConstant.cpp | 202 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 D | PGOMemOPSizeOpt.cpp | 412 std::vector<DominatorTree::UpdateType> Updates; in perform() local 414 Updates.reserve(2 * SizeIds.size()); in perform() 432 Updates.push_back({DominatorTree::Insert, CaseBB, MergeBB}); in perform() 433 Updates.push_back({DominatorTree::Insert, BB, CaseBB}); in perform() 437 DTU.applyUpdates(Updates); in perform() 438 Updates.clear(); in perform()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 203 ArrayRef<typename DomTreeT::UpdateType> Updates); 561 void applyUpdates(ArrayRef<UpdateType> Updates) { 563 Updates, /*ReverseApplyUpdates=*/true); 572 void applyUpdates(ArrayRef<UpdateType> Updates, 574 if (Updates.empty()) { 583 SmallVector<UpdateType> AllUpdates(Updates.begin(), Updates.end()); 800 void recalculate(ParentType &Func, ArrayRef<UpdateType> Updates) { 802 DomTreeBuilder::CalculateWithUpdates(*this, Updates);
|
H A D | CFGDiff.h | 95 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates, 97 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph);
|
/freebsd/contrib/llvm-project/clang/lib/AST/ |
H A D | StmtOpenMP.cpp | 317 Dir->setUpdates(Exprs.Updates); in Create() 362 Dir->setUpdates(Exprs.Updates); in Create() 478 Dir->setUpdates(Exprs.Updates); in Create() 625 Dir->setUpdates(Exprs.Updates); in Create() 670 Dir->setUpdates(Exprs.Updates); in Create() 1002 Dir->setUpdates(Exprs.Updates); in Create() 1106 Dir->setUpdates(Exprs.Updates); in Create() 1151 Dir->setUpdates(Exprs.Updates); in Create() 1194 Dir->setUpdates(Exprs.Updates); in Create() 1239 Dir->setUpdates(Exprs.Updates); in Create() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | DomTreeUpdater.h | 123 void applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates); 146 void applyUpdatesPermissive(ArrayRef<DominatorTree::UpdateType> Updates);
|
H A D | MemorySSAUpdater.h | 123 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT, 126 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | GlobalDCE.cpp | 104 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/include/llvm/Transforms/IPO/ |
H A D | GlobalDCE.h | 70 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
|
/freebsd/contrib/libpcap/doc/ |
H A D | README.aix | 78 Updates for AIX filesets can be obtained from:
|
/freebsd/contrib/ntp/ |
H A D | readme.y2kfixes | 16 public as a series of "Y2K Application Updates", one update
|