Searched refs:GraphTraits (Results 1 - 25 of 37) sorted by relevance

12

/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/
H A DGraphTraits.h1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
10 // This file defines the little GraphTraits<X> template class that should be
23 // GraphTraits - This class should be specialized by different graph types...
27 struct GraphTraits { struct in namespace:llvm
55 // need to include the appropriate specialization of GraphTraits<> for your
84 // Provide a partial specialization of GraphTraits so that the inverse of an
87 struct GraphTraits<Inverse<Inverse<T> > > { struct in namespace:llvm
88 typedef typename GraphTraits<T>::NodeType NodeType;
89 typedef typename GraphTraits<T>::ChildIteratorType ChildIteratorType;
92 return GraphTraits<
[all...]
H A DPostOrderIterator.h10 // This file builds on the ADT/GraphTraits.h file to build a generic graph
12 // GraphTraits specialization.
19 #include "llvm/ADT/GraphTraits.h"
88 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> >
H A DDepthFirstIterator.h10 // This file builds on the ADT/GraphTraits.h file to build generic depth
36 #include "llvm/ADT/GraphTraits.h"
63 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*> >
/freebsd-10.0-release/contrib/llvm/include/llvm/Support/
H A DDataFlow.h10 // This file defines specializations of GraphTraits that allows Use-Def and
17 #include "llvm/ADT/GraphTraits.h"
23 // Provide specializations of GraphTraits to be able to treat def-use/use-def
26 template <> struct GraphTraits<const Value*> { struct in namespace:llvm
43 template <> struct GraphTraits<Value*> { struct in namespace:llvm
60 template <> struct GraphTraits<Inverse<const User*> > { struct in namespace:llvm
81 template <> struct GraphTraits<Inverse<User*> > { struct in namespace:llvm
H A DCFG.h10 // This file defines specializations of GraphTraits that allow Function and
18 #include "llvm/ADT/GraphTraits.h"
246 // GraphTraits specializations for basic block graphs (CFGs)
249 // Provide specializations of GraphTraits to be able to treat a function as a
252 template <> struct GraphTraits<BasicBlock*> { struct in namespace:llvm
265 template <> struct GraphTraits<const BasicBlock*> { struct in namespace:llvm
279 // Provide specializations of GraphTraits to be able to treat a function as a
284 template <> struct GraphTraits<Inverse<BasicBlock*> > { struct in namespace:llvm
296 template <> struct GraphTraits<Inverse<const BasicBlock*> > { struct in namespace:llvm
313 // GraphTraits specialization
320 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> { struct in namespace:llvm
329 template <> struct GraphTraits<const Function*> : struct in namespace:llvm
346 template <> struct GraphTraits<Inverse<Function*> > : struct in namespace:llvm
352 template <> struct GraphTraits<Inverse<const Function*> > : struct in namespace:llvm
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DBlockFrequencyImpl.h49 typedef GraphTraits< Inverse<BlockT *> > GT;
157 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
194 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head),
239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head);
290 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
291 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
325 for (typename GraphTraits<Block
[all...]
H A DRegionIterator.h14 #include "llvm/ADT/GraphTraits.h"
259 // RegionNode GraphTraits specialization so the bbs in the region can be
266 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<RegionInf struct in namespace:llvm
[all...]
H A DPostDominators.h86 template <> struct GraphTraits<PostDominatorTree*> struct in namespace:llvm
87 : public GraphTraits<DomTreeNode*> {
H A DCallGraph.h54 #include "llvm/ADT/GraphTraits.h"
303 // GraphTraits specializations for call graphs so that they can be treated as
309 template <> struct GraphTraits<CallGraphNode*> { struct
332 template <> struct GraphTraits<const CallGraphNode*> { struct
341 template<> struct GraphTraits<CallGraph*> : public GraphTraits<CallGraphNode*> { struct in inherits:GraphTraits
362 template<> struct GraphTraits<const CallGraph*> : struct in inherits:GraphTraits
363 public GraphTraits<const CallGraphNode*> {
H A DInterval.h23 #include "llvm/ADT/GraphTraits.h"
124 template <> struct GraphTraits<Interval*> { struct in namespace:llvm
139 template <> struct GraphTraits<Inverse<Interval*> > { struct in namespace:llvm
H A DLoopInfoImpl.h39 typedef GraphTraits<BlockT*> BlockTraits;
73 typedef GraphTraits<BlockT*> BlockTraits;
103 typedef GraphTraits<BlockT*> BlockTraits;
127 typedef GraphTraits<BlockT*> BlockTraits;
149 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
265 typedef GraphTraits<BlockT*> BlockTraits;
273 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
368 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
428 typedef GraphTraits<Block
[all...]
H A DDominatorInternals.h151 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT,
153 typedef GraphTraits<NodeT> GraphT;
174 MultipleRoots |= (DT.isPostDominator() && N != GraphTraits<FuncT*>::size(&F));
207 typedef GraphTraits<Inverse<NodeT> > InvTraits;
H A DDominators.h20 #include "llvm/ADT/GraphTraits.h"
183 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
247 typedef GraphTraits<Inverse<N> > InvTraits;
539 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB);
541 this->Split<NodeT*, GraphTraits<NodeT*> >(*this, NewBB);
574 friend void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
650 typedef GraphTraits<FT*> TraitsTy;
874 /// DominatorTree GraphTraits specialization so the DominatorTree can be
877 template <> struct GraphTraits<DomTreeNode*> { struct in namespace:llvm
902 template <> struct GraphTraits<DominatorTre struct in namespace:llvm
[all...]
H A DIntervalIterator.h88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>,
89 class IGT = GraphTraits<Inverse<NodeTy*> > >
H A DLoopInfo.h35 #include "llvm/ADT/GraphTraits.h"
150 typedef GraphTraits<const BlockT*> BlockTraits;
166 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
682 template <> struct GraphTraits<const Loop*> { struct in namespace:llvm
695 template <> struct GraphTraits<Loop*> { struct in namespace:llvm
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/AST/
H A DStmtGraphTraits.h10 // This file defines a template specialization of llvm::GraphTraits to
20 #include "llvm/ADT/GraphTraits.h"
24 //template <typename T> struct GraphTraits;
27 template <> struct GraphTraits<clang::Stmt*> { struct in namespace:llvm
54 template <> struct GraphTraits<const clang::Stmt*> { struct in namespace:llvm
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineDominators.h175 /// DominatorTree GraphTraits specialization so the DominatorTree can be
179 template<class T> struct GraphTraits;
181 template <> struct GraphTraits<MachineDomTreeNode *> { struct in namespace:llvm
196 template <> struct GraphTraits<MachineDominatorTree*> struct in namespace:llvm
197 : public GraphTraits<MachineDomTreeNode *> {
H A DMachineFunction.h464 // GraphTraits specializations for function basic block graphs (CFGs)
467 // Provide specializations of GraphTraits to be able to treat a
472 template <> struct GraphTraits<MachineFunction*> :
473 public GraphTraits<MachineBasicBlock*> {
484 template <> struct GraphTraits<const MachineFunction*> : struct in namespace:llvm
485 public GraphTraits<const MachineBasicBlock*> {
504 // Provide specializations of GraphTraits to be able to treat a function as a
509 template <> struct GraphTraits<Inverse<MachineFunction*> > : struct in namespace:llvm
510 public GraphTraits<Inverse<MachineBasicBlock*> > {
515 template <> struct GraphTraits<Invers struct in namespace:llvm
[all...]
H A DMachineLoopInfo.h162 template <> struct GraphTraits<const MachineLoop*> { struct in namespace:llvm
175 template <> struct GraphTraits<MachineLoop*> { struct in namespace:llvm
H A DMachineBasicBlock.h17 #include "llvm/ADT/GraphTraits.h"
669 // GraphTraits specializations for machine basic block graphs (machine-CFGs)
672 // Provide specializations of GraphTraits to be able to treat a
676 template <> struct GraphTraits<MachineBasicBlock *> { struct in namespace:llvm
689 template <> struct GraphTraits<const MachineBasicBlock *> { struct in namespace:llvm
702 // Provide specializations of GraphTraits to be able to treat a
708 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > { struct in namespace:llvm
722 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > { struct in namespace:llvm
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCallGraph.h23 #include "llvm/ADT/GraphTraits.h"
173 template <> struct GraphTraits<clang::CallGraphNode*> { struct in namespace:llvm
191 template <> struct GraphTraits<const clang::CallGraphNode*> { struct in namespace:llvm
199 template <> struct GraphTraits<clang::CallGraph*> struct in namespace:llvm
200 : public GraphTraits<clang::CallGraphNode*> {
225 template <> struct GraphTraits<const clang::CallGraph*> : struct in namespace:llvm
226 public GraphTraits<const clang::CallGraphNode*> {
H A DCFG.h22 #include "llvm/ADT/GraphTraits.h"
839 // GraphTraits specializations for CFG basic block graphs (source-level CFGs)
855 template <> struct GraphTraits< ::clang::CFGBlock *> { struct in namespace:clang::llvm
869 template <> struct GraphTraits< const ::clang::CFGBlock *> { struct in namespace:clang::llvm
883 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > { struct in namespace:clang::llvm
897 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > { struct in namespace:clang::llvm
913 template <> struct GraphTraits< ::clang::CFG* > struct in namespace:clang::llvm
914 : public GraphTraits< ::clang::CFGBlock *> {
924 template <> struct GraphTraits<const ::clang::CFG* > struct in namespace:clang::llvm
925 : public GraphTraits<cons
943 template <> struct GraphTraits<Inverse< ::clang::CFG*> > struct in namespace:clang::llvm
953 template <> struct GraphTraits<Inverse<const ::clang::CFG*> > struct in namespace:clang::llvm
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DDominators.h19 #include "llvm/ADT/GraphTraits.h"
166 /// DominatorTree GraphTraits specialization so the DominatorTree can be
170 template <> struct GraphTraits< ::clang::DomTreeNode* > { struct in namespace:llvm
195 template <> struct GraphTraits< ::clang::DominatorTree* > struct in namespace:llvm
196 : public GraphTraits< ::clang::DomTreeNode* > {
/freebsd-10.0-release/contrib/llvm/include/llvm/IR/
H A DType.h34 template<class GraphType> struct GraphTraits;
442 // Provide specializations of GraphTraits to be able to treat a type as a
446 template <> struct GraphTraits<Type*> {
459 template <> struct GraphTraits<const Type*> {
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DRegionPrinter.cpp74 GraphTraits<RegionInfo*>::ChildIteratorType CI, RegionInfo *RI) {

Completed in 231 milliseconds

12