Traits for traversing a graph type without copying it.
Synopsis
Declared in <llvm/ADT/GraphTraits.h>
template<class GraphType>
struct GraphTraits;
Description
Specialize for each graph (CFG, DomTree, …). The primary template is empty except for a deliberate incomplete NodeRef that fails compilation when no specialization is visible. May reinterpret the graph via richer NodeRef values (see LoopBodyTraits).
Type Aliases
Name |
Description |
Placeholder that fails compilation unless GraphTraits is specialized. |
Specializations
Name |
Description |
GraphTraits specialization so ValueInfo can be used as a call‐graph node. |
|
GraphTraits specialization for flat iteration of MachineRegion graphs. |
|
GraphTraits specialization for flat iteration of MachineRegionNode graphs. |
|
GraphTraits specialization that walks a Region in flat CFG mode. |
|
GraphTraits specialization for flat RegionNode successors. |
|
GraphTraits specialization for flat iteration of const MachineRegion graphs. |
|
GraphTraits specialization for flat iteration of const MachineRegionNode graphs. |
|
GraphTraits specialization that walks a Region in flat CFG mode. |
|
GraphTraits specialization for flat RegionNode successors. |
|
GraphTraits specialization walking a BasicBlock CFG in inverse (predecessor) order. |
|
GraphTraits specialization walking a Function CFG in inverse (predecessor) order. |
|
GraphTraits specialization walking a MachineBasicBlock CFG in inverse order via predecessors. |
|
GraphTraits specialization walking a MachineFunction CFG in inverse order via predecessor edges. |
|
Inverse GraphTraits specialization that walks MemoryAccess users. |
|
GraphTraits specialization walking a const BasicBlock CFG in inverse order. |
|
GraphTraits specialization walking a const Function CFG in inverse order. |
|
GraphTraits specialization walking a const MachineBasicBlock CFG in inverse order via predecessors. |
|
GraphTraits specialization walking a const MachineFunction CFG in inverse order via predecessor edges. |
|
GraphTraits specialization for the Attributor call graph. |
|
GraphTraits specialization for the Attributor call graph. |
|
GraphTraits specialization treating a BasicBlock as a CFG node via successors. |
|
GraphTraits specialization treating a CallGraph as a graph of nodes. |
|
GraphTraits specialization for mutable CallGraphNode pointers. |
|
GraphTraits specialization for mutable DDGNode pointers. |
|
GraphTraits specialization that treats DOTFuncInfo as a CFG of basic blocks. |
|
GraphTraits specialization that treats DOTMachineFuncInfo as a CFG of machine basic blocks. |
|
GraphTraits specialization treating a DataDependenceGraph as a graph of nodes. |
|
GraphTraits specialization for mutable DomTreeNode pointers. |
|
GraphTraits specialization so DominatorTree can be walked as a graph. |
|
GraphTraits specialization treating a Function as a CFG of basic blocks. |
|
GraphTraits specialization treating a LazyCallGraph as a graph of nodes. |
|
GraphTraits specialization for mutable Loop pointers. |
|
GraphTraits specialization treating a MachineBasicBlock as a CFG node via successors. |
|
GraphTraits specialization for mutable MachineDomTreeNode pointers. |
|
GraphTraits specialization so MachineDominatorTree can be walked as a graph. |
|
GraphTraits specialization treating a MachineFunction as a CFG of machine basic blocks, with the entry node as the first block. |
|
GraphTraits specialization for mutable MachineLoop pointers. |
|
GraphTraits specialization so MachineRegion can be walked as a graph. |
|
GraphTraits specialization so MachineRegionInfo can be walked as a flat region graph. |
|
GraphTraits specialization so MachineRegionInfoPass can be walked as a flat region graph. |
|
GraphTraits specialization for mutable MachineRegionNode pointers. |
|
GraphTraits specialization that walks defining accesses of a MemoryAccess. |
|
GraphTraits specialization so ModuleSummaryIndex can be traversed as a graph. |
|
GraphTraits specialization for LazyCallGraph nodes. |
|
GraphTraits specialization so PostDominatorTree can be walked as a graph. |
|
GraphTraits specialization treating a ProfiledCallGraph as a graph of nodes. |
|
GraphTraits specialization for ProfiledCallGraphNode pointers. |
|
GraphTraits specialization that walks a Region as a graph of nodes. |
|
GraphTraits specialization that walks RegionInfo as a flat region graph. |
|
GraphTraits specialization that walks RegionInfoPass via its RegionInfo. |
|
GraphTraits specialization for hierarchical RegionNode successors. |
|
GraphTraits specialization treating SDNode operands as children. |
|
GraphTraits specialization so algorithms can walk SUnit predecessor edges. |
|
GraphTraits specialization for iterating all SUnits in a ScheduleDAG. |
|
GraphTraits specialization that iterates every node in a SelectionDAG. |
|
GraphTraits specialization treating a const BasicBlock as a CFG node via successors. |
|
GraphTraits specialization treating a const CallGraph as a graph of nodes. |
|
GraphTraits specialization for const CallGraphNode pointers. |
|
GraphTraits specialization for const DDGNode pointers. |
|
GraphTraits specialization treating a const DataDependenceGraph as a graph of nodes. |
|
GraphTraits specialization for const DomTreeNode pointers. |
|
GraphTraits specialization treating a const Function as a CFG of basic blocks. |
|
GraphTraits specialization for const Loop pointers. |
|
GraphTraits specialization treating a const MachineBasicBlock as a CFG node via successors. |
|
GraphTraits specialization for const MachineDomTreeNode pointers. |
|
GraphTraits specialization treating a const MachineFunction as a CFG of machine basic blocks, with the entry node as the first block. |
|
GraphTraits specialization for const MachineLoop pointers. |
|
GraphTraits specialization so const MachineRegion can be walked as a graph. |
|
GraphTraits specialization for const MachineRegionNode pointers. |
|
GraphTraits specialization that walks a Region as a graph of nodes. |
|
GraphTraits specialization for hierarchical RegionNode successors. |
|
GraphTraits for a double‐inverted graph, same as for the original type. |
Derived Classes
Name |
Description |
GraphTraits for a double‐inverted graph, same as for the original type. |
Created with MrDocs