Lines Matching refs:objects
49 private static void makeRefs(Object objects[], SoftReference<Object> refs[]) {
50 for (int i = 0; i < objects.length; i++) {
51 objects[i] = (Object) new byte[8 * 1024];
52 refs[i] = new SoftReference<Object>(objects[i]);
71 private static void clearRefs(Object objects[], int skip) {
72 for (int i = 0; i < objects.length; i += skip) {
73 objects[i] = null;
77 private static void clearRefs(Object objects[]) {
78 clearRefs(objects, 1);
81 private static <T> void checkRefs(T objects[], SoftReference<T> refs[]) {
84 for (int i = 0; i < objects.length; i++) {
85 if (refs[i].get() != objects[i]) {
98 Object objects[] = new Object[NUM_REFS];
99 SoftReference<Object> refs[] = new SoftReference[objects.length];
101 /* Create a bunch of objects and a parallel array
104 makeRefs(objects, refs);
107 /* Let go of some of the hard references to the objects so that
110 clearRefs(objects, 3);
112 /* Collect all softly-reachable objects.
117 /* Make sure that the objects were collected.
119 checkRefs(objects, refs);
123 clearRefs(objects, 2);
126 checkRefs(objects, refs);
132 clearRefs(objects);
135 checkRefs(objects, refs);
141 Object objects[] = new Object[NUM_REFS];
142 SoftReference<Object> refs[] = new SoftReference[objects.length];
144 /* Create a bunch of objects and a parallel array
147 makeRefs(objects, refs);
150 /* Let go of the hard references to the objects so that
153 clearRefs(objects);
155 /* Start creating a bunch of temporary and permanent objects
177 private static void makeRefs(Object objects[], WeakReference<Object> refs[]) {
178 for (int i = 0; i < objects.length; i++) {
179 objects[i] = new Object();
180 refs[i] = new WeakReference<Object>(objects[i]);
184 private static <T> void checkRefs(T objects[], WeakReference<T> refs[]) {
187 for (int i = 0; i < objects.length; i++) {
188 if (refs[i].get() != objects[i]) {
202 Object objects[] = new Object[NUM_REFS];
203 WeakReference<Object> refs[] = new WeakReference[objects.length];
205 /* Create a bunch of objects and a parallel array
208 makeRefs(objects, refs);
210 checkRefs(objects, refs);
214 for (int i = 0; i < objects.length; i += 2) {
215 objects[i] = null;
218 checkRefs(objects, refs);
222 for (int i = 0; i < objects.length; i++) {
223 objects[i] = null;
226 checkRefs(objects, refs);
229 private static void makeRefs(Object objects[], PhantomReference<Object> refs[],
231 for (int i = 0; i < objects.length; i++) {
232 objects[i] = new Object();
233 refs[i] = new PhantomReference<Object>(objects[i], queue);
237 static <T> void checkRefs(T objects[], PhantomReference<T> refs[],
246 for (int i = 0; i < objects.length; i++) {
247 if (objects[i] == null && refs[i] != null) {
266 for (i = 0; i < objects.length; i++) {
271 if (i == objects.length) {
275 if (objects[i] != null) {
297 for (int i = 0; i < objects.length; i++) {
298 if (objects[i] == null && refs[i] != null) {
314 Object objects[] = new Object[NUM_REFS];
315 PhantomReference<Object> refs[] = new PhantomReference[objects.length];
318 /* Create a bunch of objects and a parallel array
321 makeRefs(objects, refs, queue);
323 checkRefs(objects, refs, queue);
327 for (int i = 0; i < objects.length; i += 2) {
328 objects[i] = null;
333 checkRefs(objects, refs, queue);
337 for (int i = 0; i < objects.length; i++) {
338 objects[i] = null;
343 checkRefs(objects, refs, queue);
359 private static void makeRefs(FinalizableObject objects[],
361 for (int i = 0; i < objects.length; i++) {
362 objects[i] = new FinalizableObject();
363 refs[i] = new WeakReference<FinalizableObject>(objects[i]);
371 FinalizableObject objects[] = new FinalizableObject[NUM_REFS];
372 WeakReference<FinalizableObject> refs[] = new WeakReference[objects.length];
375 /* Create a bunch of objects and a parallel array
378 makeRefs(objects, refs);
380 checkRefs(objects, refs);
386 for (int i = 0; i < objects.length; i += 2) {
387 objects[i] = null;
393 checkRefs(objects, refs);
404 for (int i = 0; i < objects.length; i++) {
405 if (objects[i] != null) {
406 objects[i] = null;
413 checkRefs(objects, refs);
455 /* Allocate progressively smaller objects to fill up the entire heap.