Mercurial > jdk8-mips64-public > hotspot / file revision
src/share/vm/oops/objArrayKlass.cpp@df6caf649ff7
src/share/vm/oops/objArrayKlass.cpp
Tue, 14 Jul 2009 15:40:39 -0700
- author
- ysr
- date
- Tue, 14 Jul 2009 15:40:39 -0700
- changeset 1280
- df6caf649ff7
- parent 1100
- c89f86385056
- child 1314
- 494244ae0171
- permissions
- -rw-r--r--
6700789: G1: Enable use of compressed oops with G1 heaps
Summary: Modifications to G1 so as to allow the use of compressed oops.
Reviewed-by: apetrusenko, coleenp, jmasa, kvn, never, phh, tonyp
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 BarrierSet* bs = Universe::heap()->barrier_set();
88 // For performance reasons, we assume we are that the write barrier we
89 // are using has optimized modes for arrays of references. At least one
90 // of the asserts below will fail if this is not the case.
91 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
92 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
94 if (s == d) {
95 // since source and destination are equal we do not need conversion checks.
96 assert(length > 0, "sanity check");
97 bs->write_ref_array_pre(dst, length);
98 Copy::conjoint_oops_atomic(src, dst, length);
99 } else {
100 // We have to make sure all elements conform to the destination array
101 klassOop bound = objArrayKlass::cast(d->klass())->element_klass();
102 klassOop stype = objArrayKlass::cast(s->klass())->element_klass();
103 if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) {
104 // elements are guaranteed to be subtypes, so no check necessary
105 bs->write_ref_array_pre(dst, length);
106 Copy::conjoint_oops_atomic(src, dst, length);
107 } else {
108 // slow case: need individual subtype checks
109 // note: don't use obj_at_put below because it includes a redundant store check
110 T* from = src;
111 T* end = from + length;
112 for (T* p = dst; from < end; from++, p++) {
113 // XXX this is going to be slow.
114 T element = *from;
115 // even slower now
116 bool element_is_null = oopDesc::is_null(element);
117 oop new_val = element_is_null ? oop(NULL)
118 : oopDesc::decode_heap_oop_not_null(element);
119 if (element_is_null ||
120 Klass::cast((new_val->klass()))->is_subtype_of(bound)) {
121 bs->write_ref_field_pre(p, new_val);
122 *p = *from;
123 } else {
124 // We must do a barrier to cover the partial copy.
125 const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);
126 // pointer delta is scaled to number of elements (length field in
127 // objArrayOop) which we assume is 32 bit.
128 assert(pd == (size_t)(int)pd, "length field overflow");
129 const size_t done_word_len = objArrayOopDesc::array_size((int)pd);
130 bs->write_ref_array(MemRegion((HeapWord*)dst, done_word_len));
131 THROW(vmSymbols::java_lang_ArrayStoreException());
132 return;
133 }
134 }
135 }
136 }
137 const size_t word_len = objArrayOopDesc::array_size(length);
138 bs->write_ref_array(MemRegion((HeapWord*)dst, word_len));
139 }
141 void objArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
142 int dst_pos, int length, TRAPS) {
143 assert(s->is_objArray(), "must be obj array");
145 if (!d->is_objArray()) {
146 THROW(vmSymbols::java_lang_ArrayStoreException());
147 }
149 // Check is all offsets and lengths are non negative
150 if (src_pos < 0 || dst_pos < 0 || length < 0) {
151 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
152 }
153 // Check if the ranges are valid
154 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
155 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
156 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
157 }
159 // Special case. Boundary cases must be checked first
160 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
161 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
162 // points to the right of the last element.
163 if (length==0) {
164 return;
165 }
166 if (UseCompressedOops) {
167 narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);
168 narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);
169 do_copy<narrowOop>(s, src, d, dst, length, CHECK);
170 } else {
171 oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);
172 oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);
173 do_copy<oop> (s, src, d, dst, length, CHECK);
174 }
175 }
178 klassOop objArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
179 objArrayKlassHandle h_this(THREAD, as_klassOop());
180 return array_klass_impl(h_this, or_null, n, CHECK_NULL);
181 }
184 klassOop objArrayKlass::array_klass_impl(objArrayKlassHandle this_oop, bool or_null, int n, TRAPS) {
186 assert(this_oop->dimension() <= n, "check order of chain");
187 int dimension = this_oop->dimension();
188 if (dimension == n)
189 return this_oop();
191 objArrayKlassHandle ak (THREAD, this_oop->higher_dimension());
192 if (ak.is_null()) {
193 if (or_null) return NULL;
195 ResourceMark rm;
196 JavaThread *jt = (JavaThread *)THREAD;
197 {
198 MutexLocker mc(Compile_lock, THREAD); // for vtables
199 // Ensure atomic creation of higher dimensions
200 MutexLocker mu(MultiArray_lock, THREAD);
202 // Check if another thread beat us
203 ak = objArrayKlassHandle(THREAD, this_oop->higher_dimension());
204 if( ak.is_null() ) {
206 // Create multi-dim klass object and link them together
207 klassOop new_klass =
208 objArrayKlassKlass::cast(Universe::objArrayKlassKlassObj())->
209 allocate_objArray_klass(dimension + 1, this_oop, CHECK_NULL);
210 ak = objArrayKlassHandle(THREAD, new_klass);
211 this_oop->set_higher_dimension(ak());
212 ak->set_lower_dimension(this_oop());
213 assert(ak->oop_is_objArray(), "incorrect initialization of objArrayKlass");
214 }
215 }
216 } else {
217 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
218 }
220 if (or_null) {
221 return ak->array_klass_or_null(n);
222 }
223 return ak->array_klass(n, CHECK_NULL);
224 }
226 klassOop objArrayKlass::array_klass_impl(bool or_null, TRAPS) {
227 return array_klass_impl(or_null, dimension() + 1, CHECK_NULL);
228 }
230 bool objArrayKlass::can_be_primary_super_slow() const {
231 if (!bottom_klass()->klass_part()->can_be_primary_super())
232 // array of interfaces
233 return false;
234 else
235 return Klass::can_be_primary_super_slow();
236 }
238 objArrayOop objArrayKlass::compute_secondary_supers(int num_extra_slots, TRAPS) {
239 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
240 objArrayOop es = Klass::cast(element_klass())->secondary_supers();
241 objArrayHandle elem_supers (THREAD, es);
242 int num_elem_supers = elem_supers.is_null() ? 0 : elem_supers->length();
243 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
244 if (num_secondaries == 2) {
245 // Must share this for correct bootstrapping!
246 return Universe::the_array_interfaces_array();
247 } else {
248 objArrayOop sec_oop = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL);
249 objArrayHandle secondaries(THREAD, sec_oop);
250 secondaries->obj_at_put(num_extra_slots+0, SystemDictionary::cloneable_klass());
251 secondaries->obj_at_put(num_extra_slots+1, SystemDictionary::serializable_klass());
252 for (int i = 0; i < num_elem_supers; i++) {
253 klassOop elem_super = (klassOop) elem_supers->obj_at(i);
254 klassOop array_super = elem_super->klass_part()->array_klass_or_null();
255 assert(array_super != NULL, "must already have been created");
256 secondaries->obj_at_put(num_extra_slots+2+i, array_super);
257 }
258 return secondaries();
259 }
260 }
262 bool objArrayKlass::compute_is_subtype_of(klassOop k) {
263 if (!k->klass_part()->oop_is_objArray())
264 return arrayKlass::compute_is_subtype_of(k);
266 objArrayKlass* oak = objArrayKlass::cast(k);
267 return element_klass()->klass_part()->is_subtype_of(oak->element_klass());
268 }
270 void objArrayKlass::initialize(TRAPS) {
271 Klass::cast(bottom_klass())->initialize(THREAD); // dispatches to either instanceKlass or typeArrayKlass
272 }
274 #define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \
275 { \
276 T* p = (T*)(a)->base(); \
277 T* const end = p + (a)->length(); \
278 while (p < end) { \
279 do_oop; \
280 p++; \
281 } \
282 }
284 #define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \
285 { \
286 T* const l = (T*)(low); \
287 T* const h = (T*)(high); \
288 T* p = (T*)(a)->base(); \
289 T* end = p + (a)->length(); \
290 if (p < l) p = l; \
291 if (end > h) end = h; \
292 while (p < end) { \
293 do_oop; \
294 ++p; \
295 } \
296 }
298 #define ObjArrayKlass_OOP_ITERATE(a, p, do_oop) \
299 if (UseCompressedOops) { \
300 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
301 a, p, do_oop) \
302 } else { \
303 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop, \
304 a, p, do_oop) \
305 }
307 #define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \
308 if (UseCompressedOops) { \
309 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
310 a, p, low, high, do_oop) \
311 } else { \
312 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
313 a, p, low, high, do_oop) \
314 }
316 void objArrayKlass::oop_follow_contents(oop obj) {
317 assert (obj->is_array(), "obj must be array");
318 objArrayOop a = objArrayOop(obj);
319 a->follow_header();
320 ObjArrayKlass_OOP_ITERATE( \
321 a, p, \
322 /* we call mark_and_follow here to avoid excessive marking stack usage */ \
323 MarkSweep::mark_and_follow(p))
324 }
326 #ifndef SERIALGC
327 void objArrayKlass::oop_follow_contents(ParCompactionManager* cm,
328 oop obj) {
329 assert (obj->is_array(), "obj must be array");
330 objArrayOop a = objArrayOop(obj);
331 a->follow_header(cm);
332 ObjArrayKlass_OOP_ITERATE( \
333 a, p, \
334 /* we call mark_and_follow here to avoid excessive marking stack usage */ \
335 PSParallelCompact::mark_and_follow(cm, p))
336 }
337 #endif // SERIALGC
339 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
340 \
341 int objArrayKlass::oop_oop_iterate##nv_suffix(oop obj, \
342 OopClosureType* closure) { \
343 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
344 assert (obj->is_array(), "obj must be array"); \
345 objArrayOop a = objArrayOop(obj); \
346 /* Get size before changing pointers. */ \
347 /* Don't call size() or oop_size() since that is a virtual call. */ \
348 int size = a->object_size(); \
349 if (closure->do_header()) { \
350 a->oop_iterate_header(closure); \
351 } \
352 ObjArrayKlass_OOP_ITERATE(a, p, (closure)->do_oop##nv_suffix(p)) \
353 return size; \
354 }
356 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
357 \
358 int objArrayKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
359 OopClosureType* closure, \
360 MemRegion mr) { \
361 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
362 assert(obj->is_array(), "obj must be array"); \
363 objArrayOop a = objArrayOop(obj); \
364 /* Get size before changing pointers. */ \
365 /* Don't call size() or oop_size() since that is a virtual call */ \
366 int size = a->object_size(); \
367 if (closure->do_header()) { \
368 a->oop_iterate_header(closure, mr); \
369 } \
370 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
371 a, p, mr.start(), mr.end(), (closure)->do_oop##nv_suffix(p)) \
372 return size; \
373 }
375 // Like oop_oop_iterate but only iterates over a specified range and only used
376 // for objArrayOops.
377 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r(OopClosureType, nv_suffix) \
378 \
379 int objArrayKlass::oop_oop_iterate_range##nv_suffix(oop obj, \
380 OopClosureType* closure, \
381 int start, int end) { \
382 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
383 assert(obj->is_array(), "obj must be array"); \
384 objArrayOop a = objArrayOop(obj); \
385 /* Get size before changing pointers. */ \
386 /* Don't call size() or oop_size() since that is a virtual call */ \
387 int size = a->object_size(); \
388 if (UseCompressedOops) { \
389 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<narrowOop>(start);\
390 /* this might be wierd if end needs to be aligned on HeapWord boundary */ \
391 HeapWord* high = (HeapWord*)((narrowOop*)a->base() + end); \
392 MemRegion mr(low, high); \
393 if (closure->do_header()) { \
394 a->oop_iterate_header(closure, mr); \
395 } \
396 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
397 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
398 } else { \
399 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<oop>(start); \
400 HeapWord* high = (HeapWord*)((oop*)a->base() + end); \
401 MemRegion mr(low, high); \
402 if (closure->do_header()) { \
403 a->oop_iterate_header(closure, mr); \
404 } \
405 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
406 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
407 } \
408 return size; \
409 }
411 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
412 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
413 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
414 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
415 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
416 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
418 int objArrayKlass::oop_adjust_pointers(oop obj) {
419 assert(obj->is_objArray(), "obj must be obj array");
420 objArrayOop a = objArrayOop(obj);
421 // Get size before changing pointers.
422 // Don't call size() or oop_size() since that is a virtual call.
423 int size = a->object_size();
424 a->adjust_header();
425 ObjArrayKlass_OOP_ITERATE(a, p, MarkSweep::adjust_pointer(p))
426 return size;
427 }
429 #ifndef SERIALGC
430 void objArrayKlass::oop_copy_contents(PSPromotionManager* pm, oop obj) {
431 assert(!pm->depth_first(), "invariant");
432 assert(obj->is_objArray(), "obj must be obj array");
433 ObjArrayKlass_OOP_ITERATE( \
434 objArrayOop(obj), p, \
435 if (PSScavenge::should_scavenge(p)) { \
436 pm->claim_or_forward_breadth(p); \
437 })
438 }
440 void objArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
441 assert(pm->depth_first(), "invariant");
442 assert(obj->is_objArray(), "obj must be obj array");
443 ObjArrayKlass_OOP_ITERATE( \
444 objArrayOop(obj), p, \
445 if (PSScavenge::should_scavenge(p)) { \
446 pm->claim_or_forward_depth(p); \
447 })
448 }
450 int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
451 assert (obj->is_objArray(), "obj must be obj array");
452 objArrayOop a = objArrayOop(obj);
453 ObjArrayKlass_OOP_ITERATE(a, p, PSParallelCompact::adjust_pointer(p))
454 return a->object_size();
455 }
457 int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj,
458 HeapWord* beg_addr, HeapWord* end_addr) {
459 assert (obj->is_objArray(), "obj must be obj array");
460 objArrayOop a = objArrayOop(obj);
461 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
462 a, p, beg_addr, end_addr, \
463 PSParallelCompact::adjust_pointer(p))
464 return a->object_size();
465 }
466 #endif // SERIALGC
468 // JVM support
470 jint objArrayKlass::compute_modifier_flags(TRAPS) const {
471 // The modifier for an objectArray is the same as its element
472 if (element_klass() == NULL) {
473 assert(Universe::is_bootstrapping(), "partial objArray only at startup");
474 return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
475 }
476 // Return the flags of the bottom element type.
477 jint element_flags = Klass::cast(bottom_klass())->compute_modifier_flags(CHECK_0);
479 return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
480 | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
481 }
484 #ifndef PRODUCT
485 // Printing
487 void objArrayKlass::oop_print_on(oop obj, outputStream* st) {
488 arrayKlass::oop_print_on(obj, st);
489 assert(obj->is_objArray(), "must be objArray");
490 objArrayOop oa = objArrayOop(obj);
491 int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
492 for(int index = 0; index < print_len; index++) {
493 st->print(" - %3d : ", index);
494 oa->obj_at(index)->print_value_on(st);
495 st->cr();
496 }
497 int remaining = oa->length() - print_len;
498 if (remaining > 0) {
499 tty->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
500 }
501 }
503 static int max_objArray_print_length = 4;
505 void objArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
506 assert(obj->is_objArray(), "must be objArray");
507 st->print("a ");
508 element_klass()->print_value_on(st);
509 int len = objArrayOop(obj)->length();
510 st->print("[%d] ", len);
511 obj->print_address_on(st);
512 if (PrintOopAddress || PrintMiscellaneous && (WizardMode || Verbose)) {
513 st->print("{");
514 for (int i = 0; i < len; i++) {
515 if (i > max_objArray_print_length) {
516 st->print("..."); break;
517 }
518 st->print(" "INTPTR_FORMAT, (intptr_t)(void*)objArrayOop(obj)->obj_at(i));
519 }
520 st->print(" }");
521 }
522 }
524 #endif // PRODUCT
526 const char* objArrayKlass::internal_name() const {
527 return external_name();
528 }
530 // Verification
532 void objArrayKlass::oop_verify_on(oop obj, outputStream* st) {
533 arrayKlass::oop_verify_on(obj, st);
534 guarantee(obj->is_objArray(), "must be objArray");
535 objArrayOop oa = objArrayOop(obj);
536 for(int index = 0; index < oa->length(); index++) {
537 guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop");
538 }
539 }
541 void objArrayKlass::oop_verify_old_oop(oop obj, oop* p, bool allow_dirty) {
542 /* $$$ move into remembered set verification?
543 RememberedSet::verify_old_oop(obj, p, allow_dirty, true);
544 */
545 }
546 void objArrayKlass::oop_verify_old_oop(oop obj, narrowOop* p, bool allow_dirty) {}
