Subclass of DDGNode representing the root node of the graph. More...
#include "llvm/Analysis/DDG.h"
Inheritance diagram for llvm::RootDDGNode:
Public Member Functions | |
| RootDDGNode () | |
| RootDDGNode (const RootDDGNode &N)=delete | |
| RootDDGNode (RootDDGNode &&N) | |
| ~RootDDGNode ()=default | |
 Public Member Functions inherited from llvm::DDGNode | |
| DDGNode ()=delete | |
| DDGNode (const NodeKind K) | |
| DDGNode (const DDGNode &N)=default | |
| DDGNode (DDGNode &&N) | |
| virtual | ~DDGNode ()=0 |
| DDGNode & | operator= (const DDGNode &N) |
| DDGNode & | operator= (DDGNode &&N) |
| NodeKind | getKind () const |
| Getter for the kind of this node. | |
| bool | collectInstructions (llvm::function_ref< bool(Instruction *)> const &Pred, InstructionListType &IList) const |
Collect a list of instructions, in IList, for which predicate Pred evaluates to true when iterating over instructions of this node. | |
| Public Member Functions inherited from llvm::DGNode< NodeType, EdgeType > | |
| DGNode (EdgeType &E) | |
Create a node with a single outgoing edge E. | |
| DGNode ()=default | |
| DGNode (const DGNode< NodeType, EdgeType > &N) | |
| DGNode (DGNode< NodeType, EdgeType > &&N) | |
| DGNode< NodeType, EdgeType > & | operator= (const DGNode< NodeType, EdgeType > &N) |
| DGNode< NodeType, EdgeType > & | operator= (const DGNode< NodeType, EdgeType > &&N) |
| const_iterator | begin () const |
| const_iterator | end () const |
| iterator | begin () |
| iterator | end () |
| const EdgeType & | front () const |
| EdgeType & | front () |
| const EdgeType & | back () const |
| EdgeType & | back () |
| bool | findEdgesTo (const NodeType &N, SmallVectorImpl< EdgeType * > &EL) const |
Collect in EL, all the edges from this node to N. | |
| bool | addEdge (EdgeType &E) |
Add the given edge E to this node, if it doesn't exist already. | |
| void | removeEdge (EdgeType &E) |
Remove the given edge E from this node, if it exists. | |
| bool | hasEdgeTo (const NodeType &N) const |
Test whether there is an edge that goes from this node to N. | |
| const EdgeListTy & | getEdges () const |
| Retrieve the outgoing edges for the node. | |
| EdgeListTy & | getEdges () |
| void | clear () |
| Clear the outgoing edges. | |
Static Public Member Functions | |
| static bool | classof (const DDGNode *N) |
| Define classof to be able to use isa<>, cast<>, dyn_cast<>, etc. | |
| static bool | classof (const RootDDGNode *N) |
Additional Inherited Members | |
| Public Types inherited from llvm::DDGNode | |
| enum class | NodeKind { Unknown , SingleInstruction , MultiInstruction , PiBlock , Root } |
| using | InstructionListType = SmallVectorImpl< Instruction * > |
| Public Types inherited from llvm::DGNode< NodeType, EdgeType > | |
| using | EdgeListTy = SetVector< EdgeType * > |
| using | iterator = typename EdgeListTy::iterator |
| using | const_iterator = typename EdgeListTy::const_iterator |
| Protected Member Functions inherited from llvm::DDGNode | |
| void | setKind (NodeKind K) |
| Setter for the kind of this node. | |
| Protected Member Functions inherited from llvm::DGNode< NodeType, EdgeType > | |
| bool | isEqualTo (const NodeType &N) const |
| NodeType & | getDerived () |
| const NodeType & | getDerived () const |
| const_iterator | findEdgeTo (const NodeType &N) const |
Find an edge to N. | |
| Protected Attributes inherited from llvm::DGNode< NodeType, EdgeType > | |
| EdgeListTy | Edges |
Detailed Description
Subclass of DDGNode representing the root node of the graph.
There should only be one such node in a given graph.
Constructor & Destructor Documentation
◆ RootDDGNode() [1/3]
◆ RootDDGNode() [2/3]
|
delete |
◆ RootDDGNode() [3/3]
|
inline |
◆ ~RootDDGNode()
|
default |
Member Function Documentation
◆ classof() [1/2]
Define classof to be able to use isa<>, cast<>, dyn_cast<>, etc.
Definition at line 101 of file DDG.h.
References N, and llvm::DDGNode::Root.
◆ classof() [2/2]
|
inlinestatic |
The documentation for this class was generated from the following file:
- include/llvm/Analysis/DDG.h
