Home
last modified time | relevance | path

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

1234

/llvm-project-15.0.7/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>>
194 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
216 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>,
239 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
290 template<class GraphT, class GT = GraphTraits<GraphT>>
H A DDepthFirstIterator.h84 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
85 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
235 template <class T, class SetTy = df_iterator_default_set<typename GraphTraits<T>::NodeRef>>
260 df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
284 template <class T, class SetTy = df_iterator_default_set<typename GraphTraits<T>::NodeRef>>
/llvm-project-15.0.7/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;
419 template <> struct GraphTraits<CallGraphNode *> {
438 template <> struct GraphTraits<const CallGraphNode *> {
467 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
493 struct GraphTraits<const CallGraph *> : public GraphTraits<
H A DLoopInfoImpl.h178 typedef GraphTraits<BlockT *> BlockTraits; in getLoopPreheader()
306 assert(std::any_of(GraphTraits<BlockT *>::child_begin(BB), in verifyLoop()
307 GraphTraits<BlockT *>::child_end(BB), in verifyLoop()
311 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
312 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
318 llvm::make_range(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
319 GraphTraits<Inverse<BlockT *>>::child_end(BB))) in verifyLoop()
429 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
483 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.h486 template <> struct GraphTraits<DDGNode *> {
514 struct GraphTraits<DataDependenceGraph *> : public GraphTraits<DDGNode *> {
526 template <> struct GraphTraits<const DDGNode *> {
554 struct GraphTraits<const DataDependenceGraph *>
555 : public GraphTraits<const DDGNode *> {
/llvm-project-15.0.7/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 DMachineFunction.h1280 template <> struct GraphTraits<MachineFunction*> :
1281 public GraphTraits<MachineBasicBlock*> {
1297 template <> struct GraphTraits<const MachineFunction*> :
1298 public GraphTraits<const MachineBasicBlock*> {
1322 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1323 public GraphTraits<Inverse<MachineBasicBlock*>> {
1328 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1329 public GraphTraits<Inverse<const MachineBasicBlock*>> {
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DCallGraphTest.cpp19 typedef typename GraphTraits<Ty *>::NodeRef NodeRef; in canSpecializeGraphTraitsIterators()
21 auto I = GraphTraits<Ty *>::nodes_begin(G); in canSpecializeGraphTraitsIterators()
22 auto E = GraphTraits<Ty *>::nodes_end(G); in canSpecializeGraphTraitsIterators()
33 NodeRef N = GraphTraits<Ty *>::getEntryNode(G); in canSpecializeGraphTraitsIterators()
35 auto S = GraphTraits<NodeRef>::child_begin(N); in canSpecializeGraphTraitsIterators()
36 auto F = GraphTraits<NodeRef>::child_end(N); in canSpecializeGraphTraitsIterators()
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DRegionGraphTraits.h23 struct GraphTraits<mlir::Block *> {
37 struct GraphTraits<Inverse<mlir::Block *>> {
53 struct GraphTraits<mlir::Region *> : public GraphTraits<mlir::Block *> {
69 struct GraphTraits<Inverse<mlir::Region *>>
70 : public GraphTraits<Inverse<mlir::Block *>> {
/llvm-project-15.0.7/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.h48 template <class GraphType> struct GraphTraits;
244 struct GraphTraits<DomTreeNode *>
249 struct GraphTraits<const DomTreeNode *>
253 template <> struct GraphTraits<DominatorTree*>
254 : public GraphTraits<DomTreeNode*> {
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DBinaryDomTree.h30 struct GraphTraits<bolt::BinaryDomTreeNode *>
35 struct GraphTraits<const bolt::BinaryDomTreeNode *>
40 struct GraphTraits<bolt::BinaryDominatorTree *>
41 : public GraphTraits<bolt::BinaryDomTreeNode *> {
/llvm-project-15.0.7/polly/include/polly/
H A DScopGraphPrinter.h30 struct GraphTraits<polly::ScopDetection *> : GraphTraits<RegionInfo *> {
32 return GraphTraits<RegionInfo *>::getEntryNode(SD->getRI());
51 GraphTraits<RegionInfo *>::ChildIteratorType CI,
/llvm-project-15.0.7/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.h1489 template <> struct GraphTraits< ::clang::CFGBlock *> {
1498 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1507 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1533 template <> struct GraphTraits< ::clang::CFG* >
1534 : public GraphTraits< ::clang::CFGBlock *> {
1543 template <> struct GraphTraits<const ::clang::CFG* >
1544 : public GraphTraits<const ::clang::CFGBlock *> {
1562 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1563 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1571 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlanDominatorTree.h32 struct GraphTraits<VPDomTreeNode *>
37 struct GraphTraits<const VPDomTreeNode *>
/llvm-project-15.0.7/clang/include/clang/AST/
H A DStmtGraphTraits.h23 template <> struct GraphTraits<clang::Stmt *> {
49 template <> struct GraphTraits<const clang::Stmt *> {
/llvm-project-15.0.7/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 *> {
/llvm-project-15.0.7/mlir/include/mlir/Analysis/
H A DCallGraph.h225 struct GraphTraits<const mlir::CallGraphNode *> {
245 struct GraphTraits<const mlir::CallGraph *>
246 : public GraphTraits<const mlir::CallGraphNode *> {
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h184 template <> struct GraphTraits<ProfiledCallGraphNode *> {
196 struct GraphTraits<ProfiledCallGraph *>
197 : public GraphTraits<ProfiledCallGraphNode *> {

1234