Home
last modified time | relevance | path

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

123

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
122 return make_range(GraphTraits<GraphType>::child_begin(G),
123 GraphTraits<GraphType>::child_end(G));
136 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
H A DPostOrderIterator.h93 class SetType = SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
94 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
193 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
215 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>,
238 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
289 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 = std::set<typename GraphTraits<T>::NodeRef>>
259 df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
283 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
H A DBreadthFirstIterator.h45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
46 class GT = GraphTraits<GraphT>>
/freebsd-13.1/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.h420 template <> struct GraphTraits<CallGraphNode *> {
439 template <> struct GraphTraits<const CallGraphNode *> {
468 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
494 struct GraphTraits<const CallGraph *> : public GraphTraits<
H A DLoopInfoImpl.h179 typedef GraphTraits<BlockT *> BlockTraits; in getLoopPreheader()
307 assert(std::any_of(GraphTraits<BlockT *>::child_begin(BB), in verifyLoop()
308 GraphTraits<BlockT *>::child_end(BB), in verifyLoop()
312 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
313 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
318 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
319 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
431 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
486 typedef GraphTraits<BlockT *> BlockTraits;
H A DPostDominators.h98 template <> struct GraphTraits<PostDominatorTree*>
99 : public GraphTraits<DomTreeNode*> {
H A DInterval.h116 template <> struct GraphTraits<Interval*> {
127 template <> struct GraphTraits<Inverse<Interval*>> {
H A DDDG.h497 template <> struct GraphTraits<DDGNode *> {
525 struct GraphTraits<DataDependenceGraph *> : public GraphTraits<DDGNode *> {
537 template <> struct GraphTraits<const DDGNode *> {
565 struct GraphTraits<const DataDependenceGraph *>
566 : 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 *>>;
H A DDominanceFrontier.h46 using BlockTraits = GraphTraits<BlockT *>;
124 using BlockTraits = GraphTraits<BlockT *>;
H A DIntervalIterator.h87 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy *>,
88 class IGT = GraphTraits<Inverse<NodeTy *>>>
/freebsd-13.1/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.h258 template <class T> struct GraphTraits;
261 struct GraphTraits<MachineDomTreeNode *>
267 struct GraphTraits<const MachineDomTreeNode *>
272 template <> struct GraphTraits<MachineDominatorTree*>
273 : public GraphTraits<MachineDomTreeNode *> {
H A DMachineFunction.h1225 template <> struct GraphTraits<MachineFunction*> :
1226 public GraphTraits<MachineBasicBlock*> {
1242 template <> struct GraphTraits<const MachineFunction*> :
1243 public GraphTraits<const MachineBasicBlock*> {
1267 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1268 public GraphTraits<Inverse<MachineBasicBlock*>> {
1273 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1274 public GraphTraits<Inverse<const MachineBasicBlock*>> {
H A DMachineLoopInfo.h185 template <> struct GraphTraits<const MachineLoop*> {
194 template <> struct GraphTraits<MachineLoop*> {
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h301 template <> struct GraphTraits<BasicBlock*> {
310 template <> struct GraphTraits<const BasicBlock*> {
325 template <> struct GraphTraits<Inverse<BasicBlock*>> {
334 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
351 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
367 template <> struct GraphTraits<const Function*> :
368 public GraphTraits<const BasicBlock*> {
390 template <> struct GraphTraits<Inverse<Function*>> :
391 public GraphTraits<Inverse<BasicBlock*>> {
396 template <> struct GraphTraits<Inverse<const Function*>> :
[all …]
H A DDominators.h229 struct GraphTraits<DomTreeNode *>
234 struct GraphTraits<const DomTreeNode *>
238 template <> struct GraphTraits<DominatorTree*>
239 : public GraphTraits<DomTreeNode*> {
/freebsd-13.1/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.h1483 template <> struct GraphTraits< ::clang::CFGBlock *> {
1492 template <> struct GraphTraits<clang::CFGBlock>
1493 : GraphTraits<clang::CFGBlock *> {};
1504 template <> struct GraphTraits<const clang::CFGBlock>
1505 : GraphTraits<clang::CFGBlock *> {};
1520 : GraphTraits<clang::CFGBlock *> {};
1535 : GraphTraits<clang::CFGBlock *> {};
1539 template <> struct GraphTraits< ::clang::CFG* >
1540 : public GraphTraits< ::clang::CFGBlock *> {
1549 template <> struct GraphTraits<const ::clang::CFG* >
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanDominatorTree.h32 struct GraphTraits<VPDomTreeNode *>
37 struct GraphTraits<const VPDomTreeNode *>
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h129 template <> struct GraphTraits<ProfiledCallGraphNode *> {
139 struct GraphTraits<ProfiledCallGraph *>
140 : public GraphTraits<ProfiledCallGraphNode *> {
/freebsd-13.1/contrib/llvm-project/clang/include/clang/AST/
H A DStmtGraphTraits.h23 template <> struct GraphTraits<clang::Stmt *> {
49 template <> struct GraphTraits<const clang::Stmt *> {
/freebsd-13.1/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 *> {

123