edu.umd.cs.findbugs.ba.BasicAbstractDataflowAnalysis Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of spotbugs Show documentation
Show all versions of spotbugs Show documentation
SpotBugs: Because it's easy!
The newest version!
/*
* FindBugs - Find Bugs in Java programs
* Copyright (C) 2003-2007 University of Maryland
*
* This library 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 library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package edu.umd.cs.findbugs.ba;
import java.util.IdentityHashMap;
import java.util.Iterator;
import java.util.Map;
import edu.umd.cs.findbugs.ba.deref.UnconditionalValueDerefAnalysis;
import edu.umd.cs.findbugs.ba.deref.UnconditionalValueDerefSet;
/**
* A useful starting point for defining a dataflow analysis. Handles access and
* caching of start and result facts for basic blocks.
*
*
* Subclasses that model instructions within basic blocks should extend
* AbstractDataflowAnalysis.
*
*
* @author David Hovemeyer
*/
public abstract class BasicAbstractDataflowAnalysis implements DataflowAnalysis {
private final IdentityHashMap startFactMap;
private final IdentityHashMap resultFactMap;
/**
* Constructor.
*/
public BasicAbstractDataflowAnalysis() {
this.startFactMap = new IdentityHashMap<>();
this.resultFactMap = new IdentityHashMap<>();
}
/**
* Get an iterator over the result facts.
*/
public Iterator resultFactIterator() {
return resultFactMap.values().iterator();
}
/*
* Default implementation - subclasses may override.
*/
@Override
public String factToString(Fact fact) {
return fact.toString();
}
@Override
public/* final */Fact getStartFact(BasicBlock block) {
return lookupOrCreateFact(startFactMap, block);
}
@Override
public/* final */Fact getResultFact(BasicBlock block) {
return lookupOrCreateFact(resultFactMap, block);
}
/**
* Get dataflow fact at (just before) given Location. Note "before" is meant
* in the logical sense, so for backward analyses, before means after the
* location in the control flow sense.
*
*
* The default implementation ignores instructions within basic blocks.
* Subclasses that model individual instructions must override this method.
*
*
* @param location
* the Location
* @return the dataflow value at given Location
* @throws DataflowAnalysisException
*/
@Override
public Fact getFactAtLocation(Location location) throws DataflowAnalysisException {
return getStartFact(location.getBasicBlock());
}
/**
* Get the dataflow fact representing the point just after given Location.
* Note "after" is meant in the logical sense, so for backward analyses,
* after means before the location in the control flow sense.
*
*
* The default implementation ignores instructions within basic blocks.
* Subclasses that model individual instructions must override this method.
*
*
* @param location
* the Location
* @return the dataflow value after given Location
* @throws DataflowAnalysisException
*/
@Override
public Fact getFactAfterLocation(Location location) throws DataflowAnalysisException {
return getResultFact(location.getBasicBlock());
}
/**
* Get the fact that is true on the given control edge,
* after applying the edge transfer function (if any).
*
* @param edge
* the edge
* @return the fact that is true after applying the edge transfer function
* @throws DataflowAnalysisException
*/
@Override
public/* final */Fact getFactOnEdge(Edge edge) throws DataflowAnalysisException {
BasicBlock block = isForwards() ? edge.getSource() : edge.getTarget();
Fact predFact = createFact();
copy(getResultFact(block), predFact);
edgeTransfer(edge, predFact);
Fact result = createFact();
makeFactTop(result);
if (this instanceof UnconditionalValueDerefAnalysis) {
((UnconditionalValueDerefAnalysis) this).meetInto((UnconditionalValueDerefSet) predFact,
edge, (UnconditionalValueDerefSet) result, true);
} else {
meetInto(predFact, edge, result);
}
return result;
}
/*
* (non-Javadoc)
*
* @see edu.umd.cs.findbugs.ba.DataflowAnalysis#startIteration()
*/
@Override
public void startIteration() {
// Do nothing - subclass may override
}
/*
* (non-Javadoc)
*
* @see edu.umd.cs.findbugs.ba.DataflowAnalysis#finishIteration()
*/
@Override
public void finishIteration() {
// Do nothing - subclass may override
}
/*
* (non-Javadoc)
*
* @see
* edu.umd.cs.findbugs.ba.DataflowAnalysis#edgeTransfer(edu.umd.cs.findbugs
* .ba.Edge, java.lang.Object)
*/
@Override
public void edgeTransfer(Edge edge, Fact fact) throws DataflowAnalysisException {
// By default, edge transfer function is identity.
// Subclasses may override.
}
private Fact lookupOrCreateFact(Map map, BasicBlock block) {
Fact fact = map.get(block);
if (fact == null) {
fact = createFact();
map.put(block, fact);
}
return fact;
}
@Override
public int getLastUpdateTimestamp(Fact fact) {
return 0;
}
@Override
public void setLastUpdateTimestamp(Fact fact, int lastUpdateTimestamp) {
}
}