0N/A/*
2099N/A * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1472N/A * or visit www.oracle.com if you need additional information or have any
1472N/A * questions.
0N/A *
0N/A */
0N/A
1879N/A#include "precompiled.hpp"
1879N/A#include "gc_implementation/shared/markSweep.inline.hpp"
1879N/A#include "gc_interface/collectedHeap.hpp"
1879N/A#include "gc_interface/collectedHeap.inline.hpp"
1879N/A#include "memory/oopFactory.hpp"
1879N/A#include "memory/permGen.hpp"
1879N/A#include "oops/constantPoolKlass.hpp"
1879N/A#include "oops/instanceKlass.hpp"
1879N/A#include "oops/instanceOop.hpp"
1879N/A#include "oops/klassKlass.hpp"
1879N/A#include "oops/klassOop.hpp"
1879N/A#include "oops/methodKlass.hpp"
1879N/A#include "oops/objArrayKlass.hpp"
1879N/A#include "oops/oop.inline.hpp"
1879N/A#include "oops/oop.inline2.hpp"
2062N/A#include "oops/symbol.hpp"
1879N/A#include "oops/typeArrayKlass.hpp"
1879N/A#include "runtime/handles.inline.hpp"
1879N/A#ifndef SERIALGC
2223N/A#include "gc_implementation/parNew/parOopClosures.inline.hpp"
2223N/A#include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
2223N/A#include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
2223N/A#include "memory/cardTableRS.hpp"
1879N/A#include "oops/oop.pcgc.inline.hpp"
1879N/A#endif
0N/A
0N/Aint klassKlass::oop_size(oop obj) const {
0N/A assert (obj->is_klass(), "must be a klassOop");
0N/A return klassOop(obj)->klass_part()->klass_oop_size();
0N/A}
0N/A
0N/AklassOop klassKlass::create_klass(TRAPS) {
0N/A KlassHandle h_this_klass;
0N/A klassKlass o;
0N/A // for bootstrapping, handles may not be available yet.
0N/A klassOop k = base_create_klass_oop(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL);
0N/A k->set_klass(k); // point to thyself
0N/A // Do not try to allocate mirror, java.lang.Class not loaded at this point.
0N/A // See Universe::fixup_mirrors()
0N/A return k;
0N/A}
0N/A
0N/Avoid klassKlass::oop_follow_contents(oop obj) {
0N/A Klass* k = Klass::cast(klassOop(obj));
0N/A // If we are alive it is valid to keep our superclass and subtype caches alive
0N/A MarkSweep::mark_and_push(k->adr_super());
0N/A for (juint i = 0; i < Klass::primary_super_limit(); i++)
0N/A MarkSweep::mark_and_push(k->adr_primary_supers()+i);
0N/A MarkSweep::mark_and_push(k->adr_secondary_super_cache());
0N/A MarkSweep::mark_and_push(k->adr_secondary_supers());
0N/A MarkSweep::mark_and_push(k->adr_java_mirror());
0N/A // We follow the subklass and sibling links at the end of the
0N/A // marking phase, since otherwise following them will prevent
0N/A // class unloading (all classes are transitively linked from
0N/A // java.lang.Object).
0N/A MarkSweep::revisit_weak_klass_link(k);
0N/A obj->follow_header();
0N/A}
0N/A
0N/A#ifndef SERIALGC
0N/Avoid klassKlass::oop_follow_contents(ParCompactionManager* cm,
0N/A oop obj) {
0N/A Klass* k = Klass::cast(klassOop(obj));
0N/A // If we are alive it is valid to keep our superclass and subtype caches alive
0N/A PSParallelCompact::mark_and_push(cm, k->adr_super());
0N/A for (juint i = 0; i < Klass::primary_super_limit(); i++)
0N/A PSParallelCompact::mark_and_push(cm, k->adr_primary_supers()+i);
0N/A PSParallelCompact::mark_and_push(cm, k->adr_secondary_super_cache());
0N/A PSParallelCompact::mark_and_push(cm, k->adr_secondary_supers());
0N/A PSParallelCompact::mark_and_push(cm, k->adr_java_mirror());
0N/A // We follow the subklass and sibling links at the end of the
0N/A // marking phase, since otherwise following them will prevent
0N/A // class unloading (all classes are transitively linked from
0N/A // java.lang.Object).
0N/A PSParallelCompact::revisit_weak_klass_link(cm, k);
0N/A obj->follow_header(cm);
0N/A}
0N/A#endif // SERIALGC
0N/A
0N/Aint klassKlass::oop_oop_iterate(oop obj, OopClosure* blk) {
0N/A // Get size before changing pointers
0N/A int size = oop_size(obj);
0N/A Klass* k = Klass::cast(klassOop(obj));
0N/A blk->do_oop(k->adr_super());
0N/A for (juint i = 0; i < Klass::primary_super_limit(); i++)
0N/A blk->do_oop(k->adr_primary_supers()+i);
0N/A blk->do_oop(k->adr_secondary_super_cache());
0N/A blk->do_oop(k->adr_secondary_supers());
0N/A blk->do_oop(k->adr_java_mirror());
0N/A // The following are in the perm gen and are treated
0N/A // specially in a later phase of a perm gen collection; ...
0N/A assert(oop(k)->is_perm(), "should be in perm");
0N/A assert(oop(k->subklass())->is_perm_or_null(), "should be in perm");
0N/A assert(oop(k->next_sibling())->is_perm_or_null(), "should be in perm");
0N/A // ... don't scan them normally, but remember this klassKlass
0N/A // for later (see, for instance, oop_follow_contents above
0N/A // for what MarkSweep does with it.
0N/A if (blk->should_remember_klasses()) {
0N/A blk->remember_klass(k);
0N/A }
0N/A obj->oop_iterate_header(blk);
0N/A return size;
0N/A}
0N/A
0N/A
0N/Aint klassKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) {
0N/A // Get size before changing pointers
0N/A int size = oop_size(obj);
0N/A Klass* k = Klass::cast(klassOop(obj));
0N/A oop* adr;
0N/A adr = k->adr_super();
0N/A if (mr.contains(adr)) blk->do_oop(adr);
0N/A for (juint i = 0; i < Klass::primary_super_limit(); i++) {
0N/A adr = k->adr_primary_supers()+i;
0N/A if (mr.contains(adr)) blk->do_oop(adr);
0N/A }
0N/A adr = k->adr_secondary_super_cache();
0N/A if (mr.contains(adr)) blk->do_oop(adr);
0N/A adr = k->adr_secondary_supers();
0N/A if (mr.contains(adr)) blk->do_oop(adr);
0N/A adr = k->adr_java_mirror();
0N/A if (mr.contains(adr)) blk->do_oop(adr);
0N/A // The following are "weak links" in the perm gen and are
0N/A // treated specially in a later phase of a perm gen collection.
0N/A assert(oop(k)->is_perm(), "should be in perm");
0N/A assert(oop(k->adr_subklass())->is_perm(), "should be in perm");
0N/A assert(oop(k->adr_next_sibling())->is_perm(), "should be in perm");
0N/A if (blk->should_remember_klasses()
0N/A && (mr.contains(k->adr_subklass())
0N/A || mr.contains(k->adr_next_sibling()))) {
0N/A blk->remember_klass(k);
0N/A }
0N/A obj->oop_iterate_header(blk, mr);
0N/A return size;
0N/A}
0N/A
0N/A
0N/Aint klassKlass::oop_adjust_pointers(oop obj) {
0N/A // Get size before changing pointers
0N/A int size = oop_size(obj);
0N/A obj->adjust_header();
0N/A
0N/A Klass* k = Klass::cast(klassOop(obj));
0N/A
0N/A MarkSweep::adjust_pointer(k->adr_super());
0N/A for (juint i = 0; i < Klass::primary_super_limit(); i++)
0N/A MarkSweep::adjust_pointer(k->adr_primary_supers()+i);
0N/A MarkSweep::adjust_pointer(k->adr_secondary_super_cache());
0N/A MarkSweep::adjust_pointer(k->adr_secondary_supers());
0N/A MarkSweep::adjust_pointer(k->adr_java_mirror());
0N/A MarkSweep::adjust_pointer(k->adr_subklass());
0N/A MarkSweep::adjust_pointer(k->adr_next_sibling());
0N/A return size;
0N/A}
0N/A
0N/A#ifndef SERIALGC
0N/Avoid klassKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
2223N/A Klass* k = Klass::cast(klassOop(obj));
2223N/A
2223N/A oop* p = k->adr_java_mirror();
2223N/A if (PSScavenge::should_scavenge(p)) {
2223N/A pm->claim_or_forward_depth(p);
2223N/A }
0N/A}
0N/A
0N/Aint klassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
0N/A Klass* k = Klass::cast(klassOop(obj));
0N/A
0N/A oop* const beg_oop = k->oop_block_beg();
0N/A oop* const end_oop = k->oop_block_end();
0N/A for (oop* cur_oop = beg_oop; cur_oop < end_oop; ++cur_oop) {
0N/A PSParallelCompact::adjust_pointer(cur_oop);
0N/A }
0N/A
0N/A return oop_size(obj);
0N/A}
0N/A#endif // SERIALGC
0N/A
0N/A
0N/A// Printing
0N/A
0N/Avoid klassKlass::oop_print_on(oop obj, outputStream* st) {
0N/A Klass::oop_print_on(obj, st);
0N/A}
0N/A
0N/Avoid klassKlass::oop_print_value_on(oop obj, outputStream* st) {
0N/A Klass::oop_print_value_on(obj, st);
0N/A}
0N/A
0N/Aconst char* klassKlass::internal_name() const {
0N/A return "{other class}";
0N/A}
0N/A
0N/A
0N/A// Verification
0N/A
0N/Avoid klassKlass::oop_verify_on(oop obj, outputStream* st) {
0N/A Klass::oop_verify_on(obj, st);
0N/A guarantee(obj->is_perm(), "should be in permspace");
0N/A guarantee(obj->is_klass(), "should be klass");
0N/A
0N/A Klass* k = Klass::cast(klassOop(obj));
0N/A if (k->super() != NULL) {
0N/A guarantee(k->super()->is_perm(), "should be in permspace");
0N/A guarantee(k->super()->is_klass(), "should be klass");
0N/A }
0N/A klassOop ko = k->secondary_super_cache();
0N/A if( ko != NULL ) {
0N/A guarantee(ko->is_perm(), "should be in permspace");
0N/A guarantee(ko->is_klass(), "should be klass");
0N/A }
0N/A for( uint i = 0; i < primary_super_limit(); i++ ) {
0N/A oop ko = k->adr_primary_supers()[i]; // Cannot use normal accessor because it asserts
0N/A if( ko != NULL ) {
0N/A guarantee(ko->is_perm(), "should be in permspace");
0N/A guarantee(ko->is_klass(), "should be klass");
0N/A }
0N/A }
0N/A
0N/A if (k->java_mirror() != NULL || (k->oop_is_instance() && instanceKlass::cast(klassOop(obj))->is_loaded())) {
0N/A guarantee(k->java_mirror() != NULL, "should be allocated");
2223N/A guarantee(k->java_mirror()->is_perm() || !JavaObjectsInPerm, "should be in permspace");
0N/A guarantee(k->java_mirror()->is_instance(), "should be instance");
0N/A }
0N/A}