C-Breeze
C Compiler Infrastructure

[ Project home page]
Main Page   Modules   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Namespace Members   Compound Members   File Members   Related Pages  

binaryNode Class Reference
[The AST nodes]

Binary operator. More...

#include <ast.h>

Inheritance diagram for binaryNode:

exprNode Node List of all members.

Garbage collection.

bool mark
node_list nodes
map< Node *, bool > deleted_nodes

Public Member Functions

 binaryNode (unsigned int op_id, exprNode *left, exprNode *right, const Coord coord=Coord::Unknown)
 Create a new binary expression.

virtual ~binaryNode ()
 Destroy a binaryNode.

virtual void eval ()
 Constant expression evaluator.

virtual void dataflow (FlowVal *v, FlowProblem &fp)
 Run the dataflow analyzer.

virtual Node * clone () const
 Clone the input node.

virtual void output_expr (output_context &ct, Node *par, int prec, Assoc assoc)
 Output a expression.

virtual int precedence (Assoc &assoc)
 Associativity and precedence.

virtual typeNode * base_type (bool TdefIndir) const
 Return the base data type of a node.

virtual bool is_lvalue ()
 Is l-value.

typeNode * no_tdef_type ()
virtual void output (output_context &ct, Node *par)
 Generate C code.

bool parens (int outer_prec, Assoc outer_assoc)
 Determine if parenthesis are needed.

typeNode * datatype () const
 Call base_type() with the argument true.

typeNode * datatype_superior () const
 Call base_type() with the argument false.

Accessors
Methods to get and set fields in the class.

Operator * op () const
void op (Operator *op)
exprNode * left () const
exprNode * get_left ()
void left (exprNode *left)
exprNode * right () const
exprNode * get_right ()
void right (exprNode *right)
AST Traversal
Methods to uniformly traverse the AST. See the documentation in the Node class.

virtual void visit (Visitor *the_visitor)
 Dispatch a Visitor.

virtual void walk (Walker &the_walker)
 Dispatch a Walker.

virtual Node * change (Changer &the_changer, bool redispatch=false)
 Dispatch a Changer.

Accessors
Methods to get and set fields in the class.

virtual typeNode * type () const
 Return the node data type.

virtual void type (typeNode *type)
typeNode * get_type ()
const constant & value () const
constant & value ()
void value (const constant &newval)
Accessors
Methods to get and set fields in the class.

NodeType typ () const
 Get the node type.

Coord coord () const
 Get the source location.

void coord (const Coord coord)
 Set the source location.

bool parenthesized () const
 Get the parenthesized boolean.

void parenthesized (bool paren)
 Set the parenthesized boolean.

annote_list & annotations ()
 Get the annotations list.

FlowVal * gen () const
 Get the "gen" flow value.

void gen (FlowVal *g)
 Set the "gen" flow value.

FlowVal * kill () const
 Get the "kill" flow value.

void kill (FlowVal *k)
 Set the "kill" flow value.


Static Public Member Functions

exprNode * integral_promotions (exprNode *old_expr)
 Add integral promotions.

pair< exprNode *, exprNode * > usual_arithmetic_conversions (exprNode *left, exprNode *right)
 Usual arithmetic conversions.

void report ()
 Report node count statistics.


Private Attributes

Operator * _op
 the operator

TREE exprNode * _left
 the left expression subtree

TREE exprNode * _right
 the right expression subtree

Detailed Description

Binary operator.

This class represents most expressions with two arguments (binary operator expressions). The only exception is the castNode, because it takes a type as an argument.

The indexNode class has been folded into the binaryNode class, so now array index expressions are represented as binary operations. The operator is Operator::Index. The left expression is the array and the right expression is the index. Note that multi-dimensional array access generates nested index operators, one for each dimension. The operator is left associative, so the tree for "A[2][7]" looks like this: indexNode [7] --> indexNode [2] --> idNode "A".

The NodeType is Binary.

Definition at line 3588 of file ast.h.

Constructor & Destructor Documentation

binaryNode::binaryNode (  unsigned int    op_id,
exprNode *    left,
exprNode *    right,
const Coord    coord = Coord::Unknown
) 
 

Create a new binary expression.

The new expression has the given operator, and left and right subexpressions. The operator is given using its identifier from the parser. For most operators, this is simply the char representation. For example, we pass '+' to get the addition operator. For ambiguous operators and multiple-character operators, you need to look up the proper identifier in the Operators table.

See also:
Operator

Operators

Operators::table

Parameters:
op_id the id of the operator (usually, just the char representation)
left the left expression subtree
right the right expression subtree
coord the location of the construct in the source file.

Definition at line 44 of file binarynode.cc.

References Binary.

Referenced by clone().

binaryNode::~binaryNode (    )  [virtual]
 

Destroy a binaryNode.

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

Definition at line 306 of file binarynode.cc.

Member Function Documentation

annote_list& Node::annotations (    )  [inline, inherited]
 

Get the annotations list.

This method returns a modifiable reference to the list of annotations on the node. Users can add new annotations, search for annotations, or remove annotations. Users are responsible for ensuring that every element of the annotation list points to a valid annotation. In particular, no element should be NULL.

See also:
Annote class

Definition at line 276 of file ast.h.

References annote_list.

typeNode * exprNode::base_type (  bool    TdefIndir )  const [virtual, inherited]
 

Return the base data type of a node.

This method differs from the Node::type() method in two respects. First, it follows some of the simple type inferences. For example, calling it on an idNode will return the type of its declaration. Second, the boolean argument indicates whether or not to follow typedef links.

Parameters:
TdefIndir pass true to follow typedefs to their definitions.

Reimplemented from Node.

Reimplemented in idNode, commaNode, and callNode.

Definition at line 69 of file exprnode.cc.

References typeNode::base_type(), and exprNode::type().

Referenced by exprstmtNode::base_type(), callNode::base_type(), and operandNode::noncast_type().

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

Implements Node.

Definition at line 250 of file binarynode.cc.

References Changer::at_binary(), Changer::Both, Node::change(), left(), Changer::order(), Changer::Order, Changer::Postorder, Changer::Preorder, right(), and exprNode::type().

virtual Node* binaryNode::clone (    )  const [inline, virtual]
 

Clone the input node.

This is not a "deep" clone, so be careful. For a deep clone, use the ref_clone_changer class.

Returns:
a shallow copy of the node (no subtrees are copied).

Implements Node.

Definition at line 3683 of file ast.h.

References binaryNode().

void Node::coord (  const Coord    coord )  [inline, inherited]
 

Set the source location.

This location should indicate the position in the source text that this Node represents, or Coord::Unknown if it does not represent any node in the source text.

It is not common to set the source location of a node. Currently, only the compiler error messages actually make use of it.

Parameters:
coord the new location.

Definition at line 245 of file ast.h.

Coord Node::coord (    )  const [inline, inherited]
 

Get the source location.

The Coord class holds a location in the input source (file, line, position). During parsing, each AST node created records the position of the source text that it represents. However, subsequent phases may create or change nodes, so no guarantee is given about how the source location corresponds to the original source text.

Returns:
the Coord structure indicating where the node came from in the source file.

Definition at line 232 of file ast.h.

Referenced by funcNode::add_parameter_types(), Unify_Structure::all_str(), Pointers::analyze_procedure(), semcheck_expr_visitor::at_binary(), id_lookup_walker::at_binary(), ExpressionDismantle::at_binary(), ArrowDismantle::at_binary(), SelectionDismantle::at_binary(), set_container_walker::at_break(), BreakContinueChanger::at_break(), UnificationBasedPtr::at_call(), semcheck_expr_visitor::at_call(), NodeLocator::at_call(), id_lookup_walker::at_call(), ExpressionDismantle::at_call(), set_container_walker::at_case(), constantsChanger::at_conditiongoto(), set_container_walker::at_continue(), BreakContinueChanger::at_continue(), NodeLocator::at_decl(), id_lookup_walker::at_decl(), InitializerDismantle::at_decl(), LoopDismantle::at_do(), enum_value_walker::at_enum(), NodeLocator::at_expr(), ExpressionDismantle::at_exprstmt(), LoopDismantle::at_for(), goto_label_walker::at_goto(), Linker::at_id(), id_lookup_walker::at_id(), SelectionDismantle::at_if(), goto_label_walker::at_label(), id_lookup_walker::at_proc(), ReturnDismantle::at_proc(), ReturnDismantle::at_return(), NodeLocator::at_stmt(), UnificationBasedPtr::at_suespec(), semcheck_walker::at_suespec(), SelectionDismantle::at_switch(), TernaryDismantle::at_ternary(), SizeofChanger::at_threeAddr(), AllocSizeChanger::at_unary(), ExpressionDismantle::at_unary(), LoopDismantle::at_while(), Pointers::call_operator(), semcheck_expr_visitor::check_binary(), semcheck_expr_visitor::check_unary(), UnificationBasedPtr::compatible_type(), procNode::define(), exprstmtNode::exprstmtNode(), typeNode::finish(), InitializerDismantle::init_array(), InitializerDismantle::init_scalar(), InitializerDismantle::init_struct(), function_inline::inliner(), exprNode::integral_promotions(), UnificationBasedPtr::make_compatible(), reachingDefinitionsWalker::make_ud_chains(), Unify_Structure::map_str(), primNode::merge_in(), metaexprNode::metaexprNode(), metastmtNode::metastmtNode(), vcgCCGWalker::node_label(), vcgASTWalker::node_label(), vcgCCGWalker::node_title(), vcgASTWalker::node_title(), DismantleUtil::Not(), Externals_table::notify_exit_scope(), Labels_table::notify_exit_scope(), Identifiers_table::notify_exit_scope(), Pointers::pass_parameters(), vcgCCGWalker::print_edge(), vcgASTWalker::print_edge(), vcgCCGWalker::print_node(), vcgASTWalker::print_node(), stmtLocation::print_path(), procNode::procNode(), NodeInfo::readCall(), NodeInfo::readDecl(), NodeInfo::readExprOrStmt(), NodeInfo::readsuef(), Pointers::record_external_inputs_and_outputs(), P::run(), Tags_table::shadow(), Identifiers_table::shadow(), memoryBlock::top_most_containers(), suespecNode::update(), exprNode::usual_arithmetic_conversions(), CBZ::WarnAboutPrecedence(), NodeInfo::writeDecl(), NodeInfo::writeExpr(), NodeInfo::writeProc(), NodeInfo::writeStmt(), and NodeInfo::writeType().

void binaryNode::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).

Implements Node.

Definition at line 146 of file binarynode.cc.

References Operator::ANDAND, FlowVal::clone(), Node::dataflow(), FlowProblem::flow_binary(), FlowProblem::forward(), Operator::id(), left(), FlowVal::meet(), op(), Operator::OROR, and right().

typeNode * Node::datatype (    )  const [inherited]
 

Call base_type() with the argument true.

Definition at line 157 of file node.cc.

References Node::base_type().

Referenced by funcNode::is_void_args().

typeNode * Node::datatype_superior (    )  const [inherited]
 

Call base_type() with the argument false.

Definition at line 162 of file node.cc.

References Node::base_type().

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

Implements exprNode.

Definition at line 83 of file binarynode.cc.

References exprNode::eval(), left(), op(), right(), and exprNode::value().

void Node::gen (  FlowVal *    g )  [inline, inherited]
 

Set the "gen" flow value.

This value is used in dataflow analyses to store information that is generated at this node. Note that each node has exactly one "gen" flow value.

In order to set the flow value to be empty, call this method with a value of NULL.

Parameters:
g the new gen flow value.

Definition at line 299 of file ast.h.

FlowVal* Node::gen (    )  const [inline, inherited]
 

Get the "gen" flow value.

This value is used in dataflow analyses to store information that is generated at this node. Note that each node has exactly one "gen" flow value.

Returns:
the "gen" flow value.

Definition at line 286 of file ast.h.

exprNode* binaryNode::get_left (    )  [inline]
 

Definition at line 3649 of file ast.h.

Referenced by semcheck_expr_visitor::at_binary().

exprNode* binaryNode::get_right (    )  [inline]
 

Definition at line 3653 of file ast.h.

Referenced by semcheck_expr_visitor::at_binary().

typeNode* exprNode::get_type (    )  [inline, inherited]
 

Definition at line 3252 of file ast.h.

Referenced by remove_stale_type_walker::at_expr().

exprNode * exprNode::integral_promotions (  exprNode *    old_expr )  [static, inherited]
 

Add integral promotions.

This method takes an expression and calls typeNode::integral_promotions() on its type to determine if any apply. If they do, it inserts an implicit castNode above the input expression that represents this implicit conversion.

See also:
castNode
Parameters:
old_expr the expression to perform integral promotion on
Returns:
the resulting expression, with a cast added if necessary

Definition at line 90 of file exprnode.cc.

References Node::coord(), typeNode::integral_promotions(), Operand, Node::typ(), and exprNode::type().

Referenced by semcheck_expr_visitor::at_binary(), semcheck_expr_visitor::check_binary(), and semcheck_expr_visitor::check_unary().

virtual bool exprNode::is_lvalue (    )  [inline, virtual, inherited]
 

Is l-value.

Indicates if the expression is an l-value (that is, the left side of an assignment).

Todo:
This doesn't work yet.
Returns:
true if the given expression is an l-value

Definition at line 3298 of file ast.h.

Referenced by semcheck_expr_visitor::check_binary(), and semcheck_expr_visitor::check_unary().

void Node::kill (  FlowVal *    k )  [inline, inherited]
 

Set the "kill" flow value.

This value is used in dataflow analyses to store information that is killed at this node. Note that each node has exactly one "kill" flow value.

To set the flow value to be empty, call this method with a value of NULL.

Parameters:
k the new kill flow value.

Definition at line 322 of file ast.h.

FlowVal* Node::kill (    )  const [inline, inherited]
 

Get the "kill" flow value.

This value is used in dataflow analyses to store information that is killed at this node. Note that each node has exactly one "kill" flow value.

Returns:
the "kill" flow value.

Definition at line 309 of file ast.h.

void binaryNode::left (  exprNode *    left )  [inline]
 

Definition at line 3650 of file ast.h.

exprNode* binaryNode::left (    )  const [inline]
 

Definition at line 3648 of file ast.h.

Referenced by vcgASTWalker::at_binary(), tree_visitor::at_binary(), TreeChecker::at_binary(), Assignment_walker::at_binary(), semcheck_expr_visitor::at_binary(), print_walker::at_binary(), print_tree_visitor::at_binary(), id_lookup_walker::at_binary(), ExpressionDismantle::at_binary(), ArrowDismantle::at_binary(), SelectionDismantle::at_if(), change(), dataflow(), eval(), DefUseWalker::get_def(), DefUseWalker::get_uses(), SSA::lhs(), LocalCopyPropChanger::local_copy_prop(), output_expr(), LocalCopyPropChanger::prop_expr(), SSA::search(), and walk().

typeNode* exprNode::no_tdef_type (    )  [inline, inherited]
 

Definition at line 3300 of file ast.h.

References typeNode::follow_tdefs(), and exprNode::type().

Referenced by semcheck_expr_visitor::at_binary(), id_lookup_walker::at_binary(), semcheck_expr_visitor::at_call(), semcheck_expr_visitor::check_binary(), semcheck_expr_visitor::check_unary(), Pointers::determine_call_targets(), and InitializerDismantle::eval_or_cast().

void binaryNode::op (  Operator *    op )  [inline]
 

Definition at line 3646 of file ast.h.

Operator* binaryNode::op (    )  const [inline]
 

Definition at line 3645 of file ast.h.

Referenced by SSA::assignment(), vcgASTWalker::at_binary(), TreeChecker::at_binary(), Assignment_walker::at_binary(), semcheck_expr_visitor::at_binary(), print_walker::at_binary(), print_tree_visitor::at_binary(), id_lookup_walker::at_binary(), ExpressionDismantle::at_binary(), ArrowDismantle::at_binary(), SelectionDismantle::at_binary(), SelectionDismantle::at_if(), dataflow(), eval(), DefUseWalker::get_def(), DefUseWalker::get_uses(), LocalCopyPropChanger::local_copy_prop(), DismantleUtil::Not(), output_expr(), precedence(), LocalCopyPropChanger::prop_expr(), and walk().

void exprNode::output (  output_context &    ct,
Node *    par
)  [virtual, inherited]
 

Generate C code.

Each subclass overrides this method to define how to produce the output C code. To use this method, pass an output_context and a null parent.

Parameters:
ct the output context which describes the formatting.
par the parent node (or null, if at the top of a subtree).

Implements Node.

Definition at line 158 of file exprnode.cc.

References exprNode::output_expr().

Referenced by ExpressionDismantle::at_binary(), constantsChanger::at_id(), subdeclNode::output(), declNode::output(), operandNode::output_expr(), output_expr(), whileNode::output_stmt(), threeAddrNode::output_stmt(), switchNode::output_stmt(), returnNode::output_stmt(), ifNode::output_stmt(), forNode::output_stmt(), exprstmtNode::output_stmt(), doNode::output_stmt(), conditiongotoNode::output_stmt(), caseNode::output_stmt(), and arrayNode::output_type().

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

Output a expression.

Implements exprNode.

Definition at line 213 of file binarynode.cc.

References Operator::id(), Operator::Index, left(), op(), exprNode::output(), exprNode::output_expr(), exprNode::parens(), Operator::print(), and right().

bool exprNode::parens (  int    outer_prec,
Assoc    outer_assoc
)  [inherited]
 

Determine if parenthesis are needed.

This method takes the associativity and precedence values of the enclosing expression and determines if parentheses are needed.

See also:
exprNode::output_expr()

exprNode::precedence()

Parameters:
outer_prec the precedence value of the enclosing expression
outer_assoc the associativity value of the enclosing expression
Returns:
true if parentheses are needed.

Definition at line 136 of file exprnode.cc.

References Assoc, Node::parenthesized(), and exprNode::precedence().

Referenced by unaryNode::output_expr(), ternaryNode::output_expr(), metaexprNode::output_expr(), initializerNode::output_expr(), idNode::output_expr(), constNode::output_expr(), commaNode::output_expr(), castNode::output_expr(), callNode::output_expr(), and output_expr().

void Node::parenthesized (  bool    paren )  [inline, inherited]
 

Set the parenthesized boolean.

This boolean determines whether this expression will be parenthesized in the output. Note that that the parentheses will always be added when they are needed to disambiguate the output. This variable only controls the use of "un-necessary" parentheses.

Parameters:
paren the new value of the parenthesized boolean.

Definition at line 264 of file ast.h.

bool Node::parenthesized (    )  const [inline, inherited]
 

Get the parenthesized boolean.

Returns:
true if the construct corresponding to this Node was parenthesized in the source.

Definition at line 252 of file ast.h.

Referenced by exprNode::parens(), and CBZ::WarnAboutPrecedence().

int binaryNode::precedence (  Assoc &    assoc )  [virtual]
 

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.

See also:
exprNode::output_expr()

exprNode::parens()

Parameters:
assoc a reference parameter that is set to the associativity value
Returns:
the precedence value

Reimplemented from exprNode.

Definition at line 69 of file binarynode.cc.

References Operator::binary_prec(), Operator::is_left_assoc(), Left, op(), and Right.

void Node::report (    )  [static, inherited]
 

Report node count statistics.

The code can be configured to gather statistics about node usage according to type. This method prints the current state of that accounting information to standard out.

Definition at line 184 of file node.cc.

References Node::_count, Node::_t_count, Array, Attrib, Binary, Block, Break, Call, Case, Cast, Comma, Const, Continue, Decl, Do, Enum, Expr, For, Func, Goto, Id, If, Initializer, Label, Prim, Proc, Ptr, Return, Struct, sueSpec, Switch, Tdef, Ternary, Text, Unary, Undeclared, Union, and While.

void binaryNode::right (  exprNode *    right )  [inline]
 

Definition at line 3654 of file ast.h.

exprNode* binaryNode::right (    )  const [inline]
 

Definition at line 3652 of file ast.h.

Referenced by vcgASTWalker::at_binary(), tree_visitor::at_binary(), TreeChecker::at_binary(), semcheck_expr_visitor::at_binary(), print_walker::at_binary(), print_tree_visitor::at_binary(), id_lookup_walker::at_binary(), gcWalker::at_binary(), ExpressionDismantle::at_binary(), ArrowDismantle::at_binary(), SelectionDismantle::at_if(), change(), dataflow(), eval(), DefUseWalker::get_def(), DefUseWalker::get_uses(), LocalCopyPropChanger::local_copy_prop(), output_expr(), SSA::phi(), LocalCopyPropChanger::prop_expr(), SSA::search(), and walk().

NodeType Node::typ (    )  const [inline, inherited]
 

Get the node type.

This has nothing to do with types in the source code. It indicates what kind of AST node this is (e.g., a unary expression node or a while node).

Returns:
the node type.

Definition at line 218 of file ast.h.

References NodeType.

Referenced by declNode::add_parameter_types(), Pointers::analyze_procedure(), SSA::assignment(), Pointers::assignment_operator(), Assignment_walker::at_binary(), semcheck_expr_visitor::at_binary(), id_lookup_walker::at_binary(), ExpressionDismantle::at_binary(), constantAnalyzer::at_binary(), UnificationBasedPtr::at_call(), TreeChecker::at_call(), semcheck_expr_visitor::at_call(), NodeLocator::at_call(), Linker::at_call(), id_lookup_walker::at_call(), ExpressionDismantle::at_call(), ExpressionDismantle::at_cast(), constantAnalyzer::at_cast(), ExpressionDismantle::at_comma(), constantFoldingChanger::at_conditiongoto(), constantPropChanger::at_conditiongoto(), constantAnalyzer::at_const(), vcgASTWalker::at_decl(), UnificationBasedPtr::at_decl(), name_mangle_walker::at_decl(), AllocToMemWalker::at_decl(), id_lookup_walker::at_decl(), InitializerDismantle::at_decl(), remove_stale_type_walker::at_expr(), NodeLocator::at_expr(), constantPropChanger::at_expr(), FlattenDismantle::at_goto(), Linker::at_id(), callGraph::at_id(), CFS_Changer::at_if(), UnificationBasedPtr::at_initializer(), TreeChecker::at_label(), FlattenDismantle::at_label(), UnificationBasedPtr::at_proc(), LivenessWalker::at_proc(), FlattenDismantle::at_proc(), DefUseWalker::at_proc(), cfg_changer::at_proc(), unreachableCodeRemover::at_proc(), TreeChecker::at_return(), constantAnalyzer::at_sizeof(), NodeLocator::at_stmt(), print_walker::at_sue(), print_tree_visitor::at_sue(), vcgCCGWalker::at_threeAddr(), Linker::at_threeAddr(), identify_inlinees::at_threeAddr(), function_inline::at_threeAddr(), W::at_type(), ExpressionDismantle::at_unary(), fixPointerWalker::at_unary(), constantAnalyzer::at_unary(), callNode::base_type(), NodeInfo::canonical(), ipConstant::cast_operator(), semcheck_expr_visitor::check_binary(), semcheck_expr_visitor::check_unary(), UnificationBasedPtr::compatible_type(), memoryModel::create_memory_object(), UnificationBasedPtr::create_synthetic_proc(), NodeInfo::def_type(), gcWalker::delete_nodes(), Pointers::determine_call_targets(), DFPreds::DFPreds(), DominanceFrontiers::DominanceFrontiers(), memoryBlock::dot(), Pointers::dot_operator(), UnificationBasedPtr::ecr1(), typeNode::equal_to(), Pointers::eval(), castNode::eval(), typeNode::finish(), typeNode::follow_tdefs(), memoryModel::generate_array_elements_for(), DefUseWalker::get_def(), DefUseWalker::get_uses(), Register::getRegRetVal(), NodeInfo::getType(), memoryModel::initialize_struct(), function_inline::inliner(), typeNode::integral_promotions(), exprNode::integral_promotions(), labelNode::is_undeclared(), UnificationBasedPtr::is_va_list(), Pointers::is_va_list(), SSA::lhs(), Linker::link(), lir_gen_walker::load_global_value(), lir_gen_walker::load_stack_value(), LocalCopyPropChanger::local_copy_prop(), memoryModel::lookup_variable(), arch_info::make_template_replacements(), reachingDefinitionsWalker::make_ud_chains(), SSA::need_ssa(), vcgCCGWalker::node_label(), vcgCCGWalker::node_name(), vcgASTWalker::node_name(), vcgCCGWalker::node_title(), NodeInfo::nodeIndex(), operandNode::noncast_type(), DismantleUtil::Not(), Externals_table::notify_exit_scope(), Identifiers_table::notify_exit_scope(), stmtNode::output(), operandNode::output_expr(), blockNode::output_stmt(), sueNode::output_type(), ptrNode::output_type(), Pointers::pass_parameters(), SSA::phi(), SSA::place_one_phi(), vcgASTWalker::print_edge(), vcgCCGWalker::print_node(), vcgASTWalker::print_node(), procedureInfo::procedureInfo(), procNode::procNode(), LocalCopyPropChanger::prop(), LocalCopyPropChanger::prop_expr(), arrayNode::qualified_equal_to(), NodeInfo::readCall(), NodeInfo::readDecl(), NodeInfo::readExprOrStmt(), NodeInfo::readProc(), NodeInfo::readsuef(), NodeInfo::readType(), Unreachable::remove(), P::run(), dfpreds_phase::run(), ssa_phase::run(), pointers_phase::run(), SSA::search(), sueNode::set_name_fields(), Register::setType(), Unify_Size::sizeOf(), Unify_Size::sizeOfAssign(), SSA::SSA(), Pointers::star_operator(), lir_gen_walker::store_global(), lir_gen_walker::store_stack(), Pointers::struct_union_assignment(), blockNode::toBlock(), memoryBlock::top_most_containers(), P::type_name(), NodeInfo::type_name(), Unify_ECR::Unify_ECR(), typeNode::unwind_tdefs(), suespecNode::update(), typeNode::usual_arithmetic_conversions(), exprNode::usual_arithmetic_conversions(), walk(), CBZ::WarnAboutPrecedence(), NodeInfo::writeCall(), NodeInfo::writeExpr(), NodeInfo::writeProc(), NodeInfo::writeStmt(), and NodeInfo::writeType().

virtual void exprNode::type (  typeNode *    type )  [inline, virtual, inherited]
 

Reimplemented in operandNode.

Definition at line 3253 of file ast.h.

virtual typeNode* exprNode::type (    )  const [inline, virtual, inherited]
 

Return the node data type.

This method returns the C data type of a node. Several different kinds of nodes contain typeNode pointers. This method is just a unified way to access them. It does not attempt to compute the type, it just returns whatever typeNode pointer resides on the node. The subclasses that have types return them, and the others return null.

Returns:
the typeNode pointer on the node.

Reimplemented from Node.

Reimplemented in operandNode.

Definition at line 3251 of file ast.h.

Referenced by vcgASTWalker::at_binary(), tree_visitor::at_binary(), semcheck_expr_visitor::at_binary(), id_lookup_walker::at_binary(), ExpressionDismantle::at_binary(), ArrowDismantle::at_binary(), SelectionDismantle::at_binary(), vcgASTWalker::at_call(), tree_visitor::at_call(), semcheck_expr_visitor::at_call(), ExpressionDismantle::at_call(), vcgASTWalker::at_cast(), tree_visitor::at_cast(), ExpressionDismantle::at_cast(), vcgASTWalker::at_comma(), tree_visitor::at_comma(), semcheck_expr_visitor::at_comma(), vcgASTWalker::at_const(), tree_visitor::at_const(), constantAnalyzer::at_const(), vcgASTWalker::at_id(), tree_visitor::at_id(), semcheck_expr_visitor::at_id(), SelectionDismantle::at_if(), vcgASTWalker::at_initializer(), UnificationBasedPtr::at_initializer(), tree_visitor::at_initializer(), ReturnDismantle::at_return(), SelectionDismantle::at_switch(), vcgASTWalker::at_ternary(), tree_visitor::at_ternary(), semcheck_expr_visitor::at_ternary(), TernaryDismantle::at_ternary(), vcgASTWalker::at_unary(), tree_visitor::at_unary(), semcheck_expr_visitor::at_unary(), ExpressionDismantle::at_unary(), exprNode::base_type(), unaryNode::change(), ternaryNode::change(), metaexprNode::change(), initializerNode::change(), idNode::change(), constNode::change(), commaNode::change(), castNode::change(), callNode::change(), change(), semcheck_expr_visitor::check_binary(), semcheck_expr_visitor::check_unary(), SelectionDismantle::comparison_operand(), constNode::constNode(), idNode::decl(), castNode::eval(), CBZ::get_temp_var(), InitializerDismantle::init_scalar(), exprNode::integral_promotions(), lir_gen_walker::load_const(), lir_gen_walker::load_global_value(), lir_gen_walker::load_global_var(), lir_gen_walker::load_stack_value(), lir_gen_walker::load_stack_var(), exprNode::no_tdef_type(), DismantleUtil::Not(), castNode::output_expr(), SSA::place_one_phi(), lir_gen_walker::store_global(), lir_gen_walker::store_stack(), InitializerDismantle::strLit2Init(), exprNode::usual_arithmetic_conversions(), constNode::usual_unary_conversion_type(), unaryNode::walk(), ternaryNode::walk(), metaexprNode::walk(), initializerNode::walk(), idNode::walk(), constNode::walk(), commaNode::walk(), castNode::walk(), callNode::walk(), and walk().

pair< exprNode *, exprNode * > exprNode::usual_arithmetic_conversions (  exprNode *    left,
exprNode *    right
)  [static, inherited]
 

Usual arithmetic conversions.

This method takes two expressions and adds any casts that are necessary to make them compatible for arithmetic operations. It calls typeNode::usual_arithmetic_conversions(), passing the types of the expressions, to determine when the casts are needed. It inserts implicit castNode objects above the expressions for the casts.

See also:
castNode
Parameters:
left the left-hand expression
right the right-hand expression
Returns:
the left and right expressions, possibly with casts added

Definition at line 103 of file exprnode.cc.

References Node::coord(), Operand, Node::typ(), exprNode::type(), and typeNode::usual_arithmetic_conversions().

Referenced by semcheck_expr_visitor::check_binary().

void exprNode::value (  const constant &    newval )  [inline, inherited]
 

Definition at line 3257 of file ast.h.

constant& exprNode::value (    )  [inline, inherited]
 

Definition at line 3256 of file ast.h.

const constant& exprNode::value (    )  const [inline, inherited]
 

Definition at line 3255 of file ast.h.

Referenced by UnificationBasedPtr::alpha(), AllocSizeChanger::at_array(), TreeChecker::at_case(), constantFoldingChanger::at_conditiongoto(), constantsChanger::at_conditiongoto(), TreeChecker::at_const(), constantAnalyzer::at_const(), TreeChecker::at_decl(), enum_value_walker::at_enum(), ipConstantsChanger::at_expr(), constantsChanger::at_id(), CFS_Changer::at_if(), UnificationBasedPtr::at_initializer(), semcheck_walker::at_suespec(), constantFoldingChanger::at_threeAddr(), constantsChanger::at_threeAddr(), constNode::constNode(), unaryNode::eval(), ternaryNode::eval(), Pointers::eval(), operandNode::eval(), initializerNode::eval(), idNode::eval(), commaNode::eval(), castNode::eval(), callNode::eval(), eval(), InitializerDismantle::eval_or_cast(), lir_gen_walker::index_offset(), InitializerDismantle::init_array(), InitializerDismantle::isStringLiteral(), lir_gen_walker::load_const(), ipConstantPropagation::lookup(), constNode::output_expr(), arrayNode::qualified_equal_to(), and constantAnalyzer::rebuild_flowvalue().

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

Implements Node.

Definition at line 101 of file binarynode.cc.

References Visitor::at_binary().

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

Implements Node.

Definition at line 106 of file binarynode.cc.

References Operator::ARROW, Walker::at_binary(), Walker::Both, Walker::depth(), Id, Operator::id(), left(), op(), Walker::order(), Walker::Order, Walker::Postorder, Walker::Preorder, right(), Walker::Subtree, Node::typ(), exprNode::type(), and Node::walk().

Member Data Documentation

TREE exprNode* binaryNode::_left [private]
 

the left expression subtree

Definition at line 3604 of file ast.h.

Operator* binaryNode::_op [private]
 

the operator

The operator object actually resides the Operators table.

See also:
Operator

Operators

Definition at line 3600 of file ast.h.

TREE exprNode* binaryNode::_right [private]
 

the right expression subtree

Definition at line 3608 of file ast.h.

map< Node *, bool > Node::deleted_nodes [static, inherited]
 

Definition at line 116 of file node.cc.

Referenced by gcWalker::delete_nodes(), and Node::~Node().

bool Node::mark [inherited]
 

Definition at line 170 of file ast.h.

Referenced by gcWalker::at_binary(), gcWalker::at_node(), gcWalker::delete_nodes(), and SymbolTable< T >::mark_nodes().

node_list Node::nodes [static, inherited]
 

Definition at line 115 of file node.cc.

Referenced by gcWalker::delete_nodes(), gcWalker::gcWalker(), and Node::Node().

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

Generated on August 27, 2003
Back to the C-Breeze home page