Home
last modified time | relevance | path

Searched refs:NodeType (Results 1 – 25 of 65) sorted by relevance

123

/minix3/external/bsd/llvm/dist/llvm/include/llvm/Analysis/
H A DRegionIterator.h33 template<class NodeType, class BlockT, class RegionT>
35 NodeType, ptrdiff_t> {
36 typedef std::iterator<std::forward_iterator_tag, NodeType, ptrdiff_t> super;
53 PointerIntPair<NodeType*, 2, ItMode> Node;
65 NodeType* getNode() const{ return Node.getPointer(); } in getNode()
72 NodeType* getISucc(BlockT* BB) const { in getISucc()
73 NodeType *succ; in getISucc()
90 typedef RNSuccIterator<NodeType, BlockT, RegionT> Self;
95 inline RNSuccIterator(NodeType* node) in RNSuccIterator()
109 inline RNSuccIterator(NodeType* node, bool) in RNSuccIterator()
[all …]
H A DInterval.h122 typedef Interval NodeType;
125 static NodeType *getEntryNode(Interval *I) { return I; }
128 static inline ChildIteratorType child_begin(NodeType *N) {
131 static inline ChildIteratorType child_end(NodeType *N) {
137 typedef Interval NodeType;
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
140 static inline ChildIteratorType child_begin(NodeType *N) {
143 static inline ChildIteratorType child_end(NodeType *N) {
H A DCallGraph.h398 typedef CallGraphNode NodeType;
404 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
406 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType;
408 static inline ChildIteratorType child_begin(NodeType *N) {
411 static inline ChildIteratorType child_end(NodeType *N) {
419 typedef const CallGraphNode NodeType;
425 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
427 typedef mapped_iterator<NodeType::const_iterator, CGNDerefFun>
430 static inline ChildIteratorType child_begin(NodeType *N) {
433 static inline ChildIteratorType child_end(NodeType *N) {
[all …]
H A DLazyCallGraph.h522 typedef LazyCallGraph::Node NodeType;
525 static NodeType *getEntryNode(NodeType *N) { return N; }
526 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
527 static ChildIteratorType child_end(NodeType *N) { return N->end(); }
530 typedef LazyCallGraph::Node NodeType;
533 static NodeType *getEntryNode(NodeType *N) { return N; }
534 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
535 static ChildIteratorType child_end(NodeType *N) { return N->end(); }
/minix3/external/bsd/llvm/dist/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass()
35 typename GraphT::NodeType* V, unsigned N) { in DFSPass()
56 SmallVector<std::pair<typename GraphT::NodeType*, in DFSPass()
60 typename GraphT::NodeType* BB = Worklist.back().first; in DFSPass()
63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in DFSPass()
93 typename GraphT::NodeType* Succ = *NextSucc; in DFSPass()
95 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo = in DFSPass()
107 typename GraphT::NodeType*
108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, in Eval()
109 typename GraphT::NodeType *VIn, unsigned LastLinked) { in Eval()
[all …]
H A DGraphWriter.h63 typedef typename GTraits::NodeType NodeType; typedef
70 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { in getEdgeSourceLabels()
148 bool isNodeHidden(NodeType &Node) { in isNodeHidden()
152 bool isNodeHidden(NodeType *const *Node) { in isNodeHidden()
156 bool isNodeHidden(NodeType *Node) { in isNodeHidden()
160 void writeNode(NodeType& Node) { in writeNode()
164 void writeNode(NodeType *const *Node) { in writeNode()
168 void writeNode(NodeType *Node) { in writeNode()
239 void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
240 if (NodeType *TargetNode = *EI) { in writeEdge()
/minix3/external/bsd/llvm/dist/llvm/include/llvm/ADT/
H A DPostOrderIterator.h58 template<typename NodeType>
59 bool insertEdge(NodeType *From, NodeType *To) { in insertEdge()
64 template<typename NodeType>
65 void finishPostorder(NodeType *BB) {} in finishPostorder()
79 template <class NodeType> bool insertEdge(NodeType *From, NodeType *To) { in insertEdge()
84 template<class NodeType>
85 void finishPostorder(NodeType *BB) {} in finishPostorder()
89 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
93 typename GT::NodeType, ptrdiff_t>,
96 typename GT::NodeType, ptrdiff_t> super;
[all …]
H A DSCCIterator.h43 const std::vector<typename GT::NodeType *>, ptrdiff_t> {
44 typedef typename GT::NodeType NodeType; typedef
46 typedef std::vector<NodeType *> SccTy;
51 NodeType *Node; ///< The current node pointer.
55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min) in StackElement()
70 DenseMap<NodeType *, unsigned> nodeVisitNumbers;
73 std::vector<NodeType *> SCCNodeStack;
83 void DFSVisitOne(NodeType *N);
91 scc_iterator(NodeType *entryN) : visitNum(0) { in scc_iterator()
134 void ReplaceNode(NodeType *Old, NodeType *New) { in ReplaceNode()
[all …]
H A DGraphTraits.h60 typedef typename GraphType::UnknownGraphTypeError NodeType; typedef
88 typedef typename GraphTraits<T>::NodeType NodeType;
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
95 static ChildIteratorType child_begin(NodeType* N) {
99 static ChildIteratorType child_end(NodeType* N) {
H A DDepthFirstIterator.h64 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
67 typename GT::NodeType, ptrdiff_t>,
70 typename GT::NodeType, ptrdiff_t> super;
72 typedef typename GT::NodeType NodeType; typedef
74 typedef PointerIntPair<NodeType*, 1> PointerIntTy;
81 inline df_iterator(NodeType *Node) { in df_iterator()
89 inline df_iterator(NodeType *Node, SetType &S) in df_iterator()
105 NodeType *Node = Top.first.getPointer(); in toNext()
114 NodeType *Next = *It++; in toNext()
159 inline NodeType *operator->() const { return operator*(); }
[all …]
/minix3/external/bsd/llvm/dist/clang/include/clang/AST/
H A DStmtGraphTraits.h28 typedef clang::Stmt NodeType;
32 static NodeType* getEntryNode(clang::Stmt* S) { return S; }
34 static inline ChildIteratorType child_begin(NodeType* N) {
39 static inline ChildIteratorType child_end(NodeType* N) {
55 typedef const clang::Stmt NodeType;
59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; }
61 static inline ChildIteratorType child_begin(NodeType* N) {
66 static inline ChildIteratorType child_end(NodeType* N) {
/minix3/external/bsd/llvm/dist/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp98 typedef std::pair<unsigned, NodeSubset> NodeType; typedef in llvm::Graph
102 NodeType Nodes[N];
128 NodeType *AccessNode(unsigned Idx) const { in AccessNode()
132 return const_cast<NodeType *>(&Nodes[Idx]); in AccessNode()
165 NodeType *FirstNode;
172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
209 NodeType *operator*() { in operator *()
222 static ChildIterator child_begin(NodeType *Parent) { in child_begin()
227 static ChildIterator child_end(NodeType *Parent) { in child_end()
234 typedef typename Graph<N>::NodeType NodeType; typedef
[all …]
/minix3/external/bsd/llvm/dist/llvm/include/llvm/IR/
H A DCFG.h281 typedef BasicBlock NodeType;
284 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
285 static inline ChildIteratorType child_begin(NodeType *N) {
288 static inline ChildIteratorType child_end(NodeType *N) {
294 typedef const BasicBlock NodeType;
297 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
299 static inline ChildIteratorType child_begin(NodeType *N) {
302 static inline ChildIteratorType child_end(NodeType *N) {
313 typedef BasicBlock NodeType;
315 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
[all …]
H A DDominators.h44 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT LLVM_COMMA
48 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
130 typedef DomTreeNode NodeType;
131 typedef NodeType::iterator ChildIteratorType;
133 static NodeType *getEntryNode(NodeType *N) {
136 static inline ChildIteratorType child_begin(NodeType *N) {
139 static inline ChildIteratorType child_end(NodeType *N) {
156 static NodeType *getEntryNode(DominatorTree *DT) {
H A DType.h448 typedef Type NodeType;
451 static inline NodeType *getEntryNode(Type *T) { return T; }
452 static inline ChildIteratorType child_begin(NodeType *N) {
455 static inline ChildIteratorType child_end(NodeType *N) {
461 typedef const Type NodeType;
464 static inline NodeType *getEntryNode(NodeType *T) { return T; }
465 static inline ChildIteratorType child_begin(NodeType *N) {
468 static inline ChildIteratorType child_end(NodeType *N) {
/minix3/external/bsd/llvm/dist/clang/include/clang/ASTMatchers/
H A DASTMatchersMacros.h214 template <typename NodeType> \
215 class matcher_##DefineMatcher##Matcher : public MatcherInterface<NodeType> { \
217 bool matches(const NodeType &Node, ASTMatchFinder *Finder, \
227 template <typename NodeType> \
228 bool internal::matcher_##DefineMatcher##Matcher<NodeType>::matches( \
229 const NodeType &Node, ASTMatchFinder *Finder, \
249 template <typename NodeType, typename ParamT> \
251 : public MatcherInterface<NodeType> { \
256 bool matches(const NodeType &Node, ASTMatchFinder *Finder, \
274 template <typename NodeType, typename ParamT> \
[all …]
/minix3/external/bsd/llvm/dist/clang/unittests/AST/
H A DMatchVerifier.h41 template <typename NodeType>
68 const NodeType &Node) {} in verify()
86 template <typename NodeType> template <typename MatcherType>
87 testing::AssertionResult MatchVerifier<NodeType>::match( in match()
130 template <typename NodeType>
131 void MatchVerifier<NodeType>::run(const MatchFinder::MatchResult &Result) { in run()
132 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>(""); in run()
160 template <typename NodeType>
161 class LocationVerifier : public MatchVerifier<NodeType> {
169 void verify(const MatchFinder::MatchResult &Result, const NodeType &Node) { in verify()
[all …]
/minix3/external/bsd/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h446 typedef clang::ento::ExplodedNode NodeType;
447 typedef NodeType::succ_iterator ChildIteratorType;
448 typedef llvm::df_iterator<NodeType*> nodes_iterator;
450 static inline NodeType* getEntryNode(NodeType* N) {
454 static inline ChildIteratorType child_begin(NodeType* N) {
458 static inline ChildIteratorType child_end(NodeType* N) {
462 static inline nodes_iterator nodes_begin(NodeType* N) {
466 static inline nodes_iterator nodes_end(NodeType* N) {
472 typedef const clang::ento::ExplodedNode NodeType;
473 typedef NodeType::const_succ_iterator ChildIteratorType;
[all …]
/minix3/external/bsd/llvm/dist/clang/include/clang/Analysis/
H A DCallGraph.h174 typedef clang::CallGraphNode NodeType;
178 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
179 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType;
180 static inline ChildIteratorType child_begin(NodeType *N) {
183 static inline ChildIteratorType child_end (NodeType *N) {
192 typedef const clang::CallGraphNode NodeType;
193 typedef NodeType::const_iterator ChildIteratorType;
194 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();}
196 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
[all …]
/minix3/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h164 typedef const MachineLoop NodeType;
167 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
168 static inline ChildIteratorType child_begin(NodeType *N) {
171 static inline ChildIteratorType child_end(NodeType *N) {
177 typedef MachineLoop NodeType;
180 static NodeType *getEntryNode(MachineLoop *L) { return L; }
181 static inline ChildIteratorType child_begin(NodeType *N) {
184 static inline ChildIteratorType child_end(NodeType *N) {
H A DMachineRegionInfo.h147 typedef df_iterator<NodeType*, SmallPtrSet<NodeType*, 8>, false,
148 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
150 static NodeType *getEntryNode(MachineRegionInfo *RI) {
163 typedef df_iterator<NodeType*, SmallPtrSet<NodeType*, 8>, false,
164 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
166 static NodeType *getEntryNode(MachineRegionInfoPass *RI) {
H A DMachineBasicBlock.h710 typedef MachineBasicBlock NodeType;
713 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; }
714 static inline ChildIteratorType child_begin(NodeType *N) {
717 static inline ChildIteratorType child_end(NodeType *N) {
723 typedef const MachineBasicBlock NodeType;
726 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }
727 static inline ChildIteratorType child_begin(NodeType *N) {
730 static inline ChildIteratorType child_end(NodeType *N) {
742 typedef MachineBasicBlock NodeType;
744 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
[all …]
H A DMachineDominators.h322 typedef MachineDomTreeNode NodeType;
323 typedef NodeType::iterator ChildIteratorType;
325 static NodeType *getEntryNode(NodeType *N) {
328 static inline ChildIteratorType child_begin(NodeType* N) {
331 static inline ChildIteratorType child_end(NodeType* N) {
338 static NodeType *getEntryNode(MachineDominatorTree *DT) {
/minix3/external/bsd/llvm/dist/clang/include/clang/Analysis/Analyses/
H A DDominators.h172 typedef ::clang::DomTreeNode NodeType;
173 typedef NodeType::iterator ChildIteratorType;
175 static NodeType *getEntryNode(NodeType *N) {
178 static inline ChildIteratorType child_begin(NodeType *N) {
181 static inline ChildIteratorType child_end(NodeType *N) {
198 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
/minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/
H A DMachineBlockFrequencyInfo.cpp54 typedef const MachineBasicBlock NodeType; typedef
59 const NodeType *getEntryNode(const MachineBlockFrequencyInfo *G) { in getEntryNode()
63 static ChildIteratorType child_begin(const NodeType *N) { in child_begin()
67 static ChildIteratorType child_end(const NodeType *N) { in child_end()

123