---

caseNode Class Reference

Case statement. More...

#include <ast.h>

Inheritance diagram for caseNode::

List of all members.

Public Methods
	caseNode (exprNode *expr, stmtNode *stmt, switchNode *container, const Coord coord=Coord::Unknown)
	Create a new case statement. More...
	caseNode (exprNode *expr, stmtNode *stmt, const Coord coord=Coord::Unknown)
	Create a new case statement without a switch. More...
virtual	~caseNode ()
	Destroy a caseNode. 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 *	expr () const
exprNode *	get_expr ()
void	expr (exprNode *expr)
switchNode *	container () const
void	container (switchNode *container)
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 *	_expr
	the label expression. More...
REF switchNode *	_container
	the containing switch statement. More...

---

Detailed Description

Case statement.

This class represents a case within a switch statement. Like the labelNode, it has a child statement. However, the label is an expression. The language requires the expression to be a compile-time constant expression, but there are currently no checks for this. In addition, this node keeps a reference to the enclosing switchNode.

The defaultNode has been folded into this class. If the case has no expression, then it is the default.

The NodeType is Case

---

Constructor & Destructor Documentation

caseNode::caseNode (  exprNode *    expr, stmtNode *    stmt, switchNode *    container, const Coord    coord = Coord::Unknown )

Create a new case statement. The new statement has the given label expression, child statement and containing switch statement. Parameters: expr  the label expression, or null for the "default" case stmt  the child statement container  the containing switch statement coord  the location of the construct in the source file.

caseNode::caseNode (  exprNode *    expr, stmtNode *    stmt, const Coord    the_coord = Coord::Unknown )

Create a new case statement without a switch. The new statement has the given label expression and child statement, but no explicit switchNode container. This is computed later using the set_container_walker. Parameters: expr  the label expression stmt  the child statement coord  the location of the construct in the source file.

caseNode::~caseNode (    )  [virtual]

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

---

Member Function Documentation

Node * caseNode::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* caseNode::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 caseNode::container (  switchNode *    container )  [inline]

switchNode* caseNode::container (    )  const [inline]

void caseNode::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 caseNode::expr (  exprNode *    expr )  [inline]

exprNode* caseNode::expr (    )  const [inline]

exprNode* caseNode::get_expr (    )  [inline]

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

Output a statement. Reimplemented from stmtNode.

void caseNode::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 caseNode::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

REF switchNode* caseNode::_container [private]

the containing switch statement. Unless explicitly specified, this field is initially null. After parsing, these references are computed by calling the set_container_walker.

TREE exprNode* caseNode::_expr [private]

the label expression. This should be a compile-time constant expression

---

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

• ast.h
• casenode.cc

---