LLVM: llvm::RootDDGNode Class Reference (original) (raw)
Subclass of DDGNode representing the root node of the graph. More...
#include "[llvm/Analysis/DDG.h](DDG%5F8h%5Fsource.html)"
| Public Member Functions | |
|---|---|
| RootDDGNode () | |
| RootDDGNode (const RootDDGNode &N)=delete | |
| RootDDGNode (RootDDGNode &&N) | |
| ~RootDDGNode () override=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)=default |
| 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< DDGNode, DDGEdge > | |
| DGNode (DDGEdge &E) | |
| Create a node with a single outgoing edge E. | |
| DGNode ()=default | |
| const_iterator | begin () const |
| const_iterator | end () const |
| iterator | begin () |
| iterator | end () |
| const DDGEdge & | front () const |
| DDGEdge & | front () |
| const DDGEdge & | back () const |
| DDGEdge & | back () |
| bool | findEdgesTo (const DDGNode &N, SmallVectorImpl< DDGEdge * > &EL) const |
| Collect in EL, all the edges from this node to N. | |
| bool | addEdge (DDGEdge &E) |
| Add the given edge E to this node, if it doesn't exist already. | |
| void | removeEdge (DDGEdge &E) |
| Remove the given edge E from this node, if it exists. | |
| bool | hasEdgeTo (const DDGNode &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. |
| 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< DDGNode, DDGEdge > | |
| using | EdgeListTy |
| using | iterator |
| using | 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< DDGNode, DDGEdge > | |
| bool | isEqualTo (const DDGNode &N) const |
| DDGNode & | getDerived () |
| const DDGNode & | getDerived () const |
| const_iterator | findEdgeTo (const DDGNode &N) const |
| Find an edge to N. | |
| Protected Attributes inherited from llvm::DGNode< DDGNode, DDGEdge > | |
| EdgeListTy | Edges |
Subclass of DDGNode representing the root node of the graph.
There should only be one such node in a given graph.
Definition at line 90 of file DDG.h.
| llvm::RootDDGNode::RootDDGNode ( ) | inline |
|---|
◆ RootDDGNode() [2/3]
◆ RootDDGNode() [3/3]
| llvm::RootDDGNode::RootDDGNode ( RootDDGNode && N) | inline |
|---|
◆ ~RootDDGNode()
| llvm::RootDDGNode::~RootDDGNode ( ) | overridedefault |
|---|
◆ classof() [1/2]
◆ classof() [2/2]
The documentation for this class was generated from the following file:
- include/llvm/Analysis/DDG.h