Main Page Modules Namespace List Class Hierarchy Alphabetical List Compound List File List Namespace Members Compound Members File Members Related Pages
whileNode Class Reference
[The AST nodes]
While loop statement.
More...
#include <ast.h>
Inheritance diagram for whileNode:
List of all members.
Detailed Description
While loop statement.
This class represents the while loop statement (condition at the top of the loop).
This NodeType is While.
Definition at line 5417 of file ast.h.
Constructor & Destructor Documentation
|
Create a new while loop.
The new while loop has the given condition expression and body.
- Parameters:
-
cond | the loop condition |
body | the loop body |
coord | the location of the construct in the source file. |
Definition at line 44 of file whilenode.cc.
References While.
Referenced by clone(). |
whileNode::~whileNode |
( |
|
) |
[virtual] |
|
|
Destroy a whileNode.
- Warning:
- Do not use the destructors to delete AST nodes. Instead, rely on the node garbage collector.
Definition at line 244 of file whilenode.cc. |
Member Function Documentation
|
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. |
void stmtNode::at_exit |
( |
FlowVal * |
ae |
) |
[inline, inherited] |
|
FlowVal* stmtNode::at_exit |
( |
|
) |
const [inline, inherited] |
|
void loopNode::at_loop_head |
( |
FlowVal * |
ae |
) |
[inline, inherited] |
|
FlowVal* loopNode::at_loop_head |
( |
|
) |
const [inline, inherited] |
|
void loopNode::at_loop_tail |
( |
FlowVal * |
ae |
) |
[inline, inherited] |
|
FlowVal* loopNode::at_loop_tail |
( |
|
) |
const [inline, inherited] |
|
typeNode * Node::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 in declNode, procNode, typeNode, tdefNode, exprNode, idNode, commaNode, callNode, blockNode, and exprstmtNode.
Definition at line 152 of file node.cc.
Referenced by Node::datatype(), and Node::datatype_superior(). |
void loopNode::body |
( |
blockNode * |
body |
) |
[inline, inherited] |
|
blockNode* loopNode::body |
( |
|
) |
const [inline, inherited] |
|
|
Definition at line 5394 of file ast.h.
Referenced by vcgASTWalker::at_do(), tree_visitor::at_do(), print_walker::at_do(), print_tree_visitor::at_do(), LoopDismantle::at_do(), vcgASTWalker::at_for(), tree_visitor::at_for(), TreeChecker::at_for(), print_walker::at_for(), print_tree_visitor::at_for(), LoopDismantle::at_for(), TreeChecker::at_loop(), vcgASTWalker::at_while(), tree_visitor::at_while(), print_walker::at_while(), print_tree_visitor::at_while(), LoopDismantle::at_while(), change(), forNode::change(), doNode::change(), dataflow(), forNode::dataflow(), doNode::dataflow(), output_stmt(), forNode::output_stmt(), doNode::output_stmt(), walk(), forNode::walk(), and doNode::walk(). |
Node * whileNode::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 198 of file whilenode.cc.
References Changer::at_while(), loopNode::body(), Changer::Both, blockNode::change(), Node::change(), loopNode::cond(), Changer::order(), Changer::Order, Changer::Postorder, and Changer::Preorder. |
virtual Node* whileNode::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 5459 of file ast.h.
References whileNode(). |
string& stmtNode::comment |
( |
|
) |
[inline, inherited] |
|
void loopNode::cond |
( |
exprNode * |
cond |
) |
[inline, inherited] |
|
exprNode* loopNode::cond |
( |
|
) |
const [inline, inherited] |
|
|
Definition at line 5390 of file ast.h.
Referenced by vcgASTWalker::at_do(), tree_visitor::at_do(), print_walker::at_do(), print_tree_visitor::at_do(), LoopDismantle::at_do(), vcgASTWalker::at_for(), tree_visitor::at_for(), TreeChecker::at_for(), semcheck_walker::at_for(), print_walker::at_for(), print_tree_visitor::at_for(), LoopDismantle::at_for(), TreeChecker::at_loop(), semcheck_walker::at_loop(), vcgASTWalker::at_while(), tree_visitor::at_while(), print_walker::at_while(), print_tree_visitor::at_while(), LoopDismantle::at_while(), change(), forNode::change(), doNode::change(), dataflow(), forNode::dataflow(), doNode::dataflow(), output_stmt(), forNode::output_stmt(), doNode::output_stmt(), walk(), forNode::walk(), and doNode::walk(). |
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:
-
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(). |
|
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 82 of file whilenode.cc.
References stmtNode::at_exit(), loopNode::at_loop_head(), loopNode::at_loop_tail(), FlowProblem::basicblocks(), loopNode::body(), FlowVal::clone(), loopNode::cond(), blockNode::dataflow(), Node::dataflow(), FlowProblem::flow_basicblock(), FlowProblem::flow_while(), FlowProblem::forward(), FlowVal::meet(), FlowVal::meet_and_diff(), and FlowVal::to_top(). |
typeNode * Node::datatype |
( |
|
) |
const [inherited] |
|
typeNode * Node::datatype_superior |
( |
|
) |
const [inherited] |
|
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. |
blockNode* loopNode::get_body |
( |
|
) |
[inline, inherited] |
|
exprNode* loopNode::get_cond |
( |
|
) |
[inline, inherited] |
|
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. |
|
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 55 of file stmtnode.cc.
References Block, output_context::new_line(), stmtNode::output_comment(), stmtNode::output_stmt(), and Node::typ().
Referenced by Pointers::analyze_procedure(), deadcodeChanger::at_threeAddr(), procedureInfo::block_position(), procNode::output(), output_stmt(), switchNode::output_stmt(), loopTreeNode::output_stmt(), labelNode::output_stmt(), ifNode::output_stmt(), forNode::output_stmt(), doNode::output_stmt(), caseNode::output_stmt(), precisionAnalyzer::record(), and precisionAnalyzer::report(). |
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] |
|
text_list& stmtNode::pragmas |
( |
|
) |
[inline, inherited] |
|
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. |
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(), binaryNode::walk(), CBZ::WarnAboutPrecedence(), NodeInfo::writeCall(), NodeInfo::writeExpr(), NodeInfo::writeProc(), NodeInfo::writeStmt(), and NodeInfo::writeType(). |
virtual typeNode* Node::type |
( |
|
) |
const [inline, virtual, inherited] |
|
void whileNode::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 52 of file whilenode.cc.
References Visitor::at_while(). |
void whileNode::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 57 of file whilenode.cc.
References Walker::at_while(), loopNode::body(), Walker::Both, loopNode::cond(), Walker::depth(), Walker::order(), Walker::Order, Walker::Postorder, Walker::Preorder, Walker::Subtree, blockNode::walk(), and Node::walk(). |
Member Data Documentation
map< Node *, bool > Node::deleted_nodes [static, inherited]
|
|
bool Node::mark [inherited]
|
|
The documentation for this class was generated from the following files:
|