org.checkerframework.dataflow.analysis.BackwardAnalysisImpl Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of checker Show documentation
Show all versions of checker Show documentation
The Checker Framework enhances Java's type system to
make it more powerful and useful. This lets software developers
detect and prevent errors in their Java programs.
The Checker Framework includes compiler plug-ins ("checkers")
that find bugs or verify their absence. It also permits you to
write your own compiler plug-ins.
The newest version!
package org.checkerframework.dataflow.analysis;
import org.checkerframework.checker.interning.qual.FindDistinct;
import org.checkerframework.checker.nullness.qual.Nullable;
import org.checkerframework.checker.nullness.qual.RequiresNonNull;
import org.checkerframework.dataflow.analysis.Store.FlowRule;
import org.checkerframework.dataflow.cfg.ControlFlowGraph;
import org.checkerframework.dataflow.cfg.UnderlyingAST;
import org.checkerframework.dataflow.cfg.block.Block;
import org.checkerframework.dataflow.cfg.block.ConditionalBlock;
import org.checkerframework.dataflow.cfg.block.ExceptionBlock;
import org.checkerframework.dataflow.cfg.block.RegularBlock;
import org.checkerframework.dataflow.cfg.block.SpecialBlock;
import org.checkerframework.dataflow.cfg.block.SpecialBlock.SpecialBlockType;
import org.checkerframework.dataflow.cfg.node.Node;
import org.checkerframework.dataflow.cfg.node.ReturnNode;
import org.checkerframework.javacutil.BugInCF;
import java.util.IdentityHashMap;
import java.util.List;
import java.util.ListIterator;
import java.util.Map;
import java.util.Set;
import javax.lang.model.type.TypeMirror;
/**
* An implementation of a backward analysis to solve a org.checkerframework.dataflow problem given a
* control flow graph and a backward transfer function.
*
* @param the abstract value type to be tracked by the analysis
* @param the store type used in the analysis
* @param the transfer function type that is used to approximate runtime behavior
*/
public class BackwardAnalysisImpl<
V extends AbstractValue,
S extends Store,
T extends BackwardTransferFunction>
extends AbstractAnalysis implements BackwardAnalysis {
// TODO: Add widening support like what the forward analysis does.
/** Out stores after every basic block (assumed to be 'no information' if not present). */
protected final IdentityHashMap outStores = new IdentityHashMap<>();
/**
* Exception store of an exception block, propagated by exceptional successors of its exception
* block, and merged with the normal {@link TransferResult}.
*/
protected final IdentityHashMap exceptionStores = new IdentityHashMap<>();
/** The store right before the entry block. */
protected @Nullable S storeAtEntry = null;
// `@code`, not `@link`, because dataflow module doesn't depend on framework module.
/**
* Construct an object that can perform a org.checkerframework.dataflow backward analysis over a
* control flow graph. When using this constructor, the transfer function is set later by the
* subclass, e.g., {@code org.checkerframework.framework.flow.CFAbstractAnalysis}.
*/
public BackwardAnalysisImpl() {
super(Direction.BACKWARD);
}
/**
* Construct an object that can perform a org.checkerframework.dataflow backward analysis over a
* control flow graph given a transfer function.
*
* @param transferFunction the transfer function
*/
public BackwardAnalysisImpl(T transferFunction) {
this();
this.transferFunction = transferFunction;
}
@Override
public void performAnalysis(ControlFlowGraph cfg) {
if (isRunning) {
throw new BugInCF(
"performAnalysis() shouldn't be called when the analysis is running.");
}
isRunning = true;
try {
init(cfg);
while (!worklist.isEmpty()) {
Block b = worklist.poll();
performAnalysisBlock(b);
}
} finally {
assert isRunning;
// In case performAnalysisBlock crashed, reset isRunning to false.
isRunning = false;
}
}
@Override
public void performAnalysisBlock(Block b) {
switch (b.getType()) {
case REGULAR_BLOCK:
{
RegularBlock rb = (RegularBlock) b;
TransferInput inputAfter = getInput(rb);
assert inputAfter != null : "@AssumeAssertion(nullness): invariant";
currentInput = inputAfter.copy();
Node firstNode = null;
boolean addToWorklistAgain = false;
List nodeList = rb.getNodes();
ListIterator reverseIter = nodeList.listIterator(nodeList.size());
while (reverseIter.hasPrevious()) {
Node node = reverseIter.previous();
assert currentInput != null : "@AssumeAssertion(nullness): invariant";
TransferResult transferResult =
callTransferFunction(node, currentInput);
addToWorklistAgain |= updateNodeValues(node, transferResult);
currentInput = new TransferInput<>(node, this, transferResult);
firstNode = node;
}
// Propagate store to predecessors
for (Block pred : rb.getPredecessors()) {
assert currentInput != null : "@AssumeAssertion(nullness): invariant";
propagateStoresTo(
pred,
firstNode,
currentInput,
FlowRule.EACH_TO_EACH,
addToWorklistAgain);
}
break;
}
case EXCEPTION_BLOCK:
{
ExceptionBlock eb = (ExceptionBlock) b;
TransferInput inputAfter = getInput(eb);
assert inputAfter != null : "@AssumeAssertion(nullness): invariant";
currentInput = inputAfter.copy();
Node node = eb.getNode();
TransferResult transferResult = callTransferFunction(node, currentInput);
boolean addToWorklistAgain = updateNodeValues(node, transferResult);
// Merge transferResult with exceptionStore if there exists one
S exceptionStore = exceptionStores.get(eb);
S mergedStore =
exceptionStore != null
? transferResult
.getRegularStore()
.leastUpperBound(exceptionStore)
: transferResult.getRegularStore();
for (Block pred : eb.getPredecessors()) {
addStoreAfter(pred, node, mergedStore, addToWorklistAgain);
}
break;
}
case CONDITIONAL_BLOCK:
{
ConditionalBlock cb = (ConditionalBlock) b;
TransferInput inputAfter = getInput(cb);
assert inputAfter != null : "@AssumeAssertion(nullness): invariant";
TransferInput input = inputAfter.copy();
for (Block pred : cb.getPredecessors()) {
propagateStoresTo(pred, null, input, FlowRule.EACH_TO_EACH, false);
}
break;
}
case SPECIAL_BLOCK:
{
// Special basic blocks are empty and cannot throw exceptions,
// thus there is no need to perform any analysis.
SpecialBlock sb = (SpecialBlock) b;
SpecialBlockType sType = sb.getSpecialType();
if (sType == SpecialBlockType.ENTRY) {
// storage the store at entry
storeAtEntry = outStores.get(sb);
} else {
assert sType == SpecialBlockType.EXIT
|| sType == SpecialBlockType.EXCEPTIONAL_EXIT;
TransferInput input = getInput(sb);
assert input != null : "@AssumeAssertion(nullness): invariant";
for (Block pred : sb.getPredecessors()) {
propagateStoresTo(pred, null, input, FlowRule.EACH_TO_EACH, false);
}
}
break;
}
default:
throw new BugInCF("Unexpected block type: " + b.getType());
}
}
@Override
public @Nullable TransferInput getInput(Block b) {
return inputs.get(b);
}
@Override
public @Nullable S getEntryStore() {
return storeAtEntry;
}
@Override
protected void initFields(ControlFlowGraph cfg) {
super.initFields(cfg);
outStores.clear();
exceptionStores.clear();
// storeAtEntry is null before analysis begin
storeAtEntry = null;
}
@Override
@RequiresNonNull("cfg")
protected void initInitialInputs() {
worklist.process(cfg);
SpecialBlock regularExitBlock = cfg.getRegularExitBlock();
SpecialBlock exceptionExitBlock = cfg.getExceptionalExitBlock();
if (worklist.depthFirstOrder.get(regularExitBlock) == null
&& worklist.depthFirstOrder.get(exceptionExitBlock) == null) {
throw new BugInCF(
"regularExitBlock and exceptionExitBlock should never both be null at the same"
+ " time.");
}
UnderlyingAST underlyingAST = cfg.getUnderlyingAST();
List returnNodes = cfg.getReturnNodes();
assert transferFunction != null : "@AssumeAssertion(nullness): invariant";
S normalInitialStore = transferFunction.initialNormalExitStore(underlyingAST, returnNodes);
S exceptionalInitialStore = transferFunction.initialExceptionalExitStore(underlyingAST);
// If regularExitBlock or exceptionExitBlock is reachable in the control flow graph, then
// initialize it as a start point of the analysis.
if (worklist.depthFirstOrder.get(regularExitBlock) != null) {
worklist.add(regularExitBlock);
inputs.put(regularExitBlock, new TransferInput<>(null, this, normalInitialStore));
outStores.put(regularExitBlock, normalInitialStore);
}
if (worklist.depthFirstOrder.get(exceptionExitBlock) != null) {
worklist.add(exceptionExitBlock);
inputs.put(
exceptionExitBlock, new TransferInput<>(null, this, exceptionalInitialStore));
outStores.put(exceptionExitBlock, exceptionalInitialStore);
}
if (worklist.isEmpty()) {
throw new BugInCF("The worklist needs at least one exit block as starting point.");
}
if (inputs.isEmpty() || outStores.isEmpty()) {
throw new BugInCF("At least one input and one output store are required.");
}
}
@Override
protected void propagateStoresTo(
Block pred,
@Nullable Node node,
TransferInput currentInput,
FlowRule flowRule,
boolean addToWorklistAgain) {
if (flowRule != FlowRule.EACH_TO_EACH) {
throw new BugInCF(
"Backward analysis always propagates EACH to EACH, because there is no control"
+ " flow.");
}
addStoreAfter(pred, node, currentInput.getRegularStore(), addToWorklistAgain);
}
/**
* Add a store after the basic block {@code pred} by merging with the existing stores for that
* location.
*
* @param pred the basic block
* @param node the node of the basic block {@code b}
* @param s the store being added
* @param addBlockToWorklist whether the basic block {@code b} should be added back to {@code
* Worklist}
*/
protected void addStoreAfter(Block pred, @Nullable Node node, S s, boolean addBlockToWorklist) {
// If the block pred is an exception block, decide whether the block of passing node is an
// exceptional successor of the block pred
TypeMirror excSuccType = getSuccExceptionType(pred, node);
if (excSuccType != null) {
if (isIgnoredExceptionType(excSuccType)) {
return;
}
// If the block of passing node is an exceptional successor of Block pred, propagate
// store to the exceptionStores. Currently it doesn't track the label of an
// exceptional edge from exception block to its exceptional successors in backward
// direction. Instead, all exception stores of exceptional successors of an
// exception block will merge to one exception store at the exception block
ExceptionBlock ebPred = (ExceptionBlock) pred;
S exceptionStore = exceptionStores.get(ebPred);
S newExceptionStore = (exceptionStore != null) ? exceptionStore.leastUpperBound(s) : s;
if (!newExceptionStore.equals(exceptionStore)) {
exceptionStores.put(ebPred, newExceptionStore);
inputs.put(ebPred, new TransferInput(node, this, newExceptionStore));
addBlockToWorklist = true;
}
} else {
S predOutStore = getStoreAfter(pred);
S newPredOutStore = (predOutStore != null) ? predOutStore.leastUpperBound(s) : s;
if (!newPredOutStore.equals(predOutStore)) {
outStores.put(pred, newPredOutStore);
inputs.put(pred, new TransferInput<>(node, this, newPredOutStore));
addBlockToWorklist = true;
}
}
if (addBlockToWorklist) {
addToWorklist(pred);
}
}
/**
* Checks if the block for a node is an exceptional successor of a predecessor block, and if so,
* returns the exception type for the control-flow edge.
*
* @param pred the predecessor block
* @param node the successor node
* @return the exception type leading to a control flow edge from {@code pred} to the block for
* {@code node}, if it exists; {@code null} otherwise
*/
@SuppressWarnings("interning:not.interned") // Block equality
private @Nullable TypeMirror getSuccExceptionType(Block pred, @Nullable Node node) {
if (!(pred instanceof ExceptionBlock) || node == null) {
return null;
}
Block block = node.getBlock();
if (block == null) {
return null;
}
Map> exceptionalSuccessors =
((ExceptionBlock) pred).getExceptionalSuccessors();
for (Map.Entry> excTypeEntry : exceptionalSuccessors.entrySet()) {
for (Block excSuccBlock : excTypeEntry.getValue()) {
if (excSuccBlock == block) {
return excTypeEntry.getKey();
}
}
}
return null;
}
/**
* Returns the store corresponding to the location right after the basic block {@code b}.
*
* @param b the given block
* @return the store right after the given block
*/
protected @Nullable S getStoreAfter(Block b) {
return readFromStore(outStores, b);
}
@Override
public S runAnalysisFor(
@FindDistinct Node node,
Analysis.BeforeOrAfter preOrPost,
TransferInput blockTransferInput,
IdentityHashMap nodeValues,
@Nullable Map, IdentityHashMap>>
analysisCaches) {
Block block = node.getBlock();
assert block != null : "@AssumeAssertion(nullness): invariant";
Node oldCurrentNode = currentNode;
if (isRunning) {
assert currentInput != null : "@AssumeAssertion(nullness): invariant";
return currentInput.getRegularStore();
}
isRunning = true;
try {
switch (block.getType()) {
case REGULAR_BLOCK:
{
RegularBlock rBlock = (RegularBlock) block;
// Apply transfer function to contents until we found the node we are
// looking for.
TransferInput store = blockTransferInput;
List nodeList = rBlock.getNodes();
ListIterator reverseIter = nodeList.listIterator(nodeList.size());
while (reverseIter.hasPrevious()) {
Node n = reverseIter.previous();
setCurrentNode(n);
if (n == node && preOrPost == Analysis.BeforeOrAfter.AFTER) {
return store.getRegularStore();
}
// Copy the store to avoid changing other blocks' transfer inputs in
// {@link #inputs}
TransferResult transferResult =
callTransferFunction(n, store.copy());
if (n == node) {
return transferResult.getRegularStore();
}
store = new TransferInput<>(n, this, transferResult);
}
throw new BugInCF("node %s is not in node.getBlock()=%s", node, block);
}
case EXCEPTION_BLOCK:
{
ExceptionBlock eb = (ExceptionBlock) block;
if (eb.getNode() != node) {
throw new BugInCF(
"Node should be equal to eb.getNode(). But get: node: "
+ node
+ "\teb.getNode(): "
+ eb.getNode());
}
if (preOrPost == Analysis.BeforeOrAfter.AFTER) {
return blockTransferInput.getRegularStore();
}
setCurrentNode(node);
// Copy the store to avoid changing other blocks' transfer inputs in {@link
// #inputs}
TransferResult transferResult =
callTransferFunction(node, blockTransferInput.copy());
// Merge transfer result with the exception store of this exceptional block
S exceptionStore = exceptionStores.get(eb);
return exceptionStore == null
? transferResult.getRegularStore()
: transferResult.getRegularStore().leastUpperBound(exceptionStore);
}
default:
// Only regular blocks and exceptional blocks can hold nodes.
throw new BugInCF("Unexpected block type: " + block.getType());
}
} finally {
setCurrentNode(oldCurrentNode);
isRunning = false;
}
}
}