Wed, 05 Dec 2007 09:00:00 -0800
6664627: Merge changes made only in hotspot 11 forward to jdk 7
Reviewed-by: jcoomes
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_objArrayKlass.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | int objArrayKlass::oop_size(oop obj) const { |
duke@435 | 29 | assert(obj->is_objArray(), "must be object array"); |
duke@435 | 30 | return objArrayOop(obj)->object_size(); |
duke@435 | 31 | } |
duke@435 | 32 | |
duke@435 | 33 | objArrayOop objArrayKlass::allocate(int length, TRAPS) { |
duke@435 | 34 | if (length >= 0) { |
duke@435 | 35 | if (length <= arrayOopDesc::max_array_length(T_OBJECT)) { |
duke@435 | 36 | int size = objArrayOopDesc::object_size(length); |
duke@435 | 37 | KlassHandle h_k(THREAD, as_klassOop()); |
duke@435 | 38 | objArrayOop a = (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, CHECK_NULL); |
duke@435 | 39 | assert(a->is_parsable(), "Can't publish unless parsable"); |
duke@435 | 40 | return a; |
duke@435 | 41 | } else { |
duke@435 | 42 | THROW_OOP_0(Universe::out_of_memory_error_array_size()); |
duke@435 | 43 | } |
duke@435 | 44 | } else { |
duke@435 | 45 | THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); |
duke@435 | 46 | } |
duke@435 | 47 | } |
duke@435 | 48 | |
duke@435 | 49 | static int multi_alloc_counter = 0; |
duke@435 | 50 | |
duke@435 | 51 | oop objArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) { |
duke@435 | 52 | int length = *sizes; |
duke@435 | 53 | // Call to lower_dimension uses this pointer, so most be called before a |
duke@435 | 54 | // possible GC |
duke@435 | 55 | KlassHandle h_lower_dimension(THREAD, lower_dimension()); |
duke@435 | 56 | // If length < 0 allocate will throw an exception. |
duke@435 | 57 | objArrayOop array = allocate(length, CHECK_NULL); |
duke@435 | 58 | assert(array->is_parsable(), "Don't handlize unless parsable"); |
duke@435 | 59 | objArrayHandle h_array (THREAD, array); |
duke@435 | 60 | if (rank > 1) { |
duke@435 | 61 | if (length != 0) { |
duke@435 | 62 | for (int index = 0; index < length; index++) { |
duke@435 | 63 | arrayKlass* ak = arrayKlass::cast(h_lower_dimension()); |
duke@435 | 64 | oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL); |
duke@435 | 65 | assert(sub_array->is_parsable(), "Don't publish until parsable"); |
duke@435 | 66 | h_array->obj_at_put(index, sub_array); |
duke@435 | 67 | } |
duke@435 | 68 | } else { |
duke@435 | 69 | // Since this array dimension has zero length, nothing will be |
duke@435 | 70 | // allocated, however the lower dimension values must be checked |
duke@435 | 71 | // for illegal values. |
duke@435 | 72 | for (int i = 0; i < rank - 1; ++i) { |
duke@435 | 73 | sizes += 1; |
duke@435 | 74 | if (*sizes < 0) { |
duke@435 | 75 | THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); |
duke@435 | 76 | } |
duke@435 | 77 | } |
duke@435 | 78 | } |
duke@435 | 79 | } |
duke@435 | 80 | return h_array(); |
duke@435 | 81 | } |
duke@435 | 82 | |
duke@435 | 83 | void objArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d, |
duke@435 | 84 | int dst_pos, int length, TRAPS) { |
duke@435 | 85 | assert(s->is_objArray(), "must be obj array"); |
duke@435 | 86 | |
duke@435 | 87 | if (!d->is_objArray()) { |
duke@435 | 88 | THROW(vmSymbols::java_lang_ArrayStoreException()); |
duke@435 | 89 | } |
duke@435 | 90 | |
duke@435 | 91 | // Check is all offsets and lengths are non negative |
duke@435 | 92 | if (src_pos < 0 || dst_pos < 0 || length < 0) { |
duke@435 | 93 | THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException()); |
duke@435 | 94 | } |
duke@435 | 95 | // Check if the ranges are valid |
duke@435 | 96 | if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) |
duke@435 | 97 | || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) { |
duke@435 | 98 | THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException()); |
duke@435 | 99 | } |
duke@435 | 100 | |
duke@435 | 101 | // Special case. Boundary cases must be checked first |
duke@435 | 102 | // This allows the following call: copy_array(s, s.length(), d.length(), 0). |
duke@435 | 103 | // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(), |
duke@435 | 104 | // points to the right of the last element. |
duke@435 | 105 | if (length==0) { |
duke@435 | 106 | return; |
duke@435 | 107 | } |
duke@435 | 108 | |
duke@435 | 109 | oop* const src = objArrayOop(s)->obj_at_addr(src_pos); |
duke@435 | 110 | oop* const dst = objArrayOop(d)->obj_at_addr(dst_pos); |
duke@435 | 111 | const size_t word_len = length * HeapWordsPerOop; |
duke@435 | 112 | |
duke@435 | 113 | // For performance reasons, we assume we are using a card marking write |
duke@435 | 114 | // barrier. The assert will fail if this is not the case. |
duke@435 | 115 | BarrierSet* bs = Universe::heap()->barrier_set(); |
duke@435 | 116 | assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); |
duke@435 | 117 | |
duke@435 | 118 | if (s == d) { |
duke@435 | 119 | // since source and destination are equal we do not need conversion checks. |
duke@435 | 120 | assert(length > 0, "sanity check"); |
duke@435 | 121 | Copy::conjoint_oops_atomic(src, dst, length); |
duke@435 | 122 | } else { |
duke@435 | 123 | // We have to make sure all elements conform to the destination array |
duke@435 | 124 | klassOop bound = objArrayKlass::cast(d->klass())->element_klass(); |
duke@435 | 125 | klassOop stype = objArrayKlass::cast(s->klass())->element_klass(); |
duke@435 | 126 | if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) { |
duke@435 | 127 | // elements are guaranteed to be subtypes, so no check necessary |
duke@435 | 128 | Copy::conjoint_oops_atomic(src, dst, length); |
duke@435 | 129 | } else { |
duke@435 | 130 | // slow case: need individual subtype checks |
duke@435 | 131 | // note: don't use obj_at_put below because it includes a redundant store check |
duke@435 | 132 | oop* from = src; |
duke@435 | 133 | oop* end = from + length; |
duke@435 | 134 | for (oop* p = dst; from < end; from++, p++) { |
duke@435 | 135 | oop element = *from; |
duke@435 | 136 | if (element == NULL || Klass::cast(element->klass())->is_subtype_of(bound)) { |
duke@435 | 137 | *p = element; |
duke@435 | 138 | } else { |
duke@435 | 139 | // We must do a barrier to cover the partial copy. |
duke@435 | 140 | const size_t done_word_len = pointer_delta(p, dst, oopSize) * |
duke@435 | 141 | HeapWordsPerOop; |
duke@435 | 142 | bs->write_ref_array(MemRegion((HeapWord*)dst, done_word_len)); |
duke@435 | 143 | THROW(vmSymbols::java_lang_ArrayStoreException()); |
duke@435 | 144 | return; |
duke@435 | 145 | } |
duke@435 | 146 | } |
duke@435 | 147 | } |
duke@435 | 148 | } |
duke@435 | 149 | bs->write_ref_array(MemRegion((HeapWord*)dst, word_len)); |
duke@435 | 150 | } |
duke@435 | 151 | |
duke@435 | 152 | |
duke@435 | 153 | klassOop objArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) { |
duke@435 | 154 | objArrayKlassHandle h_this(THREAD, as_klassOop()); |
duke@435 | 155 | return array_klass_impl(h_this, or_null, n, CHECK_NULL); |
duke@435 | 156 | } |
duke@435 | 157 | |
duke@435 | 158 | |
duke@435 | 159 | klassOop objArrayKlass::array_klass_impl(objArrayKlassHandle this_oop, bool or_null, int n, TRAPS) { |
duke@435 | 160 | |
duke@435 | 161 | assert(this_oop->dimension() <= n, "check order of chain"); |
duke@435 | 162 | int dimension = this_oop->dimension(); |
duke@435 | 163 | if (dimension == n) |
duke@435 | 164 | return this_oop(); |
duke@435 | 165 | |
duke@435 | 166 | objArrayKlassHandle ak (THREAD, this_oop->higher_dimension()); |
duke@435 | 167 | if (ak.is_null()) { |
duke@435 | 168 | if (or_null) return NULL; |
duke@435 | 169 | |
duke@435 | 170 | ResourceMark rm; |
duke@435 | 171 | JavaThread *jt = (JavaThread *)THREAD; |
duke@435 | 172 | { |
duke@435 | 173 | MutexLocker mc(Compile_lock, THREAD); // for vtables |
duke@435 | 174 | // Ensure atomic creation of higher dimensions |
duke@435 | 175 | MutexLocker mu(MultiArray_lock, THREAD); |
duke@435 | 176 | |
duke@435 | 177 | // Check if another thread beat us |
duke@435 | 178 | ak = objArrayKlassHandle(THREAD, this_oop->higher_dimension()); |
duke@435 | 179 | if( ak.is_null() ) { |
duke@435 | 180 | |
duke@435 | 181 | // Create multi-dim klass object and link them together |
duke@435 | 182 | klassOop new_klass = |
duke@435 | 183 | objArrayKlassKlass::cast(Universe::objArrayKlassKlassObj())-> |
duke@435 | 184 | allocate_objArray_klass(dimension + 1, this_oop, CHECK_NULL); |
duke@435 | 185 | ak = objArrayKlassHandle(THREAD, new_klass); |
duke@435 | 186 | this_oop->set_higher_dimension(ak()); |
duke@435 | 187 | ak->set_lower_dimension(this_oop()); |
duke@435 | 188 | assert(ak->oop_is_objArray(), "incorrect initialization of objArrayKlass"); |
duke@435 | 189 | } |
duke@435 | 190 | } |
duke@435 | 191 | } else { |
duke@435 | 192 | CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops()); |
duke@435 | 193 | } |
duke@435 | 194 | |
duke@435 | 195 | if (or_null) { |
duke@435 | 196 | return ak->array_klass_or_null(n); |
duke@435 | 197 | } |
duke@435 | 198 | return ak->array_klass(n, CHECK_NULL); |
duke@435 | 199 | } |
duke@435 | 200 | |
duke@435 | 201 | klassOop objArrayKlass::array_klass_impl(bool or_null, TRAPS) { |
duke@435 | 202 | return array_klass_impl(or_null, dimension() + 1, CHECK_NULL); |
duke@435 | 203 | } |
duke@435 | 204 | |
duke@435 | 205 | bool objArrayKlass::can_be_primary_super_slow() const { |
duke@435 | 206 | if (!bottom_klass()->klass_part()->can_be_primary_super()) |
duke@435 | 207 | // array of interfaces |
duke@435 | 208 | return false; |
duke@435 | 209 | else |
duke@435 | 210 | return Klass::can_be_primary_super_slow(); |
duke@435 | 211 | } |
duke@435 | 212 | |
duke@435 | 213 | objArrayOop objArrayKlass::compute_secondary_supers(int num_extra_slots, TRAPS) { |
duke@435 | 214 | // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... }; |
duke@435 | 215 | objArrayOop es = Klass::cast(element_klass())->secondary_supers(); |
duke@435 | 216 | objArrayHandle elem_supers (THREAD, es); |
duke@435 | 217 | int num_elem_supers = elem_supers.is_null() ? 0 : elem_supers->length(); |
duke@435 | 218 | int num_secondaries = num_extra_slots + 2 + num_elem_supers; |
duke@435 | 219 | if (num_secondaries == 2) { |
duke@435 | 220 | // Must share this for correct bootstrapping! |
duke@435 | 221 | return Universe::the_array_interfaces_array(); |
duke@435 | 222 | } else { |
duke@435 | 223 | objArrayOop sec_oop = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL); |
duke@435 | 224 | objArrayHandle secondaries(THREAD, sec_oop); |
duke@435 | 225 | secondaries->obj_at_put(num_extra_slots+0, SystemDictionary::cloneable_klass()); |
duke@435 | 226 | secondaries->obj_at_put(num_extra_slots+1, SystemDictionary::serializable_klass()); |
duke@435 | 227 | for (int i = 0; i < num_elem_supers; i++) { |
duke@435 | 228 | klassOop elem_super = (klassOop) elem_supers->obj_at(i); |
duke@435 | 229 | klassOop array_super = elem_super->klass_part()->array_klass_or_null(); |
duke@435 | 230 | assert(array_super != NULL, "must already have been created"); |
duke@435 | 231 | secondaries->obj_at_put(num_extra_slots+2+i, array_super); |
duke@435 | 232 | } |
duke@435 | 233 | return secondaries(); |
duke@435 | 234 | } |
duke@435 | 235 | } |
duke@435 | 236 | |
duke@435 | 237 | bool objArrayKlass::compute_is_subtype_of(klassOop k) { |
duke@435 | 238 | if (!k->klass_part()->oop_is_objArray()) |
duke@435 | 239 | return arrayKlass::compute_is_subtype_of(k); |
duke@435 | 240 | |
duke@435 | 241 | objArrayKlass* oak = objArrayKlass::cast(k); |
duke@435 | 242 | return element_klass()->klass_part()->is_subtype_of(oak->element_klass()); |
duke@435 | 243 | } |
duke@435 | 244 | |
duke@435 | 245 | |
duke@435 | 246 | void objArrayKlass::initialize(TRAPS) { |
duke@435 | 247 | Klass::cast(bottom_klass())->initialize(THREAD); // dispatches to either instanceKlass or typeArrayKlass |
duke@435 | 248 | } |
duke@435 | 249 | |
duke@435 | 250 | |
duke@435 | 251 | void objArrayKlass::oop_follow_contents(oop obj) { |
duke@435 | 252 | assert (obj->is_array(), "obj must be array"); |
duke@435 | 253 | arrayOop a = arrayOop(obj); |
duke@435 | 254 | a->follow_header(); |
duke@435 | 255 | oop* base = (oop*)a->base(T_OBJECT); |
duke@435 | 256 | oop* const end = base + a->length(); |
duke@435 | 257 | while (base < end) { |
duke@435 | 258 | if (*base != NULL) |
duke@435 | 259 | // we call mark_and_follow here to avoid excessive marking stack usage |
duke@435 | 260 | MarkSweep::mark_and_follow(base); |
duke@435 | 261 | base++; |
duke@435 | 262 | } |
duke@435 | 263 | } |
duke@435 | 264 | |
duke@435 | 265 | #ifndef SERIALGC |
duke@435 | 266 | void objArrayKlass::oop_follow_contents(ParCompactionManager* cm, |
duke@435 | 267 | oop obj) { |
duke@435 | 268 | assert (obj->is_array(), "obj must be array"); |
duke@435 | 269 | arrayOop a = arrayOop(obj); |
duke@435 | 270 | a->follow_header(cm); |
duke@435 | 271 | oop* base = (oop*)a->base(T_OBJECT); |
duke@435 | 272 | oop* const end = base + a->length(); |
duke@435 | 273 | while (base < end) { |
duke@435 | 274 | if (*base != NULL) |
duke@435 | 275 | // we call mark_and_follow here to avoid excessive marking stack usage |
duke@435 | 276 | PSParallelCompact::mark_and_follow(cm, base); |
duke@435 | 277 | base++; |
duke@435 | 278 | } |
duke@435 | 279 | } |
duke@435 | 280 | #endif // SERIALGC |
duke@435 | 281 | |
duke@435 | 282 | #define invoke_closure_on(base, closure, nv_suffix) { \ |
duke@435 | 283 | if (*(base) != NULL) { \ |
duke@435 | 284 | (closure)->do_oop##nv_suffix(base); \ |
duke@435 | 285 | } \ |
duke@435 | 286 | } |
duke@435 | 287 | |
duke@435 | 288 | #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \ |
duke@435 | 289 | \ |
duke@435 | 290 | int objArrayKlass::oop_oop_iterate##nv_suffix(oop obj, \ |
duke@435 | 291 | OopClosureType* closure) { \ |
duke@435 | 292 | SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \ |
duke@435 | 293 | assert (obj->is_array(), "obj must be array"); \ |
duke@435 | 294 | objArrayOop a = objArrayOop(obj); \ |
duke@435 | 295 | /* Get size before changing pointers. */ \ |
duke@435 | 296 | /* Don't call size() or oop_size() since that is a virtual call. */ \ |
duke@435 | 297 | int size = a->object_size(); \ |
duke@435 | 298 | if (closure->do_header()) { \ |
duke@435 | 299 | a->oop_iterate_header(closure); \ |
duke@435 | 300 | } \ |
duke@435 | 301 | oop* base = a->base(); \ |
duke@435 | 302 | oop* const end = base + a->length(); \ |
duke@435 | 303 | const intx field_offset = PrefetchFieldsAhead; \ |
duke@435 | 304 | if (field_offset > 0) { \ |
duke@435 | 305 | while (base < end) { \ |
duke@435 | 306 | prefetch_beyond(base, end, field_offset, closure->prefetch_style()); \ |
duke@435 | 307 | invoke_closure_on(base, closure, nv_suffix); \ |
duke@435 | 308 | base++; \ |
duke@435 | 309 | } \ |
duke@435 | 310 | } else { \ |
duke@435 | 311 | while (base < end) { \ |
duke@435 | 312 | invoke_closure_on(base, closure, nv_suffix); \ |
duke@435 | 313 | base++; \ |
duke@435 | 314 | } \ |
duke@435 | 315 | } \ |
duke@435 | 316 | return size; \ |
duke@435 | 317 | } |
duke@435 | 318 | |
duke@435 | 319 | #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \ |
duke@435 | 320 | \ |
duke@435 | 321 | int objArrayKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \ |
duke@435 | 322 | OopClosureType* closure, \ |
duke@435 | 323 | MemRegion mr) { \ |
duke@435 | 324 | SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \ |
duke@435 | 325 | assert(obj->is_array(), "obj must be array"); \ |
duke@435 | 326 | objArrayOop a = objArrayOop(obj); \ |
duke@435 | 327 | /* Get size before changing pointers. */ \ |
duke@435 | 328 | /* Don't call size() or oop_size() since that is a virtual call */ \ |
duke@435 | 329 | int size = a->object_size(); \ |
duke@435 | 330 | if (closure->do_header()) { \ |
duke@435 | 331 | a->oop_iterate_header(closure, mr); \ |
duke@435 | 332 | } \ |
duke@435 | 333 | oop* bottom = (oop*)mr.start(); \ |
duke@435 | 334 | oop* top = (oop*)mr.end(); \ |
duke@435 | 335 | oop* base = a->base(); \ |
duke@435 | 336 | oop* end = base + a->length(); \ |
duke@435 | 337 | if (base < bottom) { \ |
duke@435 | 338 | base = bottom; \ |
duke@435 | 339 | } \ |
duke@435 | 340 | if (end > top) { \ |
duke@435 | 341 | end = top; \ |
duke@435 | 342 | } \ |
duke@435 | 343 | const intx field_offset = PrefetchFieldsAhead; \ |
duke@435 | 344 | if (field_offset > 0) { \ |
duke@435 | 345 | while (base < end) { \ |
duke@435 | 346 | prefetch_beyond(base, end, field_offset, closure->prefetch_style()); \ |
duke@435 | 347 | invoke_closure_on(base, closure, nv_suffix); \ |
duke@435 | 348 | base++; \ |
duke@435 | 349 | } \ |
duke@435 | 350 | } else { \ |
duke@435 | 351 | while (base < end) { \ |
duke@435 | 352 | invoke_closure_on(base, closure, nv_suffix); \ |
duke@435 | 353 | base++; \ |
duke@435 | 354 | } \ |
duke@435 | 355 | } \ |
duke@435 | 356 | return size; \ |
duke@435 | 357 | } |
duke@435 | 358 | |
duke@435 | 359 | ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN) |
duke@435 | 360 | ALL_OOP_OOP_ITERATE_CLOSURES_3(ObjArrayKlass_OOP_OOP_ITERATE_DEFN) |
duke@435 | 361 | ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m) |
duke@435 | 362 | ALL_OOP_OOP_ITERATE_CLOSURES_3(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m) |
duke@435 | 363 | |
duke@435 | 364 | int objArrayKlass::oop_adjust_pointers(oop obj) { |
duke@435 | 365 | assert(obj->is_objArray(), "obj must be obj array"); |
duke@435 | 366 | objArrayOop a = objArrayOop(obj); |
duke@435 | 367 | // Get size before changing pointers. |
duke@435 | 368 | // Don't call size() or oop_size() since that is a virtual call. |
duke@435 | 369 | int size = a->object_size(); |
duke@435 | 370 | a->adjust_header(); |
duke@435 | 371 | oop* base = a->base(); |
duke@435 | 372 | oop* const end = base + a->length(); |
duke@435 | 373 | while (base < end) { |
duke@435 | 374 | MarkSweep::adjust_pointer(base); |
duke@435 | 375 | base++; |
duke@435 | 376 | } |
duke@435 | 377 | return size; |
duke@435 | 378 | } |
duke@435 | 379 | |
duke@435 | 380 | #ifndef SERIALGC |
duke@435 | 381 | void objArrayKlass::oop_copy_contents(PSPromotionManager* pm, oop obj) { |
duke@435 | 382 | assert(!pm->depth_first(), "invariant"); |
duke@435 | 383 | assert(obj->is_objArray(), "obj must be obj array"); |
duke@435 | 384 | // Compute oop range |
duke@435 | 385 | oop* curr = objArrayOop(obj)->base(); |
duke@435 | 386 | oop* end = curr + objArrayOop(obj)->length(); |
duke@435 | 387 | // assert(align_object_size(end - (oop*)obj) == oop_size(obj), "checking size"); |
duke@435 | 388 | assert(align_object_size(pointer_delta(end, obj, sizeof(oop*))) |
duke@435 | 389 | == oop_size(obj), "checking size"); |
duke@435 | 390 | |
duke@435 | 391 | // Iterate over oops |
duke@435 | 392 | while (curr < end) { |
duke@435 | 393 | if (PSScavenge::should_scavenge(*curr)) { |
duke@435 | 394 | pm->claim_or_forward_breadth(curr); |
duke@435 | 395 | } |
duke@435 | 396 | ++curr; |
duke@435 | 397 | } |
duke@435 | 398 | } |
duke@435 | 399 | |
duke@435 | 400 | void objArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { |
duke@435 | 401 | assert(pm->depth_first(), "invariant"); |
duke@435 | 402 | assert(obj->is_objArray(), "obj must be obj array"); |
duke@435 | 403 | // Compute oop range |
duke@435 | 404 | oop* curr = objArrayOop(obj)->base(); |
duke@435 | 405 | oop* end = curr + objArrayOop(obj)->length(); |
duke@435 | 406 | // assert(align_object_size(end - (oop*)obj) == oop_size(obj), "checking size"); |
duke@435 | 407 | assert(align_object_size(pointer_delta(end, obj, sizeof(oop*))) |
duke@435 | 408 | == oop_size(obj), "checking size"); |
duke@435 | 409 | |
duke@435 | 410 | // Iterate over oops |
duke@435 | 411 | while (curr < end) { |
duke@435 | 412 | if (PSScavenge::should_scavenge(*curr)) { |
duke@435 | 413 | pm->claim_or_forward_depth(curr); |
duke@435 | 414 | } |
duke@435 | 415 | ++curr; |
duke@435 | 416 | } |
duke@435 | 417 | } |
duke@435 | 418 | |
duke@435 | 419 | int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { |
duke@435 | 420 | assert (obj->is_objArray(), "obj must be obj array"); |
duke@435 | 421 | objArrayOop a = objArrayOop(obj); |
duke@435 | 422 | |
duke@435 | 423 | oop* const base = a->base(); |
duke@435 | 424 | oop* const beg_oop = base; |
duke@435 | 425 | oop* const end_oop = base + a->length(); |
duke@435 | 426 | for (oop* cur_oop = beg_oop; cur_oop < end_oop; ++cur_oop) { |
duke@435 | 427 | PSParallelCompact::adjust_pointer(cur_oop); |
duke@435 | 428 | } |
duke@435 | 429 | return a->object_size(); |
duke@435 | 430 | } |
duke@435 | 431 | |
duke@435 | 432 | int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, |
duke@435 | 433 | HeapWord* beg_addr, HeapWord* end_addr) { |
duke@435 | 434 | assert (obj->is_objArray(), "obj must be obj array"); |
duke@435 | 435 | objArrayOop a = objArrayOop(obj); |
duke@435 | 436 | |
duke@435 | 437 | oop* const base = a->base(); |
duke@435 | 438 | oop* const beg_oop = MAX2((oop*)beg_addr, base); |
duke@435 | 439 | oop* const end_oop = MIN2((oop*)end_addr, base + a->length()); |
duke@435 | 440 | for (oop* cur_oop = beg_oop; cur_oop < end_oop; ++cur_oop) { |
duke@435 | 441 | PSParallelCompact::adjust_pointer(cur_oop); |
duke@435 | 442 | } |
duke@435 | 443 | return a->object_size(); |
duke@435 | 444 | } |
duke@435 | 445 | #endif // SERIALGC |
duke@435 | 446 | |
duke@435 | 447 | // JVM support |
duke@435 | 448 | |
duke@435 | 449 | jint objArrayKlass::compute_modifier_flags(TRAPS) const { |
duke@435 | 450 | // The modifier for an objectArray is the same as its element |
duke@435 | 451 | if (element_klass() == NULL) { |
duke@435 | 452 | assert(Universe::is_bootstrapping(), "partial objArray only at startup"); |
duke@435 | 453 | return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC; |
duke@435 | 454 | } |
duke@435 | 455 | // Recurse down the element list |
duke@435 | 456 | jint element_flags = Klass::cast(element_klass())->compute_modifier_flags(CHECK_0); |
duke@435 | 457 | |
duke@435 | 458 | return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED)) |
duke@435 | 459 | | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL); |
duke@435 | 460 | } |
duke@435 | 461 | |
duke@435 | 462 | |
duke@435 | 463 | #ifndef PRODUCT |
duke@435 | 464 | // Printing |
duke@435 | 465 | |
duke@435 | 466 | void objArrayKlass::oop_print_on(oop obj, outputStream* st) { |
duke@435 | 467 | arrayKlass::oop_print_on(obj, st); |
duke@435 | 468 | assert(obj->is_objArray(), "must be objArray"); |
duke@435 | 469 | objArrayOop oa = objArrayOop(obj); |
duke@435 | 470 | int print_len = MIN2((intx) oa->length(), MaxElementPrintSize); |
duke@435 | 471 | for(int index = 0; index < print_len; index++) { |
duke@435 | 472 | st->print(" - %3d : ", index); |
duke@435 | 473 | oa->obj_at(index)->print_value_on(st); |
duke@435 | 474 | st->cr(); |
duke@435 | 475 | } |
duke@435 | 476 | int remaining = oa->length() - print_len; |
duke@435 | 477 | if (remaining > 0) { |
duke@435 | 478 | tty->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining); |
duke@435 | 479 | } |
duke@435 | 480 | } |
duke@435 | 481 | |
duke@435 | 482 | |
duke@435 | 483 | void objArrayKlass::oop_print_value_on(oop obj, outputStream* st) { |
duke@435 | 484 | assert(obj->is_objArray(), "must be objArray"); |
duke@435 | 485 | element_klass()->print_value_on(st); |
duke@435 | 486 | st->print("a [%d] ", objArrayOop(obj)->length()); |
duke@435 | 487 | as_klassOop()->klass()->print_value_on(st); |
duke@435 | 488 | } |
duke@435 | 489 | |
duke@435 | 490 | #endif // PRODUCT |
duke@435 | 491 | |
duke@435 | 492 | const char* objArrayKlass::internal_name() const { |
duke@435 | 493 | return external_name(); |
duke@435 | 494 | } |
duke@435 | 495 | |
duke@435 | 496 | // Verification |
duke@435 | 497 | |
duke@435 | 498 | void objArrayKlass::oop_verify_on(oop obj, outputStream* st) { |
duke@435 | 499 | arrayKlass::oop_verify_on(obj, st); |
duke@435 | 500 | guarantee(obj->is_objArray(), "must be objArray"); |
duke@435 | 501 | objArrayOop oa = objArrayOop(obj); |
duke@435 | 502 | for(int index = 0; index < oa->length(); index++) { |
duke@435 | 503 | guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop"); |
duke@435 | 504 | } |
duke@435 | 505 | } |
duke@435 | 506 | |
duke@435 | 507 | void objArrayKlass::oop_verify_old_oop(oop obj, oop* p, bool allow_dirty) { |
duke@435 | 508 | /* $$$ move into remembered set verification? |
duke@435 | 509 | RememberedSet::verify_old_oop(obj, p, allow_dirty, true); |
duke@435 | 510 | */ |
duke@435 | 511 | } |