 |
C-Breeze C Compiler Infrastructure [ Project home page] |
basicblocknode.cc
Go to the documentation of this file.00001 // $Id: basicblocknode.cc,v 1.3 2003/08/07 23:12:58 pnav Exp $ 00002 // ---------------------------------------------------------------------- 00003 // 00004 // C-Breeze 00005 // C Compiler Framework 00006 // 00007 // Copyright (c) 2000 University of Texas at Austin 00008 // 00009 // Samuel Z. Guyer 00010 // Daniel A. Jimenez 00011 // Calvin Lin 00012 // 00013 // Permission is hereby granted, free of charge, to any person 00014 // obtaining a copy of this software and associated documentation 00015 // files (the "Software"), to deal in the Software without 00016 // restriction, including without limitation the rights to use, copy, 00017 // modify, merge, publish, distribute, sublicense, and/or sell copies 00018 // of the Software, and to permit persons to whom the Software is 00019 // furnished to do so, subject to the following conditions: 00020 // 00021 // The above copyright notice and this permission notice shall be 00022 // included in all copies or substantial portions of the Software. 00023 // 00024 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00025 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00026 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00027 // NONINFRINGEMENT. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT 00028 // AUSTIN BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER 00029 // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF 00030 // OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 00031 // THE SOFTWARE. 00032 // 00033 // We acknowledge the C-to-C Translator from MIT Laboratory for 00034 // Computer Science for inspiring parts of the C-Breeze design. 00035 // 00036 // ---------------------------------------------------------------------- 00037 #include "c_breeze.h" 00038 00039 // -------------------------------------------------------------------- 00040 // Constructors 00041 // -------------------------------------------------------------------- 00042 00043 basicblockNode::basicblockNode(decl_list * decls, stmt_list * stmts, 00044 const Coord left_coord, const Coord right_brace) 00045 : blockNode (decls, stmts, left_coord, right_brace), 00046 _parent(0), 00047 _info(0), 00048 _dfn(0), 00049 _at_entry(0), 00050 _at_exit(0) 00051 {} 00052 00053 // ------------------------------------------------------------ 00054 // Destructor 00055 // ------------------------------------------------------------ 00056 00057 // nothing to do; if we delete_list the preds and succs, we might 00058 // blow away other basic blocks. 00059 00060 basicblockNode::~basicblockNode() { } 00061 00062 void basicblockNode::visit(Visitor * the_visitor) 00063 { 00064 the_visitor->at_basicblock(this); 00065 } 00066 00067 void basicblockNode::walk(Walker & the_walker) 00068 { 00069 Walker::Order ord = the_walker.order(); 00070 00071 if (ord == Walker::Preorder || ord == Walker::Both) 00072 the_walker.at_basicblock(this, Walker::Preorder); 00073 00074 if (the_walker.depth() == Walker::Subtree) { 00075 // -- Visit the children 00076 00077 list_walker(decls(), the_walker); 00078 list_walker(stmts(), the_walker); 00079 00080 } 00081 00082 if (ord == Walker::Postorder || ord == Walker::Both) 00083 the_walker.at_basicblock(this, Walker::Postorder); 00084 } 00085 00086 Node * basicblockNode::change(Changer & the_changer, bool redispatch) 00087 { 00088 Changer::Order ord = the_changer.order(); 00089 basicblockNode * the_basicblock = this; 00090 00091 if ((ord == Changer::Preorder || ord == Changer::Both) && ! redispatch) 00092 the_basicblock = (basicblockNode *) the_changer.at_basicblock(the_basicblock, Changer::Preorder) 00093 ; 00094 00095 if (the_basicblock) { 00096 00097 if (the_basicblock != this) 00098 return the_basicblock->change(the_changer, true); 00099 00100 change_list(the_basicblock->decls(), the_changer); 00101 00102 change_list(the_basicblock->stmts(), the_changer); 00103 } 00104 00105 if ((ord == Changer::Postorder || ord == Changer::Both) && ! redispatch) 00106 the_basicblock = (basicblockNode *) the_changer.at_basicblock(the_basicblock, Changer::Postorder 00107 ); 00108 return the_basicblock; 00109 }