Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/llvm/lib/CGData/
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()
102 for (auto &[Hash, NextSrcNode] : SrcNode->Successors) { in merge()
104 auto I = DstNode->Successors.find(Hash); in merge()
105 if (I == DstNode->Successors.end()) { in merge()
109 DstNode->Successors.emplace(Hash, std::move(NextDst)); in merge()
122 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/clang/lib/Analysis/
H A DIntervalPartition.cpp30 llvm::SmallDenseSet<const Node *> Successors; member
99 Interval.Successors.insert(B); in buildInterval()
107 std::queue<const Node *> &Successors, in fillIntervalNode() argument
110 for (const auto *S : Result.Successors) in fillIntervalNode()
111 Successors.push(S); in fillIntervalNode()
156 std::queue<const Node *> Successors; in partitionIntoIntervalsImpl() local
158 fillIntervalNode(Graph, Index, Successors, Partitioned, EntryBlock); in partitionIntoIntervalsImpl()
161 while (!Successors.empty()) { in partitionIntoIntervalsImpl()
162 const auto *B = Successors.front(); in partitionIntoIntervalsImpl()
163 Successors.pop(); in partitionIntoIntervalsImpl()
[all …]
/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);
156 BlockEdgeMap &Successors; variable
263 for (auto *Succ : Successors[BB]) { in createFlowFunction()
280 findUnlikelyJumps(BasicBlocks, Successors, Func); in createFlowFunction()
304 BlockEdgeMap &Successors, FlowFunction &Func) {} in findUnlikelyJumps() argument
H A DSampleProfileLoaderBaseImpl.h248 void applyProfi(FunctionT &F, BlockEdgeMap &Successors,
301 BlockEdgeMap Successors;
350 Successors.clear();
761 auto &Succs = Successors[BB];
768 SingleEdge = std::make_pair(BB, Successors[BB][0]);
846 for (auto *Succ : Successors[BB]) {
895 auto &Succs = Successors[B1];
934 applyProfi(F, Successors, SampleBlockWeights, BlockWeights, EdgeWeights);
978 FunctionT &F, BlockEdgeMap &Successors, BlockWeightMap &SampleBlockWeights,
980 auto Infer = SampleProfileInference<FT>(F, Successors, SampleBlockWeights);
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp73 std::map<change_ty, std::vector<change_ty> > Successors; member in __anoncf29fe990111::DAGDeltaAlgorithmImpl
98 assert(Successors.count(Node) && "Invalid node!"); in succ_begin()
99 return Successors[Node].begin(); in succ_begin()
102 assert(Successors.count(Node) && "Invalid node!"); in succ_end()
103 return Successors[Node].end(); in succ_end()
183 Successors.try_emplace(Change); in DAGDeltaAlgorithmImpl()
187 Successors[Dep.first].push_back(Dep.second); in DAGDeltaAlgorithmImpl()
/freebsd/contrib/llvm-project/llvm/include/llvm/CGData/
H A DOutlinedHashTree.h40 std::unordered_map<stable_hash, std::unique_ptr<HashNode>> Successors; member
65 getRoot()->Successors.clear(); in clear()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h159 SmallVector<MachineBasicBlock *, 2> Successors;
443 succ_iterator succ_begin() { return Successors.begin(); }
444 const_succ_iterator succ_begin() const { return Successors.begin(); }
445 succ_iterator succ_end() { return Successors.end(); }
446 const_succ_iterator succ_end() const { return Successors.end(); }
448 { return Successors.rbegin(); }
450 { return Successors.rbegin(); }
452 { return Successors.rend(); }
454 { return Successors.rend(); }
456 return (unsigned)Successors.size();
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Passes/
H A DStandardInstrumentations.h512 return Successors.begin(); in begin()
515 return Successors.end(); in end()
520 assert(Successors.count(S) == 1 && "Expected to find successor."); in getSuccessorLabel()
521 return Successors.find(S)->getValue(); in getSuccessorLabel()
528 Successors.insert(SS); in addSuccessorLabel()
531 StringMap<std::string> Successors; variable
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DFunctionPropertiesAnalysis.cpp427 Successors.insert_range(successors(&CallSiteBB)); in FunctionPropertiesUpdater()
452 Successors.insert_range(successors(UnwindDest)); in FunctionPropertiesUpdater()
466 Successors.erase(&CallSiteBB); in FunctionPropertiesUpdater()
468 LikelyToChangeBBs.insert_range(Successors); in FunctionPropertiesUpdater()
541 for (const auto *Succ : Successors) in finish()
H A DBranchProbabilityInfo.cpp668 const LoopBlock &SrcLoopBB, iterator_range<IterT> Successors) const { in getMaxEstimatedEdgeWeight()
670 for (const BasicBlock *DstBB : Successors) { in getMaxEstimatedEdgeWeight()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanPredicator.cpp290 auto Successors = to_vector(VPBB->getSuccessors()); in introduceMasksAndLinearize() local
291 if (Successors.size() > 1) in introduceMasksAndLinearize()
296 for (auto *Succ : Successors) in introduceMasksAndLinearize()
H A DVPlanVerifier.cpp345 const auto &Successors = VPB->getSuccessors(); in verifyBlock() local
348 if (hasDuplicates(Successors)) { in verifyBlock()
353 for (const VPBlockBase *Succ : Successors) { in verifyBlock()
H A DVPlan.h97 SmallVector<VPBlockBase *, 1> Successors; variable
106 Successors.push_back(Successor); in appendSuccessor()
124 auto Pos = find(Successors, Successor); in removeSuccessor()
126 Successors.erase(Pos); in removeSuccessor()
142 auto I = find(Successors, Old); in replaceSuccessor()
143 assert(I != Successors.end()); in replaceSuccessor()
198 const VPBlocksTy &getSuccessors() const { return Successors; } in getSuccessors()
199 VPBlocksTy &getSuccessors() { return Successors; } in getSuccessors()
201 iterator_range<VPBlockBase **> successors() { return Successors; } in successors()
210 return (Successors.size() == 1 ? *Successors.begin() : nullptr); in getSingleSuccessor()
[all …]
H A DVPlan.cpp195 if (!Successors.empty() || !Parent) in getEnclosingBlockWithSuccessors()
1382 auto &Successors = Block->getSuccessors(); in dumpEdges() local
1383 if (Successors.size() == 1) in dumpEdges()
1384 drawEdge(Block, Successors.front(), false, ""); in dumpEdges()
1385 else if (Successors.size() == 2) { in dumpEdges()
1386 drawEdge(Block, Successors.front(), false, "T"); in dumpEdges()
1387 drawEdge(Block, Successors.back(), false, "F"); in dumpEdges()
1390 for (auto *Successor : Successors) in dumpEdges()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp498 SmallVector<MachineBasicBlock *, 4> &Successors);
766 SmallVector<MachineBasicBlock *, 4> &Successors) { in collectViableSuccessors() argument
801 Successors.push_back(Succ); in collectViableSuccessors()
826 SmallPtrSetImpl<const MachineBasicBlock *> &Successors) { in hasSameSuccessors() argument
827 if (BB.succ_size() != Successors.size()) in hasSameSuccessors()
830 if (Successors.count(&BB)) in hasSameSuccessors()
833 if (!Successors.count(Succ)) in hasSameSuccessors()
1033 SmallPtrSet<const MachineBasicBlock *, 2> Successors(llvm::from_range, in isTrellis() local
1047 if (Successors.count(SuccPred)) { in isTrellis()
1050 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()
1633 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
1634 const size_t index = std::distance(Successors.begin(), I); in getProbabilityIterator()
1642 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator()
[all …]
H A DMachineOutliner.cpp685 auto It = CurrNode->Successors.find(StableHash); in getMatchedEntries()
686 return (It == CurrNode->Successors.end()) ? nullptr : It->second.get(); in getMatchedEntries()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp243 SmallVector<BasicBlock *, 2> Successors(successors(BB)); in run() local
248 Updates.reserve(Updates.size() + 2 * Successors.size() + 2); in run()
253 for (BasicBlock *Successor : Successors) { in run()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h214 auto Successors = getChildren<Direction>(BB, BatchUpdates); member
215 if (SuccOrder && Successors.size() > 1)
217 Successors.begin(), Successors.end(), [=](NodePtr A, NodePtr B) {
221 for (const NodePtr Succ : Successors) {
923 auto Successors = getChildren<IsPostDom>(Of, BUI); in DeleteEdge() local
924 return llvm::is_contained(Successors, SuccCandidate); in DeleteEdge()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DFunctionPropertiesAnalysis.h209 DenseSet<const BasicBlock *> Successors; variable
H A DBranchProbabilityInfo.h393 iterator_range<IterT> Successors) const;
H A DBlockFrequencyInfoImpl.h1430 auto Successors = std::vector<std::vector<size_t>>(Freq.size());
1433 Successors[Jump.first].push_back(I);
1478 for (size_t Succ : Successors[I]) {
/freebsd/contrib/llvm-project/llvm/lib/Object/
H A DELF.cpp943 Successors; in decodeBBAddrMapImpl() local
950 Successors.push_back({BBID, BranchProbability::getRaw(BrProb)}); in decodeBBAddrMapImpl()
955 PGOBBEntries.push_back({BlockFrequency(BBF), std::move(Successors)}); in decodeBBAddrMapImpl()
/freebsd/contrib/llvm-project/llvm/include/llvm/Object/
H A DELFTypes.h1021 llvm::SmallVector<SuccessorEntry, 2> Successors;
1024 return std::tie(BlockFreq, Successors) ==
1025 std::tie(Other.BlockFreq, Other.Successors);

12