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