Mercurial > jdk8-mips64-public > hotspot / file revision
src/share/vm/oops/objArrayKlass.cpp@6e5a59a8e4a7
src/share/vm/oops/objArrayKlass.cpp
Tue, 09 Oct 2012 07:41:27 +0200
- author
- rbackman
- date
- Tue, 09 Oct 2012 07:41:27 +0200
- changeset 4151
- 6e5a59a8e4a7
- parent 4126
- 86af3dacab81
- parent 4142
- d8ce2825b193
- child 4278
- 070d523b96a7
- permissions
- -rw-r--r--
Merge
1 /*
2 * Copyright (c) 1997, 2012, 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 */
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/metadataFactory.hpp"
33 #include "memory/resourceArea.hpp"
34 #include "memory/universe.inline.hpp"
35 #include "oops/instanceKlass.hpp"
36 #include "oops/klass.inline.hpp"
37 #include "oops/objArrayKlass.hpp"
38 #include "oops/objArrayKlass.inline.hpp"
39 #include "oops/objArrayOop.hpp"
40 #include "oops/oop.inline.hpp"
41 #include "oops/oop.inline2.hpp"
42 #include "oops/symbol.hpp"
43 #include "runtime/handles.inline.hpp"
44 #include "runtime/mutexLocker.hpp"
45 #include "utilities/copy.hpp"
46 #ifndef SERIALGC
47 #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp"
48 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
49 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
50 #include "gc_implementation/g1/g1RemSet.inline.hpp"
51 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
52 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
53 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
54 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
55 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
56 #include "oops/oop.pcgc.inline.hpp"
57 #endif
59 ObjArrayKlass* ObjArrayKlass::allocate(ClassLoaderData* loader_data, int n, KlassHandle klass_handle, Symbol* name, TRAPS) {
60 assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
61 "array klasses must be same size as InstanceKlass");
63 int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
65 return new (loader_data, size, THREAD) ObjArrayKlass(n, klass_handle, name);
66 }
68 Klass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_data,
69 int n, KlassHandle element_klass, TRAPS) {
71 // Eagerly allocate the direct array supertype.
72 KlassHandle super_klass = KlassHandle();
73 if (!Universe::is_bootstrapping() || SystemDictionary::Object_klass_loaded()) {
74 KlassHandle element_super (THREAD, element_klass->super());
75 if (element_super.not_null()) {
76 // The element type has a direct super. E.g., String[] has direct super of Object[].
77 super_klass = KlassHandle(THREAD, element_super->array_klass_or_null());
78 bool supers_exist = super_klass.not_null();
79 // Also, see if the element has secondary supertypes.
80 // We need an array type for each.
81 Array<Klass*>* element_supers = element_klass->secondary_supers();
82 for( int i = element_supers->length()-1; i >= 0; i-- ) {
83 Klass* elem_super = element_supers->at(i);
84 if (Klass::cast(elem_super)->array_klass_or_null() == NULL) {
85 supers_exist = false;
86 break;
87 }
88 }
89 if (!supers_exist) {
90 // Oops. Not allocated yet. Back out, allocate it, and retry.
91 #ifndef PRODUCT
92 if (WizardMode) {
93 tty->print_cr("Must retry array klass creation for depth %d",n);
94 }
95 #endif
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 }
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) {
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 }
147 // Initialize instance variables
148 ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_0);
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);
155 // Call complete_create_array_klass after all instance variables has been initialized.
156 ArrayKlass::complete_create_array_klass(oak, super_klass, CHECK_0);
158 return oak;
159 }
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();
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 && (Klass::cast(bk)->oop_is_instance() || Klass::cast(bk)->oop_is_typeArray()), "invalid bottom klass");
176 this->set_bottom_klass(bk);
177 this->set_class_loader_data(bk->class_loader_data());
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 }
184 int ObjArrayKlass::oop_size(oop obj) const {
185 assert(obj->is_objArray(), "must be object array");
186 return objArrayOop(obj)->object_size();
187 }
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, CHECK_NULL);
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 }
205 static int multi_alloc_counter = 0;
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 }
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) {
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.");
248 if (s == d) {
249 // since source and destination are equal we do not need conversion checks.
250 assert(length > 0, "sanity check");
251 bs->write_ref_array_pre(dst, length);
252 Copy::conjoint_oops_atomic(src, dst, length);
253 } else {
254 // We have to make sure all elements conform to the destination array
255 Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
256 Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
257 if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) {
258 // elements are guaranteed to be subtypes, so no check necessary
259 bs->write_ref_array_pre(dst, length);
260 Copy::conjoint_oops_atomic(src, dst, length);
261 } else {
262 // slow case: need individual subtype checks
263 // note: don't use obj_at_put below because it includes a redundant store check
264 T* from = src;
265 T* end = from + length;
266 for (T* p = dst; from < end; from++, p++) {
267 // XXX this is going to be slow.
268 T element = *from;
269 // even slower now
270 bool element_is_null = oopDesc::is_null(element);
271 oop new_val = element_is_null ? oop(NULL)
272 : oopDesc::decode_heap_oop_not_null(element);
273 if (element_is_null ||
274 Klass::cast((new_val->klass()))->is_subtype_of(bound)) {
275 bs->write_ref_field_pre(p, new_val);
276 *p = *from;
277 } else {
278 // We must do a barrier to cover the partial copy.
279 const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);
280 // pointer delta is scaled to number of elements (length field in
281 // objArrayOop) which we assume is 32 bit.
282 assert(pd == (size_t)(int)pd, "length field overflow");
283 bs->write_ref_array((HeapWord*)dst, pd);
284 THROW(vmSymbols::java_lang_ArrayStoreException());
285 return;
286 }
287 }
288 }
289 }
290 bs->write_ref_array((HeapWord*)dst, length);
291 }
293 void ObjArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
294 int dst_pos, int length, TRAPS) {
295 assert(s->is_objArray(), "must be obj array");
297 if (!d->is_objArray()) {
298 THROW(vmSymbols::java_lang_ArrayStoreException());
299 }
301 // Check is all offsets and lengths are non negative
302 if (src_pos < 0 || dst_pos < 0 || length < 0) {
303 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
304 }
305 // Check if the ranges are valid
306 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
307 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
308 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
309 }
311 // Special case. Boundary cases must be checked first
312 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
313 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
314 // points to the right of the last element.
315 if (length==0) {
316 return;
317 }
318 if (UseCompressedOops) {
319 narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);
320 narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);
321 do_copy<narrowOop>(s, src, d, dst, length, CHECK);
322 } else {
323 oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);
324 oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);
325 do_copy<oop> (s, src, d, dst, length, CHECK);
326 }
327 }
330 Klass* ObjArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
332 assert(dimension() <= n, "check order of chain");
333 int dim = dimension();
334 if (dim == n) return this;
336 if (higher_dimension() == NULL) {
337 if (or_null) return NULL;
339 ResourceMark rm;
340 JavaThread *jt = (JavaThread *)THREAD;
341 {
342 MutexLocker mc(Compile_lock, THREAD); // for vtables
343 // Ensure atomic creation of higher dimensions
344 MutexLocker mu(MultiArray_lock, THREAD);
346 // Check if another thread beat us
347 if (higher_dimension() == NULL) {
349 // Create multi-dim klass object and link them together
350 Klass* k =
351 ObjArrayKlass::allocate_objArray_klass(class_loader_data(), dim + 1, this, CHECK_NULL);
352 ObjArrayKlass* ak = ObjArrayKlass::cast(k);
353 ak->set_lower_dimension(this);
354 OrderAccess::storestore();
355 set_higher_dimension(ak);
356 assert(ak->oop_is_objArray(), "incorrect initialization of ObjArrayKlass");
357 }
358 }
359 } else {
360 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
361 }
363 ObjArrayKlass *ak = ObjArrayKlass::cast(higher_dimension());
364 if (or_null) {
365 return ak->array_klass_or_null(n);
366 }
367 return ak->array_klass(n, CHECK_NULL);
368 }
370 Klass* ObjArrayKlass::array_klass_impl(bool or_null, TRAPS) {
371 return array_klass_impl(or_null, dimension() + 1, CHECK_NULL);
372 }
374 bool ObjArrayKlass::can_be_primary_super_slow() const {
375 if (!bottom_klass()->can_be_primary_super())
376 // array of interfaces
377 return false;
378 else
379 return Klass::can_be_primary_super_slow();
380 }
382 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots) {
383 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
384 Array<Klass*>* elem_supers = Klass::cast(element_klass())->secondary_supers();
385 int num_elem_supers = elem_supers == NULL ? 0 : elem_supers->length();
386 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
387 if (num_secondaries == 2) {
388 // Must share this for correct bootstrapping!
389 set_secondary_supers(Universe::the_array_interfaces_array());
390 return NULL;
391 } else {
392 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2);
393 secondaries->push(SystemDictionary::Cloneable_klass());
394 secondaries->push(SystemDictionary::Serializable_klass());
395 for (int i = 0; i < num_elem_supers; i++) {
396 Klass* elem_super = (Klass*) elem_supers->at(i);
397 Klass* array_super = elem_super->array_klass_or_null();
398 assert(array_super != NULL, "must already have been created");
399 secondaries->push(array_super);
400 }
401 return secondaries;
402 }
403 }
405 bool ObjArrayKlass::compute_is_subtype_of(Klass* k) {
406 if (!k->oop_is_objArray())
407 return ArrayKlass::compute_is_subtype_of(k);
409 ObjArrayKlass* oak = ObjArrayKlass::cast(k);
410 return element_klass()->is_subtype_of(oak->element_klass());
411 }
413 void ObjArrayKlass::initialize(TRAPS) {
414 Klass::cast(bottom_klass())->initialize(THREAD); // dispatches to either InstanceKlass or TypeArrayKlass
415 }
417 #define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \
418 { \
419 T* p = (T*)(a)->base(); \
420 T* const end = p + (a)->length(); \
421 while (p < end) { \
422 do_oop; \
423 p++; \
424 } \
425 }
427 #define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \
428 { \
429 T* const l = (T*)(low); \
430 T* const h = (T*)(high); \
431 T* p = (T*)(a)->base(); \
432 T* end = p + (a)->length(); \
433 if (p < l) p = l; \
434 if (end > h) end = h; \
435 while (p < end) { \
436 do_oop; \
437 ++p; \
438 } \
439 }
441 #define ObjArrayKlass_OOP_ITERATE(a, p, do_oop) \
442 if (UseCompressedOops) { \
443 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
444 a, p, do_oop) \
445 } else { \
446 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop, \
447 a, p, do_oop) \
448 }
450 #define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \
451 if (UseCompressedOops) { \
452 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
453 a, p, low, high, do_oop) \
454 } else { \
455 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
456 a, p, low, high, do_oop) \
457 }
459 void ObjArrayKlass::oop_follow_contents(oop obj) {
460 assert (obj->is_array(), "obj must be array");
461 MarkSweep::follow_klass(obj->klass());
462 if (UseCompressedOops) {
463 objarray_follow_contents<narrowOop>(obj, 0);
464 } else {
465 objarray_follow_contents<oop>(obj, 0);
466 }
467 }
469 #ifndef SERIALGC
470 void ObjArrayKlass::oop_follow_contents(ParCompactionManager* cm,
471 oop obj) {
472 assert(obj->is_array(), "obj must be array");
473 PSParallelCompact::follow_klass(cm, obj->klass());
474 if (UseCompressedOops) {
475 objarray_follow_contents<narrowOop>(cm, obj, 0);
476 } else {
477 objarray_follow_contents<oop>(cm, obj, 0);
478 }
479 }
480 #endif // SERIALGC
482 #define if_do_metadata_checked(closure, nv_suffix) \
483 /* Make sure the non-virtual and the virtual versions match. */ \
484 assert(closure->do_metadata##nv_suffix() == closure->do_metadata(), \
485 "Inconsistency in do_metadata"); \
486 if (closure->do_metadata##nv_suffix())
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 }
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 }
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 }
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)
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 MarkSweep::adjust_klass(a->klass());
577 ObjArrayKlass_OOP_ITERATE(a, p, MarkSweep::adjust_pointer(p))
578 return size;
579 }
581 #ifndef SERIALGC
582 void ObjArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
583 assert(obj->is_objArray(), "obj must be obj array");
584 ObjArrayKlass_OOP_ITERATE( \
585 objArrayOop(obj), p, \
586 if (PSScavenge::should_scavenge(p)) { \
587 pm->claim_or_forward_depth(p); \
588 })
589 }
591 int ObjArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
592 assert (obj->is_objArray(), "obj must be obj array");
593 objArrayOop a = objArrayOop(obj);
594 int size = a->object_size();
595 a->update_header(cm);
596 ObjArrayKlass_OOP_ITERATE(a, p, PSParallelCompact::adjust_pointer(p))
597 return size;
598 }
599 #endif // SERIALGC
601 // JVM support
603 jint ObjArrayKlass::compute_modifier_flags(TRAPS) const {
604 // The modifier for an objectArray is the same as its element
605 if (element_klass() == NULL) {
606 assert(Universe::is_bootstrapping(), "partial objArray only at startup");
607 return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
608 }
609 // Return the flags of the bottom element type.
610 jint element_flags = Klass::cast(bottom_klass())->compute_modifier_flags(CHECK_0);
612 return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
613 | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
614 }
617 // Printing
619 void ObjArrayKlass::print_on(outputStream* st) const {
620 #ifndef PRODUCT
621 Klass::print_on(st);
622 st->print(" - instance klass: ");
623 element_klass()->print_value_on(st);
624 st->cr();
625 #endif //PRODUCT
626 }
628 void ObjArrayKlass::print_value_on(outputStream* st) const {
629 assert(is_klass(), "must be klass");
631 element_klass()->print_value_on(st);
632 st->print("[]");
633 }
635 #ifndef PRODUCT
637 void ObjArrayKlass::oop_print_on(oop obj, outputStream* st) {
638 ArrayKlass::oop_print_on(obj, st);
639 assert(obj->is_objArray(), "must be objArray");
640 objArrayOop oa = objArrayOop(obj);
641 int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
642 for(int index = 0; index < print_len; index++) {
643 st->print(" - %3d : ", index);
644 oa->obj_at(index)->print_value_on(st);
645 st->cr();
646 }
647 int remaining = oa->length() - print_len;
648 if (remaining > 0) {
649 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
650 }
651 }
653 #endif //PRODUCT
655 static int max_objArray_print_length = 4;
657 void ObjArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
658 assert(obj->is_objArray(), "must be objArray");
659 st->print("a ");
660 element_klass()->print_value_on(st);
661 int len = objArrayOop(obj)->length();
662 st->print("[%d] ", len);
663 obj->print_address_on(st);
664 if (NOT_PRODUCT(PrintOopAddress ||) PrintMiscellaneous && (WizardMode || Verbose)) {
665 st->print("{");
666 for (int i = 0; i < len; i++) {
667 if (i > max_objArray_print_length) {
668 st->print("..."); break;
669 }
670 st->print(" "INTPTR_FORMAT, (intptr_t)(void*)objArrayOop(obj)->obj_at(i));
671 }
672 st->print(" }");
673 }
674 }
676 const char* ObjArrayKlass::internal_name() const {
677 return external_name();
678 }
681 // Verification
683 void ObjArrayKlass::verify_on(outputStream* st) {
684 ArrayKlass::verify_on(st);
685 guarantee(element_klass()->is_metadata(), "should be in metaspace");
686 guarantee(element_klass()->is_klass(), "should be klass");
687 guarantee(bottom_klass()->is_metadata(), "should be in metaspace");
688 guarantee(bottom_klass()->is_klass(), "should be klass");
689 Klass* bk = Klass::cast(bottom_klass());
690 guarantee(bk->oop_is_instance() || bk->oop_is_typeArray(), "invalid bottom klass");
691 }
693 void ObjArrayKlass::oop_verify_on(oop obj, outputStream* st) {
694 ArrayKlass::oop_verify_on(obj, st);
695 guarantee(obj->is_objArray(), "must be objArray");
696 objArrayOop oa = objArrayOop(obj);
697 for(int index = 0; index < oa->length(); index++) {
698 guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop");
699 }
700 }
