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