| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | IndirectBrExpandPass.cpp | 174 SmallVector<DominatorTree::UpdateType, 8> Updates; in runOnFunction() local 176 Updates.reserve(IndirectBrSuccs.size()); in runOnFunction() 186 assert(Updates.size() == IndirectBrSuccs.size() && in runOnFunction() 188 DTU->applyUpdates(Updates); in runOnFunction() 211 SmallVector<DominatorTree::UpdateType, 8> Updates; in runOnFunction() local 220 Updates.reserve(IndirectBrSuccs.size()); in runOnFunction() 223 assert(Updates.size() == IndirectBrSuccs.size() && in runOnFunction() 239 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); in runOnFunction() 264 Updates.reserve(Updates.size() + UniqueSuccessors.size()); in runOnFunction() 266 Updates.push_back({DominatorTree::Insert, SwitchBB, BB}); in runOnFunction() [all …]
|
| H A D | DwarfEHPrepare.cpp | 240 std::vector<DominatorTree::UpdateType> Updates; in InsertUnwindResumeCalls() local 241 Updates.reserve(Resumes.size()); in InsertUnwindResumeCalls() 252 Updates.push_back({DominatorTree::Insert, Parent, UnwindBB}); in InsertUnwindResumeCalls() 269 DTU->applyUpdates(Updates); in InsertUnwindResumeCalls()
|
| H A D | ScheduleDAG.cpp | 468 Updates.clear(); in InitDAGTopologicalSorting() 531 for (auto &U : Updates) in FixOrder() 533 Updates.clear(); in FixOrder() 540 Dirty = Dirty || Updates.size() > 10; in AddPredQueued() 545 Updates.emplace_back(Y, X); in AddPredQueued()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 157 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 …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | BasicBlockUtils.cpp | 109 DTU->applyUpdates(Updates); in DeleteDeadBlocks() 234 Updates.reserve(Updates.size() + 2 * SuccsOfBB.size() + 1); in MergeBlockIntoPredecessor() 302 DTU->applyUpdates(Updates); in MergeBlockIntoPredecessor() 652 DTU.applyUpdates(Updates); in ehAwareSplitEdge() 789 Updates.reserve(Updates.size() + 2 * UniqueSuccessorsOfOld.size()); in SplitBlockImpl() 795 DTU->applyUpdates(Updates); in SplitBlockImpl() 894 Updates.reserve(Updates.size() + 2 * UniquePreds.size()); in UpdateAnalysisInformation() 1361 Updates.reserve(Updates.size() + 2 * UniqueSuccessorsOfHead.size()); in SplitBlockAndInsertIfThenImpl() 1391 DTU->applyUpdates(Updates); in SplitBlockAndInsertIfThenImpl() 1776 Updates.push_back( in CreateControlFlowHub() [all …]
|
| H A D | SimplifyCFG.cpp | 986 DTU->applyUpdates(Updates); in SimplifyEqualityComparisonWithOnlyPredecessor() 1268 Updates.reserve(Updates.size() + NewSuccessors.size()); in PerformValueComparisonIntoPredecessorFolding() 1317 Updates.push_back( in PerformValueComparisonIntoPredecessorFolding() 1329 DTU->applyUpdates(Updates); in PerformValueComparisonIntoPredecessorFolding() 1640 DTU->applyUpdates(Updates); in HoistThenElseCodeToIf() 2911 DTU->applyUpdates(Updates); in FoldTwoEntryPHINode() 3796 DTU->applyUpdates(Updates); in SimplifyCondBranchToCondBranch() 4483 Updates.clear(); in removeEmptyCleanup() 4640 Updates.clear(); in simplifyUnreachable() 4649 Updates.clear(); in simplifyUnreachable() [all …]
|
| H A D | BreakCriticalEdges.cpp | 250 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 D | Local.cpp | 292 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator() 295 DTU->applyUpdates(Updates); in ConstantFoldTerminator() 379 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator() 382 DTU->applyUpdates(Updates); in ConstantFoldTerminator() 765 Updates.reserve(Updates.size() + 2 * PredsOfPredBB.size() + 1); in MergeBasicBlockIntoOnlyPred() 804 DTU->applyUpdatesPermissive(Updates); in MergeBasicBlockIntoOnlyPred() 1102 Updates.reserve(Updates.size() + 2 * PredsOfBB.size() + 1); in TryToSimplifyUncondBranchFromEmptyBlock() 1163 DTU->applyUpdates(Updates); in TryToSimplifyUncondBranchFromEmptyBlock() 2144 Updates.reserve(UniqueSuccessors.size()); in changeToUnreachable() 2147 DTU->applyUpdates(Updates); in changeToUnreachable() [all …]
|
| H A D | LoopRotationUtils.cpp | 583 SmallVector<DominatorTree::UpdateType, 3> Updates; in rotateLoop() local 584 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit}); in rotateLoop() 585 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader}); in rotateLoop() 586 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader}); in rotateLoop() 589 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true); in rotateLoop() 593 DT->applyUpdates(Updates); in rotateLoop()
|
| /freebsd-13.1/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-13.1/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 | 777 SmallVector<CFGUpdate, 4> Updates; in privateUpdateExitBlocksForClonedLoop() local 783 Updates.push_back({DT.Insert, NewExit, ExitSucc}); in privateUpdateExitBlocksForClonedLoop() 785 applyInsertUpdates(Updates, DT); in privateUpdateExitBlocksForClonedLoop() 810 void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates, in applyUpdates() argument 815 for (auto &Update : Updates) { in applyUpdates() 832 DT.applyUpdates(Updates, RevDeleteUpdates); in applyUpdates() 846 DT.applyUpdates(Updates); in applyUpdates() 856 void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, in applyInsertUpdates() argument 859 applyInsertUpdates(Updates, DT, &GD); in applyInsertUpdates() 957 for (auto &Edge : Updates) { in applyInsertUpdates() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SimplifyCFGPass.cpp | 134 std::vector<DominatorTree::UpdateType> Updates; in tailMergeBlocksWithSimilarFunctionTerminators() local 147 Updates.reserve(Updates.size() + BBs.size()); in tailMergeBlocksWithSimilarFunctionTerminators() 198 Updates.push_back({DominatorTree::Insert, BB, CanonicalBB}); in tailMergeBlocksWithSimilarFunctionTerminators() 205 DTU->applyUpdates(Updates); in tailMergeBlocksWithSimilarFunctionTerminators()
|
| H A D | JumpThreading.cpp | 1096 std::vector<DominatorTree::UpdateType> Updates; in processBlock() local 1100 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock() 1113 DTU->applyUpdatesPermissive(Updates); in processBlock() 1719 std::vector <DominatorTree::UpdateType> Updates; in processThreadableEdges() local 1735 DTU->applyUpdatesPermissive(Updates); in processThreadableEdges() 2468 std::vector<DominatorTree::UpdateType> Updates; in splitBlockPreds() local 2483 DTU->applyUpdatesPermissive(Updates); in splitBlockPreds() 2627 std::vector<DominatorTree::UpdateType> Updates; in duplicateCondBranchOnPHIIntoPred() local 2721 DTU->applyUpdatesPermissive(Updates); in duplicateCondBranchOnPHIIntoPred() 2934 std::vector<DominatorTree::UpdateType> Updates; in tryToUnfoldSelectInCurrBB() local [all …]
|
| H A D | SCCP.cpp | 369 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local 380 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges() 385 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges() 388 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local 397 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges() 402 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
|
| H A D | LoopUnswitch.cpp | 1065 SmallVector<DominatorTree::UpdateType, 3> Updates; in emitPreheaderBranchOnCondition() local 1067 Updates.push_back({DominatorTree::Insert, OldBranchParent, TrueDest}); in emitPreheaderBranchOnCondition() 1069 Updates.push_back({DominatorTree::Insert, OldBranchParent, FalseDest}); in emitPreheaderBranchOnCondition() 1073 Updates.push_back({DominatorTree::Delete, OldBranchParent, OldBranchSucc}); in emitPreheaderBranchOnCondition() 1077 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true); in emitPreheaderBranchOnCondition() 1079 DT->applyUpdates(Updates); in emitPreheaderBranchOnCondition()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 202 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);
|
| H A D | CFGDiff.h | 95 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates, 97 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph);
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOMemOPSizeOpt.cpp | 461 std::vector<DominatorTree::UpdateType> Updates; in perform() local 463 Updates.reserve(2 * SizeIds.size()); in perform() 481 Updates.push_back({DominatorTree::Insert, CaseBB, MergeBB}); in perform() 482 Updates.push_back({DominatorTree::Insert, BB, CaseBB}); in perform() 486 DTU.applyUpdates(Updates); in perform() 487 Updates.clear(); in perform()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | GlobalDCE.cpp | 145 SmallVectorImpl<GlobalValue *> *Updates) { in MarkLive() argument 150 if (Updates) in MarkLive() 151 Updates->push_back(&GV); in MarkLive() 154 MarkLive(*CM.second, Updates); // Recursion depth is only two because only in MarkLive()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/AST/ |
| H A D | StmtOpenMP.cpp | 293 Dir->setUpdates(Exprs.Updates); in Create() 336 Dir->setUpdates(Exprs.Updates); in Create() 422 Dir->setUpdates(Exprs.Updates); in Create() 552 Dir->setUpdates(Exprs.Updates); in Create() 597 Dir->setUpdates(Exprs.Updates); in Create() 890 Dir->setUpdates(Exprs.Updates); in Create() 994 Dir->setUpdates(Exprs.Updates); in Create() 1039 Dir->setUpdates(Exprs.Updates); in Create() 1082 Dir->setUpdates(Exprs.Updates); in Create() 1127 Dir->setUpdates(Exprs.Updates); in Create() [all …]
|
| /freebsd-13.1/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 | 125 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT, 128 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | GlobalDCE.h | 56 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
|
| /freebsd-13.1/contrib/libpcap/doc/ |
| H A D | README.aix | 56 Updates for AIX filesets can be obtained from:
|