Home
last modified time | relevance | path

Searched refs:BasicBlockT (Results 1 – 8 of 8) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h122 using BasicBlockT = std::remove_pointer_t<NodeRef>; variable
124 using Edge = std::pair<const BasicBlockT *, const BasicBlockT *>;
125 using BlockWeightMap = DenseMap<const BasicBlockT *, uint64_t>;
128 DenseMap<const BasicBlockT *, SmallVector<const BasicBlockT *, 8>>;
140 createFlowFunction(const std::vector<const BasicBlockT *> &BasicBlocks,
141 DenseMap<const BasicBlockT *, uint64_t> &BlockIndex);
146 void findUnlikelyJumps(const std::vector<const BasicBlockT *> &BasicBlocks,
150 bool isExit(const BasicBlockT *BB);
167 df_iterator_default_set<const BasicBlockT *> Reachable; in apply()
173 df_iterator_default_set<const BasicBlockT *> InverseReachable; in apply()
[all …]
H A DSampleProfileLoaderBaseImpl.h63 using BasicBlockT = BasicBlock;
186 using BasicBlockT = typename afdo_detail::IRTraits<BT>::BasicBlockT;
205 using BlockWeightMap = DenseMap<const BasicBlockT *, uint64_t>;
207 DenseMap<const BasicBlockT *, const BasicBlockT *>;
208 using Edge = std::pair<const BasicBlockT *, const BasicBlockT *>;
211 DenseMap<const BasicBlockT *, SmallVector<const BasicBlockT *, 8>>;
220 const BasicBlockT *getEntryBB(const FunctionT *F) {
223 PredRangeT getPredecessors(BasicBlockT *BB) {
226 SuccRangeT getSuccessors(BasicBlockT *BB) {
234 ErrorOr<uint64_t> getBlockWeight(const BasicBlockT *BB);
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DGenericDomTreeUpdater.h32 using BasicBlockT = typename DomTreeT::NodeType; variable
78 bool isBBPendingDeletion(BasicBlockT *DelBB) const { in isBBPendingDeletion()
154 void splitCriticalEdge(BasicBlockT *FromBB, BasicBlockT *ToBB,
155 BasicBlockT *NewBB);
217 BasicBlockT *FromBB;
218 BasicBlockT *ToBB;
219 BasicBlockT *NewBB;
238 SmallPtrSet<BasicBlockT *, 8> DeletedBBs;
261 void eraseDelBBNode(BasicBlockT *DelBB);
H A DGenericDomTreeUpdaterImpl.h85 SmallSet<std::pair<BasicBlockT *, BasicBlockT *>, 8> Seen; in applyUpdatesPermissive()
135 BasicBlockT *FromBB, BasicBlockT *ToBB, BasicBlockT *NewBB) { in splitCriticalEdge()
193 auto printBlockInfo = [&](BasicBlockT *BB, StringRef Ending) { in dump()
332 BasicBlockT *DelBB) { in eraseDelBBNode()
386 SmallSet<BasicBlockT *, 32> NewBBs; in splitDTCriticalEdges()
399 BasicBlockT *Succ = Edge.ToBB; in splitDTCriticalEdges()
402 for (BasicBlockT *PredBB : predecessors(Succ)) { in splitDTCriticalEdges()
H A DCFGPrinter.h129 template <typename BasicBlockT>
130 std::string SimpleNodeLabelString(const BasicBlockT *Node) {
141 template <typename BasicBlockT>
143 const BasicBlockT *Node,
144 function_ref<void(raw_string_ostream &, const BasicBlockT &)>
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMIRSampleProfile.cpp120 using BasicBlockT = MachineBasicBlock; typedef
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstructions.h3238 template <typename SwitchInstT, typename ConstantIntT, typename BasicBlockT>
3242 CaseHandleImpl<SwitchInstT, ConstantIntT, BasicBlockT>>;
3263 BasicBlockT *getCaseSuccessor() const {
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp618 const std::vector<const BasicBlockT *> &BasicBlocks, in findUnlikelyJumps()