Main Page   Modules   Namespace List   Class Hierarchy   Compound List   File List   Compound Members   File Members   Related Pages  

dead.h

Go to the documentation of this file.
00001 // ----------------------------------------------------------------------
00002 //
00003 //  C-Breeze
00004 //  C Compiler Framework
00005 // 
00006 //  Copyright (c) 2000 University of Texas at Austin
00007 // 
00008 //  Samuel Z. Guyer
00009 //  Daniel A. Jimenez
00010 //  Calvin Lin
00011 // 
00012 //  Permission is hereby granted, free of charge, to any person
00013 //  obtaining a copy of this software and associated documentation
00014 //  files (the "Software"), to deal in the Software without
00015 //  restriction, including without limitation the rights to use, copy,
00016 //  modify, merge, publish, distribute, sublicense, and/or sell copies
00017 //  of the Software, and to permit persons to whom the Software is
00018 //  furnished to do so, subject to the following conditions:
00019 //  
00020 //  The above copyright notice and this permission notice shall be
00021 //  included in all copies or substantial portions of the Software.
00022 //  
00023 //  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00024 //  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00025 //  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00026 //  NONINFRINGEMENT.  IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT
00027 //  AUSTIN BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
00028 //  IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
00029 //  OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
00030 //  THE SOFTWARE.
00031 //
00032 //  We acknowledge the C-to-C Translator from MIT Laboratory for
00033 //  Computer Science for inspiring parts of the C-Breeze design.
00034 //
00035 // ----------------------------------------------------------------------
00036 
00037 #ifndef CBZ_DEAD_H
00038 #define CBZ_DEAD_H
00039 
00040 // 
00041 // dead.cc
00042 //
00043 // Dead code elimination
00044 //
00045 
00046 class deadCodeEliminationChanger : public Changer {
00047 private:
00048 
00049         map <declNode *, bool> is_local;
00050         map <declNode *, bool> is_live;
00051 
00052         bool has_side_effects (exprNode *);
00053         void mark_as_live (exprNode *);
00054         exprNode * handle_expr (exprNode *);
00055         void local_dce (basicblockNode *);
00056         void tick_local (declNode *);
00057         void find_address_taken (exprNode *);
00058 
00059 public:
00060         deadCodeEliminationChanger (void) : Changer (Preorder, Subtree, false) { }
00061         Node * at_proc (procNode *, Order);
00062 };
00063 
00064 class has_struct_walker : public Walker {
00065 public:
00066         bool has_struct;
00067 
00068         has_struct_walker (void) : 
00069                 Walker (Preorder, Subtree), has_struct(false) { }
00070 
00071         void at_decl (declNode *d, Order) {
00072                 has_struct = d->storage_class() == declNode::TYPEDEF;
00073         }
00074 
00075         void at_sue (sueNode *, Order) {
00076                 has_struct = true;
00077         }
00078 
00079         void at_func (funcNode *, Order) {
00080                 has_struct = true;
00081         }
00082 };
00083 
00084 class unusedVariableCleanupChanger : public Changer {
00085         public:
00086 
00087         map <declNode *, bool> used;
00088 
00089         unusedVariableCleanupChanger (void) : Changer (Both, Subtree, false) { }
00090 
00091         Node * at_proc (procNode *p, Order ord) {
00092                 if (ord == Preorder)
00093                         used.clear();
00094                 else {
00095                         blockNode *b = p->body();
00096                         for (decl_list_p i=b->decls().begin(); 
00097                                 i!=b->decls().end(); ) {
00098                                 has_struct_walker w;
00099                                 (*i)->walk (w);
00100                                 if (w.has_struct || used[*i] || (*i)->storage_class() == declNode::TYPEDEF)
00101                                         i++;
00102                                 else
00103                                         i = b->decls().erase (i);
00104                         }
00105                 }
00106                 return p;
00107         }
00108 
00109         Node * at_id (idNode *i, Order ord) {
00110                 used[i->decl()] = true;
00111                 return i;
00112         }
00113 };
00114 
00115 #endif // CBZ_DEAD_H

Generated on Thu Jan 10 12:06:19 2002 for C-Breeze by doxygen1.2.13.1 written by Dimitri van Heesch, © 1997-2001