Home
last modified time | relevance | path

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

123

/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DGraphTraits.h36 struct GraphTraits { struct
104 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
108 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
110 return make_range(GraphTraits<GraphType>::nodes_begin(G),
111 GraphTraits<GraphType>::nodes_end(G));
121 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
122 children(const typename GraphTraits<GraphType>::NodeRef &G) {
123 return make_range(GraphTraits<GraphType>::child_begin(G),
124 GraphTraits<GraphType>::child_end(G));
137 return make_range(GraphTraits<GraphType>::child_edge_begin(G),
[all …]
H A DPostOrderIterator.h94 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
191 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
213 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>,
236 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
287 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>>
233 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
258 df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
282 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
H A DBreadthFirstIterator.h46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DRegionIterator.h43 using BlockTraits = GraphTraits<BlockT *>;
170 using BlockTraits = GraphTraits<BlockT *>;
285 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
320 template <> struct GraphTraits<RegionInfo*>
321 : public GraphTraits<FlatIt<RegionNode*>> {
324 GraphTraits<FlatIt<NodeRef>>>;
339 template <> struct GraphTraits<RegionInfoPass*>
340 : public GraphTraits<RegionInfo *> {
343 GraphTraits<FlatIt<NodeRef>>>;
350 return GraphTraits<RegionInfo*>::nodes_begin(&RI->getRegionInfo());
[all …]
H A DLoopInfoImpl.h102 typedef GraphTraits<BlockT *> BlockTraits; in getUniqueExitBlocks()
103 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in getUniqueExitBlocks()
186 typedef GraphTraits<BlockT *> BlockTraits; in getLoopPreheader()
316 assert(std::any_of(GraphTraits<BlockT *>::child_begin(BB), in verifyLoop()
317 GraphTraits<BlockT *>::child_end(BB), in verifyLoop()
321 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
322 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
327 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
328 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
437 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
[all …]
H A DCallGraph.h407 template <> struct GraphTraits<CallGraphNode *> {
426 template <> struct GraphTraits<const CallGraphNode *> {
455 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
481 struct GraphTraits<const CallGraph *> : public GraphTraits<
H A DPostDominators.h96 template <> struct GraphTraits<PostDominatorTree*>
97 : public GraphTraits<DomTreeNode*> {
H A DInterval.h120 template <> struct GraphTraits<Interval*> {
131 template <> struct GraphTraits<Inverse<Interval*>> {
H A DRegionInfo.h269 using BlockTraits = GraphTraits<BlockT *>;
270 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
645 GraphTraits<RegionNodeT *>>;
650 GraphTraits<const RegionNodeT *>>;
689 using BlockTraits = GraphTraits<BlockT *>;
690 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
H A DDominanceFrontier.h48 using BlockTraits = GraphTraits<BlockT *>;
126 using BlockTraits = GraphTraits<BlockT *>;
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h138 struct GraphTraits<MachineRegionInfo *>
139 : public GraphTraits<FlatIt<MachineRegionNode *>> {
141 false, GraphTraits<FlatIt<NodeRef>>>;
144 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(
158 struct GraphTraits<MachineRegionInfoPass *>
159 : public GraphTraits<MachineRegionInfo *> {
161 false, GraphTraits<FlatIt<NodeRef>>>;
164 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
168 return GraphTraits<MachineRegionInfo *>::nodes_begin(&RI->getRegionInfo());
172 return GraphTraits<MachineRegionInfo *>::nodes_end(&RI->getRegionInfo());
H A DMachineDominators.h269 template <class T> struct GraphTraits;
272 struct GraphTraits<MachineDomTreeNode *>
277 struct GraphTraits<const MachineDomTreeNode *>
282 template <> struct GraphTraits<MachineDominatorTree*>
283 : public GraphTraits<MachineDomTreeNode *> {
H A DMachineFunction.h954 template <> struct GraphTraits<MachineFunction*> :
955 public GraphTraits<MachineBasicBlock*> {
971 template <> struct GraphTraits<const MachineFunction*> :
972 public GraphTraits<const MachineBasicBlock*> {
996 template <> struct GraphTraits<Inverse<MachineFunction*>> :
997 public GraphTraits<Inverse<MachineBasicBlock*>> {
1002 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1003 public GraphTraits<Inverse<const MachineBasicBlock*>> {
H A DMachineLoopInfo.h173 template <> struct GraphTraits<const MachineLoop*> {
182 template <> struct GraphTraits<MachineLoop*> {
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFG.h303 template <> struct GraphTraits<BasicBlock*> {
312 template <> struct GraphTraits<const BasicBlock*> {
327 template <> struct GraphTraits<Inverse<BasicBlock*>> {
336 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
353 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
369 template <> struct GraphTraits<const Function*> :
370 public GraphTraits<const BasicBlock*> {
392 template <> struct GraphTraits<Inverse<Function*>> :
393 public GraphTraits<Inverse<BasicBlock*>> {
398 template <> struct GraphTraits<Inverse<const Function*>> :
[all …]
H A DDominators.h209 struct GraphTraits<DomTreeNode *>
213 struct GraphTraits<const DomTreeNode *>
217 template <> struct GraphTraits<DominatorTree*>
218 : public GraphTraits<DomTreeNode*> {
H A DCFGDiff.h268 struct GraphTraits<
272 struct GraphTraits<
276 struct GraphTraits<
280 struct GraphTraits<
H A DType.h31 template<class GraphType> struct GraphTraits;
474 template <> struct GraphTraits<Type *> {
483 template <> struct GraphTraits<const Type*> {
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCallGraph.h185 template <> struct GraphTraits<clang::CallGraphNode*> {
195 template <> struct GraphTraits<const clang::CallGraphNode*> {
205 template <> struct GraphTraits<clang::CallGraph*>
206 : public GraphTraits<clang::CallGraphNode*> {
231 template <> struct GraphTraits<const clang::CallGraph*> :
232 public GraphTraits<const clang::CallGraphNode*> {
H A DCFG.h1240 template <> struct GraphTraits< ::clang::CFGBlock *> {
1249 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1258 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1284 template <> struct GraphTraits< ::clang::CFG* >
1285 : public GraphTraits< ::clang::CFGBlock *> {
1294 template <> struct GraphTraits<const ::clang::CFG* >
1295 : public GraphTraits<const ::clang::CFGBlock *> {
1313 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1314 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1322 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlanDominatorTree.h33 struct GraphTraits<VPDomTreeNode *>
37 struct GraphTraits<const VPDomTreeNode *>
H A DVPlan.h1318 template <> struct GraphTraits<VPBlockBase *> {
1333 template <> struct GraphTraits<const VPBlockBase *> {
1350 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
1373 struct GraphTraits<VPRegionBlock *> : public GraphTraits<VPBlockBase *> {
1391 struct GraphTraits<const VPRegionBlock *>
1392 : public GraphTraits<const VPBlockBase *> {
1410 struct GraphTraits<Inverse<VPRegionBlock *>>
1411 : public GraphTraits<Inverse<VPBlockBase *>> {
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DDominators.h165 template <> struct GraphTraits< ::clang::DomTreeNode* > {
185 template <> struct GraphTraits< ::clang::DominatorTree* >
186 : public GraphTraits< ::clang::DomTreeNode* > {
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/
H A DStmtGraphTraits.h24 template <> struct GraphTraits<clang::Stmt *> {
50 template <> struct GraphTraits<const clang::Stmt *> {

123