1 /*
2 * Copyright (c) 1997, 2009, 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 "incls/_precompiled.incl"
26 # include "incls/_objArrayKlass.cpp.incl"
27
28 int objArrayKlass::oop_size(oop obj) const {
29 assert(obj->is_objArray(), "must be object array");
30 return objArrayOop(obj)->object_size();
31 }
32
33 objArrayOop objArrayKlass::allocate(int length, TRAPS) {
34 if (length >= 0) {
35 if (length <= arrayOopDesc::max_array_length(T_OBJECT)) {
36 int size = objArrayOopDesc::object_size(length);
37 KlassHandle h_k(THREAD, as_klassOop());
38 objArrayOop a = (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, CHECK_NULL);
39 assert(a->is_parsable(), "Can't publish unless parsable");
40 return a;
41 } else {
42 report_java_out_of_memory("Requested array size exceeds VM limit");
43 THROW_OOP_0(Universe::out_of_memory_error_array_size());
44 }
45 } else {
46 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
47 }
48 }
49
50 static int multi_alloc_counter = 0;
51
52 oop objArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
53 int length = *sizes;
54 // Call to lower_dimension uses this pointer, so most be called before a
55 // possible GC
56 KlassHandle h_lower_dimension(THREAD, lower_dimension());
57 // If length < 0 allocate will throw an exception.
58 objArrayOop array = allocate(length, CHECK_NULL);
59 assert(array->is_parsable(), "Don't handlize unless parsable");
60 objArrayHandle h_array (THREAD, array);
61 if (rank > 1) {
62 if (length != 0) {
63 for (int index = 0; index < length; index++) {
64 arrayKlass* ak = arrayKlass::cast(h_lower_dimension());
65 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
66 assert(sub_array->is_parsable(), "Don't publish until parsable");
67 h_array->obj_at_put(index, sub_array);
68 }
69 } else {
70 // Since this array dimension has zero length, nothing will be
71 // allocated, however the lower dimension values must be checked
72 // for illegal values.
73 for (int i = 0; i < rank - 1; ++i) {
74 sizes += 1;
75 if (*sizes < 0) {
76 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
77 }
78 }
79 }
80 }
81 return h_array();
82 }
83
84 // Either oop or narrowOop depending on UseCompressedOops.
85 template <class T> void objArrayKlass::do_copy(arrayOop s, T* src,
86 arrayOop d, T* dst, int length, TRAPS) {
87
88 BarrierSet* bs = Universe::heap()->barrier_set();
89 // For performance reasons, we assume we are that the write barrier we
90 // are using has optimized modes for arrays of references. At least one
91 // of the asserts below will fail if this is not the case.
92 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
93 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
94
95 if (s == d) {
96 // since source and destination are equal we do not need conversion checks.
97 assert(length > 0, "sanity check");
98 bs->write_ref_array_pre(dst, length);
99 Copy::conjoint_oops_atomic(src, dst, length);
100 } else {
101 // We have to make sure all elements conform to the destination array
102 klassOop bound = objArrayKlass::cast(d->klass())->element_klass();
103 klassOop stype = objArrayKlass::cast(s->klass())->element_klass();
104 if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) {
105 // elements are guaranteed to be subtypes, so no check necessary
106 bs->write_ref_array_pre(dst, length);
107 Copy::conjoint_oops_atomic(src, dst, length);
108 } else {
109 // slow case: need individual subtype checks
110 // note: don't use obj_at_put below because it includes a redundant store check
111 T* from = src;
112 T* end = from + length;
113 for (T* p = dst; from < end; from++, p++) {
114 // XXX this is going to be slow.
115 T element = *from;
116 // even slower now
117 bool element_is_null = oopDesc::is_null(element);
118 oop new_val = element_is_null ? oop(NULL)
119 : oopDesc::decode_heap_oop_not_null(element);
120 if (element_is_null ||
121 Klass::cast((new_val->klass()))->is_subtype_of(bound)) {
122 bs->write_ref_field_pre(p, new_val);
123 *p = *from;
124 } else {
125 // We must do a barrier to cover the partial copy.
126 const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);
127 // pointer delta is scaled to number of elements (length field in
128 // objArrayOop) which we assume is 32 bit.
129 assert(pd == (size_t)(int)pd, "length field overflow");
130 bs->write_ref_array((HeapWord*)dst, pd);
131 THROW(vmSymbols::java_lang_ArrayStoreException());
132 return;
133 }
134 }
135 }
136 }
137 bs->write_ref_array((HeapWord*)dst, length);
138 }
139
140 void objArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
141 int dst_pos, int length, TRAPS) {
142 assert(s->is_objArray(), "must be obj array");
143
144 if (!d->is_objArray()) {
145 THROW(vmSymbols::java_lang_ArrayStoreException());
146 }
147
148 // Check is all offsets and lengths are non negative
149 if (src_pos < 0 || dst_pos < 0 || length < 0) {
150 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
151 }
152 // Check if the ranges are valid
153 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
154 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
155 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
156 }
157
158 // Special case. Boundary cases must be checked first
159 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
160 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
161 // points to the right of the last element.
162 if (length==0) {
163 return;
164 }
165 if (UseCompressedOops) {
166 narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);
167 narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);
168 do_copy<narrowOop>(s, src, d, dst, length, CHECK);
169 } else {
170 oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);
171 oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);
172 do_copy<oop> (s, src, d, dst, length, CHECK);
173 }
174 }
175
176
177 klassOop objArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
178 objArrayKlassHandle h_this(THREAD, as_klassOop());
179 return array_klass_impl(h_this, or_null, n, CHECK_NULL);
180 }
181
182
183 klassOop objArrayKlass::array_klass_impl(objArrayKlassHandle this_oop, bool or_null, int n, TRAPS) {
184
185 assert(this_oop->dimension() <= n, "check order of chain");
186 int dimension = this_oop->dimension();
187 if (dimension == n)
188 return this_oop();
189
190 objArrayKlassHandle ak (THREAD, this_oop->higher_dimension());
191 if (ak.is_null()) {
192 if (or_null) return NULL;
193
194 ResourceMark rm;
195 JavaThread *jt = (JavaThread *)THREAD;
196 {
197 MutexLocker mc(Compile_lock, THREAD); // for vtables
198 // Ensure atomic creation of higher dimensions
199 MutexLocker mu(MultiArray_lock, THREAD);
200
201 // Check if another thread beat us
202 ak = objArrayKlassHandle(THREAD, this_oop->higher_dimension());
203 if( ak.is_null() ) {
204
205 // Create multi-dim klass object and link them together
206 klassOop new_klass =
207 objArrayKlassKlass::cast(Universe::objArrayKlassKlassObj())->
208 allocate_objArray_klass(dimension + 1, this_oop, CHECK_NULL);
209 ak = objArrayKlassHandle(THREAD, new_klass);
210 this_oop->set_higher_dimension(ak());
211 ak->set_lower_dimension(this_oop());
212 assert(ak->oop_is_objArray(), "incorrect initialization of objArrayKlass");
213 }
214 }
215 } else {
216 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
217 }
218
219 if (or_null) {
220 return ak->array_klass_or_null(n);
221 }
222 return ak->array_klass(n, CHECK_NULL);
223 }
224
225 klassOop objArrayKlass::array_klass_impl(bool or_null, TRAPS) {
226 return array_klass_impl(or_null, dimension() + 1, CHECK_NULL);
227 }
228
229 bool objArrayKlass::can_be_primary_super_slow() const {
230 if (!bottom_klass()->klass_part()->can_be_primary_super())
231 // array of interfaces
232 return false;
233 else
234 return Klass::can_be_primary_super_slow();
235 }
236
237 objArrayOop objArrayKlass::compute_secondary_supers(int num_extra_slots, TRAPS) {
238 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
239 objArrayOop es = Klass::cast(element_klass())->secondary_supers();
240 objArrayHandle elem_supers (THREAD, es);
241 int num_elem_supers = elem_supers.is_null() ? 0 : elem_supers->length();
242 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
243 if (num_secondaries == 2) {
244 // Must share this for correct bootstrapping!
245 return Universe::the_array_interfaces_array();
246 } else {
247 objArrayOop sec_oop = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL);
248 objArrayHandle secondaries(THREAD, sec_oop);
249 secondaries->obj_at_put(num_extra_slots+0, SystemDictionary::Cloneable_klass());
250 secondaries->obj_at_put(num_extra_slots+1, SystemDictionary::Serializable_klass());
251 for (int i = 0; i < num_elem_supers; i++) {
252 klassOop elem_super = (klassOop) elem_supers->obj_at(i);
253 klassOop array_super = elem_super->klass_part()->array_klass_or_null();
254 assert(array_super != NULL, "must already have been created");
255 secondaries->obj_at_put(num_extra_slots+2+i, array_super);
256 }
257 return secondaries();
258 }
259 }
260
261 bool objArrayKlass::compute_is_subtype_of(klassOop k) {
262 if (!k->klass_part()->oop_is_objArray())
263 return arrayKlass::compute_is_subtype_of(k);
264
265 objArrayKlass* oak = objArrayKlass::cast(k);
266 return element_klass()->klass_part()->is_subtype_of(oak->element_klass());
267 }
268
269 void objArrayKlass::initialize(TRAPS) {
270 Klass::cast(bottom_klass())->initialize(THREAD); // dispatches to either instanceKlass or typeArrayKlass
271 }
272
273 #define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \
274 { \
275 T* p = (T*)(a)->base(); \
276 T* const end = p + (a)->length(); \
277 while (p < end) { \
278 do_oop; \
279 p++; \
280 } \
281 }
282
283 #define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \
284 { \
285 T* const l = (T*)(low); \
286 T* const h = (T*)(high); \
287 T* p = (T*)(a)->base(); \
288 T* end = p + (a)->length(); \
289 if (p < l) p = l; \
290 if (end > h) end = h; \
291 while (p < end) { \
292 do_oop; \
293 ++p; \
294 } \
295 }
296
297 #define ObjArrayKlass_OOP_ITERATE(a, p, do_oop) \
298 if (UseCompressedOops) { \
299 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
300 a, p, do_oop) \
301 } else { \
302 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop, \
303 a, p, do_oop) \
304 }
305
306 #define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \
307 if (UseCompressedOops) { \
308 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
309 a, p, low, high, do_oop) \
310 } else { \
311 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
312 a, p, low, high, do_oop) \
313 }
314
315 void objArrayKlass::oop_follow_contents(oop obj) {
316 assert (obj->is_array(), "obj must be array");
317 objArrayOop(obj)->follow_header();
318 if (UseCompressedOops) {
319 objarray_follow_contents<narrowOop>(obj, 0);
320 } else {
321 objarray_follow_contents<oop>(obj, 0);
322 }
323 }
324
325 #ifndef SERIALGC
326 void objArrayKlass::oop_follow_contents(ParCompactionManager* cm,
327 oop obj) {
328 assert(obj->is_array(), "obj must be array");
329 objArrayOop(obj)->follow_header(cm);
330 if (UseCompressedOops) {
331 objarray_follow_contents<narrowOop>(cm, obj, 0);
332 } else {
333 objarray_follow_contents<oop>(cm, obj, 0);
334 }
335 }
336 #endif // SERIALGC
337
338 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
339 \
340 int objArrayKlass::oop_oop_iterate##nv_suffix(oop obj, \
341 OopClosureType* closure) { \
342 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
343 assert (obj->is_array(), "obj must be array"); \
344 objArrayOop a = objArrayOop(obj); \
345 /* Get size before changing pointers. */ \
346 /* Don't call size() or oop_size() since that is a virtual call. */ \
347 int size = a->object_size(); \
348 if (closure->do_header()) { \
349 a->oop_iterate_header(closure); \
350 } \
351 ObjArrayKlass_OOP_ITERATE(a, p, (closure)->do_oop##nv_suffix(p)) \
352 return size; \
353 }
354
355 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
356 \
357 int objArrayKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
358 OopClosureType* closure, \
359 MemRegion mr) { \
360 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
361 assert(obj->is_array(), "obj must be array"); \
362 objArrayOop a = objArrayOop(obj); \
363 /* Get size before changing pointers. */ \
364 /* Don't call size() or oop_size() since that is a virtual call */ \
365 int size = a->object_size(); \
366 if (closure->do_header()) { \
367 a->oop_iterate_header(closure, mr); \
368 } \
369 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
370 a, p, mr.start(), mr.end(), (closure)->do_oop##nv_suffix(p)) \
371 return size; \
372 }
373
374 // Like oop_oop_iterate but only iterates over a specified range and only used
375 // for objArrayOops.
376 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r(OopClosureType, nv_suffix) \
377 \
378 int objArrayKlass::oop_oop_iterate_range##nv_suffix(oop obj, \
379 OopClosureType* closure, \
380 int start, int end) { \
381 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
382 assert(obj->is_array(), "obj must be array"); \
383 objArrayOop a = objArrayOop(obj); \
384 /* Get size before changing pointers. */ \
385 /* Don't call size() or oop_size() since that is a virtual call */ \
386 int size = a->object_size(); \
387 if (UseCompressedOops) { \
388 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<narrowOop>(start);\
389 /* this might be wierd if end needs to be aligned on HeapWord boundary */ \
390 HeapWord* high = (HeapWord*)((narrowOop*)a->base() + end); \
391 MemRegion mr(low, high); \
392 if (closure->do_header()) { \
393 a->oop_iterate_header(closure, mr); \
394 } \
395 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
396 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
397 } else { \
398 HeapWord* low = start == 0 ? (HeapWord*)a : (HeapWord*)a->obj_at_addr<oop>(start); \
399 HeapWord* high = (HeapWord*)((oop*)a->base() + end); \
400 MemRegion mr(low, high); \
401 if (closure->do_header()) { \
402 a->oop_iterate_header(closure, mr); \
403 } \
404 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
405 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
406 } \
407 return size; \
408 }
409
410 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
411 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
412 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
413 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
414 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
415 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
416
417 int objArrayKlass::oop_adjust_pointers(oop obj) {
418 assert(obj->is_objArray(), "obj must be obj array");
419 objArrayOop a = objArrayOop(obj);
420 // Get size before changing pointers.
421 // Don't call size() or oop_size() since that is a virtual call.
422 int size = a->object_size();
423 a->adjust_header();
424 ObjArrayKlass_OOP_ITERATE(a, p, MarkSweep::adjust_pointer(p))
425 return size;
426 }
427
428 #ifndef SERIALGC
429 void objArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
430 assert(obj->is_objArray(), "obj must be obj array");
431 ObjArrayKlass_OOP_ITERATE( \
432 objArrayOop(obj), p, \
433 if (PSScavenge::should_scavenge(p)) { \
434 pm->claim_or_forward_depth(p); \
435 })
436 }
437
438 int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
439 assert (obj->is_objArray(), "obj must be obj array");
440 objArrayOop a = objArrayOop(obj);
441 ObjArrayKlass_OOP_ITERATE(a, p, PSParallelCompact::adjust_pointer(p))
442 return a->object_size();
443 }
444
445 int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj,
446 HeapWord* beg_addr, HeapWord* end_addr) {
447 assert (obj->is_objArray(), "obj must be obj array");
448 objArrayOop a = objArrayOop(obj);
449 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
450 a, p, beg_addr, end_addr, \
451 PSParallelCompact::adjust_pointer(p))
452 return a->object_size();
453 }
454 #endif // SERIALGC
455
456 // JVM support
457
458 jint objArrayKlass::compute_modifier_flags(TRAPS) const {
459 // The modifier for an objectArray is the same as its element
460 if (element_klass() == NULL) {
461 assert(Universe::is_bootstrapping(), "partial objArray only at startup");
462 return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
463 }
464 // Return the flags of the bottom element type.
465 jint element_flags = Klass::cast(bottom_klass())->compute_modifier_flags(CHECK_0);
466
467 return (element_flags & (JVM_ACC_PUBLIC | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED))
468 | (JVM_ACC_ABSTRACT | JVM_ACC_FINAL);
469 }
470
471
472 #ifndef PRODUCT
473 // Printing
474
475 void objArrayKlass::oop_print_on(oop obj, outputStream* st) {
476 arrayKlass::oop_print_on(obj, st);
477 assert(obj->is_objArray(), "must be objArray");
478 objArrayOop oa = objArrayOop(obj);
479 int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
480 for(int index = 0; index < print_len; index++) {
481 st->print(" - %3d : ", index);
482 oa->obj_at(index)->print_value_on(st);
483 st->cr();
484 }
485 int remaining = oa->length() - print_len;
486 if (remaining > 0) {
487 tty->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
488 }
489 }
490
491 #endif //PRODUCT
492
493 static int max_objArray_print_length = 4;
494
495 void objArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
496 assert(obj->is_objArray(), "must be objArray");
497 st->print("a ");
498 element_klass()->print_value_on(st);
499 int len = objArrayOop(obj)->length();
500 st->print("[%d] ", len);
501 obj->print_address_on(st);
502 if (NOT_PRODUCT(PrintOopAddress ||) PrintMiscellaneous && (WizardMode || Verbose)) {
503 st->print("{");
504 for (int i = 0; i < len; i++) {
505 if (i > max_objArray_print_length) {
506 st->print("..."); break;
507 }
508 st->print(" "INTPTR_FORMAT, (intptr_t)(void*)objArrayOop(obj)->obj_at(i));
509 }
510 st->print(" }");
511 }
512 }
513
514 const char* objArrayKlass::internal_name() const {
515 return external_name();
516 }
517
518 // Verification
519
520 void objArrayKlass::oop_verify_on(oop obj, outputStream* st) {
521 arrayKlass::oop_verify_on(obj, st);
522 guarantee(obj->is_objArray(), "must be objArray");
523 objArrayOop oa = objArrayOop(obj);
524 for(int index = 0; index < oa->length(); index++) {
525 guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop");
526 }
527 }
528
529 void objArrayKlass::oop_verify_old_oop(oop obj, oop* p, bool allow_dirty) {
530 /* $$$ move into remembered set verification?
531 RememberedSet::verify_old_oop(obj, p, allow_dirty, true);
532 */
533 }
534 void objArrayKlass::oop_verify_old_oop(oop obj, narrowOop* p, bool allow_dirty) {}