duke@435: /* trims@1907: * Copyright (c) 1997, 2006, Oracle and/or its affiliates. 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: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: duke@435: # include "incls/_precompiled.incl" duke@435: # include "incls/_klassKlass.cpp.incl" duke@435: duke@435: int klassKlass::oop_size(oop obj) const { duke@435: assert (obj->is_klass(), "must be a klassOop"); duke@435: return klassOop(obj)->klass_part()->klass_oop_size(); duke@435: } duke@435: duke@435: klassOop klassKlass::create_klass(TRAPS) { duke@435: KlassHandle h_this_klass; duke@435: klassKlass o; duke@435: // for bootstrapping, handles may not be available yet. duke@435: klassOop k = base_create_klass_oop(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL); duke@435: k->set_klass(k); // point to thyself duke@435: // Do not try to allocate mirror, java.lang.Class not loaded at this point. duke@435: // See Universe::fixup_mirrors() duke@435: return k; duke@435: } duke@435: duke@435: void klassKlass::oop_follow_contents(oop obj) { duke@435: Klass* k = Klass::cast(klassOop(obj)); duke@435: // If we are alive it is valid to keep our superclass and subtype caches alive duke@435: MarkSweep::mark_and_push(k->adr_super()); duke@435: for (juint i = 0; i < Klass::primary_super_limit(); i++) duke@435: MarkSweep::mark_and_push(k->adr_primary_supers()+i); duke@435: MarkSweep::mark_and_push(k->adr_secondary_super_cache()); duke@435: MarkSweep::mark_and_push(k->adr_secondary_supers()); duke@435: MarkSweep::mark_and_push(k->adr_java_mirror()); duke@435: MarkSweep::mark_and_push(k->adr_name()); duke@435: // We follow the subklass and sibling links at the end of the duke@435: // marking phase, since otherwise following them will prevent duke@435: // class unloading (all classes are transitively linked from duke@435: // java.lang.Object). duke@435: MarkSweep::revisit_weak_klass_link(k); duke@435: obj->follow_header(); duke@435: } duke@435: duke@435: #ifndef SERIALGC duke@435: void klassKlass::oop_follow_contents(ParCompactionManager* cm, duke@435: oop obj) { duke@435: Klass* k = Klass::cast(klassOop(obj)); duke@435: // If we are alive it is valid to keep our superclass and subtype caches alive duke@435: PSParallelCompact::mark_and_push(cm, k->adr_super()); duke@435: for (juint i = 0; i < Klass::primary_super_limit(); i++) duke@435: PSParallelCompact::mark_and_push(cm, k->adr_primary_supers()+i); duke@435: PSParallelCompact::mark_and_push(cm, k->adr_secondary_super_cache()); duke@435: PSParallelCompact::mark_and_push(cm, k->adr_secondary_supers()); duke@435: PSParallelCompact::mark_and_push(cm, k->adr_java_mirror()); duke@435: PSParallelCompact::mark_and_push(cm, k->adr_name()); duke@435: // We follow the subklass and sibling links at the end of the duke@435: // marking phase, since otherwise following them will prevent duke@435: // class unloading (all classes are transitively linked from duke@435: // java.lang.Object). duke@435: PSParallelCompact::revisit_weak_klass_link(cm, k); duke@435: obj->follow_header(cm); duke@435: } duke@435: #endif // SERIALGC duke@435: duke@435: int klassKlass::oop_oop_iterate(oop obj, OopClosure* blk) { duke@435: // Get size before changing pointers duke@435: int size = oop_size(obj); duke@435: Klass* k = Klass::cast(klassOop(obj)); duke@435: blk->do_oop(k->adr_super()); duke@435: for (juint i = 0; i < Klass::primary_super_limit(); i++) duke@435: blk->do_oop(k->adr_primary_supers()+i); duke@435: blk->do_oop(k->adr_secondary_super_cache()); duke@435: blk->do_oop(k->adr_secondary_supers()); duke@435: blk->do_oop(k->adr_java_mirror()); duke@435: blk->do_oop(k->adr_name()); duke@435: // The following are in the perm gen and are treated duke@435: // specially in a later phase of a perm gen collection; ... duke@435: assert(oop(k)->is_perm(), "should be in perm"); duke@435: assert(oop(k->subklass())->is_perm_or_null(), "should be in perm"); duke@435: assert(oop(k->next_sibling())->is_perm_or_null(), "should be in perm"); duke@435: // ... don't scan them normally, but remember this klassKlass duke@435: // for later (see, for instance, oop_follow_contents above duke@435: // for what MarkSweep does with it. duke@435: if (blk->should_remember_klasses()) { duke@435: blk->remember_klass(k); duke@435: } duke@435: obj->oop_iterate_header(blk); duke@435: return size; duke@435: } duke@435: duke@435: duke@435: int klassKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { duke@435: // Get size before changing pointers duke@435: int size = oop_size(obj); duke@435: Klass* k = Klass::cast(klassOop(obj)); duke@435: oop* adr; duke@435: adr = k->adr_super(); duke@435: if (mr.contains(adr)) blk->do_oop(adr); duke@435: for (juint i = 0; i < Klass::primary_super_limit(); i++) { duke@435: adr = k->adr_primary_supers()+i; duke@435: if (mr.contains(adr)) blk->do_oop(adr); duke@435: } duke@435: adr = k->adr_secondary_super_cache(); duke@435: if (mr.contains(adr)) blk->do_oop(adr); duke@435: adr = k->adr_secondary_supers(); duke@435: if (mr.contains(adr)) blk->do_oop(adr); duke@435: adr = k->adr_java_mirror(); duke@435: if (mr.contains(adr)) blk->do_oop(adr); duke@435: adr = k->adr_name(); duke@435: if (mr.contains(adr)) blk->do_oop(adr); duke@435: // The following are "weak links" in the perm gen and are duke@435: // treated specially in a later phase of a perm gen collection. duke@435: assert(oop(k)->is_perm(), "should be in perm"); duke@435: assert(oop(k->adr_subklass())->is_perm(), "should be in perm"); duke@435: assert(oop(k->adr_next_sibling())->is_perm(), "should be in perm"); duke@435: if (blk->should_remember_klasses() duke@435: && (mr.contains(k->adr_subklass()) duke@435: || mr.contains(k->adr_next_sibling()))) { duke@435: blk->remember_klass(k); duke@435: } duke@435: obj->oop_iterate_header(blk, mr); duke@435: return size; duke@435: } duke@435: duke@435: duke@435: int klassKlass::oop_adjust_pointers(oop obj) { duke@435: // Get size before changing pointers duke@435: int size = oop_size(obj); duke@435: obj->adjust_header(); duke@435: duke@435: Klass* k = Klass::cast(klassOop(obj)); duke@435: duke@435: MarkSweep::adjust_pointer(k->adr_super()); duke@435: for (juint i = 0; i < Klass::primary_super_limit(); i++) duke@435: MarkSweep::adjust_pointer(k->adr_primary_supers()+i); duke@435: MarkSweep::adjust_pointer(k->adr_secondary_super_cache()); duke@435: MarkSweep::adjust_pointer(k->adr_secondary_supers()); duke@435: MarkSweep::adjust_pointer(k->adr_java_mirror()); duke@435: MarkSweep::adjust_pointer(k->adr_name()); duke@435: MarkSweep::adjust_pointer(k->adr_subklass()); duke@435: MarkSweep::adjust_pointer(k->adr_next_sibling()); duke@435: return size; duke@435: } duke@435: duke@435: #ifndef SERIALGC duke@435: void klassKlass::oop_copy_contents(PSPromotionManager* pm, oop obj) { duke@435: } duke@435: duke@435: void klassKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { duke@435: } duke@435: duke@435: int klassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { duke@435: Klass* k = Klass::cast(klassOop(obj)); duke@435: duke@435: oop* const beg_oop = k->oop_block_beg(); duke@435: oop* const end_oop = k->oop_block_end(); duke@435: for (oop* cur_oop = beg_oop; cur_oop < end_oop; ++cur_oop) { duke@435: PSParallelCompact::adjust_pointer(cur_oop); duke@435: } duke@435: duke@435: return oop_size(obj); duke@435: } duke@435: duke@435: int klassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, duke@435: HeapWord* beg_addr, HeapWord* end_addr) { duke@435: Klass* k = Klass::cast(klassOop(obj)); duke@435: duke@435: oop* const beg_oop = MAX2((oop*)beg_addr, k->oop_block_beg()); duke@435: oop* const end_oop = MIN2((oop*)end_addr, k->oop_block_end()); duke@435: for (oop* cur_oop = beg_oop; cur_oop < end_oop; ++cur_oop) { duke@435: PSParallelCompact::adjust_pointer(cur_oop); duke@435: } duke@435: duke@435: return oop_size(obj); duke@435: } duke@435: #endif // SERIALGC duke@435: duke@435: duke@435: // Printing duke@435: duke@435: void klassKlass::oop_print_on(oop obj, outputStream* st) { duke@435: Klass::oop_print_on(obj, st); duke@435: } duke@435: duke@435: void klassKlass::oop_print_value_on(oop obj, outputStream* st) { duke@435: Klass::oop_print_value_on(obj, st); duke@435: } duke@435: duke@435: const char* klassKlass::internal_name() const { duke@435: return "{other class}"; duke@435: } duke@435: duke@435: duke@435: // Verification duke@435: duke@435: void klassKlass::oop_verify_on(oop obj, outputStream* st) { duke@435: Klass::oop_verify_on(obj, st); duke@435: guarantee(obj->is_perm(), "should be in permspace"); duke@435: guarantee(obj->is_klass(), "should be klass"); duke@435: duke@435: Klass* k = Klass::cast(klassOop(obj)); duke@435: if (k->super() != NULL) { duke@435: guarantee(k->super()->is_perm(), "should be in permspace"); duke@435: guarantee(k->super()->is_klass(), "should be klass"); duke@435: } duke@435: klassOop ko = k->secondary_super_cache(); duke@435: if( ko != NULL ) { duke@435: guarantee(ko->is_perm(), "should be in permspace"); duke@435: guarantee(ko->is_klass(), "should be klass"); duke@435: } duke@435: for( uint i = 0; i < primary_super_limit(); i++ ) { duke@435: oop ko = k->adr_primary_supers()[i]; // Cannot use normal accessor because it asserts duke@435: if( ko != NULL ) { duke@435: guarantee(ko->is_perm(), "should be in permspace"); duke@435: guarantee(ko->is_klass(), "should be klass"); duke@435: } duke@435: } duke@435: duke@435: if (k->java_mirror() != NULL || (k->oop_is_instance() && instanceKlass::cast(klassOop(obj))->is_loaded())) { duke@435: guarantee(k->java_mirror() != NULL, "should be allocated"); duke@435: guarantee(k->java_mirror()->is_perm(), "should be in permspace"); duke@435: guarantee(k->java_mirror()->is_instance(), "should be instance"); duke@435: } duke@435: if (k->name() != NULL) { duke@435: guarantee(Universe::heap()->is_in_permanent(k->name()), duke@435: "should be in permspace"); duke@435: guarantee(k->name()->is_symbol(), "should be symbol"); duke@435: } duke@435: }