Home
last modified time | relevance | path

Searched refs:GraphTraits (Results 1 – 25 of 47) sorted by relevance

12

/minix3/external/bsd/llvm/dist/llvm/include/llvm/ADT/
H A DGraphTraits.h27 struct GraphTraits { struct
87 struct GraphTraits<Inverse<Inverse<T> > > {
88 typedef typename GraphTraits<T>::NodeType NodeType;
89 typedef typename GraphTraits<T>::ChildIteratorType ChildIteratorType;
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
96 return GraphTraits<T>::child_begin(N);
100 return GraphTraits<T>::child_end(N);
H A DPostOrderIterator.h89 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
91 class GT = GraphTraits<GraphT> >
181 template<class T, class SetType=std::set<typename GraphTraits<T>::NodeType*> >
199 class SetType = std::set<typename GraphTraits<T>::NodeType*>,
218 class SetType = std::set<typename GraphTraits<T>::NodeType*> >
259 template<class GraphT, class GT = GraphTraits<GraphT> >
H A DDepthFirstIterator.h64 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
65 bool ExtStorage = false, class GT = GraphTraits<GraphT> >
218 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeType*> >
244 class SetTy = llvm::SmallPtrSet<typename GraphTraits<T>::NodeType*, 8>,
268 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeType*> >
/minix3/external/bsd/llvm/dist/llvm/include/llvm/Analysis/
H A DRegionIterator.h38 typedef GraphTraits<BlockT*> BlockTraits;
171 typedef GraphTraits<BlockT*> BlockTraits;
273 template<> struct GraphTraits<NodeT*> { \
284 template<> struct GraphTraits<FlatIt<NodeT*>> { \
297 template<> struct GraphTraits<RegionT*> \
298 : public GraphTraits<NodeT*> { \
310 template<> struct GraphTraits<FlatIt<RegionT*> > \
311 : public GraphTraits<FlatIt<NodeT*> > { \
313 GraphTraits<FlatIt<NodeType*> > > nodes_iterator; \
331 template <> struct GraphTraits<RegionInfo*>
[all …]
H A DLoopInfoImpl.h36 typedef GraphTraits<BlockT*> BlockTraits; in getExitingBlocks()
65 typedef GraphTraits<BlockT*> BlockTraits; in getExitBlocks()
90 typedef GraphTraits<BlockT*> BlockTraits; in getExitEdges()
114 typedef GraphTraits<BlockT*> BlockTraits; in getLoopPreheader()
136 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopPredecessor()
158 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopLatch()
247 typedef GraphTraits<BlockT*> BlockTraits; in verifyLoop()
255 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in verifyLoop()
349 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in discoverAndMapSubloop()
409 typedef GraphTraits<BlockT*> BlockTraits;
[all …]
H A DCallGraph.h397 template <> struct GraphTraits<CallGraphNode *> {
418 template <> struct GraphTraits<const CallGraphNode *> {
441 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
461 struct GraphTraits<const CallGraph *> : public GraphTraits<
H A DPostDominators.h97 template <> struct GraphTraits<PostDominatorTree*>
98 : public GraphTraits<DomTreeNode*> {
H A DInterval.h121 template <> struct GraphTraits<Interval*> {
136 template <> struct GraphTraits<Inverse<Interval*> > {
H A DRegionInfo.h258 typedef GraphTraits<BlockT *> BlockTraits;
259 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits;
629 GraphTraits<RegionNodeT *>> element_iterator;
633 GraphTraits<const RegionNodeT *>> const_element_iterator;
663 typedef GraphTraits<BlockT *> BlockTraits;
664 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits;
H A DLoopInfo.h155 typedef GraphTraits<const BlockT*> BlockTraits; in isLoopExiting()
171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getNumBackEdges()
238 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopLatches()
753 template <> struct GraphTraits<const Loop*> {
766 template <> struct GraphTraits<Loop*> {
H A DDominanceFrontier.h38 typedef GraphTraits<BlockT *> BlockTraits;
117 typedef GraphTraits<BlockT *> BlockTraits;
H A DIntervalIterator.h88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>,
89 class IGT = GraphTraits<Inverse<NodeTy*> > >
/minix3/external/bsd/llvm/dist/llvm/unittests/Analysis/
H A DCallGraphTest.cpp20 typedef typename GraphTraits<Ty *>::NodeType NodeTy; in canSpecializeGraphTraitsIterators()
22 auto I = GraphTraits<Ty *>::nodes_begin(G); in canSpecializeGraphTraitsIterators()
23 auto E = GraphTraits<Ty *>::nodes_end(G); in canSpecializeGraphTraitsIterators()
34 NodeTy *N = GraphTraits<Ty *>::getEntryNode(G); in canSpecializeGraphTraitsIterators()
36 auto S = GraphTraits<NodeTy *>::child_begin(N); in canSpecializeGraphTraitsIterators()
37 auto F = GraphTraits<NodeTy *>::child_end(N); in canSpecializeGraphTraitsIterators()
/minix3/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h145 template <> struct GraphTraits<MachineRegionInfo*>
146 : public GraphTraits<FlatIt<MachineRegionNode*> > {
148 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
151 return GraphTraits<FlatIt<MachineRegion*> >::getEntryNode(RI->getTopLevelRegion());
161 template <> struct GraphTraits<MachineRegionInfoPass*>
162 : public GraphTraits<MachineRegionInfo *> {
164 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
167 return GraphTraits<MachineRegionInfo*>::getEntryNode(&RI->getRegionInfo());
170 return GraphTraits<MachineRegionInfo*>::nodes_begin(&RI->getRegionInfo());
173 return GraphTraits<MachineRegionInfo*>::nodes_end(&RI->getRegionInfo());
H A DMachineFunction.h492 template <> struct GraphTraits<MachineFunction*> :
493 public GraphTraits<MachineBasicBlock*> {
504 template <> struct GraphTraits<const MachineFunction*> :
505 public GraphTraits<const MachineBasicBlock*> {
529 template <> struct GraphTraits<Inverse<MachineFunction*> > :
530 public GraphTraits<Inverse<MachineBasicBlock*> > {
535 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
536 public GraphTraits<Inverse<const MachineBasicBlock*> > {
H A DMachineDominators.h319 template<class T> struct GraphTraits;
321 template <> struct GraphTraits<MachineDomTreeNode *> {
336 template <> struct GraphTraits<MachineDominatorTree*>
337 : public GraphTraits<MachineDomTreeNode *> {
H A DMachineLoopInfo.h163 template <> struct GraphTraits<const MachineLoop*> {
176 template <> struct GraphTraits<MachineLoop*> {
/minix3/external/bsd/llvm/dist/llvm/include/llvm/IR/
H A DCFG.h280 template <> struct GraphTraits<BasicBlock*> {
293 template <> struct GraphTraits<const BasicBlock*> {
312 template <> struct GraphTraits<Inverse<BasicBlock*> > {
324 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
348 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
357 template <> struct GraphTraits<const Function*> :
358 public GraphTraits<const BasicBlock*> {
374 template <> struct GraphTraits<Inverse<Function*> > :
375 public GraphTraits<Inverse<BasicBlock*> > {
380 template <> struct GraphTraits<Inverse<const Function*> > :
[all …]
H A DDominators.h44 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT LLVM_COMMA
48 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
129 template <> struct GraphTraits<DomTreeNode*> {
154 template <> struct GraphTraits<DominatorTree*>
155 : public GraphTraits<DomTreeNode*> {
H A DType.h35 template<class GraphType> struct GraphTraits;
447 template <> struct GraphTraits<Type*> {
460 template <> struct GraphTraits<const Type*> {
/minix3/external/bsd/llvm/dist/clang/include/clang/Analysis/
H A DCallGraph.h173 template <> struct GraphTraits<clang::CallGraphNode*> {
191 template <> struct GraphTraits<const clang::CallGraphNode*> {
199 template <> struct GraphTraits<clang::CallGraph*>
200 : public GraphTraits<clang::CallGraphNode*> {
225 template <> struct GraphTraits<const clang::CallGraph*> :
226 public GraphTraits<const clang::CallGraphNode*> {
H A DCFG.h1001 template <> struct GraphTraits< ::clang::CFGBlock *> {
1015 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1029 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
1043 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
1059 template <> struct GraphTraits< ::clang::CFG* >
1060 : public GraphTraits< ::clang::CFGBlock *> {
1070 template <> struct GraphTraits<const ::clang::CFG* >
1071 : public GraphTraits<const ::clang::CFGBlock *> {
1089 template <> struct GraphTraits<Inverse< ::clang::CFG*> >
1090 : public GraphTraits<Inverse< ::clang::CFGBlock*> > {
[all …]
/minix3/external/bsd/llvm/dist/clang/include/clang/AST/
H A DStmtGraphTraits.h27 template <> struct GraphTraits<clang::Stmt*> {
54 template <> struct GraphTraits<const clang::Stmt*> {
/minix3/external/bsd/llvm/dist/clang/include/clang/Analysis/Analyses/
H A DDominators.h171 template <> struct GraphTraits< ::clang::DomTreeNode* > {
196 template <> struct GraphTraits< ::clang::DominatorTree* >
197 : public GraphTraits< ::clang::DomTreeNode* > {
/minix3/external/bsd/llvm/dist/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h151 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, in Calculate()
153 typedef GraphTraits<NodeT> GraphT; in Calculate()
174 MultipleRoots |= (DT.isPostDominator() && N != GraphTraits<FuncT*>::size(&F)); in Calculate()
207 typedef GraphTraits<Inverse<NodeT> > InvTraits; in Calculate()

12