---

forNode Class Reference

For loop statement. More...

#include <ast.h>

Inheritance diagram for forNode::

List of all members.

Public Methods
	forNode (exprNode *init, exprNode *cond, exprNode *next, stmtNode *body, const Coord coord=Coord::Unknown)
	Create a new for loop. More...
virtual	~forNode ()
	Destroy a forNode. 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 *	init () const
exprNode *	get_init ()
void	init (exprNode *init)
exprNode *	next () const
exprNode *	get_next ()
void	next (exprNode *next)
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...
Private Attributes
TREE exprNode *	_init
	the initial expression (or null, if there is none). More...
TREE exprNode *	_next
	the next expression (or null, if there is none). More...

---

Detailed Description

For loop statement.

This class represents the for-loop statement (three expressions, plus the body). The condition expression still functions as the condition (the middle expression). It also adds two expressions, one for the initial condition (the first expression) and one for the "next" operation (the third expression). The decomposition looks like this:

  for ( i = 0; i < N ; i++ ) {
    ...blah...
  }

The initial expression is "i = 0", the condition expression is "i < N" and the next expression is "i++". When any of these components are missing, the corresponding data members are null.

The NodeType is For.

---

Constructor & Destructor Documentation

forNode::forNode (  exprNode *    init, exprNode *    cond, exprNode *    next, stmtNode *    body, const Coord    coord = Coord::Unknown )

Create a new for loop. The new for loop has the given expressions and body. To leave out any of the expressions, pass null. Parameters: init  the initial expression (or null) cond  the condition expression (or null) next  the next expression (or null) coord  the location of the construct in the source file.

forNode::~forNode (    )  [virtual]

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

---

Member Function Documentation

Node * forNode::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* forNode::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 forNode::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.

exprNode* forNode::get_init (    )  [inline]

exprNode* forNode::get_next (    )  [inline]

void forNode::init (  exprNode *    init )  [inline]

exprNode* forNode::init (    )  const [inline]

void forNode::next (  exprNode *    next )  [inline]

exprNode* forNode::next (    )  const [inline]

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

Output a statement. Reimplemented from stmtNode.

void forNode::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 forNode::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.

---

Member Data Documentation

TREE exprNode* forNode::_init [private]

the initial expression (or null, if there is none).

TREE exprNode* forNode::_next [private]

the next expression (or null, if there is none).

---

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

• ast.h
• fornode.cc

---