C-Breeze C Compiler Infrastructure [ Project home page]

basicblockNode Class Reference [The AST nodes] Basic block. More... #include <ast.h> Inheritance diagram for basicblockNode: List of all members. Garbage collection. bool  mark node_list  nodes map< Node *, bool >  deleted_nodes Public Member Functions   basicblockNode (decl_list *decls, stmt_list *stmts, const Coord left_coord=Coord::Unknown, const Coord right_brace=Coord::Unknown)   Create a new basic block. virtual  ~basicblockNode ()   Destroy a basicblockNode. virtual Node *  clone () const   Clone the input node. typeNode *  base_type (bool TdefIndir) const   Return the base data type of a node. virtual void  dataflow (FlowVal *v, FlowProblem &fp)   Run the dataflow analyzer. virtual void  output_stmt (output_context &ct, Node *par)   Output a statement. virtual void  output (output_context &ct, Node *par)   Generate C code. void  output_comment (output_context &ct) virtual typeNode *  type () const   Return the node data type. 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. basicblock_list &  preds () const basicblock_list &  preds () const basicblock_list &  succs () const basicblock_list &  succs () const basicblockNode *  parent () const void  parent (basicblockNode *par) basicblock_list &  children () const basicblock_list &  children () const algorithm_info *  info () const void  info (algorithm_info *i) int  dfn () const void  dfn (int d) FlowVal *  at_entry () const void  at_entry (FlowVal *ae) FlowVal *  at_exit () const void  at_exit (FlowVal *ae) 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. decl_list &  decls () const decl_list &  decls () const stmt_list &  stmts () const stmt_list &  stmts () const Coord  right_brace () const void  right_brace (const Coord right_brace) Accessors Methods to get and set fields in the class. string &  comment () text_list &  pragmas () 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 blockNode *  toBlock (stmtNode *stmt, Coord coord)   Convert to block. void  report ()   Report node count statistics. Private Attributes basicblock_list  _preds   the control-flow predecessors basicblock_list  _succs   the control-flow successors basicblockNode *  _parent   the parent in the dominator tree basicblock_list  _children   the children in the dominator tree algorithm_info *  _info   algorithm info int  _dfn   depth-first numbering FlowVal *  _at_entry   dataflow analysis entry value FlowVal *  _at_exit   dataflow analysis exit value Detailed Description Basic block. This subclass of blockNode represents code in basic block form to support the construction of a control-flow graph and algorithms based on that graph. Initial parsing does not produce this form. To convert the AST into a control-flow graph, first dismantle the code (using the Dismantle class) then invoke the control-flow graph algorithm (using the cfg_changer). This form also supports several other analysis algorithms, such as dominators (using the Dominators class), dominance frontiers (using the DominanceFrontiers class) and pointer analysis (using the Pointers class). Each basicblockNode has added fields for specifying control-flow predecessors and successors, as well as fields for representing a dominator tree. The NodeType is Block (from the superclass) See also: Dismantle cfg_changer Dominators DominanceFrontiers Pointers Definition at line 4571 of file ast.h. Constructor & Destructor Documentation basicblockNode::basicblockNode (  decl_list *    decls, stmt_list *    stmts, const Coord    left_coord = Coord::Unknown, const Coord    right_brace = Coord::Unknown )    Create a new basic block. The basic block has the given declarations and statements (see the constructor for blockNode). By default, all the lists are empty, and the other references are null. Parameters: decls  the list of declarations stmts  the list of statements coord  the location of the left curly brace in the source file. coord  the location of the right curly brace in the source file. Definition at line 43 of file basicblocknode.cc. Referenced by clone(). basicblockNode::~basicblockNode (    )  [virtual]   Destroy a basicblockNode. Warning: Do not use the destructors to delete AST nodes. Instead, rely on the node garbage collector. Definition at line 60 of file basicblocknode.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. void basicblockNode::at_entry (  FlowVal *    ae )  [inline]   Definition at line 4678 of file ast.h. FlowVal* basicblockNode::at_entry (    )  const [inline]   Definition at line 4677 of file ast.h. void basicblockNode::at_exit (  FlowVal *    ae )  [inline]   Reimplemented from stmtNode. Definition at line 4681 of file ast.h. FlowVal* basicblockNode::at_exit (    )  const [inline]   Reimplemented from stmtNode. Definition at line 4680 of file ast.h. typeNode * blockNode::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. Definition at line 83 of file blocknode.cc. Node * basicblockNode::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 blockNode. Definition at line 86 of file basicblocknode.cc. References Changer::at_basicblock(), Changer::Both, change_list(), blockNode::decls(), Changer::order(), Changer::Order, Changer::Postorder, Changer::Preorder, and blockNode::stmts(). const basicblock_list& basicblockNode::children (    )  const [inline]   Definition at line 4667 of file ast.h. References basicblock_list. basicblock_list& basicblockNode::children (    )  [inline]   Definition at line 4666 of file ast.h. References basicblock_list. Referenced by Pointers::analyze_procedure(), DominanceFrontiers::compute_dominance_frontiers(), DFPreds::compute_dominance_frontiers(), procedureInfo::dfs_dominators(), Dominators::dominator_tree(), and SSA::search(). virtual Node* basicblockNode::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). Reimplemented from blockNode. Definition at line 4700 of file ast.h. References basicblockNode(). Referenced by reachingDefinitionsWalker::at_basicblock(), and reachingDefinitionsWalker::at_proc(). string& stmtNode::comment (    )  [inline, inherited]   Definition at line 4368 of file ast.h. Referenced by DefUseWalker::at_basicblock(), reachingGenKillWalker::at_proc(), copyPropChanger::at_proc(), deadcodeChanger::at_threeAddr(), LivenessComments::comment_stmt(), loopTree::depthFirstSearch(), loopTree::findBody(), stmtNode::output_comment(), and Dominators::print(). 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 blockNode::dataflow (  FlowVal *    v, FlowProblem &    fp )  [virtual, inherited]   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 120 of file blocknode.cc. References dataflow_forward_list(), dataflow_reverse_list(), blockNode::decls(), FlowProblem::flow_block(), FlowProblem::forward(), and blockNode::stmts(). Referenced by whileNode::dataflow(), switchNode::dataflow(), procNode::dataflow(), labelNode::dataflow(), ifNode::dataflow(), forNode::dataflow(), doNode::dataflow(), and caseNode::dataflow(). 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(). const decl_list& blockNode::decls (    )  const [inline, inherited]   Definition at line 4504 of file ast.h. References decl_list. decl_list& blockNode::decls (    )  [inline, inherited]   Definition at line 4503 of file ast.h. References decl_list. Referenced by print_walker::at_basicblock(), ExpressionDismantle::at_binary(), vcgASTWalker::at_block(), tree_visitor::at_block(), print_walker::at_block(), print_tree_visitor::at_block(), ExpressionDismantle::at_call(), StaticToGlobalDismantle::at_decl(), FlattenDismantle::at_decl(), SelectionDismantle::at_if(), LabelDismantle::at_label(), LivenessWalker::at_proc(), ReturnDismantle::at_proc(), UnusedDeclarationCleanupChanger::at_proc(), SelectionDismantle::at_switch(), ExpressionDismantle::at_unary(), blockNode::change(), change(), blockNode::dataflow(), CBZ::get_temp_var(), function_inline::inliner(), blockNode::output_stmt(), SSA::rename_all_variables(), Pointers::setup_va_list_variables(), blockNode::walk(), and walk(). void basicblockNode::dfn (  int    d )  [inline]   Definition at line 4673 of file ast.h. int basicblockNode::dfn (    )  const [inline]   Definition at line 4672 of file ast.h. Referenced by DominanceFrontiers::compute_dominance_frontiers(), DominanceFrontiers::depth_first_search(), DFPreds::depth_first_search(), memoryBlock::merge_uses_at(), SSA::place_phi_functions(), Dominators::print(), stmtLocation::print_callsite(), basicblockLocation::print_path(), loopTreeNode::report(), and procedureInfo::update_conditional_worklist(). 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. void basicblockNode::info (  algorithm_info *    i )  [inline]   Definition at line 4670 of file ast.h. algorithm_info* basicblockNode::info (    )  const [inline]   Definition at line 4669 of file ast.h. Referenced by Dominators::depth_first_search(), Dominators::Dominators(), and SSA::SSA(). 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 stmtNode::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 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(), whileNode::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 stmtNode::output_comment (  output_context &    ct )  [inherited]   Definition at line 65 of file stmtnode.cc. References stmtNode::comment(), output_context::indent_in(), output_context::indent_out(), and output_context::new_line(). Referenced by stmtNode::output(), and blockNode::output_stmt(). void blockNode::output_stmt (  output_context &    ct, Node *    par )  [virtual, inherited]   Output a statement. Implements stmtNode. Definition at line 144 of file blocknode.cc. References Block, CBZ::current_unit, blockNode::decls(), unitNode::enter_scope(), unitNode::exit_scope(), If, output_context::indent_in(), output_context::indent_out(), output_context::new_line(), NodeType, stmtNode::output_comment(), output_list(), Proc, blockNode::stmts(), suespec_list_p, unitNode::suespecs(), unitNode::symbol_level(), and Node::typ(). void basicblockNode::parent (  basicblockNode *    par )  [inline]   Definition at line 4664 of file ast.h. basicblockNode* basicblockNode::parent (    )  const [inline]   Definition at line 4663 of file ast.h. Referenced by loopTree::commonDominator(), Dominators::dominates(), Dominators::dominator_tree(), Dominators::print(), and procLocation::procLocation(). 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(). text_list& stmtNode::pragmas (    )  [inline, inherited]   Definition at line 4377 of file ast.h. References text_list. const basicblock_list& basicblockNode::preds (    )  const [inline]   Definition at line 4658 of file ast.h. References basicblock_list. basicblock_list& basicblockNode::preds (    )  [inline]   Definition at line 4657 of file ast.h. References basicblock_list. Referenced by procedureInfo::add_reachable_blocks_rec(), reachingGenKillWalker::at_basicblock(), reachingDefinitionsWalker::at_proc(), cfg_changer::at_proc(), Dominators::dominator_tree(), loopTree::findBody(), unreachableCodeRemover::fixup_preds(), orderedUses::make_merge_uses_at(), memoryBlock::merge_uses_at(), SSA::place_one_phi(), Dominators::print(), Unreachable::remove_unreachable(), procedureInfo::reverse_post_order(), copyPropChanger::solve_global_dataflow(), and SSA::which_pred(). 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 blockNode::right_brace (  const Coord    right_brace )  [inline, inherited]   Definition at line 4510 of file ast.h. Coord blockNode::right_brace (    )  const [inline, inherited]   Definition at line 4509 of file ast.h. const stmt_list& blockNode::stmts (    )  const [inline, inherited]   Definition at line 4507 of file ast.h. References stmt_list. stmt_list& blockNode::stmts (    )  [inline, inherited]   Definition at line 4506 of file ast.h. References stmt_list. Referenced by SSA::add_phi_function(), Pointers::analyze_procedure(), SelectionDismantle::andand_oror_in_expr(), reachingDefinitionsWalker::at_basicblock(), reachingGenKillWalker::at_basicblock(), print_walker::at_basicblock(), LivenessWalker::at_basicblock(), DefUseWalker::at_basicblock(), ExpressionDismantle::at_binary(), vcgASTWalker::at_block(), tree_visitor::at_block(), print_walker::at_block(), print_tree_visitor::at_block(), InitializerDismantle::at_block(), ExpressionDismantle::at_call(), LoopDismantle::at_do(), FlattenDismantle::at_exprstmt(), LoopDismantle::at_for(), FlattenDismantle::at_goto(), SelectionDismantle::at_if(), TreeChecker::at_label(), LabelDismantle::at_label(), FlattenDismantle::at_label(), reachingDefinitionsWalker::at_proc(), reachingGenKillWalker::at_proc(), LocalCopyPropChanger::at_proc(), LivenessWalker::at_proc(), FlattenDismantle::at_proc(), ReturnDismantle::at_proc(), DefUseWalker::at_proc(), copyPropChanger::at_proc(), cfg_changer::at_proc(), unreachableCodeRemover::at_proc(), FlattenDismantle::at_return(), ReturnDismantle::at_return(), SelectionDismantle::at_switch(), FlattenDismantle::at_threeAddr(), ExpressionDismantle::at_unary(), LoopDismantle::at_while(), basicblockLocation::basicblockLocation(), blockNode::change(), change(), loopTree::classifyEdges(), copyPropChanger::create_copy_set(), copyPropChanger::create_kill_set(), blockNode::dataflow(), Dominators::Dominators(), DismantleUtil::empty_block(), procNode::entry(), procNode::exit(), InitializerDismantle::init_scalar(), function_inline::inliner(), LocalCopyPropChanger::local_copy_prop(), copyPropChanger::local_copy_prop(), blockNode::output_stmt(), SSA::place_one_phi(), procedureInfo::procedure_size(), procedureInfo::procedureInfo(), procLocation::procLocation(), Unreachable::remove_unreachable(), SSA::search(), SSA::SSA(), blockNode::toBlock(), blockNode::walk(), and walk(). const basicblock_list& basicblockNode::succs (    )  const [inline]   Definition at line 4661 of file ast.h. References basicblock_list. basicblock_list& basicblockNode::succs (    )  [inline]   Definition at line 4660 of file ast.h. References basicblock_list. Referenced by procedureInfo::add_reachable_blocks_rec(), constantFoldingChanger::at_conditiongoto(), reachingGenKillWalker::at_proc(), LivenessWalker::at_proc(), copyPropChanger::at_proc(), DominanceFrontiers::compute_dominance_frontiers(), DFPreds::compute_dominance_frontiers(), DominanceFrontiers::depth_first_search(), DFPreds::depth_first_search(), loopTree::depthFirstSearch(), unreachableCodeRemover::dfs(), fixPointerWalker::dfs_used(), Dominators::dominator_tree(), Dominators::print(), Unreachable::remove_unreachable(), procedureInfo::reverse_post_order(), SSA::search(), copyPropChanger::solve_global_dataflow(), and procedureInfo::update_conditional_worklist(). blockNode * blockNode::toBlock (  stmtNode *    stmt, Coord    coord )  [static, inherited]   Convert to block. This method is used primarily by the parser to make sure that all branch bodies and loop bodies are represented by blockNodes, even if they aren't in the source code. For example: if (cond) x = x + 1; Even though the body of the branch is just a single statement, we build a block containing that one statement: if (cond) { x = x + 1; } This simplifies many other kinds of processing. For example, it makes it easy to add statements to the branch body. The method looks at the type of the input statement. If it is already a compound statement, it is return unchanged. Otherwise, it creates a compound statement, puts the statement in it, and then returns the compound statement. Parameters: stmt  the statement to covert, if necessary coord  the location of the construct in the source file. Returns: the statement as a blockNode Definition at line 68 of file blocknode.cc. References Block, blockNode::blockNode(), stmt_list, blockNode::stmts(), and Node::typ(). 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]   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 in declNode, typeNode, exprNode, and operandNode. Definition at line 344 of file ast.h. Referenced by tree_visitor::at_block(), ReturnDismantle::at_return(), asm_gen_walker::doCallerSave(), and briggs_reg_alloc::interfere(). void basicblockNode::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 blockNode. Definition at line 62 of file basicblocknode.cc. References Visitor::at_basicblock(). void basicblockNode::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 blockNode. Definition at line 67 of file basicblocknode.cc. References Walker::at_basicblock(), Walker::Both, blockNode::decls(), Walker::depth(), list_walker(), Walker::order(), Walker::Order, Walker::Postorder, Walker::Preorder, blockNode::stmts(), and Walker::Subtree. Referenced by SSA::place_phi_functions(). Member Data Documentation FlowVal* basicblockNode::_at_entry [private]   dataflow analysis entry value This field is used by the dataflow analysis framework to accumulate the flow-value coming into the basic block from it's predecessors. Sometimes, it's referred to as IN[B]. Definition at line 4617 of file ast.h. FlowVal* basicblockNode::_at_exit [private]   dataflow analysis exit value This field is used by the dataflow analysis framework to hold the flow value exiting the basic block. It is typically computed by passing the _at_entry through the transfer functions of the statements in the block. Sometimes, it's referred to as OUT[B]. Reimplemented from stmtNode. Definition at line 4626 of file ast.h. basicblock_list basicblockNode::_children [private]   the children in the dominator tree This is the set of basic blocks that are immediately dominated by this one. Definition at line 4594 of file ast.h. int basicblockNode::_dfn [private]   depth-first numbering Each basic block can be assignmed a number, usually in depth-first order. This is useful for building a bit-vector representation of sets of basic blocks. Definition at line 4609 of file ast.h. algorithm_info* basicblockNode::_info [private]   algorithm info This field is used by various algorithms to temporarily attach some information to a basic block. Definition at line 4601 of file ast.h. basicblockNode* basicblockNode::_parent [private]   the parent in the dominator tree This is the immediate dominator of this basic block. Definition at line 4587 of file ast.h. basicblock_list basicblockNode::_preds [private]   the control-flow predecessors Definition at line 4577 of file ast.h. basicblock_list basicblockNode::_succs [private]   the control-flow successors Definition at line 4581 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: ast.h basicblocknode.cc

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