Package com.ibm.wala.util.graph
Class GraphReachability<T,S>
- java.lang.Object
-
- com.ibm.wala.util.graph.GraphReachability<T,S>
-
public class GraphReachability<T,S> extends Object
A dataflow system that computes, for each graph node, the set of "interesting" nodes that are reachable
-
-
Constructor Summary
Constructors Constructor Description GraphReachability(Graph<T> g, Predicate<?> filter)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description OrdinalSet<S>
getReachableSet(Object n)
boolean
solve(MonitorUtil.IProgressMonitor monitor)
-
-
-
Constructor Detail
-
GraphReachability
public GraphReachability(Graph<T> g, Predicate<?> filter)
- Parameters:
g
- call graph to analyzefilter
- "interesting" node definition- Throws:
IllegalArgumentException
- if g is null
-
-
Method Detail
-
getReachableSet
public OrdinalSet<S> getReachableSet(Object n) throws IllegalStateException
- Parameters:
n
-- Returns:
- the set of interesting nodes reachable from n
- Throws:
IllegalStateException
-
solve
public boolean solve(MonitorUtil.IProgressMonitor monitor) throws CancelException
- Returns:
- true iff the evaluation of some equation caused a change in the value of some variable.
- Throws:
CancelException
-
-