00001 package ca.mcgill.sable.soot.jimple; 00002 00003 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 00004 * Jimple, a 3-address code Java(TM) bytecode representation. * 00005 * Copyright (C) 1997, 1998 Raja Vallee-Rai (kor@sable.mcgill.ca) * 00006 * All rights reserved. * 00007 * * 00008 * This work was done as a project of the Sable Research Group, * 00009 * School of Computer Science, McGill University, Canada * 00010 * (http://www.sable.mcgill.ca/). It is understood that any * 00011 * modification not identified as such is not covered by the * 00012 * preceding statement. * 00013 * * 00014 * This work is free software; you can redistribute it and/or * 00015 * modify it under the terms of the GNU Library General Public * 00016 * License as published by the Free Software Foundation; either * 00017 * version 2 of the License, or (at your option) any later version. * 00018 * * 00019 * This work is distributed in the hope that it will be useful, * 00020 * but WITHOUT ANY WARRANTY; without even the implied warranty of * 00021 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * 00022 * Library General Public License for more details. * 00023 * * 00024 * You should have received a copy of the GNU Library General Public * 00025 * License along with this library; if not, write to the * 00026 * Free Software Foundation, Inc., 59 Temple Place - Suite 330, * 00027 * Boston, MA 02111-1307, USA. * 00028 * * 00029 * Java is a trademark of Sun Microsystems, Inc. * 00030 * * 00031 * To submit a bug report, send a comment, or get the latest news on * 00032 * this project and other Sable Research Group projects, please * 00033 * visit the web site: http://www.sable.mcgill.ca/ * 00034 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ 00035 00036 /* 00037 Reference Version 00038 ----------------- 00039 This is the latest official version on which this file is based. 00040 The reference version is: $SootVersion: 1.beta.4 $ 00041 00042 Change History 00043 -------------- 00044 A) Notes: 00045 00046 Please use the following template. Most recent changes should 00047 appear at the top of the list. 00048 00049 - Modified on [date (March 1, 1900)] by [name]. [(*) if appropriate] 00050 [description of modification]. 00051 00052 Any Modification flagged with "(*)" was done as a project of the 00053 Sable Research Group, School of Computer Science, 00054 McGill University, Canada (http://www.sable.mcgill.ca/). 00055 00056 You should add your copyright, using the following template, at 00057 the top of this file, along with other copyrights. 00058 00059 * * 00060 * Modifications by [name] are * 00061 * Copyright (C) [year(s)] [your name (or company)]. All rights * 00062 * reserved. * 00063 * * 00064 00065 B) Changes: 00066 00067 - Modified on March 13, 1999 by Raja Vallee-Rai (rvalleerai@sable.mcgill.ca) (*) 00068 Re-organized the timers. 00069 00070 - Modified on February 4, 1998 by Raja Vallee-Rai (kor@sable.mcgill.ca) (*) 00071 Added the ability to retrieve live variables after a stmt. 00072 00073 - Modified on January 23, 1999 by Raja Vallee-Rai (rvalleerai@sable.mcgill.ca) (*) 00074 Branched off from PackedLiveLocals; 00075 00076 - Modified on November 2, 1998 by Raja Vallee-Rai (kor@sable.mcgill.ca) (*) 00077 Repackaged all source files and performed extensive modifications. 00078 First initial release of Soot. 00079 00080 - Modified on 23-Jul-1998 by Raja Vallee-Rai (kor@sable.mcgill.ca). (*) 00081 Renamed the uses of Hashtable to HashMap. 00082 00083 - Modified on 15-Jun-1998 by Raja Vallee-Rai (kor@sable.mcgill.ca). (*) 00084 First internal release (Version 0.1). 00085 */ 00086 00087 import ca.mcgill.sable.soot.*; 00088 import ca.mcgill.sable.util.*; 00089 00090 class SparseLiveLocalsAnalysis extends BackwardFlowAnalysis 00091 { 00092 FlowSet emptySet; 00093 Map stmtToGenerateSet; 00094 Map stmtToKillSet; 00095 00096 SparseLiveLocalsAnalysis(StmtGraph g) 00097 { 00098 super(g); 00099 00100 if(Main.isProfilingOptimization) 00101 Main.liveSetupTimer.start(); 00102 00103 emptySet = new ArraySparseSet(); 00104 00105 // Create Kill sets. 00106 { 00107 stmtToKillSet = new HashMap(g.size() * 2 + 1, 0.7f); 00108 00109 Iterator stmtIt = g.iterator(); 00110 00111 while(stmtIt.hasNext()) 00112 { 00113 Stmt s = (Stmt) stmtIt.next(); 00114 00115 FlowSet killSet = (FlowSet) emptySet.clone(); 00116 00117 Iterator boxIt = s.getDefBoxes().iterator(); 00118 00119 while(boxIt.hasNext()) 00120 { 00121 ValueBox box = (ValueBox) boxIt.next(); 00122 00123 if(box.getValue() instanceof Local) 00124 killSet.add(box.getValue(), killSet); 00125 } 00126 00127 stmtToKillSet.put(s, killSet); 00128 } 00129 } 00130 00131 // Create generate sets 00132 { 00133 stmtToGenerateSet = new HashMap(g.size() * 2 + 1, 0.7f); 00134 00135 Iterator stmtIt = g.iterator(); 00136 00137 while(stmtIt.hasNext()) 00138 { 00139 Stmt s = (Stmt) stmtIt.next(); 00140 00141 FlowSet genSet = (FlowSet) emptySet.clone(); 00142 00143 Iterator boxIt = s.getUseBoxes().iterator(); 00144 00145 while(boxIt.hasNext()) 00146 { 00147 ValueBox box = (ValueBox) boxIt.next(); 00148 00149 if(box.getValue() instanceof Local) 00150 genSet.add(box.getValue(), genSet); 00151 } 00152 00153 stmtToGenerateSet.put(s, genSet); 00154 } 00155 } 00156 00157 if(Main.isProfilingOptimization) 00158 Main.liveSetupTimer.end(); 00159 00160 if(Main.isProfilingOptimization) 00161 Main.liveAnalysisTimer.start(); 00162 00163 doAnalysis(); 00164 00165 if(Main.isProfilingOptimization) 00166 Main.liveAnalysisTimer.end(); 00167 00168 } 00169 protected void copy(Object source, Object dest) 00170 { 00171 FlowSet sourceSet = (FlowSet) source, 00172 destSet = (FlowSet) dest; 00173 00174 sourceSet.copy(destSet); 00175 } 00176 protected void flowThrough(Object inValue, Stmt stmt, Object outValue) 00177 { 00178 FlowSet in = (FlowSet) inValue, out = (FlowSet) outValue; 00179 00180 // Perform kill 00181 in.difference((FlowSet) stmtToKillSet.get(stmt), out); 00182 00183 // Perform generation 00184 out.union((FlowSet) stmtToGenerateSet.get(stmt), out); 00185 } 00186 protected void merge(Object in1, Object in2, Object out) 00187 { 00188 FlowSet inSet1 = (FlowSet) in1, 00189 inSet2 = (FlowSet) in2; 00190 00191 FlowSet outSet = (FlowSet) out; 00192 00193 inSet1.union(inSet2, outSet); 00194 } 00195 protected Object newInitialFlow() 00196 { 00197 return emptySet.clone(); 00198 } 00199 }