src/share/vm/memory/genOopClosures.inline.hpp

Wed, 13 Jan 2010 15:26:39 -0800

author
ysr
date
Wed, 13 Jan 2010 15:26:39 -0800
changeset 1601
7b0e9cba0307
parent 1280
df6caf649ff7
child 1907
c18cbe5936b8
permissions
-rw-r--r--

6896647: card marks can be deferred too long
Summary: Deferred card marks are now flushed during the gc prologue. Parallel[Scavege,OldGC] and SerialGC no longer defer card marks generated by COMPILER2 as a result of ReduceInitialCardMarks. For these cases, introduced a diagnostic option to defer the card marks, only for the purposes of testing and diagnostics. CMS and G1 continue to defer card marks. Potential performance concern related to single-threaded flushing of deferred card marks in the gc prologue will be addressed in the future.
Reviewed-by: never, johnc

duke@435 1 /*
xdono@631 2 * Copyright 2001-2008 Sun Microsystems, Inc. All Rights Reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
duke@435 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435 21 * have any questions.
duke@435 22 *
duke@435 23 */
duke@435 24
duke@435 25 inline OopsInGenClosure::OopsInGenClosure(Generation* gen) :
duke@435 26 OopClosure(gen->ref_processor()), _orig_gen(gen), _rs(NULL) {
duke@435 27 set_generation(gen);
duke@435 28 }
duke@435 29
duke@435 30 inline void OopsInGenClosure::set_generation(Generation* gen) {
duke@435 31 _gen = gen;
duke@435 32 _gen_boundary = _gen->reserved().start();
duke@435 33 // Barrier set for the heap, must be set after heap is initialized
duke@435 34 if (_rs == NULL) {
duke@435 35 GenRemSet* rs = SharedHeap::heap()->rem_set();
duke@435 36 assert(rs->rs_kind() == GenRemSet::CardTable, "Wrong rem set kind");
duke@435 37 _rs = (CardTableRS*)rs;
duke@435 38 }
duke@435 39 }
duke@435 40
coleenp@548 41 template <class T> inline void OopsInGenClosure::do_barrier(T* p) {
duke@435 42 assert(generation()->is_in_reserved(p), "expected ref in generation");
ysr@1280 43 T heap_oop = oopDesc::load_heap_oop(p);
ysr@1280 44 assert(!oopDesc::is_null(heap_oop), "expected non-null oop");
ysr@1280 45 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
duke@435 46 // If p points to a younger generation, mark the card.
duke@435 47 if ((HeapWord*)obj < _gen_boundary) {
duke@435 48 _rs->inline_write_ref_field_gc(p, obj);
duke@435 49 }
duke@435 50 }
duke@435 51
ysr@1280 52 template <class T> inline void OopsInGenClosure::par_do_barrier(T* p) {
ysr@777 53 assert(generation()->is_in_reserved(p), "expected ref in generation");
ysr@1280 54 T heap_oop = oopDesc::load_heap_oop(p);
ysr@1280 55 assert(!oopDesc::is_null(heap_oop), "expected non-null oop");
ysr@1280 56 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
ysr@777 57 // If p points to a younger generation, mark the card.
ysr@777 58 if ((HeapWord*)obj < gen_boundary()) {
ysr@777 59 rs()->write_ref_field_gc_par(p, obj);
ysr@777 60 }
ysr@777 61 }
ysr@777 62
duke@435 63 // NOTE! Any changes made here should also be made
coleenp@548 64 // in FastScanClosure::do_oop_work()
coleenp@548 65 template <class T> inline void ScanClosure::do_oop_work(T* p) {
coleenp@548 66 T heap_oop = oopDesc::load_heap_oop(p);
duke@435 67 // Should we copy the obj?
coleenp@548 68 if (!oopDesc::is_null(heap_oop)) {
coleenp@548 69 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
duke@435 70 if ((HeapWord*)obj < _boundary) {
duke@435 71 assert(!_g->to()->is_in_reserved(obj), "Scanning field twice?");
coleenp@548 72 oop new_obj = obj->is_forwarded() ? obj->forwardee()
coleenp@548 73 : _g->copy_to_survivor_space(obj);
coleenp@548 74 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
duke@435 75 }
duke@435 76 if (_gc_barrier) {
duke@435 77 // Now call parent closure
duke@435 78 do_barrier(p);
duke@435 79 }
duke@435 80 }
duke@435 81 }
duke@435 82
coleenp@548 83 inline void ScanClosure::do_oop_nv(oop* p) { ScanClosure::do_oop_work(p); }
coleenp@548 84 inline void ScanClosure::do_oop_nv(narrowOop* p) { ScanClosure::do_oop_work(p); }
duke@435 85
duke@435 86 // NOTE! Any changes made here should also be made
coleenp@548 87 // in ScanClosure::do_oop_work()
coleenp@548 88 template <class T> inline void FastScanClosure::do_oop_work(T* p) {
coleenp@548 89 T heap_oop = oopDesc::load_heap_oop(p);
duke@435 90 // Should we copy the obj?
coleenp@548 91 if (!oopDesc::is_null(heap_oop)) {
coleenp@548 92 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
duke@435 93 if ((HeapWord*)obj < _boundary) {
duke@435 94 assert(!_g->to()->is_in_reserved(obj), "Scanning field twice?");
coleenp@548 95 oop new_obj = obj->is_forwarded() ? obj->forwardee()
coleenp@548 96 : _g->copy_to_survivor_space(obj);
coleenp@548 97 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
duke@435 98 if (_gc_barrier) {
duke@435 99 // Now call parent closure
duke@435 100 do_barrier(p);
duke@435 101 }
duke@435 102 }
duke@435 103 }
duke@435 104 }
duke@435 105
coleenp@548 106 inline void FastScanClosure::do_oop_nv(oop* p) { FastScanClosure::do_oop_work(p); }
coleenp@548 107 inline void FastScanClosure::do_oop_nv(narrowOop* p) { FastScanClosure::do_oop_work(p); }
duke@435 108
duke@435 109 // Note similarity to ScanClosure; the difference is that
duke@435 110 // the barrier set is taken care of outside this closure.
coleenp@548 111 template <class T> inline void ScanWeakRefClosure::do_oop_work(T* p) {
coleenp@548 112 assert(!oopDesc::is_null(*p), "null weak reference?");
coleenp@548 113 oop obj = oopDesc::load_decode_heap_oop_not_null(p);
duke@435 114 // weak references are sometimes scanned twice; must check
duke@435 115 // that to-space doesn't already contain this object
duke@435 116 if ((HeapWord*)obj < _boundary && !_g->to()->is_in_reserved(obj)) {
coleenp@548 117 oop new_obj = obj->is_forwarded() ? obj->forwardee()
coleenp@548 118 : _g->copy_to_survivor_space(obj);
coleenp@548 119 oopDesc::encode_store_heap_oop_not_null(p, new_obj);
duke@435 120 }
duke@435 121 }
duke@435 122
coleenp@548 123 inline void ScanWeakRefClosure::do_oop_nv(oop* p) { ScanWeakRefClosure::do_oop_work(p); }
coleenp@548 124 inline void ScanWeakRefClosure::do_oop_nv(narrowOop* p) { ScanWeakRefClosure::do_oop_work(p); }

mercurial