Home
last modified time | relevance | path

Searched refs:weakRefs (Results 1 – 2 of 2) sorted by relevance

/art/test/2043-reference-pauses/src/
DMain.java48 ArrayList<WeakReference<Integer>> weakRefs = new ArrayList<>(NREFS); field in Main
114 weakRefs.add(null); in fillWeakRefs()
129 weakRefs.set(i * REFS_PER_BATCH + j, in timeUnreachableInner()
142 WeakReference<Integer> wr = weakRefs.get(j); in timeUnreachableInner()
149 weakRefs.set(j, null); in timeUnreachableInner()
173 if (weakRefs.get(i) != null && weakRefs.get(i).get() != null) { in timeUnreachable()
193 weakRefs.set(j, new WeakReference(newObj)); in timeReachable()
196 WeakReference<Integer> wr = weakRefs.get(j); in timeReachable()
/art/test/2042-reference-processing/src/
DMain.java67 TreeMap<Integer, MyWeakReference> weakRefs = new TreeMap<>(); field in Main
118 for (MyWeakReference wr : weakRefs.subMap(num + 1, batchEnd).values()) { in CheckOKToClearWeak()
136 MyWeakReference wr = weakRefs.get(num); in CheckOKToClearPhantom()
149 MyWeakReference wr = weakRefs.get(num); in emptyAndCheckQueues()
172 if (weakRefs.remove(Integer.valueOf(wr.n)) != ref) { in emptyAndCheckQueues()
196 weakRefs.put(me, new MyWeakReference(listHead)); in addObjects()
259 if (!weakRefs.isEmpty()) { in testLoop()
260 System.out.println("Weak Reference map nonempty size = " + weakRefs.size()); in testLoop()