import java.io.IOException;
import java.util.ArrayList;
+import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import IR.Tree.SubBlockNode;
import IR.Tree.SwitchStatementNode;
import IR.Tree.TertiaryNode;
+import IR.Tree.TreeNode;
public class LocationInference {
// invoked by the method descriptor
private Map<MethodDescriptor, Set<MethodInvokeNode>> mapMethodDescriptorToMethodInvokeNodeSet;
- private Map<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>> mapMethodInvokeNodeToArgIdxMap;
+ private Map<MethodInvokeNode, Map<Integer, NodeTupleSet>> mapMethodInvokeNodeToArgIdxMap;
private Map<MethodDescriptor, MethodLocationInfo> mapMethodDescToMethodLocationInfo;
private Map<ClassDescriptor, LocationInfo> mapClassToLocationInfo;
- private Map<MethodDescriptor, Set<MethodDescriptor>> mapMethodDescToPossibleMethodDescSet;
+ private Map<MethodDescriptor, Set<MethodDescriptor>> mapMethodToCalleeSet;
+
+ public static final String GLOBALLOC = "GLOBALLOC";
+
+ public static final String TOPLOC = "TOPLOC";
+
+ public static final Descriptor GLOBALDESC = new NameDescriptor(GLOBALLOC);
+
+ public static final Descriptor TOPDESC = new NameDescriptor(TOPLOC);
boolean debug = true;
this.mapMethodDescriptorToMethodInvokeNodeSet =
new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
this.mapMethodInvokeNodeToArgIdxMap =
- new HashMap<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>>();
+ new HashMap<MethodInvokeNode, Map<Integer, NodeTupleSet>>();
this.mapMethodDescToMethodLocationInfo = new HashMap<MethodDescriptor, MethodLocationInfo>();
- this.mapMethodDescToPossibleMethodDescSet =
- new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
+ this.mapMethodToCalleeSet = new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
this.mapClassToLocationInfo = new HashMap<ClassDescriptor, LocationInfo>();
}
LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
+ Collections.sort(descriptorListToAnalyze, new Comparator<MethodDescriptor>() {
+ public int compare(MethodDescriptor o1, MethodDescriptor o2) {
+ return o1.getSymbol().compareToIgnoreCase(o2.getSymbol());
+ }
+ });
+
// current descriptors to visit in fixed-point interprocedural analysis,
// prioritized by
// dependency in the call graph
System.out.println();
System.out.println("SSJAVA: Inferencing the lattice from " + md);
- analyzeMethodLattice(md, methodLattice, methodInfo);
+ try {
+ analyzeMethodLattice(md, methodLattice, methodInfo);
+ } catch (CyclicFlowException e) {
+ throw new Error("Fail to generate the method lattice for " + md);
+ }
SSJavaLattice<String> prevMethodLattice = getMethodLattice(md);
MethodLocationInfo prevMethodInfo = getMethodLocationInfo(md);
}
}
-
}
private void setMethodLocInfo(MethodDescriptor md, MethodLocationInfo methodInfo) {
private void checkConsistency(MethodDescriptor md1, MethodDescriptor md2) {
// check that two lattice have the same relations between parameters(+PC
- // LOC, RETURN LOC)
+ // LOC, GLOBAL_LOC RETURN LOC)
- MethodLocationInfo methodInfo1 = getMethodLocationInfo(md1);
+ List<CompositeLocation> list1 = new ArrayList<CompositeLocation>();
+ List<CompositeLocation> list2 = new ArrayList<CompositeLocation>();
- SSJavaLattice<String> lattice1 = getMethodLattice(md1);
- SSJavaLattice<String> lattice2 = getMethodLattice(md2);
+ MethodLocationInfo locInfo1 = getMethodLocationInfo(md1);
+ MethodLocationInfo locInfo2 = getMethodLocationInfo(md2);
- Set<String> paramLocNameSet1 = methodInfo1.getParameterLocNameSet();
+ Map<Integer, CompositeLocation> paramMap1 = locInfo1.getMapParamIdxToInferLoc();
+ Map<Integer, CompositeLocation> paramMap2 = locInfo2.getMapParamIdxToInferLoc();
- for (Iterator iterator = paramLocNameSet1.iterator(); iterator.hasNext();) {
- String locName1 = (String) iterator.next();
- for (Iterator iterator2 = paramLocNameSet1.iterator(); iterator2.hasNext();) {
- String locName2 = (String) iterator2.next();
+ int numParam = locInfo1.getMapParamIdxToInferLoc().keySet().size();
+ // add location types of paramters
+ for (int idx = 0; idx < numParam; idx++) {
+ list1.add(paramMap1.get(Integer.valueOf(idx)));
+ list2.add(paramMap2.get(Integer.valueOf(idx)));
+ }
- if (!locName1.equals(locName2)) {
+ // add program counter location
+ list1.add(locInfo1.getPCLoc());
+ list2.add(locInfo2.getPCLoc());
+
+ if (!md1.getReturnType().isVoid()) {
+ // add return value location
+ CompositeLocation rtrLoc1 =
+ new CompositeLocation(new Location(md1, locInfo1.getReturnLocName()));
+ CompositeLocation rtrLoc2 =
+ new CompositeLocation(new Location(md2, locInfo2.getReturnLocName()));
+ list1.add(rtrLoc1);
+ list2.add(rtrLoc2);
+ }
+
+ // add global location type
+ if (md1.isStatic()) {
+ CompositeLocation globalLoc1 =
+ new CompositeLocation(new Location(md1, locInfo1.getGlobalLocName()));
+ CompositeLocation globalLoc2 =
+ new CompositeLocation(new Location(md2, locInfo2.getGlobalLocName()));
+ list1.add(globalLoc1);
+ list2.add(globalLoc2);
+ }
- boolean r1 = lattice1.isGreaterThan(locName1, locName2);
- boolean r2 = lattice2.isGreaterThan(locName1, locName2);
+ for (int i = 0; i < list1.size(); i++) {
+ CompositeLocation locA1 = list1.get(i);
+ CompositeLocation locA2 = list2.get(i);
+ for (int k = 0; k < list1.size(); k++) {
+ if (i != k) {
+ CompositeLocation locB1 = list1.get(k);
+ CompositeLocation locB2 = list2.get(k);
+ boolean r1 = isGreaterThan(getLattice(md1), locA1, locB1);
+
+ boolean r2 = isGreaterThan(getLattice(md1), locA2, locB2);
if (r1 != r2) {
throw new Error("The method " + md1 + " is not consistent with the method " + md2
- + ".:: They have a different ordering relation between parameters " + locName1
- + " and " + locName2 + ".");
+ + ".:: They have a different ordering relation between locations (" + locA1 + ","
+ + locB1 + ") and (" + locA2 + "," + locB2 + ").");
}
}
-
}
}
}
private void analyzeMethodLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
- MethodLocationInfo methodInfo) {
+ MethodLocationInfo methodInfo) throws CyclicFlowException {
// first take a look at method invocation nodes to newly added relations
// from the callee
- analyzeLatticeMethodInvocationNode(md);
+ analyzeLatticeMethodInvocationNode(md, methodLattice, methodInfo);
- // grab the this location if the method use the 'this' reference
- String thisLocSymbol = md.getThis().getSymbol();
- // if (methodLattice.getKeySet().contains(thisLocSymbol)) {
- methodInfo.setThisLocName(thisLocSymbol);
- // }
+ if (!md.isStatic()) {
+ // set the this location
+ String thisLocSymbol = md.getThis().getSymbol();
+ methodInfo.setThisLocName(thisLocSymbol);
+ }
+
+ // set the global location
+ methodInfo.setGlobalLocName(LocationInference.GLOBALLOC);
// visit each node of method flow graph
FlowGraph fg = getFlowGraph(md);
}
}
+ // create mapping from param idx to inferred composite location
+
+ int offset;
+ if (!md.isStatic()) {
+ // add 'this' reference location
+ offset = 1;
+ methodInfo.addMapParamIdxToInferLoc(0, methodInfo.getInferLocation(md.getThis()));
+ } else {
+ offset = 0;
+ }
+
+ for (int idx = 0; idx < md.numParameters(); idx++) {
+ Descriptor paramDesc = md.getParameter(idx);
+ CompositeLocation inferParamLoc = methodInfo.getInferLocation(paramDesc);
+ methodInfo.addMapParamIdxToInferLoc(idx + offset, inferParamLoc);
+ }
+
+ // calculate the initial program counter location
+ // PC location is higher than location types of all parameters
+ String pcLocSymbol = "PCLOC";
+ Map<Integer, CompositeLocation> mapParamToLoc = methodInfo.getMapParamIdxToInferLoc();
+ Set<Integer> keySet = mapParamToLoc.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Integer paramIdx = (Integer) iterator.next();
+ CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
+ String paramLocLocalSymbol = inferLoc.get(0).getLocIdentifier();
+ if (!methodLattice.isGreaterThan(pcLocSymbol, paramLocLocalSymbol)) {
+ addRelationHigherToLower(methodLattice, methodInfo, pcLocSymbol, paramLocLocalSymbol);
+ }
+ }
+
// calculate a return location
+ // the return location type is lower than all parameters
if (!md.getReturnType().isVoid()) {
- Set<FlowNode> returnNodeSet = fg.getReturnNodeSet();
- Set<String> returnVarSymbolSet = new HashSet<String>();
- for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
- FlowNode rtrNode = (FlowNode) iterator.next();
- String localSymbol = rtrNode.getDescTuple().get(0).getSymbol();
- returnVarSymbolSet.add(localSymbol);
+ String returnLocSymbol = "RETURNLOC";
+
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Integer paramIdx = (Integer) iterator.next();
+ CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
+ String paramLocLocalSymbol = inferLoc.get(0).getLocIdentifier();
+ if (!methodLattice.isGreaterThan(paramLocLocalSymbol, returnLocSymbol)) {
+ addRelationHigherToLower(methodLattice, methodInfo, paramLocLocalSymbol, returnLocSymbol);
+ }
+ }
+ }
+
+ }
+
+ private boolean isGreaterThan(SSJavaLattice<String> methodLattice, CompositeLocation comp1,
+ CompositeLocation comp2) {
+
+ int size = comp1.getSize() >= comp2.getSize() ? comp2.getSize() : comp1.getSize();
+
+ for (int idx = 0; idx < size; idx++) {
+ Location loc1 = comp1.get(idx);
+ Location loc2 = comp2.get(idx);
+
+ Descriptor desc1 = loc1.getDescriptor();
+ Descriptor desc2 = loc2.getDescriptor();
+
+ if (!desc1.equals(desc2)) {
+ throw new Error("Fail to compare " + comp1 + " and " + comp2);
}
- String returnGLB = methodLattice.getGLB(returnVarSymbolSet);
- if (returnGLB.equals(SSJavaAnalysis.BOTTOM)) {
- // need to insert a new location in-between the bottom and all locations
- // that is directly connected to the bottom
- String returnNewLocationSymbol = "Loc" + (SSJavaLattice.seed++);
- methodLattice.insertNewLocationAtOneLevelHigher(returnGLB, returnNewLocationSymbol);
- methodInfo.setReturnLocName(returnNewLocationSymbol);
+ String symbol1 = loc1.getLocIdentifier();
+ String symbol2 = loc2.getLocIdentifier();
+
+ SSJavaLattice<String> lattice;
+ if (idx == 0) {
+ lattice = methodLattice;
+ } else {
+ lattice = getLattice(desc1);
+ }
+ if (symbol1.equals(symbol2)) {
+ continue;
+ } else if (lattice.isGreaterThan(symbol1, symbol2)) {
+ return true;
} else {
- methodInfo.setReturnLocName(returnGLB);
+ return false;
}
+
}
+ return false;
}
private void recursiveAddRelationToLattice(int idx, MethodDescriptor md,
- CompositeLocation srcInferLoc, CompositeLocation dstInferLoc) {
+ CompositeLocation srcInferLoc, CompositeLocation dstInferLoc) throws CyclicFlowException {
String srcLocSymbol = srcInferLoc.get(idx).getLocIdentifier();
String dstLocSymbol = dstInferLoc.get(idx).getLocIdentifier();
}
- private void analyzeLatticeMethodInvocationNode(MethodDescriptor mdCaller) {
+ private void analyzeLatticeMethodInvocationNode(MethodDescriptor mdCaller,
+ SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo)
+ throws CyclicFlowException {
// the transformation for a call site propagates all relations between
// parameters from the callee
Set<MethodInvokeNode> setMethodInvokeNode =
mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
+
if (setMethodInvokeNode != null) {
for (Iterator iterator = setMethodInvokeNode.iterator(); iterator.hasNext();) {
if (mdCallee.isStatic()) {
setPossibleCallees.add(mdCallee);
} else {
- setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(mdCallee));
+ Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getMethods(mdCallee);
+ // removes method descriptors that are not invoked by the caller
+ calleeSet.retainAll(mapMethodToCalleeSet.get(mdCaller));
+ setPossibleCallees.addAll(calleeSet);
}
for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
- propagateRelationToCaller(min, mdCaller, possibleMdCallee);
+ propagateRelationToCaller(min, mdCaller, possibleMdCallee, methodLattice, methodInfo);
}
}
}
private void propagateRelationToCaller(MethodInvokeNode min, MethodDescriptor mdCaller,
- MethodDescriptor possibleMdCallee) {
+ MethodDescriptor possibleMdCallee, SSJavaLattice<String> methodLattice,
+ MethodLocationInfo methodInfo) throws CyclicFlowException {
SSJavaLattice<String> calleeLattice = getMethodLattice(possibleMdCallee);
-
+ MethodLocationInfo calleeLocInfo = getMethodLocationInfo(possibleMdCallee);
FlowGraph calleeFlowGraph = getFlowGraph(possibleMdCallee);
- // find parameter node
- Set<FlowNode> paramNodeSet = calleeFlowGraph.getParameterNodeSet();
-
- for (Iterator iterator = paramNodeSet.iterator(); iterator.hasNext();) {
- FlowNode paramFlowNode1 = (FlowNode) iterator.next();
-
- for (Iterator iterator2 = paramNodeSet.iterator(); iterator2.hasNext();) {
- FlowNode paramFlowNode2 = (FlowNode) iterator2.next();
-
- String paramSymbol1 = getSymbol(0, paramFlowNode1);
- String paramSymbol2 = getSymbol(0, paramFlowNode2);
- // if two parameters have a relation, we need to propagate this relation
- // to the caller
- if (!(paramSymbol1.equals(paramSymbol2))
- && calleeLattice.isComparable(paramSymbol1, paramSymbol2)) {
- int higherLocIdxCallee;
- int lowerLocIdxCallee;
- if (calleeLattice.isGreaterThan(paramSymbol1, paramSymbol2)) {
- higherLocIdxCallee = calleeFlowGraph.getParamIdx(paramFlowNode1.getDescTuple());
- lowerLocIdxCallee = calleeFlowGraph.getParamIdx(paramFlowNode2.getDescTuple());
- } else {
- higherLocIdxCallee = calleeFlowGraph.getParamIdx(paramFlowNode2.getDescTuple());
- lowerLocIdxCallee = calleeFlowGraph.getParamIdx(paramFlowNode1.getDescTuple());
- }
+ int numParam = calleeLocInfo.getNumParam();
+ for (int i = 0; i < numParam; i++) {
+ CompositeLocation param1 = calleeLocInfo.getParamCompositeLocation(i);
+ for (int k = 0; k < numParam; k++) {
+ if (i != k) {
+ CompositeLocation param2 = calleeLocInfo.getParamCompositeLocation(k);
+ if (isGreaterThan(getLattice(possibleMdCallee), param1, param2)) {
+ NodeTupleSet argDescTupleSet1 = getNodeTupleSetByArgIdx(min, i);
+ NodeTupleSet argDescTupleSet2 = getNodeTupleSetByArgIdx(min, k);
- NTuple<Descriptor> higherArg = getArgTupleByArgIdx(min, higherLocIdxCallee);
- NTuple<Descriptor> lowerArg = getArgTupleByArgIdx(min, lowerLocIdxCallee);
+ // the callee has the relation in which param1 is higher than param2
+ // therefore, the caller has to have the relation in which arg1 is
+ // higher than arg2
- addFlowGraphEdge(mdCaller, higherArg, lowerArg);
+ for (Iterator<NTuple<Descriptor>> iterator = argDescTupleSet1.iterator(); iterator
+ .hasNext();) {
+ NTuple<Descriptor> argDescTuple1 = iterator.next();
- }
+ for (Iterator<NTuple<Descriptor>> iterator2 = argDescTupleSet2.iterator(); iterator2
+ .hasNext();) {
+ NTuple<Descriptor> argDescTuple2 = iterator2.next();
+
+ // retreive inferred location by the local var descriptor
+
+ NTuple<Location> tuple1 = getFlowGraph(mdCaller).getLocationTuple(argDescTuple1);
+ NTuple<Location> tuple2 = getFlowGraph(mdCaller).getLocationTuple(argDescTuple2);
+
+ // CompositeLocation higherInferLoc =
+ // methodInfo.getInferLocation(argTuple1.get(0));
+ // CompositeLocation lowerInferLoc =
+ // methodInfo.getInferLocation(argTuple2.get(0));
+
+ CompositeLocation inferLoc1 =
+ calcualteInferredCompositeLocation(methodInfo, tuple1);
+ CompositeLocation inferLoc2 =
+ calcualteInferredCompositeLocation(methodInfo, tuple2);
+
+ addRelation(methodLattice, methodInfo, inferLoc1, inferLoc2);
+ }
+
+ }
+
+ }
+ }
}
+ }
+
+ }
+
+ private CompositeLocation calcualteInferredCompositeLocation(MethodLocationInfo methodInfo,
+ NTuple<Location> tuple) {
+
+ // first, retrieve inferred location by the local var descriptor
+
+ CompositeLocation inferLoc = new CompositeLocation();
+ CompositeLocation localVarInferLoc =
+ methodInfo.getInferLocation(tuple.get(0).getLocDescriptor());
+ for (int i = 0; i < localVarInferLoc.getSize(); i++) {
+ inferLoc.addLocation(localVarInferLoc.get(i));
+ }
+
+ for (int i = 1; i < tuple.size(); i++) {
+ Location cur = tuple.get(i);
+ Descriptor enclosingDesc = cur.getDescriptor();
+ Descriptor curDesc = cur.getLocDescriptor();
+
+ String fieldLocSymbol =
+ getLocationInfo(enclosingDesc).getInferLocation(curDesc).get(0).getLocIdentifier();
+ Location inferLocElement = new Location(enclosingDesc, fieldLocSymbol);
+
+ inferLoc.addLocation(inferLocElement);
+
+ }
+
+ return inferLoc;
+ }
+
+ private void addRelation(SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo,
+ CompositeLocation srcInferLoc, CompositeLocation dstInferLoc) throws CyclicFlowException {
+
+ String srcLocalLocSymbol = srcInferLoc.get(0).getLocIdentifier();
+ String dstLocalLocSymbol = dstInferLoc.get(0).getLocIdentifier();
+
+ if (srcInferLoc.getSize() == 1 && dstInferLoc.getSize() == 1) {
+ // add a new relation to the local lattice
+ addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
+ } else if (srcInferLoc.getSize() > 1 && dstInferLoc.getSize() > 1) {
+ // both src and dst have assigned to a composite location
+
+ if (!srcLocalLocSymbol.equals(dstLocalLocSymbol)) {
+ addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
+ } else {
+ recursivelyAddRelation(1, srcInferLoc, dstInferLoc);
+ }
+ } else {
+ // either src or dst has assigned to a composite location
+ if (!srcLocalLocSymbol.equals(dstLocalLocSymbol)) {
+ addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
+ }
}
}
}
private void addRelationToLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
- MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode) {
+ MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode) throws CyclicFlowException {
System.out.println();
System.out.println("### addRelationToLattice src=" + srcNode + " dst=" + dstNode);
// add a new binary relation of dstNode < srcNode
FlowGraph flowGraph = getFlowGraph(md);
- // MethodLocationInfo methodInfo = getMethodLocationInfo(md);
-
- // String srcOriginSymbol = getSymbol(0, srcNode);
- // String dstOriginSymbol = getSymbol(0, dstNode);
-
- Descriptor srcDesc = getDescriptor(0, srcNode);
- Descriptor dstDesc = getDescriptor(0, dstNode);
- // consider a composite location case
- boolean isSrcLocalVar = false;
- boolean isDstLocalVar = false;
- if (srcNode.getDescTuple().size() == 1) {
- isSrcLocalVar = true;
- }
-
- if (dstNode.getDescTuple().size() == 1) {
- isDstLocalVar = true;
- }
-
- boolean isAssignedCompositeLocation = false;
- if (!methodInfo.getInferLocation(srcDesc).get(0).getLocIdentifier()
- .equals(methodInfo.getThisLocName())) {
- isAssignedCompositeLocation =
- calculateCompositeLocation(flowGraph, methodLattice, methodInfo, srcNode);
+ calculateCompositeLocation(flowGraph, methodLattice, methodInfo, srcNode);
+
+ CompositeLocation srcInferLoc =
+ calcualteInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(srcNode));
+ CompositeLocation dstInferLoc =
+ calcualteInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(dstNode));
+
+ try {
+ addRelation(methodLattice, methodInfo, srcInferLoc, dstInferLoc);
+ } catch (CyclicFlowException e) {
+ // there is a cyclic value flow... try to calculate a composite location
+ // for the destination node
+ calculateCompositeLocation(flowGraph, methodLattice, methodInfo, dstNode);
+ dstInferLoc =
+ calcualteInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(dstNode));
+ try {
+ addRelation(methodLattice, methodInfo, srcInferLoc, dstInferLoc);
+ } catch (CyclicFlowException e1) {
+ throw new Error("Failed to merge cyclic value flows into a shared location.");
+ }
}
- String srcSymbol = methodInfo.getInferLocation(srcDesc).get(0).getLocIdentifier();
- String dstSymbol = methodInfo.getInferLocation(dstDesc).get(0).getLocIdentifier();
-
-
- if (srcNode.isParameter()) {
- int paramIdx = flowGraph.getParamIdx(srcNode.getDescTuple());
- methodInfo.addParameter(srcSymbol, srcDesc, paramIdx);
- } else {
- // methodInfo.addMappingOfLocNameToDescriptor(srcSymbol, srcDesc);
- }
+ }
- if (dstNode.isParameter()) {
- int paramIdx = flowGraph.getParamIdx(dstNode.getDescTuple());
- methodInfo.addParameter(dstSymbol, dstDesc, paramIdx);
- } else {
- // methodInfo.addMappingOfLocNameToDescriptor(dstSymbol, dstDesc);
- }
+ private void recursivelyAddRelation(int idx, CompositeLocation srcInferLoc,
+ CompositeLocation dstInferLoc) throws CyclicFlowException {
- if (!isAssignedCompositeLocation) {
- // source does not have a composite location
- if (!srcSymbol.equals(dstSymbol)) {
- // add a local relation
- if (!methodLattice.isGreaterThan(srcSymbol, dstSymbol)) {
- // if the lattice does not have this relation, add it
- addRelationHigherToLower(methodLattice, methodInfo, srcSymbol, dstSymbol);
- // methodLattice.addRelationHigherToLower(srcSymbol, dstSymbol);
- }
- } else {
- // if src and dst have the same local location...
+ String srcLocSymbol = srcInferLoc.get(idx).getLocIdentifier();
+ String dstLocSymbol = dstInferLoc.get(idx).getLocIdentifier();
- recursivelyAddCompositeRelation(md, flowGraph, methodInfo, srcNode, dstNode, srcDesc,
- dstDesc);
+ Descriptor parentDesc = srcInferLoc.get(idx).getDescriptor();
+ if (srcLocSymbol.equals(dstLocSymbol)) {
+ // check if it is the case of shared location
+ if (srcInferLoc.getSize() == (idx + 1) && dstInferLoc.getSize() == (idx + 1)) {
+ Location inferLocElement = srcInferLoc.get(idx);
+ getLattice(inferLocElement.getDescriptor())
+ .addSharedLoc(inferLocElement.getLocIdentifier());
+ } else if (srcInferLoc.getSize() > (idx + 1) && dstInferLoc.getSize() > (idx + 1)) {
+ recursivelyAddRelation(idx + 1, srcInferLoc, dstInferLoc);
}
-
} else {
- // source variable has a composite location
- if (methodInfo.getInferLocation(dstDesc).getSize() == 1) {
- if (!srcSymbol.equals(dstSymbol)) {
- addRelationHigherToLower(methodLattice, methodInfo, srcSymbol, dstSymbol);
- }
- }
-
+ addRelationHigherToLower(getLattice(parentDesc), getLocationInfo(parentDesc), srcLocSymbol,
+ dstLocSymbol);
}
-
-
}
private void recursivelyAddCompositeRelation(MethodDescriptor md, FlowGraph flowGraph,
MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode, Descriptor srcDesc,
- Descriptor dstDesc) {
+ Descriptor dstDesc) throws CyclicFlowException {
CompositeLocation inferSrcLoc;
CompositeLocation inferDstLoc = methodInfo.getInferLocation(dstDesc);
}
private boolean calculateCompositeLocation(FlowGraph flowGraph,
- SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo, FlowNode flowNode) {
+ SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo, FlowNode flowNode)
+ throws CyclicFlowException {
Descriptor localVarDesc = flowNode.getDescTuple().get(0);
Set<FlowNode> localInNodeSet = new HashSet<FlowNode>();
Set<FlowNode> localOutNodeSet = new HashSet<FlowNode>();
+ CompositeLocation flowNodeInferLoc =
+ calcualteInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(flowNode));
+
List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
}
});
-
for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
FlowNode reachableNode = (FlowNode) iterator2.next();
if (reachableNode.getDescTuple().size() == 1) {
if (reachLocTuple.startsWith(curPrefix)) {
reachableCommonPrefixSet.add(reachLocTuple);
}
-
}
+ // check if the lattice has the relation in which higher prefix is
+ // actually lower than the current node
+ CompositeLocation prefixInferLoc = calcualteInferredCompositeLocation(methodInfo, curPrefix);
+ if (isGreaterThan(methodLattice, flowNodeInferLoc, prefixInferLoc)) {
+ reachableCommonPrefixSet.add(curPrefix);
+ }
if (!reachableCommonPrefixSet.isEmpty()) {
// found reachable nodes that start with the prefix curPrefix
Location fieldLoc = new Location(desc, newLocSymbol);
inferLocation.addLocation(fieldLoc);
-
methodInfo.mapDescriptorToLocation(localVarDesc, inferLocation);
methodInfo.removeMaplocalVarToLocSet(localVarDesc);
String localLocName = methodInfo.getInferLocation(localVarDesc).get(0).getLocIdentifier();
return true;
-
}
newlyInsertedLocName = inferLocation.get(inferLocation.getSize() - 1).getLocIdentifier();
Location loc = tuple.get(idx);
String higher = locInfo.getFieldInferLocation(loc.getLocDescriptor()).getLocIdentifier();
- System.out.println("here3");
-
+ System.out.println("--");
+ System.out.println("add in-flow relation:");
addRelationHigherToLower(lattice, locInfo, higher, newlyInsertedLocName);
}
-
+ System.out.println("end of add-inflow relation");
for (Iterator iterator = localInNodeSet.iterator(); iterator.hasNext();) {
FlowNode localNode = (FlowNode) iterator.next();
+
+ if (localNode.equals(flowNode)) {
+ continue;
+ }
+
Descriptor localInVarDesc = localNode.getDescTuple().get(0);
CompositeLocation inNodeInferLoc = methodInfo.getInferLocation(localInVarDesc);
&& inNodeInferLoc.getSize() == (curPrefix.size() + 1)) {
String higher = inNodeInferLoc.get(inNodeInferLoc.getSize() - 1).getLocIdentifier();
if (!higher.equals(newlyInsertedLocName)) {
-
+ System.out.println("add localInNodeSet relation:");
addRelationHigherToLower(lattice, locInfo, higher, newlyInsertedLocName);
}
} else {
}
}
+
}
for (Iterator iterator = reachableCommonPrefixSet.iterator(); iterator.hasNext();) {
NTuple<Location> tuple = (NTuple<Location>) iterator.next();
- Location loc = tuple.get(idx);
- String lower = locInfo.getFieldInferLocation(loc.getLocDescriptor()).getLocIdentifier();
- // lattice.addRelationHigherToLower(newlyInsertedLocName, lower);
-
- addRelationHigherToLower(lattice, locInfo, newlyInsertedLocName, lower);
+ if (tuple.size() > idx) {
+ Location loc = tuple.get(idx);
+ String lower = locInfo.getFieldInferLocation(loc.getLocDescriptor()).getLocIdentifier();
+ // lattice.addRelationHigherToLower(newlyInsertedLocName, lower);
+ System.out.println("add out-flow relation:");
+ addRelationHigherToLower(lattice, locInfo, newlyInsertedLocName, lower);
+ }
}
+ System.out.println("end of add out-flow relation");
for (Iterator iterator = localOutNodeSet.iterator(); iterator.hasNext();) {
FlowNode localOutNode = (FlowNode) iterator.next();
+ if (localOutNode.equals(flowNode)) {
+ continue;
+ }
+
Descriptor localOutDesc = localOutNode.getDescTuple().get(0);
- // String localOutNodeSymbol =
- // localOutNode.getDescTuple().get(0).getSymbol();
CompositeLocation outNodeInferLoc = methodInfo.getInferLocation(localOutDesc);
- // System.out
- // .println("localOutNode=" + localOutNode + " outNodeInferLoc=" +
- // outNodeInferLoc);
if (isCompositeLocation(outNodeInferLoc)) {
// need to make sure that newLocSymbol is higher than the infernode
// location
&& outNodeInferLoc.getSize() == (curPrefix.size() + 1)) {
String lower = outNodeInferLoc.get(outNodeInferLoc.getSize() - 1).getLocIdentifier();
+ System.out.println("add outNodeInferLoc relation:");
addRelationHigherToLower(lattice, locInfo, newlyInsertedLocName, lower);
for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
Descriptor desc = (Descriptor) iterator.next();
- if (desc instanceof VarDescriptor) {
+ if (desc.equals(LocationInference.GLOBALDESC)) {
+ return true;
+ } else if (desc instanceof VarDescriptor) {
if (!((VarDescriptor) desc).getType().isPrimitive()) {
return true;
}
}
private void addRelationHigherToLower(SSJavaLattice<String> lattice, LocationInfo locInfo,
- String higher, String lower) {
+ String higher, String lower) throws CyclicFlowException {
+ // if (higher.equals(lower) && lattice.isSharedLoc(higher)) {
+ // return;
+ // }
Set<String> cycleElementSet = lattice.getPossibleCycleElements(higher, lower);
+ System.out.println("#Check cycle=" + lower + " < " + higher);
+ System.out.println("#cycleElementSet=" + cycleElementSet);
boolean hasNonPrimitiveElement = false;
for (Iterator iterator = cycleElementSet.iterator(); iterator.hasNext();) {
if (hasNonPrimitiveElement) {
// if there is non-primitive element in the cycle, no way to merge cyclic
// elements into the shared location
- throw new Error("Failed to merge cyclic value flows into a shared location.");
+ throw new CyclicFlowException();
}
if (cycleElementSet.size() > 0) {
locInfo.mergeMapping(oldLocSymbol, newSharedLoc);
}
+ lattice.addSharedLoc(newSharedLoc);
} else if (!lattice.isGreaterThan(higher, lower)) {
lattice.addRelationHigherToLower(higher, lower);
private void prefixSanityCheck(List<NTuple<Location>> prefixList, int curIdx,
FlowGraph flowGraph, Set<FlowNode> reachableNodeSet) {
-
NTuple<Location> curPrefix = prefixList.get(curIdx);
for (int i = curIdx + 1; i < prefixList.size(); i++) {
}
private void extractRelationFromFieldFlows(ClassDescriptor cd, FlowNode srcNode,
- FlowNode dstNode, int idx) {
-
+ FlowNode dstNode, int idx) throws CyclicFlowException {
if (srcNode.getDescTuple().get(idx).equals(dstNode.getDescTuple().get(idx))
&& srcNode.getDescTuple().size() > (idx + 1) && dstNode.getDescTuple().size() > (idx + 1)) {
SSJavaLattice<String> fieldLattice = getFieldLattice(cd);
LocationInfo fieldInfo = getFieldLocationInfo(cd);
-
String srcSymbol = fieldInfo.getFieldInferLocation(srcFieldDesc).getLocIdentifier();
String dstSymbol = fieldInfo.getFieldInferLocation(dstFieldDesc).getLocIdentifier();
setupToAnalyze();
+ Set<MethodDescriptor> visited = new HashSet<MethodDescriptor>();
+ Set<MethodDescriptor> reachableCallee = new HashSet<MethodDescriptor>();
+
while (!toAnalyzeIsEmpty()) {
ClassDescriptor cd = toAnalyzeNext();
setupToAnalazeMethod(cd);
+ toanalyzeMethodList.removeAll(visited);
+
while (!toAnalyzeMethodIsEmpty()) {
MethodDescriptor md = toAnalyzeMethodNext();
- if (ssjava.needTobeAnnotated(md)) {
+ if ((!visited.contains(md))
+ && (ssjava.needTobeAnnotated(md) || reachableCallee.contains(md))) {
if (state.SSJAVADEBUG) {
System.out.println();
System.out.println("SSJAVA: Constructing a flow graph: " + md);
} else {
setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(md));
}
- mapMethodDescToPossibleMethodDescSet.put(md, setPossibleCallees);
+
+ Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getCalleeSet(md);
+ Set<MethodDescriptor> needToAnalyzeCalleeSet = new HashSet<MethodDescriptor>();
+
+ for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
+ MethodDescriptor calleemd = (MethodDescriptor) iterator.next();
+ if ((!ssjava.isTrustMethod(calleemd))
+ && (!ssjava.isSSJavaUtil(calleemd.getClassDesc()))) {
+ if (!visited.contains(calleemd)) {
+ toanalyzeMethodList.add(calleemd);
+ }
+ reachableCallee.add(calleemd);
+ needToAnalyzeCalleeSet.add(calleemd);
+ }
+ }
+
+ mapMethodToCalleeSet.put(md, needToAnalyzeCalleeSet);
// creates a mapping from a parameter descriptor to its index
Map<Descriptor, Integer> mapParamDescToIdx = new HashMap<Descriptor, Integer>();
FlowGraph fg = new FlowGraph(md, mapParamDescToIdx);
mapMethodDescriptorToFlowGraph.put(md, fg);
+ visited.add(md);
analyzeMethodBody(cd, md);
+
}
}
}
ExpressionNode returnExp = rn.getReturnExpression();
- NodeTupleSet nodeSet = new NodeTupleSet();
- analyzeFlowExpressionNode(md, nametable, returnExp, nodeSet, false);
+ if (returnExp != null) {
+ NodeTupleSet nodeSet = new NodeTupleSet();
+ analyzeFlowExpressionNode(md, nametable, returnExp, nodeSet, false);
- FlowGraph fg = getFlowGraph(md);
+ FlowGraph fg = getFlowGraph(md);
- // annotate the elements of the node set as the return location
- for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- NTuple<Descriptor> returnDescTuple = (NTuple<Descriptor>) iterator.next();
- fg.setReturnFlowNode(returnDescTuple);
- for (Iterator iterator2 = implicitFlowTupleSet.iterator(); iterator2.hasNext();) {
- NTuple<Descriptor> implicitFlowDescTuple = (NTuple<Descriptor>) iterator2.next();
- fg.addValueFlowEdge(implicitFlowDescTuple, returnDescTuple);
+ // annotate the elements of the node set as the return location
+ for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> returnDescTuple = (NTuple<Descriptor>) iterator.next();
+ fg.setReturnFlowNode(returnDescTuple);
+ for (Iterator iterator2 = implicitFlowTupleSet.iterator(); iterator2.hasNext();) {
+ NTuple<Descriptor> implicitFlowDescTuple = (NTuple<Descriptor>) iterator2.next();
+ fg.addValueFlowEdge(implicitFlowDescTuple, returnDescTuple);
+ }
}
}
flowTuple =
analyzeFlowFieldAccessNode(md, nametable, (FieldAccessNode) en, nodeSet, base,
implicitFlowTupleSet);
- nodeSet.addTuple(flowTuple);
+ if (flowTuple != null) {
+ nodeSet.addTuple(flowTuple);
+ }
return flowTuple;
case Kind.NameNode:
NodeTupleSet nameNodeSet = new NodeTupleSet();
flowTuple =
analyzeFlowNameNode(md, nametable, (NameNode) en, nameNodeSet, base, implicitFlowTupleSet);
- nodeSet.addTuple(flowTuple);
+ if (flowTuple != null) {
+ nodeSet.addTuple(flowTuple);
+ }
return flowTuple;
case Kind.OpNode:
break;
case Kind.CastNode:
- analyzeFlowCastNode(md, nametable, (CastNode) en, implicitFlowTupleSet);
+ analyzeFlowCastNode(md, nametable, (CastNode) en, nodeSet, base, implicitFlowTupleSet);
break;
-
// case Kind.InstanceOfNode:
// checkInstanceOfNode(md, nametable, (InstanceOfNode) en, td);
// return null;
}
private void analyzeFlowCastNode(MethodDescriptor md, SymbolTable nametable, CastNode cn,
- NodeTupleSet implicitFlowTupleSet) {
+ NodeTupleSet nodeSet, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
- NodeTupleSet nodeTupleSet = new NodeTupleSet();
- analyzeFlowExpressionNode(md, nametable, cn.getExpression(), nodeTupleSet, false);
+ analyzeFlowExpressionNode(md, nametable, cn.getExpression(), nodeSet, base,
+ implicitFlowTupleSet, false);
}
if (min.getExpression() != null) {
NodeTupleSet baseNodeSet = new NodeTupleSet();
- analyzeFlowExpressionNode(calleeMD, nametable, min.getExpression(), baseNodeSet, null,
+ analyzeFlowExpressionNode(md, nametable, min.getExpression(), baseNodeSet, null,
implicitFlowTupleSet, false);
} else {
// checkCallerArgumentLocationConstraints(md, nametable, min,
// baseLocation, constraint);
- if (!min.getMethod().getReturnType().isVoid()) {
+ if (min.getMethod().getReturnType() != null && !min.getMethod().getReturnType().isVoid()) {
// If method has a return value, compute the highest possible return
// location in the caller's perspective
// CompositeLocation ceilingLoc =
}
- private NTuple<Descriptor> getArgTupleByArgIdx(MethodInvokeNode min, int idx) {
+ private NodeTupleSet getNodeTupleSetByArgIdx(MethodInvokeNode min, int idx) {
return mapMethodInvokeNodeToArgIdxMap.get(min).get(new Integer(idx));
}
- private void addArgIdxMap(MethodInvokeNode min, int idx, NTuple<Descriptor> argTuple) {
- Map<Integer, NTuple<Descriptor>> mapIdxToArgTuple = mapMethodInvokeNodeToArgIdxMap.get(min);
- if (mapIdxToArgTuple == null) {
- mapIdxToArgTuple = new HashMap<Integer, NTuple<Descriptor>>();
- mapMethodInvokeNodeToArgIdxMap.put(min, mapIdxToArgTuple);
+ private void addArgIdxMap(MethodInvokeNode min, int idx, NodeTupleSet tupleSet) {
+ Map<Integer, NodeTupleSet> mapIdxToTupleSet = mapMethodInvokeNodeToArgIdxMap.get(min);
+ if (mapIdxToTupleSet == null) {
+ mapIdxToTupleSet = new HashMap<Integer, NodeTupleSet>();
+ mapMethodInvokeNodeToArgIdxMap.put(min, mapIdxToTupleSet);
}
- mapIdxToArgTuple.put(new Integer(idx), argTuple);
+ mapIdxToTupleSet.put(new Integer(idx), tupleSet);
}
private void analyzeFlowMethodParameters(MethodDescriptor callermd, SymbolTable nametable,
MethodInvokeNode min) {
+
if (min.numArgs() > 0) {
- int offset = min.getMethod().isStatic() ? 0 : 1;
+ int offset;
+ if (min.getMethod().isStatic()) {
+ offset = 0;
+ } else {
+ offset = 1;
+ NTuple<Descriptor> thisArgTuple = new NTuple<Descriptor>();
+ thisArgTuple.add(callermd.getThis());
+ NodeTupleSet argTupleSet = new NodeTupleSet();
+ argTupleSet.addTuple(thisArgTuple);
+ addArgIdxMap(min, 0, argTupleSet);
+ }
for (int i = 0; i < min.numArgs(); i++) {
ExpressionNode en = min.getArg(i);
- NTuple<Descriptor> argTuple =
- analyzeFlowExpressionNode(callermd, nametable, en, new NodeTupleSet(), false);
-
- addArgIdxMap(min, i + offset, argTuple);
+ NodeTupleSet argTupleSet = new NodeTupleSet();
+ analyzeFlowExpressionNode(callermd, nametable, en, argTupleSet, false);
+ // if argument is liternal node, argTuple is set to NULL.
+ addArgIdxMap(min, i + offset, argTupleSet);
}
}
}
private void analyzeLiteralNode(MethodDescriptor md, SymbolTable nametable, LiteralNode en) {
- // TODO Auto-generated method stub
}
nodeSet.addTupleSet(expNodeTupleSet);
nodeSet.addTupleSet(idxNodeTupleSet);
}
-
}
private void analyzeCreateObjectNode(MethodDescriptor md, SymbolTable nametable,
default:
throw new Error(op.toString());
}
+
}
private NTuple<Descriptor> analyzeFlowNameNode(MethodDescriptor md, SymbolTable nametable,
NameNode nn, NodeTupleSet nodeSet, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
+
if (base == null) {
base = new NTuple<Descriptor>();
}
NameDescriptor nd = nn.getName();
if (nd.getBase() != null) {
- analyzeFlowExpressionNode(md, nametable, nn.getExpression(), nodeSet, base,
- implicitFlowTupleSet, false);
+ base =
+ analyzeFlowExpressionNode(md, nametable, nn.getExpression(), nodeSet, base,
+ implicitFlowTupleSet, false);
+ if (base == null) {
+ // base node has the top location
+ return base;
+ }
} else {
String varname = nd.toString();
if (varname.equals("this")) {
FieldDescriptor fd = (FieldDescriptor) d;
if (fd.isStatic()) {
if (fd.isFinal()) {
- // if it is 'static final', the location has TOP since no one can
- // change its value
- // loc.addLocation(Location.createTopLocation(md));
- // return loc;
+ // if it is 'static final', no need to have flow node for the TOP
+ // location
+ return null;
} else {
- // if 'static', the location has pre-assigned global loc
- // MethodLattice<String> localLattice = ssjava.getMethodLattice(md);
- // String globalLocId = localLattice.getGlobalLoc();
- // if (globalLocId == null) {
- // throw new
- // Error("Global location element is not defined in the method " +
- // md);
- // }
- // Location globalLoc = new Location(md, globalLocId);
- //
- // loc.addLocation(globalLoc);
+ // if 'static', assign the default GLOBAL LOCATION to the first
+ // element of the tuple
+ base.add(GLOBALDESC);
}
} else {
// the location of field access starts from this, followed by field
base.add(fd);
} else if (d == null) {
// access static field
+ base.add(GLOBALDESC);
+ // base.add(nn.getField());
+ return base;
+
// FieldDescriptor fd = nn.getField();addFlowGraphEdge
//
// MethodLattice<String> localLattice = ssjava.getMethodLattice(md);
FieldAccessNode fan, NodeTupleSet nodeSet, NTuple<Descriptor> base,
NodeTupleSet implicitFlowTupleSet) {
+
ExpressionNode left = fan.getExpression();
TypeDescriptor ltd = left.getType();
FieldDescriptor fd = fan.getField();
}
}
- // if (left instanceof ArrayAccessNode) {
- // ArrayAccessNode aan = (ArrayAccessNode) left;
- // left = aan.getExpression();
- // }
+ if (left instanceof ArrayAccessNode) {
+ ArrayAccessNode aan = (ArrayAccessNode) left;
+ left = aan.getExpression();
+ }
// fanNodeSet
base =
analyzeFlowExpressionNode(md, nametable, left, nodeSet, base, implicitFlowTupleSet, false);
+ if (base == null) {
+ // in this case, field is TOP location
+ return null;
+ } else {
- if (!left.getType().isPrimitive()) {
+ if (!left.getType().isPrimitive()) {
+
+ if (fd.getSymbol().equals("length")) {
+ // array.length access, just have the location of the array
+ } else {
+ base.add(fd);
+ }
- if (fd.getSymbol().equals("length")) {
- // TODO
- // array.length access, return the location of the array
- // return loc;
}
- base.add(fd);
+ getFlowGraph(md).createNewFlowNode(base);
+ return base;
+
}
- getFlowGraph(md).createNewFlowNode(base);
- return base;
+ }
+
+ private void debug_printTreeNode(TreeNode tn) {
+
+ System.out.println("DEBUG: " + tn.printNode(0) + " line#=" + tn.getNumLine());
}
private void analyzeFlowAssignmentNode(MethodDescriptor md, SymbolTable nametable,
AssignmentNode an, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
- // System.out.println("#an=" + an.printNode(0) + " an src=" +
- // an.getSrc().printNode(0) + " dst="
- // + an.getDest().printNode(0));
NodeTupleSet nodeSetRHS = new NodeTupleSet();
NodeTupleSet nodeSetLHS = new NodeTupleSet();
analyzeFlowExpressionNode(md, nametable, an.getSrc(), nodeSetRHS, null, implicitFlowTupleSet,
false);
+ // System.out.println("-analyzeFlowAssignmentNode=" + an.printNode(0));
+ // System.out.println("-nodeSetLHS=" + nodeSetLHS);
+ // System.out.println("-nodeSetRHS=" + nodeSetRHS);
+ // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
+ // System.out.println("-");
+
+ if (an.getOperation().getOp() >= 2 && an.getOperation().getOp() <= 12) {
+ // if assignment contains OP+EQ operator, creates edges from LHS to LHS
+ for (Iterator<NTuple<Descriptor>> iter = nodeSetLHS.iterator(); iter.hasNext();) {
+ NTuple<Descriptor> fromTuple = iter.next();
+ for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
+ NTuple<Descriptor> toTuple = iter2.next();
+ addFlowGraphEdge(md, fromTuple, toTuple);
+ }
+ }
+ }
+
// creates edges from RHS to LHS
for (Iterator<NTuple<Descriptor>> iter = nodeSetRHS.iterator(); iter.hasNext();) {
NTuple<Descriptor> fromTuple = iter.next();
}
}
+
+class CyclicFlowException extends Exception {
+
+}