Searched refs:GraphTraits (Results 1 - 25 of 66) sorted by relevance

123

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h1 //===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//
9 // This file defines the little GraphTraits<X> template class that should be
24 // GraphTraits - This class should be specialized by different graph types...
30 // GraphTraits can be used to create a view over a graph interpreting it
35 struct GraphTraits { struct in namespace:llvm
74 // need to include the appropriate specialization of GraphTraits<> for your
101 // Provide a partial specialization of GraphTraits so that the inverse of an
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {}; struct in namespace:llvm
107 iterator_range<typename GraphTraits<GraphTyp
[all...]
H A DPostOrderIterator.h9 // This file builds on the ADT/GraphTraits.h file to build a generic graph
11 // GraphTraits specialization.
18 #include "llvm/ADT/GraphTraits.h"
94 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.h9 // This file builds on the ADT/GraphTraits.h file to build generic depth
35 #include "llvm/ADT/GraphTraits.h"
83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
84 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
232 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
257 df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
281 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
H A DBreadthFirstIterator.h9 // This file builds on the ADT/GraphTraits.h file to build a generic breadth
20 #include "llvm/ADT/GraphTraits.h"
45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
46 class GT = GraphTraits<GraphT>>
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanDominatorTree.h19 #include "llvm/ADT/GraphTraits.h"
30 /// Template specializations of GraphTraits for VPDomTreeNode.
32 struct GraphTraits<VPDomTreeNode *> struct in namespace:llvm
37 struct GraphTraits<const VPDomTreeNode *> struct in namespace:llvm
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h137 struct GraphTraits<MachineRegionInfo *> struct in namespace:llvm
138 : public GraphTraits<FlatIt<MachineRegionNode *>> {
140 false, GraphTraits<FlatIt<NodeRef>>>;
143 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(
157 struct GraphTraits<MachineRegionInfoPass *> struct in namespace:llvm
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<MachineRegionInf
[all...]
H A DMachineDominators.h245 /// DominatorTree GraphTraits specialization so the DominatorTree can be
259 template <class T> struct GraphTraits;
262 struct GraphTraits<MachineDomTreeNode *> struct in namespace:llvm
268 struct GraphTraits<const MachineDomTreeNode *> struct in namespace:llvm
273 template <> struct GraphTraits<MachineDominatorTree*> struct in namespace:llvm
274 : public GraphTraits<MachineDomTreeNode *> {
H A DMachineLoopInfo.h176 template <> struct GraphTraits<const MachineLoop*> { struct in namespace:llvm
185 template <> struct GraphTraits<MachineLoop*> { struct in namespace:llvm
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionIterator.h15 #include "llvm/ADT/GraphTraits.h"
42 using BlockTraits = GraphTraits<BlockT *>;
169 using BlockTraits = GraphTraits<BlockT *>;
252 // RegionNode GraphTraits specialization so the bbs in the region can be
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<FlatI
319 template <> struct GraphTraits<RegionInfo*> struct in namespace:llvm
338 template <> struct GraphTraits<RegionInfoPass*> struct in namespace:llvm
[all...]
H A DSyntheticCountsUtils.h30 using CGT = GraphTraits<CallGraphType>;
H A DPostDominators.h98 template <> struct GraphTraits<PostDominatorTree*> struct in namespace:llvm
99 : public GraphTraits<DomTreeNode*> {
H A DInterval.h22 #include "llvm/ADT/GraphTraits.h"
119 template <> struct GraphTraits<Interval*> { struct in namespace:llvm
130 template <> struct GraphTraits<Inverse<Interval*>> { struct in namespace:llvm
H A DCallGraph.h48 #include "llvm/ADT/GraphTraits.h"
421 // GraphTraits specializations for call graphs so that they can be treated as
427 template <> struct GraphTraits<CallGraphNode *> { struct
446 template <> struct GraphTraits<const CallGraphNode *> { struct
475 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> { struct in inherits:GraphTraits
501 struct GraphTraits<const CallGraph *> : public GraphTraits< struct in inherits:GraphTraits
H A DDominanceFrontier.h20 #include "llvm/ADT/GraphTraits.h"
47 using BlockTraits = GraphTraits<BlockT *>;
125 using BlockTraits = GraphTraits<BlockT *>;
H A DCFG.h17 #include "llvm/ADT/GraphTraits.h"
123 /// 1) GraphTraits must be implemented for NodeT type. It is used to access
146 class GT = GraphTraits<NodeT>>
H A DDDG.h467 // GraphTraits specializations for the DDG
471 template <> struct GraphTraits<DDGNode *> { struct in class:llvm::DDGEdge
499 struct GraphTraits<DataDependenceGraph *> : public GraphTraits<DDGNode *> { struct in class:llvm::DDGEdge
511 template <> struct GraphTraits<const DDGNode *> { struct in class:llvm::DDGEdge
539 struct GraphTraits<const DataDependenceGraph *> struct in class:llvm::DDGEdge
540 : public GraphTraits<const DDGNode *> {
H A DRegionInfo.h41 #include "llvm/ADT/GraphTraits.h"
268 using BlockTraits = GraphTraits<BlockT *>;
269 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
643 GraphTraits<RegionNodeT *>>;
648 GraphTraits<const RegionNodeT *>>;
687 using BlockTraits = GraphTraits<BlockT *>;
688 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
H A DLoopInfoImpl.h171 typedef GraphTraits<BlockT *> BlockTraits;
299 assert(std::any_of(GraphTraits<BlockT *>::child_begin(BB),
300 GraphTraits<BlockT *>::child_end(BB),
304 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB),
305 GraphTraits<Inverse<BlockT *>>::child_end(BB),
310 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB),
311 GraphTraits<Inverse<BlockT *>>::child_end(BB),
420 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits;
475 typedef GraphTraits<BlockT *> BlockTraits;
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/AST/
H A DStmtGraphTraits.h9 // This file defines a template specialization of llvm::GraphTraits to
19 #include "llvm/ADT/GraphTraits.h"
23 template <> struct GraphTraits<clang::Stmt *> { struct in namespace:llvm
49 template <> struct GraphTraits<const clang::Stmt *> { struct in namespace:llvm
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h14 /// GraphTraits that allow Function and BasicBlock graphs to be treated as
22 #include "llvm/ADT/GraphTraits.h"
293 // GraphTraits specializations for basic block graphs (CFGs)
296 // Provide specializations of GraphTraits to be able to treat a function as a
299 template <> struct GraphTraits<BasicBlock*> { struct in namespace:llvm
308 template <> struct GraphTraits<const BasicBlock*> { struct in namespace:llvm
318 // Provide specializations of GraphTraits to be able to treat a function as a
323 template <> struct GraphTraits<Inverse<BasicBlock*>> { struct in namespace:llvm
332 template <> struct GraphTraits<Inverse<const BasicBlock*>> { struct in namespace:llvm
342 // GraphTraits specialization
349 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> { struct in namespace:llvm
365 template <> struct GraphTraits<const Function*> : struct in namespace:llvm
388 template <> struct GraphTraits<Inverse<Function*>> : struct in namespace:llvm
394 template <> struct GraphTraits<Inverse<const Function*>> : struct in namespace:llvm
[all...]
H A DDominators.h19 #include "llvm/ADT/GraphTraits.h"
190 // DominatorTree GraphTraits specializations so the DominatorTree can be
210 struct GraphTraits<DomTreeNode *> struct in namespace:llvm
215 struct GraphTraits<const DomTreeNode *> struct in namespace:llvm
219 template <> struct GraphTraits<DominatorTree*> struct in namespace:llvm
220 : public GraphTraits<DomTreeNode*> {
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h23 #include "llvm/ADT/GraphTraits.h"
243 template <> struct GraphTraits<clang::CallGraphNode*> { struct in namespace:llvm
253 template <> struct GraphTraits<const clang::CallGraphNode*> { struct in namespace:llvm
263 template <> struct GraphTraits<clang::CallGraph*> struct in namespace:llvm
264 : public GraphTraits<clang::CallGraphNode*> {
289 template <> struct GraphTraits<const clang::CallGraph*> : struct in namespace:llvm
290 public GraphTraits<const clang::CallGraphNode*> {
H A DCFG.h23 #include "llvm/ADT/GraphTraits.h"
1454 // GraphTraits specializations for CFG basic block graphs (source-level CFGs)
1471 template <> struct GraphTraits< ::clang::CFGBlock *> {
1480 template <> struct GraphTraits<clang::CFGBlock>
1481 : GraphTraits<clang::CFGBlock *> {};
1483 template <> struct GraphTraits< const ::clang::CFGBlock *> {
1492 template <> struct GraphTraits<const clang::CFGBlock>
1493 : GraphTraits<clang::CFGBlock *> {};
1495 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1507 template <> struct GraphTraits<Invers
[all...]
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DDominators.h19 #include "llvm/ADT/GraphTraits.h"
196 using NodeRef = typename GraphTraits<clang::CFGBlock>::NodeRef;
347 /// DominatorTree GraphTraits specialization so the DominatorTree can be
350 template <> struct GraphTraits<clang::DomTreeNode *> { struct in namespace:llvm
370 template <> struct GraphTraits<clang::CFGDomTree *> struct in namespace:llvm
371 : public GraphTraits<clang::DomTreeNode *> {
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DCFGDiff.h9 // This file defines specializations of GraphTraits that allows generic
17 #include "llvm/ADT/GraphTraits.h"
43 // InverseEdge = true (see calls to GraphDiff methods in there). The GraphTraits
46 // GraphTraits instantiations:
54 // The 4 GraphTraits are as follows:
198 typename GT = GraphTraits<GraphT>>
243 struct GraphTraits<std::pair<const GraphDiff<T, B> *, T>> struct in namespace:llvm
246 struct GraphTraits<std::pair<const GraphDiff<T, B> *, Inverse<T>>> struct in namespace:llvm

Completed in 218 milliseconds

123