#include <ast.h>
Inheritance diagram for gotoNode::
Public Methods | |
gotoNode (labelNode *label, const Coord coord=Coord::Unknown) | |
Create a new goto statement. More... | |
gotoNode (idNode *ident, const Coord coord) | |
Create a new goto statement from an identifier. More... | |
virtual | ~gotoNode () |
Destroy a gotoNode. 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. | |
labelNode * | label () const |
void | label (labelNode *label) |
string & | name () |
void | name (string name) |
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 | |
REF labelNode * | _label |
the target label. More... | |
string | _name |
the name of the targete label. More... |
This class represents the unconditional goto statement. It includes a reference that can be used to record the target label. Typically, it is created only with the name of the target label, and later the actual label reference can be computed with the goto_label_walker.
The NodeType is Goto.
|
Create a new goto statement. The new goto statement automatically targets the given label, and takes its name from that label.
|
|
Create a new goto statement from an identifier. The new goto statement takes its name from the input identifier. The target label reference remains null. (Was ResolveGoto from procedure.c)
|
|
Destroy a gotoNode.
|
|
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 target label. Unless explicitly specified, this field is initially null. It can be computed by calling the goto_label_walker. |
|
the name of the targete label.
|