1 package Analysis.OwnershipAnalysis;
9 public class TokenTupleSet extends Canonical {
11 private HashSet<TokenTuple> tokenTuples;
14 public TokenTupleSet() {
15 tokenTuples = new HashSet<TokenTuple>();
18 public TokenTupleSet(TokenTuple tt) {
24 public TokenTupleSet(TokenTupleSet tts) {
26 // okay to clone, TokenTuple and TokenTupleSet should be canonical
27 tokenTuples = (HashSet<TokenTuple>)tts.tokenTuples.clone();
31 public TokenTupleSet makeCanonical() {
32 return (TokenTupleSet) Canonical.makeCanonical(this);
35 public Iterator iterator() {
36 return tokenTuples.iterator();
39 public boolean isEmpty() {
40 return tokenTuples.isEmpty();
43 public boolean isSubset(TokenTupleSet ttsIn) {
45 return ttsIn.tokenTuples.containsAll(this.tokenTuples);
48 public boolean containsTuple(TokenTuple tt) {
50 return tokenTuples.contains(tt);
53 public boolean containsBoth(TokenTuple tt1, TokenTuple tt2) {
54 return containsTuple(tt1) && containsTuple(tt2);
57 public boolean containsWithZeroes(TokenTupleSet tts) {
60 // first establish that every token tuple from tts is
62 Iterator<TokenTuple> ttItrIn = tts.iterator();
63 while( ttItrIn.hasNext() ) {
64 TokenTuple ttIn = ttItrIn.next();
65 TokenTuple ttThis = this.containsToken(ttIn.getToken() );
67 if( ttThis == null ) {
72 // then establish that anything in this set that is
73 // not in tts is a zero-arity token tuple, which is okay
74 Iterator<TokenTuple> ttItrThis = this.iterator();
75 while( ttItrThis.hasNext() ) {
76 TokenTuple ttThis = ttItrThis.next();
77 TokenTuple ttIn = tts.containsToken(ttThis.getToken() );
80 ttThis.getArity() != TokenTuple.ARITY_ZEROORMORE ) {
85 // if so this set contains tts with zeroes
89 public TokenTupleSet union(TokenTuple ttIn) {
91 TokenTupleSet ttsOut = new TokenTupleSet(this);
92 ttsOut.tokenTuples.add(ttIn);
93 return ttsOut.makeCanonical();
96 public TokenTupleSet union(TokenTupleSet ttsIn) {
98 TokenTupleSet ttsOut = new TokenTupleSet(this);
99 ttsOut.tokenTuples.addAll(ttsIn.tokenTuples);
100 return ttsOut.makeCanonical();
104 public TokenTupleSet unionUpArity(TokenTupleSet ttsIn) {
105 assert ttsIn != null;
106 TokenTupleSet ttsOut = new TokenTupleSet();
108 Iterator<TokenTuple> ttItr = this.iterator();
109 while( ttItr.hasNext() ) {
110 TokenTuple ttThis = ttItr.next();
111 TokenTuple ttIn = ttsIn.containsToken(ttThis.getToken() );
114 ttsOut.tokenTuples.add(ttThis.unionArity(ttIn) );
116 ttsOut.tokenTuples.add(ttThis);
120 ttItr = ttsIn.iterator();
121 while( ttItr.hasNext() ) {
122 TokenTuple ttIn = ttItr.next();
123 TokenTuple ttThis = ttsOut.containsToken(ttIn.getToken() );
125 if( ttThis == null ) {
126 ttsOut.tokenTuples.add(ttIn);
130 return ttsOut.makeCanonical();
134 public TokenTupleSet add(TokenTuple tt) {
136 TokenTupleSet ttsOut = new TokenTupleSet(tt);
137 return ttsOut.union(this);
141 public TokenTupleSet remove(TokenTuple tt) {
143 TokenTupleSet ttsOut = new TokenTupleSet(this);
144 ttsOut.tokenTuples.remove(tt);
145 return ttsOut.makeCanonical();
149 public boolean equals(Object o) {
154 if( !(o instanceof TokenTupleSet) ) {
158 TokenTupleSet tts = (TokenTupleSet) o;
159 return tokenTuples.equals(tts.tokenTuples);
162 boolean hashcodecomputed;
166 public int hashCode() {
167 if (hashcodecomputed)
170 ourhashcode=tokenTuples.hashCode();
176 // this should be a hash table so we can do this by key
177 public TokenTuple containsToken(Integer token) {
178 assert token != null;
180 Iterator itr = tokenTuples.iterator();
181 while( itr.hasNext() ) {
182 TokenTuple tt = (TokenTuple) itr.next();
183 if( token.equals(tt.getToken() ) ) {
191 public TokenTupleSet ageTokens(AllocationSite as) {
194 TokenTupleSet ttsOut = new TokenTupleSet();
196 TokenTuple ttSummary = null;
197 TokenTuple ttOldest = null;
199 Iterator itrT = this.iterator();
200 while( itrT.hasNext() ) {
201 TokenTuple tt = (TokenTuple) itrT.next();
203 Integer token = tt.getToken();
204 int age = as.getAgeCategory(token);
206 // tokens not associated with
207 // the site should be left alone
208 if( age == AllocationSite.AGE_notInThisSite ) {
209 ttsOut.tokenTuples.add(tt);
211 } else if( age == AllocationSite.AGE_summary ) {
212 // remember the summary tuple, but don't add it
213 // we may combine it with the oldest tuple
216 } else if( age == AllocationSite.AGE_oldest ) {
217 // found an oldest token, again just remember
222 assert age == AllocationSite.AGE_in_I;
224 Integer I = as.getAge(token);
227 // otherwise, we change this token to the
229 Integer tokenToChangeTo = as.getIthOldest(I + 1);
230 TokenTuple ttAged = tt.changeTokenTo(tokenToChangeTo);
231 ttsOut.tokenTuples.add(ttAged);
235 // there are four cases to consider here
236 // 1. we found a summary tuple and no oldest tuple
237 // Here we just pass the summary unchanged
238 // 2. we found an oldest tuple, no summary
239 // Make a new, arity-one summary tuple
240 // 3. we found both a summary and an oldest
241 // Merge them by arity
242 // 4. (not handled) we found neither, do nothing
243 if ( ttSummary != null && ttOldest == null ) {
244 ttsOut.tokenTuples.add(ttSummary);
246 } else if( ttSummary == null && ttOldest != null ) {
247 ttsOut.tokenTuples.add(new TokenTuple(as.getSummary(),
253 } else if( ttSummary != null && ttOldest != null ) {
254 ttsOut.tokenTuples.add(ttSummary.unionArity(new TokenTuple(as.getSummary(),
262 return ttsOut.makeCanonical();
266 public TokenTupleSet unshadowTokens(AllocationSite as) {
269 TokenTupleSet ttsOut = new TokenTupleSet();
271 TokenTuple ttSummary = null;
272 TokenTuple ttShadowSummary = null;
274 Iterator itrT = this.iterator();
275 while( itrT.hasNext() ) {
276 TokenTuple tt = (TokenTuple) itrT.next();
278 Integer token = tt.getToken();
279 int shadowAge = as.getShadowAgeCategory(token);
281 if( shadowAge == AllocationSite.AGE_summary ) {
282 // remember the summary tuple, but don't add it
283 // we may combine it with the oldest tuple
286 } else if( shadowAge == AllocationSite.SHADOWAGE_notInThisSite ) {
287 ttsOut.tokenTuples.add(tt);
289 } else if( shadowAge == AllocationSite.SHADOWAGE_summary ) {
290 // found the shadow summary token, again just remember
292 ttShadowSummary = tt;
294 } else if( shadowAge == AllocationSite.SHADOWAGE_oldest ) {
295 Integer tokenToChangeTo = as.getOldest();
296 TokenTuple ttNormal = tt.changeTokenTo(tokenToChangeTo);
297 ttsOut.tokenTuples.add(ttNormal);
300 assert shadowAge == AllocationSite.SHADOWAGE_in_I;
302 Integer I = as.getShadowAge(token);
305 Integer tokenToChangeTo = as.getIthOldest(-I);
306 TokenTuple ttNormal = tt.changeTokenTo(tokenToChangeTo);
307 ttsOut.tokenTuples.add(ttNormal);
311 if ( ttSummary != null && ttShadowSummary == null ) {
312 ttsOut.tokenTuples.add(ttSummary);
314 } else if( ttSummary == null && ttShadowSummary != null ) {
315 ttsOut.tokenTuples.add(new TokenTuple(as.getSummary(),
317 ttShadowSummary.getArity()
321 } else if( ttSummary != null && ttShadowSummary != null ) {
322 ttsOut.tokenTuples.add(ttSummary.unionArity(new TokenTuple(as.getSummary(),
324 ttShadowSummary.getArity()
330 return ttsOut.makeCanonical();
334 public TokenTupleSet toShadowTokens(AllocationSite as) {
337 TokenTupleSet ttsOut = new TokenTupleSet().makeCanonical();
339 Iterator itrT = this.iterator();
340 while( itrT.hasNext() ) {
341 TokenTuple tt = (TokenTuple) itrT.next();
343 Integer token = tt.getToken();
344 int age = as.getAgeCategory(token);
346 // summary tokens and tokens not associated with
347 // the site should be left alone
348 if( age == AllocationSite.AGE_notInThisSite ) {
349 ttsOut = ttsOut.union(tt);
351 } else if( age == AllocationSite.AGE_summary ) {
352 ttsOut = ttsOut.union(tt.changeTokenTo(as.getSummaryShadow() ));
354 } else if( age == AllocationSite.AGE_oldest ) {
355 ttsOut = ttsOut.union(tt.changeTokenTo(as.getOldestShadow() ));
358 assert age == AllocationSite.AGE_in_I;
360 Integer I = as.getAge(token);
363 ttsOut = ttsOut.union(tt.changeTokenTo(as.getIthOldestShadow(I) ));
367 return ttsOut.makeCanonical();
371 public ReachabilitySet rewriteToken(TokenTuple tokenToRewrite,
372 ReachabilitySet replacements,
373 boolean makeChangeSet,
374 Hashtable<TokenTupleSet, HashSet<TokenTupleSet> > forChangeSet) {
376 ReachabilitySet rsOut = new ReachabilitySet().makeCanonical();
378 if( !tokenTuples.contains(tokenToRewrite) ) {
379 rsOut = rsOut.add(this);
382 TokenTupleSet ttsMinusToken = new TokenTupleSet(this);
383 ttsMinusToken.tokenTuples.remove(tokenToRewrite);
385 Iterator<TokenTupleSet> replaceItr = replacements.iterator();
386 while( replaceItr.hasNext() ) {
387 TokenTupleSet replacement = replaceItr.next();
388 TokenTupleSet replaced = new TokenTupleSet(ttsMinusToken).makeCanonical();
389 replaced = replaced.unionUpArity(replacement);
390 rsOut = rsOut.add(replaced);
392 if( makeChangeSet ) {
393 assert forChangeSet != null;
395 if( forChangeSet.get(this) == null ) {
396 forChangeSet.put(this, new HashSet<TokenTupleSet>() );
399 forChangeSet.get(this).add(replaced);
404 return rsOut.makeCanonical();
408 public TokenTupleSet makeArityZeroOrMore() {
409 TokenTupleSet ttsOut = new TokenTupleSet().makeCanonical();
411 Iterator<TokenTuple> itrThis = this.iterator();
412 while( itrThis.hasNext() ) {
413 TokenTuple tt = itrThis.next();
415 ttsOut = ttsOut.union(new TokenTuple(tt.getToken(),
417 TokenTuple.ARITY_ZEROORMORE
422 return ttsOut.makeCanonical();
425 public String toString() {
426 return tokenTuples.toString();