---

initializerNode Class Reference

Initializer expression. More...

#include <ast.h>

Inheritance diagram for initializerNode::

List of all members.

Public Methods
	initializerNode (expr_list *exprs, const Coord coord=Coord::Unknown)
virtual	~initializerNode ()
	Destroy a initializerNode. More...
virtual void	eval ()
	Constant expression evaluator. 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_expr (output_context &ct, Node *par, int prec, Assoc assoc)
	Output a expression. More...
Accessors
Methods to get and set fields in the class.
expr_list &	exprs ()
const expr_list &	exprs () const
void	add_expr (exprNode *the_expr)
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 expr_list	_exprs

---

Detailed Description

Initializer expression.

This class represents the initializer expressions used to set the initial values of structs and arrays. They are generally nested lists of constant expressions, like this:

    int A[2][3] = { { 17, 23, 5 } , { 4, 19, 102 } };

The code above consists of three initializerNode objects: one for the top-level array, and one for each subarray. The two subarray initializers contain lists of constNode objects (one for each integer).

---

Constructor & Destructor Documentation

initializerNode::initializerNode (  expr_list *    exprs, const Coord    coord = Coord::Unknown )

initializerNode::~initializerNode (    )  [virtual]

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

---

Member Function Documentation

void initializerNode::add_expr (  exprNode *    the_expr )  [inline]

Node * initializerNode::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* initializerNode::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 initializerNode::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 initializerNode::eval (    )  [virtual]

Constant expression evaluator. This method attempts to evaluate an expression at compile-time. This only yields a meaningful value when the leaves of the given expression are constants, enums, or other compile-time values (e.g., sizeof). The resulting value is stored on each exprNode, in the _value field. Each exprNode sublcass implements this method, calling it recursively when necessary. Reimplemented from exprNode.

const expr_list& initializerNode::exprs (    )  const [inline]

expr_list& initializerNode::exprs (    )  [inline]

void initializerNode::output_expr (  output_context &    ct, Node *    parent, int    prec, Assoc    assoc )  [virtual]

Output a expression. Reimplemented from exprNode.

void initializerNode::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 initializerNode::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 expr_list initializerNode::_exprs [private]

---

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

• ast.h
• initializernode.cc

---