DASCA
/
WALA
2
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

fix some comments / javadoc 

git-svn-id: https://wala.svn.sourceforge.net/svnroot/wala/trunk@3829 f5eafffb-2e1d-0410-98e4-8ec43c5233c4
This commit is contained in:
msridhar1 2010-05-07 15:35:26 +00:00
parent 9dfe21c864
commit c8fba1cb0b
2 changed files with 8 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
com.ibm.wala.core/src/com/ibm/wala/dataflow/IFDS/PartiallyBalancedTabulationProblem.java
View File

@ -23,8 +23,8 @@ public interface PartiallyBalancedTabulationProblem<T, P, F> extends TabulationP
public IPartiallyBalancedFlowFunctions<T> getFunctionMap();
/**
* If "node" is reached by a partially balanced parenthesis, what is the entry node we should use as the root of the
* {@link PathEdge} to node?
* If n is reached by a partially balanced parenthesis, what is the entry node we should use as the root of the {@link PathEdge}
* to n? Note that the result <em>must</em> in fact be an entry node of the procedure containing n.
*/
public T getFakeEntry(T node);
public T getFakeEntry(T n);
}

11
com.ibm.wala.core/src/com/ibm/wala/dataflow/IFDS/TabulationSolver.java
View File

@ -610,6 +610,7 @@ public class TabulationSolver<T, P, F> {
if (DEBUG_LEVEL > 0) {
System.err.println(" process callee: " + calleeEntry);
}
// reached := {d1} that reach the callee
MutableSparseIntSet reached = MutableSparseIntSet.makeEmpty();
final Collection<T> returnSitesForCallee = Iterator2Collection.toSet(supergraph.getReturnSites(edge.target, supergraph
.getProcOf(calleeEntry)));
@ -618,7 +619,6 @@ public class TabulationSolver<T, P, F> {
// compute different flow functions for each return site.
for (final T returnSite : returnSitesForCallee) {
IUnaryFlowFunction f = flowFunctionMap.getCallFlowFunction(edge.target, calleeEntry, returnSite);
// reached := {d1} that reach the callee
IntSet r = computeFlow(edge.d2, f);
if (r != null) {
reached.addAll(r);
@ -627,7 +627,6 @@ public class TabulationSolver<T, P, F> {
// in some problems, we also want to consider flow into a callee that can never flow out
// via a return. in this case, the return site is null.
IUnaryFlowFunction f = flowFunctionMap.getCallFlowFunction(edge.target, calleeEntry, null);
// reached := {d1} that reach the callee
IntSet r = computeFlow(edge.d2, f);
if (r != null) {
reached.addAll(r);
@ -656,18 +655,18 @@ public class TabulationSolver<T, P, F> {
T[] exits = supergraph.getExitsForProcedure(p);
for (int e = 0; e < exits.length; e++) {
final T exit = exits[e];
// if "exit" is a valid exit from the callee to the return
// site being processed
if (DEBUG_LEVEL > 0) {
assert supergraph.containsNode(exit);
}
int x_num = supergraph.getLocalBlockNumber(exit);
// reachedBySummary := {d2} s.t. <callee,d1> -> <exit,d2>
// was recorded as a summary edge
IntSet reachedBySummary = summaries.getSummaryEdges(s_p_num, x_num, d1);
if (reachedBySummary != null) {
for (final T returnSite : returnSitesForCallee) {
// if "exit" is a valid exit from the callee to the return
// site being processed
if (supergraph.hasEdge(exit, returnSite)) {
// reachedBySummary := {d2} s.t. <callee,d1> -> <exit,d2>
// was recorded as a summary edge
final IFlowFunction retf = flowFunctionMap.getReturnFlowFunction(edge.target, exit, returnSite);
reachedBySummary.foreach(new IntSetAction() {
public void act(int d2) {