1 /*
2 * Copyright (c) 1997, 2014, 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/symbolTable.hpp"
27 #include "classfile/systemDictionary.hpp"
28 #include "classfile/vmSymbols.hpp"
29 #include "gc_implementation/shared/markSweep.inline.hpp"
30 #include "gc_interface/collectedHeap.inline.hpp"
31 #include "memory/genOopClosures.inline.hpp"
32 #include "memory/iterator.inline.hpp"
33 #include "memory/metadataFactory.hpp"
34 #include "memory/resourceArea.hpp"
35 #include "memory/universe.inline.hpp"
36 #include "oops/instanceKlass.hpp"
37 #include "oops/klass.inline.hpp"
38 #include "oops/objArrayKlass.inline.hpp"
39 #include "oops/objArrayOop.inline.hpp"
40 #include "oops/oop.inline.hpp"
41 #include "oops/symbol.hpp"
42 #include "runtime/handles.inline.hpp"
43 #include "runtime/mutexLocker.hpp"
44 #include "runtime/orderAccess.inline.hpp"
45 #include "utilities/copy.hpp"
46 #include "utilities/macros.hpp"
47 #if INCLUDE_ALL_GCS
48 #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp"
49 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
50 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
51 #include "gc_implementation/g1/g1RemSet.inline.hpp"
52 #include "gc_implementation/g1/heapRegionManager.inline.hpp"
53 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
54 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
55 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
56 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
57 #include "oops/oop.pcgc.inline.hpp"
58 #endif // INCLUDE_ALL_GCS
59
60 ObjArrayKlass* ObjArrayKlass::allocate(ClassLoaderData* loader_data, int n, KlassHandle klass_handle, Symbol* name, TRAPS) {
61 assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
62 "array klasses must be same size as InstanceKlass");
63
64 int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
65
66 return new (loader_data, size, THREAD) ObjArrayKlass(n, klass_handle, name);
67 }
68
69 Klass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_data,
70 int n, KlassHandle element_klass, TRAPS) {
71
72 // Eagerly allocate the direct array supertype.
73 KlassHandle super_klass = KlassHandle();
74 if (!Universe::is_bootstrapping() || SystemDictionary::Object_klass_loaded()) {
75 KlassHandle element_super (THREAD, element_klass->super());
76 if (element_super.not_null()) {
77 // The element type has a direct super. E.g., String[] has direct super of Object[].
78 super_klass = KlassHandle(THREAD, element_super->array_klass_or_null());
79 bool supers_exist = super_klass.not_null();
80 // Also, see if the element has secondary supertypes.
81 // We need an array type for each.
82 Array<Klass*>* element_supers = element_klass->secondary_supers();
83 for( int i = element_supers->length()-1; i >= 0; i-- ) {
84 Klass* elem_super = element_supers->at(i);
85 if (elem_super->array_klass_or_null() == NULL) {
86 supers_exist = false;
87 break;
88 }
89 }
90 if (!supers_exist) {
91 // Oops. Not allocated yet. Back out, allocate it, and retry.
92 KlassHandle ek;
93 {
94 MutexUnlocker mu(MultiArray_lock);
95 MutexUnlocker mc(Compile_lock); // for vtables
96 Klass* sk = element_super->array_klass(CHECK_0);
97 super_klass = KlassHandle(THREAD, sk);
98 for( int i = element_supers->length()-1; i >= 0; i-- ) {
99 KlassHandle elem_super (THREAD, element_supers->at(i));
100 elem_super->array_klass(CHECK_0);
101 }
102 // Now retry from the beginning
103 Klass* klass_oop = element_klass->array_klass(n, CHECK_0);
104 // Create a handle because the enclosing brace, when locking
105 // can cause a gc. Better to have this function return a Handle.
106 ek = KlassHandle(THREAD, klass_oop);
107 } // re-lock
108 return ek();
109 }
110 } else {
111 // The element type is already Object. Object[] has direct super of Object.
112 super_klass = KlassHandle(THREAD, SystemDictionary::Object_klass());
113 }
114 }
115
116 // Create type name for klass.
117 Symbol* name = NULL;
118 if (!element_klass->oop_is_instance() ||
119 (name = InstanceKlass::cast(element_klass())->array_name()) == NULL) {
120
121 ResourceMark rm(THREAD);
122 char *name_str = element_klass->name()->as_C_string();
123 int len = element_klass->name()->utf8_length();
124 char *new_str = NEW_RESOURCE_ARRAY(char, len + 4);
125 int idx = 0;
126 new_str[idx++] = '[';
127 if (element_klass->oop_is_instance()) { // it could be an array or simple type
128 new_str[idx++] = 'L';
129 }
130 memcpy(&new_str[idx], name_str, len * sizeof(char));
131 idx += len;
132 if (element_klass->oop_is_instance()) {
133 new_str[idx++] = ';';
134 }
135 new_str[idx++] = '\0';
136 name = SymbolTable::new_permanent_symbol(new_str, CHECK_0);
137 if (element_klass->oop_is_instance()) {
138 InstanceKlass* ik = InstanceKlass::cast(element_klass());
139 ik->set_array_name(name);
140 }
141 }
142
143 // Initialize instance variables
144 ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_0);
145
146 // Add all classes to our internal class loader list here,
147 // including classes in the bootstrap (NULL) class loader.
148 // GC walks these as strong roots.
149 loader_data->add_class(oak);
150
151 // Call complete_create_array_klass after all instance variables has been initialized.
152 ArrayKlass::complete_create_array_klass(oak, super_klass, CHECK_0);
153
154 return oak;
155 }
156
157 ObjArrayKlass::ObjArrayKlass(int n, KlassHandle element_klass, Symbol* name) : ArrayKlass(name) {
158 this->set_dimension(n);
159 this->set_element_klass(element_klass());
160 // decrement refcount because object arrays are not explicitly freed. The
161 // InstanceKlass array_name() keeps the name counted while the klass is
162 // loaded.
163 name->decrement_refcount();
164
165 Klass* bk;
166 if (element_klass->oop_is_objArray()) {
167 bk = ObjArrayKlass::cast(element_klass())->bottom_klass();
168 } else {
169 bk = element_klass();
170 }
171 assert(bk != NULL && (bk->oop_is_instance() || bk->oop_is_typeArray()), "invalid bottom klass");
172 this->set_bottom_klass(bk);
173 this->set_class_loader_data(bk->class_loader_data());
174
175 this->set_layout_helper(array_layout_helper(T_OBJECT));
176 assert(this->oop_is_array(), "sanity");
177 assert(this->oop_is_objArray(), "sanity");
178 }
179
180 int ObjArrayKlass::oop_size(oop obj) const {
181 assert(obj->is_objArray(), "must be object array");
182 return objArrayOop(obj)->object_size();
183 }
184
185 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
186 if (length >= 0) {
187 if (length <= arrayOopDesc::max_array_length(T_OBJECT)) {
188 int size = objArrayOopDesc::object_size(length);
189 KlassHandle h_k(THREAD, this);
190 return (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, THREAD);
191 } else {
192 report_java_out_of_memory("Requested array size exceeds VM limit");
193 JvmtiExport::post_array_size_exhausted();
194 THROW_OOP_0(Universe::out_of_memory_error_array_size());
195 }
196 } else {
197 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
198 }
199 }
200
201 static int multi_alloc_counter = 0;
202
203 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
204 int length = *sizes;
205 // Call to lower_dimension uses this pointer, so most be called before a
206 // possible GC
207 KlassHandle h_lower_dimension(THREAD, lower_dimension());
208 // If length < 0 allocate will throw an exception.
209 objArrayOop array = allocate(length, CHECK_NULL);
210 objArrayHandle h_array (THREAD, array);
211 if (rank > 1) {
212 if (length != 0) {
213 for (int index = 0; index < length; index++) {
214 ArrayKlass* ak = ArrayKlass::cast(h_lower_dimension());
215 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
216 h_array->obj_at_put(index, sub_array);
217 }
218 } else {
219 // Since this array dimension has zero length, nothing will be
220 // allocated, however the lower dimension values must be checked
221 // for illegal values.
222 for (int i = 0; i < rank - 1; ++i) {
223 sizes += 1;
224 if (*sizes < 0) {
225 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
226 }
227 }
228 }
229 }
230 return h_array();
231 }
232
233 // Either oop or narrowOop depending on UseCompressedOops.
234 template <class T> void ObjArrayKlass::do_copy(arrayOop s, T* src,
235 arrayOop d, T* dst, int length, TRAPS) {
236
237 BarrierSet* bs = Universe::heap()->barrier_set();
238 // For performance reasons, we assume we are that the write barrier we
239 // are using has optimized modes for arrays of references. At least one
240 // of the asserts below will fail if this is not the case.
241 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
242 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
243
244 if (s == d) {
245 // since source and destination are equal we do not need conversion checks.
246 assert(length > 0, "sanity check");
247 bs->write_ref_array_pre(dst, length);
248 Copy::conjoint_oops_atomic(src, dst, length);
249 } else {
250 // We have to make sure all elements conform to the destination array
251 Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
252 Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
253 if (stype == bound || stype->is_subtype_of(bound)) {
254 // elements are guaranteed to be subtypes, so no check necessary
255 bs->write_ref_array_pre(dst, length);
256 Copy::conjoint_oops_atomic(src, dst, length);
257 } else {
258 // slow case: need individual subtype checks
259 // note: don't use obj_at_put below because it includes a redundant store check
260 T* from = src;
261 T* end = from + length;
262 for (T* p = dst; from < end; from++, p++) {
263 // XXX this is going to be slow.
264 T element = *from;
265 // even slower now
266 bool element_is_null = oopDesc::is_null(element);
267 oop new_val = element_is_null ? oop(NULL)
268 : oopDesc::decode_heap_oop_not_null(element);
269 if (element_is_null ||
270 (new_val->klass())->is_subtype_of(bound)) {
271 bs->write_ref_field_pre(p, new_val);
272 *p = element;
273 } else {
274 // We must do a barrier to cover the partial copy.
275 const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);
276 // pointer delta is scaled to number of elements (length field in
277 // objArrayOop) which we assume is 32 bit.
278 assert(pd == (size_t)(int)pd, "length field overflow");
279 bs->write_ref_array((HeapWord*)dst, pd);
280 THROW(vmSymbols::java_lang_ArrayStoreException());
281 return;
282 }
283 }
284 }
285 }
286 bs->write_ref_array((HeapWord*)dst, length);
287 }
288
289 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
290 int dst_pos, int length, TRAPS) {
291 assert(s->is_objArray(), "must be obj array");
292
293 if (!d->is_objArray()) {
294 THROW(vmSymbols::java_lang_ArrayStoreException());
295 }
296
297 // Check is all offsets and lengths are non negative
298 if (src_pos < 0 || dst_pos < 0 || length < 0) {
299 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
300 }
301 // Check if the ranges are valid
302 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
303 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
304 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
305 }
306
307 // Special case. Boundary cases must be checked first
308 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
309 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
310 // points to the right of the last element.
311 if (length==0) {
312 return;
313 }
314 if (UseCompressedOops) {
315 narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);
316 narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);
317 do_copy<narrowOop>(s, src, d, dst, length, CHECK);
318 } else {
319 oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);
320 oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);
321 do_copy<oop> (s, src, d, dst, length, CHECK);
322 }
323 }
324
325
326 Klass* ObjArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
327
328 assert(dimension() <= n, "check order of chain");
329 int dim = dimension();
330 if (dim == n) return this;
331
332 if (higher_dimension() == NULL) {
333 if (or_null) return NULL;
334
335 ResourceMark rm;
336 JavaThread *jt = (JavaThread *)THREAD;
337 {
338 MutexLocker mc(Compile_lock, THREAD); // for vtables
339 // Ensure atomic creation of higher dimensions
340 MutexLocker mu(MultiArray_lock, THREAD);
341
342 // Check if another thread beat us
343 if (higher_dimension() == NULL) {
344
345 // Create multi-dim klass object and link them together
346 Klass* k =
347 ObjArrayKlass::allocate_objArray_klass(class_loader_data(), dim + 1, this, CHECK_NULL);
348 ObjArrayKlass* ak = ObjArrayKlass::cast(k);
349 ak->set_lower_dimension(this);
350 OrderAccess::storestore();
351 set_higher_dimension(ak);
352 assert(ak->oop_is_objArray(), "incorrect initialization of ObjArrayKlass");
353 }
354 }
355 } else {
356 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
357 }
358
359 ObjArrayKlass *ak = ObjArrayKlass::cast(higher_dimension());
360 if (or_null) {
361 return ak->array_klass_or_null(n);
362 }
363 return ak->array_klass(n, THREAD);
364 }
365
366 Klass* ObjArrayKlass::array_klass_impl(bool or_null, TRAPS) {
367 return array_klass_impl(or_null, dimension() + 1, THREAD);
368 }
369
370 bool ObjArrayKlass::can_be_primary_super_slow() const {
371 if (!bottom_klass()->can_be_primary_super())
372 // array of interfaces
373 return false;
374 else
375 return Klass::can_be_primary_super_slow();
376 }
377
378 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots) {
379 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
380 Array<Klass*>* elem_supers = element_klass()->secondary_supers();
381 int num_elem_supers = elem_supers == NULL ? 0 : elem_supers->length();
382 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
383 if (num_secondaries == 2) {
384 // Must share this for correct bootstrapping!
385 set_secondary_supers(Universe::the_array_interfaces_array());
386 return NULL;
387 } else {
388 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2);
389 secondaries->push(SystemDictionary::Cloneable_klass());
390 secondaries->push(SystemDictionary::Serializable_klass());
391 for (int i = 0; i < num_elem_supers; i++) {
392 Klass* elem_super = (Klass*) elem_supers->at(i);
393 Klass* array_super = elem_super->array_klass_or_null();
394 assert(array_super != NULL, "must already have been created");
395 secondaries->push(array_super);
396 }
397 return secondaries;
398 }
399 }
400
401 bool ObjArrayKlass::compute_is_subtype_of(Klass* k) {
402 if (!k->oop_is_objArray())
403 return ArrayKlass::compute_is_subtype_of(k);
404
405 ObjArrayKlass* oak = ObjArrayKlass::cast(k);
406 return element_klass()->is_subtype_of(oak->element_klass());
407 }
408
409 void ObjArrayKlass::initialize(TRAPS) {
410 bottom_klass()->initialize(THREAD); // dispatches to either InstanceKlass or TypeArrayKlass
411 }
412
413 #define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \
414 { \
415 T* p = (T*)(a)->base(); \
416 T* const end = p + (a)->length(); \
417 while (p < end) { \
418 do_oop; \
419 p++; \
420 } \
421 }
422
423 #define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \
424 { \
425 T* const l = (T*)(low); \
426 T* const h = (T*)(high); \
427 T* p = (T*)(a)->base(); \
428 T* end = p + (a)->length(); \
429 if (p < l) p = l; \
430 if (end > h) end = h; \
431 while (p < end) { \
432 do_oop; \
433 ++p; \
434 } \
435 }
436
437 #define ObjArrayKlass_OOP_ITERATE(a, p, do_oop) \
438 if (UseCompressedOops) { \
439 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
440 a, p, do_oop) \
441 } else { \
442 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop, \
443 a, p, do_oop) \
444 }
445
446 #define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \
447 if (UseCompressedOops) { \
448 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
449 a, p, low, high, do_oop) \
450 } else { \
451 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
452 a, p, low, high, do_oop) \
453 }
454
455 void ObjArrayKlass::oop_follow_contents(oop obj) {
456 assert (obj->is_array(), "obj must be array");
457 MarkSweep::follow_klass(obj->klass());
458 if (UseCompressedOops) {
459 objarray_follow_contents<narrowOop>(obj, 0);
460 } else {
461 objarray_follow_contents<oop>(obj, 0);
462 }
463 }
464
465 #if INCLUDE_ALL_GCS
466 void ObjArrayKlass::oop_follow_contents(ParCompactionManager* cm,
467 oop obj) {
468 assert(obj->is_array(), "obj must be array");
469 PSParallelCompact::follow_klass(cm, obj->klass());
470 if (UseCompressedOops) {
471 objarray_follow_contents<narrowOop>(cm, obj, 0);
472 } else {
473 objarray_follow_contents<oop>(cm, obj, 0);
474 }
475 }
476 #endif // INCLUDE_ALL_GCS
477
478 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
479 \
480 int ObjArrayKlass::oop_oop_iterate##nv_suffix(oop obj, \
481 OopClosureType* closure) { \
482 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
483 assert (obj->is_array(), "obj must be array"); \
484 objArrayOop a = objArrayOop(obj); \
485 /* Get size before changing pointers. */ \
486 /* Don't call size() or oop_size() since that is a virtual call. */ \
487 int size = a->object_size(); \
488 if_do_metadata_checked(closure, nv_suffix) { \
489 closure->do_klass##nv_suffix(obj->klass()); \
490 } \
491 ObjArrayKlass_OOP_ITERATE(a, p, (closure)->do_oop##nv_suffix(p)) \
492 return size; \
493 }
494
495 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
496 \
497 int ObjArrayKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
498 OopClosureType* closure, \
499 MemRegion mr) { \
500 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
501 assert(obj->is_array(), "obj must be array"); \
502 objArrayOop a = objArrayOop(obj); \
503 /* Get size before changing pointers. */ \
504 /* Don't call size() or oop_size() since that is a virtual call */ \
505 int size = a->object_size(); \
506 if_do_metadata_checked(closure, nv_suffix) { \
507 /* SSS: Do we need to pass down mr here? */ \
508 closure->do_klass##nv_suffix(a->klass()); \
509 } \
510 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
511 a, p, mr.start(), mr.end(), (closure)->do_oop##nv_suffix(p)) \
512 return size; \
513 }
514
515 // Like oop_oop_iterate but only iterates over a specified range and only used
516 // for objArrayOops.
517 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r(OopClosureType, nv_suffix) \
518 \
519 int ObjArrayKlass::oop_oop_iterate_range##nv_suffix(oop obj, \
520 OopClosureType* closure, \
521 int start, int end) { \
522 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
523 assert(obj->is_array(), "obj must be array"); \
524 objArrayOop a = objArrayOop(obj); \
525 /* Get size before changing pointers. */ \
526 /* Don't call size() or oop_size() since that is a virtual call */ \
527 int size = a->object_size(); \
528 if (UseCompressedOops) { \
529 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<narrowOop>(start);\
530 /* this might be wierd if end needs to be aligned on HeapWord boundary */ \
531 HeapWord* high = (HeapWord*)((narrowOop*)a->base() + end); \
532 MemRegion mr(low, high); \
533 if_do_metadata_checked(closure, nv_suffix) { \
534 /* SSS: Do we need to pass down mr here? */ \
535 closure->do_klass##nv_suffix(a->klass()); \
536 } \
537 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
538 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
539 } else { \
540 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<oop>(start); \
541 HeapWord* high = (HeapWord*)((oop*)a->base() + end); \
542 MemRegion mr(low, high); \
543 if_do_metadata_checked(closure, nv_suffix) { \
544 /* SSS: Do we need to pass down mr here? */ \
545 closure->do_klass##nv_suffix(a->klass()); \
546 } \
547 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
548 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
549 } \
550 return size; \
551 }
552
553 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
554 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
555 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
556 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
557 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
558 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
559
560 int ObjArrayKlass::oop_adjust_pointers(oop obj) {
561 assert(obj->is_objArray(), "obj must be obj array");
562 objArrayOop a = objArrayOop(obj);
563 // Get size before changing pointers.
564 // Don't call size() or oop_size() since that is a virtual call.
565 int size = a->object_size();
566 ObjArrayKlass_OOP_ITERATE(a, p, MarkSweep::adjust_pointer(p))
567 return size;
568 }
569
570 #if INCLUDE_ALL_GCS
571 void ObjArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
572 assert(obj->is_objArray(), "obj must be obj array");
573 ObjArrayKlass_OOP_ITERATE( \
574 objArrayOop(obj), p, \
575 if (PSScavenge::should_scavenge(p)) { \
576 pm->claim_or_forward_depth(p); \
577 })
578 }
579
580 int ObjArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
581 assert (obj->is_objArray(), "obj must be obj array");
582 objArrayOop a = objArrayOop(obj);
583 int size = a->object_size();
584 ObjArrayKlass_OOP_ITERATE(a, p, PSParallelCompact::adjust_pointer(p))
585 return size;
586 }
587 #endif // INCLUDE_ALL_GCS
588
589 // JVM support
590
591 jint ObjArrayKlass::compute_modifier_flags(TRAPS) const {
592 // The modifier for an objectArray is the same as its element
593 if (element_klass() == NULL) {
594 assert(Universe::is_bootstrapping(), "partial objArray only at startup");
595 return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
596 }
597 // Return the flags of the bottom element type.
598 jint element_flags = bottom_klass()->compute_modifier_flags(CHECK_0);
599
600 return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
601 | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
602 }
603
604
605 // Printing
606
607 void ObjArrayKlass::print_on(outputStream* st) const {
608 #ifndef PRODUCT
609 Klass::print_on(st);
610 st->print(" - instance klass: ");
611 element_klass()->print_value_on(st);
612 st->cr();
613 #endif //PRODUCT
614 }
615
616 void ObjArrayKlass::print_value_on(outputStream* st) const {
617 assert(is_klass(), "must be klass");
618
619 element_klass()->print_value_on(st);
620 st->print("[]");
621 }
622
623 #ifndef PRODUCT
624
625 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
626 ArrayKlass::oop_print_on(obj, st);
627 assert(obj->is_objArray(), "must be objArray");
628 objArrayOop oa = objArrayOop(obj);
629 int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
630 for(int index = 0; index < print_len; index++) {
631 st->print(" - %3d : ", index);
632 oa->obj_at(index)->print_value_on(st);
633 st->cr();
634 }
635 int remaining = oa->length() - print_len;
636 if (remaining > 0) {
637 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
638 }
639 }
640
641 #endif //PRODUCT
642
643 static int max_objArray_print_length = 4;
644
645 void ObjArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
646 assert(obj->is_objArray(), "must be objArray");
647 st->print("a ");
648 element_klass()->print_value_on(st);
649 int len = objArrayOop(obj)->length();
650 st->print("[%d] ", len);
651 obj->print_address_on(st);
652 if (NOT_PRODUCT(PrintOopAddress ||) PrintMiscellaneous && (WizardMode || Verbose)) {
653 st->print("{");
654 for (int i = 0; i < len; i++) {
655 if (i > max_objArray_print_length) {
656 st->print("..."); break;
657 }
658 st->print(" "INTPTR_FORMAT, (intptr_t)(void*)objArrayOop(obj)->obj_at(i));
659 }
660 st->print(" }");
661 }
662 }
663
664 const char* ObjArrayKlass::internal_name() const {
665 return external_name();
666 }
667
668
669 // Verification
670
671 void ObjArrayKlass::verify_on(outputStream* st) {
672 ArrayKlass::verify_on(st);
673 guarantee(element_klass()->is_klass(), "should be klass");
674 guarantee(bottom_klass()->is_klass(), "should be klass");
675 Klass* bk = bottom_klass();
676 guarantee(bk->oop_is_instance() || bk->oop_is_typeArray(), "invalid bottom klass");
677 }
678
679 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
680 ArrayKlass::oop_verify_on(obj, st);
681 guarantee(obj->is_objArray(), "must be objArray");
682 objArrayOop oa = objArrayOop(obj);
683 for(int index = 0; index < oa->length(); index++) {
684 guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop");
685 }
686 }