Home
last modified time | relevance | path

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

12

/external/llvm/include/llvm/Support/
DGenericDomTree.h35 template <class NodeT> class DominatorBase {
37 std::vector<NodeT *> Roots;
58 const std::vector<NodeT *> &getRoots() const { return Roots; } in getRoots()
65 template <class NodeT> class DominatorTreeBase;
69 template <class NodeT> class DomTreeNodeBase {
70 NodeT *TheBB;
71 DomTreeNodeBase<NodeT> *IDom;
72 std::vector<DomTreeNodeBase<NodeT> *> Children;
79 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::iterator iterator;
80 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::const_iterator
[all …]
DGenericDomTreeConstruction.h149 template<class FuncT, class NodeT>
150 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, in Calculate()
152 typedef GraphTraits<NodeT> GraphT; in Calculate()
206 typedef GraphTraits<Inverse<NodeT> > InvTraits; in Calculate()
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DDominators.h36 template <class NodeT>
39 std::vector<NodeT*> Roots;
49 inline const std::vector<NodeT*> &getRoots() const { return Roots; } in getRoots()
59 template<class NodeT> class DominatorTreeBase;
63 template <class NodeT>
65 NodeT *TheBB;
66 DomTreeNodeBase<NodeT> *IDom;
67 std::vector<DomTreeNodeBase<NodeT> *> Children;
73 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::iterator iterator;
74 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::const_iterator
[all …]
DRegionIterator.h265 #define RegionNodeGraphTraits(NodeT) \ argument
266 template<> struct GraphTraits<NodeT*> { \
267 typedef NodeT NodeType; \
277 template<> struct GraphTraits<FlatIt<NodeT*> > { \
278 typedef NodeT NodeType; \
279 typedef RNSuccIterator<FlatIt<NodeT> > ChildIteratorType; \
289 #define RegionGraphTraits(RegionT, NodeT) \ argument
291 : public GraphTraits<NodeT*> { \
304 : public GraphTraits<FlatIt<NodeT*> > { \
DDominatorInternals.h150 template<class FuncT, class NodeT>
151 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, in Calculate()
153 typedef GraphTraits<NodeT> GraphT; in Calculate()
207 typedef GraphTraits<Inverse<NodeT> > InvTraits; in Calculate()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/
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)
81 NodeT *getBlock() const { return TheBB; }
103 SmallPtrSet<const NodeT *, 4> OtherChildren;
[all …]
DGenericDomTreeConstruction.h53 using NodeT = typename DomTreeT::NodeType; member
54 using TreeNodePtr = DomTreeNodeBase<NodeT> *;
186 llvm::make_unique<DomTreeNodeBase<NodeT>>(BB, IDomNode))) in getNodeForBlock()
580 llvm::make_unique<DomTreeNodeBase<NodeT>>(Root, nullptr)) in CalculateFromScratch()
605 llvm::make_unique<DomTreeNodeBase<NodeT>>(W, IDomNode)); in attachNewSubtree()
656 llvm::make_unique<DomTreeNodeBase<NodeT>>(From, VirtualRoot))) in InsertEdge()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DCFG.h128 template <class NodeT, class RPOTraversalT, class LoopInfoT,
129 class GT = GraphTraits<NodeT>>
134 auto isProperBackedge = [&](NodeT Src, NodeT Dst) { in containsIrreducibleCFG()
142 SmallPtrSet<NodeT, 32> Visited; in containsIrreducibleCFG()
143 for (NodeT Node : RPOTraversal) { in containsIrreducibleCFG()
145 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { in containsIrreducibleCFG()
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 *>> { \
/external/clang/include/clang/ASTMatchers/
DASTMatchFinder.h234 template <typename MatcherT, typename NodeT>
236 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context);
259 template <typename NodeT>
260 const NodeT *
263 if (const NodeT *Node = N.getNodeAs<NodeT>(BoundTo)) in selectFirst()
290 template <typename MatcherT, typename NodeT>
292 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { in match()
/external/llvm/include/llvm/Analysis/
DRegionIterator.h252 #define RegionNodeGraphTraits(NodeT, BlockT, RegionT) \ argument
253 template<> struct GraphTraits<NodeT*> { \
254 typedef NodeT NodeType; \
264 template<> struct GraphTraits<FlatIt<NodeT*>> { \
265 typedef NodeT NodeType; \
266 typedef RNSuccIterator<FlatIt<NodeT>, BlockT, RegionT > ChildIteratorType; \
276 #define RegionGraphTraits(RegionT, NodeT) \ argument
278 : public GraphTraits<NodeT*> { \
291 : public GraphTraits<FlatIt<NodeT*> > { \
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DIntervalMap.h309 template <typename NodeT>
310 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes()
482 template <typename NodeT>
483 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef()
484 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
501 template <typename NodeT>
502 NodeT &get() const { in get()
503 return *reinterpret_cast<NodeT*>(pip.getPointer()); in get()
771 template <typename NodeT> NodeT &node(unsigned Level) const { in node()
772 return *reinterpret_cast<NodeT*>(path[Level].node); in node()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
DIntervalMap.h336 template <typename NodeT>
337 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes()
506 template <typename NodeT>
507 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef()
508 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
525 template <typename NodeT>
526 NodeT &get() const { in get()
527 return *reinterpret_cast<NodeT*>(pip.getPointer()); in get()
794 template <typename NodeT> NodeT &node(unsigned Level) const { in node()
795 return *reinterpret_cast<NodeT*>(path[Level].node); in node()
[all …]
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;
/external/llvm/include/llvm/ADT/
DIntervalMap.h330 template <typename NodeT>
331 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, in adjustSiblingSizes()
503 template <typename NodeT>
504 NodeRef(NodeT *p, unsigned n) : pip(p, n - 1) { in NodeRef()
505 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
522 template <typename NodeT>
523 NodeT &get() const { in get()
524 return *reinterpret_cast<NodeT*>(pip.getPointer()); in get()
792 template <typename NodeT> NodeT &node(unsigned Level) const { in node()
793 return *reinterpret_cast<NodeT*>(path[Level].node); in node()
[all …]
/external/skia/modules/skottie/include/
DSkottieProperty.h49 template <typename ValueT, typename NodeT>
58 explicit PropertyHandle(sk_sp<NodeT> node) : fNode(std::move(node)) {} in PropertyHandle()
62 const sk_sp<NodeT> fNode;
/external/skqp/modules/skottie/include/
DSkottieProperty.h49 template <typename ValueT, typename NodeT>
58 explicit PropertyHandle(sk_sp<NodeT> node) : fNode(std::move(node)) {} in PropertyHandle()
62 const sk_sp<NodeT> fNode;
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
Dilist.h112 template <class TraitsT, class NodeT> struct HasGetNext {
118 static Yes &test(U *I, decltype(I->getNext(&make<NodeT>())) * = 0);
142 template <class TraitsT, class NodeT> struct HasCreateNode {
148 static Yes &test(U *I, decltype(I->createNode(make<NodeT>())) * = 0);
155 template <class TraitsT, class NodeT> struct HasObsoleteCustomization {
156 static const bool value = HasGetNext<TraitsT, NodeT>::value ||
158 HasCreateNode<TraitsT, NodeT>::value;
/external/libcxxabi/src/
Dcxa_demangle.cpp72 template<typename NodeT> static constexpr bool wantsNewline(const NodeT *) { in wantsNewline()
217 template<typename NodeT> void operator()(const NodeT *Node) { in operator ()()
219 fprintf(stderr, "%s(", itanium_demangle::NodeKind<NodeT>::name()); in operator ()()
/external/clang/test/Modules/Inputs/merge-typedefs/
Da1.h5 template <class NodeT> class DomTreeNodeBase;
Db1.h8 template <class NodeT> class DomTreeNodeBase;
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DLiveRangeCalc.h33 template <class NodeT> class DomTreeNodeBase;
/external/llvm/lib/CodeGen/
DLiveRangeCalc.h33 template <class NodeT> class DomTreeNodeBase;
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DLiveRangeCalc.h38 template <class NodeT> class DomTreeNodeBase;
/external/llvm/lib/Target/AMDGPU/
DAMDILCFGStructurizer.cpp86 template<class NodeT>
87 void ReverseVector(SmallVectorImpl<NodeT *> &Src) { in ReverseVector()
90 NodeT *t = Src[i]; in ReverseVector()

12