Print this page
rev 2869 : 7117303: VM uses non-monotonic time source and complains that it is non-monotonic
Summary: Replaces calls to os::javaTimeMillis(), which does not guarantee montonicity, in GC code to os::javaTimeNanos() with a suitable conversion factor. os::javaTimeNanos() mostly guarantees montonicity depending on the underlying OS implementation and, as a result, a better alternative. Changes in OS files are to make use of the newly defined constants in globalDefinitions.hpp.
Reviewed-by:
Split |
Close |
Expand all |
Collapse all |
--- old/src/share/vm/memory/referenceProcessor.cpp
+++ new/src/share/vm/memory/referenceProcessor.cpp
1 1 /*
2 2 * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #include "precompiled.hpp"
26 26 #include "classfile/javaClasses.hpp"
27 27 #include "classfile/systemDictionary.hpp"
28 28 #include "gc_interface/collectedHeap.hpp"
29 29 #include "gc_interface/collectedHeap.inline.hpp"
30 30 #include "memory/referencePolicy.hpp"
31 31 #include "memory/referenceProcessor.hpp"
32 32 #include "oops/oop.inline.hpp"
33 33 #include "runtime/java.hpp"
34 34 #include "runtime/jniHandles.hpp"
35 35
↓ open down ↓ |
35 lines elided |
↑ open up ↑ |
36 36 ReferencePolicy* ReferenceProcessor::_always_clear_soft_ref_policy = NULL;
37 37 ReferencePolicy* ReferenceProcessor::_default_soft_ref_policy = NULL;
38 38 bool ReferenceProcessor::_pending_list_uses_discovered_field = false;
39 39 jlong ReferenceProcessor::_soft_ref_timestamp_clock = 0;
40 40
41 41 void referenceProcessor_init() {
42 42 ReferenceProcessor::init_statics();
43 43 }
44 44
45 45 void ReferenceProcessor::init_statics() {
46 - jlong now = os::javaTimeMillis();
46 + // os::javaTimeMillis() does not guarantee monotonicity.
47 + jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC;
47 48
48 49 // Initialize the soft ref timestamp clock.
49 50 _soft_ref_timestamp_clock = now;
50 51 // Also update the soft ref clock in j.l.r.SoftReference
51 52 java_lang_ref_SoftReference::set_clock(_soft_ref_timestamp_clock);
52 53
53 54 _always_clear_soft_ref_policy = new AlwaysClearPolicy();
54 55 _default_soft_ref_policy = new COMPILER2_PRESENT(LRUMaxHeapPolicy())
55 56 NOT_COMPILER2(LRUCurrentHeapPolicy());
56 57 if (_always_clear_soft_ref_policy == NULL || _default_soft_ref_policy == NULL) {
57 58 vm_exit_during_initialization("Could not allocate reference policy object");
58 59 }
59 60 guarantee(RefDiscoveryPolicy == ReferenceBasedDiscovery ||
60 61 RefDiscoveryPolicy == ReferentBasedDiscovery,
61 62 "Unrecongnized RefDiscoveryPolicy");
62 63 _pending_list_uses_discovered_field = JDK_Version::current().pending_list_uses_discovered_field();
63 64 }
64 65
65 66 void ReferenceProcessor::enable_discovery(bool verify_disabled, bool check_no_refs) {
66 67 #ifdef ASSERT
67 68 // Verify that we're not currently discovering refs
68 69 assert(!verify_disabled || !_discovering_refs, "nested call?");
69 70
70 71 if (check_no_refs) {
71 72 // Verify that the discovered lists are empty
72 73 verify_no_references_recorded();
73 74 }
74 75 #endif // ASSERT
75 76
76 77 // Someone could have modified the value of the static
77 78 // field in the j.l.r.SoftReference class that holds the
78 79 // soft reference timestamp clock using reflection or
79 80 // Unsafe between GCs. Unconditionally update the static
80 81 // field in ReferenceProcessor here so that we use the new
81 82 // value during reference discovery.
82 83
83 84 _soft_ref_timestamp_clock = java_lang_ref_SoftReference::clock();
84 85 _discovering_refs = true;
85 86 }
86 87
87 88 ReferenceProcessor::ReferenceProcessor(MemRegion span,
88 89 bool mt_processing,
89 90 int mt_processing_degree,
90 91 bool mt_discovery,
91 92 int mt_discovery_degree,
92 93 bool atomic_discovery,
93 94 BoolObjectClosure* is_alive_non_header,
94 95 bool discovered_list_needs_barrier) :
95 96 _discovering_refs(false),
96 97 _enqueuing_is_done(false),
97 98 _is_alive_non_header(is_alive_non_header),
98 99 _discovered_list_needs_barrier(discovered_list_needs_barrier),
99 100 _bs(NULL),
100 101 _processing_is_mt(mt_processing),
101 102 _next_id(0)
102 103 {
103 104 _span = span;
104 105 _discovery_is_atomic = atomic_discovery;
105 106 _discovery_is_mt = mt_discovery;
106 107 _num_q = MAX2(1, mt_processing_degree);
107 108 _max_num_q = MAX2(_num_q, mt_discovery_degree);
108 109 _discovered_refs = NEW_C_HEAP_ARRAY(DiscoveredList,
109 110 _max_num_q * number_of_subclasses_of_ref());
110 111 if (_discovered_refs == NULL) {
111 112 vm_exit_during_initialization("Could not allocated RefProc Array");
112 113 }
113 114 _discoveredSoftRefs = &_discovered_refs[0];
114 115 _discoveredWeakRefs = &_discoveredSoftRefs[_max_num_q];
115 116 _discoveredFinalRefs = &_discoveredWeakRefs[_max_num_q];
116 117 _discoveredPhantomRefs = &_discoveredFinalRefs[_max_num_q];
117 118
118 119 // Initialize all entries to NULL
119 120 for (int i = 0; i < _max_num_q * number_of_subclasses_of_ref(); i++) {
120 121 _discovered_refs[i].set_head(NULL);
121 122 _discovered_refs[i].set_length(0);
122 123 }
123 124
124 125 // If we do barriers, cache a copy of the barrier set.
125 126 if (discovered_list_needs_barrier) {
126 127 _bs = Universe::heap()->barrier_set();
127 128 }
128 129 setup_policy(false /* default soft ref policy */);
129 130 }
130 131
131 132 #ifndef PRODUCT
132 133 void ReferenceProcessor::verify_no_references_recorded() {
133 134 guarantee(!_discovering_refs, "Discovering refs?");
134 135 for (int i = 0; i < _max_num_q * number_of_subclasses_of_ref(); i++) {
135 136 guarantee(_discovered_refs[i].is_empty(),
136 137 "Found non-empty discovered list");
137 138 }
138 139 }
139 140 #endif
140 141
141 142 void ReferenceProcessor::weak_oops_do(OopClosure* f) {
142 143 for (int i = 0; i < _max_num_q * number_of_subclasses_of_ref(); i++) {
143 144 if (UseCompressedOops) {
↓ open down ↓ |
87 lines elided |
↑ open up ↑ |
144 145 f->do_oop((narrowOop*)_discovered_refs[i].adr_head());
145 146 } else {
146 147 f->do_oop((oop*)_discovered_refs[i].adr_head());
147 148 }
148 149 }
149 150 }
150 151
151 152 void ReferenceProcessor::update_soft_ref_master_clock() {
152 153 // Update (advance) the soft ref master clock field. This must be done
153 154 // after processing the soft ref list.
154 - jlong now = os::javaTimeMillis();
155 +
156 + // os::javaTimeMillis() does not guarantee monotonicity.
157 + jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC;
155 158 jlong soft_ref_clock = java_lang_ref_SoftReference::clock();
156 159 assert(soft_ref_clock == _soft_ref_timestamp_clock, "soft ref clocks out of sync");
157 160
158 161 NOT_PRODUCT(
159 162 if (now < _soft_ref_timestamp_clock) {
160 163 warning("time warp: "INT64_FORMAT" to "INT64_FORMAT,
161 164 _soft_ref_timestamp_clock, now);
162 165 }
163 166 )
164 167 // In product mode, protect ourselves from system time being adjusted
165 168 // externally and going backward; see note in the implementation of
166 169 // GenCollectedHeap::time_since_last_gc() for the right way to fix
167 170 // this uniformly throughout the VM; see bug-id 4741166. XXX
168 171 if (now > _soft_ref_timestamp_clock) {
169 172 _soft_ref_timestamp_clock = now;
170 173 java_lang_ref_SoftReference::set_clock(now);
171 174 }
172 175 // Else leave clock stalled at its old value until time progresses
173 176 // past clock value.
174 177 }
175 178
176 179 void ReferenceProcessor::process_discovered_references(
177 180 BoolObjectClosure* is_alive,
178 181 OopClosure* keep_alive,
179 182 VoidClosure* complete_gc,
180 183 AbstractRefProcTaskExecutor* task_executor) {
181 184 NOT_PRODUCT(verify_ok_to_handle_reflists());
182 185
183 186 assert(!enqueuing_is_done(), "If here enqueuing should not be complete");
184 187 // Stop treating discovered references specially.
185 188 disable_discovery();
186 189
187 190 // If discovery was concurrent, someone could have modified
188 191 // the value of the static field in the j.l.r.SoftReference
189 192 // class that holds the soft reference timestamp clock using
190 193 // reflection or Unsafe between when discovery was enabled and
191 194 // now. Unconditionally update the static field in ReferenceProcessor
192 195 // here so that we use the new value during processing of the
193 196 // discovered soft refs.
194 197
195 198 _soft_ref_timestamp_clock = java_lang_ref_SoftReference::clock();
196 199
197 200 bool trace_time = PrintGCDetails && PrintReferenceGC;
198 201 // Soft references
199 202 {
200 203 TraceTime tt("SoftReference", trace_time, false, gclog_or_tty);
201 204 process_discovered_reflist(_discoveredSoftRefs, _current_soft_ref_policy, true,
202 205 is_alive, keep_alive, complete_gc, task_executor);
203 206 }
204 207
205 208 update_soft_ref_master_clock();
206 209
207 210 // Weak references
208 211 {
209 212 TraceTime tt("WeakReference", trace_time, false, gclog_or_tty);
210 213 process_discovered_reflist(_discoveredWeakRefs, NULL, true,
211 214 is_alive, keep_alive, complete_gc, task_executor);
212 215 }
213 216
214 217 // Final references
215 218 {
216 219 TraceTime tt("FinalReference", trace_time, false, gclog_or_tty);
217 220 process_discovered_reflist(_discoveredFinalRefs, NULL, false,
218 221 is_alive, keep_alive, complete_gc, task_executor);
219 222 }
220 223
221 224 // Phantom references
222 225 {
223 226 TraceTime tt("PhantomReference", trace_time, false, gclog_or_tty);
224 227 process_discovered_reflist(_discoveredPhantomRefs, NULL, false,
225 228 is_alive, keep_alive, complete_gc, task_executor);
226 229 }
227 230
228 231 // Weak global JNI references. It would make more sense (semantically) to
229 232 // traverse these simultaneously with the regular weak references above, but
230 233 // that is not how the JDK1.2 specification is. See #4126360. Native code can
231 234 // thus use JNI weak references to circumvent the phantom references and
232 235 // resurrect a "post-mortem" object.
233 236 {
234 237 TraceTime tt("JNI Weak Reference", trace_time, false, gclog_or_tty);
235 238 if (task_executor != NULL) {
236 239 task_executor->set_single_threaded_mode();
237 240 }
238 241 process_phaseJNI(is_alive, keep_alive, complete_gc);
239 242 }
240 243 }
241 244
242 245 #ifndef PRODUCT
243 246 // Calculate the number of jni handles.
244 247 uint ReferenceProcessor::count_jni_refs() {
245 248 class AlwaysAliveClosure: public BoolObjectClosure {
246 249 public:
247 250 virtual bool do_object_b(oop obj) { return true; }
248 251 virtual void do_object(oop obj) { assert(false, "Don't call"); }
249 252 };
250 253
251 254 class CountHandleClosure: public OopClosure {
252 255 private:
253 256 int _count;
254 257 public:
255 258 CountHandleClosure(): _count(0) {}
256 259 void do_oop(oop* unused) { _count++; }
257 260 void do_oop(narrowOop* unused) { ShouldNotReachHere(); }
258 261 int count() { return _count; }
259 262 };
260 263 CountHandleClosure global_handle_count;
261 264 AlwaysAliveClosure always_alive;
262 265 JNIHandles::weak_oops_do(&always_alive, &global_handle_count);
263 266 return global_handle_count.count();
264 267 }
265 268 #endif
266 269
267 270 void ReferenceProcessor::process_phaseJNI(BoolObjectClosure* is_alive,
268 271 OopClosure* keep_alive,
269 272 VoidClosure* complete_gc) {
270 273 #ifndef PRODUCT
271 274 if (PrintGCDetails && PrintReferenceGC) {
272 275 unsigned int count = count_jni_refs();
273 276 gclog_or_tty->print(", %u refs", count);
274 277 }
275 278 #endif
276 279 JNIHandles::weak_oops_do(is_alive, keep_alive);
277 280 complete_gc->do_void();
278 281 }
279 282
280 283
281 284 template <class T>
282 285 bool enqueue_discovered_ref_helper(ReferenceProcessor* ref,
283 286 AbstractRefProcTaskExecutor* task_executor) {
284 287
285 288 // Remember old value of pending references list
286 289 T* pending_list_addr = (T*)java_lang_ref_Reference::pending_list_addr();
287 290 T old_pending_list_value = *pending_list_addr;
288 291
289 292 // Enqueue references that are not made active again, and
290 293 // clear the decks for the next collection (cycle).
291 294 ref->enqueue_discovered_reflists((HeapWord*)pending_list_addr, task_executor);
292 295 // Do the oop-check on pending_list_addr missed in
293 296 // enqueue_discovered_reflist. We should probably
294 297 // do a raw oop_check so that future such idempotent
295 298 // oop_stores relying on the oop-check side-effect
296 299 // may be elided automatically and safely without
297 300 // affecting correctness.
298 301 oop_store(pending_list_addr, oopDesc::load_decode_heap_oop(pending_list_addr));
299 302
300 303 // Stop treating discovered references specially.
301 304 ref->disable_discovery();
302 305
303 306 // Return true if new pending references were added
304 307 return old_pending_list_value != *pending_list_addr;
305 308 }
306 309
307 310 bool ReferenceProcessor::enqueue_discovered_references(AbstractRefProcTaskExecutor* task_executor) {
308 311 NOT_PRODUCT(verify_ok_to_handle_reflists());
309 312 if (UseCompressedOops) {
310 313 return enqueue_discovered_ref_helper<narrowOop>(this, task_executor);
311 314 } else {
312 315 return enqueue_discovered_ref_helper<oop>(this, task_executor);
313 316 }
314 317 }
315 318
316 319 void ReferenceProcessor::enqueue_discovered_reflist(DiscoveredList& refs_list,
317 320 HeapWord* pending_list_addr) {
318 321 // Given a list of refs linked through the "discovered" field
319 322 // (java.lang.ref.Reference.discovered), self-loop their "next" field
320 323 // thus distinguishing them from active References, then
321 324 // prepend them to the pending list.
322 325 // BKWRD COMPATIBILITY NOTE: For older JDKs (prior to the fix for 4956777),
323 326 // the "next" field is used to chain the pending list, not the discovered
324 327 // field.
325 328
326 329 if (TraceReferenceGC && PrintGCDetails) {
327 330 gclog_or_tty->print_cr("ReferenceProcessor::enqueue_discovered_reflist list "
328 331 INTPTR_FORMAT, (address)refs_list.head());
329 332 }
330 333
331 334 oop obj = NULL;
332 335 oop next_d = refs_list.head();
333 336 if (pending_list_uses_discovered_field()) { // New behaviour
334 337 // Walk down the list, self-looping the next field
335 338 // so that the References are not considered active.
336 339 while (obj != next_d) {
337 340 obj = next_d;
338 341 assert(obj->is_instanceRef(), "should be reference object");
339 342 next_d = java_lang_ref_Reference::discovered(obj);
340 343 if (TraceReferenceGC && PrintGCDetails) {
341 344 gclog_or_tty->print_cr(" obj " INTPTR_FORMAT "/next_d " INTPTR_FORMAT,
342 345 obj, next_d);
343 346 }
344 347 assert(java_lang_ref_Reference::next(obj) == NULL,
345 348 "Reference not active; should not be discovered");
346 349 // Self-loop next, so as to make Ref not active.
347 350 java_lang_ref_Reference::set_next(obj, obj);
348 351 if (next_d == obj) { // obj is last
349 352 // Swap refs_list into pendling_list_addr and
350 353 // set obj's discovered to what we read from pending_list_addr.
351 354 oop old = oopDesc::atomic_exchange_oop(refs_list.head(), pending_list_addr);
352 355 // Need oop_check on pending_list_addr above;
353 356 // see special oop-check code at the end of
354 357 // enqueue_discovered_reflists() further below.
355 358 java_lang_ref_Reference::set_discovered(obj, old); // old may be NULL
356 359 }
357 360 }
358 361 } else { // Old behaviour
359 362 // Walk down the list, copying the discovered field into
360 363 // the next field and clearing the discovered field.
361 364 while (obj != next_d) {
362 365 obj = next_d;
363 366 assert(obj->is_instanceRef(), "should be reference object");
364 367 next_d = java_lang_ref_Reference::discovered(obj);
365 368 if (TraceReferenceGC && PrintGCDetails) {
366 369 gclog_or_tty->print_cr(" obj " INTPTR_FORMAT "/next_d " INTPTR_FORMAT,
367 370 obj, next_d);
368 371 }
369 372 assert(java_lang_ref_Reference::next(obj) == NULL,
370 373 "The reference should not be enqueued");
371 374 if (next_d == obj) { // obj is last
372 375 // Swap refs_list into pendling_list_addr and
373 376 // set obj's next to what we read from pending_list_addr.
374 377 oop old = oopDesc::atomic_exchange_oop(refs_list.head(), pending_list_addr);
375 378 // Need oop_check on pending_list_addr above;
376 379 // see special oop-check code at the end of
377 380 // enqueue_discovered_reflists() further below.
378 381 if (old == NULL) {
379 382 // obj should be made to point to itself, since
380 383 // pending list was empty.
381 384 java_lang_ref_Reference::set_next(obj, obj);
382 385 } else {
383 386 java_lang_ref_Reference::set_next(obj, old);
384 387 }
385 388 } else {
386 389 java_lang_ref_Reference::set_next(obj, next_d);
387 390 }
388 391 java_lang_ref_Reference::set_discovered(obj, (oop) NULL);
389 392 }
390 393 }
391 394 }
392 395
393 396 // Parallel enqueue task
394 397 class RefProcEnqueueTask: public AbstractRefProcTaskExecutor::EnqueueTask {
395 398 public:
396 399 RefProcEnqueueTask(ReferenceProcessor& ref_processor,
397 400 DiscoveredList discovered_refs[],
398 401 HeapWord* pending_list_addr,
399 402 int n_queues)
400 403 : EnqueueTask(ref_processor, discovered_refs,
401 404 pending_list_addr, n_queues)
402 405 { }
403 406
404 407 virtual void work(unsigned int work_id) {
405 408 assert(work_id < (unsigned int)_ref_processor.max_num_q(), "Index out-of-bounds");
406 409 // Simplest first cut: static partitioning.
407 410 int index = work_id;
408 411 // The increment on "index" must correspond to the maximum number of queues
409 412 // (n_queues) with which that ReferenceProcessor was created. That
410 413 // is because of the "clever" way the discovered references lists were
411 414 // allocated and are indexed into.
412 415 assert(_n_queues == (int) _ref_processor.max_num_q(), "Different number not expected");
413 416 for (int j = 0;
414 417 j < ReferenceProcessor::number_of_subclasses_of_ref();
415 418 j++, index += _n_queues) {
416 419 _ref_processor.enqueue_discovered_reflist(
417 420 _refs_lists[index], _pending_list_addr);
418 421 _refs_lists[index].set_head(NULL);
419 422 _refs_lists[index].set_length(0);
420 423 }
421 424 }
422 425 };
423 426
424 427 // Enqueue references that are not made active again
425 428 void ReferenceProcessor::enqueue_discovered_reflists(HeapWord* pending_list_addr,
426 429 AbstractRefProcTaskExecutor* task_executor) {
427 430 if (_processing_is_mt && task_executor != NULL) {
428 431 // Parallel code
429 432 RefProcEnqueueTask tsk(*this, _discovered_refs,
430 433 pending_list_addr, _max_num_q);
431 434 task_executor->execute(tsk);
432 435 } else {
433 436 // Serial code: call the parent class's implementation
434 437 for (int i = 0; i < _max_num_q * number_of_subclasses_of_ref(); i++) {
435 438 enqueue_discovered_reflist(_discovered_refs[i], pending_list_addr);
436 439 _discovered_refs[i].set_head(NULL);
437 440 _discovered_refs[i].set_length(0);
438 441 }
439 442 }
440 443 }
441 444
442 445 void DiscoveredListIterator::load_ptrs(DEBUG_ONLY(bool allow_null_referent)) {
443 446 _discovered_addr = java_lang_ref_Reference::discovered_addr(_ref);
444 447 oop discovered = java_lang_ref_Reference::discovered(_ref);
445 448 assert(_discovered_addr && discovered->is_oop_or_null(),
446 449 "discovered field is bad");
447 450 _next = discovered;
448 451 _referent_addr = java_lang_ref_Reference::referent_addr(_ref);
449 452 _referent = java_lang_ref_Reference::referent(_ref);
450 453 assert(Universe::heap()->is_in_reserved_or_null(_referent),
451 454 "Wrong oop found in java.lang.Reference object");
452 455 assert(allow_null_referent ?
453 456 _referent->is_oop_or_null()
454 457 : _referent->is_oop(),
455 458 "bad referent");
456 459 }
457 460
458 461 void DiscoveredListIterator::remove() {
459 462 assert(_ref->is_oop(), "Dropping a bad reference");
460 463 oop_store_raw(_discovered_addr, NULL);
461 464
462 465 // First _prev_next ref actually points into DiscoveredList (gross).
463 466 oop new_next;
464 467 if (_next == _ref) {
465 468 // At the end of the list, we should make _prev point to itself.
466 469 // If _ref is the first ref, then _prev_next will be in the DiscoveredList,
467 470 // and _prev will be NULL.
468 471 new_next = _prev;
469 472 } else {
470 473 new_next = _next;
471 474 }
472 475
473 476 if (UseCompressedOops) {
474 477 // Remove Reference object from list.
475 478 oopDesc::encode_store_heap_oop((narrowOop*)_prev_next, new_next);
476 479 } else {
477 480 // Remove Reference object from list.
478 481 oopDesc::store_heap_oop((oop*)_prev_next, new_next);
479 482 }
480 483 NOT_PRODUCT(_removed++);
481 484 _refs_list.dec_length(1);
482 485 }
483 486
484 487 // Make the Reference object active again.
485 488 void DiscoveredListIterator::make_active() {
486 489 // For G1 we don't want to use set_next - it
487 490 // will dirty the card for the next field of
488 491 // the reference object and will fail
489 492 // CT verification.
490 493 if (UseG1GC) {
491 494 BarrierSet* bs = oopDesc::bs();
492 495 HeapWord* next_addr = java_lang_ref_Reference::next_addr(_ref);
493 496
494 497 if (UseCompressedOops) {
495 498 bs->write_ref_field_pre((narrowOop*)next_addr, NULL);
496 499 } else {
497 500 bs->write_ref_field_pre((oop*)next_addr, NULL);
498 501 }
499 502 java_lang_ref_Reference::set_next_raw(_ref, NULL);
500 503 } else {
501 504 java_lang_ref_Reference::set_next(_ref, NULL);
502 505 }
503 506 }
504 507
505 508 void DiscoveredListIterator::clear_referent() {
506 509 oop_store_raw(_referent_addr, NULL);
507 510 }
508 511
509 512 // NOTE: process_phase*() are largely similar, and at a high level
510 513 // merely iterate over the extant list applying a predicate to
511 514 // each of its elements and possibly removing that element from the
512 515 // list and applying some further closures to that element.
513 516 // We should consider the possibility of replacing these
514 517 // process_phase*() methods by abstracting them into
515 518 // a single general iterator invocation that receives appropriate
516 519 // closures that accomplish this work.
517 520
518 521 // (SoftReferences only) Traverse the list and remove any SoftReferences whose
519 522 // referents are not alive, but that should be kept alive for policy reasons.
520 523 // Keep alive the transitive closure of all such referents.
521 524 void
522 525 ReferenceProcessor::process_phase1(DiscoveredList& refs_list,
523 526 ReferencePolicy* policy,
524 527 BoolObjectClosure* is_alive,
525 528 OopClosure* keep_alive,
526 529 VoidClosure* complete_gc) {
527 530 assert(policy != NULL, "Must have a non-NULL policy");
528 531 DiscoveredListIterator iter(refs_list, keep_alive, is_alive);
529 532 // Decide which softly reachable refs should be kept alive.
530 533 while (iter.has_next()) {
531 534 iter.load_ptrs(DEBUG_ONLY(!discovery_is_atomic() /* allow_null_referent */));
532 535 bool referent_is_dead = (iter.referent() != NULL) && !iter.is_referent_alive();
533 536 if (referent_is_dead &&
534 537 !policy->should_clear_reference(iter.obj(), _soft_ref_timestamp_clock)) {
535 538 if (TraceReferenceGC) {
536 539 gclog_or_tty->print_cr("Dropping reference (" INTPTR_FORMAT ": %s" ") by policy",
537 540 iter.obj(), iter.obj()->blueprint()->internal_name());
538 541 }
539 542 // Remove Reference object from list
540 543 iter.remove();
541 544 // Make the Reference object active again
542 545 iter.make_active();
543 546 // keep the referent around
544 547 iter.make_referent_alive();
545 548 iter.move_to_next();
546 549 } else {
547 550 iter.next();
548 551 }
549 552 }
550 553 // Close the reachable set
551 554 complete_gc->do_void();
552 555 NOT_PRODUCT(
553 556 if (PrintGCDetails && TraceReferenceGC) {
554 557 gclog_or_tty->print_cr(" Dropped %d dead Refs out of %d "
555 558 "discovered Refs by policy, from list " INTPTR_FORMAT,
556 559 iter.removed(), iter.processed(), (address)refs_list.head());
557 560 }
558 561 )
559 562 }
560 563
561 564 // Traverse the list and remove any Refs that are not active, or
562 565 // whose referents are either alive or NULL.
563 566 void
564 567 ReferenceProcessor::pp2_work(DiscoveredList& refs_list,
565 568 BoolObjectClosure* is_alive,
566 569 OopClosure* keep_alive) {
567 570 assert(discovery_is_atomic(), "Error");
568 571 DiscoveredListIterator iter(refs_list, keep_alive, is_alive);
569 572 while (iter.has_next()) {
570 573 iter.load_ptrs(DEBUG_ONLY(false /* allow_null_referent */));
571 574 DEBUG_ONLY(oop next = java_lang_ref_Reference::next(iter.obj());)
572 575 assert(next == NULL, "Should not discover inactive Reference");
573 576 if (iter.is_referent_alive()) {
574 577 if (TraceReferenceGC) {
575 578 gclog_or_tty->print_cr("Dropping strongly reachable reference (" INTPTR_FORMAT ": %s)",
576 579 iter.obj(), iter.obj()->blueprint()->internal_name());
577 580 }
578 581 // The referent is reachable after all.
579 582 // Remove Reference object from list.
580 583 iter.remove();
581 584 // Update the referent pointer as necessary: Note that this
582 585 // should not entail any recursive marking because the
583 586 // referent must already have been traversed.
584 587 iter.make_referent_alive();
585 588 iter.move_to_next();
586 589 } else {
587 590 iter.next();
588 591 }
589 592 }
590 593 NOT_PRODUCT(
591 594 if (PrintGCDetails && TraceReferenceGC && (iter.processed() > 0)) {
592 595 gclog_or_tty->print_cr(" Dropped %d active Refs out of %d "
593 596 "Refs in discovered list " INTPTR_FORMAT,
594 597 iter.removed(), iter.processed(), (address)refs_list.head());
595 598 }
596 599 )
597 600 }
598 601
599 602 void
600 603 ReferenceProcessor::pp2_work_concurrent_discovery(DiscoveredList& refs_list,
601 604 BoolObjectClosure* is_alive,
602 605 OopClosure* keep_alive,
603 606 VoidClosure* complete_gc) {
604 607 assert(!discovery_is_atomic(), "Error");
605 608 DiscoveredListIterator iter(refs_list, keep_alive, is_alive);
606 609 while (iter.has_next()) {
607 610 iter.load_ptrs(DEBUG_ONLY(true /* allow_null_referent */));
608 611 HeapWord* next_addr = java_lang_ref_Reference::next_addr(iter.obj());
609 612 oop next = java_lang_ref_Reference::next(iter.obj());
610 613 if ((iter.referent() == NULL || iter.is_referent_alive() ||
611 614 next != NULL)) {
612 615 assert(next->is_oop_or_null(), "bad next field");
613 616 // Remove Reference object from list
614 617 iter.remove();
615 618 // Trace the cohorts
616 619 iter.make_referent_alive();
617 620 if (UseCompressedOops) {
618 621 keep_alive->do_oop((narrowOop*)next_addr);
619 622 } else {
620 623 keep_alive->do_oop((oop*)next_addr);
621 624 }
622 625 iter.move_to_next();
623 626 } else {
624 627 iter.next();
625 628 }
626 629 }
627 630 // Now close the newly reachable set
628 631 complete_gc->do_void();
629 632 NOT_PRODUCT(
630 633 if (PrintGCDetails && TraceReferenceGC && (iter.processed() > 0)) {
631 634 gclog_or_tty->print_cr(" Dropped %d active Refs out of %d "
632 635 "Refs in discovered list " INTPTR_FORMAT,
633 636 iter.removed(), iter.processed(), (address)refs_list.head());
634 637 }
635 638 )
636 639 }
637 640
638 641 // Traverse the list and process the referents, by either
639 642 // clearing them or keeping them (and their reachable
640 643 // closure) alive.
641 644 void
642 645 ReferenceProcessor::process_phase3(DiscoveredList& refs_list,
643 646 bool clear_referent,
644 647 BoolObjectClosure* is_alive,
645 648 OopClosure* keep_alive,
646 649 VoidClosure* complete_gc) {
647 650 ResourceMark rm;
648 651 DiscoveredListIterator iter(refs_list, keep_alive, is_alive);
649 652 while (iter.has_next()) {
650 653 iter.update_discovered();
651 654 iter.load_ptrs(DEBUG_ONLY(false /* allow_null_referent */));
652 655 if (clear_referent) {
653 656 // NULL out referent pointer
654 657 iter.clear_referent();
655 658 } else {
656 659 // keep the referent around
657 660 iter.make_referent_alive();
658 661 }
659 662 if (TraceReferenceGC) {
660 663 gclog_or_tty->print_cr("Adding %sreference (" INTPTR_FORMAT ": %s) as pending",
661 664 clear_referent ? "cleared " : "",
662 665 iter.obj(), iter.obj()->blueprint()->internal_name());
663 666 }
664 667 assert(iter.obj()->is_oop(UseConcMarkSweepGC), "Adding a bad reference");
665 668 iter.next();
666 669 }
667 670 // Remember to update the next pointer of the last ref.
668 671 iter.update_discovered();
669 672 // Close the reachable set
670 673 complete_gc->do_void();
671 674 }
672 675
673 676 void
674 677 ReferenceProcessor::clear_discovered_references(DiscoveredList& refs_list) {
675 678 oop obj = NULL;
676 679 oop next = refs_list.head();
677 680 while (next != obj) {
678 681 obj = next;
679 682 next = java_lang_ref_Reference::discovered(obj);
680 683 java_lang_ref_Reference::set_discovered_raw(obj, NULL);
681 684 }
682 685 refs_list.set_head(NULL);
683 686 refs_list.set_length(0);
684 687 }
685 688
686 689 void
687 690 ReferenceProcessor::abandon_partial_discovered_list(DiscoveredList& refs_list) {
688 691 clear_discovered_references(refs_list);
689 692 }
690 693
691 694 void ReferenceProcessor::abandon_partial_discovery() {
692 695 // loop over the lists
693 696 for (int i = 0; i < _max_num_q * number_of_subclasses_of_ref(); i++) {
694 697 if (TraceReferenceGC && PrintGCDetails && ((i % _max_num_q) == 0)) {
695 698 gclog_or_tty->print_cr("\nAbandoning %s discovered list", list_name(i));
696 699 }
697 700 abandon_partial_discovered_list(_discovered_refs[i]);
698 701 }
699 702 }
700 703
701 704 class RefProcPhase1Task: public AbstractRefProcTaskExecutor::ProcessTask {
702 705 public:
703 706 RefProcPhase1Task(ReferenceProcessor& ref_processor,
704 707 DiscoveredList refs_lists[],
705 708 ReferencePolicy* policy,
706 709 bool marks_oops_alive)
707 710 : ProcessTask(ref_processor, refs_lists, marks_oops_alive),
708 711 _policy(policy)
709 712 { }
710 713 virtual void work(unsigned int i, BoolObjectClosure& is_alive,
711 714 OopClosure& keep_alive,
712 715 VoidClosure& complete_gc)
713 716 {
714 717 Thread* thr = Thread::current();
715 718 int refs_list_index = ((WorkerThread*)thr)->id();
716 719 _ref_processor.process_phase1(_refs_lists[refs_list_index], _policy,
717 720 &is_alive, &keep_alive, &complete_gc);
718 721 }
719 722 private:
720 723 ReferencePolicy* _policy;
721 724 };
722 725
723 726 class RefProcPhase2Task: public AbstractRefProcTaskExecutor::ProcessTask {
724 727 public:
725 728 RefProcPhase2Task(ReferenceProcessor& ref_processor,
726 729 DiscoveredList refs_lists[],
727 730 bool marks_oops_alive)
728 731 : ProcessTask(ref_processor, refs_lists, marks_oops_alive)
729 732 { }
730 733 virtual void work(unsigned int i, BoolObjectClosure& is_alive,
731 734 OopClosure& keep_alive,
732 735 VoidClosure& complete_gc)
733 736 {
734 737 _ref_processor.process_phase2(_refs_lists[i],
735 738 &is_alive, &keep_alive, &complete_gc);
736 739 }
737 740 };
738 741
739 742 class RefProcPhase3Task: public AbstractRefProcTaskExecutor::ProcessTask {
740 743 public:
741 744 RefProcPhase3Task(ReferenceProcessor& ref_processor,
742 745 DiscoveredList refs_lists[],
743 746 bool clear_referent,
744 747 bool marks_oops_alive)
745 748 : ProcessTask(ref_processor, refs_lists, marks_oops_alive),
746 749 _clear_referent(clear_referent)
747 750 { }
748 751 virtual void work(unsigned int i, BoolObjectClosure& is_alive,
749 752 OopClosure& keep_alive,
750 753 VoidClosure& complete_gc)
751 754 {
752 755 // Don't use "refs_list_index" calculated in this way because
753 756 // balance_queues() has moved the Ref's into the first n queues.
754 757 // Thread* thr = Thread::current();
755 758 // int refs_list_index = ((WorkerThread*)thr)->id();
756 759 // _ref_processor.process_phase3(_refs_lists[refs_list_index], _clear_referent,
757 760 _ref_processor.process_phase3(_refs_lists[i], _clear_referent,
758 761 &is_alive, &keep_alive, &complete_gc);
759 762 }
760 763 private:
761 764 bool _clear_referent;
762 765 };
763 766
764 767 void ReferenceProcessor::set_discovered(oop ref, oop value) {
765 768 if (_discovered_list_needs_barrier) {
766 769 java_lang_ref_Reference::set_discovered(ref, value);
767 770 } else {
768 771 java_lang_ref_Reference::set_discovered_raw(ref, value);
769 772 }
770 773 }
771 774
772 775 // Balances reference queues.
773 776 // Move entries from all queues[0, 1, ..., _max_num_q-1] to
774 777 // queues[0, 1, ..., _num_q-1] because only the first _num_q
775 778 // corresponding to the active workers will be processed.
776 779 void ReferenceProcessor::balance_queues(DiscoveredList ref_lists[])
777 780 {
778 781 // calculate total length
779 782 size_t total_refs = 0;
780 783 if (TraceReferenceGC && PrintGCDetails) {
781 784 gclog_or_tty->print_cr("\nBalance ref_lists ");
782 785 }
783 786
784 787 for (int i = 0; i < _max_num_q; ++i) {
785 788 total_refs += ref_lists[i].length();
786 789 if (TraceReferenceGC && PrintGCDetails) {
787 790 gclog_or_tty->print("%d ", ref_lists[i].length());
788 791 }
789 792 }
790 793 if (TraceReferenceGC && PrintGCDetails) {
791 794 gclog_or_tty->print_cr(" = %d", total_refs);
792 795 }
793 796 size_t avg_refs = total_refs / _num_q + 1;
794 797 int to_idx = 0;
795 798 for (int from_idx = 0; from_idx < _max_num_q; from_idx++) {
796 799 bool move_all = false;
797 800 if (from_idx >= _num_q) {
798 801 move_all = ref_lists[from_idx].length() > 0;
799 802 }
800 803 while ((ref_lists[from_idx].length() > avg_refs) ||
801 804 move_all) {
802 805 assert(to_idx < _num_q, "Sanity Check!");
803 806 if (ref_lists[to_idx].length() < avg_refs) {
804 807 // move superfluous refs
805 808 size_t refs_to_move;
806 809 // Move all the Ref's if the from queue will not be processed.
807 810 if (move_all) {
808 811 refs_to_move = MIN2(ref_lists[from_idx].length(),
809 812 avg_refs - ref_lists[to_idx].length());
810 813 } else {
811 814 refs_to_move = MIN2(ref_lists[from_idx].length() - avg_refs,
812 815 avg_refs - ref_lists[to_idx].length());
813 816 }
814 817
815 818 assert(refs_to_move > 0, "otherwise the code below will fail");
816 819
817 820 oop move_head = ref_lists[from_idx].head();
818 821 oop move_tail = move_head;
819 822 oop new_head = move_head;
820 823 // find an element to split the list on
821 824 for (size_t j = 0; j < refs_to_move; ++j) {
822 825 move_tail = new_head;
823 826 new_head = java_lang_ref_Reference::discovered(new_head);
824 827 }
825 828
826 829 // Add the chain to the to list.
827 830 if (ref_lists[to_idx].head() == NULL) {
828 831 // to list is empty. Make a loop at the end.
829 832 set_discovered(move_tail, move_tail);
830 833 } else {
831 834 set_discovered(move_tail, ref_lists[to_idx].head());
832 835 }
833 836 ref_lists[to_idx].set_head(move_head);
834 837 ref_lists[to_idx].inc_length(refs_to_move);
835 838
836 839 // Remove the chain from the from list.
837 840 if (move_tail == new_head) {
838 841 // We found the end of the from list.
839 842 ref_lists[from_idx].set_head(NULL);
840 843 } else {
841 844 ref_lists[from_idx].set_head(new_head);
842 845 }
843 846 ref_lists[from_idx].dec_length(refs_to_move);
844 847 if (ref_lists[from_idx].length() == 0) {
845 848 break;
846 849 }
847 850 } else {
848 851 to_idx = (to_idx + 1) % _num_q;
849 852 }
850 853 }
851 854 }
852 855 #ifdef ASSERT
853 856 size_t balanced_total_refs = 0;
854 857 for (int i = 0; i < _max_num_q; ++i) {
855 858 balanced_total_refs += ref_lists[i].length();
856 859 if (TraceReferenceGC && PrintGCDetails) {
857 860 gclog_or_tty->print("%d ", ref_lists[i].length());
858 861 }
859 862 }
860 863 if (TraceReferenceGC && PrintGCDetails) {
861 864 gclog_or_tty->print_cr(" = %d", balanced_total_refs);
862 865 gclog_or_tty->flush();
863 866 }
864 867 assert(total_refs == balanced_total_refs, "Balancing was incomplete");
865 868 #endif
866 869 }
867 870
868 871 void ReferenceProcessor::balance_all_queues() {
869 872 balance_queues(_discoveredSoftRefs);
870 873 balance_queues(_discoveredWeakRefs);
871 874 balance_queues(_discoveredFinalRefs);
872 875 balance_queues(_discoveredPhantomRefs);
873 876 }
874 877
875 878 void
876 879 ReferenceProcessor::process_discovered_reflist(
877 880 DiscoveredList refs_lists[],
878 881 ReferencePolicy* policy,
879 882 bool clear_referent,
880 883 BoolObjectClosure* is_alive,
881 884 OopClosure* keep_alive,
882 885 VoidClosure* complete_gc,
883 886 AbstractRefProcTaskExecutor* task_executor)
884 887 {
885 888 bool mt_processing = task_executor != NULL && _processing_is_mt;
886 889 // If discovery used MT and a dynamic number of GC threads, then
887 890 // the queues must be balanced for correctness if fewer than the
888 891 // maximum number of queues were used. The number of queue used
889 892 // during discovery may be different than the number to be used
890 893 // for processing so don't depend of _num_q < _max_num_q as part
891 894 // of the test.
892 895 bool must_balance = _discovery_is_mt;
893 896
894 897 if ((mt_processing && ParallelRefProcBalancingEnabled) ||
895 898 must_balance) {
896 899 balance_queues(refs_lists);
897 900 }
898 901 if (PrintReferenceGC && PrintGCDetails) {
899 902 size_t total = 0;
900 903 for (int i = 0; i < _max_num_q; ++i) {
901 904 total += refs_lists[i].length();
902 905 }
903 906 gclog_or_tty->print(", %u refs", total);
904 907 }
905 908
906 909 // Phase 1 (soft refs only):
907 910 // . Traverse the list and remove any SoftReferences whose
908 911 // referents are not alive, but that should be kept alive for
909 912 // policy reasons. Keep alive the transitive closure of all
910 913 // such referents.
911 914 if (policy != NULL) {
912 915 if (mt_processing) {
913 916 RefProcPhase1Task phase1(*this, refs_lists, policy, true /*marks_oops_alive*/);
914 917 task_executor->execute(phase1);
915 918 } else {
916 919 for (int i = 0; i < _max_num_q; i++) {
917 920 process_phase1(refs_lists[i], policy,
918 921 is_alive, keep_alive, complete_gc);
919 922 }
920 923 }
921 924 } else { // policy == NULL
922 925 assert(refs_lists != _discoveredSoftRefs,
923 926 "Policy must be specified for soft references.");
924 927 }
925 928
926 929 // Phase 2:
927 930 // . Traverse the list and remove any refs whose referents are alive.
928 931 if (mt_processing) {
929 932 RefProcPhase2Task phase2(*this, refs_lists, !discovery_is_atomic() /*marks_oops_alive*/);
930 933 task_executor->execute(phase2);
931 934 } else {
932 935 for (int i = 0; i < _max_num_q; i++) {
933 936 process_phase2(refs_lists[i], is_alive, keep_alive, complete_gc);
934 937 }
935 938 }
936 939
937 940 // Phase 3:
938 941 // . Traverse the list and process referents as appropriate.
939 942 if (mt_processing) {
940 943 RefProcPhase3Task phase3(*this, refs_lists, clear_referent, true /*marks_oops_alive*/);
941 944 task_executor->execute(phase3);
942 945 } else {
943 946 for (int i = 0; i < _max_num_q; i++) {
944 947 process_phase3(refs_lists[i], clear_referent,
945 948 is_alive, keep_alive, complete_gc);
946 949 }
947 950 }
948 951 }
949 952
950 953 void ReferenceProcessor::clean_up_discovered_references() {
951 954 // loop over the lists
952 955 for (int i = 0; i < _max_num_q * number_of_subclasses_of_ref(); i++) {
953 956 if (TraceReferenceGC && PrintGCDetails && ((i % _max_num_q) == 0)) {
954 957 gclog_or_tty->print_cr(
955 958 "\nScrubbing %s discovered list of Null referents",
956 959 list_name(i));
957 960 }
958 961 clean_up_discovered_reflist(_discovered_refs[i]);
959 962 }
960 963 }
961 964
962 965 void ReferenceProcessor::clean_up_discovered_reflist(DiscoveredList& refs_list) {
963 966 assert(!discovery_is_atomic(), "Else why call this method?");
964 967 DiscoveredListIterator iter(refs_list, NULL, NULL);
965 968 while (iter.has_next()) {
966 969 iter.load_ptrs(DEBUG_ONLY(true /* allow_null_referent */));
967 970 oop next = java_lang_ref_Reference::next(iter.obj());
968 971 assert(next->is_oop_or_null(), "bad next field");
969 972 // If referent has been cleared or Reference is not active,
970 973 // drop it.
971 974 if (iter.referent() == NULL || next != NULL) {
972 975 debug_only(
973 976 if (PrintGCDetails && TraceReferenceGC) {
974 977 gclog_or_tty->print_cr("clean_up_discovered_list: Dropping Reference: "
975 978 INTPTR_FORMAT " with next field: " INTPTR_FORMAT
976 979 " and referent: " INTPTR_FORMAT,
977 980 iter.obj(), next, iter.referent());
978 981 }
979 982 )
980 983 // Remove Reference object from list
981 984 iter.remove();
982 985 iter.move_to_next();
983 986 } else {
984 987 iter.next();
985 988 }
986 989 }
987 990 NOT_PRODUCT(
988 991 if (PrintGCDetails && TraceReferenceGC) {
989 992 gclog_or_tty->print(
990 993 " Removed %d Refs with NULL referents out of %d discovered Refs",
991 994 iter.removed(), iter.processed());
992 995 }
993 996 )
994 997 }
995 998
996 999 inline DiscoveredList* ReferenceProcessor::get_discovered_list(ReferenceType rt) {
997 1000 int id = 0;
998 1001 // Determine the queue index to use for this object.
999 1002 if (_discovery_is_mt) {
1000 1003 // During a multi-threaded discovery phase,
1001 1004 // each thread saves to its "own" list.
1002 1005 Thread* thr = Thread::current();
1003 1006 id = thr->as_Worker_thread()->id();
1004 1007 } else {
1005 1008 // single-threaded discovery, we save in round-robin
1006 1009 // fashion to each of the lists.
1007 1010 if (_processing_is_mt) {
1008 1011 id = next_id();
1009 1012 }
1010 1013 }
1011 1014 assert(0 <= id && id < _max_num_q, "Id is out-of-bounds (call Freud?)");
1012 1015
1013 1016 // Get the discovered queue to which we will add
1014 1017 DiscoveredList* list = NULL;
1015 1018 switch (rt) {
1016 1019 case REF_OTHER:
1017 1020 // Unknown reference type, no special treatment
1018 1021 break;
1019 1022 case REF_SOFT:
1020 1023 list = &_discoveredSoftRefs[id];
1021 1024 break;
1022 1025 case REF_WEAK:
1023 1026 list = &_discoveredWeakRefs[id];
1024 1027 break;
1025 1028 case REF_FINAL:
1026 1029 list = &_discoveredFinalRefs[id];
1027 1030 break;
1028 1031 case REF_PHANTOM:
1029 1032 list = &_discoveredPhantomRefs[id];
1030 1033 break;
1031 1034 case REF_NONE:
1032 1035 // we should not reach here if we are an instanceRefKlass
1033 1036 default:
1034 1037 ShouldNotReachHere();
1035 1038 }
1036 1039 if (TraceReferenceGC && PrintGCDetails) {
1037 1040 gclog_or_tty->print_cr("Thread %d gets list " INTPTR_FORMAT, id, list);
1038 1041 }
1039 1042 return list;
1040 1043 }
1041 1044
1042 1045 inline void
1043 1046 ReferenceProcessor::add_to_discovered_list_mt(DiscoveredList& refs_list,
1044 1047 oop obj,
1045 1048 HeapWord* discovered_addr) {
1046 1049 assert(_discovery_is_mt, "!_discovery_is_mt should have been handled by caller");
1047 1050 // First we must make sure this object is only enqueued once. CAS in a non null
1048 1051 // discovered_addr.
1049 1052 oop current_head = refs_list.head();
1050 1053 // The last ref must have its discovered field pointing to itself.
1051 1054 oop next_discovered = (current_head != NULL) ? current_head : obj;
1052 1055
1053 1056 // Note: In the case of G1, this specific pre-barrier is strictly
1054 1057 // not necessary because the only case we are interested in
1055 1058 // here is when *discovered_addr is NULL (see the CAS further below),
1056 1059 // so this will expand to nothing. As a result, we have manually
1057 1060 // elided this out for G1, but left in the test for some future
1058 1061 // collector that might have need for a pre-barrier here, e.g.:-
1059 1062 // _bs->write_ref_field_pre((oop* or narrowOop*)discovered_addr, next_discovered);
1060 1063 assert(!_discovered_list_needs_barrier || UseG1GC,
1061 1064 "Need to check non-G1 collector: "
1062 1065 "may need a pre-write-barrier for CAS from NULL below");
1063 1066 oop retest = oopDesc::atomic_compare_exchange_oop(next_discovered, discovered_addr,
1064 1067 NULL);
1065 1068 if (retest == NULL) {
1066 1069 // This thread just won the right to enqueue the object.
1067 1070 // We have separate lists for enqueueing, so no synchronization
1068 1071 // is necessary.
1069 1072 refs_list.set_head(obj);
1070 1073 refs_list.inc_length(1);
1071 1074 if (_discovered_list_needs_barrier) {
1072 1075 _bs->write_ref_field((void*)discovered_addr, next_discovered);
1073 1076 }
1074 1077
1075 1078 if (TraceReferenceGC) {
1076 1079 gclog_or_tty->print_cr("Discovered reference (mt) (" INTPTR_FORMAT ": %s)",
1077 1080 obj, obj->blueprint()->internal_name());
1078 1081 }
1079 1082 } else {
1080 1083 // If retest was non NULL, another thread beat us to it:
1081 1084 // The reference has already been discovered...
1082 1085 if (TraceReferenceGC) {
1083 1086 gclog_or_tty->print_cr("Already discovered reference (" INTPTR_FORMAT ": %s)",
1084 1087 obj, obj->blueprint()->internal_name());
1085 1088 }
1086 1089 }
1087 1090 }
1088 1091
1089 1092 #ifndef PRODUCT
1090 1093 // Non-atomic (i.e. concurrent) discovery might allow us
1091 1094 // to observe j.l.References with NULL referents, being those
1092 1095 // cleared concurrently by mutators during (or after) discovery.
1093 1096 void ReferenceProcessor::verify_referent(oop obj) {
1094 1097 bool da = discovery_is_atomic();
1095 1098 oop referent = java_lang_ref_Reference::referent(obj);
1096 1099 assert(da ? referent->is_oop() : referent->is_oop_or_null(),
1097 1100 err_msg("Bad referent " INTPTR_FORMAT " found in Reference "
1098 1101 INTPTR_FORMAT " during %satomic discovery ",
1099 1102 (intptr_t)referent, (intptr_t)obj, da ? "" : "non-"));
1100 1103 }
1101 1104 #endif
1102 1105
1103 1106 // We mention two of several possible choices here:
1104 1107 // #0: if the reference object is not in the "originating generation"
1105 1108 // (or part of the heap being collected, indicated by our "span"
1106 1109 // we don't treat it specially (i.e. we scan it as we would
1107 1110 // a normal oop, treating its references as strong references).
1108 1111 // This means that references can't be discovered unless their
1109 1112 // referent is also in the same span. This is the simplest,
1110 1113 // most "local" and most conservative approach, albeit one
1111 1114 // that may cause weak references to be enqueued least promptly.
1112 1115 // We call this choice the "ReferenceBasedDiscovery" policy.
1113 1116 // #1: the reference object may be in any generation (span), but if
1114 1117 // the referent is in the generation (span) being currently collected
1115 1118 // then we can discover the reference object, provided
1116 1119 // the object has not already been discovered by
1117 1120 // a different concurrently running collector (as may be the
1118 1121 // case, for instance, if the reference object is in CMS and
1119 1122 // the referent in DefNewGeneration), and provided the processing
1120 1123 // of this reference object by the current collector will
1121 1124 // appear atomic to every other collector in the system.
1122 1125 // (Thus, for instance, a concurrent collector may not
1123 1126 // discover references in other generations even if the
1124 1127 // referent is in its own generation). This policy may,
1125 1128 // in certain cases, enqueue references somewhat sooner than
1126 1129 // might Policy #0 above, but at marginally increased cost
1127 1130 // and complexity in processing these references.
1128 1131 // We call this choice the "RefeferentBasedDiscovery" policy.
1129 1132 bool ReferenceProcessor::discover_reference(oop obj, ReferenceType rt) {
1130 1133 // Make sure we are discovering refs (rather than processing discovered refs).
1131 1134 if (!_discovering_refs || !RegisterReferences) {
1132 1135 return false;
1133 1136 }
1134 1137 // We only discover active references.
1135 1138 oop next = java_lang_ref_Reference::next(obj);
1136 1139 if (next != NULL) { // Ref is no longer active
1137 1140 return false;
1138 1141 }
1139 1142
1140 1143 HeapWord* obj_addr = (HeapWord*)obj;
1141 1144 if (RefDiscoveryPolicy == ReferenceBasedDiscovery &&
1142 1145 !_span.contains(obj_addr)) {
1143 1146 // Reference is not in the originating generation;
1144 1147 // don't treat it specially (i.e. we want to scan it as a normal
1145 1148 // object with strong references).
1146 1149 return false;
1147 1150 }
1148 1151
1149 1152 // We only discover references whose referents are not (yet)
1150 1153 // known to be strongly reachable.
1151 1154 if (is_alive_non_header() != NULL) {
1152 1155 verify_referent(obj);
1153 1156 if (is_alive_non_header()->do_object_b(java_lang_ref_Reference::referent(obj))) {
1154 1157 return false; // referent is reachable
1155 1158 }
1156 1159 }
1157 1160 if (rt == REF_SOFT) {
1158 1161 // For soft refs we can decide now if these are not
1159 1162 // current candidates for clearing, in which case we
1160 1163 // can mark through them now, rather than delaying that
1161 1164 // to the reference-processing phase. Since all current
1162 1165 // time-stamp policies advance the soft-ref clock only
1163 1166 // at a major collection cycle, this is always currently
1164 1167 // accurate.
1165 1168 if (!_current_soft_ref_policy->should_clear_reference(obj, _soft_ref_timestamp_clock)) {
1166 1169 return false;
1167 1170 }
1168 1171 }
1169 1172
1170 1173 ResourceMark rm; // Needed for tracing.
1171 1174
1172 1175 HeapWord* const discovered_addr = java_lang_ref_Reference::discovered_addr(obj);
1173 1176 const oop discovered = java_lang_ref_Reference::discovered(obj);
1174 1177 assert(discovered->is_oop_or_null(), "bad discovered field");
1175 1178 if (discovered != NULL) {
1176 1179 // The reference has already been discovered...
1177 1180 if (TraceReferenceGC) {
1178 1181 gclog_or_tty->print_cr("Already discovered reference (" INTPTR_FORMAT ": %s)",
1179 1182 obj, obj->blueprint()->internal_name());
1180 1183 }
1181 1184 if (RefDiscoveryPolicy == ReferentBasedDiscovery) {
1182 1185 // assumes that an object is not processed twice;
1183 1186 // if it's been already discovered it must be on another
1184 1187 // generation's discovered list; so we won't discover it.
1185 1188 return false;
1186 1189 } else {
1187 1190 assert(RefDiscoveryPolicy == ReferenceBasedDiscovery,
1188 1191 "Unrecognized policy");
1189 1192 // Check assumption that an object is not potentially
1190 1193 // discovered twice except by concurrent collectors that potentially
1191 1194 // trace the same Reference object twice.
1192 1195 assert(UseConcMarkSweepGC || UseG1GC,
1193 1196 "Only possible with a concurrent marking collector");
1194 1197 return true;
1195 1198 }
1196 1199 }
1197 1200
1198 1201 if (RefDiscoveryPolicy == ReferentBasedDiscovery) {
1199 1202 verify_referent(obj);
1200 1203 // Discover if and only if EITHER:
1201 1204 // .. reference is in our span, OR
1202 1205 // .. we are an atomic collector and referent is in our span
1203 1206 if (_span.contains(obj_addr) ||
1204 1207 (discovery_is_atomic() &&
1205 1208 _span.contains(java_lang_ref_Reference::referent(obj)))) {
1206 1209 // should_enqueue = true;
1207 1210 } else {
1208 1211 return false;
1209 1212 }
1210 1213 } else {
1211 1214 assert(RefDiscoveryPolicy == ReferenceBasedDiscovery &&
1212 1215 _span.contains(obj_addr), "code inconsistency");
1213 1216 }
1214 1217
1215 1218 // Get the right type of discovered queue head.
1216 1219 DiscoveredList* list = get_discovered_list(rt);
1217 1220 if (list == NULL) {
1218 1221 return false; // nothing special needs to be done
1219 1222 }
1220 1223
1221 1224 if (_discovery_is_mt) {
1222 1225 add_to_discovered_list_mt(*list, obj, discovered_addr);
1223 1226 } else {
1224 1227 // If "_discovered_list_needs_barrier", we do write barriers when
1225 1228 // updating the discovered reference list. Otherwise, we do a raw store
1226 1229 // here: the field will be visited later when processing the discovered
1227 1230 // references.
1228 1231 oop current_head = list->head();
1229 1232 // The last ref must have its discovered field pointing to itself.
1230 1233 oop next_discovered = (current_head != NULL) ? current_head : obj;
1231 1234
1232 1235 // As in the case further above, since we are over-writing a NULL
1233 1236 // pre-value, we can safely elide the pre-barrier here for the case of G1.
1234 1237 // e.g.:- _bs->write_ref_field_pre((oop* or narrowOop*)discovered_addr, next_discovered);
1235 1238 assert(discovered == NULL, "control point invariant");
1236 1239 assert(!_discovered_list_needs_barrier || UseG1GC,
1237 1240 "For non-G1 collector, may need a pre-write-barrier for CAS from NULL below");
1238 1241 oop_store_raw(discovered_addr, next_discovered);
1239 1242 if (_discovered_list_needs_barrier) {
1240 1243 _bs->write_ref_field((void*)discovered_addr, next_discovered);
1241 1244 }
1242 1245 list->set_head(obj);
1243 1246 list->inc_length(1);
1244 1247
1245 1248 if (TraceReferenceGC) {
1246 1249 gclog_or_tty->print_cr("Discovered reference (" INTPTR_FORMAT ": %s)",
1247 1250 obj, obj->blueprint()->internal_name());
1248 1251 }
1249 1252 }
1250 1253 assert(obj->is_oop(), "Discovered a bad reference");
1251 1254 verify_referent(obj);
1252 1255 return true;
1253 1256 }
1254 1257
1255 1258 // Preclean the discovered references by removing those
1256 1259 // whose referents are alive, and by marking from those that
1257 1260 // are not active. These lists can be handled here
1258 1261 // in any order and, indeed, concurrently.
1259 1262 void ReferenceProcessor::preclean_discovered_references(
1260 1263 BoolObjectClosure* is_alive,
1261 1264 OopClosure* keep_alive,
1262 1265 VoidClosure* complete_gc,
1263 1266 YieldClosure* yield,
1264 1267 bool should_unload_classes) {
1265 1268
1266 1269 NOT_PRODUCT(verify_ok_to_handle_reflists());
1267 1270
1268 1271 #ifdef ASSERT
1269 1272 bool must_remember_klasses = ClassUnloading && !UseConcMarkSweepGC ||
1270 1273 CMSClassUnloadingEnabled && UseConcMarkSweepGC ||
1271 1274 ExplicitGCInvokesConcurrentAndUnloadsClasses &&
1272 1275 UseConcMarkSweepGC && should_unload_classes;
1273 1276 RememberKlassesChecker mx(must_remember_klasses);
1274 1277 #endif
1275 1278 // Soft references
1276 1279 {
1277 1280 TraceTime tt("Preclean SoftReferences", PrintGCDetails && PrintReferenceGC,
1278 1281 false, gclog_or_tty);
1279 1282 for (int i = 0; i < _max_num_q; i++) {
1280 1283 if (yield->should_return()) {
1281 1284 return;
1282 1285 }
1283 1286 preclean_discovered_reflist(_discoveredSoftRefs[i], is_alive,
1284 1287 keep_alive, complete_gc, yield);
1285 1288 }
1286 1289 }
1287 1290
1288 1291 // Weak references
1289 1292 {
1290 1293 TraceTime tt("Preclean WeakReferences", PrintGCDetails && PrintReferenceGC,
1291 1294 false, gclog_or_tty);
1292 1295 for (int i = 0; i < _max_num_q; i++) {
1293 1296 if (yield->should_return()) {
1294 1297 return;
1295 1298 }
1296 1299 preclean_discovered_reflist(_discoveredWeakRefs[i], is_alive,
1297 1300 keep_alive, complete_gc, yield);
1298 1301 }
1299 1302 }
1300 1303
1301 1304 // Final references
1302 1305 {
1303 1306 TraceTime tt("Preclean FinalReferences", PrintGCDetails && PrintReferenceGC,
1304 1307 false, gclog_or_tty);
1305 1308 for (int i = 0; i < _max_num_q; i++) {
1306 1309 if (yield->should_return()) {
1307 1310 return;
1308 1311 }
1309 1312 preclean_discovered_reflist(_discoveredFinalRefs[i], is_alive,
1310 1313 keep_alive, complete_gc, yield);
1311 1314 }
1312 1315 }
1313 1316
1314 1317 // Phantom references
1315 1318 {
1316 1319 TraceTime tt("Preclean PhantomReferences", PrintGCDetails && PrintReferenceGC,
1317 1320 false, gclog_or_tty);
1318 1321 for (int i = 0; i < _max_num_q; i++) {
1319 1322 if (yield->should_return()) {
1320 1323 return;
1321 1324 }
1322 1325 preclean_discovered_reflist(_discoveredPhantomRefs[i], is_alive,
1323 1326 keep_alive, complete_gc, yield);
1324 1327 }
1325 1328 }
1326 1329 }
1327 1330
1328 1331 // Walk the given discovered ref list, and remove all reference objects
1329 1332 // whose referents are still alive, whose referents are NULL or which
1330 1333 // are not active (have a non-NULL next field). NOTE: When we are
1331 1334 // thus precleaning the ref lists (which happens single-threaded today),
1332 1335 // we do not disable refs discovery to honour the correct semantics of
1333 1336 // java.lang.Reference. As a result, we need to be careful below
1334 1337 // that ref removal steps interleave safely with ref discovery steps
1335 1338 // (in this thread).
1336 1339 void
1337 1340 ReferenceProcessor::preclean_discovered_reflist(DiscoveredList& refs_list,
1338 1341 BoolObjectClosure* is_alive,
1339 1342 OopClosure* keep_alive,
1340 1343 VoidClosure* complete_gc,
1341 1344 YieldClosure* yield) {
1342 1345 DiscoveredListIterator iter(refs_list, keep_alive, is_alive);
1343 1346 while (iter.has_next()) {
1344 1347 iter.load_ptrs(DEBUG_ONLY(true /* allow_null_referent */));
1345 1348 oop obj = iter.obj();
1346 1349 oop next = java_lang_ref_Reference::next(obj);
1347 1350 if (iter.referent() == NULL || iter.is_referent_alive() ||
1348 1351 next != NULL) {
1349 1352 // The referent has been cleared, or is alive, or the Reference is not
1350 1353 // active; we need to trace and mark its cohort.
1351 1354 if (TraceReferenceGC) {
1352 1355 gclog_or_tty->print_cr("Precleaning Reference (" INTPTR_FORMAT ": %s)",
1353 1356 iter.obj(), iter.obj()->blueprint()->internal_name());
1354 1357 }
1355 1358 // Remove Reference object from list
1356 1359 iter.remove();
1357 1360 // Keep alive its cohort.
1358 1361 iter.make_referent_alive();
1359 1362 if (UseCompressedOops) {
1360 1363 narrowOop* next_addr = (narrowOop*)java_lang_ref_Reference::next_addr(obj);
1361 1364 keep_alive->do_oop(next_addr);
1362 1365 } else {
1363 1366 oop* next_addr = (oop*)java_lang_ref_Reference::next_addr(obj);
1364 1367 keep_alive->do_oop(next_addr);
1365 1368 }
1366 1369 iter.move_to_next();
1367 1370 } else {
1368 1371 iter.next();
1369 1372 }
1370 1373 }
1371 1374 // Close the reachable set
1372 1375 complete_gc->do_void();
1373 1376
1374 1377 NOT_PRODUCT(
1375 1378 if (PrintGCDetails && PrintReferenceGC && (iter.processed() > 0)) {
1376 1379 gclog_or_tty->print_cr(" Dropped %d Refs out of %d "
1377 1380 "Refs in discovered list " INTPTR_FORMAT,
1378 1381 iter.removed(), iter.processed(), (address)refs_list.head());
1379 1382 }
1380 1383 )
1381 1384 }
1382 1385
1383 1386 const char* ReferenceProcessor::list_name(int i) {
1384 1387 assert(i >= 0 && i <= _max_num_q * number_of_subclasses_of_ref(),
1385 1388 "Out of bounds index");
1386 1389
1387 1390 int j = i / _max_num_q;
1388 1391 switch (j) {
1389 1392 case 0: return "SoftRef";
1390 1393 case 1: return "WeakRef";
1391 1394 case 2: return "FinalRef";
1392 1395 case 3: return "PhantomRef";
1393 1396 }
1394 1397 ShouldNotReachHere();
1395 1398 return NULL;
1396 1399 }
1397 1400
1398 1401 #ifndef PRODUCT
1399 1402 void ReferenceProcessor::verify_ok_to_handle_reflists() {
1400 1403 // empty for now
1401 1404 }
1402 1405 #endif
1403 1406
1404 1407 #ifndef PRODUCT
1405 1408 void ReferenceProcessor::clear_discovered_references() {
1406 1409 guarantee(!_discovering_refs, "Discovering refs?");
1407 1410 for (int i = 0; i < _max_num_q * number_of_subclasses_of_ref(); i++) {
1408 1411 clear_discovered_references(_discovered_refs[i]);
1409 1412 }
1410 1413 }
1411 1414
1412 1415 #endif // PRODUCT
↓ open down ↓ |
1248 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX