1 /*
2 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "classfile/vmSymbols.hpp"
28 #include "gc_implementation/shared/markSweep.inline.hpp"
29 #include "gc_interface/collectedHeap.inline.hpp"
30 #include "memory/genOopClosures.inline.hpp"
31 #include "memory/resourceArea.hpp"
32 #include "memory/universe.inline.hpp"
33 #include "oops/instanceKlass.hpp"
34 #include "oops/objArrayKlass.hpp"
35 #include "oops/objArrayKlass.inline.hpp"
36 #include "oops/objArrayKlassKlass.hpp"
37 #include "oops/objArrayOop.hpp"
38 #include "oops/oop.inline.hpp"
39 #include "oops/oop.inline2.hpp"
40 #include "oops/symbolOop.hpp"
41 #include "runtime/handles.inline.hpp"
42 #include "runtime/mutexLocker.hpp"
43 #include "utilities/copy.hpp"
44 #ifndef SERIALGC
45 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
46 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
47 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
48 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
49 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
50 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
51 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
52 #include "oops/oop.pcgc.inline.hpp"
53 #endif
54
55 int objArrayKlass::oop_size(oop obj) const {
56 assert(obj->is_objArray(), "must be object array");
57 return objArrayOop(obj)->object_size();
58 }
59
60 objArrayOop objArrayKlass::allocate(int length, TRAPS) {
61 if (length >= 0) {
62 if (length <= arrayOopDesc::max_array_length(T_OBJECT)) {
63 int size = objArrayOopDesc::object_size(length);
64 KlassHandle h_k(THREAD, as_klassOop());
65 objArrayOop a = (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, CHECK_NULL);
66 assert(a->is_parsable(), "Can't publish unless parsable");
67 return a;
68 } else {
69 report_java_out_of_memory("Requested array size exceeds VM limit");
70 THROW_OOP_0(Universe::out_of_memory_error_array_size());
71 }
72 } else {
73 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
74 }
75 }
76
77 static int multi_alloc_counter = 0;
78
79 oop objArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
80 int length = *sizes;
81 // Call to lower_dimension uses this pointer, so most be called before a
82 // possible GC
83 KlassHandle h_lower_dimension(THREAD, lower_dimension());
84 // If length < 0 allocate will throw an exception.
85 objArrayOop array = allocate(length, CHECK_NULL);
86 assert(array->is_parsable(), "Don't handlize unless parsable");
87 objArrayHandle h_array (THREAD, array);
88 if (rank > 1) {
89 if (length != 0) {
90 for (int index = 0; index < length; index++) {
91 arrayKlass* ak = arrayKlass::cast(h_lower_dimension());
92 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
93 assert(sub_array->is_parsable(), "Don't publish until parsable");
94 h_array->obj_at_put(index, sub_array);
95 }
96 } else {
97 // Since this array dimension has zero length, nothing will be
98 // allocated, however the lower dimension values must be checked
99 // for illegal values.
100 for (int i = 0; i < rank - 1; ++i) {
101 sizes += 1;
102 if (*sizes < 0) {
103 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
104 }
105 }
106 }
107 }
108 return h_array();
109 }
110
111 // Either oop or narrowOop depending on UseCompressedOops.
112 template <class T> void objArrayKlass::do_copy(arrayOop s, T* src,
113 arrayOop d, T* dst, int length, TRAPS) {
114
115 BarrierSet* bs = Universe::heap()->barrier_set();
116 // For performance reasons, we assume we are that the write barrier we
117 // are using has optimized modes for arrays of references. At least one
118 // of the asserts below will fail if this is not the case.
119 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
120 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
121
122 if (s == d) {
123 // since source and destination are equal we do not need conversion checks.
124 assert(length > 0, "sanity check");
125 bs->write_ref_array_pre(dst, length);
126 Copy::conjoint_oops_atomic(src, dst, length);
127 } else {
128 // We have to make sure all elements conform to the destination array
129 klassOop bound = objArrayKlass::cast(d->klass())->element_klass();
130 klassOop stype = objArrayKlass::cast(s->klass())->element_klass();
131 if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) {
132 // elements are guaranteed to be subtypes, so no check necessary
133 bs->write_ref_array_pre(dst, length);
134 Copy::conjoint_oops_atomic(src, dst, length);
135 } else {
136 // slow case: need individual subtype checks
137 // note: don't use obj_at_put below because it includes a redundant store check
138 T* from = src;
139 T* end = from + length;
140 for (T* p = dst; from < end; from++, p++) {
141 // XXX this is going to be slow.
142 T element = *from;
143 // even slower now
144 bool element_is_null = oopDesc::is_null(element);
145 oop new_val = element_is_null ? oop(NULL)
146 : oopDesc::decode_heap_oop_not_null(element);
147 if (element_is_null ||
148 Klass::cast((new_val->klass()))->is_subtype_of(bound)) {
149 bs->write_ref_field_pre(p, new_val);
150 *p = *from;
151 } else {
152 // We must do a barrier to cover the partial copy.
153 const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);
154 // pointer delta is scaled to number of elements (length field in
155 // objArrayOop) which we assume is 32 bit.
156 assert(pd == (size_t)(int)pd, "length field overflow");
157 bs->write_ref_array((HeapWord*)dst, pd);
158 THROW(vmSymbols::java_lang_ArrayStoreException());
159 return;
160 }
161 }
162 }
163 }
164 bs->write_ref_array((HeapWord*)dst, length);
165 }
166
167 void objArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
168 int dst_pos, int length, TRAPS) {
169 assert(s->is_objArray(), "must be obj array");
170
171 if (!d->is_objArray()) {
172 THROW(vmSymbols::java_lang_ArrayStoreException());
173 }
174
175 // Check is all offsets and lengths are non negative
176 if (src_pos < 0 || dst_pos < 0 || length < 0) {
177 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
178 }
179 // Check if the ranges are valid
180 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
181 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
182 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
183 }
184
185 // Special case. Boundary cases must be checked first
186 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
187 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
188 // points to the right of the last element.
189 if (length==0) {
190 return;
191 }
192 if (UseCompressedOops) {
193 narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);
194 narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);
195 do_copy<narrowOop>(s, src, d, dst, length, CHECK);
196 } else {
197 oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);
198 oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);
199 do_copy<oop> (s, src, d, dst, length, CHECK);
200 }
201 }
202
203
204 klassOop objArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
205 objArrayKlassHandle h_this(THREAD, as_klassOop());
206 return array_klass_impl(h_this, or_null, n, CHECK_NULL);
207 }
208
209
210 klassOop objArrayKlass::array_klass_impl(objArrayKlassHandle this_oop, bool or_null, int n, TRAPS) {
211
212 assert(this_oop->dimension() <= n, "check order of chain");
213 int dimension = this_oop->dimension();
214 if (dimension == n)
215 return this_oop();
216
217 objArrayKlassHandle ak (THREAD, this_oop->higher_dimension());
218 if (ak.is_null()) {
219 if (or_null) return NULL;
220
221 ResourceMark rm;
222 JavaThread *jt = (JavaThread *)THREAD;
223 {
224 MutexLocker mc(Compile_lock, THREAD); // for vtables
225 // Ensure atomic creation of higher dimensions
226 MutexLocker mu(MultiArray_lock, THREAD);
227
228 // Check if another thread beat us
229 ak = objArrayKlassHandle(THREAD, this_oop->higher_dimension());
230 if( ak.is_null() ) {
231
232 // Create multi-dim klass object and link them together
233 klassOop new_klass =
234 objArrayKlassKlass::cast(Universe::objArrayKlassKlassObj())->
235 allocate_objArray_klass(dimension + 1, this_oop, CHECK_NULL);
236 ak = objArrayKlassHandle(THREAD, new_klass);
237 this_oop->set_higher_dimension(ak());
238 ak->set_lower_dimension(this_oop());
239 assert(ak->oop_is_objArray(), "incorrect initialization of objArrayKlass");
240 }
241 }
242 } else {
243 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
244 }
245
246 if (or_null) {
247 return ak->array_klass_or_null(n);
248 }
249 return ak->array_klass(n, CHECK_NULL);
250 }
251
252 klassOop objArrayKlass::array_klass_impl(bool or_null, TRAPS) {
253 return array_klass_impl(or_null, dimension() + 1, CHECK_NULL);
254 }
255
256 bool objArrayKlass::can_be_primary_super_slow() const {
257 if (!bottom_klass()->klass_part()->can_be_primary_super())
258 // array of interfaces
259 return false;
260 else
261 return Klass::can_be_primary_super_slow();
262 }
263
264 objArrayOop objArrayKlass::compute_secondary_supers(int num_extra_slots, TRAPS) {
265 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
266 objArrayOop es = Klass::cast(element_klass())->secondary_supers();
267 objArrayHandle elem_supers (THREAD, es);
268 int num_elem_supers = elem_supers.is_null() ? 0 : elem_supers->length();
269 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
270 if (num_secondaries == 2) {
271 // Must share this for correct bootstrapping!
272 return Universe::the_array_interfaces_array();
273 } else {
274 objArrayOop sec_oop = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL);
275 objArrayHandle secondaries(THREAD, sec_oop);
276 secondaries->obj_at_put(num_extra_slots+0, SystemDictionary::Cloneable_klass());
277 secondaries->obj_at_put(num_extra_slots+1, SystemDictionary::Serializable_klass());
278 for (int i = 0; i < num_elem_supers; i++) {
279 klassOop elem_super = (klassOop) elem_supers->obj_at(i);
280 klassOop array_super = elem_super->klass_part()->array_klass_or_null();
281 assert(array_super != NULL, "must already have been created");
282 secondaries->obj_at_put(num_extra_slots+2+i, array_super);
283 }
284 return secondaries();
285 }
286 }
287
288 bool objArrayKlass::compute_is_subtype_of(klassOop k) {
289 if (!k->klass_part()->oop_is_objArray())
290 return arrayKlass::compute_is_subtype_of(k);
291
292 objArrayKlass* oak = objArrayKlass::cast(k);
293 return element_klass()->klass_part()->is_subtype_of(oak->element_klass());
294 }
295
296 void objArrayKlass::initialize(TRAPS) {
297 Klass::cast(bottom_klass())->initialize(THREAD); // dispatches to either instanceKlass or typeArrayKlass
298 }
299
300 #define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \
301 { \
302 T* p = (T*)(a)->base(); \
303 T* const end = p + (a)->length(); \
304 while (p < end) { \
305 do_oop; \
306 p++; \
307 } \
308 }
309
310 #define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \
311 { \
312 T* const l = (T*)(low); \
313 T* const h = (T*)(high); \
314 T* p = (T*)(a)->base(); \
315 T* end = p + (a)->length(); \
316 if (p < l) p = l; \
317 if (end > h) end = h; \
318 while (p < end) { \
319 do_oop; \
320 ++p; \
321 } \
322 }
323
324 #define ObjArrayKlass_OOP_ITERATE(a, p, do_oop) \
325 if (UseCompressedOops) { \
326 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
327 a, p, do_oop) \
328 } else { \
329 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop, \
330 a, p, do_oop) \
331 }
332
333 #define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \
334 if (UseCompressedOops) { \
335 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
336 a, p, low, high, do_oop) \
337 } else { \
338 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
339 a, p, low, high, do_oop) \
340 }
341
342 void objArrayKlass::oop_follow_contents(oop obj) {
343 assert (obj->is_array(), "obj must be array");
344 objArrayOop(obj)->follow_header();
345 if (UseCompressedOops) {
346 objarray_follow_contents<narrowOop>(obj, 0);
347 } else {
348 objarray_follow_contents<oop>(obj, 0);
349 }
350 }
351
352 #ifndef SERIALGC
353 void objArrayKlass::oop_follow_contents(ParCompactionManager* cm,
354 oop obj) {
355 assert(obj->is_array(), "obj must be array");
356 objArrayOop(obj)->follow_header(cm);
357 if (UseCompressedOops) {
358 objarray_follow_contents<narrowOop>(cm, obj, 0);
359 } else {
360 objarray_follow_contents<oop>(cm, obj, 0);
361 }
362 }
363 #endif // SERIALGC
364
365 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
366 \
367 int objArrayKlass::oop_oop_iterate##nv_suffix(oop obj, \
368 OopClosureType* closure) { \
369 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
370 assert (obj->is_array(), "obj must be array"); \
371 objArrayOop a = objArrayOop(obj); \
372 /* Get size before changing pointers. */ \
373 /* Don't call size() or oop_size() since that is a virtual call. */ \
374 int size = a->object_size(); \
375 if (closure->do_header()) { \
376 a->oop_iterate_header(closure); \
377 } \
378 ObjArrayKlass_OOP_ITERATE(a, p, (closure)->do_oop##nv_suffix(p)) \
379 return size; \
380 }
381
382 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
383 \
384 int objArrayKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
385 OopClosureType* closure, \
386 MemRegion mr) { \
387 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
388 assert(obj->is_array(), "obj must be array"); \
389 objArrayOop a = objArrayOop(obj); \
390 /* Get size before changing pointers. */ \
391 /* Don't call size() or oop_size() since that is a virtual call */ \
392 int size = a->object_size(); \
393 if (closure->do_header()) { \
394 a->oop_iterate_header(closure, mr); \
395 } \
396 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
397 a, p, mr.start(), mr.end(), (closure)->do_oop##nv_suffix(p)) \
398 return size; \
399 }
400
401 // Like oop_oop_iterate but only iterates over a specified range and only used
402 // for objArrayOops.
403 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r(OopClosureType, nv_suffix) \
404 \
405 int objArrayKlass::oop_oop_iterate_range##nv_suffix(oop obj, \
406 OopClosureType* closure, \
407 int start, int end) { \
408 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
409 assert(obj->is_array(), "obj must be array"); \
410 objArrayOop a = objArrayOop(obj); \
411 /* Get size before changing pointers. */ \
412 /* Don't call size() or oop_size() since that is a virtual call */ \
413 int size = a->object_size(); \
414 if (UseCompressedOops) { \
415 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<narrowOop>(start);\
416 /* this might be wierd if end needs to be aligned on HeapWord boundary */ \
417 HeapWord* high = (HeapWord*)((narrowOop*)a->base() + end); \
418 MemRegion mr(low, high); \
419 if (closure->do_header()) { \
420 a->oop_iterate_header(closure, mr); \
421 } \
422 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
423 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
424 } else { \
425 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<oop>(start); \
426 HeapWord* high = (HeapWord*)((oop*)a->base() + end); \
427 MemRegion mr(low, high); \
428 if (closure->do_header()) { \
429 a->oop_iterate_header(closure, mr); \
430 } \
431 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
432 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
433 } \
434 return size; \
435 }
436
437 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
438 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
439 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
440 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
441 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
442 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
443
444 int objArrayKlass::oop_adjust_pointers(oop obj) {
445 assert(obj->is_objArray(), "obj must be obj array");
446 objArrayOop a = objArrayOop(obj);
447 // Get size before changing pointers.
448 // Don't call size() or oop_size() since that is a virtual call.
449 int size = a->object_size();
450 a->adjust_header();
451 ObjArrayKlass_OOP_ITERATE(a, p, MarkSweep::adjust_pointer(p))
452 return size;
453 }
454
455 #ifndef SERIALGC
456 void objArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
457 assert(obj->is_objArray(), "obj must be obj array");
458 ObjArrayKlass_OOP_ITERATE( \
459 objArrayOop(obj), p, \
460 if (PSScavenge::should_scavenge(p)) { \
461 pm->claim_or_forward_depth(p); \
462 })
463 }
464
465 int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
466 assert (obj->is_objArray(), "obj must be obj array");
467 objArrayOop a = objArrayOop(obj);
468 ObjArrayKlass_OOP_ITERATE(a, p, PSParallelCompact::adjust_pointer(p))
469 return a->object_size();
470 }
471
472 int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj,
473 HeapWord* beg_addr, HeapWord* end_addr) {
474 assert (obj->is_objArray(), "obj must be obj array");
475 objArrayOop a = objArrayOop(obj);
476 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
477 a, p, beg_addr, end_addr, \
478 PSParallelCompact::adjust_pointer(p))
479 return a->object_size();
480 }
481 #endif // SERIALGC
482
483 // JVM support
484
485 jint objArrayKlass::compute_modifier_flags(TRAPS) const {
486 // The modifier for an objectArray is the same as its element
487 if (element_klass() == NULL) {
488 assert(Universe::is_bootstrapping(), "partial objArray only at startup");
489 return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
490 }
491 // Return the flags of the bottom element type.
492 jint element_flags = Klass::cast(bottom_klass())->compute_modifier_flags(CHECK_0);
493
494 return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
495 | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
496 }
497
498
499 #ifndef PRODUCT
500 // Printing
501
502 void objArrayKlass::oop_print_on(oop obj, outputStream* st) {
503 arrayKlass::oop_print_on(obj, st);
504 assert(obj->is_objArray(), "must be objArray");
505 objArrayOop oa = objArrayOop(obj);
506 int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
507 for(int index = 0; index < print_len; index++) {
508 st->print(" - %3d : ", index);
509 oa->obj_at(index)->print_value_on(st);
510 st->cr();
511 }
512 int remaining = oa->length() - print_len;
513 if (remaining > 0) {
514 tty->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
515 }
516 }
517
518 #endif //PRODUCT
519
520 static int max_objArray_print_length = 4;
521
522 void objArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
523 assert(obj->is_objArray(), "must be objArray");
524 st->print("a ");
525 element_klass()->print_value_on(st);
526 int len = objArrayOop(obj)->length();
527 st->print("[%d] ", len);
528 obj->print_address_on(st);
529 if (NOT_PRODUCT(PrintOopAddress ||) PrintMiscellaneous && (WizardMode || Verbose)) {
530 st->print("{");
531 for (int i = 0; i < len; i++) {
532 if (i > max_objArray_print_length) {
533 st->print("..."); break;
534 }
535 st->print(" "INTPTR_FORMAT, (intptr_t)(void*)objArrayOop(obj)->obj_at(i));
536 }
537 st->print(" }");
538 }
539 }
540
541 const char* objArrayKlass::internal_name() const {
542 return external_name();
543 }
544
545 // Verification
546
547 void objArrayKlass::oop_verify_on(oop obj, outputStream* st) {
548 arrayKlass::oop_verify_on(obj, st);
549 guarantee(obj->is_objArray(), "must be objArray");
550 objArrayOop oa = objArrayOop(obj);
551 for(int index = 0; index < oa->length(); index++) {
552 guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop");
553 }
554 }
555
556 void objArrayKlass::oop_verify_old_oop(oop obj, oop* p, bool allow_dirty) {
557 /* $$$ move into remembered set verification?
558 RememberedSet::verify_old_oop(obj, p, allow_dirty, true);
559 */
560 }
561 void objArrayKlass::oop_verify_old_oop(oop obj, narrowOop* p, bool allow_dirty) {}