Home
last modified time | relevance | path

Searched refs:NodeT (Results 1 – 19 of 19) sorted by relevance

/src/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h45 template <typename NodeT, bool IsPostDom>
54 template <class NodeT> class DomTreeNodeBase {
56 friend class DominatorTreeBase<NodeT, false>;
57 friend class DominatorTreeBase<NodeT, true>;
58 friend struct DomTreeBuilder::SemiNCAInfo<DominatorTreeBase<NodeT, false>>;
59 friend struct DomTreeBuilder::SemiNCAInfo<DominatorTreeBase<NodeT, true>>;
61 NodeT *TheBB;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
89 NodeT *getBlock() const { return TheBB; }
110 SmallPtrSet<const NodeT *, 4> OtherChildren;
[all …]
H A DGenericDomTreeConstruction.h57 using NodeT = typename DomTreeT::NodeType; member
58 using TreeNodePtr = DomTreeNodeBase<NodeT> *;
/src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DMemoryProfileInfo.h120 template <class NodeT, class IteratorT> class CallStack {
122 CallStack(const NodeT *N = nullptr) : N(N) {} in N()
129 const NodeT *N = nullptr;
131 CallStackIterator(const NodeT *N, bool End);
146 const NodeT *N = nullptr;
149 template <class NodeT, class IteratorT>
150 CallStack<NodeT, IteratorT>::CallStackIterator::CallStackIterator( in CallStackIterator()
151 const NodeT *N, bool End) in CallStackIterator()
160 template <class NodeT, class IteratorT>
161 uint64_t CallStack<NodeT, IteratorT>::CallStackIterator::operator*() {
[all …]
H A DCFG.h146 template <class NodeT, class RPOTraversalT, class LoopInfoT,
147 class GT = GraphTraits<NodeT>>
152 auto isProperBackedge = [&](NodeT Src, NodeT Dst) { in containsIrreducibleCFG()
160 SmallPtrSet<NodeT, 32> Visited; in containsIrreducibleCFG()
161 for (NodeT Node : RPOTraversal) { in containsIrreducibleCFG()
163 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { in containsIrreducibleCFG()
H A DRegionIterator.h265 #define RegionNodeGraphTraits(NodeT, BlockT, RegionT) \ argument
266 template <> struct GraphTraits<NodeT *> { \
267 using NodeRef = NodeT *; \
277 template <> struct GraphTraits<FlatIt<NodeT *>> { \
278 using NodeRef = NodeT *; \
290 #define RegionGraphTraits(RegionT, NodeT) \ argument
291 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
305 : public GraphTraits<FlatIt<NodeT *>> { \
/src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp217 struct NodeT { struct
218 NodeT(const NodeT &) = delete;
219 NodeT(NodeT &&) = default;
220 NodeT &operator=(const NodeT &) = delete;
221 NodeT &operator=(NodeT &&) = default;
223 explicit NodeT(size_t Index, uint64_t Size, uint64_t Count) in NodeT() function
229 bool isSuccessor(const NodeT *Other) const;
250 NodeT *ForcedSucc{nullptr}; argument
252 NodeT *ForcedPred{nullptr}; argument
266 explicit JumpT(NodeT *Source, NodeT *Target, uint64_t ExecutionCount) in JumpT()
[all …]
/src/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/
H A DCFGMatchSwitch.h47 template <typename NodeT>
50 MatchSwitchAction<NodeT, State, Result> A) && { in CaseOfCFGStmt() argument
51 std::move(StmtBuilder).template CaseOf<NodeT>(M, A); in CaseOfCFGStmt()
62 template <typename NodeT>
65 MatchSwitchAction<NodeT, State, Result> A) && { in CaseOfCFGInit() argument
66 std::move(InitBuilder).template CaseOf<NodeT>(M, A); in CaseOfCFGInit()
H A DMatchSwitch.h104 template <typename NodeT>
106 MatchSwitchAction<NodeT, State, Result> A) && { in CaseOf() argument
107 static_assert(std::is_base_of<BaseT, NodeT>::value, in CaseOf()
113 State &S) { return A(cast<NodeT>(Node), R, S); }); in CaseOf()
/src/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h252 template <typename MatcherT, typename NodeT>
254 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context);
276 template <typename NodeT>
277 const NodeT *
280 if (const NodeT *Node = N.getNodeAs<NodeT>(BoundTo)) in selectFirst()
311 template <typename MatcherT, typename NodeT>
313 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { in match()
337 template <typename NodeT>
339 const NodeT &Node, in matchDynamic()
/src/contrib/llvm-project/clang/include/clang/AST/
H A DParentMapContext.h53 template <typename NodeT> DynTypedNodeList getParents(const NodeT &Node);
125 template <typename NodeT>
126 inline DynTypedNodeList ParentMapContext::getParents(const NodeT &Node) { in getParents()
130 template <typename NodeT>
131 inline DynTypedNodeList ASTContext::getParents(const NodeT &Node) { in getParents()
H A DASTContext.h710 template <typename NodeT> DynTypedNodeList getParents(const NodeT &Node);
/src/contrib/llvm-project/clang/include/clang/Tooling/Syntax/
H A DTree.h147 template <typename DerivedT, typename NodeT>
150 NodeT> {
152 NodeT *N = nullptr;
157 explicit ChildIteratorBase(NodeT *N) : N(N) {} in ChildIteratorBase()
163 NodeT &operator*() const { return *N; }
173 NodeT *asPointer() const { return N; } in asPointer()
/src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h339 template <typename NodeT>
340 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes()
509 template <typename NodeT>
510 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef()
511 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
528 template <typename NodeT>
529 NodeT &get() const { in get()
530 return *reinterpret_cast<NodeT*>(pip.getPointer()); in get()
797 template <typename NodeT> NodeT &node(unsigned Level) const { in node()
798 return *reinterpret_cast<NodeT*>(path[Level].node); in node()
[all …]
/src/contrib/llvm-project/llvm/lib/ProfileData/
H A DItaniumManglingCanonicalizer.cpp54 template<typename NodeT> struct ProfileSpecificNode {
57 profileCtor(ID, NodeKind<NodeT>::Kind, V...); in operator ()()
63 template<typename NodeT> void operator()(const NodeT *N) { in operator ()()
64 N->match(ProfileSpecificNode<NodeT>{ID}); in operator ()()
/src/contrib/llvm-project/llvm/lib/Demangle/
H A DItaniumDemangle.cpp68 template<typename NodeT> static constexpr bool wantsNewline(const NodeT *) { in wantsNewline()
257 template<typename NodeT> void operator()(const NodeT *Node) { in operator ()()
259 fprintf(stderr, "%s(", itanium_demangle::NodeKind<NodeT>::name()); in operator ()()
/src/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveIntervalCalc.h24 template <class NodeT> class DomTreeNodeBase;
H A DLiveRangeCalc.h38 template <class NodeT> class DomTreeNodeBase;
/src/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp432 template <class NodeT, class IteratorT>
434 getStackIdsWithContextNodes(CallStack<NodeT, IteratorT> &CallsiteContext);
441 template <class NodeT, class IteratorT>
443 CallStack<NodeT, IteratorT> &StackContext,
444 CallStack<NodeT, IteratorT> &CallsiteContext,
1025 template <class NodeT, class IteratorT>
1027 ContextNode *AllocNode, CallStack<NodeT, IteratorT> &StackContext, in addStackNodesForMIB() argument
1028 CallStack<NodeT, IteratorT> &CallsiteContext, AllocationType AllocType, in addStackNodesForMIB()
1655 template <class NodeT, class IteratorT>
1658 CallStack<NodeT, IteratorT> &CallsiteContext) { in getStackIdsWithContextNodes() argument
/src/contrib/llvm-project/llvm/include/llvm/Demangle/
H A DItaniumDemangle.h2599 template<typename NodeT> struct NodeKind;