HeapRegionNode primaryI = id2hrn.get( idPrimaryI );
+ /*
System.out.println( " **idPrimaryI="+idPrimaryI );
try {
writeGraph( "paramProblem", true, true, true, false, false );
} catch( IOException e ) {}
-
+ */
assert primaryI != null;
MethodContext mc
) {
- System.out.println( " In mapping proc" );
+ //System.out.println( " In mapping proc" );
String debugCaller = "foo";
String debugCallee = "bar";
System.out.println( " "+mc+" done calling "+fm );
}
- System.out.println( " End mapping proc" );
+ //System.out.println( " End mapping proc" );
}
public void globalSweep() {
- System.out.println( " In global sweep" );
+ //System.out.println( " In global sweep" );
// boldB is part of the phase 1 sweep
Hashtable< Integer, Hashtable<ReferenceEdge, ReachabilitySet> > boldB =
ReferenceEdge edgePrime = itrPrime.next();
ReachabilitySet prevResult = boldB_f.get( edgePrime );
- ReachabilitySet intersection = boldB_f.get( edge ).intersection( edgePrime.getBeta() );
+ ReachabilitySet intersection = boldB_f.get( edge ).intersection( edgePrime.getBeta() );
if( prevResult == null ||
prevResult.union( intersection ).size() > prevResult.size() ) {
if( prevResult == null ) {
boldB_f.put( edgePrime, edgePrime.getBeta().union( intersection ) );
} else {
- boldB_f.put( edgePrime, prevResult.union( intersection ) );
+ boldB_f.put( edgePrime, prevResult .union( intersection ) );
}
workSetEdges.add( edgePrime );
}
// if it isn't allowed, mark for removal
- x++;
- if( x % 1000 == 0 && x > 4000000 ) {
- System.out.println( "x="+x );
+ //x++;
+ //if( x % 1000 == 0 && x > 4000000 ) {
+ //System.out.println( "x="+x );
//System.out.println( boldB.get( ttOld.getToken() ) );
- }
+ //}
Integer idOld = ttOld.getToken();
edgeItr.next().applyBetaNew();
}
- System.out.println( " End global sweep" );
+ //System.out.println( " End global sweep" );
}