Home
last modified time | relevance | path

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

123

/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp171 SmallVector<DominatorTree::UpdateType, 8> Updates; in runOnFunction() local
173 Updates.reserve(IndirectBrSuccs.size()); in runOnFunction()
183 assert(Updates.size() == IndirectBrSuccs.size() && in runOnFunction()
185 DTU->applyUpdates(Updates); in runOnFunction()
208 SmallVector<DominatorTree::UpdateType, 8> Updates; in runOnFunction() local
217 Updates.reserve(IndirectBrSuccs.size()); in runOnFunction()
220 assert(Updates.size() == IndirectBrSuccs.size() && in runOnFunction()
236 Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); in runOnFunction()
261 Updates.reserve(Updates.size() + BBs.size()); in runOnFunction()
264 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()
H A DScheduleDAG.cpp468 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()
/openbsd/gnu/llvm/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
249 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in runOnFunction()
256 Updates.push_back({DominatorTree::Delete, BB, Successor}); in runOnFunction()
279 Updates.reserve(Updates.size() + UnreachableBlocks.size()); in runOnFunction()
317 DTU.applyUpdates(Updates); in runOnFunction()
[all …]
/openbsd/gnu/llvm/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp115 DTU->applyUpdates(Updates); in DeleteDeadBlocks()
255 Updates.reserve(Updates.size() + 2 * succ_size(BB) + 1); in MergeBlockIntoPredecessor()
324 DTU->applyUpdates(Updates); in MergeBlockIntoPredecessor()
774 DTU.applyUpdates(Updates); in ehAwareSplitEdge()
909 Updates.reserve(Updates.size() + 2 * succ_size(New)); in SplitBlockImpl()
916 DTU->applyUpdates(Updates); in SplitBlockImpl()
1015 Updates.reserve(Updates.size() + 2 * Preds.size()); in UpdateAnalysisInformation()
1484 Updates.reserve(Updates.size() + 2 * succ_size(Tail)); in SplitBlockAndInsertIfThenImpl()
1515 DTU->applyUpdates(Updates); in SplitBlockAndInsertIfThenImpl()
1598 DTU->applyUpdates(Updates); in SplitBlockAndInsertIfThenElse()
[all …]
H A DSimplifyCFG.cpp1035 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()
1760 DTU->applyUpdates(Updates); in HoistThenElseCodeToIf()
2524 Updates.push_back( in MergeCompatibleInvokesImpl()
2537 Updates.push_back( in MergeCompatibleInvokesImpl()
5032 Updates.clear(); in removeEmptyCleanup()
5189 Updates.clear(); in simplifyUnreachable()
5200 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.cpp296 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator()
299 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
379 Updates.reserve(RemovedSuccessors.size()); in ConstantFoldTerminator()
382 DTU->applyUpdates(Updates); in ConstantFoldTerminator()
789 Updates.reserve(Updates.size() + 2 * pred_size(PredBB) + 1); in MergeBasicBlockIntoOnlyPred()
831 DTU->applyUpdatesPermissive(Updates); in MergeBasicBlockIntoOnlyPred()
1190 Updates.reserve(Updates.size() + 2 * pred_size(BB) + 1); in TryToSimplifyUncondBranchFromEmptyBlock()
1253 DTU->applyUpdates(Updates); in TryToSimplifyUncondBranchFromEmptyBlock()
2260 Updates.reserve(UniqueSuccessors.size()); in changeToUnreachable()
2263 DTU->applyUpdates(Updates); in changeToUnreachable()
[all …]
H A DLoopRotationUtils.cpp584 SmallVector<DominatorTree::UpdateType, 3> Updates; in rotateLoop() local
585 Updates.push_back({DominatorTree::Insert, OrigPreheader, Exit}); in rotateLoop()
586 Updates.push_back({DominatorTree::Insert, OrigPreheader, NewHeader}); in rotateLoop()
587 Updates.push_back({DominatorTree::Delete, OrigPreheader, OrigHeader}); in rotateLoop()
590 MSSAU->applyUpdates(Updates, *DT, /*UpdateDT=*/true); in rotateLoop()
594 DT->applyUpdates(Updates); in rotateLoop()
H A DSCCPSolver.cpp227 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
231 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
235 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
239 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
250 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
255 DTU.applyUpdatesPermissive(Updates); in removeNonFeasibleEdges()
258 SmallVector<DominatorTree::UpdateType, 8> Updates; in removeNonFeasibleEdges() local
272 Updates.push_back({DominatorTree::Delete, BB, DefaultDest}); in removeNonFeasibleEdges()
273 Updates.push_back({DominatorTree::Insert, BB, NewUnreachableBB}); in removeNonFeasibleEdges()
284 Updates.push_back({DominatorTree::Delete, BB, Succ}); in removeNonFeasibleEdges()
[all …]
/openbsd/gnu/llvm/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 DJumpThreading.cpp1112 std::vector<DominatorTree::UpdateType> Updates; in processBlock() local
1116 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1129 DTU->applyUpdatesPermissive(Updates); in processBlock()
1726 std::vector <DominatorTree::UpdateType> Updates; in processThreadableEdges() local
1742 DTU->applyUpdatesPermissive(Updates); in processThreadableEdges()
2503 std::vector<DominatorTree::UpdateType> Updates; in splitBlockPreds() local
2518 DTU->applyUpdatesPermissive(Updates); in splitBlockPreds()
2651 std::vector<DominatorTree::UpdateType> Updates; in duplicateCondBranchOnPHIIntoPred() local
2745 DTU->applyUpdatesPermissive(Updates); in duplicateCondBranchOnPHIIntoPred()
2974 std::vector<DominatorTree::UpdateType> Updates; in tryToUnfoldSelectInCurrBB() local
[all …]
/openbsd/gnu/llvm/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp230 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 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 …]
/openbsd/gnu/llvm/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()
/openbsd/gnu/usr.bin/perl/cpan/Config-Perl-V/t/
H A D25_plv5162.t168 /Library/Perl/Updates/<version> comes before system perl directories
169 installprivlib and installarchlib points to the Updates directory
183 /Library/Perl/Updates/5.16.2/darwin-thread-multi-2level
184 /Library/Perl/Updates/5.16.2
/openbsd/gnu/llvm/llvm/lib/Transforms/Instrumentation/
H A DPGOMemOPSizeOpt.cpp412 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()
/openbsd/gnu/llvm/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()
983 Dir->setUpdates(Exprs.Updates); in Create()
1087 Dir->setUpdates(Exprs.Updates); in Create()
1132 Dir->setUpdates(Exprs.Updates); in Create()
1175 Dir->setUpdates(Exprs.Updates); in Create()
1220 Dir->setUpdates(Exprs.Updates); in Create()
[all …]
/openbsd/gnu/llvm/llvm/include/llvm/Support/
H A DGenericDomTree.h203 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 DCFGDiff.h95 GraphDiff(ArrayRef<cfg::Update<NodePtr>> Updates,
97 cfg::LegalizeUpdates<NodePtr>(Updates, LegalizedUpdates, InverseGraph);
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/
H A DDomTreeUpdater.h123 void applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates);
146 void applyUpdatesPermissive(ArrayRef<DominatorTree::UpdateType> Updates);
H A DMemorySSAUpdater.h123 void applyUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT,
126 void applyInsertUpdates(ArrayRef<CFGUpdate> Updates, DominatorTree &DT);
/openbsd/gnu/llvm/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()
/openbsd/gnu/llvm/llvm/include/llvm/Transforms/IPO/
H A DGlobalDCE.h63 SmallVectorImpl<GlobalValue *> *Updates = nullptr);
/openbsd/lib/libssl/doc/
H A Dstandards.txt165 TXT=22889 bytes) (Updates RFC1778) (Status: PROPOSED STANDARD)
188 February 2000. (Format: TXT=20008 bytes) (Updates RFC0959) (Status:
196 2000. (Format: TXT=27598 bytes) (Updates RFC2616) (Status: PROPOSED
262 TXT=9981 bytes) (Updates RFC2251, RFC2252, RFC2253, RFC2254, RFC2255,

123