Class DemandRefinementPointsTo.FlowsToComputer

java.lang.Object

com.ibm.wala.demandpa.alg.DemandRefinementPointsTo.PointsToComputer

com.ibm.wala.demandpa.alg.DemandRefinementPointsTo.FlowsToComputer

Enclosing class:

DemandRefinementPointsTo

protected class DemandRefinementPointsTo.FlowsToComputer
extends DemandRefinementPointsTo.PointsToComputer

used to compute "flows-to sets," i.e., all the pointers that can point to some instance key

Field Summary

Fields inherited from class DemandRefinementPointsTo.PointsToComputer

ikAndStates, pkToP2Set, pkToTrackedSet, queriedPkAndState

Modifier and Type	Field	Description
protected final OrdinalSetMapping<InstanceKeyAndState>	ikAndStates	for numbering InstanceKey, StateMachine.State pairs
protected final Map<PointerKeyAndState, MutableIntSet>	pkToP2Set
protected final Map<PointerKeyAndState, MutableIntSet>	pkToTrackedSet
protected final PointerKeyAndState	queriedPkAndState

Constructor Summary

Constructors

Constructor	Description
FlowsToComputer(InstanceKeyAndState ikAndState)

Method Summary

Modifier and Type	Method	Description
protected void	compute()
Collection<PointerKeyAndState>	getComputedFlowsToSet()
protected boolean	handleTrackedPred(MutableIntSet curTrackedSet, PointerKeyAndState predPkAndState, IFlowLabel label)	also update the flows-to set of interest if necessary

Methods inherited from class DemandRefinementPointsTo.PointsToComputer

addAllToP2Set, addToTrackedPToWorklist, calleeSubGraphMissingAndShouldNotBeAdded, find, findOrCreate, getComputedP2Set, handleBackCopy, handleTrackedPointsToWorklist, makePassOverFieldStmts, matchingPToQueried, worklistLoop

Modifier and Type	Method	Description
protected boolean	addAllToP2Set(Map<PointerKeyAndState, MutableIntSet> p2setMap, PointerKeyAndState pkAndState, IntSet vals, IFlowLabel label)
protected void	addToTrackedPToWorklist(PointerKeyAndState pkAndState)
protected boolean	calleeSubGraphMissingAndShouldNotBeAdded(boolean addGraphs, CGNode callee, PointerKeyAndState pkAndState)	when doing backward interprocedural propagation, is it true that we should not add a graph representation for a callee _and_ that the subgraph for the callee is missing?
protected <K> MutableIntSet	find(Map<K, MutableIntSet> M, K key)
protected <K> MutableIntSet	findOrCreate(Map<K, MutableIntSet> M, K key)
Collection<InstanceKeyAndState>	getComputedP2Set(PointerKeyAndState queried)	get a points-to set that has already been computed via some previous call to DemandRefinementPointsTo.PointsToComputer.compute(); does _not_ do any fresh demand-driven computation.
protected void	handleBackCopy(PointerKeyAndState curPkAndState, PointerKey predPk, IFlowLabel label)
void	handleTrackedPointsToWorklist()
void	makePassOverFieldStmts()
protected Collection<PointerKeyAndState>	matchingPToQueried(PointerKeyAndState curPkAndState, PointerKey predPk, IFlowLabel label)
protected void	worklistLoop()

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

FlowsToComputer

public FlowsToComputer(InstanceKeyAndState ikAndState)

Method Details

compute

protected void compute()

Overrides:

compute in class DemandRefinementPointsTo.PointsToComputer

getComputedFlowsToSet

public Collection<PointerKeyAndState> getComputedFlowsToSet()

handleTrackedPred

protected boolean handleTrackedPred(MutableIntSet curTrackedSet,
 PointerKeyAndState predPkAndState,
 IFlowLabel label)

also update the flows-to set of interest if necessary

Overrides:

handleTrackedPred in class DemandRefinementPointsTo.PointsToComputer

Parameters:

curTrackedSet - the tracked locations

predPkAndState - the predecessor