|
LLVM 22.0.0git
|
Data Dependency Graph Edge. More...
#include "llvm/Analysis/DDG.h"
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.
|
strong |
|
explicitdelete |
References N.
Referenced by DDGEdge(), DDGEdge(), operator=(), and operator=().
|
inline |
Definition at line 228 of file DDG.h.
References DDGEdge(), E(), and llvm::move().
|
inline |
|
inline |
Return true if this is a def-use edge, and false otherwise.
Definition at line 241 of file DDG.h.
References RegisterDefUse.
|
inline |
Return true if this is a memory dependence edge, and false otherwise.
Definition at line 244 of file DDG.h.
References MemoryDependence.
|
inline |
Definition at line 231 of file DDG.h.
References DDGEdge(), E(), and llvm::DGEdge< DDGNode, DDGEdge >::operator=().