#include <ast.h>
Inheritance diagram for returnNode::
Public Methods | |
returnNode (exprNode *expr, procNode *proc, const Coord coord=Coord::Unknown) | |
Create a new return statement. More... | |
virtual | ~returnNode () |
Destroy a returnNode. More... | |
virtual void | dataflow (FlowVal *v, FlowProblem &fp) |
Run the dataflow analyzer. More... | |
virtual Node * | clone () const |
Clone the input node. More... | |
virtual void | output_stmt (output_context &ct, Node *par) |
Output a statement. More... | |
Accessors | |
Methods to get and set fields in the class. | |
exprNode * | expr () const |
exprNode * | get_expr () |
void | expr (exprNode *expr) |
procNode * | proc () const |
void | proc (procNode *proc) |
AST Traversal | |
virtual void | visit (Visitor *the_visitor) |
Dispatch a Visitor. More... | |
virtual void | walk (Walker &the_walker) |
Dispatch a Walker. More... | |
virtual Node * | change (Changer &the_changer, bool redispatch=false) |
Dispatch a Changer. More... | |
Private Attributes | |
TREE exprNode * | _expr |
the return value, or null if there is none. More... | |
REF procNode * | _proc |
a reference to the enclosing procedure. More... |
This class represents the return statement. It is classified as a jump because control leaves the procedure unconditionally.
The NodeType is Return.
|
Create a new return statement. The new return statement has the given return value expression and containing procedure. For return statements with no return value, pass null for the expression.
|
|
Destroy a returnNode.
|
|
Dispatch a Changer. This abstract method works much the walker, but allows the tree to be changed.
Reimplemented from Node. |
|
Clone the input node. This is not a "deep" clone, so be careful. For a deep clone, use the clone_changer class.
Reimplemented from Node. |
|
Run the dataflow analyzer. Each subclass overrides this method to define it's semantics for dataflow analysis. It alters the input flow value to reflect the effect of the node within the given flow problem, calling dataflow() on it's subtrees as necessary. See the dataflow analysis documentation for more information.
Reimplemented from Node. |
|
|
|
|
|
|
|
Output a statement.
Reimplemented from stmtNode. |
|
|
|
|
|
Dispatch a Visitor. This abstract method is the entry point for the visitor design pattern. Each node subclass defines a visit() method that calls the appropriate at_ method in the visitor. For more information see the Visitor documentation.
Reimplemented from Node. |
|
Dispatch a Walker. This abstract method works much like the visitor, but instead walks the entire underlying subtree calling the appropriate at_ method at each node. For more information see the Walker documentation.
Reimplemented from Node. |
|
the return value, or null if there is none.
|
|
a reference to the enclosing procedure.
|