1 package Analysis.OwnershipAnalysis;
8 public class OwnershipGraph {
10 private int allocationDepth;
12 // there was already one other very similar reason
13 // for traversing heap nodes that is no longer needed
14 // instead of writing a new heap region visitor, use
15 // the existing method with a new mode to describe what
16 // actions to take during the traversal
17 protected static final int VISIT_HRN_WRITE_FULL = 0;
20 public Hashtable<Integer, HeapRegionNode> id2hrn;
21 public Hashtable<TempDescriptor, LabelNode > td2ln;
22 public Hashtable<Integer, Integer > id2paramIndex;
23 public Hashtable<Integer, Integer > paramIndex2id;
24 public Hashtable<Integer, TempDescriptor> paramIndex2tdQ;
26 public HashSet<AllocationSite> allocationSites;
29 public OwnershipGraph(int allocationDepth) {
30 this.allocationDepth = allocationDepth;
32 id2hrn = new Hashtable<Integer, HeapRegionNode>();
33 td2ln = new Hashtable<TempDescriptor, LabelNode >();
34 id2paramIndex = new Hashtable<Integer, Integer >();
35 paramIndex2id = new Hashtable<Integer, Integer >();
36 paramIndex2tdQ = new Hashtable<Integer, TempDescriptor>();
38 allocationSites = new HashSet <AllocationSite>();
42 // label nodes are much easier to deal with than
43 // heap region nodes. Whenever there is a request
44 // for the label node that is associated with a
45 // temp descriptor we can either find it or make a
46 // new one and return it. This is because temp
47 // descriptors are globally unique and every label
48 // node is mapped to exactly one temp descriptor.
49 protected LabelNode getLabelNodeFromTemp(TempDescriptor td) {
52 if( !td2ln.containsKey(td) ) {
53 td2ln.put(td, new LabelNode(td) );
60 // the reason for this method is to have the option
61 // creating new heap regions with specific IDs, or
62 // duplicating heap regions with specific IDs (especially
63 // in the merge() operation) or to create new heap
64 // regions with a new unique ID.
65 protected HeapRegionNode
66 createNewHeapRegionNode(Integer id,
67 boolean isSingleObject,
71 AllocationSite allocSite,
72 ReachabilitySet alpha,
76 id = OwnershipAnalysis.generateUniqueHeapRegionNodeID();
80 if( isFlagged || isParameter ) {
81 alpha = new ReachabilitySet(new TokenTuple(id,
86 alpha = new ReachabilitySet(new TokenTupleSet()
91 HeapRegionNode hrn = new HeapRegionNode(id,
104 ////////////////////////////////////////////////
106 // Low-level referencee and referencer methods
108 // These methods provide the lowest level for
109 // creating references between ownership nodes
110 // and handling the details of maintaining both
111 // list of referencers and referencees.
113 ////////////////////////////////////////////////
114 protected void addReferenceEdge(OwnershipNode referencer,
115 HeapRegionNode referencee,
116 ReferenceEdge edge) {
117 assert referencer != null;
118 assert referencee != null;
120 assert edge.getSrc() == referencer;
121 assert edge.getDst() == referencee;
123 referencer.addReferencee(edge);
124 referencee.addReferencer(edge);
127 protected void removeReferenceEdge(OwnershipNode referencer,
128 HeapRegionNode referencee,
129 FieldDescriptor fieldDesc) {
130 assert referencer != null;
131 assert referencee != null;
133 ReferenceEdge edge = referencer.getReferenceTo(referencee,
136 assert edge == referencee.getReferenceFrom(referencer,
139 referencer.removeReferencee(edge);
140 referencee.removeReferencer(edge);
143 protected void clearReferenceEdgesFrom(OwnershipNode referencer,
144 FieldDescriptor fieldDesc,
146 assert referencer != null;
148 // get a copy of the set to iterate over, otherwise
149 // we will be trying to take apart the set as we
150 // are iterating over it, which won't work
151 Iterator<ReferenceEdge> i = referencer.iteratorToReferenceesClone();
152 while( i.hasNext() ) {
153 ReferenceEdge edge = i.next();
155 if( removeAll || edge.getFieldDesc() == fieldDesc ) {
156 HeapRegionNode referencee = edge.getDst();
158 removeReferenceEdge(referencer,
160 edge.getFieldDesc() );
165 protected void clearReferenceEdgesTo(HeapRegionNode referencee,
166 FieldDescriptor fieldDesc,
168 assert referencee != null;
170 // get a copy of the set to iterate over, otherwise
171 // we will be trying to take apart the set as we
172 // are iterating over it, which won't work
173 Iterator<ReferenceEdge> i = referencee.iteratorToReferencersClone();
174 while( i.hasNext() ) {
175 ReferenceEdge edge = i.next();
177 if( removeAll || edge.getFieldDesc() == fieldDesc ) {
178 OwnershipNode referencer = edge.getSrc();
179 removeReferenceEdge(referencer,
181 edge.getFieldDesc() );
187 protected void propagateTokensOverNodes(HeapRegionNode nPrime,
189 HashSet<HeapRegionNode> nodesWithNewAlpha,
190 HashSet<ReferenceEdge> edgesWithNewBeta) {
192 HashSet<HeapRegionNode> todoNodes
193 = new HashSet<HeapRegionNode>();
194 todoNodes.add(nPrime);
196 HashSet<ReferenceEdge> todoEdges
197 = new HashSet<ReferenceEdge>();
199 Hashtable<HeapRegionNode, ChangeTupleSet> nodePlannedChanges
200 = new Hashtable<HeapRegionNode, ChangeTupleSet>();
201 nodePlannedChanges.put(nPrime, c0);
203 Hashtable<ReferenceEdge, ChangeTupleSet> edgePlannedChanges
204 = new Hashtable<ReferenceEdge, ChangeTupleSet>();
207 while( !todoNodes.isEmpty() ) {
208 HeapRegionNode n = todoNodes.iterator().next();
209 ChangeTupleSet C = nodePlannedChanges.get(n);
211 Iterator itrC = C.iterator();
212 while( itrC.hasNext() ) {
213 ChangeTuple c = (ChangeTuple) itrC.next();
215 if( n.getAlpha().contains(c.getSetToMatch() ) ) {
216 ReachabilitySet withChange = n.getAlpha().union(c.getSetToAdd() );
217 n.setAlphaNew(n.getAlphaNew().union(withChange) );
218 nodesWithNewAlpha.add(n);
222 Iterator<ReferenceEdge> referItr = n.iteratorToReferencers();
223 while( referItr.hasNext() ) {
224 ReferenceEdge edge = referItr.next();
227 if( !edgePlannedChanges.containsKey(edge) ) {
228 edgePlannedChanges.put(edge, new ChangeTupleSet().makeCanonical() );
231 edgePlannedChanges.put(edge, edgePlannedChanges.get(edge).union(C) );
234 Iterator<ReferenceEdge> refeeItr = n.iteratorToReferencees();
235 while( refeeItr.hasNext() ) {
236 ReferenceEdge edgeF = refeeItr.next();
237 HeapRegionNode m = edgeF.getDst();
239 ChangeTupleSet changesToPass = new ChangeTupleSet().makeCanonical();
241 Iterator<ChangeTuple> itrCprime = C.iterator();
242 while( itrCprime.hasNext() ) {
243 ChangeTuple c = itrCprime.next();
244 if( edgeF.getBeta().contains(c.getSetToMatch() ) ) {
245 changesToPass = changesToPass.union(c);
249 if( !changesToPass.isEmpty() ) {
250 if( !nodePlannedChanges.containsKey(m) ) {
251 nodePlannedChanges.put(m, new ChangeTupleSet().makeCanonical() );
254 ChangeTupleSet currentChanges = nodePlannedChanges.get(m);
256 if( !changesToPass.isSubset(currentChanges) ) {
258 nodePlannedChanges.put(m, currentChanges.union(changesToPass) );
267 propagateTokensOverEdges(todoEdges, edgePlannedChanges, edgesWithNewBeta);
271 protected void propagateTokensOverEdges(
272 HashSet<ReferenceEdge> todoEdges,
273 Hashtable<ReferenceEdge, ChangeTupleSet> edgePlannedChanges,
274 HashSet<ReferenceEdge> edgesWithNewBeta) {
277 while( !todoEdges.isEmpty() ) {
278 ReferenceEdge edgeE = todoEdges.iterator().next();
279 todoEdges.remove(edgeE);
281 if( !edgePlannedChanges.containsKey(edgeE) ) {
282 edgePlannedChanges.put(edgeE, new ChangeTupleSet().makeCanonical() );
285 ChangeTupleSet C = edgePlannedChanges.get(edgeE);
287 ChangeTupleSet changesToPass = new ChangeTupleSet().makeCanonical();
289 Iterator<ChangeTuple> itrC = C.iterator();
290 while( itrC.hasNext() ) {
291 ChangeTuple c = itrC.next();
292 if( edgeE.getBeta().contains(c.getSetToMatch() ) ) {
293 ReachabilitySet withChange = edgeE.getBeta().union(c.getSetToAdd() );
294 edgeE.setBetaNew(edgeE.getBetaNew().union(withChange) );
295 edgesWithNewBeta.add(edgeE);
296 changesToPass = changesToPass.union(c);
300 OwnershipNode onSrc = edgeE.getSrc();
302 if( !changesToPass.isEmpty() && onSrc instanceof HeapRegionNode ) {
303 HeapRegionNode n = (HeapRegionNode) onSrc;
305 Iterator<ReferenceEdge> referItr = n.iteratorToReferencers();
306 while( referItr.hasNext() ) {
307 ReferenceEdge edgeF = referItr.next();
309 if( !edgePlannedChanges.containsKey(edgeF) ) {
310 edgePlannedChanges.put(edgeF, new ChangeTupleSet().makeCanonical() );
313 ChangeTupleSet currentChanges = edgePlannedChanges.get(edgeF);
315 if( !changesToPass.isSubset(currentChanges) ) {
316 todoEdges.add(edgeF);
317 edgePlannedChanges.put(edgeF, currentChanges.union(changesToPass) );
325 ////////////////////////////////////////////////////
327 // Assignment Operation Methods
329 // These methods are high-level operations for
330 // modeling program assignment statements using
331 // the low-level reference create/remove methods
334 // The destination in an assignment statement is
335 // going to have new references. The method of
336 // determining the references depends on the type
337 // of the FlatNode assignment and the predicates
338 // of the nodes and edges involved.
340 ////////////////////////////////////////////////////
341 public void assignTempYToTempX(TempDescriptor y,
344 LabelNode lnX = getLabelNodeFromTemp(x);
345 LabelNode lnY = getLabelNodeFromTemp(y);
347 clearReferenceEdgesFrom(lnX, null, true);
349 Iterator<ReferenceEdge> itrYhrn = lnY.iteratorToReferencees();
350 while( itrYhrn.hasNext() ) {
351 ReferenceEdge edgeY = itrYhrn.next();
352 HeapRegionNode referencee = edgeY.getDst();
353 ReferenceEdge edgeNew = edgeY.copy();
356 addReferenceEdge(lnX, referencee, edgeNew);
361 public void assignTempYFieldFToTempX(TempDescriptor y,
365 LabelNode lnX = getLabelNodeFromTemp(x);
366 LabelNode lnY = getLabelNodeFromTemp(y);
368 clearReferenceEdgesFrom(lnX, null, true);
370 Iterator<ReferenceEdge> itrYhrn = lnY.iteratorToReferencees();
371 while( itrYhrn.hasNext() ) {
372 ReferenceEdge edgeY = itrYhrn.next();
373 HeapRegionNode hrnY = edgeY.getDst();
374 ReachabilitySet betaY = edgeY.getBeta();
376 Iterator<ReferenceEdge> itrHrnFhrn = hrnY.iteratorToReferencees();
377 while( itrHrnFhrn.hasNext() ) {
378 ReferenceEdge edgeHrn = itrHrnFhrn.next();
379 HeapRegionNode hrnHrn = edgeHrn.getDst();
380 ReachabilitySet betaHrn = edgeHrn.getBeta();
382 if( edgeHrn.getFieldDesc() == null ||
383 edgeHrn.getFieldDesc() == f ) {
385 ReferenceEdge edgeNew = new ReferenceEdge(lnX,
389 betaY.intersection(betaHrn) );
391 addReferenceEdge(lnX, hrnHrn, edgeNew);
398 public void assignTempYToTempXFieldF(TempDescriptor y,
402 LabelNode lnX = getLabelNodeFromTemp(x);
403 LabelNode lnY = getLabelNodeFromTemp(y);
405 HashSet<HeapRegionNode> nodesWithNewAlpha = new HashSet<HeapRegionNode>();
406 HashSet<ReferenceEdge> edgesWithNewBeta = new HashSet<ReferenceEdge>();
408 Iterator<ReferenceEdge> itrXhrn = lnX.iteratorToReferencees();
409 while( itrXhrn.hasNext() ) {
410 ReferenceEdge edgeX = itrXhrn.next();
411 HeapRegionNode hrnX = edgeX.getDst();
412 ReachabilitySet betaX = edgeX.getBeta();
414 ReachabilitySet R = hrnX.getAlpha().intersection(edgeX.getBeta() );
416 Iterator<ReferenceEdge> itrYhrn = lnY.iteratorToReferencees();
417 while( itrYhrn.hasNext() ) {
418 ReferenceEdge edgeY = itrYhrn.next();
419 HeapRegionNode hrnY = edgeY.getDst();
420 ReachabilitySet O = edgeY.getBeta();
423 // propagate tokens over nodes starting from hrnSrc, and it will
424 // take care of propagating back up edges from any touched nodes
425 ChangeTupleSet Cy = O.unionUpArityToChangeSet(R);
426 propagateTokensOverNodes(hrnY, Cy, nodesWithNewAlpha, edgesWithNewBeta);
429 // then propagate back just up the edges from hrn
430 ChangeTupleSet Cx = R.unionUpArityToChangeSet(O);
432 HashSet<ReferenceEdge> todoEdges = new HashSet<ReferenceEdge>();
434 Hashtable<ReferenceEdge, ChangeTupleSet> edgePlannedChanges =
435 new Hashtable<ReferenceEdge, ChangeTupleSet>();
437 Iterator<ReferenceEdge> referItr = hrnX.iteratorToReferencers();
438 while( referItr.hasNext() ) {
439 ReferenceEdge edgeUpstream = referItr.next();
440 todoEdges.add(edgeUpstream);
441 edgePlannedChanges.put(edgeUpstream, Cx);
444 propagateTokensOverEdges(todoEdges,
450 //System.out.println( edgeY.getBetaNew() + "\nbeing pruned by\n" + hrnX.getAlpha() );
452 // create the actual reference edge hrnX.f -> hrnY
453 ReferenceEdge edgeNew = new ReferenceEdge(hrnX,
457 edgeY.getBetaNew().pruneBy(hrnX.getAlpha() )
458 //edgeY.getBeta().pruneBy( hrnX.getAlpha() )
460 addReferenceEdge(hrnX, hrnY, edgeNew);
464 // we can do a strong update here if one of two cases holds
465 // SAVE FOR LATER, WITHOUT STILL CORRECT
466 if( (hrnX.getNumReferencers() == 1) ||
467 ( lnX.getNumReferencees() == 1 && hrnX.isSingleObject() )
469 clearReferenceEdgesFrom( hrnX, f, false );
472 addReferenceEdge( hrnX, hrnY, edgeNew );
475 // if the field is null, or "any" field, then
476 // look to see if an any field already exists
477 // and merge with it, otherwise just add the edge
478 ReferenceEdge edgeExisting = hrnX.getReferenceTo( hrnY, f );
480 if( edgeExisting != null ) {
481 edgeExisting.setBetaNew(
482 edgeExisting.getBetaNew().union( edgeNew.getBeta() )
484 // a new edge here cannot be reflexive, so existing will
485 // always be also not reflexive anymore
486 edgeExisting.setIsInitialParamReflexive( false );
489 addReferenceEdge( hrnX, hrnY, edgeNew );
496 Iterator<HeapRegionNode> nodeItr = nodesWithNewAlpha.iterator();
497 while( nodeItr.hasNext() ) {
498 nodeItr.next().applyAlphaNew();
501 Iterator<ReferenceEdge> edgeItr = edgesWithNewBeta.iterator();
502 while( edgeItr.hasNext() ) {
503 edgeItr.next().applyBetaNew();
508 public void assignParameterAllocationToTemp(boolean isTask,
510 Integer paramIndex) {
513 LabelNode lnParam = getLabelNodeFromTemp(td);
514 HeapRegionNode hrn = createNewHeapRegionNode(null,
521 "param" + paramIndex);
523 // this is a non-program-accessible label that picks up beta
524 // info to be used for fixing a caller of this method
525 TempDescriptor tdParamQ = new TempDescriptor(td+"specialQ");
526 LabelNode lnParamQ = getLabelNodeFromTemp(tdParamQ);
528 // keep track of heap regions that were created for
529 // parameter labels, the index of the parameter they
530 // are for is important when resolving method calls
531 Integer newID = hrn.getID();
532 assert !id2paramIndex.containsKey(newID);
533 assert !id2paramIndex.containsValue(paramIndex);
534 id2paramIndex.put(newID, paramIndex);
535 paramIndex2id.put(paramIndex, newID);
536 paramIndex2tdQ.put(paramIndex, tdParamQ);
538 ReachabilitySet beta = new ReachabilitySet(new TokenTuple(newID,
540 TokenTuple.ARITY_ONE) );
542 // heap regions for parameters are always multiple object (see above)
543 // and have a reference to themselves, because we can't know the
544 // structure of memory that is passed into the method. We're assuming
547 ReferenceEdge edgeFromLabel =
548 new ReferenceEdge(lnParam, hrn, null, false, beta);
550 ReferenceEdge edgeFromLabelQ =
551 new ReferenceEdge(lnParamQ, hrn, null, false, beta);
553 ReferenceEdge edgeReflexive =
554 new ReferenceEdge(hrn, hrn, null, true, beta);
556 addReferenceEdge(lnParam, hrn, edgeFromLabel);
557 addReferenceEdge(lnParamQ, hrn, edgeFromLabelQ);
558 addReferenceEdge(hrn, hrn, edgeReflexive);
562 public void assignNewAllocationToTempX(TempDescriptor x,
569 // after the age operation the newest (or zero-ith oldest)
570 // node associated with the allocation site should have
571 // no references to it as if it were a newly allocated
572 // heap region, so make a reference to it to complete
575 Integer idNewest = as.getIthOldest(0);
576 HeapRegionNode hrnNewest = id2hrn.get(idNewest);
577 assert hrnNewest != null;
579 LabelNode lnX = getLabelNodeFromTemp(x);
580 clearReferenceEdgesFrom(lnX, null, true);
582 ReferenceEdge edgeNew =
583 new ReferenceEdge(lnX, hrnNewest, null, false, hrnNewest.getAlpha() );
585 addReferenceEdge(lnX, hrnNewest, edgeNew);
589 // use the allocation site (unique to entire analysis) to
590 // locate the heap region nodes in this ownership graph
591 // that should be aged. The process models the allocation
592 // of new objects and collects all the oldest allocations
593 // in a summary node to allow for a finite analysis
595 // There is an additional property of this method. After
596 // running it on a particular ownership graph (many graphs
597 // may have heap regions related to the same allocation site)
598 // the heap region node objects in this ownership graph will be
599 // allocated. Therefore, after aging a graph for an allocation
600 // site, attempts to retrieve the heap region nodes using the
601 // integer id's contained in the allocation site should always
602 // return non-null heap regions.
603 public void age(AllocationSite as) {
605 // aging adds this allocation site to the graph's
606 // list of sites that exist in the graph, or does
607 // nothing if the site is already in the list
608 allocationSites.add(as);
610 // get the summary node for the allocation site in the context
611 // of this particular ownership graph
612 HeapRegionNode hrnSummary = getSummaryNode(as);
614 // merge oldest node into summary
615 Integer idK = as.getOldest();
616 HeapRegionNode hrnK = id2hrn.get(idK);
617 mergeIntoSummary(hrnK, hrnSummary);
619 // move down the line of heap region nodes
620 // clobbering the ith and transferring all references
621 // to and from i-1 to node i. Note that this clobbers
622 // the oldest node (hrnK) that was just merged into
624 for( int i = allocationDepth - 1; i > 0; --i ) {
626 // move references from the i-1 oldest to the ith oldest
627 Integer idIth = as.getIthOldest(i);
628 HeapRegionNode hrnI = id2hrn.get(idIth);
629 Integer idImin1th = as.getIthOldest(i - 1);
630 HeapRegionNode hrnImin1 = id2hrn.get(idImin1th);
632 transferOnto(hrnImin1, hrnI);
635 // as stated above, the newest node should have had its
636 // references moved over to the second oldest, so we wipe newest
637 // in preparation for being the new object to assign something to
638 Integer id0th = as.getIthOldest(0);
639 HeapRegionNode hrn0 = id2hrn.get(id0th);
642 // clear all references in and out of newest node
643 clearReferenceEdgesFrom(hrn0, null, true);
644 clearReferenceEdgesTo(hrn0, null, true);
647 // now tokens in reachability sets need to "age" also
648 Iterator itrAllLabelNodes = td2ln.entrySet().iterator();
649 while( itrAllLabelNodes.hasNext() ) {
650 Map.Entry me = (Map.Entry)itrAllLabelNodes.next();
651 LabelNode ln = (LabelNode) me.getValue();
653 Iterator<ReferenceEdge> itrEdges = ln.iteratorToReferencees();
654 while( itrEdges.hasNext() ) {
655 ageTokens(as, itrEdges.next() );
659 Iterator itrAllHRNodes = id2hrn.entrySet().iterator();
660 while( itrAllHRNodes.hasNext() ) {
661 Map.Entry me = (Map.Entry)itrAllHRNodes.next();
662 HeapRegionNode hrnToAge = (HeapRegionNode) me.getValue();
664 ageTokens(as, hrnToAge);
666 Iterator<ReferenceEdge> itrEdges = hrnToAge.iteratorToReferencees();
667 while( itrEdges.hasNext() ) {
668 ageTokens(as, itrEdges.next() );
673 // after tokens have been aged, reset newest node's reachability
674 if( hrn0.isFlagged() ) {
675 hrn0.setAlpha(new ReachabilitySet(new TokenTupleSet(
681 hrn0.setAlpha(new ReachabilitySet(new TokenTupleSet()
688 protected HeapRegionNode getSummaryNode(AllocationSite as) {
690 Integer idSummary = as.getSummary();
691 HeapRegionNode hrnSummary = id2hrn.get(idSummary);
693 // If this is null then we haven't touched this allocation site
694 // in the context of the current ownership graph, so allocate
695 // heap region nodes appropriate for the entire allocation site.
696 // This should only happen once per ownership graph per allocation site,
697 // and a particular integer id can be used to locate the heap region
698 // in different ownership graphs that represents the same part of an
700 if( hrnSummary == null ) {
702 boolean hasFlags = false;
703 if( as.getType().isClass() ) {
704 hasFlags = as.getType().getClassDesc().hasFlags();
707 hrnSummary = createNewHeapRegionNode(idSummary,
714 as + "\\n" + as.getType() + "\\nsummary");
716 for( int i = 0; i < as.getAllocationDepth(); ++i ) {
717 Integer idIth = as.getIthOldest(i);
718 assert !id2hrn.containsKey(idIth);
719 createNewHeapRegionNode(idIth,
726 as + "\\n" + as.getType() + "\\n" + i + " oldest");
734 protected HeapRegionNode getShadowSummaryNode(AllocationSite as) {
736 Integer idShadowSummary = as.getSummaryShadow();
737 HeapRegionNode hrnShadowSummary = id2hrn.get(idShadowSummary);
739 if( hrnShadowSummary == null ) {
741 boolean hasFlags = false;
742 if( as.getType().isClass() ) {
743 hasFlags = as.getType().getClassDesc().hasFlags();
746 hrnShadowSummary = createNewHeapRegionNode(idShadowSummary,
753 as + "\\n" + as.getType() + "\\nshadowSum");
755 for( int i = 0; i < as.getAllocationDepth(); ++i ) {
756 Integer idShadowIth = as.getIthOldestShadow(i);
757 assert !id2hrn.containsKey(idShadowIth);
758 createNewHeapRegionNode(idShadowIth,
765 as + "\\n" + as.getType() + "\\n" + i + " shadow");
769 return hrnShadowSummary;
773 protected void mergeIntoSummary(HeapRegionNode hrn, HeapRegionNode hrnSummary) {
774 assert hrnSummary.isNewSummary();
776 // transfer references _from_ hrn over to hrnSummary
777 Iterator<ReferenceEdge> itrReferencee = hrn.iteratorToReferencees();
778 while( itrReferencee.hasNext() ) {
779 ReferenceEdge edge = itrReferencee.next();
780 ReferenceEdge edgeMerged = edge.copy();
781 edgeMerged.setSrc(hrnSummary);
783 HeapRegionNode hrnReferencee = edge.getDst();
784 ReferenceEdge edgeSummary = hrnSummary.getReferenceTo(hrnReferencee, edge.getFieldDesc() );
786 if( edgeSummary == null ) {
787 // the merge is trivial, nothing to be done
789 // otherwise an edge from the referencer to hrnSummary exists already
790 // and the edge referencer->hrn should be merged with it
791 edgeMerged.setBeta(edgeMerged.getBeta().union(edgeSummary.getBeta() ) );
794 addReferenceEdge(hrnSummary, hrnReferencee, edgeMerged);
797 // next transfer references _to_ hrn over to hrnSummary
798 Iterator<ReferenceEdge> itrReferencer = hrn.iteratorToReferencers();
799 while( itrReferencer.hasNext() ) {
800 ReferenceEdge edge = itrReferencer.next();
801 ReferenceEdge edgeMerged = edge.copy();
802 edgeMerged.setDst(hrnSummary);
804 OwnershipNode onReferencer = edge.getSrc();
805 ReferenceEdge edgeSummary = onReferencer.getReferenceTo(hrnSummary, edge.getFieldDesc() );
807 if( edgeSummary == null ) {
808 // the merge is trivial, nothing to be done
810 // otherwise an edge from the referencer to alpha_S exists already
811 // and the edge referencer->alpha_K should be merged with it
812 edgeMerged.setBeta(edgeMerged.getBeta().union(edgeSummary.getBeta() ) );
815 addReferenceEdge(onReferencer, hrnSummary, edgeMerged);
818 // then merge hrn reachability into hrnSummary
819 hrnSummary.setAlpha(hrnSummary.getAlpha().union(hrn.getAlpha() ) );
823 protected void transferOnto(HeapRegionNode hrnA, HeapRegionNode hrnB) {
825 // clear references in and out of node i
826 clearReferenceEdgesFrom(hrnB, null, true);
827 clearReferenceEdgesTo(hrnB, null, true);
829 // copy each edge in and out of A to B
830 Iterator<ReferenceEdge> itrReferencee = hrnA.iteratorToReferencees();
831 while( itrReferencee.hasNext() ) {
832 ReferenceEdge edge = itrReferencee.next();
833 HeapRegionNode hrnReferencee = edge.getDst();
834 ReferenceEdge edgeNew = edge.copy();
835 edgeNew.setSrc(hrnB);
837 addReferenceEdge(hrnB, hrnReferencee, edgeNew);
840 Iterator<ReferenceEdge> itrReferencer = hrnA.iteratorToReferencers();
841 while( itrReferencer.hasNext() ) {
842 ReferenceEdge edge = itrReferencer.next();
843 OwnershipNode onReferencer = edge.getSrc();
844 ReferenceEdge edgeNew = edge.copy();
845 edgeNew.setDst(hrnB);
847 addReferenceEdge(onReferencer, hrnB, edgeNew);
850 // replace hrnB reachability with hrnA's
851 hrnB.setAlpha(hrnA.getAlpha() );
855 protected void ageTokens(AllocationSite as, ReferenceEdge edge) {
856 edge.setBeta(edge.getBeta().ageTokens(as) );
859 protected void ageTokens(AllocationSite as, HeapRegionNode hrn) {
860 hrn.setAlpha(hrn.getAlpha().ageTokens(as) );
863 protected void majorAgeTokens(AllocationSite as, ReferenceEdge edge) {
864 //edge.setBeta( edge.getBeta().majorAgeTokens( as ) );
867 protected void majorAgeTokens(AllocationSite as, HeapRegionNode hrn) {
868 //hrn.setAlpha( hrn.getAlpha().majorAgeTokens( as ) );
872 public void resolveMethodCall(FlatCall fc,
875 OwnershipGraph ogCallee) {
878 // define rewrite rules and other structures to organize
879 // data by parameter/argument index
880 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteH =
881 new Hashtable<Integer, ReachabilitySet>();
883 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteJ =
884 new Hashtable<Integer, ReachabilitySet>();
886 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteK =
887 new Hashtable<Integer, ReachabilitySet>();
889 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteD =
890 new Hashtable<Integer, ReachabilitySet>();
892 // helpful structures
893 Hashtable<TokenTuple, Integer> paramToken2paramIndex =
894 new Hashtable<TokenTuple, Integer>();
896 Hashtable<Integer, TokenTuple> paramIndex2paramToken =
897 new Hashtable<Integer, TokenTuple>();
899 Hashtable<TokenTuple, Integer> paramTokenStar2paramIndex =
900 new Hashtable<TokenTuple, Integer>();
902 Hashtable<Integer, TokenTuple> paramIndex2paramTokenStar =
903 new Hashtable<Integer, TokenTuple>();
905 Hashtable<Integer, LabelNode> paramIndex2ln =
906 new Hashtable<Integer, LabelNode>();
908 Hashtable<Integer, HashSet<HeapRegionNode> > paramIndex2reachableCallerNodes =
909 new Hashtable<Integer, HashSet<HeapRegionNode> >();
912 // add a bogus entry with the identity rule for easy rewrite
913 // of new callee nodes and edges, doesn't belong to any parameter
914 Integer bogusID = new Integer( -1 );
915 Integer bogusIndex = new Integer( -1 );
916 TokenTuple bogusToken = new TokenTuple( bogusID, true, TokenTuple.ARITY_ONE );
917 TokenTuple bogusTokenStar = new TokenTuple( bogusID, true, TokenTuple.ARITY_MANY );
918 ReachabilitySet rsIdentity =
919 new ReachabilitySet( new TokenTupleSet( bogusToken ).makeCanonical() ).makeCanonical();
921 paramIndex2rewriteH.put( bogusIndex, rsIdentity );
922 paramIndex2rewriteJ.put( bogusIndex, rsIdentity );
923 paramToken2paramIndex.put( bogusToken, bogusIndex );
924 paramIndex2paramToken.put( bogusIndex, bogusToken );
925 paramTokenStar2paramIndex.put( bogusTokenStar, bogusIndex );
926 paramIndex2paramTokenStar.put( bogusIndex, bogusTokenStar );
929 for( int i = 0; i < fm.numParameters(); ++i ) {
930 Integer paramIndex = new Integer( i );
932 assert ogCallee.paramIndex2id.containsKey( paramIndex );
933 Integer idParam = ogCallee.paramIndex2id.get( paramIndex );
935 assert ogCallee.id2hrn.containsKey( idParam );
936 HeapRegionNode hrnParam = ogCallee.id2hrn.get( idParam );
937 assert hrnParam != null;
938 paramIndex2rewriteH.put( paramIndex, hrnParam.getAlpha() );
940 ReferenceEdge edgeReflexive_i = hrnParam.getReferenceTo( hrnParam, null );
941 assert edgeReflexive_i != null;
942 paramIndex2rewriteJ.put( paramIndex, edgeReflexive_i.getBeta() );
944 TempDescriptor tdParamQ = ogCallee.paramIndex2tdQ.get( paramIndex );
945 assert tdParamQ != null;
946 LabelNode lnParamQ = ogCallee.td2ln.get( tdParamQ );
947 assert lnParamQ != null;
948 ReferenceEdge edgeSpecialQ_i = lnParamQ.getReferenceTo( hrnParam, null );
949 assert edgeSpecialQ_i != null;
950 paramIndex2rewriteK.put( paramIndex, edgeSpecialQ_i.getBeta() );
952 TokenTuple p_i = new TokenTuple( hrnParam.getID(),
954 TokenTuple.ARITY_ONE ).makeCanonical();
955 paramToken2paramIndex.put( p_i, paramIndex );
956 paramIndex2paramToken.put( paramIndex, p_i );
958 TokenTuple p_i_star = new TokenTuple( hrnParam.getID(),
960 TokenTuple.ARITY_MANY ).makeCanonical();
961 paramTokenStar2paramIndex.put( p_i_star, paramIndex );
962 paramIndex2paramTokenStar.put( paramIndex, p_i_star );
964 // now depending on whether the callee is static or not
965 // we need to account for a "this" argument in order to
966 // find the matching argument in the caller context
967 TempDescriptor argTemp_i;
969 argTemp_i = fc.getArg( paramIndex );
971 if( paramIndex == 0 ) {
972 argTemp_i = fc.getThis();
974 argTemp_i = fc.getArg( paramIndex - 1 );
978 // in non-static methods there is a "this" pointer
979 // that should be taken into account
981 assert fc.numArgs() == fm.numParameters();
983 assert fc.numArgs() + 1 == fm.numParameters();
986 LabelNode argLabel_i = getLabelNodeFromTemp( argTemp_i );
987 paramIndex2ln.put( paramIndex, argLabel_i );
989 ReachabilitySet D_i = new ReachabilitySet().makeCanonical();
990 Iterator<ReferenceEdge> edgeItr = argLabel_i.iteratorToReferencees();
991 while( edgeItr.hasNext() ) {
992 ReferenceEdge edge = edgeItr.next();
993 D_i = D_i.union( edge.getBeta() );
995 D_i = D_i.exhaustiveArityCombinations();
996 paramIndex2rewriteD.put( paramIndex, D_i );
1000 HashSet<HeapRegionNode> nodesWithNewAlpha = new HashSet<HeapRegionNode>();
1001 HashSet<ReferenceEdge> edgesWithNewBeta = new HashSet<ReferenceEdge>();
1003 HashSet<ReferenceEdge> edgesReachable = new HashSet<ReferenceEdge>();
1004 HashSet<ReferenceEdge> edgesUpstream = new HashSet<ReferenceEdge>();
1006 Iterator lnArgItr = paramIndex2ln.entrySet().iterator();
1007 while( lnArgItr.hasNext() ) {
1008 Map.Entry me = (Map.Entry) lnArgItr.next();
1009 Integer index = (Integer) me.getKey();
1010 LabelNode lnArg_i = (LabelNode) me.getValue();
1012 // rewrite alpha for the nodes reachable from argument label i
1013 HashSet<HeapRegionNode> reachableNodes = new HashSet<HeapRegionNode>();
1014 HashSet<HeapRegionNode> todoNodes = new HashSet<HeapRegionNode>();
1016 // to find all reachable nodes, start with label referencees
1017 Iterator<ReferenceEdge> edgeArgItr = lnArg_i.iteratorToReferencees();
1018 while( edgeArgItr.hasNext() ) {
1019 ReferenceEdge edge = edgeArgItr.next();
1020 todoNodes.add( edge.getDst() );
1023 // then follow links until all reachable nodes have been found
1024 while( !todoNodes.isEmpty() ) {
1025 HeapRegionNode hrn = todoNodes.iterator().next();
1026 todoNodes.remove( hrn );
1027 reachableNodes.add( hrn );
1029 Iterator<ReferenceEdge> edgeItr = hrn.iteratorToReferencees();
1030 while( edgeItr.hasNext() ) {
1031 ReferenceEdge edge = edgeItr.next();
1033 if( !reachableNodes.contains( edge.getDst() ) ) {
1034 todoNodes.add( edge.getDst() );
1040 paramIndex2reachableCallerNodes.put( index, reachableNodes );
1042 // now iterate over reachable nodes to update their alpha, and
1043 // classify edges found as "argument reachable" or "upstream"
1044 Iterator<HeapRegionNode> hrnItr = reachableNodes.iterator();
1045 while( hrnItr.hasNext() ) {
1046 HeapRegionNode hrn = hrnItr.next();
1048 rewriteCallerNodeAlpha( fm.numParameters(),
1051 paramIndex2rewriteH,
1052 paramIndex2rewriteD,
1053 paramIndex2paramToken,
1054 paramIndex2paramTokenStar );
1056 nodesWithNewAlpha.add( hrn );
1058 // look at all incoming edges to the reachable nodes
1059 // and sort them as edges reachable from the argument
1060 // label node, or upstream edges
1061 Iterator<ReferenceEdge> edgeItr = hrn.iteratorToReferencers();
1062 while( edgeItr.hasNext() ) {
1063 ReferenceEdge edge = edgeItr.next();
1065 OwnershipNode on = edge.getSrc();
1067 if( on instanceof LabelNode ) {
1069 LabelNode ln0 = (LabelNode) on;
1070 if( ln0.equals( lnArg_i ) ) {
1071 edgesReachable.add( edge );
1073 edgesUpstream.add( edge );
1078 HeapRegionNode hrn0 = (HeapRegionNode) on;
1079 if( reachableNodes.contains( hrn0 ) ) {
1080 edgesReachable.add( edge );
1082 edgesUpstream.add( edge );
1089 // update reachable edges
1090 Iterator<ReferenceEdge> edgeReachableItr = edgesReachable.iterator();
1091 while( edgeReachableItr.hasNext() ) {
1092 ReferenceEdge edgeReachable = edgeReachableItr.next();
1094 rewriteCallerEdgeBeta( fm.numParameters(),
1097 paramIndex2rewriteJ,
1098 paramIndex2rewriteD,
1099 paramIndex2paramToken,
1100 paramIndex2paramTokenStar,
1104 edgesWithNewBeta.add( edgeReachable );
1108 // update upstream edges
1109 Hashtable<ReferenceEdge, ChangeTupleSet> edgeUpstreamPlannedChanges
1110 = new Hashtable<ReferenceEdge, ChangeTupleSet>();
1112 Iterator<ReferenceEdge> edgeUpstreamItr = edgesUpstream.iterator();
1113 while( edgeUpstreamItr.hasNext() ) {
1114 ReferenceEdge edgeUpstream = edgeUpstreamItr.next();
1116 rewriteCallerEdgeBeta( fm.numParameters(),
1119 paramIndex2rewriteK,
1120 paramIndex2rewriteD,
1121 paramIndex2paramToken,
1122 paramIndex2paramTokenStar,
1124 edgeUpstreamPlannedChanges );
1126 edgesWithNewBeta.add( edgeUpstream );
1129 propagateTokensOverEdges( edgesUpstream,
1130 edgeUpstreamPlannedChanges,
1135 // commit changes to alpha and beta
1136 Iterator<HeapRegionNode> nodeItr = nodesWithNewAlpha.iterator();
1137 while( nodeItr.hasNext() ) {
1138 nodeItr.next().applyAlphaNew();
1141 Iterator<ReferenceEdge> edgeItr = edgesWithNewBeta.iterator();
1142 while( edgeItr.hasNext() ) {
1143 edgeItr.next().applyBetaNew();
1148 // verify the existence of allocation sites and their
1149 // shadows from the callee in the context of this caller graph
1150 // then map allocated nodes of callee onto the caller shadows
1152 Iterator<AllocationSite> asItr = ogCallee.allocationSites.iterator();
1153 while( asItr.hasNext() ) {
1154 AllocationSite allocSite = asItr.next();
1155 HeapRegionNode hrnSummary = getSummaryNode( allocSite );
1157 // assert that the shadow nodes have no reference edges
1158 // because they're brand new to the graph, or last time
1159 // they were used they should have been cleared of edges
1160 HeapRegionNode hrnShadowSummary = getShadowSummaryNode( allocSite );
1161 assert hrnShadowSummary.getNumReferencers() == 0;
1162 assert hrnShadowSummary.getNumReferencees() == 0;
1164 // then bring g_ij onto g'_ij and rewrite
1165 transferOnto( hrnSummary, hrnShadowSummary );
1167 // TODO REPLACE NORMAL TOKEN WITH SHADOW TOKEN BEFORE PROCEEDING!!
1169 // shadow nodes only are touched by a rewrite one time,
1170 // so rewrite and immediately commit--and they don't belong
1171 // to a particular parameter, so use a bogus param index
1172 // that pulls a self-rewrite out of H
1173 rewriteCallerNodeAlpha( fm.numParameters(),
1176 paramIndex2rewriteH,
1177 paramIndex2rewriteD,
1178 paramIndex2paramToken,
1179 paramIndex2paramTokenStar );
1182 for( int i = 0; i < allocSite.getAllocationDepth(); ++i ) {
1183 Integer idIth = allocSite.getIthOldest(i);
1184 assert id2hrn.containsKey(idIth);
1185 HeapRegionNode hrnIth = id2hrn.get(idIth);
1187 Integer idShadowIth = -(allocSite.getIthOldest(i));
1188 assert id2hrn.containsKey(idShadowIth);
1189 HeapRegionNode hrnIthShadow = id2hrn.get(idShadowIth);
1190 assert hrnIthShadow.getNumReferencers() == 0;
1191 assert hrnIthShadow.getNumReferencees() == 0;
1193 transferOnto( hrnIth, hrnIthShadow );
1195 rewriteCallerNodeAlpha( fm.numParameters(),
1198 paramIndex2rewriteH,
1199 paramIndex2rewriteD,
1200 paramIndex2paramToken,
1201 paramIndex2paramTokenStar );
1205 // for every heap region->heap region edge in the
1206 // callee graph, create the matching edge or edges
1207 // in the caller graph
1208 Set sCallee = ogCallee.id2hrn.entrySet();
1209 Iterator iCallee = sCallee.iterator();
1210 while( iCallee.hasNext() ) {
1211 Map.Entry meCallee = (Map.Entry) iCallee.next();
1212 Integer idCallee = (Integer) meCallee.getKey();
1213 HeapRegionNode hrnCallee = (HeapRegionNode) meCallee.getValue();
1215 Iterator<ReferenceEdge> heapRegionsItrCallee = hrnCallee.iteratorToReferencees();
1216 while( heapRegionsItrCallee.hasNext() ) {
1217 ReferenceEdge edgeCallee = heapRegionsItrCallee.next();
1218 HeapRegionNode hrnChildCallee = edgeCallee.getDst();
1219 Integer idChildCallee = hrnChildCallee.getID();
1221 // only address this edge if it is not a special reflexive edge
1222 if( !edgeCallee.isInitialParamReflexive() ) {
1224 // now we know that in the callee method's ownership graph
1225 // there is a heap region->heap region reference edge given
1226 // by heap region pointers:
1227 // hrnCallee -> heapChildCallee
1229 // or by the ownership-graph independent ID's:
1230 // idCallee -> idChildCallee
1232 // make the edge with src and dst so beta info is
1233 // calculated once, then copy it for each new edge in caller
1234 ReferenceEdge edgeNewInCallerTemplate = new ReferenceEdge( null,
1236 edgeCallee.getFieldDesc(),
1238 edgeCallee.getBeta() );
1239 rewriteCallerEdgeBeta( fm.numParameters(),
1241 edgeNewInCallerTemplate,
1242 paramIndex2rewriteJ,
1243 paramIndex2rewriteD,
1244 paramIndex2paramToken,
1245 paramIndex2paramTokenStar,
1252 // So now make a set of possible source heaps in the caller graph
1253 // and a set of destination heaps in the caller graph, and make
1254 // a reference edge in the caller for every possible (src,dst) pair
1255 HashSet<HeapRegionNode> possibleCallerSrcs =
1256 getHRNSetThatPossiblyMapToCalleeHRN( ogCallee,
1259 paramIndex2reachableCallerNodes );
1261 HashSet<HeapRegionNode> possibleCallerDsts =
1262 getHRNSetThatPossiblyMapToCalleeHRN( ogCallee,
1265 paramIndex2reachableCallerNodes );
1267 // make every possible pair of {srcSet} -> {dstSet} edges in the caller
1268 Iterator srcItr = possibleCallerSrcs.iterator();
1269 while( srcItr.hasNext() ) {
1270 HeapRegionNode src = (HeapRegionNode) srcItr.next();
1272 Iterator dstItr = possibleCallerDsts.iterator();
1273 while( dstItr.hasNext() ) {
1274 HeapRegionNode dst = (HeapRegionNode) dstItr.next();
1276 ReferenceEdge edgeNewInCaller = edgeNewInCallerTemplate.copy();
1277 edgeNewInCaller.setSrc( src );
1278 edgeNewInCaller.setDst( dst );
1280 ReferenceEdge edgeExisting = src.getReferenceTo( dst, edgeNewInCaller.getFieldDesc() );
1281 if( edgeExisting == null ) {
1282 // if this edge doesn't exist in the caller, create it
1283 addReferenceEdge( src, dst, edgeNewInCaller );
1285 // if it already exists, merge with it
1286 edgeExisting.setBeta( edgeExisting.getBeta().union( edgeNewInCaller.getBeta() ) );
1297 private void rewriteCallerNodeAlpha( int numParameters,
1300 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteH,
1301 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteD,
1302 Hashtable<Integer, TokenTuple> paramIndex2paramToken,
1303 Hashtable<Integer, TokenTuple> paramIndex2paramTokenStar ) {
1305 ReachabilitySet rules = paramIndex2rewriteH.get( paramIndex );
1306 assert rules != null;
1308 TokenTuple tokenToRewrite = paramIndex2paramToken.get( paramIndex );
1309 assert tokenToRewrite != null;
1311 ReachabilitySet r0 = new ReachabilitySet().makeCanonical();
1312 Iterator<TokenTupleSet> ttsItr = rules.iterator();
1313 while( ttsItr.hasNext() ) {
1314 TokenTupleSet tts = ttsItr.next();
1315 r0 = r0.union( tts.rewriteToken( tokenToRewrite,
1321 ReachabilitySet r1 = new ReachabilitySet().makeCanonical();
1322 ttsItr = r0.iterator();
1323 while( ttsItr.hasNext() ) {
1324 TokenTupleSet tts = ttsItr.next();
1325 r1 = r1.union( rewriteDpass( numParameters,
1328 paramIndex2rewriteD,
1329 paramIndex2paramToken,
1330 paramIndex2paramTokenStar ) );
1333 hrn.setAlphaNew( hrn.getAlphaNew().union( r1 ) );
1337 private void rewriteCallerEdgeBeta( int numParameters,
1340 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteJorK,
1341 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteD,
1342 Hashtable<Integer, TokenTuple> paramIndex2paramToken,
1343 Hashtable<Integer, TokenTuple> paramIndex2paramTokenStar,
1344 boolean makeChangeSet,
1345 Hashtable<ReferenceEdge, ChangeTupleSet> edgePlannedChanges) {
1347 ReachabilitySet rules = paramIndex2rewriteJorK.get( paramIndex );
1348 assert rules != null;
1350 TokenTuple tokenToRewrite = paramIndex2paramToken.get( paramIndex );
1351 assert tokenToRewrite != null;
1353 ChangeTupleSet cts0 = new ChangeTupleSet().makeCanonical();
1355 Iterator<TokenTupleSet> ttsItr = rules.iterator();
1356 while( ttsItr.hasNext() ) {
1357 TokenTupleSet tts = ttsItr.next();
1359 Hashtable<TokenTupleSet, TokenTupleSet> forChangeSet =
1360 new Hashtable<TokenTupleSet, TokenTupleSet>();
1362 ReachabilitySet rTemp = tts.rewriteToken( tokenToRewrite,
1367 Iterator fcsItr = forChangeSet.entrySet().iterator();
1368 while( fcsItr.hasNext() ) {
1369 Map.Entry me = (Map.Entry) fcsItr.next();
1370 TokenTupleSet ttsMatch = (TokenTupleSet) me.getKey();
1371 TokenTupleSet ttsAdd = (TokenTupleSet) me.getValue();
1373 ChangeTuple ct = new ChangeTuple( ttsMatch,
1377 cts0 = cts0.union( ct );
1382 ReachabilitySet r1 = new ReachabilitySet().makeCanonical();
1383 ChangeTupleSet cts1 = new ChangeTupleSet().makeCanonical();
1385 Iterator<ChangeTuple> ctItr = cts0.iterator();
1386 while( ctItr.hasNext() ) {
1387 ChangeTuple ct = ctItr.next();
1389 ReachabilitySet rTemp = rewriteDpass( numParameters,
1392 paramIndex2rewriteD,
1393 paramIndex2paramToken,
1394 paramIndex2paramTokenStar
1396 r1 = r1.union( rTemp );
1398 if( makeChangeSet ) {
1399 assert edgePlannedChanges != null;
1401 Iterator<TokenTupleSet> ttsTempItr = rTemp.iterator();
1402 while( ttsTempItr.hasNext() ) {
1403 TokenTupleSet tts = ttsTempItr.next();
1405 ChangeTuple ctFinal = new ChangeTuple( ct.getSetToMatch(),
1409 cts1 = cts1.union( ctFinal );
1414 if( makeChangeSet ) {
1415 edgePlannedChanges.put( edge, cts1 );
1418 edge.setBetaNew( edge.getBetaNew().union( r1 ) );
1422 private ReachabilitySet rewriteDpass( int numParameters,
1424 TokenTupleSet ttsIn,
1425 Hashtable<Integer, ReachabilitySet> paramIndex2rewriteD,
1426 Hashtable<Integer, TokenTuple> paramIndex2paramToken,
1427 Hashtable<Integer, TokenTuple> paramIndex2paramTokenStar ) {
1429 ReachabilitySet rsOut = new ReachabilitySet().makeCanonical();
1431 boolean rewritten = false;
1433 for( int j = 0; j < numParameters; ++j ) {
1434 Integer paramIndexJ = new Integer( j );
1435 ReachabilitySet D_j = paramIndex2rewriteD.get( paramIndexJ );
1438 if( paramIndexJ != paramIndex ) {
1439 TokenTuple tokenToRewriteJ = paramIndex2paramToken.get( paramIndexJ );
1440 assert tokenToRewriteJ != null;
1441 if( ttsIn.containsTuple( tokenToRewriteJ ) ) {
1442 ReachabilitySet r = ttsIn.rewriteToken( tokenToRewriteJ,
1446 Iterator<TokenTupleSet> ttsItr = r.iterator();
1447 while( ttsItr.hasNext() ) {
1448 TokenTupleSet tts = ttsItr.next();
1449 rsOut = rsOut.union( rewriteDpass( numParameters,
1452 paramIndex2rewriteD,
1453 paramIndex2paramToken,
1454 paramIndex2paramTokenStar ) );
1460 TokenTuple tokenStarToRewriteJ = paramIndex2paramTokenStar.get( paramIndexJ );
1461 assert tokenStarToRewriteJ != null;
1462 if( ttsIn.containsTuple( tokenStarToRewriteJ ) ) {
1463 ReachabilitySet r = ttsIn.rewriteToken( tokenStarToRewriteJ,
1467 Iterator<TokenTupleSet> ttsItr = r.iterator();
1468 while( ttsItr.hasNext() ) {
1469 TokenTupleSet tts = ttsItr.next();
1470 rsOut = rsOut.union( rewriteDpass( numParameters,
1473 paramIndex2rewriteD,
1474 paramIndex2paramToken,
1475 paramIndex2paramTokenStar ) );
1482 rsOut = rsOut.union( ttsIn );
1489 private HashSet<HeapRegionNode>
1490 getHRNSetThatPossiblyMapToCalleeHRN( OwnershipGraph ogCallee,
1491 ReferenceEdge edgeCallee,
1493 Hashtable<Integer, HashSet<HeapRegionNode> > paramIndex2reachableCallerNodes
1496 HashSet<HeapRegionNode> possibleCallerHRNs = new HashSet<HeapRegionNode>();
1498 HeapRegionNode hrnCallee;
1500 OwnershipNode on = edgeCallee.getSrc();
1501 assert on instanceof HeapRegionNode;
1502 hrnCallee = (HeapRegionNode) on;
1504 hrnCallee = edgeCallee.getDst();
1507 Integer paramIndexCallee = ogCallee.id2paramIndex.get( hrnCallee.getID() );
1509 if( paramIndexCallee == null ) {
1510 // this is a node allocated in the callee then and it has
1511 // exactly one shadow node in the caller to map to
1512 AllocationSite as = hrnCallee.getAllocationSite();
1515 int age = as.getAge( hrnCallee.getID() );
1516 assert age != AllocationSite.AGE_notInThisSite;
1519 if( age == AllocationSite.AGE_summary ) {
1520 idCaller = as.getSummaryShadow();
1521 } else if( age == AllocationSite.AGE_oldest ) {
1522 idCaller = as.getOldestShadow();
1524 idCaller = as.getIthOldestShadow( age );
1527 assert id2hrn.containsKey( idCaller );
1528 HeapRegionNode hrnCaller = id2hrn.get( idCaller );
1529 possibleCallerHRNs.add( hrnCaller );
1532 // this is a node that was created to represent a parameter
1533 // so it maps to a whole mess of heap regions
1534 assert paramIndex2reachableCallerNodes.containsKey( paramIndexCallee );
1535 possibleCallerHRNs = paramIndex2reachableCallerNodes.get( paramIndexCallee );
1537 // TODO PRUNE BY TYPE/FIELD NAME!!
1540 return possibleCallerHRNs;
1545 ////////////////////////////////////////////////////
1546 // in merge() and equals() methods the suffix A
1547 // represents the passed in graph and the suffix
1548 // B refers to the graph in this object
1549 // Merging means to take the incoming graph A and
1550 // merge it into B, so after the operation graph B
1551 // is the final result.
1552 ////////////////////////////////////////////////////
1553 public void merge(OwnershipGraph og) {
1559 mergeOwnershipNodes(og);
1560 mergeReferenceEdges(og);
1561 mergeId2paramIndex(og);
1562 mergeAllocationSites(og);
1566 protected void mergeOwnershipNodes(OwnershipGraph og) {
1567 Set sA = og.id2hrn.entrySet();
1568 Iterator iA = sA.iterator();
1569 while( iA.hasNext() ) {
1570 Map.Entry meA = (Map.Entry)iA.next();
1571 Integer idA = (Integer) meA.getKey();
1572 HeapRegionNode hrnA = (HeapRegionNode) meA.getValue();
1574 // if this graph doesn't have a node the
1575 // incoming graph has, allocate it
1576 if( !id2hrn.containsKey(idA) ) {
1577 HeapRegionNode hrnB = hrnA.copy();
1578 id2hrn.put(idA, hrnB);
1581 // otherwise this is a node present in both graphs
1582 // so make the new reachability set a union of the
1583 // nodes' reachability sets
1584 HeapRegionNode hrnB = id2hrn.get(idA);
1585 hrnB.setAlpha(hrnB.getAlpha().union(hrnA.getAlpha() ) );
1589 // now add any label nodes that are in graph B but
1591 sA = og.td2ln.entrySet();
1593 while( iA.hasNext() ) {
1594 Map.Entry meA = (Map.Entry)iA.next();
1595 TempDescriptor tdA = (TempDescriptor) meA.getKey();
1596 LabelNode lnA = (LabelNode) meA.getValue();
1598 // if the label doesn't exist in B, allocate and add it
1599 LabelNode lnB = getLabelNodeFromTemp(tdA);
1603 protected void mergeReferenceEdges(OwnershipGraph og) {
1606 Set sA = og.id2hrn.entrySet();
1607 Iterator iA = sA.iterator();
1608 while( iA.hasNext() ) {
1609 Map.Entry meA = (Map.Entry)iA.next();
1610 Integer idA = (Integer) meA.getKey();
1611 HeapRegionNode hrnA = (HeapRegionNode) meA.getValue();
1613 Iterator<ReferenceEdge> heapRegionsItrA = hrnA.iteratorToReferencees();
1614 while( heapRegionsItrA.hasNext() ) {
1615 ReferenceEdge edgeA = heapRegionsItrA.next();
1616 HeapRegionNode hrnChildA = edgeA.getDst();
1617 Integer idChildA = hrnChildA.getID();
1619 // at this point we know an edge in graph A exists
1620 // idA -> idChildA, does this exist in B?
1621 assert id2hrn.containsKey(idA);
1622 HeapRegionNode hrnB = id2hrn.get(idA);
1623 ReferenceEdge edgeToMerge = null;
1625 Iterator<ReferenceEdge> heapRegionsItrB = hrnB.iteratorToReferencees();
1626 while( heapRegionsItrB.hasNext() &&
1627 edgeToMerge == null ) {
1629 ReferenceEdge edgeB = heapRegionsItrB.next();
1630 HeapRegionNode hrnChildB = edgeB.getDst();
1631 Integer idChildB = hrnChildB.getID();
1633 // don't use the ReferenceEdge.equals() here because
1634 // we're talking about existence between graphs
1635 if( idChildB.equals(idChildA) &&
1636 edgeB.getFieldDesc() == edgeA.getFieldDesc() ) {
1637 edgeToMerge = edgeB;
1641 // if the edge from A was not found in B,
1643 if( edgeToMerge == null ) {
1644 assert id2hrn.containsKey(idChildA);
1645 HeapRegionNode hrnChildB = id2hrn.get(idChildA);
1646 edgeToMerge = edgeA.copy();
1647 edgeToMerge.setSrc(hrnB);
1648 edgeToMerge.setDst(hrnChildB);
1649 addReferenceEdge(hrnB, hrnChildB, edgeToMerge);
1651 // otherwise, the edge already existed in both graphs
1652 // so merge their reachability sets
1654 // just replace this beta set with the union
1655 assert edgeToMerge != null;
1656 edgeToMerge.setBeta(
1657 edgeToMerge.getBeta().union(edgeA.getBeta() )
1659 if( !edgeA.isInitialParamReflexive() ) {
1660 edgeToMerge.setIsInitialParamReflexive(false);
1666 // and then again with label nodes
1667 sA = og.td2ln.entrySet();
1669 while( iA.hasNext() ) {
1670 Map.Entry meA = (Map.Entry)iA.next();
1671 TempDescriptor tdA = (TempDescriptor) meA.getKey();
1672 LabelNode lnA = (LabelNode) meA.getValue();
1674 Iterator<ReferenceEdge> heapRegionsItrA = lnA.iteratorToReferencees();
1675 while( heapRegionsItrA.hasNext() ) {
1676 ReferenceEdge edgeA = heapRegionsItrA.next();
1677 HeapRegionNode hrnChildA = edgeA.getDst();
1678 Integer idChildA = hrnChildA.getID();
1680 // at this point we know an edge in graph A exists
1681 // tdA -> idChildA, does this exist in B?
1682 assert td2ln.containsKey(tdA);
1683 LabelNode lnB = td2ln.get(tdA);
1684 ReferenceEdge edgeToMerge = null;
1686 // labels never have edges with a field
1687 //assert edgeA.getFieldDesc() == null;
1689 Iterator<ReferenceEdge> heapRegionsItrB = lnB.iteratorToReferencees();
1690 while( heapRegionsItrB.hasNext() &&
1691 edgeToMerge == null ) {
1693 ReferenceEdge edgeB = heapRegionsItrB.next();
1694 HeapRegionNode hrnChildB = edgeB.getDst();
1695 Integer idChildB = hrnChildB.getID();
1697 // labels never have edges with a field
1698 //assert edgeB.getFieldDesc() == null;
1700 // don't use the ReferenceEdge.equals() here because
1701 // we're talking about existence between graphs
1702 if( idChildB.equals(idChildA) &&
1703 edgeB.getFieldDesc() == edgeA.getFieldDesc() ) {
1704 edgeToMerge = edgeB;
1708 // if the edge from A was not found in B,
1710 if( edgeToMerge == null ) {
1711 assert id2hrn.containsKey(idChildA);
1712 HeapRegionNode hrnChildB = id2hrn.get(idChildA);
1713 edgeToMerge = edgeA.copy();
1714 edgeToMerge.setSrc(lnB);
1715 edgeToMerge.setDst(hrnChildB);
1716 addReferenceEdge(lnB, hrnChildB, edgeToMerge);
1718 // otherwise, the edge already existed in both graphs
1719 // so merge their reachability sets
1721 // just replace this beta set with the union
1722 edgeToMerge.setBeta(
1723 edgeToMerge.getBeta().union(edgeA.getBeta() )
1725 if( !edgeA.isInitialParamReflexive() ) {
1726 edgeToMerge.setIsInitialParamReflexive(false);
1733 // you should only merge ownership graphs that have the
1734 // same number of parameters, or if one or both parameter
1735 // index tables are empty
1736 protected void mergeId2paramIndex(OwnershipGraph og) {
1737 if( id2paramIndex.size() == 0 ) {
1738 id2paramIndex = og.id2paramIndex;
1739 paramIndex2id = og.paramIndex2id;
1740 paramIndex2tdQ = og.paramIndex2tdQ;
1744 if( og.id2paramIndex.size() == 0 ) {
1748 assert id2paramIndex.size() == og.id2paramIndex.size();
1751 protected void mergeAllocationSites(OwnershipGraph og) {
1752 allocationSites.addAll(og.allocationSites);
1757 // it is necessary in the equals() member functions
1758 // to "check both ways" when comparing the data
1759 // structures of two graphs. For instance, if all
1760 // edges between heap region nodes in graph A are
1761 // present and equal in graph B it is not sufficient
1762 // to say the graphs are equal. Consider that there
1763 // may be edges in graph B that are not in graph A.
1764 // the only way to know that all edges in both graphs
1765 // are equally present is to iterate over both data
1766 // structures and compare against the other graph.
1767 public boolean equals(OwnershipGraph og) {
1773 if( !areHeapRegionNodesEqual(og) ) {
1777 if( !areLabelNodesEqual(og) ) {
1781 if( !areReferenceEdgesEqual(og) ) {
1785 if( !areId2paramIndexEqual(og) ) {
1789 // if everything is equal up to this point,
1790 // assert that allocationSites is also equal--
1791 // this data is redundant and kept for efficiency
1792 assert allocationSites.equals(og.allocationSites);
1797 protected boolean areHeapRegionNodesEqual(OwnershipGraph og) {
1799 if( !areallHRNinAalsoinBandequal(this, og) ) {
1803 if( !areallHRNinAalsoinBandequal(og, this) ) {
1810 static protected boolean areallHRNinAalsoinBandequal(OwnershipGraph ogA,
1811 OwnershipGraph ogB) {
1812 Set sA = ogA.id2hrn.entrySet();
1813 Iterator iA = sA.iterator();
1814 while( iA.hasNext() ) {
1815 Map.Entry meA = (Map.Entry)iA.next();
1816 Integer idA = (Integer) meA.getKey();
1817 HeapRegionNode hrnA = (HeapRegionNode) meA.getValue();
1819 if( !ogB.id2hrn.containsKey(idA) ) {
1823 HeapRegionNode hrnB = ogB.id2hrn.get(idA);
1824 if( !hrnA.equalsIncludingAlpha(hrnB) ) {
1833 protected boolean areLabelNodesEqual(OwnershipGraph og) {
1835 if( !areallLNinAalsoinBandequal(this, og) ) {
1839 if( !areallLNinAalsoinBandequal(og, this) ) {
1846 static protected boolean areallLNinAalsoinBandequal(OwnershipGraph ogA,
1847 OwnershipGraph ogB) {
1848 Set sA = ogA.td2ln.entrySet();
1849 Iterator iA = sA.iterator();
1850 while( iA.hasNext() ) {
1851 Map.Entry meA = (Map.Entry)iA.next();
1852 TempDescriptor tdA = (TempDescriptor) meA.getKey();
1854 if( !ogB.td2ln.containsKey(tdA) ) {
1863 protected boolean areReferenceEdgesEqual(OwnershipGraph og) {
1864 if( !areallREinAandBequal(this, og) ) {
1871 static protected boolean areallREinAandBequal(OwnershipGraph ogA,
1872 OwnershipGraph ogB) {
1874 // check all the heap region->heap region edges
1875 Set sA = ogA.id2hrn.entrySet();
1876 Iterator iA = sA.iterator();
1877 while( iA.hasNext() ) {
1878 Map.Entry meA = (Map.Entry)iA.next();
1879 Integer idA = (Integer) meA.getKey();
1880 HeapRegionNode hrnA = (HeapRegionNode) meA.getValue();
1882 // we should have already checked that the same
1883 // heap regions exist in both graphs
1884 assert ogB.id2hrn.containsKey(idA);
1886 if( !areallREfromAequaltoB(ogA, hrnA, ogB) ) {
1890 // then check every edge in B for presence in A, starting
1891 // from the same parent HeapRegionNode
1892 HeapRegionNode hrnB = ogB.id2hrn.get(idA);
1894 if( !areallREfromAequaltoB(ogB, hrnB, ogA) ) {
1899 // then check all the label->heap region edges
1900 sA = ogA.td2ln.entrySet();
1902 while( iA.hasNext() ) {
1903 Map.Entry meA = (Map.Entry)iA.next();
1904 TempDescriptor tdA = (TempDescriptor) meA.getKey();
1905 LabelNode lnA = (LabelNode) meA.getValue();
1907 // we should have already checked that the same
1908 // label nodes exist in both graphs
1909 assert ogB.td2ln.containsKey(tdA);
1911 if( !areallREfromAequaltoB(ogA, lnA, ogB) ) {
1915 // then check every edge in B for presence in A, starting
1916 // from the same parent LabelNode
1917 LabelNode lnB = ogB.td2ln.get(tdA);
1919 if( !areallREfromAequaltoB(ogB, lnB, ogA) ) {
1928 static protected boolean areallREfromAequaltoB(OwnershipGraph ogA,
1930 OwnershipGraph ogB) {
1932 Iterator<ReferenceEdge> itrA = onA.iteratorToReferencees();
1933 while( itrA.hasNext() ) {
1934 ReferenceEdge edgeA = itrA.next();
1935 HeapRegionNode hrnChildA = edgeA.getDst();
1936 Integer idChildA = hrnChildA.getID();
1938 assert ogB.id2hrn.containsKey(idChildA);
1940 // at this point we know an edge in graph A exists
1941 // onA -> idChildA, does this exact edge exist in B?
1942 boolean edgeFound = false;
1944 OwnershipNode onB = null;
1945 if( onA instanceof HeapRegionNode ) {
1946 HeapRegionNode hrnA = (HeapRegionNode) onA;
1947 onB = ogB.id2hrn.get(hrnA.getID() );
1949 LabelNode lnA = (LabelNode) onA;
1950 onB = ogB.td2ln.get(lnA.getTempDescriptor() );
1953 Iterator<ReferenceEdge> itrB = onB.iteratorToReferencees();
1954 while( itrB.hasNext() ) {
1955 ReferenceEdge edgeB = itrB.next();
1956 HeapRegionNode hrnChildB = edgeB.getDst();
1957 Integer idChildB = hrnChildB.getID();
1959 if( idChildA.equals(idChildB) &&
1960 edgeA.getFieldDesc() == edgeB.getFieldDesc() ) {
1962 // there is an edge in the right place with the right field,
1963 // but do they have the same attributes?
1964 if( edgeA.getBeta().equals(edgeB.getBeta() ) ) {
1982 protected boolean areId2paramIndexEqual(OwnershipGraph og) {
1983 return id2paramIndex.size() == og.id2paramIndex.size();
1988 // given a set B of heap region node ID's, return the set of heap
1989 // region node ID's that is reachable from B
1990 public HashSet<Integer> getReachableSet( HashSet<Integer> idSetB ) {
1992 HashSet<HeapRegionNode> toVisit = new HashSet<HeapRegionNode>();
1993 HashSet<HeapRegionNode> visited = new HashSet<HeapRegionNode>();
1995 // initial nodes to visit are from set B
1996 Iterator initialItr = idSetB.iterator();
1997 while( initialItr.hasNext() ) {
1998 Integer idInitial = (Integer) initialItr.next();
1999 assert id2hrn.contains( idInitial );
2000 HeapRegionNode hrnInitial = id2hrn.get( idInitial );
2001 toVisit.add( hrnInitial );
2004 HashSet<Integer> idSetReachableFromB = new HashSet<Integer>();
2006 // do a heap traversal
2007 while( !toVisit.isEmpty() ) {
2008 HeapRegionNode hrnVisited = (HeapRegionNode) toVisit.iterator().next();
2009 toVisit.remove( hrnVisited );
2010 visited.add ( hrnVisited );
2012 // for every node visited, add it to the total
2014 idSetReachableFromB.add( hrnVisited.getID() );
2016 // find other reachable nodes
2017 Iterator referenceeItr = hrnVisited.setIteratorToReferencedRegions();
2018 while( referenceeItr.hasNext() ) {
2019 Map.Entry me = (Map.Entry) referenceeItr.next();
2020 HeapRegionNode hrnReferencee = (HeapRegionNode) me.getKey();
2021 ReferenceEdgeProperties rep = (ReferenceEdgeProperties) me.getValue();
2023 if( !visited.contains( hrnReferencee ) ) {
2024 toVisit.add( hrnReferencee );
2029 return idSetReachableFromB;
2033 // used to find if a heap region can possibly have a reference to
2034 // any of the heap regions in the given set
2035 // if the id supplied is in the set, then a self-referencing edge
2036 // would return true, but that special case is specifically allowed
2037 // meaning that it isn't an external alias
2038 public boolean canIdReachSet( Integer id, HashSet<Integer> idSet ) {
2040 assert id2hrn.contains( id );
2041 HeapRegionNode hrn = id2hrn.get( id );
2044 //HashSet<HeapRegionNode> hrnSet = new HashSet<HeapRegionNode>();
2046 //Iterator i = idSet.iterator();
2047 //while( i.hasNext() ) {
2048 // Integer idFromSet = (Integer) i.next();
2049 // assert id2hrn.contains( idFromSet );
2050 // hrnSet.add( id2hrn.get( idFromSet ) );
2054 // do a traversal from hrn and see if any of the
2055 // heap regions from the set come up during that
2056 HashSet<HeapRegionNode> toVisit = new HashSet<HeapRegionNode>();
2057 HashSet<HeapRegionNode> visited = new HashSet<HeapRegionNode>();
2060 while( !toVisit.isEmpty() ) {
2061 HeapRegionNode hrnVisited = (HeapRegionNode) toVisit.iterator().next();
2062 toVisit.remove( hrnVisited );
2063 visited.add ( hrnVisited );
2065 Iterator referenceeItr = hrnVisited.setIteratorToReferencedRegions();
2066 while( referenceeItr.hasNext() ) {
2067 Map.Entry me = (Map.Entry) referenceeItr.next();
2068 HeapRegionNode hrnReferencee = (HeapRegionNode) me.getKey();
2069 ReferenceEdgeProperties rep = (ReferenceEdgeProperties) me.getValue();
2071 if( idSet.contains( hrnReferencee.getID() ) ) {
2072 if( !id.equals( hrnReferencee.getID() ) ) {
2077 if( !visited.contains( hrnReferencee ) ) {
2078 toVisit.add( hrnReferencee );
2088 // for writing ownership graphs to dot files
2089 public void writeGraph(Descriptor methodDesc,
2091 boolean writeLabels,
2092 boolean labelSelect,
2093 boolean pruneGarbage,
2094 boolean writeReferencers
2095 ) throws java.io.IOException {
2097 methodDesc.getSymbol() +
2098 methodDesc.getNum() +
2107 public void writeGraph(Descriptor methodDesc,
2109 boolean writeLabels,
2110 boolean writeReferencers
2111 ) throws java.io.IOException {
2113 methodDesc.getSymbol() +
2114 methodDesc.getNum() +
2123 public void writeGraph(Descriptor methodDesc,
2124 boolean writeLabels,
2125 boolean writeReferencers
2126 ) throws java.io.IOException {
2128 methodDesc.getSymbol() +
2129 methodDesc.getNum() +
2138 public void writeGraph(Descriptor methodDesc,
2139 boolean writeLabels,
2140 boolean labelSelect,
2141 boolean pruneGarbage,
2142 boolean writeReferencers
2143 ) throws java.io.IOException {
2145 methodDesc.getSymbol() +
2146 methodDesc.getNum() +
2155 public void writeGraph(String graphName,
2156 boolean writeLabels,
2157 boolean labelSelect,
2158 boolean pruneGarbage,
2159 boolean writeReferencers
2160 ) throws java.io.IOException {
2162 // remove all non-word characters from the graph name so
2163 // the filename and identifier in dot don't cause errors
2164 graphName = graphName.replaceAll("[\\W]", "");
2166 BufferedWriter bw = new BufferedWriter(new FileWriter(graphName+".dot") );
2167 bw.write("digraph "+graphName+" {\n");
2168 //bw.write( " size=\"7.5,10\";\n" );
2170 HashSet<HeapRegionNode> visited = new HashSet<HeapRegionNode>();
2172 // then visit every heap region node
2173 if( !pruneGarbage ) {
2174 Set s = id2hrn.entrySet();
2175 Iterator i = s.iterator();
2176 while( i.hasNext() ) {
2177 Map.Entry me = (Map.Entry)i.next();
2178 HeapRegionNode hrn = (HeapRegionNode) me.getValue();
2179 if( !visited.contains(hrn) ) {
2180 traverseHeapRegionNodes(VISIT_HRN_WRITE_FULL,
2190 bw.write(" graphTitle[label=\""+graphName+"\",shape=box];\n");
2193 // then visit every label node, useful for debugging
2195 Set s = td2ln.entrySet();
2196 Iterator i = s.iterator();
2197 while( i.hasNext() ) {
2198 Map.Entry me = (Map.Entry)i.next();
2199 LabelNode ln = (LabelNode) me.getValue();
2202 String labelStr = ln.getTempDescriptorString();
2203 if( labelStr.startsWith("___temp") ||
2204 labelStr.startsWith("___dst") ||
2205 labelStr.startsWith("___srctmp") ||
2206 labelStr.startsWith("___neverused") ) {
2211 bw.write(ln.toString() + ";\n");
2213 Iterator<ReferenceEdge> heapRegionsItr = ln.iteratorToReferencees();
2214 while( heapRegionsItr.hasNext() ) {
2215 ReferenceEdge edge = heapRegionsItr.next();
2216 HeapRegionNode hrn = edge.getDst();
2218 if( pruneGarbage && !visited.contains(hrn) ) {
2219 traverseHeapRegionNodes(VISIT_HRN_WRITE_FULL,
2227 bw.write(" " + ln.toString() +
2228 " -> " + hrn.toString() +
2229 "[label=\"" + edge.toGraphEdgeString() +
2240 protected void traverseHeapRegionNodes(int mode,
2244 HashSet<HeapRegionNode> visited,
2245 boolean writeReferencers
2246 ) throws java.io.IOException {
2248 if( visited.contains(hrn) ) {
2254 case VISIT_HRN_WRITE_FULL:
2256 String attributes = "[";
2258 if( hrn.isSingleObject() ) {
2259 attributes += "shape=box";
2261 attributes += "shape=Msquare";
2264 if( hrn.isFlagged() ) {
2265 attributes += ",style=filled,fillcolor=lightgrey";
2268 attributes += ",label=\"ID" +
2271 hrn.getDescription() +
2273 hrn.getAlphaString() +
2276 bw.write(" " + hrn.toString() + attributes + ";\n");
2281 // useful for debugging
2282 if( writeReferencers ) {
2283 OwnershipNode onRef = null;
2284 Iterator refItr = hrn.iteratorToReferencers();
2285 while( refItr.hasNext() ) {
2286 onRef = (OwnershipNode) refItr.next();
2289 case VISIT_HRN_WRITE_FULL:
2290 bw.write(" " + hrn.toString() +
2291 " -> " + onRef.toString() +
2292 "[color=lightgray];\n");
2298 Iterator<ReferenceEdge> childRegionsItr = hrn.iteratorToReferencees();
2299 while( childRegionsItr.hasNext() ) {
2300 ReferenceEdge edge = childRegionsItr.next();
2301 HeapRegionNode hrnChild = edge.getDst();
2304 case VISIT_HRN_WRITE_FULL:
2305 bw.write(" " + hrn.toString() +
2306 " -> " + hrnChild.toString() +
2307 "[label=\"" + edge.toGraphEdgeString() +
2312 traverseHeapRegionNodes(mode,