public boolean isUnified(PointerKey p) { if (p == null) { throw new IllegalArgumentException("null p"); } int i = findOrCreateIndex(p); return pointsToSets.get(i) == UNIFIED; }
/** * record that a particular points-to-set is represented implicitly */ public void recordImplicit(PointerKey key) { if (key == null) { throw new IllegalArgumentException("null key"); } int i = findOrCreateIndex(key); pointsToSets.set(i, IMPLICIT); }
/** * record that a particular points-to-set has been unioned with another */ public void recordUnified(PointerKey key) { if (key == null) { throw new IllegalArgumentException("null key"); } int i = findOrCreateIndex(key); pointsToSets.set(i, UNIFIED); }
/** * record points-to-sets that are "roots" of the transitive closure. These points-to-sets can't be thrown away for a * pre-transitive solver. A "root" is a points-to-set whose contents do not result from flow from other points-to-sets; there * points-to-sets are the primordial assignments from which the transitive closure flows. */ public void recordTransitiveRoot(PointerKey key) { if (key == null) { throw new IllegalArgumentException("null key"); } int i = findOrCreateIndex(key); transitiveRoots.set(i); }
/** * record that a particular points-to-set has been unioned with another */ public void recordUnified(PointerKey key) { if (key == null) { throw new IllegalArgumentException("null key"); } int i = findOrCreateIndex(key); pointsToSets.set(i, UNIFIED); }
/** * A "root" is a points-to-set whose contents do not result from flow from other points-to-sets; there points-to-sets are the * primordial assignments from which the transitive closure flows. */ boolean isTransitiveRoot(PointerKey key) { int i = findOrCreateIndex(key); return transitiveRoots.get(i); }
/** * record that a particular points-to-set is represented implicitly */ public void recordImplicit(PointerKey key) { if (key == null) { throw new IllegalArgumentException("null key"); } int i = findOrCreateIndex(key); pointsToSets.set(i, IMPLICIT); }
/** * A "root" is a points-to-set whose contents do not result from flow from other points-to-sets; there points-to-sets are the * primordial assignments from which the transitive closure flows. */ boolean isTransitiveRoot(PointerKey key) { int i = findOrCreateIndex(key); return transitiveRoots.get(i); }
/** * record points-to-sets that are "roots" of the transitive closure. These points-to-sets can't be thrown away for a * pre-transitive solver. A "root" is a points-to-set whose contents do not result from flow from other points-to-sets; there * points-to-sets are the primordial assignments from which the transitive closure flows. */ public void recordTransitiveRoot(PointerKey key) { if (key == null) { throw new IllegalArgumentException("null key"); } int i = findOrCreateIndex(key); transitiveRoots.set(i); }
public boolean isUnified(PointerKey p) { if (p == null) { throw new IllegalArgumentException("null p"); } int i = findOrCreateIndex(p); return pointsToSets.get(i) == UNIFIED; }
public void put(PointerKey key, PointsToSetVariable v) { int i = findOrCreateIndex(key); pointsToSets.set(i, v); }
public void put(PointerKey key, PointsToSetVariable v) { int i = findOrCreateIndex(key); pointsToSets.set(i, v); }