---

whileNode Class Reference

While loop statement. More...

#include <ast.h>

Inheritance diagram for whileNode::

List of all members.

Public Methods
	whileNode (exprNode *cond, stmtNode *body, const Coord coord=Coord::Unknown)
	Create a new while loop. More...
virtual	~whileNode ()
	Destroy a whileNode. 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...
AST Traversal
Methods to uniformly traverse the AST. See the documentation in the Node class.
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...

---

Detailed Description

While loop statement.

This class represents the while loop statement (condition at the top of the loop).

This NodeType is While.

---

Constructor & Destructor Documentation

whileNode::whileNode (  exprNode *    cond, stmtNode *    body, const Coord    coord = Coord::Unknown )

Create a new while loop. The new while loop has the given condition expression and body. Parameters: cond  the loop condition body  the loop body coord  the location of the construct in the source file.

whileNode::~whileNode (    )  [virtual]

Destroy a whileNode. Warning: Do not use the destructors to delete AST nodes. Instead, rely on the node garbage collector.

---

Member Function Documentation

Node * whileNode::change (  Changer &    the_changer, bool    redispatch = false )  [virtual]

Dispatch a Changer. This abstract method works much the walker, but allows the tree to be changed. Parameters: the_changer  the specific Changer object to use. redispatch  pass true to revisit parts of the tree that have changed. Reimplemented from Node.

virtual Node* whileNode::clone (    )  const [inline, virtual]

Clone the input node. This is not a "deep" clone, so be careful. For a deep clone, use the clone_changer class. Returns: a shallow copy of the node (no subtrees are copied). Reimplemented from Node.

void whileNode::dataflow (  FlowVal *    v, FlowProblem &    fp )  [virtual]

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. Parameters: v  the flow value to pass through the node. fp  the flow problem (specifying the transfer functions). Reimplemented from Node.

void whileNode::output_stmt (  output_context &    ct, Node *    parent )  [virtual]

Output a statement. Reimplemented from stmtNode.

void whileNode::visit (  Visitor *    the_visitor )  [virtual]

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. Parameters: the_visitor  the specific Visitor object to use. Reimplemented from Node.

void whileNode::walk (  Walker &    the_walker )  [virtual]

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. Parameters: the_walker  the specific Walker object to use. Reimplemented from Node.

---

The documentation for this class was generated from the following files:

• ast.h
• whilenode.cc

---