Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DGenericDomTree.h62 NodeT *TheBB;
329 DomTreeNodeBase<NodeT> *getNode(const NodeT *BB) const {
437 bool dominates(const NodeT *A, const NodeT *B) const;
446 NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) const {
475 const NodeT *findNearestCommonDominator(const NodeT *A,
534 void insertEdge(NodeT *From, NodeT *To) {
552 void deleteEdge(NodeT *From, NodeT *To) {
569 DomTreeNodeBase<NodeT> *addNewBlock(NodeT *BB, NodeT *DomBB) {
583 DomTreeNodeBase<NodeT> *setNewRoot(NodeT *BB) {
614 void changeImmediateDominator(NodeT *BB, NodeT *NewBB) {
[all …]
H A DGenericDomTreeConstruction.h53 using NodeT = typename DomTreeT::NodeType; member
54 using TreeNodePtr = DomTreeNodeBase<NodeT> *;
187 llvm::make_unique<DomTreeNodeBase<NodeT>>(BB, IDomNode))) in getNodeForBlock()
581 llvm::make_unique<DomTreeNodeBase<NodeT>>(Root, nullptr)) in CalculateFromScratch()
606 llvm::make_unique<DomTreeNodeBase<NodeT>>(W, IDomNode)); in attachNewSubtree()
657 llvm::make_unique<DomTreeNodeBase<NodeT>>(From, VirtualRoot))) in InsertEdge()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DCFG.h127 template <class NodeT, class RPOTraversalT, class LoopInfoT,
128 class GT = GraphTraits<NodeT>>
133 auto isProperBackedge = [&](NodeT Src, NodeT Dst) { in containsIrreducibleCFG()
141 SmallPtrSet<NodeT, 32> Visited; in containsIrreducibleCFG()
142 for (NodeT Node : RPOTraversal) { in containsIrreducibleCFG()
144 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { in containsIrreducibleCFG()
H A DRegionIterator.h259 #define RegionNodeGraphTraits(NodeT, BlockT, RegionT) \ argument
260 template <> struct GraphTraits<NodeT *> { \
261 using NodeRef = NodeT *; \
271 template <> struct GraphTraits<FlatIt<NodeT *>> { \
272 using NodeRef = NodeT *; \
284 #define RegionGraphTraits(RegionT, NodeT) \ argument
285 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
299 : public GraphTraits<FlatIt<NodeT *>> { \
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h241 template <typename MatcherT, typename NodeT>
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context);
266 template <typename NodeT>
267 const NodeT *
270 if (const NodeT *Node = N.getNodeAs<NodeT>(BoundTo)) in selectFirst()
297 template <typename MatcherT, typename NodeT>
299 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { in match()
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DIntervalMap.h337 template <typename NodeT>
507 template <typename NodeT>
527 NodeT &get() const { in get()
795 template <typename NodeT> NodeT &node(unsigned Level) const { in node()
803 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()
1964 template <typename NodeT>
[all …]
H A Dilist.h102 template <class TraitsT, class NodeT> struct HasGetNext {
108 static Yes &test(U *I, decltype(I->getNext(&make<NodeT>())) * = 0);
132 template <class TraitsT, class NodeT> struct HasCreateNode {
138 static Yes &test(U *I, decltype(I->createNode(make<NodeT>())) * = 0);
145 template <class TraitsT, class NodeT> struct HasObsoleteCustomization {
146 static const bool value = HasGetNext<TraitsT, NodeT>::value ||
148 HasCreateNode<TraitsT, NodeT>::value;
/freebsd-12.1/contrib/llvm/lib/Support/
H A DItaniumManglingCanonicalizer.cpp69 template<typename NodeT> struct ProfileSpecificNode {
72 profileCtor(ID, NodeKind<NodeT>::Kind, V...); in operator ()()
78 template<typename NodeT> void operator()(const NodeT *N) { in operator ()()
79 N->match(ProfileSpecificNode<NodeT>{ID}); in operator ()()
/freebsd-12.1/contrib/llvm/lib/Demangle/
H A DItaniumDemangle.cpp70 template<typename NodeT> static constexpr bool wantsNewline(const NodeT *) { in wantsNewline()
215 template<typename NodeT> void operator()(const NodeT *Node) { in operator ()()
217 fprintf(stderr, "%s(", itanium_demangle::NodeKind<NodeT>::name()); in operator ()()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DLiveRangeCalc.h38 template <class NodeT> class DomTreeNodeBase;
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/
H A DASTContext.h648 template <typename NodeT> DynTypedNodeList getParents(const NodeT &Node) { in getParents()
/freebsd-12.1/contrib/llvm/include/llvm/Demangle/
H A DItaniumDemangle.h2007 template<typename NodeT> struct NodeKind;