Home
last modified time | relevance | path

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

12

/external/llvm/include/llvm/ADT/
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);
DPostOrderIterator.h88 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
90 class GT = GraphTraits<GraphT> >
180 template<class T, class SetType=std::set<typename GraphTraits<T>::NodeType*> >
198 class SetType = std::set<typename GraphTraits<T>::NodeType*>,
217 class SetType = std::set<typename GraphTraits<T>::NodeType*> >
258 template<class GraphT, class GT = GraphTraits<GraphT> >
DDepthFirstIterator.h63 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
64 bool ExtStorage = false, class GT = GraphTraits<GraphT> >
211 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeType*> >
230 class SetTy = llvm::SmallPtrSet<typename GraphTraits<T>::NodeType*, 8>,
248 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeType*> >
/external/llvm/include/llvm/Support/
DCFG.h256 template <> struct GraphTraits<BasicBlock*> {
269 template <> struct GraphTraits<const BasicBlock*> {
288 template <> struct GraphTraits<Inverse<BasicBlock*> > {
300 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
324 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
333 template <> struct GraphTraits<const Function*> :
334 public GraphTraits<const BasicBlock*> {
350 template <> struct GraphTraits<Inverse<Function*> > :
351 public GraphTraits<Inverse<BasicBlock*> > {
356 template <> struct GraphTraits<Inverse<const Function*> > :
[all …]
DDataFlow.h26 template <> struct GraphTraits<const Value*> {
43 template <> struct GraphTraits<Value*> {
60 template <> struct GraphTraits<Inverse<const User*> > {
81 template <> struct GraphTraits<Inverse<User*> > {
/external/llvm/include/llvm/Analysis/
DBlockFrequencyImpl.h49 typedef GraphTraits< Inverse<BlockT *> > GT;
134 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in getSingleBlockPred()
135 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in getSingleBlockPred()
171 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doBlock()
172 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in doBlock()
219 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), in doLoop()
220 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); in doLoop()
296 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doFunction()
297 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in doFunction()
330 for (typename GraphTraits<BlockT *>::ChildIteratorType in print()
[all …]
DRegionIterator.h266 template<> struct GraphTraits<NodeT*> { \
277 template<> struct GraphTraits<FlatIt<NodeT*> > { \
290 template<> struct GraphTraits<RegionT*> \
291 : public GraphTraits<NodeT*> { \
303 template<> struct GraphTraits<FlatIt<RegionT*> > \
304 : public GraphTraits<FlatIt<NodeT*> > { \
306 GraphTraits<FlatIt<NodeType*> > > nodes_iterator; \
324 template <> struct GraphTraits<RegionInfo*>
325 : public GraphTraits<FlatIt<RegionNode*> > {
327 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
[all …]
DCallGraph.h309 template <> struct GraphTraits<CallGraphNode*> {
332 template <> struct GraphTraits<const CallGraphNode*> {
341 template<> struct GraphTraits<CallGraph*> : public GraphTraits<CallGraphNode*> {
362 template<> struct GraphTraits<const CallGraph*> :
363 public GraphTraits<const CallGraphNode*> {
DLoopInfoImpl.h39 typedef GraphTraits<BlockT*> BlockTraits; in getExitingBlocks()
73 typedef GraphTraits<BlockT*> BlockTraits; in getExitBlocks()
103 typedef GraphTraits<BlockT*> BlockTraits; in getExitEdges()
127 typedef GraphTraits<BlockT*> BlockTraits; in getLoopPreheader()
149 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopPredecessor()
171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopLatch()
265 typedef GraphTraits<BlockT*> BlockTraits; in verifyLoop()
273 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in verifyLoop()
368 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in discoverAndMapSubloop()
428 typedef GraphTraits<BlockT*> BlockTraits;
[all …]
DPostDominators.h91 template <> struct GraphTraits<PostDominatorTree*>
92 : public GraphTraits<DomTreeNode*> {
DInterval.h124 template <> struct GraphTraits<Interval*> {
139 template <> struct GraphTraits<Inverse<Interval*> > {
DDominators.h183 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
247 typedef GraphTraits<Inverse<N> > InvTraits; in Split()
539 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB); in splitBlock()
541 this->Split<NodeT*, GraphTraits<NodeT*> >(*this, NewBB); in splitBlock()
574 friend void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
650 typedef GraphTraits<FT*> TraitsTy; in recalculate()
877 template <> struct GraphTraits<DomTreeNode*> {
902 template <> struct GraphTraits<DominatorTree*>
903 : public GraphTraits<DomTreeNode*> {
DDominatorInternals.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()
DIntervalIterator.h88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>,
89 class IGT = GraphTraits<Inverse<NodeTy*> > >
DLoopInfo.h151 typedef GraphTraits<const BlockT*> BlockTraits; in isLoopExiting()
167 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getNumBackEdges()
699 template <> struct GraphTraits<const Loop*> {
712 template <> struct GraphTraits<Loop*> {
DRegionInfo.h557 GraphTraits<RegionNode*> > element_iterator;
560 false, GraphTraits<const RegionNode*> >
/external/clang/include/clang/Analysis/
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*> {
DCFG.h865 template <> struct GraphTraits< ::clang::CFGBlock *> {
879 template <> struct GraphTraits< const ::clang::CFGBlock *> {
893 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
907 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
923 template <> struct GraphTraits< ::clang::CFG* >
924 : public GraphTraits< ::clang::CFGBlock *> {
934 template <> struct GraphTraits<const ::clang::CFG* >
935 : public GraphTraits<const ::clang::CFGBlock *> {
953 template <> struct GraphTraits<Inverse< ::clang::CFG*> >
954 : public GraphTraits<Inverse< ::clang::CFGBlock*> > {
[all …]
/external/llvm/include/llvm/CodeGen/
DMachineFunction.h472 template <> struct GraphTraits<MachineFunction*> :
473 public GraphTraits<MachineBasicBlock*> {
484 template <> struct GraphTraits<const MachineFunction*> :
485 public GraphTraits<const MachineBasicBlock*> {
509 template <> struct GraphTraits<Inverse<MachineFunction*> > :
510 public GraphTraits<Inverse<MachineBasicBlock*> > {
515 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
516 public GraphTraits<Inverse<const MachineBasicBlock*> > {
DMachineDominators.h179 template<class T> struct GraphTraits;
181 template <> struct GraphTraits<MachineDomTreeNode *> {
196 template <> struct GraphTraits<MachineDominatorTree*>
197 : public GraphTraits<MachineDomTreeNode *> {
DMachineLoopInfo.h162 template <> struct GraphTraits<const MachineLoop*> {
175 template <> struct GraphTraits<MachineLoop*> {
DMachineBasicBlock.h676 template <> struct GraphTraits<MachineBasicBlock *> {
689 template <> struct GraphTraits<const MachineBasicBlock *> {
708 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
722 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
/external/clang/include/clang/AST/
DStmtGraphTraits.h27 template <> struct GraphTraits<clang::Stmt*> {
54 template <> struct GraphTraits<const clang::Stmt*> {
/external/clang/include/clang/Analysis/Analyses/
DDominators.h170 template <> struct GraphTraits< ::clang::DomTreeNode* > {
195 template <> struct GraphTraits< ::clang::DominatorTree* >
196 : public GraphTraits< ::clang::DomTreeNode* > {
/external/llvm/include/llvm/IR/
DType.h34 template<class GraphType> struct GraphTraits;
446 template <> struct GraphTraits<Type*> {
459 template <> struct GraphTraits<const Type*> {

12