duke@435: /* stefank@2314: * Copyright (c) 1997, 2010, 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: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "classfile/javaClasses.hpp" stefank@2314: #include "classfile/systemDictionary.hpp" stefank@2314: #include "gc_implementation/shared/markSweep.inline.hpp" stefank@2314: #include "gc_interface/collectedHeap.inline.hpp" stefank@2314: #include "oops/instanceKlass.hpp" stefank@2314: #include "oops/objArrayKlassKlass.hpp" stefank@2314: #include "oops/oop.inline.hpp" stefank@2314: #include "oops/oop.inline2.hpp" duke@435: duke@435: klassOop objArrayKlassKlass::create_klass(TRAPS) { duke@435: objArrayKlassKlass o; duke@435: KlassHandle h_this_klass(THREAD, Universe::klassKlassObj()); duke@435: KlassHandle k = base_create_klass(h_this_klass, header_size(), o.vtbl_value(), CHECK_0); duke@435: assert(k()->size() == align_object_size(header_size()), "wrong size for object"); duke@435: java_lang_Class::create_mirror(k, CHECK_0); // Allocate mirror duke@435: return k(); duke@435: } duke@435: duke@435: klassOop objArrayKlassKlass::allocate_system_objArray_klass(TRAPS) { duke@435: // system_objArrays have no instance klass, so allocate with fake class, then reset to NULL duke@435: KlassHandle kk(THREAD, Universe::intArrayKlassObj()); duke@435: klassOop k = allocate_objArray_klass(1, kk, CHECK_0); duke@435: objArrayKlass* tk = (objArrayKlass*) k->klass_part(); duke@435: tk->set_element_klass(NULL); duke@435: tk->set_bottom_klass(NULL); duke@435: return k; duke@435: } duke@435: duke@435: duke@435: klassOop objArrayKlassKlass::allocate_objArray_klass(int n, KlassHandle element_klass, TRAPS) { duke@435: objArrayKlassKlassHandle this_oop(THREAD, as_klassOop()); duke@435: return allocate_objArray_klass_impl(this_oop, n, element_klass, THREAD); duke@435: } duke@435: duke@435: klassOop objArrayKlassKlass::allocate_objArray_klass_impl(objArrayKlassKlassHandle this_oop, duke@435: int n, KlassHandle element_klass, TRAPS) { duke@435: duke@435: // Eagerly allocate the direct array supertype. duke@435: KlassHandle super_klass = KlassHandle(); duke@435: if (!Universe::is_bootstrapping()) { duke@435: KlassHandle element_super (THREAD, element_klass->super()); duke@435: if (element_super.not_null()) { duke@435: // The element type has a direct super. E.g., String[] has direct super of Object[]. duke@435: super_klass = KlassHandle(THREAD, element_super->array_klass_or_null()); duke@435: bool supers_exist = super_klass.not_null(); duke@435: // Also, see if the element has secondary supertypes. duke@435: // We need an array type for each. duke@435: objArrayHandle element_supers = objArrayHandle(THREAD, duke@435: element_klass->secondary_supers()); duke@435: for( int i = element_supers->length()-1; i >= 0; i-- ) { duke@435: klassOop elem_super = (klassOop) element_supers->obj_at(i); duke@435: if (Klass::cast(elem_super)->array_klass_or_null() == NULL) { duke@435: supers_exist = false; duke@435: break; duke@435: } duke@435: } duke@435: if (!supers_exist) { duke@435: // Oops. Not allocated yet. Back out, allocate it, and retry. duke@435: #ifndef PRODUCT duke@435: if (WizardMode) { duke@435: tty->print_cr("Must retry array klass creation for depth %d",n); duke@435: } duke@435: #endif duke@435: KlassHandle ek; duke@435: { duke@435: MutexUnlocker mu(MultiArray_lock); duke@435: MutexUnlocker mc(Compile_lock); // for vtables duke@435: klassOop sk = element_super->array_klass(CHECK_0); duke@435: super_klass = KlassHandle(THREAD, sk); duke@435: for( int i = element_supers->length()-1; i >= 0; i-- ) { duke@435: KlassHandle elem_super (THREAD, element_supers->obj_at(i)); duke@435: elem_super->array_klass(CHECK_0); duke@435: } duke@435: // Now retry from the beginning duke@435: klassOop klass_oop = element_klass->array_klass(n, CHECK_0); duke@435: // Create a handle because the enclosing brace, when locking duke@435: // can cause a gc. Better to have this function return a Handle. duke@435: ek = KlassHandle(THREAD, klass_oop); duke@435: } // re-lock duke@435: return ek(); duke@435: } duke@435: } else { duke@435: // The element type is already Object. Object[] has direct super of Object. never@1577: super_klass = KlassHandle(THREAD, SystemDictionary::Object_klass()); duke@435: } duke@435: } duke@435: coleenp@2497: // Create type name for klass. coleenp@2497: Symbol* name = NULL; coleenp@2497: if (!element_klass->oop_is_instance() || coleenp@2497: (name = instanceKlass::cast(element_klass())->array_name()) == NULL) { duke@435: duke@435: ResourceMark rm(THREAD); duke@435: char *name_str = element_klass->name()->as_C_string(); duke@435: int len = element_klass->name()->utf8_length(); duke@435: char *new_str = NEW_RESOURCE_ARRAY(char, len + 4); duke@435: int idx = 0; duke@435: new_str[idx++] = '['; duke@435: if (element_klass->oop_is_instance()) { // it could be an array or simple type duke@435: new_str[idx++] = 'L'; duke@435: } duke@435: memcpy(&new_str[idx], name_str, len * sizeof(char)); duke@435: idx += len; duke@435: if (element_klass->oop_is_instance()) { duke@435: new_str[idx++] = ';'; duke@435: } duke@435: new_str[idx++] = '\0'; coleenp@2497: name = SymbolTable::new_symbol(new_str, CHECK_0); coleenp@2497: if (element_klass->oop_is_instance()) { coleenp@2497: instanceKlass* ik = instanceKlass::cast(element_klass()); coleenp@2497: ik->set_array_name(name); coleenp@2497: } duke@435: } duke@435: duke@435: objArrayKlass o; duke@435: arrayKlassHandle k = arrayKlass::base_create_array_klass(o.vtbl_value(), duke@435: objArrayKlass::header_size(), duke@435: this_oop, duke@435: CHECK_0); duke@435: duke@435: // Initialize instance variables duke@435: objArrayKlass* oak = objArrayKlass::cast(k()); duke@435: oak->set_dimension(n); duke@435: oak->set_element_klass(element_klass()); coleenp@2497: oak->set_name(name); coleenp@2497: // decrement refcount because object arrays are not explicitly freed. The coleenp@2497: // instanceKlass array_name() keeps the name counted while the klass is coleenp@2497: // loaded. coleenp@2497: name->decrement_refcount(); duke@435: duke@435: klassOop bk; duke@435: if (element_klass->oop_is_objArray()) { duke@435: bk = objArrayKlass::cast(element_klass())->bottom_klass(); duke@435: } else { duke@435: bk = element_klass(); duke@435: } duke@435: assert(bk != NULL && (Klass::cast(bk)->oop_is_instance() || Klass::cast(bk)->oop_is_typeArray()), "invalid bottom klass"); duke@435: oak->set_bottom_klass(bk); duke@435: duke@435: oak->set_layout_helper(array_layout_helper(T_OBJECT)); duke@435: assert(oak->oop_is_javaArray(), "sanity"); duke@435: assert(oak->oop_is_objArray(), "sanity"); duke@435: duke@435: // Call complete_create_array_klass after all instance variables has been initialized. duke@435: arrayKlass::complete_create_array_klass(k, super_klass, CHECK_0); duke@435: duke@435: return k(); duke@435: } duke@435: duke@435: duke@435: void objArrayKlassKlass::oop_follow_contents(oop obj) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: assert(klassOop(obj)->klass_part()->oop_is_objArray_slow(), "must be obj array"); duke@435: duke@435: objArrayKlass* oak = objArrayKlass::cast((klassOop)obj); duke@435: MarkSweep::mark_and_push(oak->element_klass_addr()); duke@435: MarkSweep::mark_and_push(oak->bottom_klass_addr()); duke@435: duke@435: arrayKlassKlass::oop_follow_contents(obj); duke@435: } duke@435: duke@435: #ifndef SERIALGC duke@435: void objArrayKlassKlass::oop_follow_contents(ParCompactionManager* cm, duke@435: oop obj) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: assert(klassOop(obj)->klass_part()->oop_is_objArray_slow(), "must be obj array"); duke@435: duke@435: objArrayKlass* oak = objArrayKlass::cast((klassOop)obj); duke@435: PSParallelCompact::mark_and_push(cm, oak->element_klass_addr()); duke@435: PSParallelCompact::mark_and_push(cm, oak->bottom_klass_addr()); duke@435: duke@435: arrayKlassKlass::oop_follow_contents(cm, obj); duke@435: } duke@435: #endif // SERIALGC duke@435: duke@435: duke@435: int objArrayKlassKlass::oop_adjust_pointers(oop obj) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: assert(klassOop(obj)->klass_part()->oop_is_objArray_slow(), "must be obj array"); duke@435: duke@435: objArrayKlass* oak = objArrayKlass::cast((klassOop)obj); duke@435: MarkSweep::adjust_pointer(oak->element_klass_addr()); duke@435: MarkSweep::adjust_pointer(oak->bottom_klass_addr()); duke@435: duke@435: return arrayKlassKlass::oop_adjust_pointers(obj); duke@435: } duke@435: duke@435: duke@435: duke@435: int objArrayKlassKlass::oop_oop_iterate(oop obj, OopClosure* blk) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: assert(klassOop(obj)->klass_part()->oop_is_objArray_slow(), "must be obj array"); duke@435: duke@435: objArrayKlass* oak = objArrayKlass::cast((klassOop)obj); duke@435: blk->do_oop(oak->element_klass_addr()); duke@435: blk->do_oop(oak->bottom_klass_addr()); duke@435: duke@435: return arrayKlassKlass::oop_oop_iterate(obj, blk); duke@435: } duke@435: duke@435: duke@435: int duke@435: objArrayKlassKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: assert(klassOop(obj)->klass_part()->oop_is_objArray_slow(), "must be obj array"); duke@435: duke@435: objArrayKlass* oak = objArrayKlass::cast((klassOop)obj); duke@435: oop* addr; duke@435: addr = oak->element_klass_addr(); duke@435: if (mr.contains(addr)) blk->do_oop(addr); duke@435: addr = oak->bottom_klass_addr(); duke@435: if (mr.contains(addr)) blk->do_oop(addr); duke@435: duke@435: return arrayKlassKlass::oop_oop_iterate(obj, blk); duke@435: } duke@435: duke@435: #ifndef SERIALGC duke@435: void objArrayKlassKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { duke@435: assert(obj->blueprint()->oop_is_objArrayKlass(),"must be an obj array klass"); duke@435: } duke@435: duke@435: int objArrayKlassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: assert(klassOop(obj)->klass_part()->oop_is_objArray_slow(), "must be obj array"); duke@435: duke@435: objArrayKlass* oak = objArrayKlass::cast((klassOop)obj); duke@435: PSParallelCompact::adjust_pointer(oak->element_klass_addr()); duke@435: PSParallelCompact::adjust_pointer(oak->bottom_klass_addr()); duke@435: duke@435: return arrayKlassKlass::oop_update_pointers(cm, obj); duke@435: } duke@435: duke@435: int objArrayKlassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, duke@435: HeapWord* beg_addr, duke@435: HeapWord* end_addr) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: assert(klassOop(obj)->klass_part()->oop_is_objArray_slow(), "must be obj array"); duke@435: duke@435: oop* p; duke@435: objArrayKlass* oak = objArrayKlass::cast((klassOop)obj); duke@435: p = oak->element_klass_addr(); duke@435: PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); duke@435: p = oak->bottom_klass_addr(); duke@435: PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); duke@435: duke@435: return arrayKlassKlass::oop_update_pointers(cm, obj, beg_addr, end_addr); duke@435: } duke@435: #endif // SERIALGC duke@435: duke@435: #ifndef PRODUCT duke@435: duke@435: // Printing duke@435: duke@435: void objArrayKlassKlass::oop_print_on(oop obj, outputStream* st) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: objArrayKlass* oak = (objArrayKlass*) klassOop(obj)->klass_part(); duke@435: klassKlass::oop_print_on(obj, st); duke@435: st->print(" - instance klass: "); duke@435: oak->element_klass()->print_value_on(st); duke@435: st->cr(); duke@435: } duke@435: jrose@1590: #endif //PRODUCT duke@435: duke@435: void objArrayKlassKlass::oop_print_value_on(oop obj, outputStream* st) { duke@435: assert(obj->is_klass(), "must be klass"); duke@435: objArrayKlass* oak = (objArrayKlass*) klassOop(obj)->klass_part(); duke@435: duke@435: oak->element_klass()->print_value_on(st); duke@435: st->print("[]"); duke@435: } duke@435: duke@435: const char* objArrayKlassKlass::internal_name() const { duke@435: return "{object array class}"; duke@435: } duke@435: duke@435: duke@435: // Verification duke@435: duke@435: void objArrayKlassKlass::oop_verify_on(oop obj, outputStream* st) { duke@435: klassKlass::oop_verify_on(obj, st); duke@435: objArrayKlass* oak = objArrayKlass::cast((klassOop)obj); duke@435: guarantee(oak->element_klass()->is_perm(), "should be in permspace"); duke@435: guarantee(oak->element_klass()->is_klass(), "should be klass"); duke@435: guarantee(oak->bottom_klass()->is_perm(), "should be in permspace"); duke@435: guarantee(oak->bottom_klass()->is_klass(), "should be klass"); duke@435: Klass* bk = Klass::cast(oak->bottom_klass()); duke@435: guarantee(bk->oop_is_instance() || bk->oop_is_typeArray(), "invalid bottom klass"); duke@435: }