Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/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.h58 using NodeT = typename DomTreeT::NodeType; member
59 using TreeNodePtr = DomTreeNodeBase<NodeT> *;
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DMemoryProfileInfo.h108 template <class NodeT, class IteratorT> class CallStack {
110 CallStack(const NodeT *N = nullptr) : N(N) {} in N()
117 const NodeT *N = nullptr;
119 CallStackIterator(const NodeT *N, bool End);
133 const NodeT *N = nullptr;
136 template <class NodeT, class IteratorT>
137 CallStack<NodeT, IteratorT>::CallStackIterator::CallStackIterator( in CallStackIterator()
138 const NodeT *N, bool End) in CallStackIterator()
145 template <class NodeT, class IteratorT>
146 uint64_t CallStack<NodeT, IteratorT>::CallStackIterator::operator*() {
[all …]
H A DCFG.h134 template <class NodeT, class RPOTraversalT, class LoopInfoT,
135 class GT = GraphTraits<NodeT>>
140 auto isProperBackedge = [&](NodeT Src, NodeT Dst) { in containsIrreducibleCFG()
148 SmallPtrSet<NodeT, 32> Visited; in containsIrreducibleCFG()
149 for (NodeT Node : RPOTraversal) { in containsIrreducibleCFG()
151 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 *>> { \
/openbsd-src/gnu/llvm/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.h106 template <typename NodeT>
108 MatchSwitchAction<NodeT, State, Result> A) && { in CaseOf() argument
109 static_assert(std::is_base_of<BaseT, NodeT>::value, in CaseOf()
115 State &S) { return A(cast<NodeT>(Node), R, S); }); in CaseOf()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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.h681 template <typename NodeT> DynTypedNodeList getParents(const NodeT &Node);
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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 …]
H A Dilist.h101 template <class TraitsT, class NodeT> struct HasGetNext {
107 static Yes &test(U *I, decltype(I->getNext(&make<NodeT>())) * = nullptr);
131 template <class TraitsT, class NodeT> struct HasCreateNode {
137 static Yes &test(U *I, decltype(I->createNode(make<NodeT>())) * = 0);
144 template <class TraitsT, class NodeT> struct HasObsoleteCustomization {
145 static const bool value = HasGetNext<TraitsT, NodeT>::value ||
147 HasCreateNode<TraitsT, NodeT>::value;
/openbsd-src/gnu/llvm/llvm/lib/Support/
H A DItaniumManglingCanonicalizer.cpp52 template<typename NodeT> struct ProfileSpecificNode {
55 profileCtor(ID, NodeKind<NodeT>::Kind, V...); in operator ()()
61 template<typename NodeT> void operator()(const NodeT *N) { in operator ()()
62 N->match(ProfileSpecificNode<NodeT>{ID}); in operator ()()
/openbsd-src/gnu/llvm/libcxxabi/src/
H A Dcxa_demangle.cpp66 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 ()()
/openbsd-src/gnu/llvm/llvm/lib/Demangle/
H A DItaniumDemangle.cpp67 template<typename NodeT> static constexpr bool wantsNewline(const NodeT *) { in wantsNewline()
256 template<typename NodeT> void operator()(const NodeT *Node) { in operator ()()
258 fprintf(stderr, "%s(", itanium_demangle::NodeKind<NodeT>::name()); in operator ()()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DLiveIntervalCalc.h24 template <class NodeT> class DomTreeNodeBase;
H A DLiveRangeCalc.h38 template <class NodeT> class DomTreeNodeBase;
/openbsd-src/gnu/llvm/llvm/include/llvm/Demangle/
H A DItaniumDemangle.h2373 template<typename NodeT> struct NodeKind;
/openbsd-src/gnu/llvm/libcxxabi/src/demangle/
H A DItaniumDemangle.h2373 template<typename NodeT> struct NodeKind;