toTraverse.add(new TraversalInfo(fn, rg, tempDesc));
for(Taint t: conflicts.keySet()) {
toTraverse.add(new TraversalInfo(fn, rg, tempDesc));
for(Taint t: conflicts.keySet()) {
// rehash all effects (as a 5-tuple) by their affected allocation site
for (Taint t : effects.keySet()) {
Set<Effect> localConflicts = conflicts.get(t);
// rehash all effects (as a 5-tuple) by their affected allocation site
for (Taint t : effects.keySet()) {
Set<Effect> localConflicts = conflicts.get(t);
for (Effect e : effects.get(t)) {
BucketOfEffects bucket;
if ((bucket = table.get(e.getAffectedAllocSite())) == null) {
bucket = new BucketOfEffects();
table.put(e.getAffectedAllocSite(), bucket);
}
for (Effect e : effects.get(t)) {
BucketOfEffects bucket;
if ((bucket = table.get(e.getAffectedAllocSite())) == null) {
bucket = new BucketOfEffects();
table.put(e.getAffectedAllocSite(), bucket);
}
- printDebug(javaDebug, "Added Taint" + t + " Effect " + e + "Conflict Status = " + localConflicts.contains(e));
- bucket.add(t, e, localConflicts.contains(e));
+ printDebug(javaDebug, "Added Taint" + t + " Effect " + e + "Conflict Status = " + (localConflicts!=null?localConflicts.contains(e):false));
+ bucket.add(t, e, localConflicts!=null?localConflicts.contains(e):false);