Home
last modified time | relevance | path

Searched refs:Successors (Results 1 – 25 of 34) sorted by relevance

12

/openbsd/gnu/llvm/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h151 SampleProfileInference(FunctionT &F, BlockEdgeMap &Successors,
153 : F(F), Successors(Successors), SampleBlockWeights(SampleBlockWeights) {}
168 BlockEdgeMap &Successors, FlowFunction &Func);
177 BlockEdgeMap &Successors;
283 for (auto *Succ : Successors[BB]) {
300 findUnlikelyJumps(BasicBlocks, Successors, Func);
322 BlockEdgeMap &Successors, FlowFunction &Func) {}
327 BlockEdgeMap &Successors, FlowFunction &Func) {
334 if (Successors[BB].size() == 2 && Successors[BB].back() == Succ) {
H A DSampleProfileLoaderBaseImpl.h148 void applyProfi(FunctionT &F, BlockEdgeMap &Successors,
201 BlockEdgeMap Successors;
239 Successors.clear();
596 NumTotalEdges = Successors[BB].size();
597 for (auto *Succ : Successors[BB]) {
602 SingleEdge = std::make_pair(BB, Successors[BB][0]);
680 for (auto *Succ : Successors[BB]) {
728 if (!Successors[B1].empty())
732 Successors[B1].push_back(B2);
766 applyProfi(F, Successors, SampleBlockWeights, BlockWeights, EdgeWeights);
[all …]
H A DBasicBlockUtils.h585 const SetVector<BasicBlock *> &Successors, const StringRef Prefix,
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/
H A DInterval.h59 std::vector<BasicBlock*> Successors; variable
77 for (BasicBlock *Successor : Successors) in isSuccessor()
100 return I->Successors.begin(); in succ_begin()
103 return I->Successors.end(); in succ_end()
H A DIntervalIterator.h210 Int->Successors.push_back(NodeHeader); in ProcessNode()
217 Int->Successors.push_back(NodeHeader); in ProcessNode()
229 llvm::erase_value(Int->Successors, NodeHeader); in ProcessNode()
H A DFunctionPropertiesAnalysis.h121 DenseSet<const BasicBlock *> Successors; variable
H A DBranchProbabilityInfo.h379 iterator_range<IterT> Successors) const;
H A DBlockFrequencyInfoImpl.h1443 auto Successors = std::vector<std::vector<size_t>>(Freq.size());
1446 Successors[Jump.first].push_back(I);
1491 for (size_t Succ : Successors[I]) {
/openbsd/gnu/llvm/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp74 std::map<change_ty, std::vector<change_ty> > Successors; member in __anonb38266460111::DAGDeltaAlgorithmImpl
99 assert(Successors.count(Node) && "Invalid node!"); in succ_begin()
100 return Successors[Node].begin(); in succ_begin()
103 assert(Successors.count(Node) && "Invalid node!"); in succ_end()
104 return Successors[Node].end(); in succ_end()
184 Successors.insert(std::make_pair(Change, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
188 Successors[Dep.first].push_back(Dep.second); in DAGDeltaAlgorithmImpl()
/openbsd/gnu/llvm/llvm/lib/Analysis/
H A DFunctionPropertiesAnalysis.cpp147 Successors.insert(succ_begin(&CallSiteBB), succ_end(&CallSiteBB)); in FunctionPropertiesUpdater()
158 Successors.insert(succ_begin(UnwindDest), succ_end(UnwindDest)); in FunctionPropertiesUpdater()
166 Successors.erase(&CallSiteBB); in FunctionPropertiesUpdater()
168 for (const auto *BB : Successors) in FunctionPropertiesUpdater()
213 for (const auto *Succ : Successors) in finish()
H A DInterval.cpp37 for (const BasicBlock *Successor : Successors) in print()
H A DIntervalPartition.cpp69 for (BasicBlock *Successor : Int->Successors) in updatePredecessors()
H A DBranchProbabilityInfo.cpp672 const LoopBlock &SrcLoopBB, iterator_range<IterT> Successors) const { in getMaxEstimatedEdgeWeight()
675 for (const BasicBlock *DstBB : Successors) { in getMaxEstimatedEdgeWeight()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h119 std::vector<MachineBasicBlock *> Successors;
373 succ_iterator succ_begin() { return Successors.begin(); }
374 const_succ_iterator succ_begin() const { return Successors.begin(); }
375 succ_iterator succ_end() { return Successors.end(); }
376 const_succ_iterator succ_end() const { return Successors.end(); }
378 { return Successors.rbegin(); }
380 { return Successors.rbegin(); }
382 { return Successors.rend(); }
384 { return Successors.rend(); }
386 return (unsigned)Successors.size();
[all …]
/openbsd/gnu/llvm/llvm/include/llvm/Passes/
H A DStandardInstrumentations.h465 return Successors.begin(); in begin()
468 return Successors.end(); in end()
473 assert(Successors.count(S) == 1 && "Expected to find successor."); in getSuccessorLabel()
474 return Successors.find(S)->getValue(); in getSuccessorLabel()
481 Successors.insert(SS); in addSuccessorLabel()
484 StringMap<std::string> Successors; variable
/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp61 const auto &Successors = VPB->getSuccessors(); in verifyBlocksInRegion() local
64 assert(!hasDuplicates(Successors) && in verifyBlocksInRegion()
67 for (const VPBlockBase *Succ : Successors) { in verifyBlocksInRegion()
H A DVPlan.cpp184 if (!Successors.empty() || !Parent) in getEnclosingBlockWithSuccessors()
918 auto &Successors = Block->getSuccessors(); in dumpEdges() local
919 if (Successors.size() == 1) in dumpEdges()
920 drawEdge(Block, Successors.front(), false, ""); in dumpEdges()
921 else if (Successors.size() == 2) { in dumpEdges()
922 drawEdge(Block, Successors.front(), false, "T"); in dumpEdges()
923 drawEdge(Block, Successors.back(), false, "F"); in dumpEdges()
926 for (auto *Successor : Successors) in dumpEdges()
H A DVPlan.h406 SmallVector<VPBlockBase *, 1> Successors; variable
415 Successors.push_back(Successor); in appendSuccessor()
433 auto Pos = find(Successors, Successor); in removeSuccessor()
435 Successors.erase(Pos); in removeSuccessor()
487 const VPBlocksTy &getSuccessors() const { return Successors; } in getSuccessors()
488 VPBlocksTy &getSuccessors() { return Successors; } in getSuccessors()
490 iterator_range<VPBlockBase **> successors() { return Successors; } in successors()
498 return (Successors.size() == 1 ? *Successors.begin() : nullptr); in getSingleSuccessor()
507 size_t getNumSuccessors() const { return Successors.size(); } in getNumSuccessors()
557 assert(Successors.empty() && "Setting one successor when others exist."); in setOneSuccessor()
[all …]
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp741 Successors.push_back(Succ); in collectViableSuccessors()
767 if (BB.succ_size() != Successors.size()) in hasSameSuccessors()
770 if (Successors.count(&BB)) in hasSameSuccessors()
773 if (!Successors.count(Succ)) in hasSameSuccessors()
982 if (Successors.count(SuccPred)) { in isTrellis()
985 if (!Successors.count(CheckSucc)) in isTrellis()
997 if (!hasSameSuccessors(*SuccPred, Successors)) in isTrellis()
1166 if (Successors.size() > 1 && hasSameSuccessors(*Pred, Successors)) in canTailDuplicateUnplacedPreds()
1600 SmallVector<MachineBasicBlock *, 4> Successors; in selectBestSuccessor() local
1621 if (isTrellis(BB, Successors, Chain, BlockFilter)) in selectBestSuccessor()
[all …]
H A DMachineBasicBlock.cpp776 if (!(Probs.empty() && !Successors.empty())) in addSuccessor()
778 Successors.push_back(Succ); in addSuccessor()
787 Successors.push_back(Succ); in addSuccessorWithoutProb()
812 succ_iterator I = find(Successors, Succ); in removeSuccessor()
818 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
830 return Successors.erase(I); in removeSuccessor()
944 return Successors.size() == 1 ? Successors[0] : nullptr; in getSingleSuccessor()
1487 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
1488 const size_t index = std::distance(Successors.begin(), I); in getProbabilityIterator()
1496 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
[all …]
H A DREADME.txt37 Successors according to CFG: 0x8b03bf0 (#5)
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp244 SmallVector<BasicBlock *, 2> Successors(successors(BB)); in runOnFunction() local
249 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in runOnFunction()
254 for (BasicBlock *Successor : Successors) { in runOnFunction()
/openbsd/gnu/llvm/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h198 auto Successors = getChildren<Direction>(BB, BatchUpdates); member
199 if (SuccOrder && Successors.size() > 1)
201 Successors.begin(), Successors.end(), [=](NodePtr A, NodePtr B) {
205 for (const NodePtr Succ : Successors) {
925 auto Successors = getChildren<IsPostDom>(Of, BUI); in DeleteEdge() local
926 return llvm::is_contained(Successors, SuccCandidate); in DeleteEdge()
/openbsd/gnu/llvm/llvm/lib/Target/X86/
H A DREADME-X86-64.txt108 Successors according to CFG: 0x203afb0 (#3)
113 Successors according to CFG: 0x203afb0 (#3)
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DDFAJumpThreading.cpp612 SmallSet<BasicBlock *, 4> Successors; in paths() local
614 if (!Successors.insert(Succ).second) in paths()

12