Home
last modified time | relevance | path

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

1234

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h37 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));
122 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
123 children(const typename GraphTraits<GraphType>::NodeRef &G) {
124 return make_range(GraphTraits<GraphType>::child_begin(G),
125 GraphTraits<GraphType>::child_end(G));
138 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
H A DPostOrderIterator.h94 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 DDepthFirstIterator.h83 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 DBreadthFirstIterator.h45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
46 class GT = GraphTraits<GraphT>>
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionIterator.h47 using BlockTraits = GraphTraits<BlockT *>;
171 using BlockTraits = GraphTraits<BlockT *>;
291 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
326 template <> struct GraphTraits<RegionInfo*>
327 : public GraphTraits<FlatIt<RegionNode*>> {
330 GraphTraits<FlatIt<NodeRef>>>;
345 template <> struct GraphTraits<RegionInfoPass*>
346 : public GraphTraits<RegionInfo *> {
349 GraphTraits<FlatIt<NodeRef>>>;
356 return GraphTraits<RegionInfo*>::nodes_begin(&RI->getRegionInfo());
[all …]
H A DCallGraph.h61 template <class GraphType> struct GraphTraits;
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 DPostDominators.h100 template <> struct GraphTraits<PostDominatorTree*>
101 : public GraphTraits<DomTreeNode*> {
H A DInterval.h116 template <> struct GraphTraits<Interval*> {
127 template <> struct GraphTraits<Inverse<Interval*>> {
H A DDDG.h487 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 DRegionInfo.h267 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 *>>;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h137 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 DMachineDominators.h269 template <class T> struct GraphTraits;
272 struct GraphTraits<MachineDomTreeNode *>
278 struct GraphTraits<const MachineDomTreeNode *>
283 template <> struct GraphTraits<MachineDominatorTree*>
284 : public GraphTraits<MachineDomTreeNode *> {
H A DMachineCFGPrinter.h19 template <class GraphType> struct GraphTraits;
31 struct GraphTraits<DOTMachineFuncInfo *>
32 : public GraphTraits<const MachineBasicBlock *> {
H A DMachineLoopInfo.h193 template <> struct GraphTraits<const MachineLoop*> {
202 template <> struct GraphTraits<MachineLoop*> {
H A DMachineFunction.h1371 template <> struct GraphTraits<MachineFunction*> :
1372 public GraphTraits<MachineBasicBlock*> {
1388 template <> struct GraphTraits<const MachineFunction*> :
1389 public GraphTraits<const MachineBasicBlock*> {
1413 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1414 public GraphTraits<Inverse<MachineBasicBlock*>> {
1419 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1420 public GraphTraits<Inverse<const MachineBasicBlock*>> {
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h300 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 DDominators.h44 template <class GraphType> struct GraphTraits;
252 struct GraphTraits<DomTreeNode *>
257 struct GraphTraits<const DomTreeNode *>
261 template <> struct GraphTraits<DominatorTree*>
262 : public GraphTraits<DomTreeNode*> {
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h128 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 DVPlanDominatorTree.h44 struct GraphTraits<VPDomTreeNode *>
49 struct GraphTraits<const VPDomTreeNode *>
/freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h243 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 DCFG.h1478 template <> struct GraphTraits< ::clang::CFGBlock *> {
1487 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1496 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1522 template <> struct GraphTraits< ::clang::CFG* >
1523 : public GraphTraits< ::clang::CFGBlock *> {
1532 template <> struct GraphTraits<const ::clang::CFG* >
1533 : public GraphTraits<const ::clang::CFGBlock *> {
1551 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1552 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1560 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
[all …]
/freebsd-14.2/contrib/llvm-project/clang/include/clang/AST/
H A DStmtGraphTraits.h23 template <> struct GraphTraits<clang::Stmt *> {
49 template <> struct GraphTraits<const clang::Stmt *> {
/freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DDominators.h196 using NodeRef = typename GraphTraits<clang::CFGBlock *>::NodeRef;
280 template <> struct GraphTraits<clang::DomTreeNode *> {
300 template <> struct GraphTraits<clang::CFGDomTree *>
301 : public GraphTraits<clang::DomTreeNode *> {
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h217 template <> struct GraphTraits<ProfiledCallGraphNode *> {
229 struct GraphTraits<ProfiledCallGraph *>
230 : public GraphTraits<ProfiledCallGraphNode *> {
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DCallPrinter.cpp31 template <class GraphType> struct GraphTraits;
116 struct GraphTraits<CallGraphDOTInfo *> struct
117 : public GraphTraits<const CallGraphNode *> {

1234