Data Dependency Graph Edge. An edge in the DDG can represent a def-use relationship or a memory dependence based on the result of DependenceAnalysis. A rooted edge connects the root node to one of the components of the graph.
| Name | Description |
|---|---|
DDGEdgeBase |
| Name | Description |
|---|---|
EdgeKind | The kind of edge in the DDG |
| Name | Description |
|---|---|
DDGEdge [constructor] | Copy constructor |
DDGEdge [constructor] | Move constructor |
DDGEdge [constructor] [deleted] | Construct from DDGNode |
DDGEdge [constructor] | Constructor |
operator= | Copy assignment operator |
operator= | Move assignment operator |
getKind | Get the edge kind |
isDefUse | Return true if this is a def-use edge, and false otherwise. |
isMemoryDependence | Return true if this is a memory dependence edge, and false otherwise. |
isRooted | Return true if this is an edge stemming from the root node, and false otherwise. |