#include <ast.h>
Inheritance diagram for continueNode::
Public Methods | |
continueNode (loopNode *container, const Coord coord=Coord::Unknown) | |
Create a new continue statement within a loop. More... | |
continueNode (const Coord coord=Coord::Unknown) | |
Create a new continue statement without a loop. More... | |
virtual | ~continueNode () |
Destroy a continueNode. 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. | |
loopNode * | container () const |
void | container (loopNode *container) |
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 loopNode * | _container |
a reference the containing loop. More... |
This class represents the continue statement. It has a reference to the containing loop, which is initially set to null. It is computed after parsing by the set_container_walker.
The NodeType is Continue
|
Create a new continue statement within a loop. The new continue statement automatically has the given containing loop. Pass null if the containing loop is unknown.
|
|
Create a new continue statement without a loop. The new continue statement has no containing loop reference. It can be computed using the set_container_walker.
|
|
Destroy a continueNode.
|
|
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. |
|
a reference the containing loop. Initiallly, this reference is null, but is computed after parsing by the set_container_walker. |