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