Home
last modified time | relevance | path

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

1234

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h38 struct GraphTraits { struct
100 using has_number_t = decltype(GraphTraits<T>::getNumber( argument
101 std::declval<typename GraphTraits<T>::NodeRef>()));
131 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
135 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
137 return make_range(GraphTraits<GraphType>::nodes_begin(G),
138 GraphTraits<GraphType>::nodes_end(G));
141 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
143 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
144 GraphTraits<Inverse<GraphType>>::nodes_end(G));
[all …]
H A DPostOrderIterator.h95 class SetType = SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
96 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
202 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
224 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>,
247 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
298 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>>
238 template <class T, class SetTy = df_iterator_default_set<typename GraphTraits<T>::NodeRef>>
263 df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
287 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/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionIterator.h47 using BlockTraits = GraphTraits<BlockT *>;
171 using BlockTraits = GraphTraits<BlockT *>;
266 template <> struct GraphTraits<NodeT *> { \
277 template <> struct GraphTraits<FlatIt<NodeT *>> { \
291 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
304 struct GraphTraits<FlatIt<RegionT *>> \
305 : public GraphTraits<FlatIt<NodeT *>> { \
308 GraphTraits<FlatIt<NodeRef>>>; \
326 template <> struct GraphTraits<RegionInfo*>
327 : public GraphTraits<FlatIt<RegionNode*>> {
[all …]
H A DCallGraph.h61 template <class GraphType> struct GraphTraits;
416 template <> struct GraphTraits<CallGraphNode *> {
435 template <> struct GraphTraits<const CallGraphNode *> {
464 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
490 struct GraphTraits<const CallGraph *> : public GraphTraits<
H A DPostDominators.h101 template <> struct GraphTraits<PostDominatorTree*>
102 : public GraphTraits<DomTreeNode*> {
H A DDDG.h491 template <> struct GraphTraits<DDGNode *> {
519 struct GraphTraits<DataDependenceGraph *> : public GraphTraits<DDGNode *> {
531 template <> struct GraphTraits<const DDGNode *> {
559 struct GraphTraits<const DataDependenceGraph *>
560 : public GraphTraits<const DDGNode *> {
H A DRegionInfo.h265 using BlockTraits = GraphTraits<BlockT *>;
266 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
640 GraphTraits<RegionNodeT *>>;
645 GraphTraits<const RegionNodeT *>>;
684 using BlockTraits = GraphTraits<BlockT *>;
685 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
H A DDominanceFrontier.h48 using BlockTraits = GraphTraits<BlockT *>;
106 using BlockTraits = GraphTraits<BlockT *>;
H A DCFGPrinter.h37 template <class GraphType> struct GraphTraits;
108 struct GraphTraits<DOTFuncInfo *> : public GraphTraits<const BasicBlock *> {
/freebsd/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.h169 template <class T> struct GraphTraits;
172 struct GraphTraits<MachineDomTreeNode *>
178 struct GraphTraits<const MachineDomTreeNode *>
183 template <> struct GraphTraits<MachineDominatorTree*>
184 : public GraphTraits<MachineDomTreeNode *> {
H A DMachineCFGPrinter.h19 template <class GraphType> struct GraphTraits;
31 struct GraphTraits<DOTMachineFuncInfo *>
32 : public GraphTraits<const MachineBasicBlock *> {
H A DMachineLoopInfo.h178 template <> struct GraphTraits<const MachineLoop*> {
187 template <> struct GraphTraits<MachineLoop*> {
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h301 template <> struct GraphTraits<BasicBlock*> {
315 template <> struct GraphTraits<const BasicBlock*> {
335 template <> struct GraphTraits<Inverse<BasicBlock*>> {
349 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
371 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
394 template <> struct GraphTraits<const Function*> :
395 public GraphTraits<const BasicBlock*> {
424 template <> struct GraphTraits<Inverse<Function*>> :
425 public GraphTraits<Inverse<BasicBlock*>> {
437 template <> struct GraphTraits<Inverse<const Function*>> :
[all …]
H A DDominators.h45 template <class GraphType> struct GraphTraits;
261 struct GraphTraits<DomTreeNode *>
266 struct GraphTraits<const DomTreeNode *>
270 template <> struct GraphTraits<DominatorTree*>
271 : public GraphTraits<DomTreeNode*> {
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h130 template <> struct GraphTraits<VPBlockDeepTraversalWrapper<VPBlockBase *>> {
148 struct GraphTraits<VPBlockDeepTraversalWrapper<const VPBlockBase *>> {
176 template <> struct GraphTraits<VPBlockShallowTraversalWrapper<VPBlockBase *>> {
194 struct GraphTraits<VPBlockShallowTraversalWrapper<const VPBlockBase *>> {
251 template <> struct GraphTraits<VPBlockBase *> {
266 template <> struct GraphTraits<const VPBlockBase *> {
284 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
301 template <> struct GraphTraits<VPlan *> {
H A DVPlanDominatorTree.h54 struct GraphTraits<VPDomTreeNode *>
59 struct GraphTraits<const VPDomTreeNode *>
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h240 template <> struct GraphTraits<clang::CallGraphNode*> {
250 template <> struct GraphTraits<const clang::CallGraphNode*> {
260 template <> struct GraphTraits<clang::CallGraph*>
261 : public GraphTraits<clang::CallGraphNode*> {
286 template <> struct GraphTraits<const clang::CallGraph*> :
287 public GraphTraits<const clang::CallGraphNode*> {
H A DCFG.h1488 template <> struct GraphTraits< ::clang::CFGBlock *> {
1497 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1506 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1518 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock *>> {
1532 template <> struct GraphTraits< ::clang::CFG* >
1533 : public GraphTraits< ::clang::CFGBlock *> {
1542 template <> struct GraphTraits<const ::clang::CFG* >
1543 : public GraphTraits<const ::clang::CFGBlock *> {
1561 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1562 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DStmtGraphTraits.h23 template <> struct GraphTraits<clang::Stmt *> {
49 template <> struct GraphTraits<const clang::Stmt *> {
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h216 template <> struct GraphTraits<ProfiledCallGraphNode *> {
228 struct GraphTraits<ProfiledCallGraph *>
229 : public GraphTraits<ProfiledCallGraphNode *> {
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h239 static_assert(std::is_pointer_v<typename GraphTraits<NodeT *>::NodeRef>,
367 GraphTraits<ParentPtr>::getNumberEpoch(Parent) &&
369 return BB ? GraphTraits<const NodeT *>::getNumber(BB) + 1 : 0;
382 unsigned Max = GraphTraits<ParentPtr>::getMaxNumber(Parent);
854 BlockNumberEpoch = GraphTraits<ParentPtr>::getNumberEpoch(Parent);
876 unsigned MaxNumber = GraphTraits<ParentPtr>::getMaxNumber(Parent);
937 void Split(typename GraphTraits<N>::NodeRef NewBB) {
938 using GraphT = GraphTraits<N>;
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCallPrinter.cpp32 template <class GraphType> struct GraphTraits;
117 struct GraphTraits<CallGraphDOTInfo *> struct
118 : public GraphTraits<const CallGraphNode *> {

1234