 |
C-Breeze C Compiler Infrastructure [ Project home page] |
ipconstants_changer.cc
Go to the documentation of this file.00001 // $Id: ipconstants_changer.cc,v 1.3 2003/08/07 23:14:16 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 00038 #include "c_breeze.h" 00039 #include "ipconstants_changer.h" 00040 00041 ipConstantsChanger::ipConstantsChanger(ipConstantPropagation * constants, 00042 Pointers * ptrs) 00043 : Changer( Postorder, Subtree, true ), 00044 ipconstants(constants), 00045 pointers(ptrs) 00046 {} 00047 00048 Node * ipConstantsChanger::at_expr(exprNode * the_expr, Order ord) 00049 { 00050 memoryuse_set uses; 00051 pointers->indirect_uses(the_expr, uses); 00052 if ( ! uses.empty()) { 00053 00054 analysisVal * val = ipconstants->top(); 00055 for (memoryuse_set_p use_p = uses.begin(); 00056 use_p != uses.end(); 00057 ++use_p) 00058 { 00059 memoryUse * use = *use_p; 00060 analysisVal * cur_val = 0; 00061 if (use->reaching_def()) 00062 cur_val = ipconstants->lookup(use->reaching_def()->owner(), use); 00063 if (! cur_val) 00064 cur_val = ipconstants->bottom(); 00065 val->meet_with(cur_val); 00066 ipconstants->free(cur_val); 00067 } 00068 00069 ipConstant * const_val = (ipConstant *) val; 00070 00071 if ( ! const_val->is_bottom() && 00072 ! const_val->is_top()) { 00073 constNode * out = new constNode(const_val->value()); 00074 ipconstants->free(val); 00075 return out; 00076 } 00077 } 00078 else { 00079 the_expr->eval(); 00080 if ( ! the_expr->value().no_val()) { 00081 constNode * out = new constNode(the_expr->value()); 00082 return out; 00083 } 00084 } 00085 00086 return the_expr; 00087 }