Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h60 NodeT *TheBB;
459 bool dominates(const NodeT *A, const NodeT *B) const;
468 NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) const {
497 const NodeT *findNearestCommonDominator(const NodeT *A,
584 void insertEdge(NodeT *From, NodeT *To) {
602 void deleteEdge(NodeT *From, NodeT *To) {
619 DomTreeNodeBase<NodeT> *addNewBlock(NodeT *BB, NodeT *DomBB) {
632 DomTreeNodeBase<NodeT> *setNewRoot(NodeT *BB) {
818 DomTreeNodeBase<NodeT> *createChild(NodeT *BB, DomTreeNodeBase<NodeT> *IDom) {
824 DomTreeNodeBase<NodeT> *createNode(NodeT *BB) {
[all …]
H A DGenericDomTreeConstruction.h57 using NodeT = typename DomTreeT::NodeType; member
58 using TreeNodePtr = DomTreeNodeBase<NodeT> *;
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
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 *>> { \
/freebsd-13.1/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h249 template <typename MatcherT, typename NodeT>
251 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context);
273 template <typename NodeT>
274 const NodeT *
277 if (const NodeT *Node = N.getNodeAs<NodeT>(BoundTo)) in selectFirst()
308 template <typename MatcherT, typename NodeT>
310 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { in match()
334 template <typename NodeT>
336 const NodeT &Node, in matchDynamic()
/freebsd-13.1/contrib/llvm-project/clang/include/clang/AST/
H A DParentMapContext.h53 template <typename NodeT> DynTypedNodeList getParents(const NodeT &Node);
127 template <typename NodeT>
128 inline DynTypedNodeList ParentMapContext::getParents(const NodeT &Node) { in getParents()
132 template <typename NodeT>
133 inline DynTypedNodeList ASTContext::getParents(const NodeT &Node) { in getParents()
H A DASTContext.h662 template <typename NodeT> DynTypedNodeList getParents(const NodeT &Node);
/freebsd-13.1/contrib/llvm-project/clang/include/clang/Tooling/Syntax/
H A DTree.h172 template <typename DerivedT, typename NodeT>
175 NodeT> {
177 NodeT *N = nullptr;
182 explicit ChildIteratorBase(NodeT *N) : N(N) {} in ChildIteratorBase()
185 NodeT &operator*() const { return *N; }
195 NodeT *asPointer() const { return N; } in asPointer()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h341 template <typename NodeT>
511 template <typename NodeT>
531 NodeT &get() const { in get()
799 template <typename NodeT> NodeT &node(unsigned Level) const { in node()
807 template <typename NodeT> NodeT &leaf() const { in leaf()
1011 template <typename NodeT> NodeT *newNode() { in newNode()
1012 return new(allocator.template Allocate<NodeT>()) NodeT(); in newNode()
1015 template <typename NodeT> void deleteNode(NodeT *P) { in deleteNode()
1016 P->~NodeT(); in deleteNode()
1969 template <typename NodeT>
[all …]
H A Dilist.h100 template <class TraitsT, class NodeT> struct HasGetNext {
106 static Yes &test(U *I, decltype(I->getNext(&make<NodeT>())) * = 0);
130 template <class TraitsT, class NodeT> struct HasCreateNode {
136 static Yes &test(U *I, decltype(I->createNode(make<NodeT>())) * = 0);
143 template <class TraitsT, class NodeT> struct HasObsoleteCustomization {
144 static const bool value = HasGetNext<TraitsT, NodeT>::value ||
146 HasCreateNode<TraitsT, NodeT>::value;
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DItaniumManglingCanonicalizer.cpp53 template<typename NodeT> struct ProfileSpecificNode {
56 profileCtor(ID, NodeKind<NodeT>::Kind, V...); in operator ()()
62 template<typename NodeT> void operator()(const NodeT *N) { in operator ()()
63 N->match(ProfileSpecificNode<NodeT>{ID}); in operator ()()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Demangle/
H A DItaniumDemangle.cpp69 template<typename NodeT> static constexpr bool wantsNewline(const NodeT *) { in wantsNewline()
214 template<typename NodeT> void operator()(const NodeT *Node) { in operator ()()
216 fprintf(stderr, "%s(", itanium_demangle::NodeKind<NodeT>::name()); in operator ()()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveIntervalCalc.h24 template <class NodeT> class DomTreeNodeBase;
H A DLiveRangeCalc.h39 template <class NodeT> class DomTreeNodeBase;
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Demangle/
H A DItaniumDemangle.h2209 template<typename NodeT> struct NodeKind;