1 package Analysis.OwnershipAnalysis;
9 public class ReachabilitySet extends Canonical {
11 private HashSet<TokenTupleSet> possibleReachabilities;
13 public ReachabilitySet() {
14 possibleReachabilities = new HashSet<TokenTupleSet>();
17 public ReachabilitySet(TokenTupleSet tts) {
20 possibleReachabilities.add(tts);
23 public ReachabilitySet(TokenTuple tt) {
24 // can't assert before calling this(), it will
25 // do the checking though
26 this( new TokenTupleSet(tt).makeCanonical() );
29 public ReachabilitySet(HashSet<TokenTupleSet> possibleReachabilities) {
30 assert possibleReachabilities != null;
31 this.possibleReachabilities = possibleReachabilities;
34 public ReachabilitySet(ReachabilitySet rs) {
36 // okay to clone, ReachabilitySet should be canonical
37 possibleReachabilities = (HashSet<TokenTupleSet>)rs.possibleReachabilities.clone();
41 public ReachabilitySet makeCanonical() {
42 return (ReachabilitySet) Canonical.makeCanonical(this);
45 public Iterator<TokenTupleSet> iterator() {
46 return possibleReachabilities.iterator();
51 return possibleReachabilities.size();
54 public boolean isEmpty() {
55 return possibleReachabilities.isEmpty();
58 public boolean contains(TokenTupleSet tts) {
60 return possibleReachabilities.contains(tts);
63 public boolean containsTuple(TokenTuple tt) {
64 Iterator itr = iterator();
65 while( itr.hasNext() ) {
66 TokenTupleSet tts = (TokenTupleSet) itr.next();
67 if( tts.containsTuple(tt) ) {
74 public boolean containsTupleSetWithBoth(TokenTuple tt1, TokenTuple tt2) {
75 Iterator itr = iterator();
76 while( itr.hasNext() ) {
77 TokenTupleSet tts = (TokenTupleSet) itr.next();
78 if( tts.containsTuple(tt1) && tts.containsTuple(tt2) ) {
85 public ReachabilitySet increaseArity(Integer token) {
88 HashSet<TokenTupleSet> possibleReachabilitiesNew = new HashSet<TokenTupleSet>();
90 Iterator itr = iterator();
91 while( itr.hasNext() ) {
92 TokenTupleSet tts = (TokenTupleSet) itr.next();
93 possibleReachabilitiesNew.add(tts.increaseArity(token) );
96 return new ReachabilitySet(possibleReachabilitiesNew).makeCanonical();
100 public ReachabilitySet union(ReachabilitySet rsIn) {
103 ReachabilitySet rsOut = new ReachabilitySet(this);
104 rsOut.possibleReachabilities.addAll(rsIn.possibleReachabilities);
105 return rsOut.makeCanonical();
108 public ReachabilitySet union(TokenTupleSet ttsIn) {
109 assert ttsIn != null;
111 ReachabilitySet rsOut = new ReachabilitySet(this);
112 rsOut.possibleReachabilities.add(ttsIn);
113 return rsOut.makeCanonical();
116 public ReachabilitySet intersection(ReachabilitySet rsIn) {
119 ReachabilitySet rsOut = new ReachabilitySet();
121 Iterator i = this.iterator();
122 while( i.hasNext() ) {
123 TokenTupleSet tts = (TokenTupleSet) i.next();
124 if( rsIn.possibleReachabilities.contains(tts) ) {
125 rsOut.possibleReachabilities.add(tts);
129 return rsOut.makeCanonical();
133 public ReachabilitySet add(TokenTupleSet tts) {
135 ReachabilitySet rsOut = new ReachabilitySet(tts);
136 return rsOut.union(this);
140 public ChangeTupleSet unionUpArityToChangeSet(ReachabilitySet rsIn) {
143 ChangeTupleSet ctsOut = new ChangeTupleSet();
145 Iterator itrO = this.iterator();
146 while( itrO.hasNext() ) {
147 TokenTupleSet o = (TokenTupleSet) itrO.next();
149 Iterator itrR = rsIn.iterator();
150 while( itrR.hasNext() ) {
151 TokenTupleSet r = (TokenTupleSet) itrR.next();
153 TokenTupleSet theUnion = new TokenTupleSet();
155 Iterator itrRelement = r.iterator();
156 while( itrRelement.hasNext() ) {
157 TokenTuple e = (TokenTuple) itrRelement.next();
159 if( o.containsToken(e.getToken() ) ) {
160 theUnion = theUnion.union(new TokenTupleSet(e.increaseArity() ) ).makeCanonical();
162 theUnion = theUnion.union(new TokenTupleSet(e) ).makeCanonical();
166 Iterator itrOelement = o.iterator();
167 while( itrOelement.hasNext() ) {
168 TokenTuple e = (TokenTuple) itrOelement.next();
170 if( !theUnion.containsToken(e.getToken() ) ) {
171 theUnion = theUnion.union(new TokenTupleSet(e) ).makeCanonical();
175 if( !theUnion.isEmpty() ) {
176 ctsOut = ctsOut.union(
177 new ChangeTupleSet(new ChangeTuple(o, theUnion) )
183 return ctsOut.makeCanonical();
187 public ReachabilitySet ageTokens(AllocationSite as) {
190 ReachabilitySet rsOut = new ReachabilitySet();
192 Iterator itrS = this.iterator();
193 while( itrS.hasNext() ) {
194 TokenTupleSet tts = (TokenTupleSet) itrS.next();
195 rsOut.possibleReachabilities.add(tts.ageTokens(as) );
198 return rsOut.makeCanonical();
202 public ReachabilitySet unshadowTokens(AllocationSite as) {
205 ReachabilitySet rsOut = new ReachabilitySet();
207 Iterator itrS = this.iterator();
208 while( itrS.hasNext() ) {
209 TokenTupleSet tts = (TokenTupleSet) itrS.next();
210 rsOut.possibleReachabilities.add(tts.unshadowTokens(as) );
213 return rsOut.makeCanonical();
217 public ReachabilitySet toShadowTokens(AllocationSite as) {
220 ReachabilitySet rsOut = new ReachabilitySet();
222 Iterator itrS = this.iterator();
223 while( itrS.hasNext() ) {
224 TokenTupleSet tts = (TokenTupleSet) itrS.next();
225 rsOut.possibleReachabilities.add(tts.toShadowTokens(as) );
228 return rsOut.makeCanonical();
232 public ReachabilitySet pruneBy(ReachabilitySet rsIn) {
235 ReachabilitySet rsOut = new ReachabilitySet();
237 Iterator itrB = this.iterator();
238 while( itrB.hasNext() ) {
239 TokenTupleSet ttsB = (TokenTupleSet) itrB.next();
241 boolean subsetExists = false;
243 Iterator itrA = rsIn.iterator();
244 while( itrA.hasNext() && !subsetExists ) {
245 TokenTupleSet ttsA = (TokenTupleSet) itrA.next();
247 if( ttsA.isSubset(ttsB) ) {
253 rsOut.possibleReachabilities.add(ttsB);
257 return rsOut.makeCanonical();
261 public ReachabilitySet exhaustiveArityCombinations() {
262 ReachabilitySet rsOut = new ReachabilitySet();
264 int numDimensions = this.possibleReachabilities.size();
266 if( numDimensions > 10 ) {
267 System.out.println( " exhaustiveArityCombinations numDimensions = "+numDimensions );
268 System.out.println( this );
271 // add an extra digit to detect termination
272 int[] digits = new int[numDimensions+1];
277 // start with the minimum possible coordinate
278 for( int i = 0; i < numDimensions+1; ++i ) {
279 digits[i] = minArity;
282 // and stop when the highest-ordered axis rolls above the minimum
283 while( digits[numDimensions] == minArity ) {
285 // spit out a "coordinate" made from these digits
286 TokenTupleSet ttsCoordinate = new TokenTupleSet();
287 Iterator<TokenTupleSet> ttsItr = this.iterator();
288 for( int i = 0; i < numDimensions; ++i ) {
289 assert ttsItr.hasNext();
290 TokenTupleSet ttsUnit = ttsItr.next();
291 for( int j = 0; j < digits[i]; ++j ) {
292 ttsCoordinate = ttsCoordinate.unionUpArity(ttsUnit);
295 rsOut = rsOut.add(ttsCoordinate.makeCanonical() );
298 for( int i = 0; i < numDimensions+1; ++i ) {
303 System.out.print( "x" );
307 System.out.print( "@" );
311 System.out.print( "#" );
314 if( digits[i] > maxArity ) {
315 // this axis reached its max, so roll it back to min and increment next higher digit
316 digits[i] = minArity;
319 // this axis did not reach its max so we just enumerated a new unique coordinate, stop
325 if( numDimensions > 10 ) {
326 System.out.println( "" );
329 return rsOut.makeCanonical();
333 public boolean equals(Object o) {
338 if( !(o instanceof ReachabilitySet) ) {
342 ReachabilitySet rs = (ReachabilitySet) o;
343 return possibleReachabilities.equals(rs.possibleReachabilities);
346 public int hashCode() {
347 return possibleReachabilities.hashCode();
351 public String toStringEscapeNewline() {
354 Iterator i = this.iterator();
355 while( i.hasNext() ) {
366 public String toString() {
369 Iterator i = this.iterator();
370 while( i.hasNext() ) {