duke@435: /*
jrose@1100:  * Copyright 1997-2009 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: # include "incls/_precompiled.incl"
duke@435: # include "incls/_objArrayKlass.cpp.incl"
duke@435: 
duke@435: int objArrayKlass::oop_size(oop obj) const {
duke@435:   assert(obj->is_objArray(), "must be object array");
duke@435:   return objArrayOop(obj)->object_size();
duke@435: }
duke@435: 
duke@435: objArrayOop objArrayKlass::allocate(int length, TRAPS) {
duke@435:   if (length >= 0) {
duke@435:     if (length <= arrayOopDesc::max_array_length(T_OBJECT)) {
duke@435:       int size = objArrayOopDesc::object_size(length);
duke@435:       KlassHandle h_k(THREAD, as_klassOop());
duke@435:       objArrayOop a = (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, CHECK_NULL);
duke@435:       assert(a->is_parsable(), "Can't publish unless parsable");
duke@435:       return a;
duke@435:     } else {
duke@435:       THROW_OOP_0(Universe::out_of_memory_error_array_size());
duke@435:     }
duke@435:   } else {
duke@435:     THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
duke@435:   }
duke@435: }
duke@435: 
duke@435: static int multi_alloc_counter = 0;
duke@435: 
duke@435: oop objArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
duke@435:   int length = *sizes;
duke@435:   // Call to lower_dimension uses this pointer, so most be called before a
duke@435:   // possible GC
duke@435:   KlassHandle h_lower_dimension(THREAD, lower_dimension());
duke@435:   // If length < 0 allocate will throw an exception.
duke@435:   objArrayOop array = allocate(length, CHECK_NULL);
duke@435:   assert(array->is_parsable(), "Don't handlize unless parsable");
duke@435:   objArrayHandle h_array (THREAD, array);
duke@435:   if (rank > 1) {
duke@435:     if (length != 0) {
duke@435:       for (int index = 0; index < length; index++) {
duke@435:         arrayKlass* ak = arrayKlass::cast(h_lower_dimension());
duke@435:         oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
duke@435:         assert(sub_array->is_parsable(), "Don't publish until parsable");
duke@435:         h_array->obj_at_put(index, sub_array);
duke@435:       }
duke@435:     } else {
duke@435:       // Since this array dimension has zero length, nothing will be
duke@435:       // allocated, however the lower dimension values must be checked
duke@435:       // for illegal values.
duke@435:       for (int i = 0; i < rank - 1; ++i) {
duke@435:         sizes += 1;
duke@435:         if (*sizes < 0) {
duke@435:           THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
duke@435:         }
duke@435:       }
duke@435:     }
duke@435:   }
duke@435:   return h_array();
duke@435: }
duke@435: 
coleenp@548: // Either oop or narrowOop depending on UseCompressedOops.
coleenp@548: template <class T> void objArrayKlass::do_copy(arrayOop s, T* src,
coleenp@548:                                arrayOop d, T* dst, int length, TRAPS) {
coleenp@548: 
coleenp@548:   const size_t word_len = objArrayOopDesc::array_size(length);
coleenp@548: 
coleenp@548:   BarrierSet* bs = Universe::heap()->barrier_set();
ysr@777:   // For performance reasons, we assume we are that the write barrier we
ysr@777:   // are using has optimized modes for arrays of references.  At least one
ysr@777:   // of the asserts below will fail if this is not the case.
coleenp@548:   assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
ysr@777:   assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
coleenp@548: 
ysr@777:   MemRegion dst_mr = MemRegion((HeapWord*)dst, word_len);
coleenp@548:   if (s == d) {
coleenp@548:     // since source and destination are equal we do not need conversion checks.
coleenp@548:     assert(length > 0, "sanity check");
ysr@777:     bs->write_ref_array_pre(dst_mr);
coleenp@548:     Copy::conjoint_oops_atomic(src, dst, length);
coleenp@548:   } else {
coleenp@548:     // We have to make sure all elements conform to the destination array
coleenp@548:     klassOop bound = objArrayKlass::cast(d->klass())->element_klass();
coleenp@548:     klassOop stype = objArrayKlass::cast(s->klass())->element_klass();
coleenp@548:     if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) {
coleenp@548:       // elements are guaranteed to be subtypes, so no check necessary
ysr@777:       bs->write_ref_array_pre(dst_mr);
coleenp@548:       Copy::conjoint_oops_atomic(src, dst, length);
coleenp@548:     } else {
coleenp@548:       // slow case: need individual subtype checks
coleenp@548:       // note: don't use obj_at_put below because it includes a redundant store check
coleenp@548:       T* from = src;
coleenp@548:       T* end = from + length;
coleenp@548:       for (T* p = dst; from < end; from++, p++) {
coleenp@548:         // XXX this is going to be slow.
coleenp@548:         T element = *from;
ysr@777:         // even slower now
ysr@777:         bool element_is_null = oopDesc::is_null(element);
ysr@777:         oop new_val = element_is_null ? oop(NULL)
ysr@777:                                       : oopDesc::decode_heap_oop_not_null(element);
ysr@777:         if (element_is_null ||
ysr@777:             Klass::cast((new_val->klass()))->is_subtype_of(bound)) {
ysr@777:           bs->write_ref_field_pre(p, new_val);
coleenp@548:           *p = *from;
coleenp@548:         } else {
coleenp@548:           // We must do a barrier to cover the partial copy.
coleenp@548:           const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);
coleenp@548:           // pointer delta is scaled to number of elements (length field in
coleenp@548:           // objArrayOop) which we assume is 32 bit.
coleenp@548:           assert(pd == (size_t)(int)pd, "length field overflow");
coleenp@548:           const size_t done_word_len = objArrayOopDesc::array_size((int)pd);
coleenp@548:           bs->write_ref_array(MemRegion((HeapWord*)dst, done_word_len));
coleenp@548:           THROW(vmSymbols::java_lang_ArrayStoreException());
coleenp@548:           return;
coleenp@548:         }
coleenp@548:       }
coleenp@548:     }
coleenp@548:   }
coleenp@548:   bs->write_ref_array(MemRegion((HeapWord*)dst, word_len));
coleenp@548: }
coleenp@548: 
duke@435: void objArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
duke@435:                                int dst_pos, int length, TRAPS) {
duke@435:   assert(s->is_objArray(), "must be obj array");
duke@435: 
duke@435:   if (!d->is_objArray()) {
duke@435:     THROW(vmSymbols::java_lang_ArrayStoreException());
duke@435:   }
duke@435: 
duke@435:   // Check is all offsets and lengths are non negative
duke@435:   if (src_pos < 0 || dst_pos < 0 || length < 0) {
duke@435:     THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
duke@435:   }
duke@435:   // Check if the ranges are valid
duke@435:   if  ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
duke@435:      || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
duke@435:     THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
duke@435:   }
duke@435: 
duke@435:   // Special case. Boundary cases must be checked first
duke@435:   // This allows the following call: copy_array(s, s.length(), d.length(), 0).
duke@435:   // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
duke@435:   // points to the right of the last element.
duke@435:   if (length==0) {
duke@435:     return;
duke@435:   }
coleenp@548:   if (UseCompressedOops) {
coleenp@548:     narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);
coleenp@548:     narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);
coleenp@548:     do_copy<narrowOop>(s, src, d, dst, length, CHECK);
duke@435:   } else {
coleenp@548:     oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);
coleenp@548:     oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);
coleenp@548:     do_copy<oop> (s, src, d, dst, length, CHECK);
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: klassOop objArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
duke@435:   objArrayKlassHandle h_this(THREAD, as_klassOop());
duke@435:   return array_klass_impl(h_this, or_null, n, CHECK_NULL);
duke@435: }
duke@435: 
duke@435: 
duke@435: klassOop objArrayKlass::array_klass_impl(objArrayKlassHandle this_oop, bool or_null, int n, TRAPS) {
duke@435: 
duke@435:   assert(this_oop->dimension() <= n, "check order of chain");
duke@435:   int dimension = this_oop->dimension();
duke@435:   if (dimension == n)
duke@435:     return this_oop();
duke@435: 
duke@435:   objArrayKlassHandle ak (THREAD, this_oop->higher_dimension());
duke@435:   if (ak.is_null()) {
duke@435:     if (or_null)  return NULL;
duke@435: 
duke@435:     ResourceMark rm;
duke@435:     JavaThread *jt = (JavaThread *)THREAD;
duke@435:     {
duke@435:       MutexLocker mc(Compile_lock, THREAD);   // for vtables
duke@435:       // Ensure atomic creation of higher dimensions
duke@435:       MutexLocker mu(MultiArray_lock, THREAD);
duke@435: 
duke@435:       // Check if another thread beat us
duke@435:       ak = objArrayKlassHandle(THREAD, this_oop->higher_dimension());
duke@435:       if( ak.is_null() ) {
duke@435: 
duke@435:         // Create multi-dim klass object and link them together
duke@435:         klassOop new_klass =
duke@435:           objArrayKlassKlass::cast(Universe::objArrayKlassKlassObj())->
duke@435:           allocate_objArray_klass(dimension + 1, this_oop, CHECK_NULL);
duke@435:         ak = objArrayKlassHandle(THREAD, new_klass);
duke@435:         this_oop->set_higher_dimension(ak());
duke@435:         ak->set_lower_dimension(this_oop());
duke@435:         assert(ak->oop_is_objArray(), "incorrect initialization of objArrayKlass");
duke@435:       }
duke@435:     }
duke@435:   } else {
duke@435:     CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
duke@435:   }
duke@435: 
duke@435:   if (or_null) {
duke@435:     return ak->array_klass_or_null(n);
duke@435:   }
duke@435:   return ak->array_klass(n, CHECK_NULL);
duke@435: }
duke@435: 
duke@435: klassOop objArrayKlass::array_klass_impl(bool or_null, TRAPS) {
duke@435:   return array_klass_impl(or_null, dimension() +  1, CHECK_NULL);
duke@435: }
duke@435: 
duke@435: bool objArrayKlass::can_be_primary_super_slow() const {
duke@435:   if (!bottom_klass()->klass_part()->can_be_primary_super())
duke@435:     // array of interfaces
duke@435:     return false;
duke@435:   else
duke@435:     return Klass::can_be_primary_super_slow();
duke@435: }
duke@435: 
duke@435: objArrayOop objArrayKlass::compute_secondary_supers(int num_extra_slots, TRAPS) {
duke@435:   // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
duke@435:   objArrayOop es = Klass::cast(element_klass())->secondary_supers();
duke@435:   objArrayHandle elem_supers (THREAD, es);
duke@435:   int num_elem_supers = elem_supers.is_null() ? 0 : elem_supers->length();
duke@435:   int num_secondaries = num_extra_slots + 2 + num_elem_supers;
duke@435:   if (num_secondaries == 2) {
duke@435:     // Must share this for correct bootstrapping!
duke@435:     return Universe::the_array_interfaces_array();
duke@435:   } else {
duke@435:     objArrayOop sec_oop = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL);
duke@435:     objArrayHandle secondaries(THREAD, sec_oop);
duke@435:     secondaries->obj_at_put(num_extra_slots+0, SystemDictionary::cloneable_klass());
duke@435:     secondaries->obj_at_put(num_extra_slots+1, SystemDictionary::serializable_klass());
duke@435:     for (int i = 0; i < num_elem_supers; i++) {
duke@435:       klassOop elem_super = (klassOop) elem_supers->obj_at(i);
duke@435:       klassOop array_super = elem_super->klass_part()->array_klass_or_null();
duke@435:       assert(array_super != NULL, "must already have been created");
duke@435:       secondaries->obj_at_put(num_extra_slots+2+i, array_super);
duke@435:     }
duke@435:     return secondaries();
duke@435:   }
duke@435: }
duke@435: 
duke@435: bool objArrayKlass::compute_is_subtype_of(klassOop k) {
duke@435:   if (!k->klass_part()->oop_is_objArray())
duke@435:     return arrayKlass::compute_is_subtype_of(k);
duke@435: 
duke@435:   objArrayKlass* oak = objArrayKlass::cast(k);
duke@435:   return element_klass()->klass_part()->is_subtype_of(oak->element_klass());
duke@435: }
duke@435: 
duke@435: void objArrayKlass::initialize(TRAPS) {
duke@435:   Klass::cast(bottom_klass())->initialize(THREAD);  // dispatches to either instanceKlass or typeArrayKlass
duke@435: }
duke@435: 
coleenp@548: #define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \
coleenp@548: {                                   \
coleenp@548:   T* p         = (T*)(a)->base();   \
coleenp@548:   T* const end = p + (a)->length(); \
coleenp@548:   while (p < end) {                 \
coleenp@548:     do_oop;                         \
coleenp@548:     p++;                            \
coleenp@548:   }                                 \
coleenp@548: }
coleenp@548: 
coleenp@548: #define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \
coleenp@548: {                                   \
coleenp@548:   T* const l = (T*)(low);           \
coleenp@548:   T* const h = (T*)(high);          \
coleenp@548:   T* p       = (T*)(a)->base();     \
coleenp@548:   T* end     = p + (a)->length();   \
coleenp@548:   if (p < l) p = l;                 \
coleenp@548:   if (end > h) end = h;             \
coleenp@548:   while (p < end) {                 \
coleenp@548:     do_oop;                         \
coleenp@548:     ++p;                            \
coleenp@548:   }                                 \
coleenp@548: }
coleenp@548: 
coleenp@548: #define ObjArrayKlass_OOP_ITERATE(a, p, do_oop)      \
coleenp@548:   if (UseCompressedOops) {                           \
coleenp@548:     ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
coleenp@548:       a, p, do_oop)                                  \
coleenp@548:   } else {                                           \
coleenp@548:     ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop,       \
coleenp@548:       a, p, do_oop)                                  \
coleenp@548:   }
coleenp@548: 
coleenp@548: #define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \
coleenp@548:   if (UseCompressedOops) {                                   \
coleenp@548:     ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
coleenp@548:       a, p, low, high, do_oop)                               \
coleenp@548:   } else {                                                   \
coleenp@548:     ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop,       \
coleenp@548:       a, p, low, high, do_oop)                               \
coleenp@548:   }
duke@435: 
duke@435: void objArrayKlass::oop_follow_contents(oop obj) {
duke@435:   assert (obj->is_array(), "obj must be array");
coleenp@548:   objArrayOop a = objArrayOop(obj);
duke@435:   a->follow_header();
coleenp@548:   ObjArrayKlass_OOP_ITERATE( \
coleenp@548:     a, p, \
coleenp@548:     /* we call mark_and_follow here to avoid excessive marking stack usage */ \
coleenp@548:     MarkSweep::mark_and_follow(p))
duke@435: }
duke@435: 
duke@435: #ifndef SERIALGC
duke@435: void objArrayKlass::oop_follow_contents(ParCompactionManager* cm,
duke@435:                                         oop obj) {
duke@435:   assert (obj->is_array(), "obj must be array");
coleenp@548:   objArrayOop a = objArrayOop(obj);
duke@435:   a->follow_header(cm);
coleenp@548:   ObjArrayKlass_OOP_ITERATE( \
coleenp@548:     a, p, \
coleenp@548:     /* we call mark_and_follow here to avoid excessive marking stack usage */ \
coleenp@548:     PSParallelCompact::mark_and_follow(cm, p))
duke@435: }
duke@435: #endif // SERIALGC
duke@435: 
duke@435: #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix)           \
duke@435:                                                                                 \
duke@435: int objArrayKlass::oop_oop_iterate##nv_suffix(oop obj,                          \
duke@435:                                               OopClosureType* closure) {        \
duke@435:   SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
duke@435:   assert (obj->is_array(), "obj must be array");                                \
duke@435:   objArrayOop a = objArrayOop(obj);                                             \
duke@435:   /* Get size before changing pointers. */                                      \
duke@435:   /* Don't call size() or oop_size() since that is a virtual call. */           \
duke@435:   int size = a->object_size();                                                  \
duke@435:   if (closure->do_header()) {                                                   \
duke@435:     a->oop_iterate_header(closure);                                             \
duke@435:   }                                                                             \
coleenp@548:   ObjArrayKlass_OOP_ITERATE(a, p, (closure)->do_oop##nv_suffix(p))              \
duke@435:   return size;                                                                  \
duke@435: }
duke@435: 
duke@435: #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix)         \
duke@435:                                                                                 \
duke@435: int objArrayKlass::oop_oop_iterate##nv_suffix##_m(oop obj,                      \
duke@435:                                                   OopClosureType* closure,      \
duke@435:                                                   MemRegion mr) {               \
duke@435:   SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
duke@435:   assert(obj->is_array(), "obj must be array");                                 \
duke@435:   objArrayOop a  = objArrayOop(obj);                                            \
duke@435:   /* Get size before changing pointers. */                                      \
duke@435:   /* Don't call size() or oop_size() since that is a virtual call */            \
duke@435:   int size = a->object_size();                                                  \
duke@435:   if (closure->do_header()) {                                                   \
duke@435:     a->oop_iterate_header(closure, mr);                                         \
duke@435:   }                                                                             \
coleenp@548:   ObjArrayKlass_BOUNDED_OOP_ITERATE(                                            \
coleenp@548:     a, p, mr.start(), mr.end(), (closure)->do_oop##nv_suffix(p))                \
coleenp@548:   return size;                                                                  \
coleenp@548: }
coleenp@548: 
coleenp@548: // Like oop_oop_iterate but only iterates over a specified range and only used
coleenp@548: // for objArrayOops.
coleenp@548: #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r(OopClosureType, nv_suffix)         \
coleenp@548:                                                                                 \
coleenp@548: int objArrayKlass::oop_oop_iterate_range##nv_suffix(oop obj,                    \
coleenp@548:                                                   OopClosureType* closure,      \
coleenp@548:                                                   int start, int end) {         \
coleenp@548:   SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
coleenp@548:   assert(obj->is_array(), "obj must be array");                                 \
coleenp@548:   objArrayOop a  = objArrayOop(obj);                                            \
coleenp@548:   /* Get size before changing pointers. */                                      \
coleenp@548:   /* Don't call size() or oop_size() since that is a virtual call */            \
coleenp@548:   int size = a->object_size();                                                  \
coleenp@548:   if (UseCompressedOops) {                                                      \
coleenp@548:     HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<narrowOop>(start);\
coleenp@548:     /* this might be wierd if end needs to be aligned on HeapWord boundary */   \
coleenp@548:     HeapWord* high = (HeapWord*)((narrowOop*)a->base() + end);                  \
coleenp@548:     MemRegion mr(low, high);                                                    \
coleenp@548:     if (closure->do_header()) {                                                 \
coleenp@548:       a->oop_iterate_header(closure, mr);                                       \
duke@435:     }                                                                           \
coleenp@548:     ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop,                    \
coleenp@548:       a, p, low, high, (closure)->do_oop##nv_suffix(p))                         \
duke@435:   } else {                                                                      \
coleenp@548:     HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<oop>(start);  \
coleenp@548:     HeapWord* high = (HeapWord*)((oop*)a->base() + end);                        \
coleenp@548:     MemRegion mr(low, high);                                                    \
coleenp@548:     if (closure->do_header()) {                                                 \
coleenp@548:       a->oop_iterate_header(closure, mr);                                       \
duke@435:     }                                                                           \
coleenp@548:     ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop,                          \
coleenp@548:       a, p, low, high, (closure)->do_oop##nv_suffix(p))                         \
duke@435:   }                                                                             \
duke@435:   return size;                                                                  \
duke@435: }
duke@435: 
duke@435: ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
ysr@777: ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
duke@435: ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
ysr@777: ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
coleenp@548: ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
ysr@777: ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
duke@435: 
duke@435: int objArrayKlass::oop_adjust_pointers(oop obj) {
duke@435:   assert(obj->is_objArray(), "obj must be obj array");
duke@435:   objArrayOop a = objArrayOop(obj);
duke@435:   // Get size before changing pointers.
duke@435:   // Don't call size() or oop_size() since that is a virtual call.
duke@435:   int size = a->object_size();
duke@435:   a->adjust_header();
coleenp@548:   ObjArrayKlass_OOP_ITERATE(a, p, MarkSweep::adjust_pointer(p))
duke@435:   return size;
duke@435: }
duke@435: 
duke@435: #ifndef SERIALGC
duke@435: void objArrayKlass::oop_copy_contents(PSPromotionManager* pm, oop obj) {
duke@435:   assert(!pm->depth_first(), "invariant");
duke@435:   assert(obj->is_objArray(), "obj must be obj array");
coleenp@548:   ObjArrayKlass_OOP_ITERATE( \
coleenp@548:     objArrayOop(obj), p, \
coleenp@548:     if (PSScavenge::should_scavenge(p)) { \
coleenp@548:       pm->claim_or_forward_breadth(p); \
coleenp@548:     })
duke@435: }
duke@435: 
duke@435: void objArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
duke@435:   assert(pm->depth_first(), "invariant");
duke@435:   assert(obj->is_objArray(), "obj must be obj array");
coleenp@548:   ObjArrayKlass_OOP_ITERATE( \
coleenp@548:     objArrayOop(obj), p, \
coleenp@548:     if (PSScavenge::should_scavenge(p)) { \
coleenp@548:       pm->claim_or_forward_depth(p); \
coleenp@548:     })
duke@435: }
duke@435: 
duke@435: int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
duke@435:   assert (obj->is_objArray(), "obj must be obj array");
duke@435:   objArrayOop a = objArrayOop(obj);
coleenp@548:   ObjArrayKlass_OOP_ITERATE(a, p, PSParallelCompact::adjust_pointer(p))
duke@435:   return a->object_size();
duke@435: }
duke@435: 
duke@435: int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj,
duke@435:                                        HeapWord* beg_addr, HeapWord* end_addr) {
duke@435:   assert (obj->is_objArray(), "obj must be obj array");
duke@435:   objArrayOop a = objArrayOop(obj);
coleenp@548:   ObjArrayKlass_BOUNDED_OOP_ITERATE( \
coleenp@548:      a, p, beg_addr, end_addr, \
coleenp@548:      PSParallelCompact::adjust_pointer(p))
duke@435:   return a->object_size();
duke@435: }
duke@435: #endif // SERIALGC
duke@435: 
duke@435: // JVM support
duke@435: 
duke@435: jint objArrayKlass::compute_modifier_flags(TRAPS) const {
duke@435:   // The modifier for an objectArray is the same as its element
duke@435:   if (element_klass() == NULL) {
duke@435:     assert(Universe::is_bootstrapping(), "partial objArray only at startup");
duke@435:     return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
duke@435:   }
coleenp@833:   // Return the flags of the bottom element type.
coleenp@833:   jint element_flags = Klass::cast(bottom_klass())->compute_modifier_flags(CHECK_0);
duke@435: 
duke@435:   return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
duke@435:                         | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
duke@435: }
duke@435: 
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: // Printing
duke@435: 
duke@435: void objArrayKlass::oop_print_on(oop obj, outputStream* st) {
duke@435:   arrayKlass::oop_print_on(obj, st);
duke@435:   assert(obj->is_objArray(), "must be objArray");
duke@435:   objArrayOop oa = objArrayOop(obj);
duke@435:   int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
duke@435:   for(int index = 0; index < print_len; index++) {
duke@435:     st->print(" - %3d : ", index);
duke@435:     oa->obj_at(index)->print_value_on(st);
duke@435:     st->cr();
duke@435:   }
duke@435:   int remaining = oa->length() - print_len;
duke@435:   if (remaining > 0) {
duke@435:     tty->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
duke@435:   }
duke@435: }
duke@435: 
jrose@1100: static int max_objArray_print_length = 4;
duke@435: 
duke@435: void objArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
duke@435:   assert(obj->is_objArray(), "must be objArray");
jrose@1100:   st->print("a ");
duke@435:   element_klass()->print_value_on(st);
jrose@1100:   int len = objArrayOop(obj)->length();
jrose@1100:   st->print("[%d] ", len);
jrose@1100:   obj->print_address_on(st);
jrose@1100:   if (PrintOopAddress || PrintMiscellaneous && (WizardMode || Verbose)) {
jrose@1100:     st->print("{");
jrose@1100:     for (int i = 0; i < len; i++) {
jrose@1100:       if (i > max_objArray_print_length) {
jrose@1100:         st->print("..."); break;
jrose@1100:       }
jrose@1100:       st->print(" "INTPTR_FORMAT, (intptr_t)(void*)objArrayOop(obj)->obj_at(i));
jrose@1100:     }
jrose@1100:     st->print(" }");
jrose@1100:   }
duke@435: }
duke@435: 
duke@435: #endif // PRODUCT
duke@435: 
duke@435: const char* objArrayKlass::internal_name() const {
duke@435:   return external_name();
duke@435: }
duke@435: 
duke@435: // Verification
duke@435: 
duke@435: void objArrayKlass::oop_verify_on(oop obj, outputStream* st) {
duke@435:   arrayKlass::oop_verify_on(obj, st);
duke@435:   guarantee(obj->is_objArray(), "must be objArray");
duke@435:   objArrayOop oa = objArrayOop(obj);
duke@435:   for(int index = 0; index < oa->length(); index++) {
duke@435:     guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop");
duke@435:   }
duke@435: }
duke@435: 
duke@435: void objArrayKlass::oop_verify_old_oop(oop obj, oop* p, bool allow_dirty) {
duke@435:   /* $$$ move into remembered set verification?
duke@435:   RememberedSet::verify_old_oop(obj, p, allow_dirty, true);
duke@435:   */
duke@435: }
coleenp@548: void objArrayKlass::oop_verify_old_oop(oop obj, narrowOop* p, bool allow_dirty) {}