#include <ast.h>
Inheritance diagram for castNode::
Public Methods | |
castNode (typeNode *type, exprNode *expr, bool implicit=false, const Coord coord=Coord::Unknown) | |
Create a new cast expression. More... | |
virtual | ~castNode () |
Destroy a castNode. 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... | |
virtual int | precedence (Assoc &assoc) |
Associativity and precedence. More... | |
Accessors | |
Methods to get and set fields in the class. | |
exprNode * | expr () const |
exprNode * | get_expr () |
void | expr (exprNode *expr) |
bool | is_implicit () const |
AST Traversal | |
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 expression to which the cast is applied. More... | |
bool | _implicit |
true if the cast is implicit. More... |
This class represents casts that are explicit in the source code. This is really a binary operator, where one argument is a type and the other is an expression. The semantic checker also inserts casts for integral promotions and arithmetic conversions. These casts are called implicit casts, and do not appear in the output.
The NodeType is Cast.
|
Create a new cast expression. The new cast expression has the given type and subexpression.
|
|
Destroy a castNode.
|
|
Dispatch a Changer. This abstract method works much the walker, but allows the tree to be changed.
Reimplemented from Node. |
|
Clone the input node. This is not a "deep" clone, so be careful. For a deep clone, use the clone_changer class.
Reimplemented from Node. |
|
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.
Reimplemented from Node. |
|
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. |
|
|
|
|
|
|
|
|
|
Output a expression.
Reimplemented from exprNode. |
|
Associativity and precedence. Determine the associativity and precedence of the expression. Each exprNode subclass overrides this method to provide the specific results. The default is highest precedence and left-associative.
Reimplemented from exprNode. |
|
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.
Reimplemented from Node. |
|
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.
Reimplemented from Node. |
|
the expression to which the cast is applied.
|
|
true if the cast is implicit. Implicit casts are generated by the semantic checker to make explicit any conversions between operands caused by the integral promotions and usual arithmetic conversions. |