Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/llvm/lib/CodeGenData/
H A DOutlinedHashTree.cpp39 for (const auto &[Hash, Successor] : Current->Successors) in walkGraph()
45 for (const auto &P : Current->Successors) in walkGraph()
76 auto I = Current->Successors.find(StableHash); in insert()
77 if (I == Current->Successors.end()) { in insert()
81 Current->Successors.emplace(StableHash, std::move(Next)); in insert()
103 for (auto &[Hash, NextSrcNode] : SrcNode->Successors) { in merge()
105 auto I = DstNode->Successors.find(Hash); in merge()
106 if (I == DstNode->Successors.end()) { in merge()
110 DstNode->Successors.emplace(Hash, std::move(NextDst)); in merge()
123 const auto I = Current->Successors.find(StableHash); in find()
[all …]
H A DOutlinedHashTreeRecord.cpp134 for (auto &P : Node->Successors) in convertToStableData()
149 assert(IdNodeMap[0]->Successors.empty()); in convertFromStableData()
159 auto &Successors = Curr->Successors; in convertFromStableData() local
160 assert(Successors.empty()); in convertFromStableData()
165 Successors[Hash] = std::move(Sucessor); in convertFromStableData()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h130 SampleProfileInference(FunctionT &F, BlockEdgeMap &Successors, in SampleProfileInference() argument
132 : F(F), Successors(Successors), SampleBlockWeights(SampleBlockWeights) {} in SampleProfileInference()
147 BlockEdgeMap &Successors, FlowFunction &Func);
155 /// Successors for each basic block in the CFG.
156 BlockEdgeMap &Successors; variable
262 for (auto *Succ : Successors[BB]) { in createFlowFunction()
279 findUnlikelyJumps(BasicBlocks, Successors, Func); in createFlowFunction()
303 BlockEdgeMap &Successors, FlowFunction &Func) {} in findUnlikelyJumps() argument
H A DSampleProfileLoaderBaseImpl.h247 void applyProfi(FunctionT &F, BlockEdgeMap &Successors,
300 BlockEdgeMap Successors;
349 Successors.clear();
767 NumTotalEdges = Successors[BB].size();
768 for (auto *Succ : Successors[BB]) {
773 SingleEdge = std::make_pair(BB, Successors[BB][0]);
851 for (auto *Succ : Successors[BB]) {
899 if (!Successors[B1].empty())
903 Successors[B1].push_back(B2);
937 applyProfi(F, Successors, SampleBlockWeights, BlockWeights, EdgeWeights);
[all …]
H A DBasicBlockUtils.h677 const SetVector<BasicBlock *> &Successors, const StringRef Prefix,
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp74 std::map<change_ty, std::vector<change_ty> > Successors; member in __anoncf29fe990111::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()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGenData/
H A DOutlinedHashTree.h39 std::unordered_map<stable_hash, std::unique_ptr<HashNode>> Successors; member
64 getRoot()->Successors.clear(); in clear()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DFunctionPropertiesAnalysis.cpp327 Successors.insert(succ_begin(&CallSiteBB), succ_end(&CallSiteBB)); in FunctionPropertiesUpdater()
338 Successors.insert(succ_begin(UnwindDest), succ_end(UnwindDest)); in FunctionPropertiesUpdater()
346 Successors.erase(&CallSiteBB); in FunctionPropertiesUpdater()
348 for (const auto *BB : Successors) in FunctionPropertiesUpdater()
393 for (const auto *Succ : Successors) in finish()
H A DBranchProbabilityInfo.cpp672 const LoopBlock &SrcLoopBB, iterator_range<IterT> Successors) const { in getMaxEstimatedEdgeWeight()
675 for (const BasicBlock *DstBB : Successors) { in getMaxEstimatedEdgeWeight()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h161 std::vector<MachineBasicBlock *> Successors;
418 succ_iterator succ_begin() { return Successors.begin(); }
419 const_succ_iterator succ_begin() const { return Successors.begin(); }
420 succ_iterator succ_end() { return Successors.end(); }
421 const_succ_iterator succ_end() const { return Successors.end(); }
423 { return Successors.rbegin(); }
425 { return Successors.rbegin(); }
427 { return Successors.rend(); }
429 { return Successors.rend(); }
431 return (unsigned)Successors.size();
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Passes/
H A DStandardInstrumentations.h496 return Successors.begin(); in begin()
499 return Successors.end(); in end()
504 assert(Successors.count(S) == 1 && "Expected to find successor."); in getSuccessorLabel()
505 return Successors.find(S)->getValue(); in getSuccessorLabel()
512 Successors.insert(SS); in addSuccessorLabel()
515 StringMap<std::string> Successors; variable
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp206 const auto &Successors = VPB->getSuccessors(); in verifyBlock() local
209 if (hasDuplicates(Successors)) { in verifyBlock()
214 for (const VPBlockBase *Succ : Successors) { in verifyBlock()
H A DVPlan.cpp192 if (!Successors.empty() || !Parent) in getEnclosingBlockWithSuccessors()
1341 auto &Successors = Block->getSuccessors(); in dumpEdges() local
1342 if (Successors.size() == 1) in dumpEdges()
1343 drawEdge(Block, Successors.front(), false, ""); in dumpEdges()
1344 else if (Successors.size() == 2) { in dumpEdges()
1345 drawEdge(Block, Successors.front(), false, "T"); in dumpEdges()
1346 drawEdge(Block, Successors.back(), false, "F"); in dumpEdges()
1349 for (auto *Successor : Successors) in dumpEdges()
H A DVPlan.h453 SmallVector<VPBlockBase *, 1> Successors; variable
462 Successors.push_back(Successor); in appendSuccessor()
480 auto Pos = find(Successors, Successor); in removeSuccessor()
482 Successors.erase(Pos); in removeSuccessor()
534 const VPBlocksTy &getSuccessors() const { return Successors; } in getSuccessors()
535 VPBlocksTy &getSuccessors() { return Successors; } in getSuccessors()
537 iterator_range<VPBlockBase **> successors() { return Successors; } in successors()
545 return (Successors.size() == 1 ? *Successors.begin() : nullptr); in getSingleSuccessor()
554 size_t getNumSuccessors() const { return Successors.size(); } in getNumSuccessors()
604 assert(Successors.empty() && "Setting one successor when others exist."); in setOneSuccessor()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp475 SmallVector<MachineBasicBlock *, 4> &Successors);
710 SmallVector<MachineBasicBlock *, 4> &Successors) { in collectViableSuccessors() argument
745 Successors.push_back(Succ); in collectViableSuccessors()
770 SmallPtrSetImpl<const MachineBasicBlock *> &Successors) { in hasSameSuccessors() argument
771 if (BB.succ_size() != Successors.size()) in hasSameSuccessors()
774 if (Successors.count(&BB)) in hasSameSuccessors()
777 if (!Successors.count(Succ)) in hasSameSuccessors()
977 SmallPtrSet<const MachineBasicBlock *, 2> Successors(BB->succ_begin(), in isTrellis() local
986 if (Successors.count(SuccPred)) { in isTrellis()
989 if (!Successors.count(CheckSucc)) in isTrellis()
[all …]
H A DMachineBasicBlock.cpp800 if (!(Probs.empty() && !Successors.empty())) in addSuccessor()
802 Successors.push_back(Succ); in addSuccessor()
811 Successors.push_back(Succ); in addSuccessorWithoutProb()
836 succ_iterator I = find(Successors, Succ); in removeSuccessor()
842 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor()
854 return Successors.erase(I); in removeSuccessor()
968 return Successors.size() == 1 ? Successors[0] : nullptr; in getSingleSuccessor()
1608 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
1609 const size_t index = std::distance(Successors.begin(), I); in getProbabilityIterator()
1617 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp244 SmallVector<BasicBlock *, 2> Successors(successors(BB)); in run() local
249 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in run()
254 for (BasicBlock *Successor : Successors) { in run()
/freebsd/contrib/llvm-project/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) {
907 auto Successors = getChildren<IsPostDom>(Of, BUI); in DeleteEdge() local
908 return llvm::is_contained(Successors, SuccCandidate); in DeleteEdge()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DFunctionPropertiesAnalysis.h188 DenseSet<const BasicBlock *> Successors;
133 DenseSet<const BasicBlock *> Successors; global() variable
H A DBranchProbabilityInfo.h391 iterator_range<IterT> Successors) const;
H A DBlockFrequencyInfoImpl.h1436 auto Successors = std::vector<std::vector<size_t>>(Freq.size());
1439 Successors[Jump.first].push_back(I);
1484 for (size_t Succ : Successors[I]) {
/freebsd/contrib/llvm-project/llvm/lib/Object/
H A DELF.cpp898 Successors; in decodeBBAddrMapImpl() local
905 Successors.push_back({BBID, BranchProbability::getRaw(BrProb)}); in decodeBBAddrMapImpl()
910 PGOBBEntries.push_back({BlockFrequency(BBF), std::move(Successors)}); in decodeBBAddrMapImpl()
/freebsd/contrib/llvm-project/llvm/include/llvm/Object/
H A DELFTypes.h1006 llvm::SmallVector<SuccessorEntry, 2> Successors;
1009 return std::tie(BlockFreq, Successors) ==
1010 std::tie(Other.BlockFreq, Other.Successors);
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DDFAJumpThreading.cpp615 SmallSet<BasicBlock *, 4> Successors; in paths() local
617 if (!Successors.insert(Succ).second) in paths()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp618 BlockEdgeMap &Successors, FlowFunction &Func) { in findUnlikelyJumps() argument
625 if (Successors[BB].size() == 2 && Successors[BB].back() == Succ) { in findUnlikelyJumps()

12