/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineRegionInfo.cpp | 67 MachineBasicBlock *Entry = GraphTraits<MachineFunction*>::getEntryNode(&F);
|
H A D | MachineBlockFrequencyInfo.cpp | 88 template <> struct GraphTraits<MachineBlockFrequencyInfo *> { struct in namespace:llvm
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 35 #include "llvm/ADT/GraphTraits.h" 87 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy *>, 88 class IGT = GraphTraits<Inverse<NodeTy *>>>
|
H A D | CFGPrinter.h | 100 struct GraphTraits<DOTFuncInfo *> : public GraphTraits<const BasicBlock *> { struct in namespace:llvm
|
H A D | RegionInfoImpl.h | 14 #include "llvm/ADT/GraphTraits.h" 315 return GraphTraits<RegionT *>::nodes_begin(static_cast<RegionT *>(this)); 320 return GraphTraits<RegionT *>::nodes_end(static_cast<RegionT *>(this)); 326 return GraphTraits<const RegionT *>::nodes_begin( 333 return GraphTraits<const RegionT *>::nodes_end( 729 BlockT *entry = GraphTraits<FuncPtrT>::getEntryNode(&F); 923 BlockT *BB = GraphTraits<FuncPtrT>::getEntryNode(&F);
|
H A D | BlockFrequencyInfoImpl.h | 19 #include "llvm/ADT/GraphTraits.h" 600 /// \a GraphTraits (so that \a analyzeIrreducible() can use \a scc_iterator), 860 using Successor = GraphTraits<const BlockT *>; 861 using Predecessor = GraphTraits<Inverse<const BlockT *>>; 1323 using Successor = GraphTraits<const BlockT *>; 1382 for (auto SI = GraphTraits<const BlockT *>::child_begin(BB), 1383 SE = GraphTraits<const BlockT *>::child_end(BB); 1484 using GTraits = GraphTraits<BlockFrequencyInfoT *>;
|
H A D | LoopInfo.h | 43 #include "llvm/ADT/GraphTraits.h" 234 auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header); 235 auto PredEnd = GraphTraits<Inverse<BlockT *>>::child_end(Header); 1189 template <> struct GraphTraits<const Loop *> { struct in namespace:llvm 1198 template <> struct GraphTraits<Loop *> { struct in namespace:llvm
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineFunction.h | 23 #include "llvm/ADT/GraphTraits.h" 1073 // GraphTraits specializations for function basic block graphs (CFGs) 1076 // Provide specializations of GraphTraits to be able to treat a 1081 template <> struct GraphTraits<MachineFunction*> : 1082 public GraphTraits<MachineBasicBlock*> { 1098 template <> struct GraphTraits<const MachineFunction*> : struct in class:llvm::MachineFunction 1099 public GraphTraits<const MachineBasicBlock*> { 1118 // Provide specializations of GraphTraits to be able to treat a function as a 1123 template <> struct GraphTraits<Inverse<MachineFunction*>> : struct in class:llvm::MachineFunction 1124 public GraphTraits<Invers 1129 template <> struct GraphTraits<Inverse<const MachineFunction*>> : struct in class:llvm::MachineFunction [all...] |
H A D | ScheduleDAG.h | 19 #include "llvm/ADT/GraphTraits.h" 663 template <> struct GraphTraits<SUnit*> { struct in class:llvm::SUnit 675 template <> struct GraphTraits<ScheduleDAG*> : public GraphTraits<SUnit*> { struct in class:llvm::SUnit
|
H A D | MachineBasicBlock.h | 16 #include "llvm/ADT/GraphTraits.h" 943 // GraphTraits specializations for machine basic block graphs (machine-CFGs) 946 // Provide specializations of GraphTraits to be able to treat a 950 template <> struct GraphTraits<MachineBasicBlock *> { struct in namespace:llvm 959 template <> struct GraphTraits<const MachineBasicBlock *> { struct in namespace:llvm 968 // Provide specializations of GraphTraits to be able to treat a 974 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> { struct in namespace:llvm 986 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> { struct in namespace:llvm
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | CallPrinter.cpp | 111 struct GraphTraits<CallGraphDOTInfo *> struct in namespace:llvm 112 : public GraphTraits<const CallGraphNode *> {
|
H A D | RegionPrinter.cpp | 75 GraphTraits<RegionInfo *>::ChildIteratorType CI,
|
H A D | BlockFrequencyInfo.cpp | 99 struct GraphTraits<BlockFrequencyInfo *> { struct in namespace:llvm
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericIteratedDominanceFrontier.h | 40 using NodeRef = typename GraphTraits<NodeTy>::NodeRef;
|
H A D | GraphWriter.h | 16 // by the GraphTraits template, but they can choose to implement specializations 25 #include "llvm/ADT/GraphTraits.h" 71 using GTraits = GraphTraits<GraphType>;
|
H A D | GenericDomTree.h | 19 /// FIXME: Maybe GenericDomTree needs a TreeTraits, instead of GraphTraits. 27 #include "llvm/ADT/GraphTraits.h" 227 static_assert(std::is_pointer<typename GraphTraits<NodeT *>::NodeRef>::value, 802 void Split(typename GraphTraits<N>::NodeRef NewBB) { 803 using GraphT = GraphTraits<N>;
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 97 using BaseSuccIterator = GraphTraits<RegionNode *>::ChildIteratorType; 122 return {GraphTraits<Region *>::getEntryNode(R), nullptr}; 131 {GraphTraits<RegionNode *>::child_begin(N.first), N.second}, 132 {GraphTraits<RegionNode *>::child_end(N.first), N.second}), 368 Order.resize(std::distance(GraphTraits<Region *>::nodes_begin(ParentRegion), 369 GraphTraits<Region *>::nodes_end(ParentRegion)));
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlan.h | 13 /// 2. Specializations of GraphTraits that allow VPBlockBase graphs to be 32 #include "llvm/ADT/GraphTraits.h" 1413 // GraphTraits specializations for VPlan Hierarchical Control-Flow Graphs // 1416 // The following set of template specializations implement GraphTraits to treat 1422 template <> struct GraphTraits<VPBlockBase *> { 1437 template <> struct GraphTraits<const VPBlockBase *> { 1454 template <> struct GraphTraits<Inverse<VPBlockBase *>> { 1469 // The following set of template specializations implement GraphTraits to 1477 struct GraphTraits<VPRegionBlock *> : public GraphTraits<VPBlockBas [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | SCCIterator.h | 10 /// This builds on the llvm/ADT/GraphTraits.h file to find the strongly 26 #include "llvm/ADT/GraphTraits.h" 41 template <class GraphT, class GT = GraphTraits<GraphT>>
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FixIrreducible.cpp | 240 template <> struct GraphTraits<Loop> : LoopBodyTraits {}; struct in namespace:llvm
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonGenExtract.cpp | 10 #include "llvm/ADT/GraphTraits.h" 262 BasicBlock *Entry = GraphTraits<Function*>::getEntryNode(&F);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 29 #include "llvm/ADT/GraphTraits.h" 39 using Traits = GraphTraits<ImmutableGraph<NodeValueT, EdgeValueT> *>; 405 struct GraphTraits<ImmutableGraph<NodeValueT, EdgeValueT> *> {
|
H A D | X86LoadValueInjectionLoadHardening.cpp | 189 struct GraphTraits<MachineGadgetGraph *> struct in namespace:llvm 190 : GraphTraits<ImmutableGraph<MachineInstr *, int> *> {}; 195 using Traits = llvm::GraphTraits<GraphType *>;
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | ModuleSummaryIndex.h | 755 friend struct GraphTraits<ValueInfo>; 1499 /// GraphTraits definition to build SCC for the index 1500 template <> struct GraphTraits<ValueInfo> { struct in struct:llvm::CalleeInfo 1557 struct GraphTraits<ModuleSummaryIndex *> : public GraphTraits<ValueInfo> { struct in struct:llvm::CalleeInfo
|
H A D | Type.h | 31 template<class GraphType> struct GraphTraits;
|