vm/oops/objArrayKlassKlass.cpp

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