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