duke@435: /* xdono@631: * Copyright 2001-2008 Sun Microsystems, Inc. All Rights Reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * duke@435: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@435: * CA 95054 USA or visit www.sun.com if you need additional information or duke@435: * have any questions. duke@435: * duke@435: */ duke@435: duke@435: inline OopsInGenClosure::OopsInGenClosure(Generation* gen) : duke@435: OopClosure(gen->ref_processor()), _orig_gen(gen), _rs(NULL) { duke@435: set_generation(gen); duke@435: } duke@435: duke@435: inline void OopsInGenClosure::set_generation(Generation* gen) { duke@435: _gen = gen; duke@435: _gen_boundary = _gen->reserved().start(); duke@435: // Barrier set for the heap, must be set after heap is initialized duke@435: if (_rs == NULL) { duke@435: GenRemSet* rs = SharedHeap::heap()->rem_set(); duke@435: assert(rs->rs_kind() == GenRemSet::CardTable, "Wrong rem set kind"); duke@435: _rs = (CardTableRS*)rs; duke@435: } duke@435: } duke@435: coleenp@548: template inline void OopsInGenClosure::do_barrier(T* p) { duke@435: assert(generation()->is_in_reserved(p), "expected ref in generation"); coleenp@548: assert(!oopDesc::is_null(*p), "expected non-null object"); coleenp@548: oop obj = oopDesc::load_decode_heap_oop_not_null(p); duke@435: // If p points to a younger generation, mark the card. duke@435: if ((HeapWord*)obj < _gen_boundary) { duke@435: _rs->inline_write_ref_field_gc(p, obj); duke@435: } duke@435: } duke@435: ysr@777: inline void OopsInGenClosure::par_do_barrier(oop* p) { ysr@777: assert(generation()->is_in_reserved(p), "expected ref in generation"); ysr@777: oop obj = *p; ysr@777: assert(obj != NULL, "expected non-null object"); ysr@777: // If p points to a younger generation, mark the card. ysr@777: if ((HeapWord*)obj < gen_boundary()) { ysr@777: rs()->write_ref_field_gc_par(p, obj); ysr@777: } ysr@777: } ysr@777: duke@435: // NOTE! Any changes made here should also be made coleenp@548: // in FastScanClosure::do_oop_work() coleenp@548: template inline void ScanClosure::do_oop_work(T* p) { coleenp@548: T heap_oop = oopDesc::load_heap_oop(p); duke@435: // Should we copy the obj? coleenp@548: if (!oopDesc::is_null(heap_oop)) { coleenp@548: oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); duke@435: if ((HeapWord*)obj < _boundary) { duke@435: assert(!_g->to()->is_in_reserved(obj), "Scanning field twice?"); coleenp@548: oop new_obj = obj->is_forwarded() ? obj->forwardee() coleenp@548: : _g->copy_to_survivor_space(obj); coleenp@548: oopDesc::encode_store_heap_oop_not_null(p, new_obj); duke@435: } duke@435: if (_gc_barrier) { duke@435: // Now call parent closure duke@435: do_barrier(p); duke@435: } duke@435: } duke@435: } duke@435: coleenp@548: inline void ScanClosure::do_oop_nv(oop* p) { ScanClosure::do_oop_work(p); } coleenp@548: inline void ScanClosure::do_oop_nv(narrowOop* p) { ScanClosure::do_oop_work(p); } duke@435: duke@435: // NOTE! Any changes made here should also be made coleenp@548: // in ScanClosure::do_oop_work() coleenp@548: template inline void FastScanClosure::do_oop_work(T* p) { coleenp@548: T heap_oop = oopDesc::load_heap_oop(p); duke@435: // Should we copy the obj? coleenp@548: if (!oopDesc::is_null(heap_oop)) { coleenp@548: oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); duke@435: if ((HeapWord*)obj < _boundary) { duke@435: assert(!_g->to()->is_in_reserved(obj), "Scanning field twice?"); coleenp@548: oop new_obj = obj->is_forwarded() ? obj->forwardee() coleenp@548: : _g->copy_to_survivor_space(obj); coleenp@548: oopDesc::encode_store_heap_oop_not_null(p, new_obj); duke@435: if (_gc_barrier) { duke@435: // Now call parent closure duke@435: do_barrier(p); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: coleenp@548: inline void FastScanClosure::do_oop_nv(oop* p) { FastScanClosure::do_oop_work(p); } coleenp@548: inline void FastScanClosure::do_oop_nv(narrowOop* p) { FastScanClosure::do_oop_work(p); } duke@435: duke@435: // Note similarity to ScanClosure; the difference is that duke@435: // the barrier set is taken care of outside this closure. coleenp@548: template inline void ScanWeakRefClosure::do_oop_work(T* p) { coleenp@548: assert(!oopDesc::is_null(*p), "null weak reference?"); coleenp@548: oop obj = oopDesc::load_decode_heap_oop_not_null(p); duke@435: // weak references are sometimes scanned twice; must check duke@435: // that to-space doesn't already contain this object duke@435: if ((HeapWord*)obj < _boundary && !_g->to()->is_in_reserved(obj)) { coleenp@548: oop new_obj = obj->is_forwarded() ? obj->forwardee() coleenp@548: : _g->copy_to_survivor_space(obj); coleenp@548: oopDesc::encode_store_heap_oop_not_null(p, new_obj); duke@435: } duke@435: } duke@435: coleenp@548: inline void ScanWeakRefClosure::do_oop_nv(oop* p) { ScanWeakRefClosure::do_oop_work(p); } coleenp@548: inline void ScanWeakRefClosure::do_oop_nv(narrowOop* p) { ScanWeakRefClosure::do_oop_work(p); }