| /external/llvm/include/llvm/ADT/ |
| D | GraphTraits.h | 27 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);
|
| D | PostOrderIterator.h | 90 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
92 class GT = GraphTraits<GraphT> >
187 template<class T, class SetType=std::set<typename GraphTraits<T>::NodeType*> >
210 class SetType = std::set<typename GraphTraits<T>::NodeType*>,
234 class SetType = std::set<typename GraphTraits<T>::NodeType*> >
281 template<class GraphT, class GT = GraphTraits<GraphT> >
|
| D | DepthFirstIterator.h | 64 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
65 bool ExtStorage = false, class GT = GraphTraits<GraphT> >
216 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeType*> >
241 class SetTy = llvm::SmallPtrSet<typename GraphTraits<T>::NodeType*, 8>,
265 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeType*> >
|
| /external/llvm/include/llvm/Analysis/ |
| D | RegionIterator.h | 38 typedef GraphTraits<BlockT*> BlockTraits;
161 typedef GraphTraits<BlockT*> BlockTraits;
253 template<> struct GraphTraits<NodeT*> { \
264 template<> struct GraphTraits<FlatIt<NodeT*>> { \
277 template<> struct GraphTraits<RegionT*> \
278 : public GraphTraits<NodeT*> { \
290 template<> struct GraphTraits<FlatIt<RegionT*> > \
291 : public GraphTraits<FlatIt<NodeT*> > { \
293 GraphTraits<FlatIt<NodeType*> > > nodes_iterator; \
311 template <> struct GraphTraits<RegionInfo*>
[all …]
|
| D | LoopInfoImpl.h | 36 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()
408 typedef GraphTraits<BlockT*> BlockTraits;
[all …]
|
| D | CallGraph.h | 397 template <> struct GraphTraits<CallGraphNode *> {
418 template <> struct GraphTraits<const CallGraphNode *> {
441 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
461 struct GraphTraits<const CallGraph *> : public GraphTraits<
|
| D | RegionInfo.h | 258 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;
|
| D | PostDominators.h | 97 template <> struct GraphTraits<PostDominatorTree*>
98 : public GraphTraits<DomTreeNode*> {
|
| D | Interval.h | 121 template <> struct GraphTraits<Interval*> {
136 template <> struct GraphTraits<Inverse<Interval*> > {
|
| D | LoopInfo.h | 160 typedef GraphTraits<const BlockT*> BlockTraits; in isLoopExiting()
176 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getNumBackEdges()
243 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopLatches()
693 template <> struct GraphTraits<const Loop*> {
706 template <> struct GraphTraits<Loop*> {
|
| D | DominanceFrontier.h | 38 typedef GraphTraits<BlockT *> BlockTraits;
117 typedef GraphTraits<BlockT *> BlockTraits;
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineRegionInfo.h | 143 template <> struct GraphTraits<MachineRegionInfo*>
144 : public GraphTraits<FlatIt<MachineRegionNode*> > {
146 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
149 return GraphTraits<FlatIt<MachineRegion*> >::getEntryNode(RI->getTopLevelRegion());
159 template <> struct GraphTraits<MachineRegionInfoPass*>
160 : public GraphTraits<MachineRegionInfo *> {
162 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
165 return GraphTraits<MachineRegionInfo*>::getEntryNode(&RI->getRegionInfo());
168 return GraphTraits<MachineRegionInfo*>::nodes_begin(&RI->getRegionInfo());
171 return GraphTraits<MachineRegionInfo*>::nodes_end(&RI->getRegionInfo());
|
| D | MachineFunction.h | 499 template <> struct GraphTraits<MachineFunction*> :
500 public GraphTraits<MachineBasicBlock*> {
511 template <> struct GraphTraits<const MachineFunction*> :
512 public GraphTraits<const MachineBasicBlock*> {
536 template <> struct GraphTraits<Inverse<MachineFunction*> > :
537 public GraphTraits<Inverse<MachineBasicBlock*> > {
542 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
543 public GraphTraits<Inverse<const MachineBasicBlock*> > {
|
| D | MachineDominators.h | 249 template<class T> struct GraphTraits;
251 template <> struct GraphTraits<MachineDomTreeNode *> {
266 template <> struct GraphTraits<MachineDominatorTree*>
267 : public GraphTraits<MachineDomTreeNode *> {
|
| D | MachineLoopInfo.h | 163 template <> struct GraphTraits<const MachineLoop*> {
176 template <> struct GraphTraits<MachineLoop*> {
|
| /external/llvm/unittests/Analysis/ |
| D | CallGraphTest.cpp | 20 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()
|
| /external/llvm/include/llvm/IR/ |
| D | CFG.h | 292 template <> struct GraphTraits<BasicBlock*> {
305 template <> struct GraphTraits<const BasicBlock*> {
324 template <> struct GraphTraits<Inverse<BasicBlock*> > {
336 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
360 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
369 template <> struct GraphTraits<const Function*> :
370 public GraphTraits<const BasicBlock*> {
386 template <> struct GraphTraits<Inverse<Function*> > :
387 public GraphTraits<Inverse<BasicBlock*> > {
392 template <> struct GraphTraits<Inverse<const Function*> > :
[all …]
|
| D | Dominators.h | 44 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*> {
|
| D | Type.h | 35 template<class GraphType> struct GraphTraits;
447 template <> struct GraphTraits<Type*> {
460 template <> struct GraphTraits<const Type*> {
|
| /external/clang/include/clang/Analysis/ |
| D | CallGraph.h | 173 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*> {
|
| D | CFG.h | 1000 template <> struct GraphTraits< ::clang::CFGBlock *> {
1014 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1028 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
1042 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
1058 template <> struct GraphTraits< ::clang::CFG* >
1059 : public GraphTraits< ::clang::CFGBlock *> {
1069 template <> struct GraphTraits<const ::clang::CFG* >
1070 : public GraphTraits<const ::clang::CFGBlock *> {
1088 template <> struct GraphTraits<Inverse< ::clang::CFG*> >
1089 : public GraphTraits<Inverse< ::clang::CFGBlock*> > {
[all …]
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
194 template <> struct GraphTraits< ::clang::DominatorTree* >
195 : public GraphTraits< ::clang::DomTreeNode* > {
|
| /external/clang/include/clang/AST/ |
| D | StmtGraphTraits.h | 27 template <> struct GraphTraits<clang::Stmt*> {
54 template <> struct GraphTraits<const clang::Stmt*> {
|
| /external/llvm/include/llvm/Support/ |
| D | GenericDomTreeConstruction.h | 151 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()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | NaryReassociate.cpp | 180 for (auto Node = GraphTraits<DominatorTree *>::nodes_begin(DT); in doOneIteration()
181 Node != GraphTraits<DominatorTree *>::nodes_end(DT); ++Node) { in doOneIteration()
|