| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | GraphTraits.h | 37 struct GraphTraits { struct
105 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
109 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
111 return make_range(GraphTraits<GraphType>::nodes_begin(G),
112 GraphTraits<GraphType>::nodes_end(G));
115 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
117 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
118 GraphTraits<Inverse<GraphType>>::nodes_end(G));
122 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
123 children(const typename GraphTraits<GraphType>::NodeRef &G) {
[all …]
|
| H A D | PostOrderIterator.h | 10 /// This file builds on the ADT/GraphTraits.h file to build a generic graph
12 /// GraphTraits specialization.
19 #include "llvm/ADT/GraphTraits.h"
94 class SetType = SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
198 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
220 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>,
243 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
294 template<class GraphT, class GT = GraphTraits<GraphT>>
|
| H A D | DepthFirstIterator.h | 83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
84 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
234 template <class T, class SetTy = df_iterator_default_set<typename GraphTraits<T>::NodeRef>>
259 df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
283 template <class T, class SetTy = df_iterator_default_set<typename GraphTraits<T>::NodeRef>>
|
| H A D | BreadthFirstIterator.h | 45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
46 class GT = GraphTraits<GraphT>>
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | RegionIterator.h | 47 using BlockTraits = GraphTraits<BlockT *>;
171 using BlockTraits = GraphTraits<BlockT *>;
266 template <> struct GraphTraits<NodeT *> { \
277 template <> struct GraphTraits<FlatIt<NodeT *>> { \
291 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
304 struct GraphTraits<FlatIt<RegionT *>> \
305 : public GraphTraits<FlatIt<NodeT *>> { \
308 GraphTraits<FlatIt<NodeRef>>>; \
326 template <> struct GraphTraits<RegionInfo*>
327 : public GraphTraits<FlatIt<RegionNode*>> {
[all …]
|
| H A D | CallGraph.h | 61 template <class GraphType> struct GraphTraits;
426 // GraphTraits specializations for call graphs so that they can be treated as
432 template <> struct GraphTraits<CallGraphNode *> {
451 template <> struct GraphTraits<const CallGraphNode *> {
480 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
506 struct GraphTraits<const CallGraph *> : public GraphTraits<
|
| H A D | PostDominators.h | 100 template <> struct GraphTraits<PostDominatorTree*>
101 : public GraphTraits<DomTreeNode*> {
|
| H A D | DDG.h | 487 template <> struct GraphTraits<DDGNode *> {
515 struct GraphTraits<DataDependenceGraph *> : public GraphTraits<DDGNode *> {
527 template <> struct GraphTraits<const DDGNode *> {
555 struct GraphTraits<const DataDependenceGraph *>
556 : public GraphTraits<const DDGNode *> {
|
| H A D | RegionInfo.h | 41 #include "llvm/ADT/GraphTraits.h"
267 using BlockTraits = GraphTraits<BlockT *>;
268 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
642 GraphTraits<RegionNodeT *>>;
647 GraphTraits<const RegionNodeT *>>;
686 using BlockTraits = GraphTraits<BlockT *>;
687 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
|
| H A D | DominanceFrontier.h | 49 using BlockTraits = GraphTraits<BlockT *>;
127 using BlockTraits = GraphTraits<BlockT *>;
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineRegionInfo.h | 137 struct GraphTraits<MachineRegionInfo *>
138 : public GraphTraits<FlatIt<MachineRegionNode *>> {
140 false, GraphTraits<FlatIt<NodeRef>>>;
143 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(
157 struct GraphTraits<MachineRegionInfoPass *>
158 : public GraphTraits<MachineRegionInfo *> {
160 false, GraphTraits<FlatIt<NodeRef>>>;
163 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
167 return GraphTraits<MachineRegionInfo *>::nodes_begin(&RI->getRegionInfo());
171 return GraphTraits<MachineRegionInfo *>::nodes_end(&RI->getRegionInfo());
|
| H A D | MachineCFGPrinter.h | 19 template <class GraphType> struct GraphTraits;
31 struct GraphTraits<DOTMachineFuncInfo *>
32 : public GraphTraits<const MachineBasicBlock *> {
|
| H A D | MachineDominators.h | 338 template <class T> struct GraphTraits;
341 struct GraphTraits<MachineDomTreeNode *>
347 struct GraphTraits<const MachineDomTreeNode *>
352 template <> struct GraphTraits<MachineDominatorTree*>
353 : public GraphTraits<MachineDomTreeNode *> {
|
| H A D | MachineLoopInfo.h | 174 template <> struct GraphTraits<const MachineLoop*> {
183 template <> struct GraphTraits<MachineLoop*> {
|
| H A D | MachineFunction.h | 1394 template <> struct GraphTraits<MachineFunction*> :
1395 public GraphTraits<MachineBasicBlock*> {
1411 template <> struct GraphTraits<const MachineFunction*> :
1412 public GraphTraits<const MachineBasicBlock*> {
1436 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1437 public GraphTraits<Inverse<MachineBasicBlock*>> {
1442 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1443 public GraphTraits<Inverse<const MachineBasicBlock*>> {
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | CFG.h | 300 template <> struct GraphTraits<BasicBlock*> {
309 template <> struct GraphTraits<const BasicBlock*> {
324 template <> struct GraphTraits<Inverse<BasicBlock*>> {
333 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
350 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
366 template <> struct GraphTraits<const Function*> :
367 public GraphTraits<const BasicBlock*> {
389 template <> struct GraphTraits<Inverse<Function*>> :
390 public GraphTraits<Inverse<BasicBlock*>> {
395 template <> struct GraphTraits<Inverse<const Function*>> :
[all …]
|
| H A D | Dominators.h | 44 template <class GraphType> struct GraphTraits;
256 struct GraphTraits<DomTreeNode *>
261 struct GraphTraits<const DomTreeNode *>
265 template <> struct GraphTraits<DominatorTree*>
266 : public GraphTraits<DomTreeNode*> {
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanCFG.h | 128 template <> struct GraphTraits<VPBlockDeepTraversalWrapper<VPBlockBase *>> {
146 struct GraphTraits<VPBlockDeepTraversalWrapper<const VPBlockBase *>> {
174 template <> struct GraphTraits<VPBlockShallowTraversalWrapper<VPBlockBase *>> {
192 struct GraphTraits<VPBlockShallowTraversalWrapper<const VPBlockBase *>> {
241 template <> struct GraphTraits<VPBlockBase *> {
256 template <> struct GraphTraits<const VPBlockBase *> {
274 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
291 template <> struct GraphTraits<VPlan *> {
|
| H A D | VPlanDominatorTree.h | 44 struct GraphTraits<VPDomTreeNode *>
49 struct GraphTraits<const VPDomTreeNode *>
|
| /freebsd/contrib/llvm-project/clang/include/clang/Analysis/ |
| H A D | CallGraph.h | 243 template <> struct GraphTraits<clang::CallGraphNode*> {
253 template <> struct GraphTraits<const clang::CallGraphNode*> {
263 template <> struct GraphTraits<clang::CallGraph*>
264 : public GraphTraits<clang::CallGraphNode*> {
289 template <> struct GraphTraits<const clang::CallGraph*> :
290 public GraphTraits<const clang::CallGraphNode*> {
|
| H A D | CFG.h | 1481 template <> struct GraphTraits< ::clang::CFGBlock *> {
1490 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1499 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1511 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock *>> {
1525 template <> struct GraphTraits< ::clang::CFG* >
1526 : public GraphTraits< ::clang::CFGBlock *> {
1535 template <> struct GraphTraits<const ::clang::CFG* >
1536 : public GraphTraits<const ::clang::CFGBlock *> {
1554 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1555 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
[all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/AST/ |
| H A D | StmtGraphTraits.h | 23 template <> struct GraphTraits<clang::Stmt *> {
49 template <> struct GraphTraits<const clang::Stmt *> {
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | ProfiledCallGraph.h | 12 #include "llvm/ADT/GraphTraits.h"
217 template <> struct GraphTraits<ProfiledCallGraphNode *> {
229 struct GraphTraits<ProfiledCallGraph *>
230 : public GraphTraits<ProfiledCallGraphNode *> {
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CallPrinter.cpp | 32 template <class GraphType> struct GraphTraits;
117 struct GraphTraits<CallGraphDOTInfo *> struct
118 : public GraphTraits<const CallGraphNode *> {
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericIteratedDominanceFrontier.h | 40 using NodeRef = typename GraphTraits<NodeTy *>::NodeRef;
41 using ChildIteratorType = typename GraphTraits<NodeTy *>::ChildIteratorType;
|