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