Home
last modified time | relevance | path

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

12345678

/external/llvm-project/llvm/include/llvm/ADT/
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));
113 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
115 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
116 GraphTraits<Inverse<GraphType>>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
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));
113 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
115 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
116 GraphTraits<Inverse<GraphType>>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
[all …]
/external/llvm/include/llvm/ADT/
DGraphTraits.h27 struct GraphTraits { struct
87 struct GraphTraits<Inverse<Inverse<T> > > {
88 typedef typename GraphTraits<T>::NodeType NodeType;
89 typedef typename GraphTraits<T>::ChildIteratorType ChildIteratorType;
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
96 return GraphTraits<T>::child_begin(N);
100 return GraphTraits<T>::child_end(N);
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DRegionIterator.h42 using BlockTraits = GraphTraits<BlockT *>;
169 using BlockTraits = GraphTraits<BlockT *>;
259 template <> struct GraphTraits<NodeT *> { \
270 template <> struct GraphTraits<FlatIt<NodeT *>> { \
284 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
297 struct GraphTraits<FlatIt<RegionT *>> \
298 : public GraphTraits<FlatIt<NodeT *>> { \
301 GraphTraits<FlatIt<NodeRef>>>; \
319 template <> struct GraphTraits<RegionInfo*>
320 : public GraphTraits<FlatIt<RegionNode*>> {
[all …]
/external/llvm-project/llvm/include/llvm/Analysis/
DRegionIterator.h42 using BlockTraits = GraphTraits<BlockT *>;
169 using BlockTraits = GraphTraits<BlockT *>;
259 template <> struct GraphTraits<NodeT *> { \
270 template <> struct GraphTraits<FlatIt<NodeT *>> { \
284 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
297 struct GraphTraits<FlatIt<RegionT *>> \
298 : public GraphTraits<FlatIt<NodeT *>> { \
301 GraphTraits<FlatIt<NodeRef>>>; \
319 template <> struct GraphTraits<RegionInfo*>
320 : public GraphTraits<FlatIt<RegionNode*>> {
[all …]
/external/llvm/include/llvm/Analysis/
DRegionIterator.h38 typedef GraphTraits<BlockT*> BlockTraits;
161 typedef GraphTraits<BlockT*> BlockTraits;
253 template<> struct GraphTraits<NodeT*> { \
264 template<> struct GraphTraits<FlatIt<NodeT*>> { \
277 template<> struct GraphTraits<RegionT*> \
278 : public GraphTraits<NodeT*> { \
290 template<> struct GraphTraits<FlatIt<RegionT*> > \
291 : public GraphTraits<FlatIt<NodeT*> > { \
293 GraphTraits<FlatIt<NodeType*> > > nodes_iterator; \
311 template <> struct GraphTraits<RegionInfo*>
[all …]
DLoopInfoImpl.h36 typedef GraphTraits<BlockT*> BlockTraits; in getExitingBlocks()
65 typedef GraphTraits<BlockT*> BlockTraits; in getExitBlocks()
90 typedef GraphTraits<BlockT*> BlockTraits; in getExitEdges()
114 typedef GraphTraits<BlockT*> BlockTraits; in getLoopPreheader()
136 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopPredecessor()
158 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopLatch()
247 typedef GraphTraits<BlockT*> BlockTraits; in verifyLoop()
255 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in verifyLoop()
349 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in discoverAndMapSubloop()
408 typedef GraphTraits<BlockT*> BlockTraits;
[all …]
/external/llvm/include/llvm/CodeGen/
DMachineRegionInfo.h143 template <> struct GraphTraits<MachineRegionInfo*>
144 : public GraphTraits<FlatIt<MachineRegionNode*> > {
146 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
149 return GraphTraits<FlatIt<MachineRegion*> >::getEntryNode(RI->getTopLevelRegion());
159 template <> struct GraphTraits<MachineRegionInfoPass*>
160 : public GraphTraits<MachineRegionInfo *> {
162 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
165 return GraphTraits<MachineRegionInfo*>::getEntryNode(&RI->getRegionInfo());
168 return GraphTraits<MachineRegionInfo*>::nodes_begin(&RI->getRegionInfo());
171 return GraphTraits<MachineRegionInfo*>::nodes_end(&RI->getRegionInfo());
DMachineDominators.h284 template <class T> struct GraphTraits;
287 struct GraphTraits<MachineDomTreeNode *>
292 struct GraphTraits<const MachineDomTreeNode *>
297 template <> struct GraphTraits<MachineDominatorTree*>
298 : public GraphTraits<MachineDomTreeNode *> {
DMachineFunction.h614 template <> struct GraphTraits<MachineFunction*> :
615 public GraphTraits<MachineBasicBlock*> {
626 template <> struct GraphTraits<const MachineFunction*> :
627 public GraphTraits<const MachineBasicBlock*> {
651 template <> struct GraphTraits<Inverse<MachineFunction*> > :
652 public GraphTraits<Inverse<MachineBasicBlock*> > {
657 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
658 public GraphTraits<Inverse<const MachineBasicBlock*> > {
/external/llvm-project/llvm/include/llvm/CodeGen/
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());
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 *> {
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
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());
DMachineDominators.h268 template <class T> struct GraphTraits;
271 struct GraphTraits<MachineDomTreeNode *>
276 struct GraphTraits<const MachineDomTreeNode *>
281 template <> struct GraphTraits<MachineDominatorTree*>
282 : public GraphTraits<MachineDomTreeNode *> {
/external/llvm/unittests/Analysis/
DCallGraphTest.cpp20 typedef typename GraphTraits<Ty *>::NodeType NodeTy; in canSpecializeGraphTraitsIterators()
22 auto I = GraphTraits<Ty *>::nodes_begin(G); in canSpecializeGraphTraitsIterators()
23 auto E = GraphTraits<Ty *>::nodes_end(G); in canSpecializeGraphTraitsIterators()
34 NodeTy *N = GraphTraits<Ty *>::getEntryNode(G); in canSpecializeGraphTraitsIterators()
36 auto S = GraphTraits<NodeTy *>::child_begin(N); in canSpecializeGraphTraitsIterators()
37 auto F = GraphTraits<NodeTy *>::child_end(N); in canSpecializeGraphTraitsIterators()
/external/llvm-project/llvm/unittests/Analysis/
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()
/external/llvm/include/llvm/IR/
DCFG.h156 template <> struct GraphTraits<BasicBlock*> {
169 template <> struct GraphTraits<const BasicBlock*> {
188 template <> struct GraphTraits<Inverse<BasicBlock*> > {
200 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
224 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
233 template <> struct GraphTraits<const Function*> :
234 public GraphTraits<const BasicBlock*> {
250 template <> struct GraphTraits<Inverse<Function*> > :
251 public GraphTraits<Inverse<BasicBlock*> > {
256 template <> struct GraphTraits<Inverse<const Function*> > :
[all …]
DDominators.h36 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT, Function &F);
38 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
178 struct GraphTraits<DomTreeNode *>
182 struct GraphTraits<const DomTreeNode *>
186 template <> struct GraphTraits<DominatorTree*>
187 : public GraphTraits<DomTreeNode*> {
/external/llvm-project/mlir/include/mlir/IR/
DRegionGraphTraits.h22 template <> struct GraphTraits<mlir::Block *> {
35 template <> struct GraphTraits<Inverse<mlir::Block *>> {
51 struct GraphTraits<mlir::Region *> : public GraphTraits<mlir::Block *> {
67 struct GraphTraits<Inverse<mlir::Region *>>
68 : public GraphTraits<Inverse<mlir::Block *>> {
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DCFG.h298 template <> struct GraphTraits<BasicBlock*> {
307 template <> struct GraphTraits<const BasicBlock*> {
322 template <> struct GraphTraits<Inverse<BasicBlock*>> {
331 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
348 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
364 template <> struct GraphTraits<const Function*> :
365 public GraphTraits<const BasicBlock*> {
387 template <> struct GraphTraits<Inverse<Function*>> :
388 public GraphTraits<Inverse<BasicBlock*>> {
393 template <> struct GraphTraits<Inverse<const Function*>> :
[all …]
/external/llvm-project/llvm/include/llvm/IR/
DCFG.h299 template <> struct GraphTraits<BasicBlock*> {
308 template <> struct GraphTraits<const BasicBlock*> {
323 template <> struct GraphTraits<Inverse<BasicBlock*>> {
332 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
349 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
365 template <> struct GraphTraits<const Function*> :
366 public GraphTraits<const BasicBlock*> {
388 template <> struct GraphTraits<Inverse<Function*>> :
389 public GraphTraits<Inverse<BasicBlock*>> {
394 template <> struct GraphTraits<Inverse<const Function*>> :
[all …]
/external/llvm-project/polly/lib/Analysis/
DScopGraphPrinter.cpp37 struct GraphTraits<ScopDetection *> : public GraphTraits<RegionInfo *> { struct
39 return GraphTraits<RegionInfo *>::getEntryNode(SD->getRI()); in getEntryNode()
50 struct GraphTraits<ScopDetectionWrapperPass *> struct
51 : public GraphTraits<ScopDetection *> {
53 return GraphTraits<ScopDetection *>::getEntryNode(&P->getSD()); in getEntryNode()
91 GraphTraits<RegionInfo *>::ChildIteratorType CI, in getEdgeAttributes()
/external/clang/include/clang/Analysis/
DCallGraph.h173 template <> struct GraphTraits<clang::CallGraphNode*> {
191 template <> struct GraphTraits<const clang::CallGraphNode*> {
199 template <> struct GraphTraits<clang::CallGraph*>
200 : public GraphTraits<clang::CallGraphNode*> {
225 template <> struct GraphTraits<const clang::CallGraph*> :
226 public GraphTraits<const clang::CallGraphNode*> {
/external/llvm-project/clang/include/clang/Analysis/
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*> {
/external/llvm-project/llvm/lib/Transforms/Vectorize/
DVPlanDominatorTree.h32 struct GraphTraits<VPDomTreeNode *>
37 struct GraphTraits<const VPDomTreeNode *>

12345678