Home
last modified time | relevance | path

Searched refs:GraphTraits (Results 1 – 25 of 45) 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.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*> >
237 class SetTy = llvm::SmallPtrSet<typename GraphTraits<T>::NodeType*, 8>,
261 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeType*> >
/external/llvm/include/llvm/IR/
DCFG.h274 template <> struct GraphTraits<BasicBlock*> {
287 template <> struct GraphTraits<const BasicBlock*> {
306 template <> struct GraphTraits<Inverse<BasicBlock*> > {
318 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
342 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
351 template <> struct GraphTraits<const Function*> :
352 public GraphTraits<const BasicBlock*> {
368 template <> struct GraphTraits<Inverse<Function*> > :
369 public GraphTraits<Inverse<BasicBlock*> > {
374 template <> struct GraphTraits<Inverse<const Function*> > :
[all …]
DDominators.h39 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT LLVM_COMMA
43 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
117 template <> struct GraphTraits<DomTreeNode*> {
142 template <> struct GraphTraits<DominatorTree*>
143 : public GraphTraits<DomTreeNode*> {
DType.h35 template<class GraphType> struct GraphTraits;
444 template <> struct GraphTraits<Type*> {
457 template <> struct GraphTraits<const Type*> {
/external/llvm/include/llvm/Analysis/
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 …]
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 …]
DCallGraph.h398 template <> struct GraphTraits<CallGraphNode *> {
419 template <> struct GraphTraits<const CallGraphNode *> {
431 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
451 struct GraphTraits<const CallGraph *> : public GraphTraits<
DPostDominators.h97 template <> struct GraphTraits<PostDominatorTree*>
98 : public GraphTraits<DomTreeNode*> {
DInterval.h121 template <> struct GraphTraits<Interval*> {
136 template <> struct GraphTraits<Inverse<Interval*> > {
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*> {
DIntervalIterator.h88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>,
89 class IGT = GraphTraits<Inverse<NodeTy*> > >
DLazyCallGraph.h515 template <> struct GraphTraits<LazyCallGraph::Node *> {
523 template <> struct GraphTraits<LazyCallGraph *> {
/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.h1002 template <> struct GraphTraits< ::clang::CFGBlock *> {
1016 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1030 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
1044 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
1060 template <> struct GraphTraits< ::clang::CFG* >
1061 : public GraphTraits< ::clang::CFGBlock *> {
1071 template <> struct GraphTraits<const ::clang::CFG* >
1072 : public GraphTraits<const ::clang::CFGBlock *> {
1090 template <> struct GraphTraits<Inverse< ::clang::CFG*> >
1091 : public GraphTraits<Inverse< ::clang::CFGBlock*> > {
[all …]
/external/llvm/include/llvm/CodeGen/
DMachineFunction.h483 template <> struct GraphTraits<MachineFunction*> :
484 public GraphTraits<MachineBasicBlock*> {
495 template <> struct GraphTraits<const MachineFunction*> :
496 public GraphTraits<const MachineBasicBlock*> {
520 template <> struct GraphTraits<Inverse<MachineFunction*> > :
521 public GraphTraits<Inverse<MachineBasicBlock*> > {
526 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
527 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.h163 template <> struct GraphTraits<const MachineLoop*> {
176 template <> struct GraphTraits<MachineLoop*> {
DMachineBasicBlock.h703 template <> struct GraphTraits<MachineBasicBlock *> {
716 template <> struct GraphTraits<const MachineBasicBlock *> {
735 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
749 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
/external/clang/include/clang/Analysis/Analyses/
DDominators.h171 template <> struct GraphTraits< ::clang::DomTreeNode* > {
196 template <> struct GraphTraits< ::clang::DominatorTree* >
197 : public GraphTraits< ::clang::DomTreeNode* > {
/external/clang/include/clang/AST/
DStmtGraphTraits.h27 template <> struct GraphTraits<clang::Stmt*> {
54 template <> struct GraphTraits<const clang::Stmt*> {
/external/llvm/include/llvm/Support/
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()
DGenericDomTree.h177 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
241 typedef GraphTraits<Inverse<N> > InvTraits; in Split()
568 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB); in splitBlock()
570 this->Split<NodeT*, GraphTraits<NodeT*> >(*this, NewBB); in splitBlock()
603 friend void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
679 typedef GraphTraits<FT*> TraitsTy; in recalculate()
/external/llvm/lib/IR/
DDominators.cpp69 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT LLVM_COMMA
73 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT

12