Main Page   Modules   Namespace List   Class Hierarchy   Compound List   File List   Compound Members   File Members   Related Pages  

switchNode Class Reference

Switch statement. More...

#include <ast.h>

Inheritance diagram for switchNode::

selectionNode stmtNode Node List of all members.

Public Methods

 switchNode (exprNode *expr, stmtNode *stmt, const Coord coord=Coord::Unknown)
 Create a new switch statement. More...

virtual ~switchNode ()
 Destroy a switchNode. 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.

target_list & cases ()
const target_list & cases () const
bool has_default () const
void has_default (bool has_default)
FlowVal * at_top () const
void at_top (FlowVal *at)
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

REF target_list _cases
 the list of cases. More...

bool _has_default
 a flag that is true if the switch has a default case. More...

FlowVal * _at_top
 dataflow analysis entry value. More...


Detailed Description

Switch statement.

This class represents the switch statement. The child statement is typically a compound statement containing the cases. All cases should be contained somewhere in that subtree, although there is currently no check for this. It contains a list of the cases (including the default) that are within its scope. This list is initially empty, but is computed after parsing by the set_container_walker.

The NodeType is Switch.


Constructor & Destructor Documentation

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

Create a new switch statement.

The new switch statement has the given selection expression and the child statement that should contain the cases.

Parameters:
expr  the selection expression
stmt  the child statement containing the cases
coord  the location of the construct in the source file.

switchNode::~switchNode (    )  [virtual]
 

Destroy a switchNode.

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


Member Function Documentation

void switchNode::at_top (  FlowVal *    at )  [inline]
 

FlowVal* switchNode::at_top (    )  const [inline]
 

const target_list& switchNode::cases (    )  const [inline]
 

target_list& switchNode::cases (    )  [inline]
 

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

bool switchNode::has_default (    )  const [inline]
 

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

Output a statement.

Reimplemented from stmtNode.

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

FlowVal* switchNode::_at_top [private]
 

dataflow analysis entry value.

This field is used by the dataflow analysis framework to hold the incoming flow value needed by each case statement.

REF target_list switchNode::_cases [private]
 

the list of cases.

This list includes the default case. It is initially empty, but is computer after parsing by the set_container_walker.

bool switchNode::_has_default [private]
 

a flag that is true if the switch has a default case.


The documentation for this class was generated from the following files:
Generated on Thu Jan 10 12:06:34 2002 for C-Breeze by doxygen1.2.13.1 written by Dimitri van Heesch, © 1997-2001