Home
last modified time | relevance | path

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

/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/clang/include/clang/ASTMatchers/
DASTMatchFinder.h234 template <typename MatcherT, typename NodeT>
236 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context);
254 template <typename NodeT>
255 const NodeT *
258 if (const NodeT *Node = N.getNodeAs<NodeT>(BoundTo)) in selectFirst()
285 template <typename MatcherT, typename NodeT>
287 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/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/clang/test/Modules/Inputs/merge-typedefs/
Da1.h5 template <class NodeT> class DomTreeNodeBase;
Db1.h8 template <class NodeT> class DomTreeNodeBase;
/external/llvm/lib/CodeGen/
DLiveRangeCalc.h33 template <class NodeT> class DomTreeNodeBase;
/external/llvm/lib/Target/AMDGPU/
DAMDILCFGStructurizer.cpp88 template<class NodeT>
89 void ReverseVector(SmallVectorImpl<NodeT *> &Src) { in ReverseVector()
92 NodeT *t = Src[i]; in ReverseVector()
/external/clang/include/clang/AST/
DASTContext.h537 template <typename NodeT> DynTypedNodeList getParents(const NodeT &Node) { in getParents()
/external/mesa3d/src/gallium/drivers/radeon/
DAMDILCFGStructurizer.cpp94 template<class NodeT>
95 void ReverseVector(SmallVector<NodeT *, DEFAULT_VEC_SLOTS> &Src) { in ReverseVector() argument
98 NodeT *t = Src[i]; in ReverseVector()