soot.jimple.spark.solver.PropMerge Maven / Gradle / Ivy
package soot.jimple.spark.solver;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 2002 Ondrej Lhotak
* %%
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 2.1 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Lesser Public License for more details.
*
* You should have received a copy of the GNU General Lesser Public
* License along with this program. If not, see
* .
* #L%
*/
import java.util.Set;
import java.util.TreeSet;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import soot.jimple.spark.pag.AllocDotField;
import soot.jimple.spark.pag.AllocNode;
import soot.jimple.spark.pag.FieldRefNode;
import soot.jimple.spark.pag.Node;
import soot.jimple.spark.pag.PAG;
import soot.jimple.spark.pag.SparkField;
import soot.jimple.spark.pag.VarNode;
import soot.jimple.spark.sets.P2SetVisitor;
import soot.jimple.spark.sets.PointsToSetInternal;
/**
* Propagates points-to sets along pointer assignment graph using a merging of field reference (Red) nodes to improve
* scalability.
*
* @author Ondrej Lhotak
*/
public class PropMerge extends Propagator {
private static final Logger logger = LoggerFactory.getLogger(PropMerge.class);
protected final Set varNodeWorkList = new TreeSet();
public PropMerge(PAG pag) {
this.pag = pag;
}
/** Actually does the propagation. */
public void propagate() {
new TopoSorter(pag, false).sort();
for (Object object : pag.allocSources()) {
handleAllocNode((AllocNode) object);
}
boolean verbose = pag.getOpts().verbose();
do {
if (verbose) {
logger.debug("Worklist has " + varNodeWorkList.size() + " nodes.");
}
int iter = 0;
while (!varNodeWorkList.isEmpty()) {
VarNode src = (VarNode) varNodeWorkList.iterator().next();
varNodeWorkList.remove(src);
handleVarNode(src);
if (verbose) {
iter++;
if (iter >= 1000) {
iter = 0;
logger.debug("Worklist has " + varNodeWorkList.size() + " nodes.");
}
}
}
if (verbose) {
logger.debug("Now handling field references");
}
for (Object object : pag.storeSources()) {
final VarNode src = (VarNode) object;
Node[] storeTargets = pag.storeLookup(src);
for (Node element0 : storeTargets) {
final FieldRefNode fr = (FieldRefNode) element0;
fr.makeP2Set().addAll(src.getP2Set(), null);
}
}
for (Object object : pag.loadSources()) {
final FieldRefNode src = (FieldRefNode) object;
if (src != src.getReplacement()) {
throw new RuntimeException("shouldn't happen");
}
Node[] targets = pag.loadLookup(src);
for (Node element0 : targets) {
VarNode target = (VarNode) element0;
if (target.makeP2Set().addAll(src.getP2Set(), null)) {
varNodeWorkList.add(target);
}
}
}
} while (!varNodeWorkList.isEmpty());
}
/* End of public methods. */
/* End of package methods. */
/**
* Propagates new points-to information of node src to all its successors.
*/
protected boolean handleAllocNode(AllocNode src) {
boolean ret = false;
Node[] targets = pag.allocLookup(src);
for (Node element : targets) {
if (element.makeP2Set().add(src)) {
varNodeWorkList.add(element);
ret = true;
}
}
return ret;
}
/**
* Propagates new points-to information of node src to all its successors.
*/
protected boolean handleVarNode(final VarNode src) {
boolean ret = false;
if (src.getReplacement() != src) {
return ret;
/*
* throw new RuntimeException( "Got bad node "+src+" with rep "+src.getReplacement() );
*/
}
final PointsToSetInternal newP2Set = src.getP2Set();
if (newP2Set.isEmpty()) {
return false;
}
Node[] simpleTargets = pag.simpleLookup(src);
for (Node element : simpleTargets) {
if (element.makeP2Set().addAll(newP2Set, null)) {
varNodeWorkList.add(element);
ret = true;
}
}
Node[] storeTargets = pag.storeLookup(src);
for (Node element : storeTargets) {
final FieldRefNode fr = (FieldRefNode) element;
if (fr.makeP2Set().addAll(newP2Set, null)) {
ret = true;
}
}
for (final FieldRefNode fr : src.getAllFieldRefs()) {
final SparkField field = fr.getField();
ret = newP2Set.forall(new P2SetVisitor() {
public final void visit(Node n) {
AllocDotField nDotF = pag.makeAllocDotField((AllocNode) n, field);
Node nDotFNode = nDotF.getReplacement();
if (nDotFNode != fr) {
fr.mergeWith(nDotFNode);
returnValue = true;
}
}
}) | ret;
}
// src.getP2Set().flushNew();
return ret;
}
protected PAG pag;
}