/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | IntervalPartition.h | 86 return Successors; in succs() 103 llvm::SmallDenseSet<const CFGIntervalNode *> Successors; member
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/ |
H A D | IntervalPartition.cpp | 30 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 161 while (!Successors.empty()) { in partitionIntoIntervalsImpl() 162 const auto *B = Successors.front(); in partitionIntoIntervalsImpl() 163 Successors.pop(); in partitionIntoIntervalsImpl() 170 fillIntervalNode(Graph, Index, Successors, Partitioned, B); in partitionIntoIntervalsImpl() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyInfoImpl.h | 1439 auto Successors = std::vector<std::vector<size_t>>(Freq.size()); 1442 Successors[Jump.first].push_back(I); 1487 for (size_t Succ : Successors[I]) {
|
H A D | BranchProbabilityInfo.h | 391 iterator_range<IterT> Successors) const;
|
H A D | FunctionPropertiesAnalysis.h | 188 DenseSet<const BasicBlock *> Successors; variable
|
H A D | Interval.h | 59 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 D | IntervalIterator.h | 210 Int->Successors.push_back(NodeHeader); in ProcessNode() 217 Int->Successors.push_back(NodeHeader); in ProcessNode() 229 llvm::erase(Int->Successors, NodeHeader); in ProcessNode()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 139 std::vector<MachineBasicBlock *> Successors; 393 succ_iterator succ_begin() { return Successors.begin(); } 394 const_succ_iterator succ_begin() const { return Successors.begin(); } 395 succ_iterator succ_end() { return Successors.end(); } 396 const_succ_iterator succ_end() const { return Successors.end(); } 398 { return Successors.rbegin(); } 400 { return Successors.rbegin(); } 402 { return Successors.rend(); } 404 { return Successors.rend(); } 406 return (unsigned)Successors.size(); [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Object/ |
H A D | ELFTypes.h | 936 llvm::SmallVector<SuccessorEntry, 2> Successors; 939 return std::tie(BlockFreq, Successors) == 940 std::tie(Other.BlockFreq, Other.Successors);
|
/freebsd/contrib/llvm-project/llvm/include/llvm/ObjectYAML/ |
H A D | ELFYAML.h | 180 std::optional<std::vector<SuccessorEntry>> Successors; member
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Passes/ |
H A D | StandardInstrumentations.h | 481 return Successors.begin(); in begin() 484 return Successors.end(); in end() 489 assert(Successors.count(S) == 1 && "Expected to find successor."); in getSuccessorLabel() 490 return Successors.find(S)->getValue(); in getSuccessorLabel() 497 Successors.insert(SS); in addSuccessorLabel() 500 StringMap<std::string> Successors; variable
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 196 auto Successors = getChildren<Direction>(BB, BatchUpdates); member 197 if (SuccOrder && Successors.size() > 1) 199 Successors.begin(), Successors.end(), [=](NodePtr A, NodePtr B) { 203 for (const NodePtr Succ : Successors) { 921 auto Successors = getChildren<IsPostDom>(Of, BUI); in DeleteEdge() local 922 return llvm::is_contained(Successors, SuccCandidate); in DeleteEdge()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 677 const SetVector<BasicBlock *> &Successors, const StringRef Prefix,
|
H A D | SampleProfileInference.h | 130 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 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 D | SampleProfileLoaderBaseImpl.h | 219 void applyProfi(FunctionT &F, BlockEdgeMap &Successors, 272 BlockEdgeMap Successors; 321 Successors.clear(); 739 NumTotalEdges = Successors[BB].size(); 740 for (auto *Succ : Successors[BB]) { 745 SingleEdge = std::make_pair(BB, Successors[BB][0]); 823 for (auto *Succ : Successors[BB]) { 871 if (!Successors[B1].empty()) 875 Successors[B1].push_back(B2); 909 applyProfi(F, Successors, SampleBlockWeights, BlockWeights, EdgeWeights); [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | BranchProbabilityInfo.cpp | 672 const LoopBlock &SrcLoopBB, iterator_range<IterT> Successors) const { in getMaxEstimatedEdgeWeight() 675 for (const BasicBlock *DstBB : Successors) { in getMaxEstimatedEdgeWeight()
|
H A D | FunctionPropertiesAnalysis.cpp | 327 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 D | Interval.cpp | 37 for (const BasicBlock *Successor : Successors) in print()
|
H A D | IntervalPartition.cpp | 69 for (BasicBlock *Successor : Int->Successors) in updatePredecessors()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 723 SmallVector<BasicBlock *, 2> Successors(successors(&BB)); in _run() local 728 for (BasicBlock *Succ : Successors) in _run() 737 SmallVector<BasicBlock *, 2> Successors(successors(BB)); in _run() local 741 for (BasicBlock *Succ : Successors) in _run()
|
H A D | MachineBasicBlock.cpp | 794 if (!(Probs.empty() && !Successors.empty())) in addSuccessor() 796 Successors.push_back(Succ); in addSuccessor() 805 Successors.push_back(Succ); in addSuccessorWithoutProb() 830 succ_iterator I = find(Successors, Succ); in removeSuccessor() 836 assert(I != Successors.end() && "Not a current successor!"); in removeSuccessor() 848 return Successors.erase(I); in removeSuccessor() 962 return Successors.size() == 1 ? Successors[0] : nullptr; in getSingleSuccessor() 1586 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator() 1587 const size_t index = std::distance(Successors.begin(), I); in getProbabilityIterator() 1595 assert(Probs.size() == Successors.size() && "Async probability list!"); in getProbabilityIterator() [all …]
|
H A D | MachineBlockPlacement.cpp | 740 Successors.push_back(Succ); in collectViableSuccessors() 766 if (BB.succ_size() != Successors.size()) in hasSameSuccessors() 769 if (Successors.count(&BB)) in hasSameSuccessors() 772 if (!Successors.count(Succ)) in hasSameSuccessors() 981 if (Successors.count(SuccPred)) { in isTrellis() 984 if (!Successors.count(CheckSucc)) in isTrellis() 996 if (!hasSameSuccessors(*SuccPred, Successors)) in isTrellis() 1165 if (Successors.size() > 1 && hasSameSuccessors(*Pred, Successors)) in canTailDuplicateUnplacedPreds() 1599 SmallVector<MachineBasicBlock *, 4> Successors; in selectBestSuccessor() local 1620 if (isTrellis(BB, Successors, Chain, BlockFilter)) in selectBestSuccessor() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/MIRParser/ |
H A D | MIParser.cpp | 1000 SmallVector<MachineBasicBlock*,4> Successors; in parseBasicBlock() local 1002 guessSuccessors(MBB, Successors, IsFallthrough); in parseBasicBlock() 1003 for (MachineBasicBlock *Succ : Successors) in parseBasicBlock()
|
/freebsd/contrib/llvm-project/llvm/lib/Object/ |
H A D | ELF.cpp | 796 Successors; in decodeBBAddrMapImpl() local 803 Successors.push_back({BBID, BranchProbability::getRaw(BrProb)}); in decodeBBAddrMapImpl() 808 PGOBBEntries.push_back({BlockFrequency(BBF), std::move(Successors)}); in decodeBBAddrMapImpl()
|
/freebsd/contrib/llvm-project/llvm/lib/ObjectYAML/ |
H A D | ELFEmitter.cpp | 1470 if (PGOBBE.Successors) { in writeSectionContent() 1471 SHeader.sh_size += CBA.writeULEB128(PGOBBE.Successors->size()); in writeSectionContent() 1472 for (const auto &[ID, BrProb] : *PGOBBE.Successors) in writeSectionContent()
|