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 November 2, 1998 by Raja Vallee-Rai (kor@sable.mcgill.ca) (*) 00071 Repackaged all source files and performed extensive modifications. 00072 First initial release of Soot. 00073 00074 - Modified on 23-Jul-1998 by Raja Vallee-Rai (kor@sable.mcgill.ca). (*) 00075 Renamed the uses of Hashtable to HashMap. 00076 00077 - Modified on 15-Jun-1998 by Raja Vallee-Rai (kor@sable.mcgill.ca). (*) 00078 First internal release (Version 0.1). 00079 */ 00080 00081 import ca.mcgill.sable.soot.*; 00082 import ca.mcgill.sable.util.*; 00083 00084 public class SimpleLocalUses implements LocalUses 00085 { 00086 Map stmtToUses; 00087 00088 public SimpleLocalUses(CompleteStmtGraph graph, LocalDefs localDefs) 00089 { 00090 if(Main.isProfilingOptimization) 00091 Main.usesTimer.start(); 00092 00093 if(Main.isVerbose) 00094 System.out.println("[" + graph.getBody().getMethod().getName() + 00095 "] Constructing SimpleLocalUses..."); 00096 00097 00098 Map stmtToUseList = new HashMap(graph.size() * 2 + 1, 0.7f); 00099 00100 // Initialize this map to empty sets 00101 { 00102 Iterator it = graph.iterator(); 00103 00104 while(it.hasNext()) 00105 { 00106 Stmt s = (Stmt) it.next(); 00107 00108 stmtToUseList.put(s, new ArrayList()); 00109 } 00110 } 00111 00112 // Traverse stmts and associate uses with definitions 00113 { 00114 Iterator it = graph.iterator(); 00115 00116 while(it.hasNext()) 00117 { 00118 Stmt s = (Stmt) it.next(); 00119 00120 Iterator boxIt = s.getUseBoxes().iterator(); 00121 00122 while(boxIt.hasNext()) 00123 { 00124 ValueBox useBox = (ValueBox) boxIt.next(); 00125 00126 if(useBox.getValue() instanceof Local) 00127 { 00128 // Add this statement to the uses of the definition of the local 00129 00130 Local l = (Local) useBox.getValue(); 00131 00132 List possibleDefs = localDefs.getDefsOfAt(l, s); 00133 Iterator defIt = possibleDefs.iterator(); 00134 00135 while(defIt.hasNext()) 00136 { 00137 List useList = (List) stmtToUseList.get(defIt.next()); 00138 00139 useList.add(new StmtValueBoxPair(s, useBox)); 00140 } 00141 } 00142 } 00143 } 00144 } 00145 00146 // Store the map as a bunch of unmodifiable lists. 00147 { 00148 stmtToUses = new HashMap(graph.size() * 2 + 1, 0.7f); 00149 00150 Iterator it = graph.iterator(); 00151 00152 while(it.hasNext()) 00153 { 00154 Stmt s = (Stmt) it.next(); 00155 00156 stmtToUses.put(s, Collections.unmodifiableList(((List) stmtToUseList.get(s)))); 00157 } 00158 } 00159 00160 if(Main.isProfilingOptimization) 00161 Main.usesTimer.end(); 00162 } 00163 public List getUsesOf(DefinitionStmt s) 00164 { 00165 return (List) stmtToUses.get(s); 00166 } 00167 }