LLVM: llvm::DDGEdge Class Reference (original) (raw)
Data Dependency Graph Edge. More...
#include "[llvm/Analysis/DDG.h](DDG%5F8h%5Fsource.html)"
| Public Types | |
|---|---|
| enum class | EdgeKind { Unknown, RegisterDefUse, MemoryDependence, Rooted, Last = Rooted } |
| The kind of edge in the DDG. More... |
| Public Member Functions | |
|---|---|
| DDGEdge (DDGNode &N)=delete | |
| DDGEdge (DDGNode &N, EdgeKind K) | |
| DDGEdge (const DDGEdge &E) | |
| DDGEdge (DDGEdge &&E) | |
| DDGEdge & | operator= (const DDGEdge &E)=default |
| DDGEdge & | operator= (DDGEdge &&E) |
| EdgeKind | getKind () const |
| Get the edge kind. | |
| bool | isDefUse () const |
| Return true if this is a def-use edge, and false otherwise. | |
| bool | isMemoryDependence () const |
| Return true if this is a memory dependence edge, and false otherwise. | |
| bool | isRooted () const |
| Return true if this is an edge stemming from the root node, and false otherwise. | |
| Public Member Functions inherited from llvm::DGEdge< DDGNode, DDGEdge > | |
| DGEdge ()=delete | |
| DGEdge (DDGNode &N) | |
| Create an edge pointing to the given node N. | |
| DGEdge (const DGEdge< DDGNode, DDGEdge > &E) | |
| DGEdge< DDGNode, DDGEdge > & | operator= (const DGEdge< DDGNode, DDGEdge > &E) |
| bool | operator== (const DGEdge &E) const |
| Static polymorphism: delegate implementation (via isEqualTo) to the derived class. | |
| bool | operator!= (const DGEdge &E) const |
| const DDGNode & | getTargetNode () const |
| Retrieve the target node this edge connects to. | |
| DDGNode & | getTargetNode () |
| void | setTargetNode (const DDGNode &N) |
| Set the target node this edge connects to. |
| Additional Inherited Members | |
|---|---|
| Protected Member Functions inherited from llvm::DGEdge< DDGNode, DDGEdge > | |
| bool | isEqualTo (const DDGEdge &E) const |
| DDGEdge & | getDerived () |
| const DDGEdge & | getDerived () const |
| Protected Attributes inherited from llvm::DGEdge< DDGNode, DDGEdge > | |
| DDGNode & | TargetNode |
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.
Definition at line 210 of file DDG.h.
◆ EdgeKind
The kind of edge in the DDG.
| Enumerator |
|---|
| Unknown |
| RegisterDefUse |
| MemoryDependence |
| Rooted |
| Last |
Definition at line 213 of file DDG.h.
◆ DDGEdge() [1/4]
| llvm::DDGEdge::DDGEdge ( DDGNode & N) | explicitdelete |
|---|
◆ DDGEdge() [2/4]
| llvm::DDGEdge::DDGEdge ( DDGNode & N, EdgeKind K ) | inline |
|---|
Definition at line 222 of file DDG.h.
References N.
◆ DDGEdge() [3/4]
◆ DDGEdge() [4/4]
| llvm::DDGEdge::DDGEdge ( DDGEdge && E) | inline |
|---|
◆ getKind()
| EdgeKind llvm::DDGEdge::getKind ( ) const | inline |
|---|
◆ isDefUse()
| bool llvm::DDGEdge::isDefUse ( ) const | inline |
|---|
Return true if this is a def-use edge, and false otherwise.
Definition at line 237 of file DDG.h.
References RegisterDefUse.
◆ isMemoryDependence()
| bool llvm::DDGEdge::isMemoryDependence ( ) const | inline |
|---|
Return true if this is a memory dependence edge, and false otherwise.
Definition at line 240 of file DDG.h.
References MemoryDependence.
◆ isRooted()
| bool llvm::DDGEdge::isRooted ( ) const | inline |
|---|
Return true if this is an edge stemming from the root node, and false otherwise.
Definition at line 244 of file DDG.h.
References Rooted.
◆ operator=() [1/2]
References DDGEdge(), and E().
◆ operator=() [2/2]
The documentation for this class was generated from the following file:
- include/llvm/Analysis/DDG.h