+ return writtenDescSet.containsAll(sharedDescSet);
+ // return sharedDescSet.containsAll(writtenDescSet);
+
+ }
+
+ private void generateGENSetForFlatCall(SharedLocMap curr, SharedLocMap genSet) {
+
+ Set<NTuple<Location>> locTupleSet = calleeIntersectBoundSharedSet.keySet();
+ for (Iterator iterator = locTupleSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> locTupleKey = (NTuple<Location>) iterator.next();
+ genSet.addWrite(locTupleKey, curr.get(locTupleKey));
+ genSet.addWrite(locTupleKey, calleeIntersectBoundSharedSet.get(locTupleKey));
+
+ genSet.removeWriteAll(locTupleKey, calleeUnionBoundDeleteSet.get(locTupleKey));
+ }
+
+ }
+
+ private void generateKILLSetForFlatCall(SharedLocMap curr, SharedLocMap killSet) {
+
+ Set<NTuple<Location>> locTupleSet = calleeIntersectBoundSharedSet.keySet();
+ for (Iterator iterator = locTupleSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> locTupleKey = (NTuple<Location>) iterator.next();
+ killSet.addWrite(locTupleKey, curr.get(locTupleKey));
+ }
+
+ }
+
+ private void mergeDeleteSet(SharedLocMap currDeleteSet, SharedLocMap inDeleteLoc) {
+
+ Set<NTuple<Location>> locTupleKeySet = inDeleteLoc.keySet();
+
+ for (Iterator iterator = locTupleKeySet.iterator(); iterator.hasNext();) {
+ NTuple<Location> locTupleKey = (NTuple<Location>) iterator.next();
+
+ Set<NTuple<Descriptor>> inSet = inDeleteLoc.get(locTupleKey);
+ currDeleteSet.addWrite(locTupleKey, inSet);
+
+ }
+ }
+
+ private void computeNewMapping(SharedLocMap curr, SharedLocMap killSet, SharedLocMap genSet) {
+ curr.kill(killSet);
+ curr.gen(genSet);
+ }
+
+ private void updateDeleteSetForHigherWrite(SharedLocMap currDeleteSet, NTuple<Location> locTuple,
+ NTuple<Descriptor> hp) {
+ currDeleteSet.removeWrite(locTuple, hp);
+ }
+
+ private void updateDeleteSetForSameHeightWrite(SharedLocMap currDeleteSet,
+ NTuple<Location> locTuple, NTuple<Descriptor> hp) {
+ currDeleteSet.addWrite(locTuple, hp);
+ }
+
+ private void computeGENSetForHigherWrite(SharedLocMap curr, SharedLocMap genSet,
+ NTuple<Location> locTuple, NTuple<Descriptor> hp) {
+ Set<NTuple<Descriptor>> currWriteSet = curr.get(locTuple);
+
+ if (currWriteSet != null) {
+ genSet.addWrite(locTuple, currWriteSet);
+ }
+ genSet.addWrite(locTuple, hp);
+ }
+
+ private void computeGENSetForSameHeightWrite(SharedLocMap curr, SharedLocMap genSet,
+ NTuple<Location> locTuple, NTuple<Descriptor> hp) {
+ Set<NTuple<Descriptor>> currWriteSet = curr.get(locTuple);
+
+ if (currWriteSet != null) {
+ genSet.addWrite(locTuple, currWriteSet);
+ }
+ genSet.removeWrite(locTuple, hp);
+ }
+
+ private void computeKILLSetForWrite(SharedLocMap curr, SharedLocMap killSet,
+ NTuple<Location> locTuple, NTuple<Descriptor> hp) {
+
+ Set<NTuple<Descriptor>> writeSet = curr.get(locTuple);
+ if (writeSet != null) {
+ killSet.addWrite(locTuple, writeSet);
+ }
+
+ }
+
+ private void mergeSharedLocMap(SharedLocMap currSharedSet, SharedLocMap in) {
+
+ Set<NTuple<Location>> locTupleKeySet = in.keySet();
+ for (Iterator iterator = locTupleKeySet.iterator(); iterator.hasNext();) {
+ NTuple<Location> locTupleKey = (NTuple<Location>) iterator.next();
+
+ Set<NTuple<Descriptor>> inSet = in.get(locTupleKey);
+ Set<NTuple<Descriptor>> currSet = currSharedSet.get(locTupleKey);
+ if (currSet == null) {
+ currSet = new HashSet<NTuple<Descriptor>>();
+ currSet.addAll(inSet);
+ currSharedSet.addWrite(locTupleKey, currSet);
+ }
+ currSet.retainAll(inSet);
+ }
+
+ }
+
+ private void computeSharedCoverSet() {
+ LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
+
+ // current descriptors to visit in fixed-point interprocedural analysis,
+ // prioritized by
+ // dependency in the call graph
+ methodDescriptorsToVisitStack.clear();
+
+ descriptorListToAnalyze.removeFirst();
+
+ Set<MethodDescriptor> methodDescriptorToVistSet = new HashSet<MethodDescriptor>();
+ methodDescriptorToVistSet.addAll(descriptorListToAnalyze);
+
+ while (!descriptorListToAnalyze.isEmpty()) {
+ MethodDescriptor md = descriptorListToAnalyze.removeFirst();
+ methodDescriptorsToVisitStack.add(md);
+ }
+
+ // analyze scheduled methods until there are no more to visit
+ while (!methodDescriptorsToVisitStack.isEmpty()) {
+ MethodDescriptor md = methodDescriptorsToVisitStack.pop();
+ FlatMethod fm = state.getMethodFlat(md);
+ computeSharedCoverSet_analyzeMethod(fm, md.equals(methodContainingSSJavaLoop));
+ }
+
+ computeSharedCoverSetForEventLoop();
+
+ }
+
+ private void computeSharedCoverSetForEventLoop() {
+ computeSharedCoverSet_analyzeMethod(state.getMethodFlat(methodContainingSSJavaLoop), true);
+ }
+
+ private void computeSharedCoverSet_analyzeMethod(FlatMethod fm, boolean onlyVisitSSJavaLoop) {
+
+ MethodDescriptor md = fm.getMethod();
+
+ Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
+
+ Set<FlatNode> visited = new HashSet<FlatNode>();
+
+ if (onlyVisitSSJavaLoop) {
+ flatNodesToVisit.add(ssjava.getSSJavaLoopEntrance());
+ } else {
+ flatNodesToVisit.add(fm);
+ }
+
+ while (!flatNodesToVisit.isEmpty()) {
+ FlatNode fn = flatNodesToVisit.iterator().next();
+ flatNodesToVisit.remove(fn);
+ visited.add(fn);
+
+ computeSharedCoverSet_nodeActions(md, fn, onlyVisitSSJavaLoop);
+
+ for (int i = 0; i < fn.numNext(); i++) {
+ FlatNode nn = fn.getNext(i);
+
+ if (!visited.contains(nn)) {
+ if (!onlyVisitSSJavaLoop || (onlyVisitSSJavaLoop && loopIncElements.contains(nn))) {
+ flatNodesToVisit.add(nn);
+ }
+ }
+
+ }
+
+ }
+
+ }
+
+ private void computeSharedCoverSet_nodeActions(MethodDescriptor md, FlatNode fn,
+ boolean isEventLoopBody) {
+ TempDescriptor lhs;
+ TempDescriptor rhs;
+ FieldDescriptor fld;
+
+ switch (fn.kind()) {
+
+ case FKind.FlatLiteralNode: {
+ FlatLiteralNode fln = (FlatLiteralNode) fn;
+ lhs = fln.getDst();
+
+ NTuple<Location> lhsLocTuple = new NTuple<Location>();
+ lhsLocTuple.add(Location.createTopLocation(md));
+ mapDescriptorToLocationPath.put(lhs, lhsLocTuple);
+
+ if (lhs.getType().isPrimitive() && !lhs.getSymbol().startsWith("neverused")
+ && !lhs.getSymbol().startsWith("srctmp")) {
+ // only need to care about composite location case here
+ if (lhs.getType().getExtension() instanceof SSJavaType) {
+ CompositeLocation compLoc = ((SSJavaType) lhs.getType().getExtension()).getCompLoc();
+ Location lastLocElement = compLoc.get(compLoc.getSize() - 1);
+ }
+ }
+
+ }
+ break;
+
+ case FKind.FlatOpNode: {
+ FlatOpNode fon = (FlatOpNode) fn;
+ // for a normal assign node, need to propagate lhs's location path to
+ // rhs
+ if (fon.getOp().getOp() == Operation.ASSIGN) {
+ rhs = fon.getLeft();
+ lhs = fon.getDest();
+
+ if (!lhs.getSymbol().startsWith("neverused") && !lhs.getSymbol().startsWith("leftop")
+ && !lhs.getSymbol().startsWith("rightop")) {
+
+ if (mapHeapPath.containsKey(rhs)) {
+ NTuple<Location> rhsLocTuple = new NTuple<Location>();
+ NTuple<Location> lhsLocTuple = new NTuple<Location>();
+ if (mapDescriptorToLocationPath.containsKey(rhs)) {
+ mapDescriptorToLocationPath.put(lhs, deriveLocationTuple(md, rhs));
+ lhsLocTuple = mapDescriptorToLocationPath.get(lhs);
+ } else {
+ // rhs side
+ if (rhs.getType().getExtension() != null
+ && rhs.getType().getExtension() instanceof SSJavaType) {
+
+ if (((SSJavaType) rhs.getType().getExtension()).getCompLoc() != null) {
+ rhsLocTuple.addAll(((SSJavaType) rhs.getType().getExtension()).getCompLoc()
+ .getTuple());
+ }
+
+ } else {
+ NTuple<Location> locTuple = deriveLocationTuple(md, rhs);
+ if (locTuple != null) {
+ rhsLocTuple.addAll(locTuple);
+ }
+ }
+ if (rhsLocTuple.size() > 0) {
+ mapDescriptorToLocationPath.put(rhs, rhsLocTuple);
+ }
+
+ // lhs side
+ if (lhs.getType().getExtension() != null
+ && lhs.getType().getExtension() instanceof SSJavaType) {
+ lhsLocTuple.addAll(((SSJavaType) lhs.getType().getExtension()).getCompLoc()
+ .getTuple());
+ mapDescriptorToLocationPath.put(lhs, lhsLocTuple);
+ } else if (mapDescriptorToLocationPath.get(rhs) != null) {
+ // propagate rhs's location to lhs
+ lhsLocTuple.addAll(mapDescriptorToLocationPath.get(rhs));
+ mapDescriptorToLocationPath.put(lhs, lhsLocTuple);
+ }
+ }
+
+ if (isEventLoopBody && lhs.getType().isPrimitive()
+ && !lhs.getSymbol().startsWith("srctmp")) {
+
+ NTuple<Descriptor> lhsHeapPath = computePath(lhs);
+
+ if (lhsLocTuple != null) {
+ addMayWrittenSet(md, lhsLocTuple, lhsHeapPath);
+ }
+
+ }
+ } else {
+ break;
+ }
+
+ }
+
+ }
+ }
+ break;
+
+ case FKind.FlatSetFieldNode:
+ case FKind.FlatSetElementNode: {
+
+ // x.f=y;
+
+ if (fn.kind() == FKind.FlatSetFieldNode) {
+ FlatSetFieldNode fsfn = (FlatSetFieldNode) fn;
+ lhs = fsfn.getDst();
+ fld = fsfn.getField();
+ rhs = fsfn.getSrc();
+ } else {
+ FlatSetElementNode fsen = (FlatSetElementNode) fn;
+ lhs = fsen.getDst();
+ rhs = fsen.getSrc();
+ TypeDescriptor td = lhs.getType().dereference();
+ fld = getArrayField(td);
+ }
+
+ NTuple<Location> lhsLocTuple = new NTuple<Location>();
+ if (fld.isStatic()) {
+ if (fld.isFinal()) {
+ // in this case, fld has TOP location
+ Location topLocation = Location.createTopLocation(md);
+ lhsLocTuple.add(topLocation);
+ } else {
+ lhsLocTuple.addAll(deriveGlobalLocationTuple(md));
+ }
+ } else {
+ lhsLocTuple.addAll(deriveLocationTuple(md, lhs));
+ }
+
+ mapDescriptorToLocationPath.put(lhs, lhsLocTuple);
+
+ NTuple<Location> fieldLocTuple = new NTuple<Location>();
+ fieldLocTuple.addAll(lhsLocTuple);
+
+ if (fn.kind() == FKind.FlatSetFieldNode) {
+ fieldLocTuple.add((Location) fld.getType().getExtension());
+ }
+
+ if (mapHeapPath.containsKey(lhs)) {
+ // fields reachable from the param can have heap path entry.
+ NTuple<Descriptor> lhsHeapPath = new NTuple<Descriptor>();
+ lhsHeapPath.addAll(mapHeapPath.get(lhs));
+
+ Location fieldLocation;
+ if (fn.kind() == FKind.FlatSetFieldNode) {
+ fieldLocation = getLocation(fld);
+ } else {
+ fieldLocation = getLocation(lhsHeapPath.get(getArrayBaseDescriptorIdx(lhsHeapPath)));
+ }
+
+ // Location fieldLocation = getLocation(lhs);
+ if (!isEventLoopBody && fieldLocation.getDescriptor().equals(md)) {
+ // if the field belongs to the local lattice, no reason to calculate
+ // shared location
+ break;
+ }
+
+ if (ssjava.isSharedLocation(fieldLocation)) {
+
+ NTuple<Descriptor> fieldHeapPath = new NTuple<Descriptor>();
+ fieldHeapPath.addAll(computePath(lhs));
+ if (fn.kind() == FKind.FlatSetFieldNode) {
+ fieldHeapPath.add(fld);
+ }
+
+ addMayWrittenSet(md, fieldLocTuple, fieldHeapPath);
+
+ }
+ }
+
+ }
+ break;
+
+ case FKind.FlatElementNode:
+ case FKind.FlatFieldNode: {
+
+ // x=y.f;
+
+ if (fn.kind() == FKind.FlatFieldNode) {
+ FlatFieldNode ffn = (FlatFieldNode) fn;
+ lhs = ffn.getDst();
+ rhs = ffn.getSrc();
+ fld = ffn.getField();
+ } else {
+ FlatElementNode fen = (FlatElementNode) fn;
+ lhs = fen.getDst();
+ rhs = fen.getSrc();
+ TypeDescriptor td = rhs.getType().dereference();
+ fld = getArrayField(td);
+ }
+
+ NTuple<Location> locTuple = new NTuple<Location>();
+
+ if (fld.isStatic()) {
+
+ if (fld.isFinal()) {
+ // in this case, fld has TOP location
+ Location topLocation = Location.createTopLocation(md);
+ locTuple.add(topLocation);
+ } else {
+ locTuple.addAll(deriveGlobalLocationTuple(md));
+ if (fn.kind() == FKind.FlatFieldNode) {
+ locTuple.add((Location) fld.getType().getExtension());
+ }
+ }
+
+ } else {
+ locTuple.addAll(deriveLocationTuple(md, rhs));
+ if (fn.kind() == FKind.FlatFieldNode) {
+ locTuple.add((Location) fld.getType().getExtension());
+ }
+ }
+
+ mapDescriptorToLocationPath.put(lhs, locTuple);
+
+ }
+ break;
+
+ case FKind.FlatCall: {
+
+ FlatCall fc = (FlatCall) fn;
+
+ bindLocationPathCallerArgWithCalleeParam(md, fc);
+
+ }
+ break;
+
+ case FKind.FlatNew: {
+
+ FlatNew fnew = (FlatNew) fn;
+ TempDescriptor dst = fnew.getDst();
+ NTuple<Location> locTuple = deriveLocationTuple(md, dst);
+
+ if (locTuple != null) {
+ NTuple<Location> dstLocTuple = new NTuple<Location>();
+ dstLocTuple.addAll(locTuple);
+ mapDescriptorToLocationPath.put(dst, dstLocTuple);
+ }
+
+ }
+ break;
+ }
+ }
+
+ private void addMayWrittenSet(MethodDescriptor md, NTuple<Location> locTuple,
+ NTuple<Descriptor> heapPath) {
+
+ MultiSourceMap<NTuple<Location>, NTuple<Descriptor>> map = mapMethodToSharedLocCoverSet.get(md);
+ if (map == null) {
+ map = new MultiSourceMap<NTuple<Location>, NTuple<Descriptor>>();
+ mapMethodToSharedLocCoverSet.put(md, map);
+ }
+
+ Set<NTuple<Descriptor>> writeSet = map.get(locTuple);
+ if (writeSet == null) {
+ writeSet = new HashSet<NTuple<Descriptor>>();
+ map.put(locTuple, writeSet);
+ }
+ writeSet.add(heapPath);
+
+ }
+
+ private void bindLocationPathCallerArgWithCalleeParam(MethodDescriptor mdCaller, FlatCall fc) {
+
+ if (ssjava.isSSJavaUtil(fc.getMethod().getClassDesc())) {
+ // ssjava util case!
+ // have write effects on the first argument
+ TempDescriptor arg = fc.getArg(0);
+ NTuple<Location> argLocationPath = deriveLocationTuple(mdCaller, arg);
+ NTuple<Descriptor> argHeapPath = computePath(arg);
+ addMayWrittenSet(mdCaller, argLocationPath, argHeapPath);
+ } else if (ssjava.needTobeAnnotated(fc.getMethod())) {
+
+ // if arg is not primitive type, we need to propagate maywritten set to
+ // the caller's location path
+
+ MethodDescriptor mdCallee = fc.getMethod();
+ Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
+ setPossibleCallees.addAll(callGraph.getMethods(mdCallee));
+
+ // create mapping from arg idx to its heap paths
+ Hashtable<Integer, NTuple<Descriptor>> mapArgIdx2CallerArgHeapPath =
+ new Hashtable<Integer, NTuple<Descriptor>>();
+
+ // create mapping from arg idx to its location paths
+ Hashtable<Integer, NTuple<Location>> mapArgIdx2CallerArgLocationPath =
+ new Hashtable<Integer, NTuple<Location>>();
+
+ if (fc.getThis() != null) {
+
+ if (mapHeapPath.containsKey(fc.getThis())) {
+
+ // setup heap path for 'this'
+ NTuple<Descriptor> thisHeapPath = new NTuple<Descriptor>();
+ thisHeapPath.addAll(mapHeapPath.get(fc.getThis()));
+ mapArgIdx2CallerArgHeapPath.put(Integer.valueOf(0), thisHeapPath);
+
+ // setup location path for 'this'
+ NTuple<Location> thisLocationPath = deriveLocationTuple(mdCaller, fc.getThis());
+ mapArgIdx2CallerArgLocationPath.put(Integer.valueOf(0), thisLocationPath);
+
+ }
+ }
+
+ for (int i = 0; i < fc.numArgs(); i++) {
+ TempDescriptor arg = fc.getArg(i);
+ // create mapping arg to loc path
+
+ if (mapHeapPath.containsKey(arg)) {
+ // setup heap path
+ NTuple<Descriptor> argHeapPath = mapHeapPath.get(arg);
+ mapArgIdx2CallerArgHeapPath.put(Integer.valueOf(i + 1), argHeapPath);
+ // setup loc path
+ NTuple<Location> argLocationPath = deriveLocationTuple(mdCaller, arg);
+ mapArgIdx2CallerArgLocationPath.put(Integer.valueOf(i + 1), argLocationPath);
+ }
+
+ }
+
+ for (Iterator iterator = setPossibleCallees.iterator(); iterator.hasNext();) {
+ MethodDescriptor callee = (MethodDescriptor) iterator.next();
+ FlatMethod calleeFlatMethod = state.getMethodFlat(callee);
+
+ // binding caller's args and callee's params
+
+ Hashtable<NTuple<Descriptor>, NTuple<Descriptor>> mapParamHeapPathToCallerArgHeapPath =
+ new Hashtable<NTuple<Descriptor>, NTuple<Descriptor>>();
+
+ Hashtable<Integer, TempDescriptor> mapParamIdx2ParamTempDesc =
+ new Hashtable<Integer, TempDescriptor>();
+ int offset = 0;
+ if (calleeFlatMethod.getMethod().isStatic()) {
+ // static method does not have implicit 'this' arg
+ offset = 1;
+ }
+
+ for (int i = 0; i < calleeFlatMethod.numParameters(); i++) {
+ TempDescriptor param = calleeFlatMethod.getParameter(i);
+ mapParamIdx2ParamTempDesc.put(Integer.valueOf(i + offset), param);
+
+ NTuple<Descriptor> calleeHeapPath = computePath(param);
+
+ NTuple<Descriptor> argHeapPath =
+ mapArgIdx2CallerArgHeapPath.get(Integer.valueOf(i + offset));
+
+ if (argHeapPath != null) {
+ mapParamHeapPathToCallerArgHeapPath.put(calleeHeapPath, argHeapPath);
+
+ }
+
+ }
+
+ Set<Integer> keySet = mapArgIdx2CallerArgLocationPath.keySet();
+ for (Iterator iterator2 = keySet.iterator(); iterator2.hasNext();) {
+ Integer idx = (Integer) iterator2.next();
+
+ NTuple<Location> callerArgLocationPath = mapArgIdx2CallerArgLocationPath.get(idx);
+
+ TempDescriptor calleeParam = mapParamIdx2ParamTempDesc.get(idx);
+ NTuple<Location> calleeLocationPath = deriveLocationTuple(mdCallee, calleeParam);
+
+ NTuple<Descriptor> callerArgHeapPath = mapArgIdx2CallerArgHeapPath.get(idx);
+ NTuple<Descriptor> calleeHeapPath = computePath(calleeParam);
+
+ if (!calleeParam.getType().isPrimitive()) {
+ createNewMappingOfMayWrittenSet(mdCaller, callee, callerArgHeapPath,
+ callerArgLocationPath, calleeHeapPath, calleeLocationPath,
+ mapParamHeapPathToCallerArgHeapPath);
+ }
+ }
+
+ }
+
+ }
+
+ }
+
+ private Hashtable<NTuple<Location>, Set<NTuple<Descriptor>>> getMappingByStartedWith(
+ MultiSourceMap<NTuple<Location>, NTuple<Descriptor>> map, NTuple<Location> in) {
+
+ Hashtable<NTuple<Location>, Set<NTuple<Descriptor>>> matchedMapping =
+ new Hashtable<NTuple<Location>, Set<NTuple<Descriptor>>>();
+
+ Set<NTuple<Location>> keySet = map.keySet();
+
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ NTuple<Location> key = (NTuple<Location>) iterator.next();
+ if (key.startsWith(in)) {
+ matchedMapping.put(key, map.get(key));
+ }
+ }
+
+ return matchedMapping;
+
+ }
+
+ private void createNewMappingOfMayWrittenSet(MethodDescriptor caller, MethodDescriptor callee,
+ NTuple<Descriptor> callerArgHeapPath, NTuple<Location> callerArgLocPath,
+ NTuple<Descriptor> calleeParamHeapPath, NTuple<Location> calleeParamLocPath,
+ Hashtable<NTuple<Descriptor>, NTuple<Descriptor>> mapParamHeapPathToCallerArgHeapPath) {
+
+ // propagate may-written-set associated with the key that is started with
+ // calleepath to the caller
+ // 1) makes a new key by combining caller path and callee path(except local
+ // loc element of param)
+ // 2) create new mapping of may-written-set of callee path to caller path
+
+ // extract all may written effect accessed through callee param path
+ MultiSourceMap<NTuple<Location>, NTuple<Descriptor>> calleeMapping =
+ mapMethodToSharedLocCoverSet.get(callee);
+
+ if (calleeMapping == null) {
+ return;
+ }
+
+ MultiSourceMap<NTuple<Location>, NTuple<Descriptor>> callerMapping =
+ mapMethodToSharedLocCoverSet.get(caller);
+
+ if (callerMapping == null) {
+ callerMapping = new MultiSourceMap<NTuple<Location>, NTuple<Descriptor>>();
+ mapMethodToSharedLocCoverSet.put(caller, callerMapping);
+ }
+
+ Hashtable<NTuple<Location>, Set<NTuple<Descriptor>>> paramMapping =
+ getMappingByStartedWith(calleeMapping, calleeParamLocPath);
+
+ Set<NTuple<Location>> calleeKeySet = paramMapping.keySet();
+
+ for (Iterator iterator = calleeKeySet.iterator(); iterator.hasNext();) {
+ NTuple<Location> calleeKey = (NTuple<Location>) iterator.next();
+
+ Set<NTuple<Descriptor>> calleeMayWriteSet = paramMapping.get(calleeKey);
+
+ if (calleeMayWriteSet != null) {
+
+ Set<NTuple<Descriptor>> boundMayWriteSet = new HashSet<NTuple<Descriptor>>();
+
+ Set<NTuple<Descriptor>> boundSet =
+ convertToCallerMayWriteSet(calleeParamHeapPath, calleeMayWriteSet, callerMapping,
+ mapParamHeapPathToCallerArgHeapPath);
+
+ boundMayWriteSet.addAll(boundSet);
+
+ NTuple<Location> newKey = new NTuple<Location>();
+ newKey.addAll(callerArgLocPath);
+ // need to replace the local location with the caller's path so skip the
+ // local location of the parameter
+ for (int i = 1; i < calleeKey.size(); i++) {
+ newKey.add(calleeKey.get(i));
+ }
+
+ callerMapping.union(newKey, boundMayWriteSet);
+ }
+
+ }
+
+ }
+
+ private Set<NTuple<Descriptor>> convertToCallerMayWriteSet(
+ NTuple<Descriptor> calleeParamHeapPath, Set<NTuple<Descriptor>> calleeMayWriteSet,
+ MultiSourceMap<NTuple<Location>, NTuple<Descriptor>> callerMapping,
+ Hashtable<NTuple<Descriptor>, NTuple<Descriptor>> mapParamHeapPathToCallerArgHeapPath) {
+
+ Set<NTuple<Descriptor>> boundSet = new HashSet<NTuple<Descriptor>>();
+
+ // replace callee's param path with caller's arg path
+ for (Iterator iterator = calleeMayWriteSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> calleeWriteHeapPath = (NTuple<Descriptor>) iterator.next();
+
+ NTuple<Descriptor> writeHeapPathParamHeapPath = calleeWriteHeapPath.subList(0, 1);
+
+ NTuple<Descriptor> callerArgHeapPath =
+ mapParamHeapPathToCallerArgHeapPath.get(writeHeapPathParamHeapPath);
+
+ NTuple<Descriptor> boundHeapPath = new NTuple<Descriptor>();
+ boundHeapPath.addAll(callerArgHeapPath);
+
+ for (int i = 1; i < calleeWriteHeapPath.size(); i++) {
+ boundHeapPath.add(calleeWriteHeapPath.get(i));
+ }
+
+ boundSet.add(boundHeapPath);
+
+ }
+
+ return boundSet;
+ }
+
+ private Location getLocation(Descriptor d) {
+
+ if (d instanceof FieldDescriptor) {
+ TypeExtension te = ((FieldDescriptor) d).getType().getExtension();
+ if (te != null) {
+ return (Location) te;
+ }
+ } else {
+ assert d instanceof TempDescriptor;
+ TempDescriptor td = (TempDescriptor) d;
+
+ TypeExtension te = td.getType().getExtension();
+ if (te != null) {
+ if (te instanceof SSJavaType) {
+ SSJavaType ssType = (SSJavaType) te;
+ if (ssType.getCompLoc() != null) {
+ CompositeLocation comp = ssType.getCompLoc();
+ return comp.get(comp.getSize() - 1);
+ } else {
+ return null;
+ }
+ } else {
+ return (Location) te;
+ }
+ }
+ }
+
+ return mapDescToLocation.get(d);
+ }
+
+ private void eventLoopAnalysis() {
+ // perform second stage analysis: intraprocedural analysis ensure that
+ // all
+ // variables are definitely written in-between the same read
+
+ Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
+ flatNodesToVisit.add(ssjava.getSSJavaLoopEntrance());
+
+ while (!flatNodesToVisit.isEmpty()) {
+ FlatNode fn = (FlatNode) flatNodesToVisit.iterator().next();
+ flatNodesToVisit.remove(fn);
+
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> prev = mapFlatNodetoEventLoopMap.get(fn);
+
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr =
+ new Hashtable<NTuple<Descriptor>, Set<WriteAge>>();
+ for (int i = 0; i < fn.numPrev(); i++) {
+ FlatNode nn = fn.getPrev(i);
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> in = mapFlatNodetoEventLoopMap.get(nn);
+ if (in != null) {
+ union(curr, in);
+ }
+ }
+
+ eventLoopAnalysis_nodeAction(fn, curr, ssjava.getSSJavaLoopEntrance());
+
+ // if a new result, schedule forward nodes for analysis
+ if (!curr.equals(prev)) {
+ mapFlatNodetoEventLoopMap.put(fn, curr);
+
+ for (int i = 0; i < fn.numNext(); i++) {
+ FlatNode nn = fn.getNext(i);
+ if (loopIncElements.contains(nn)) {
+ flatNodesToVisit.add(nn);
+ }
+
+ }
+ }
+ }
+ }
+
+ private void union(Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> in) {
+
+ Set<NTuple<Descriptor>> inKeySet = in.keySet();
+ for (Iterator iterator = inKeySet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> inKey = (NTuple<Descriptor>) iterator.next();
+ Set<WriteAge> inSet = in.get(inKey);
+
+ Set<WriteAge> currSet = curr.get(inKey);
+
+ if (currSet == null) {
+ currSet = new HashSet<WriteAge>();
+ curr.put(inKey, currSet);
+ }
+ currSet.addAll(inSet);
+ }
+
+ }
+
+ private void eventLoopAnalysis_nodeAction(FlatNode fn,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr, FlatNode loopEntrance) {
+
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> readWriteKillSet =
+ new Hashtable<NTuple<Descriptor>, Set<WriteAge>>();
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> readWriteGenSet =
+ new Hashtable<NTuple<Descriptor>, Set<WriteAge>>();
+
+ if (fn.equals(loopEntrance)) {
+ // it reaches loop entrance: changes all flag to true
+ Set<NTuple<Descriptor>> keySet = curr.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> key = (NTuple<Descriptor>) iterator.next();
+ Set<WriteAge> writeAgeSet = curr.get(key);
+
+ Set<WriteAge> incSet = new HashSet<WriteAge>();
+ incSet.addAll(writeAgeSet);
+ writeAgeSet.clear();
+
+ for (Iterator iterator2 = incSet.iterator(); iterator2.hasNext();) {
+ WriteAge writeAge = (WriteAge) iterator2.next();
+ WriteAge newWriteAge = writeAge.copy();
+ newWriteAge.inc();
+ writeAgeSet.add(newWriteAge);
+ }
+
+ }
+
+ } else {
+ TempDescriptor lhs;
+ TempDescriptor rhs;
+ FieldDescriptor fld;
+
+ switch (fn.kind()) {
+
+ case FKind.FlatOpNode: {
+ FlatOpNode fon = (FlatOpNode) fn;
+ lhs = fon.getDest();
+ rhs = fon.getLeft();
+
+ if (fon.getOp().getOp() == Operation.ASSIGN) {
+
+ if (!lhs.getSymbol().startsWith("neverused") && !lhs.getSymbol().startsWith("leftop")
+ && !lhs.getSymbol().startsWith("rightop")) {
+
+ boolean hasWriteEffect = false;
+
+ if (rhs.getType().getExtension() instanceof SSJavaType
+ && lhs.getType().getExtension() instanceof SSJavaType) {
+
+ CompositeLocation rhsCompLoc =
+ ((SSJavaType) rhs.getType().getExtension()).getCompLoc();
+
+ CompositeLocation lhsCompLoc =
+ ((SSJavaType) lhs.getType().getExtension()).getCompLoc();
+
+ if (lhsCompLoc != rhsCompLoc) {
+ // have a write effect!
+ hasWriteEffect = true;
+ }
+
+ } else if (lhs.getType().isImmutable()) {
+ hasWriteEffect = true;
+ }
+
+ if (hasWriteEffect && mapHeapPath.containsKey(lhs)) {
+ // write(lhs)
+ NTuple<Descriptor> lhsHeapPath = new NTuple<Descriptor>();
+ lhsHeapPath.addAll(mapHeapPath.get(lhs));
+
+ Location lhsLoc = getLocation(lhs);
+ if (ssjava.isSharedLocation(lhsLoc)) {
+
+ NTuple<Descriptor> varHeapPath = computePath(lhs);
+ NTuple<Location> varLocTuple = mapDescriptorToLocationPath.get(lhs);
+
+ Set<NTuple<Descriptor>> writtenSet =
+ mapFlatNodeToSharedLocMapping.get(fn).get(varLocTuple);
+
+ Set<NTuple<Descriptor>> mustClearSet =
+ mapFlatNodeToMustClearMap.get(fn).get(varLocTuple);
+
+ if (isCovered(varLocTuple, writtenSet, mustClearSet)) {
+ computeKILLSetForSharedWrite(curr, writtenSet, readWriteKillSet);
+ computeGENSetForSharedAllCoverWrite(curr, writtenSet, readWriteGenSet);
+ } else {
+ computeGENSetForSharedNonCoverWrite(curr, varHeapPath, readWriteGenSet);
+ }
+
+ } else {
+
+ computeKILLSetForWrite(curr, lhsHeapPath, readWriteKillSet);
+ computeGENSetForWrite(lhsHeapPath, readWriteGenSet);
+ }
+
+ Set<WriteAge> writeAgeSet = curr.get(lhsHeapPath);
+ checkWriteAgeSet(writeAgeSet, lhsHeapPath, fn);
+ }
+
+ }
+
+ }
+
+ }
+ break;
+
+ case FKind.FlatFieldNode:
+ case FKind.FlatElementNode: {
+
+ if (fn.kind() == FKind.FlatFieldNode) {
+ FlatFieldNode ffn = (FlatFieldNode) fn;
+ lhs = ffn.getDst();
+ rhs = ffn.getSrc();
+ fld = ffn.getField();
+ } else {
+ FlatElementNode fen = (FlatElementNode) fn;
+ lhs = fen.getDst();
+ rhs = fen.getSrc();
+ TypeDescriptor td = rhs.getType().dereference();
+ fld = getArrayField(td);
+ }
+
+ // read field
+ NTuple<Descriptor> srcHeapPath = mapHeapPath.get(rhs);
+ NTuple<Descriptor> fldHeapPath;
+ if (srcHeapPath != null) {
+ fldHeapPath = new NTuple<Descriptor>(srcHeapPath.getList());
+ } else {
+ // if srcHeapPath is null, it is static reference
+ fldHeapPath = new NTuple<Descriptor>();
+ fldHeapPath.add(rhs);
+ }
+ fldHeapPath.add(fld);
+
+ Set<WriteAge> writeAgeSet = curr.get(fldHeapPath);
+
+ checkWriteAgeSet(writeAgeSet, fldHeapPath, fn);
+
+ }
+ break;
+
+ case FKind.FlatSetFieldNode:
+ case FKind.FlatSetElementNode: {
+
+ if (fn.kind() == FKind.FlatSetFieldNode) {
+ FlatSetFieldNode fsfn = (FlatSetFieldNode) fn;
+ lhs = fsfn.getDst();
+ fld = fsfn.getField();
+ } else {
+ FlatSetElementNode fsen = (FlatSetElementNode) fn;
+ lhs = fsen.getDst();
+ rhs = fsen.getSrc();
+ TypeDescriptor td = lhs.getType().dereference();
+ fld = getArrayField(td);
+ }
+
+ // set up heap path
+ NTuple<Descriptor> lhsHeapPath = mapHeapPath.get(lhs);
+ if (lhsHeapPath != null) {
+ // write(field)
+ NTuple<Descriptor> fldHeapPath = new NTuple<Descriptor>(lhsHeapPath.getList());
+ if (fn.kind() == FKind.FlatSetFieldNode) {
+ fldHeapPath.add(fld);
+ }
+
+ // shared loc extension
+ Location fieldLoc;
+ if (fn.kind() == FKind.FlatSetFieldNode) {
+ fieldLoc = (Location) fld.getType().getExtension();
+ } else {
+ NTuple<Location> locTuple = mapDescriptorToLocationPath.get(lhs);
+ fieldLoc = locTuple.get(locTuple.size() - 1);
+ }
+
+ if (ssjava.isSharedLocation(fieldLoc)) {
+
+ NTuple<Location> fieldLocTuple = new NTuple<Location>();
+ fieldLocTuple.addAll(mapDescriptorToLocationPath.get(lhs));
+ if (fn.kind() == FKind.FlatSetFieldNode) {
+ fieldLocTuple.add(fieldLoc);
+ }
+
+ Set<NTuple<Descriptor>> writtenSet =
+ mapFlatNodeToSharedLocMapping.get(fn).get(fieldLocTuple);
+ if (isCovered(fieldLocTuple, writtenSet)) {
+ computeKILLSetForSharedWrite(curr, writtenSet, readWriteKillSet);
+ computeGENSetForSharedAllCoverWrite(curr, writtenSet, readWriteGenSet);
+ } else {
+ computeGENSetForSharedNonCoverWrite(curr, fldHeapPath, readWriteGenSet);
+ }
+
+ } else {
+ computeKILLSetForWrite(curr, fldHeapPath, readWriteKillSet);
+ computeGENSetForWrite(fldHeapPath, readWriteGenSet);
+ }
+
+ }
+
+ }
+ break;
+
+ case FKind.FlatCall: {
+ FlatCall fc = (FlatCall) fn;
+ SharedLocMap sharedLocMap = mapFlatNodeToSharedLocMapping.get(fc);
+ SharedLocMap mustClearMap = mapFlatNodeToMustClearMap.get(fc);
+ generateKILLSetForFlatCall(fc, curr, sharedLocMap, mustClearMap, readWriteKillSet);
+ generateGENSetForFlatCall(fc, sharedLocMap, mustClearMap, readWriteGenSet);
+
+ }
+ break;
+
+ }
+
+ computeNewMapping(curr, readWriteKillSet, readWriteGenSet);
+ if (fn instanceof FlatCall) {
+ checkManyRead((FlatCall) fn, curr);
+ }
+
+ }
+
+ }
+
+ private void computeGENSetForSharedNonCoverWrite(
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr, NTuple<Descriptor> heapPath,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> genSet) {
+
+ Set<WriteAge> writeAgeSet = genSet.get(heapPath);
+ if (writeAgeSet == null) {
+ writeAgeSet = new HashSet<WriteAge>();
+ genSet.put(heapPath, writeAgeSet);
+ }
+
+ writeAgeSet.add(new WriteAge(1));
+
+ }
+
+ private void computeGENSetForSharedAllCoverWrite(
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr, Set<NTuple<Descriptor>> writtenSet,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> genSet) {
+
+ for (Iterator iterator = writtenSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> writeHeapPath = (NTuple<Descriptor>) iterator.next();
+
+ Set<WriteAge> writeAgeSet = new HashSet<WriteAge>();
+ writeAgeSet.add(new WriteAge(0));
+
+ genSet.put(writeHeapPath, writeAgeSet);
+ }
+
+ }
+
+ private void computeKILLSetForSharedWrite(Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr,
+ Set<NTuple<Descriptor>> writtenSet, Hashtable<NTuple<Descriptor>, Set<WriteAge>> killSet) {
+
+ for (Iterator iterator = writtenSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> writeHeapPath = (NTuple<Descriptor>) iterator.next();
+ Set<WriteAge> writeSet = curr.get(writeHeapPath);
+ if (writeSet != null) {
+ killSet.put(writeHeapPath, writeSet);
+ }
+ }
+
+ }
+
+ private boolean isCovered(NTuple<Location> locTuple, Set<NTuple<Descriptor>> curWrittenSet) {
+
+ Set<NTuple<Descriptor>> coverSet =
+ mapMethodToSharedLocCoverSet.get(methodContainingSSJavaLoop).get(locTuple);
+
+ if (curWrittenSet == null) {
+ return false;
+ }
+
+ return curWrittenSet.containsAll(coverSet);
+ }
+
+ private boolean isCovered(NTuple<Location> locTuple, Set<NTuple<Descriptor>> curWrittenSet,
+ Set<NTuple<Descriptor>> mustClearSet) {
+
+ Set<NTuple<Descriptor>> coverSet =
+ mapMethodToSharedLocCoverSet.get(methodContainingSSJavaLoop).get(locTuple);
+
+ if (mustClearSet != null && mustClearSet.containsAll(coverSet)) {
+ return true;
+ }
+
+ if (curWrittenSet == null) {
+ return false;
+ }
+
+ return curWrittenSet.containsAll(coverSet);
+ }
+
+ private void checkManyRead(FlatCall fc, Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr) {
+ Set<NTuple<Descriptor>> boundReadSet = mapFlatNodeToBoundReadSet.get(fc);
+ for (Iterator iterator = boundReadSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> readHeapPath = (NTuple<Descriptor>) iterator.next();
+ Set<WriteAge> writeAgeSet = curr.get(readHeapPath);
+ checkWriteAgeSet(writeAgeSet, readHeapPath, fc);
+ }
+
+ }
+
+ private void checkWriteAgeSet(Set<WriteAge> writeAgeSet, NTuple<Descriptor> path, FlatNode fn) {
+
+ if (writeAgeSet != null) {
+ for (Iterator iterator = writeAgeSet.iterator(); iterator.hasNext();) {
+ WriteAge writeAge = (WriteAge) iterator.next();
+ if (writeAge.getAge() > MAXAGE) {
+ generateErrorMessage(path, fn);
+ }
+ }
+ }
+ }
+
+ private void generateErrorMessage(NTuple<Descriptor> path, FlatNode fn) {
+
+ Descriptor lastDesc = path.get(getArrayBaseDescriptorIdx(path));
+ if (ssjava.isSharedLocation(getLocation(lastDesc))) {
+
+ NTuple<Location> locPathTuple = getLocationTuple(path);
+ Set<NTuple<Descriptor>> coverSet =
+ mapMethodToSharedLocCoverSet.get(methodContainingSSJavaLoop).get(locPathTuple);
+ throw new Error("Shared memory locations, which is reachable through references " + path
+ + ", are not completely overwritten by the higher values at "
+ + methodContainingSSJavaLoop.getClassDesc().getSourceFileName() + "::" + fn.getNumLine()
+ + ".\nThe following memory locations belong to the same shared locations:" + coverSet);
+
+ } else {
+ throw new Error(
+ "Memory location, which is reachable through references "
+ + path
+ + ", who comes back to the same read statement without being overwritten at the out-most iteration at "
+ + methodContainingSSJavaLoop.getClassDesc().getSourceFileName() + "::"
+ + fn.getNumLine());
+ }
+
+ }
+
+ private void generateGENSetForFlatCall(FlatCall fc, SharedLocMap sharedLocMap,
+ SharedLocMap mustClearMap, Hashtable<NTuple<Descriptor>, Set<WriteAge>> GENSet) {
+
+ Set<NTuple<Descriptor>> boundMayWriteSet = mapFlatNodeToBoundMayWriteSet.get(fc);
+
+ for (Iterator iterator = boundMayWriteSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> heapPath = (NTuple<Descriptor>) iterator.next();
+
+ if (!isSharedLocation(heapPath)) {
+ addWriteAgeToSet(heapPath, GENSet, new WriteAge(0));
+ } else {
+ // if the current heap path is shared location
+
+ NTuple<Location> locTuple = getLocationTuple(heapPath);
+
+ Set<NTuple<Descriptor>> sharedWriteHeapPathSet = sharedLocMap.get(locTuple);
+
+ if (isCovered(locTuple, sharedLocMap.get(locTuple), mustClearMap.get(locTuple))) {
+ // if it is covered, add all of heap paths belong to the same shared
+ // loc with write age 0
+ for (Iterator iterator2 = sharedWriteHeapPathSet.iterator(); iterator2.hasNext();) {
+ NTuple<Descriptor> sharedHeapPath = (NTuple<Descriptor>) iterator2.next();
+ addWriteAgeToSet(sharedHeapPath, GENSet, new WriteAge(0));
+ }
+
+ } else {
+ // if not covered, add write age 1 to the heap path that is
+ // may-written but not covered
+ addWriteAgeToSet(heapPath, GENSet, new WriteAge(1));
+ }
+
+ }
+
+ }
+
+ }
+
+ private void addWriteAgeToSet(NTuple<Descriptor> heapPath,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> map, WriteAge age) {
+
+ Set<WriteAge> currSet = map.get(heapPath);
+ if (currSet == null) {
+ currSet = new HashSet<WriteAge>();
+ map.put(heapPath, currSet);
+ }
+
+ currSet.add(age);
+ }
+
+ private void generateKILLSetForFlatCall(FlatCall fc,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr, SharedLocMap sharedLocMap,
+ SharedLocMap mustClearMap, Hashtable<NTuple<Descriptor>, Set<WriteAge>> KILLSet) {
+
+ Set<NTuple<Descriptor>> boundMustWriteSet = mapFlatNodeToBoundMustWriteSet.get(fc);
+
+ for (Iterator iterator = boundMustWriteSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> heapPath = (NTuple<Descriptor>) iterator.next();
+
+ if (isSharedLocation(heapPath)) {
+ NTuple<Location> locTuple = getLocationTuple(heapPath);
+
+ if (isCovered(locTuple, sharedLocMap.get(locTuple), mustClearMap.get(locTuple))
+ && curr.containsKey(heapPath)) {
+ // if it is shared loc and corresponding shared loc has been covered
+ KILLSet.put(heapPath, curr.get(heapPath));
+ }
+ } else {
+
+ for (Enumeration<NTuple<Descriptor>> e = curr.keys(); e.hasMoreElements();) {
+ NTuple<Descriptor> key = e.nextElement();
+ if (key.startsWith(heapPath)) {
+ KILLSet.put(key, curr.get(key));
+ }
+ }
+
+ }
+
+ }
+
+ }
+
+ private int getArrayBaseDescriptorIdx(NTuple<Descriptor> heapPath) {
+
+ for (int i = heapPath.size() - 1; i >= 0; i--) {
+ if (!heapPath.get(i).getSymbol().equals(arrayElementFieldName)) {
+ return i;
+ }
+ }
+
+ return -1;
+
+ }
+
+ private boolean isSharedLocation(NTuple<Descriptor> heapPath) {
+
+ Descriptor d = heapPath.get(getArrayBaseDescriptorIdx(heapPath));
+
+ return ssjava.isSharedLocation(getLocation(heapPath.get(getArrayBaseDescriptorIdx(heapPath))));
+
+ }
+
+ private NTuple<Location> getLocationTuple(NTuple<Descriptor> heapPath) {
+
+ NTuple<Location> locTuple = new NTuple<Location>();
+
+ locTuple.addAll(mapDescriptorToLocationPath.get(heapPath.get(0)));
+
+ for (int i = 1; i <= getArrayBaseDescriptorIdx(heapPath); i++) {
+ locTuple.add(getLocation(heapPath.get(i)));
+ }
+
+ return locTuple;
+ }
+
+ private void computeNewMapping(Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> KILLSet,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> GENSet) {
+
+ for (Enumeration<NTuple<Descriptor>> e = KILLSet.keys(); e.hasMoreElements();) {
+ NTuple<Descriptor> key = e.nextElement();
+
+ Set<WriteAge> writeAgeSet = curr.get(key);
+ if (writeAgeSet == null) {
+ writeAgeSet = new HashSet<WriteAge>();
+ curr.put(key, writeAgeSet);
+ }
+ writeAgeSet.removeAll(KILLSet.get(key));
+ }
+
+ for (Enumeration<NTuple<Descriptor>> e = GENSet.keys(); e.hasMoreElements();) {
+ NTuple<Descriptor> key = e.nextElement();
+
+ Set<WriteAge> currWriteAgeSet = curr.get(key);
+ if (currWriteAgeSet == null) {
+ currWriteAgeSet = new HashSet<WriteAge>();
+ curr.put(key, currWriteAgeSet);
+ }
+ currWriteAgeSet.addAll(GENSet.get(key));
+ }
+
+ }
+
+ private void computeGENSetForWrite(NTuple<Descriptor> fldHeapPath,
+ Hashtable<NTuple<Descriptor>, Set<WriteAge>> GENSet) {
+
+ // generate write age 0 for the field being written to
+ Set<WriteAge> writeAgeSet = new HashSet<WriteAge>();
+ writeAgeSet.add(new WriteAge(0));
+ GENSet.put(fldHeapPath, writeAgeSet);
+
+ }
+
+ private void computeKILLSetForWrite(Hashtable<NTuple<Descriptor>, Set<WriteAge>> curr,
+ NTuple<Descriptor> hp, Hashtable<NTuple<Descriptor>, Set<WriteAge>> KILLSet) {
+
+ // removes all of heap path that starts with prefix 'hp'
+ // since any reference overwrite along heap path gives overwriting side
+ // effects on the value
+
+ Set<NTuple<Descriptor>> keySet = curr.keySet();
+ for (Iterator<NTuple<Descriptor>> iter = keySet.iterator(); iter.hasNext();) {
+ NTuple<Descriptor> key = iter.next();
+ if (key.startsWith(hp)) {
+ KILLSet.put(key, curr.get(key));
+ }
+ }