Class AnalysisResult<V extends AbstractValue<V>,S extends Store<S>>
java.lang.Object
org.checkerframework.dataflow.analysis.AnalysisResult<V,S>
- Type Parameters:
V
- type of the abstract value that is trackedS
- the store type used in the analysis
- All Implemented Interfaces:
org.plumelib.util.UniqueId
public class AnalysisResult<V extends AbstractValue<V>,S extends Store<S>>
extends Object
implements org.plumelib.util.UniqueId
An
AnalysisResult
represents the result of a org.checkerframework.dataflow analysis by
providing the abstract values given a node or a tree. Note that it does not keep track of custom
results computed by some analysis.-
Field Summary
Modifier and TypeFieldDescriptionprotected final Map<TransferInput<V,
S>, IdentityHashMap<Node, TransferResult<V, S>>> Caches of the analysis results.protected final Map<VariableElement,
V> Map from (effectively final) local variable elements to their abstract value.protected final IdentityHashMap<Block,
TransferInput<V, S>> The transfer inputs of every basic block; assumed to be 'no information' if not present.protected IdentityHashMap<Node,
V> Abstract values of nodes.protected IdentityHashMap<UnaryTree,
BinaryTree> Map from postfix increment or decrement trees that are ASTUnaryTree
s to the synthetic tree that isv + 1
orv - 1
.protected IdentityHashMap<Tree,
Set<Node>> -
Constructor Summary
ModifierConstructorDescriptionAnalysisResult
(IdentityHashMap<Node, V> nodeValues, IdentityHashMap<Block, TransferInput<V, S>> inputs, IdentityHashMap<Tree, Set<Node>> treeLookup, IdentityHashMap<UnaryTree, BinaryTree> postfixLookup, Map<VariableElement, V> finalLocalValues) Initialize with given mappings and empty cache.protected
AnalysisResult
(IdentityHashMap<Node, V> nodeValues, IdentityHashMap<Block, TransferInput<V, S>> inputs, IdentityHashMap<Tree, Set<Node>> treeLookup, IdentityHashMap<UnaryTree, BinaryTree> postfixLookup, Map<VariableElement, V> finalLocalValues, Map<TransferInput<V, S>, IdentityHashMap<Node, TransferResult<V, S>>> analysisCaches) Initialize with given mappings.AnalysisResult
(Map<TransferInput<V, S>, IdentityHashMap<Node, TransferResult<V, S>>> analysisCaches) Initialize empty result with specified cache. -
Method Summary
Modifier and TypeMethodDescriptionvoid
combine
(AnalysisResult<V, S> other) Combine with another analysis result.Returns the value of effectively final local variables.getNodesForTree
(Tree tree) Returns theNode
s corresponding to a particularTree
.getPostfixBinaryTree
(UnaryTree postfixTree) Returns the syntheticv + 1
orv - 1
corresponding to the postfix increment or decrement tree.getStoreAfter
(Tree tree) Returns the store immediately after a givenTree
.getStoreAfter
(Block block) Returns the regular store immediately after a given block.getStoreAfter
(Node node) Returns the store immediately after a givenNode
.getStoreBefore
(Tree tree) Returns the store immediately before a givenTree
.getStoreBefore
(Block block) Returns the regular store immediately before a givenBlock
.getStoreBefore
(Node node) Returns the store immediately before a givenNode
.long
getUid()
lookupResult
(Node node) Returns the cached TransferResult for a given node.static <V> String
nodeValuesToString
(Map<Node, V> nodeValues) Returns a verbose string representation, useful for debugging.runAnalysisFor
(Node node, Analysis.BeforeOrAfter preOrPost) Runs the analysis again within the block ofnode
and returns the store at the location ofnode
.static <V extends AbstractValue<V>,
S extends Store<S>>
SrunAnalysisFor
(Node node, Analysis.BeforeOrAfter preOrPost, TransferInput<V, S> transferInput, IdentityHashMap<Node, V> nodeValues, @Nullable Map<TransferInput<V, S>, IdentityHashMap<Node, TransferResult<V, S>>> analysisCaches) Runs the analysis again within the block ofnode
and returns the store at the location ofnode
.Returns a verbose string representation of this, useful for debugging.static String
treeLookupToString
(Map<Tree, Set<Node>> treeLookup) Returns a verbose string representation of a map, useful for debugging.Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface org.plumelib.util.UniqueId
getClassAndUid
-
Field Details
-
nodeValues
Abstract values of nodes. -
treeLookup
Map from ASTTree
s to sets ofNode
s.Some of those Nodes might not be keys in
nodeValues
. One reason is that the Node is unreachable in the control flow graph, so dataflow never gave it a value. -
postfixLookup
Map from postfix increment or decrement trees that are ASTUnaryTree
s to the synthetic tree that isv + 1
orv - 1
. -
finalLocalValues
Map from (effectively final) local variable elements to their abstract value. -
inputs
protected final IdentityHashMap<Block,TransferInput<V extends AbstractValue<V>, inputsS extends Store<S>>> The transfer inputs of every basic block; assumed to be 'no information' if not present. The inputs are before blocks in forward analysis, and are after blocks in backward analysis. -
analysisCaches
protected final Map<TransferInput<V extends AbstractValue<V>,S extends Store<S>>, analysisCachesIdentityHashMap<Node, TransferResult<V extends AbstractValue<V>, S extends Store<S>>>> Caches of the analysis results. It maps from the TransferInput for a Block to a map. The inner map is from a node within the block to the TransferResult for that node.
-
-
Constructor Details
-
AnalysisResult
protected AnalysisResult(IdentityHashMap<Node, V> nodeValues, IdentityHashMap<Block, TransferInput<V, S>> inputs, IdentityHashMap<Tree, Set<Node>> treeLookup, IdentityHashMap<UnaryTree, BinaryTree> postfixLookup, Map<VariableElement, V> finalLocalValues, Map<TransferInput<V, S>, IdentityHashMap<Node, TransferResult<V, S>>> analysisCaches) Initialize with given mappings.- Parameters:
nodeValues
-nodeValues
inputs
-inputs
treeLookup
-treeLookup
postfixLookup
-postfixLookup
finalLocalValues
-finalLocalValues
analysisCaches
-analysisCaches
-
AnalysisResult
public AnalysisResult(IdentityHashMap<Node, V> nodeValues, IdentityHashMap<Block, TransferInput<V, S>> inputs, IdentityHashMap<Tree, Set<Node>> treeLookup, IdentityHashMap<UnaryTree, BinaryTree> postfixLookup, Map<VariableElement, V> finalLocalValues) Initialize with given mappings and empty cache.- Parameters:
nodeValues
-nodeValues
inputs
-inputs
treeLookup
-treeLookup
postfixLookup
-postfixLookup
finalLocalValues
-finalLocalValues
-
AnalysisResult
public AnalysisResult(Map<TransferInput<V, S>, IdentityHashMap<Node, TransferResult<V, S>>> analysisCaches) Initialize empty result with specified cache.- Parameters:
analysisCaches
-analysisCaches
-
-
Method Details
-
getUid
public long getUid(@UnknownInitialization AnalysisResult<V extends AbstractValue<V>, S extends Store<S>> this) - Specified by:
getUid
in interfaceorg.plumelib.util.UniqueId
-
combine
Combine with another analysis result.- Parameters:
other
- an analysis result to combine with this
-
getFinalLocalValues
Returns the value of effectively final local variables.- Returns:
- the value of effectively final local variables
-
getValue
Returns the abstract value forNode
n
, ornull
if no information is available. Note that if the analysis has not finished yet, this value might not represent the final value for this node.- Parameters:
n
- a node- Returns:
- the abstract value for
Node
n
, ornull
if no information is available
-
getValue
Returns the abstract value forTree
t
, ornull
if no information is available. Note that if the analysis has not finished yet, this value might not represent the final value for this node.- Parameters:
t
- a tree- Returns:
- the abstract value for
Tree
t
, ornull
if no information is available
-
getNodesForTree
Returns theNode
s corresponding to a particularTree
. MultipleNode
s can correspond to a singleTree
because of several reasons:- In a lambda expression such as
() -> 5
the5
is both anIntegerLiteralNode
and aLambdaResultExpressionNode
. - Widening and narrowing primitive conversions can result in
WideningConversionNode
andNarrowingConversionNode
. - Automatic String conversion can result in a
StringConversionNode
. - Trees for
finally
blocks are cloned to achieve a precise CFG. AnyTree
within a finally block can have multiple correspondingNode
s attached to them.
Node
s they are not interested in. - In a lambda expression such as
-
getPostfixBinaryTree
Returns the syntheticv + 1
orv - 1
corresponding to the postfix increment or decrement tree.- Parameters:
postfixTree
- a postfix increment or decrement tree- Returns:
- the synthetic
v + 1
orv - 1
corresponding to the postfix increment or decrement tree
-
getStoreBefore
Returns the store immediately before a givenTree
.- Parameters:
tree
- a tree- Returns:
- the store immediately before a given
Tree
-
getStoreBefore
Returns the store immediately before a givenNode
.- Parameters:
node
- a node- Returns:
- the store immediately before a given
Node
-
getStoreBefore
Returns the regular store immediately before a givenBlock
.- Parameters:
block
- a block- Returns:
- the store right before the given block
-
getStoreAfter
Returns the regular store immediately after a given block.- Parameters:
block
- a block- Returns:
- the store after the given block
-
getStoreAfter
Returns the store immediately after a givenTree
.- Parameters:
tree
- a tree- Returns:
- the store immediately after a given
Tree
-
getStoreAfter
Returns the store immediately after a givenNode
.- Parameters:
node
- a node- Returns:
- the store immediately after a given
Node
-
runAnalysisFor
Runs the analysis again within the block ofnode
and returns the store at the location ofnode
. Ifbefore
is true, then the store immediately before theNode
node
is returned. Otherwise, the store afternode
is returned.If the given
Node
cannot be reached (in the control flow graph), thennull
is returned.- Parameters:
node
- the node to analyzepreOrPost
- which store to return: the store immediately beforenode
or the store afternode
- Returns:
- the store before or after
node
(depends on the value ofbefore
) after running the analysis
-
runAnalysisFor
public static <V extends AbstractValue<V>,S extends Store<S>> S runAnalysisFor(Node node, Analysis.BeforeOrAfter preOrPost, TransferInput<V, S> transferInput, IdentityHashMap<Node, V> nodeValues, @Nullable Map<TransferInput<V, S>, IdentityHashMap<Node, TransferResult<V, S>>> analysisCaches) Runs the analysis again within the block ofnode
and returns the store at the location ofnode
. Ifbefore
is true, then the store immediately before theNode
node
is returned. Otherwise, the store immediately afternode
is returned. IfanalysisCaches
is not null, this method uses a cache.analysisCaches
is a map of a block of node to the cached analysis result. If the cache fortransferInput
is not inanalysisCaches
, this method creates new cache and stores it inanalysisCaches
. The cache is a map of nodes to the analysis results of the nodes.- Type Parameters:
V
- the abstract value type to be tracked by the analysisS
- the store type used in the analysis- Parameters:
node
- the node to analyzepreOrPost
- which store to return: the store immediately beforenode
or the store afternode
transferInput
- a transfer inputnodeValues
-nodeValues
analysisCaches
-analysisCaches
- Returns:
- the store before or after
node
(depends on the value ofbefore
) after running the analysis
-
lookupResult
Returns the cached TransferResult for a given node.- Parameters:
node
- the node for which to look up a result- Returns:
- the TransferResult at the given node
-
toStringDebug
Returns a verbose string representation of this, useful for debugging.- Returns:
- a string representation of this
-
nodeValuesToString
Returns a verbose string representation, useful for debugging. The map has the same type as thenodeValues
field.- Type Parameters:
V
- the type of values in the map- Parameters:
nodeValues
- a map to format- Returns:
- a printed representation of the given map
-
treeLookupToString
Returns a verbose string representation of a map, useful for debugging. The map has the same type as thetreeLookup
field.- Parameters:
treeLookup
- a map to format- Returns:
- a printed representation of the given map
-