truffle: src/share/vm/oops/objArrayKlass.cpp annotate

annotate src/share/vm/oops/objArrayKlass.cpp @ 6087:e2961d14584b

7169934: pow(x,y) or x64 computes incorrect result when x<0 and y is an odd integer Summary: bad test for parity of y in pow(x,y) (c1, interpreter) Reviewed-by: kvn, twisti

author	roland
date	Mon, 21 May 2012 09:46:02 +0200
parents	b632e80fc9dc
children	da91efe96a93

rev	line source
0 a61af66fc99e Initial load duke parents: diff changeset	1 /*
5935 a735aec54ea4 7123170: JCK vm/jvmti/ResourceExhausted/resexh001/resexh00101/ tests fails since 7u4 b02 sspitsyn parents: 2227 diff changeset	2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
0 a61af66fc99e Initial load duke parents: diff changeset	3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
a61af66fc99e Initial load duke parents: diff changeset	4 *
a61af66fc99e Initial load duke parents: diff changeset	5 * This code is free software; you can redistribute it and/or modify it
a61af66fc99e Initial load duke parents: diff changeset	6 * under the terms of the GNU General Public License version 2 only, as
a61af66fc99e Initial load duke parents: diff changeset	7 * published by the Free Software Foundation.
a61af66fc99e Initial load duke parents: diff changeset	8 *
a61af66fc99e Initial load duke parents: diff changeset	9 * This code is distributed in the hope that it will be useful, but WITHOUT
a61af66fc99e Initial load duke parents: diff changeset	10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
a61af66fc99e Initial load duke parents: diff changeset	11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
a61af66fc99e Initial load duke parents: diff changeset	12 * version 2 for more details (a copy is included in the LICENSE file that
a61af66fc99e Initial load duke parents: diff changeset	13 * accompanied this code).
a61af66fc99e Initial load duke parents: diff changeset	14 *
a61af66fc99e Initial load duke parents: diff changeset	15 * You should have received a copy of the GNU General Public License version
a61af66fc99e Initial load duke parents: diff changeset	16 * 2 along with this work; if not, write to the Free Software Foundation,
a61af66fc99e Initial load duke parents: diff changeset	17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
a61af66fc99e Initial load duke parents: diff changeset	18 *
1552 c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 1311 diff changeset	19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 1311 diff changeset	20 * or visit www.oracle.com if you need additional information or have any
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 1311 diff changeset	21 * questions.
0 a61af66fc99e Initial load duke parents: diff changeset	22 *
a61af66fc99e Initial load duke parents: diff changeset	23 */
a61af66fc99e Initial load duke parents: diff changeset	24
1972 f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	25 #include "precompiled.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	26 #include "classfile/systemDictionary.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	27 #include "classfile/vmSymbols.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	28 #include "gc_implementation/shared/markSweep.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	29 #include "gc_interface/collectedHeap.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	30 #include "memory/genOopClosures.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	31 #include "memory/resourceArea.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	32 #include "memory/universe.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	33 #include "oops/instanceKlass.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	34 #include "oops/objArrayKlass.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	35 #include "oops/objArrayKlass.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	36 #include "oops/objArrayKlassKlass.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	37 #include "oops/objArrayOop.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	38 #include "oops/oop.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	39 #include "oops/oop.inline2.hpp"
2177 3582bf76420e 6990754: Use native memory and reference counting to implement SymbolTable coleenp parents: 2119 diff changeset	40 #include "oops/symbol.hpp"
1972 f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	41 #include "runtime/handles.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	42 #include "runtime/mutexLocker.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	43 #include "utilities/copy.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	44 #ifndef SERIALGC
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	45 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	46 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	47 #include "gc_implementation/g1/g1RemSet.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	48 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	49 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	50 #include "gc_implementation/parallelScavenge/psCompactionManager.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	51 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	52 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	53 #include "oops/oop.pcgc.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1706 diff changeset	54 #endif
0 a61af66fc99e Initial load duke parents: diff changeset	55
a61af66fc99e Initial load duke parents: diff changeset	56 int objArrayKlass::oop_size(oop obj) const {
a61af66fc99e Initial load duke parents: diff changeset	57 assert(obj->is_objArray(), "must be object array");
a61af66fc99e Initial load duke parents: diff changeset	58 return objArrayOop(obj)->object_size();
a61af66fc99e Initial load duke parents: diff changeset	59 }
a61af66fc99e Initial load duke parents: diff changeset	60
a61af66fc99e Initial load duke parents: diff changeset	61 objArrayOop objArrayKlass::allocate(int length, TRAPS) {
a61af66fc99e Initial load duke parents: diff changeset	62 if (length >= 0) {
a61af66fc99e Initial load duke parents: diff changeset	63 if (length <= arrayOopDesc::max_array_length(T_OBJECT)) {
a61af66fc99e Initial load duke parents: diff changeset	64 int size = objArrayOopDesc::object_size(length);
a61af66fc99e Initial load duke parents: diff changeset	65 KlassHandle h_k(THREAD, as_klassOop());
a61af66fc99e Initial load duke parents: diff changeset	66 objArrayOop a = (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, CHECK_NULL);
a61af66fc99e Initial load duke parents: diff changeset	67 assert(a->is_parsable(), "Can't publish unless parsable");
a61af66fc99e Initial load duke parents: diff changeset	68 return a;
a61af66fc99e Initial load duke parents: diff changeset	69 } else {
876 1413494da700 6850957: Honor -XX:OnOutOfMemoryError when array size exceeds VM limit martin parents: 665 diff changeset	70 report_java_out_of_memory("Requested array size exceeds VM limit");
5935 a735aec54ea4 7123170: JCK vm/jvmti/ResourceExhausted/resexh001/resexh00101/ tests fails since 7u4 b02 sspitsyn parents: 2227 diff changeset	71 JvmtiExport::post_array_size_exhausted();
0 a61af66fc99e Initial load duke parents: diff changeset	72 THROW_OOP_0(Universe::out_of_memory_error_array_size());
a61af66fc99e Initial load duke parents: diff changeset	73 }
a61af66fc99e Initial load duke parents: diff changeset	74 } else {
a61af66fc99e Initial load duke parents: diff changeset	75 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
a61af66fc99e Initial load duke parents: diff changeset	76 }
a61af66fc99e Initial load duke parents: diff changeset	77 }
a61af66fc99e Initial load duke parents: diff changeset	78
a61af66fc99e Initial load duke parents: diff changeset	79 static int multi_alloc_counter = 0;
a61af66fc99e Initial load duke parents: diff changeset	80
a61af66fc99e Initial load duke parents: diff changeset	81 oop objArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
a61af66fc99e Initial load duke parents: diff changeset	82 int length = *sizes;
a61af66fc99e Initial load duke parents: diff changeset	83 // Call to lower_dimension uses this pointer, so most be called before a
a61af66fc99e Initial load duke parents: diff changeset	84 // possible GC
a61af66fc99e Initial load duke parents: diff changeset	85 KlassHandle h_lower_dimension(THREAD, lower_dimension());
a61af66fc99e Initial load duke parents: diff changeset	86 // If length < 0 allocate will throw an exception.
a61af66fc99e Initial load duke parents: diff changeset	87 objArrayOop array = allocate(length, CHECK_NULL);
a61af66fc99e Initial load duke parents: diff changeset	88 assert(array->is_parsable(), "Don't handlize unless parsable");
a61af66fc99e Initial load duke parents: diff changeset	89 objArrayHandle h_array (THREAD, array);
a61af66fc99e Initial load duke parents: diff changeset	90 if (rank > 1) {
a61af66fc99e Initial load duke parents: diff changeset	91 if (length != 0) {
a61af66fc99e Initial load duke parents: diff changeset	92 for (int index = 0; index < length; index++) {
a61af66fc99e Initial load duke parents: diff changeset	93 arrayKlass* ak = arrayKlass::cast(h_lower_dimension());
a61af66fc99e Initial load duke parents: diff changeset	94 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
a61af66fc99e Initial load duke parents: diff changeset	95 assert(sub_array->is_parsable(), "Don't publish until parsable");
a61af66fc99e Initial load duke parents: diff changeset	96 h_array->obj_at_put(index, sub_array);
a61af66fc99e Initial load duke parents: diff changeset	97 }
a61af66fc99e Initial load duke parents: diff changeset	98 } else {
a61af66fc99e Initial load duke parents: diff changeset	99 // Since this array dimension has zero length, nothing will be
a61af66fc99e Initial load duke parents: diff changeset	100 // allocated, however the lower dimension values must be checked
a61af66fc99e Initial load duke parents: diff changeset	101 // for illegal values.
a61af66fc99e Initial load duke parents: diff changeset	102 for (int i = 0; i < rank - 1; ++i) {
a61af66fc99e Initial load duke parents: diff changeset	103 sizes += 1;
a61af66fc99e Initial load duke parents: diff changeset	104 if (*sizes < 0) {
a61af66fc99e Initial load duke parents: diff changeset	105 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
a61af66fc99e Initial load duke parents: diff changeset	106 }
a61af66fc99e Initial load duke parents: diff changeset	107 }
a61af66fc99e Initial load duke parents: diff changeset	108 }
a61af66fc99e Initial load duke parents: diff changeset	109 }
a61af66fc99e Initial load duke parents: diff changeset	110 return h_array();
a61af66fc99e Initial load duke parents: diff changeset	111 }
a61af66fc99e Initial load duke parents: diff changeset	112
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	113 // Either oop or narrowOop depending on UseCompressedOops.
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	114 template <class T> void objArrayKlass::do_copy(arrayOop s, T* src,
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	115 arrayOop d, T* dst, int length, TRAPS) {
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	116
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	117 BarrierSet* bs = Universe::heap()->barrier_set();
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	118 // For performance reasons, we assume we are that the write barrier we
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	119 // are using has optimized modes for arrays of references. At least one
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	120 // of the asserts below will fail if this is not the case.
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	121 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	122 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	123
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	124 if (s == d) {
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	125 // since source and destination are equal we do not need conversion checks.
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	126 assert(length > 0, "sanity check");
845 df6caf649ff7 6700789: G1: Enable use of compressed oops with G1 heaps ysr parents: 665 diff changeset	127 bs->write_ref_array_pre(dst, length);
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	128 Copy::conjoint_oops_atomic(src, dst, length);
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	129 } else {
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	130 // We have to make sure all elements conform to the destination array
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	131 klassOop bound = objArrayKlass::cast(d->klass())->element_klass();
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	132 klassOop stype = objArrayKlass::cast(s->klass())->element_klass();
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	133 if (stype == bound \|\| Klass::cast(stype)->is_subtype_of(bound)) {
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	134 // elements are guaranteed to be subtypes, so no check necessary
845 df6caf649ff7 6700789: G1: Enable use of compressed oops with G1 heaps ysr parents: 665 diff changeset	135 bs->write_ref_array_pre(dst, length);
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	136 Copy::conjoint_oops_atomic(src, dst, length);
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	137 } else {
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	138 // slow case: need individual subtype checks
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	139 // note: don't use obj_at_put below because it includes a redundant store check
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	140 T* from = src;
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	141 T* end = from + length;
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	142 for (T* p = dst; from < end; from++, p++) {
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	143 // XXX this is going to be slow.
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	144 T element = *from;
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	145 // even slower now
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	146 bool element_is_null = oopDesc::is_null(element);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	147 oop new_val = element_is_null ? oop(NULL)
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	148 : oopDesc::decode_heap_oop_not_null(element);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	149 if (element_is_null \|\|
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	150 Klass::cast((new_val->klass()))->is_subtype_of(bound)) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	151 bs->write_ref_field_pre(p, new_val);
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	152 p = from;
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	153 } else {
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	154 // We must do a barrier to cover the partial copy.
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	155 const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	156 // pointer delta is scaled to number of elements (length field in
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	157 // objArrayOop) which we assume is 32 bit.
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	158 assert(pd == (size_t)(int)pd, "length field overflow");
1091 6aa7255741f3 6906727: UseCompressedOops: some card-marking fixes related to object arrays ysr parents: 879 diff changeset	159 bs->write_ref_array((HeapWord*)dst, pd);
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	160 THROW(vmSymbols::java_lang_ArrayStoreException());
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	161 return;
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	162 }
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	163 }
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	164 }
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	165 }
1091 6aa7255741f3 6906727: UseCompressedOops: some card-marking fixes related to object arrays ysr parents: 879 diff changeset	166 bs->write_ref_array((HeapWord*)dst, length);
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	167 }
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	168
0 a61af66fc99e Initial load duke parents: diff changeset	169 void objArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d,
a61af66fc99e Initial load duke parents: diff changeset	170 int dst_pos, int length, TRAPS) {
a61af66fc99e Initial load duke parents: diff changeset	171 assert(s->is_objArray(), "must be obj array");
a61af66fc99e Initial load duke parents: diff changeset	172
a61af66fc99e Initial load duke parents: diff changeset	173 if (!d->is_objArray()) {
a61af66fc99e Initial load duke parents: diff changeset	174 THROW(vmSymbols::java_lang_ArrayStoreException());
a61af66fc99e Initial load duke parents: diff changeset	175 }
a61af66fc99e Initial load duke parents: diff changeset	176
a61af66fc99e Initial load duke parents: diff changeset	177 // Check is all offsets and lengths are non negative
a61af66fc99e Initial load duke parents: diff changeset	178 if (src_pos < 0 \|\| dst_pos < 0 \|\| length < 0) {
a61af66fc99e Initial load duke parents: diff changeset	179 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
a61af66fc99e Initial load duke parents: diff changeset	180 }
a61af66fc99e Initial load duke parents: diff changeset	181 // Check if the ranges are valid
a61af66fc99e Initial load duke parents: diff changeset	182 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
a61af66fc99e Initial load duke parents: diff changeset	183 \|\| (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
a61af66fc99e Initial load duke parents: diff changeset	184 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
a61af66fc99e Initial load duke parents: diff changeset	185 }
a61af66fc99e Initial load duke parents: diff changeset	186
a61af66fc99e Initial load duke parents: diff changeset	187 // Special case. Boundary cases must be checked first
a61af66fc99e Initial load duke parents: diff changeset	188 // This allows the following call: copy_array(s, s.length(), d.length(), 0).
a61af66fc99e Initial load duke parents: diff changeset	189 // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),
a61af66fc99e Initial load duke parents: diff changeset	190 // points to the right of the last element.
a61af66fc99e Initial load duke parents: diff changeset	191 if (length==0) {
a61af66fc99e Initial load duke parents: diff changeset	192 return;
a61af66fc99e Initial load duke parents: diff changeset	193 }
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	194 if (UseCompressedOops) {
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	195 narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	196 narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	197 do_copy<narrowOop>(s, src, d, dst, length, CHECK);
0 a61af66fc99e Initial load duke parents: diff changeset	198 } else {
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	199 oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	200 oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	201 do_copy<oop> (s, src, d, dst, length, CHECK);
0 a61af66fc99e Initial load duke parents: diff changeset	202 }
a61af66fc99e Initial load duke parents: diff changeset	203 }
a61af66fc99e Initial load duke parents: diff changeset	204
a61af66fc99e Initial load duke parents: diff changeset	205
a61af66fc99e Initial load duke parents: diff changeset	206 klassOop objArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
a61af66fc99e Initial load duke parents: diff changeset	207 objArrayKlassHandle h_this(THREAD, as_klassOop());
a61af66fc99e Initial load duke parents: diff changeset	208 return array_klass_impl(h_this, or_null, n, CHECK_NULL);
a61af66fc99e Initial load duke parents: diff changeset	209 }
a61af66fc99e Initial load duke parents: diff changeset	210
a61af66fc99e Initial load duke parents: diff changeset	211
a61af66fc99e Initial load duke parents: diff changeset	212 klassOop objArrayKlass::array_klass_impl(objArrayKlassHandle this_oop, bool or_null, int n, TRAPS) {
a61af66fc99e Initial load duke parents: diff changeset	213
a61af66fc99e Initial load duke parents: diff changeset	214 assert(this_oop->dimension() <= n, "check order of chain");
a61af66fc99e Initial load duke parents: diff changeset	215 int dimension = this_oop->dimension();
a61af66fc99e Initial load duke parents: diff changeset	216 if (dimension == n)
a61af66fc99e Initial load duke parents: diff changeset	217 return this_oop();
a61af66fc99e Initial load duke parents: diff changeset	218
a61af66fc99e Initial load duke parents: diff changeset	219 objArrayKlassHandle ak (THREAD, this_oop->higher_dimension());
a61af66fc99e Initial load duke parents: diff changeset	220 if (ak.is_null()) {
a61af66fc99e Initial load duke parents: diff changeset	221 if (or_null) return NULL;
a61af66fc99e Initial load duke parents: diff changeset	222
a61af66fc99e Initial load duke parents: diff changeset	223 ResourceMark rm;
a61af66fc99e Initial load duke parents: diff changeset	224 JavaThread jt = (JavaThread )THREAD;
a61af66fc99e Initial load duke parents: diff changeset	225 {
a61af66fc99e Initial load duke parents: diff changeset	226 MutexLocker mc(Compile_lock, THREAD); // for vtables
a61af66fc99e Initial load duke parents: diff changeset	227 // Ensure atomic creation of higher dimensions
a61af66fc99e Initial load duke parents: diff changeset	228 MutexLocker mu(MultiArray_lock, THREAD);
a61af66fc99e Initial load duke parents: diff changeset	229
a61af66fc99e Initial load duke parents: diff changeset	230 // Check if another thread beat us
a61af66fc99e Initial load duke parents: diff changeset	231 ak = objArrayKlassHandle(THREAD, this_oop->higher_dimension());
a61af66fc99e Initial load duke parents: diff changeset	232 if( ak.is_null() ) {
a61af66fc99e Initial load duke parents: diff changeset	233
a61af66fc99e Initial load duke parents: diff changeset	234 // Create multi-dim klass object and link them together
a61af66fc99e Initial load duke parents: diff changeset	235 klassOop new_klass =
a61af66fc99e Initial load duke parents: diff changeset	236 objArrayKlassKlass::cast(Universe::objArrayKlassKlassObj())->
a61af66fc99e Initial load duke parents: diff changeset	237 allocate_objArray_klass(dimension + 1, this_oop, CHECK_NULL);
a61af66fc99e Initial load duke parents: diff changeset	238 ak = objArrayKlassHandle(THREAD, new_klass);
2119 d4fca0a6abde 7011386: race in objArrayKlass::array_klass_impl kvn parents: 1972 diff changeset	239 ak->set_lower_dimension(this_oop());
d4fca0a6abde 7011386: race in objArrayKlass::array_klass_impl kvn parents: 1972 diff changeset	240 OrderAccess::storestore();
0 a61af66fc99e Initial load duke parents: diff changeset	241 this_oop->set_higher_dimension(ak());
a61af66fc99e Initial load duke parents: diff changeset	242 assert(ak->oop_is_objArray(), "incorrect initialization of objArrayKlass");
a61af66fc99e Initial load duke parents: diff changeset	243 }
a61af66fc99e Initial load duke parents: diff changeset	244 }
a61af66fc99e Initial load duke parents: diff changeset	245 } else {
a61af66fc99e Initial load duke parents: diff changeset	246 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
a61af66fc99e Initial load duke parents: diff changeset	247 }
a61af66fc99e Initial load duke parents: diff changeset	248
a61af66fc99e Initial load duke parents: diff changeset	249 if (or_null) {
a61af66fc99e Initial load duke parents: diff changeset	250 return ak->array_klass_or_null(n);
a61af66fc99e Initial load duke parents: diff changeset	251 }
a61af66fc99e Initial load duke parents: diff changeset	252 return ak->array_klass(n, CHECK_NULL);
a61af66fc99e Initial load duke parents: diff changeset	253 }
a61af66fc99e Initial load duke parents: diff changeset	254
a61af66fc99e Initial load duke parents: diff changeset	255 klassOop objArrayKlass::array_klass_impl(bool or_null, TRAPS) {
a61af66fc99e Initial load duke parents: diff changeset	256 return array_klass_impl(or_null, dimension() + 1, CHECK_NULL);
a61af66fc99e Initial load duke parents: diff changeset	257 }
a61af66fc99e Initial load duke parents: diff changeset	258
a61af66fc99e Initial load duke parents: diff changeset	259 bool objArrayKlass::can_be_primary_super_slow() const {
a61af66fc99e Initial load duke parents: diff changeset	260 if (!bottom_klass()->klass_part()->can_be_primary_super())
a61af66fc99e Initial load duke parents: diff changeset	261 // array of interfaces
a61af66fc99e Initial load duke parents: diff changeset	262 return false;
a61af66fc99e Initial load duke parents: diff changeset	263 else
a61af66fc99e Initial load duke parents: diff changeset	264 return Klass::can_be_primary_super_slow();
a61af66fc99e Initial load duke parents: diff changeset	265 }
a61af66fc99e Initial load duke parents: diff changeset	266
a61af66fc99e Initial load duke parents: diff changeset	267 objArrayOop objArrayKlass::compute_secondary_supers(int num_extra_slots, TRAPS) {
a61af66fc99e Initial load duke parents: diff changeset	268 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
a61af66fc99e Initial load duke parents: diff changeset	269 objArrayOop es = Klass::cast(element_klass())->secondary_supers();
a61af66fc99e Initial load duke parents: diff changeset	270 objArrayHandle elem_supers (THREAD, es);
a61af66fc99e Initial load duke parents: diff changeset	271 int num_elem_supers = elem_supers.is_null() ? 0 : elem_supers->length();
a61af66fc99e Initial load duke parents: diff changeset	272 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
a61af66fc99e Initial load duke parents: diff changeset	273 if (num_secondaries == 2) {
a61af66fc99e Initial load duke parents: diff changeset	274 // Must share this for correct bootstrapping!
a61af66fc99e Initial load duke parents: diff changeset	275 return Universe::the_array_interfaces_array();
a61af66fc99e Initial load duke parents: diff changeset	276 } else {
a61af66fc99e Initial load duke parents: diff changeset	277 objArrayOop sec_oop = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL);
a61af66fc99e Initial load duke parents: diff changeset	278 objArrayHandle secondaries(THREAD, sec_oop);
1142 4ce7240d622c 6914300: ciEnv should export all well known classes never parents: 1091 diff changeset	279 secondaries->obj_at_put(num_extra_slots+0, SystemDictionary::Cloneable_klass());
4ce7240d622c 6914300: ciEnv should export all well known classes never parents: 1091 diff changeset	280 secondaries->obj_at_put(num_extra_slots+1, SystemDictionary::Serializable_klass());
0 a61af66fc99e Initial load duke parents: diff changeset	281 for (int i = 0; i < num_elem_supers; i++) {
a61af66fc99e Initial load duke parents: diff changeset	282 klassOop elem_super = (klassOop) elem_supers->obj_at(i);
a61af66fc99e Initial load duke parents: diff changeset	283 klassOop array_super = elem_super->klass_part()->array_klass_or_null();
a61af66fc99e Initial load duke parents: diff changeset	284 assert(array_super != NULL, "must already have been created");
a61af66fc99e Initial load duke parents: diff changeset	285 secondaries->obj_at_put(num_extra_slots+2+i, array_super);
a61af66fc99e Initial load duke parents: diff changeset	286 }
a61af66fc99e Initial load duke parents: diff changeset	287 return secondaries();
a61af66fc99e Initial load duke parents: diff changeset	288 }
a61af66fc99e Initial load duke parents: diff changeset	289 }
a61af66fc99e Initial load duke parents: diff changeset	290
a61af66fc99e Initial load duke parents: diff changeset	291 bool objArrayKlass::compute_is_subtype_of(klassOop k) {
a61af66fc99e Initial load duke parents: diff changeset	292 if (!k->klass_part()->oop_is_objArray())
a61af66fc99e Initial load duke parents: diff changeset	293 return arrayKlass::compute_is_subtype_of(k);
a61af66fc99e Initial load duke parents: diff changeset	294
a61af66fc99e Initial load duke parents: diff changeset	295 objArrayKlass* oak = objArrayKlass::cast(k);
a61af66fc99e Initial load duke parents: diff changeset	296 return element_klass()->klass_part()->is_subtype_of(oak->element_klass());
a61af66fc99e Initial load duke parents: diff changeset	297 }
a61af66fc99e Initial load duke parents: diff changeset	298
a61af66fc99e Initial load duke parents: diff changeset	299 void objArrayKlass::initialize(TRAPS) {
a61af66fc99e Initial load duke parents: diff changeset	300 Klass::cast(bottom_klass())->initialize(THREAD); // dispatches to either instanceKlass or typeArrayKlass
a61af66fc99e Initial load duke parents: diff changeset	301 }
a61af66fc99e Initial load duke parents: diff changeset	302
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	303 #define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	304 { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	305 T* p = (T*)(a)->base(); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	306 T* const end = p + (a)->length(); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	307 while (p < end) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	308 do_oop; \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	309 p++; \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	310 } \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	311 }
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	312
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	313 #define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	314 { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	315 T* const l = (T*)(low); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	316 T* const h = (T*)(high); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	317 T* p = (T*)(a)->base(); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	318 T* end = p + (a)->length(); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	319 if (p < l) p = l; \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	320 if (end > h) end = h; \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	321 while (p < end) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	322 do_oop; \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	323 ++p; \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	324 } \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	325 }
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	326
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	327 #define ObjArrayKlass_OOP_ITERATE(a, p, do_oop) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	328 if (UseCompressedOops) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	329 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	330 a, p, do_oop) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	331 } else { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	332 ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	333 a, p, do_oop) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	334 }
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	335
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	336 #define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	337 if (UseCompressedOops) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	338 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	339 a, p, low, high, do_oop) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	340 } else { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	341 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	342 a, p, low, high, do_oop) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	343 }
0 a61af66fc99e Initial load duke parents: diff changeset	344
a61af66fc99e Initial load duke parents: diff changeset	345 void objArrayKlass::oop_follow_contents(oop obj) {
a61af66fc99e Initial load duke parents: diff changeset	346 assert (obj->is_array(), "obj must be array");
1311 2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	347 objArrayOop(obj)->follow_header();
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	348 if (UseCompressedOops) {
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	349 objarray_follow_contents<narrowOop>(obj, 0);
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	350 } else {
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	351 objarray_follow_contents<oop>(obj, 0);
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	352 }
0 a61af66fc99e Initial load duke parents: diff changeset	353 }
a61af66fc99e Initial load duke parents: diff changeset	354
a61af66fc99e Initial load duke parents: diff changeset	355 #ifndef SERIALGC
a61af66fc99e Initial load duke parents: diff changeset	356 void objArrayKlass::oop_follow_contents(ParCompactionManager* cm,
a61af66fc99e Initial load duke parents: diff changeset	357 oop obj) {
1311 2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	358 assert(obj->is_array(), "obj must be array");
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	359 objArrayOop(obj)->follow_header(cm);
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	360 if (UseCompressedOops) {
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	361 objarray_follow_contents<narrowOop>(cm, obj, 0);
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	362 } else {
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	363 objarray_follow_contents<oop>(cm, obj, 0);
2a1472c30599 4396719: Mark Sweep stack overflow on deeply nested Object arrays jcoomes parents: 1155 diff changeset	364 }
0 a61af66fc99e Initial load duke parents: diff changeset	365 }
a61af66fc99e Initial load duke parents: diff changeset	366 #endif // SERIALGC
a61af66fc99e Initial load duke parents: diff changeset	367
a61af66fc99e Initial load duke parents: diff changeset	368 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
a61af66fc99e Initial load duke parents: diff changeset	369 \
a61af66fc99e Initial load duke parents: diff changeset	370 int objArrayKlass::oop_oop_iterate##nv_suffix(oop obj, \
a61af66fc99e Initial load duke parents: diff changeset	371 OopClosureType* closure) { \
a61af66fc99e Initial load duke parents: diff changeset	372 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
a61af66fc99e Initial load duke parents: diff changeset	373 assert (obj->is_array(), "obj must be array"); \
a61af66fc99e Initial load duke parents: diff changeset	374 objArrayOop a = objArrayOop(obj); \
a61af66fc99e Initial load duke parents: diff changeset	375 /* Get size before changing pointers. */ \
a61af66fc99e Initial load duke parents: diff changeset	376 /* Don't call size() or oop_size() since that is a virtual call. */ \
a61af66fc99e Initial load duke parents: diff changeset	377 int size = a->object_size(); \
a61af66fc99e Initial load duke parents: diff changeset	378 if (closure->do_header()) { \
a61af66fc99e Initial load duke parents: diff changeset	379 a->oop_iterate_header(closure); \
a61af66fc99e Initial load duke parents: diff changeset	380 } \
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	381 ObjArrayKlass_OOP_ITERATE(a, p, (closure)->do_oop##nv_suffix(p)) \
0 a61af66fc99e Initial load duke parents: diff changeset	382 return size; \
a61af66fc99e Initial load duke parents: diff changeset	383 }
a61af66fc99e Initial load duke parents: diff changeset	384
a61af66fc99e Initial load duke parents: diff changeset	385 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
a61af66fc99e Initial load duke parents: diff changeset	386 \
a61af66fc99e Initial load duke parents: diff changeset	387 int objArrayKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
a61af66fc99e Initial load duke parents: diff changeset	388 OopClosureType* closure, \
a61af66fc99e Initial load duke parents: diff changeset	389 MemRegion mr) { \
a61af66fc99e Initial load duke parents: diff changeset	390 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
a61af66fc99e Initial load duke parents: diff changeset	391 assert(obj->is_array(), "obj must be array"); \
a61af66fc99e Initial load duke parents: diff changeset	392 objArrayOop a = objArrayOop(obj); \
a61af66fc99e Initial load duke parents: diff changeset	393 /* Get size before changing pointers. */ \
a61af66fc99e Initial load duke parents: diff changeset	394 /* Don't call size() or oop_size() since that is a virtual call */ \
a61af66fc99e Initial load duke parents: diff changeset	395 int size = a->object_size(); \
a61af66fc99e Initial load duke parents: diff changeset	396 if (closure->do_header()) { \
a61af66fc99e Initial load duke parents: diff changeset	397 a->oop_iterate_header(closure, mr); \
a61af66fc99e Initial load duke parents: diff changeset	398 } \
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	399 ObjArrayKlass_BOUNDED_OOP_ITERATE( \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	400 a, p, mr.start(), mr.end(), (closure)->do_oop##nv_suffix(p)) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	401 return size; \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	402 }
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	403
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	404 // Like oop_oop_iterate but only iterates over a specified range and only used
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	405 // for objArrayOops.
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	406 #define ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r(OopClosureType, nv_suffix) \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	407 \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	408 int objArrayKlass::oop_oop_iterate_range##nv_suffix(oop obj, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	409 OopClosureType* closure, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	410 int start, int end) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	411 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	412 assert(obj->is_array(), "obj must be array"); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	413 objArrayOop a = objArrayOop(obj); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	414 /* Get size before changing pointers. */ \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	415 /* Don't call size() or oop_size() since that is a virtual call */ \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	416 int size = a->object_size(); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	417 if (UseCompressedOops) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	418 HeapWord* low = start == 0 ? (HeapWord)a : (HeapWord)a->obj_at_addr<narrowOop>(start);\
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	419 /* this might be wierd if end needs to be aligned on HeapWord boundary */ \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	420 HeapWord* high = (HeapWord)((narrowOop)a->base() + end); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	421 MemRegion mr(low, high); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	422 if (closure->do_header()) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	423 a->oop_iterate_header(closure, mr); \
0 a61af66fc99e Initial load duke parents: diff changeset	424 } \
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	425 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	426 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
0 a61af66fc99e Initial load duke parents: diff changeset	427 } else { \
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	428 HeapWord* low = start == 0 ? (HeapWord)a : (HeapWord)a->obj_at_addr<oop>(start); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	429 HeapWord* high = (HeapWord)((oop)a->base() + end); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	430 MemRegion mr(low, high); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	431 if (closure->do_header()) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	432 a->oop_iterate_header(closure, mr); \
0 a61af66fc99e Initial load duke parents: diff changeset	433 } \
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	434 ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	435 a, p, low, high, (closure)->do_oop##nv_suffix(p)) \
0 a61af66fc99e Initial load duke parents: diff changeset	436 } \
a61af66fc99e Initial load duke parents: diff changeset	437 return size; \
a61af66fc99e Initial load duke parents: diff changeset	438 }
a61af66fc99e Initial load duke parents: diff changeset	439
a61af66fc99e Initial load duke parents: diff changeset	440 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	441 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN)
0 a61af66fc99e Initial load duke parents: diff changeset	442 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	443 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_m)
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	444 ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: 113 diff changeset	445 ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayKlass_OOP_OOP_ITERATE_DEFN_r)
0 a61af66fc99e Initial load duke parents: diff changeset	446
a61af66fc99e Initial load duke parents: diff changeset	447 int objArrayKlass::oop_adjust_pointers(oop obj) {
a61af66fc99e Initial load duke parents: diff changeset	448 assert(obj->is_objArray(), "obj must be obj array");
a61af66fc99e Initial load duke parents: diff changeset	449 objArrayOop a = objArrayOop(obj);
a61af66fc99e Initial load duke parents: diff changeset	450 // Get size before changing pointers.
a61af66fc99e Initial load duke parents: diff changeset	451 // Don't call size() or oop_size() since that is a virtual call.
a61af66fc99e Initial load duke parents: diff changeset	452 int size = a->object_size();
a61af66fc99e Initial load duke parents: diff changeset	453 a->adjust_header();
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	454 ObjArrayKlass_OOP_ITERATE(a, p, MarkSweep::adjust_pointer(p))
0 a61af66fc99e Initial load duke parents: diff changeset	455 return size;
a61af66fc99e Initial load duke parents: diff changeset	456 }
a61af66fc99e Initial load duke parents: diff changeset	457
a61af66fc99e Initial load duke parents: diff changeset	458 #ifndef SERIALGC
a61af66fc99e Initial load duke parents: diff changeset	459 void objArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
a61af66fc99e Initial load duke parents: diff changeset	460 assert(obj->is_objArray(), "obj must be obj array");
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	461 ObjArrayKlass_OOP_ITERATE( \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	462 objArrayOop(obj), p, \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	463 if (PSScavenge::should_scavenge(p)) { \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	464 pm->claim_or_forward_depth(p); \
ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	465 })
0 a61af66fc99e Initial load duke parents: diff changeset	466 }
a61af66fc99e Initial load duke parents: diff changeset	467
a61af66fc99e Initial load duke parents: diff changeset	468 int objArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
a61af66fc99e Initial load duke parents: diff changeset	469 assert (obj->is_objArray(), "obj must be obj array");
a61af66fc99e Initial load duke parents: diff changeset	470 objArrayOop a = objArrayOop(obj);
113 ba764ed4b6f2 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes coleenp parents: 0 diff changeset	471 ObjArrayKlass_OOP_ITERATE(a, p, PSParallelCompact::adjust_pointer(p))
0 a61af66fc99e Initial load duke parents: diff changeset	472 return a->object_size();
a61af66fc99e Initial load duke parents: diff changeset	473 }
a61af66fc99e Initial load duke parents: diff changeset	474 #endif // SERIALGC
a61af66fc99e Initial load duke parents: diff changeset	475
a61af66fc99e Initial load duke parents: diff changeset	476 // JVM support
a61af66fc99e Initial load duke parents: diff changeset	477
a61af66fc99e Initial load duke parents: diff changeset	478 jint objArrayKlass::compute_modifier_flags(TRAPS) const {
a61af66fc99e Initial load duke parents: diff changeset	479 // The modifier for an objectArray is the same as its element
a61af66fc99e Initial load duke parents: diff changeset	480 if (element_klass() == NULL) {
a61af66fc99e Initial load duke parents: diff changeset	481 assert(Universe::is_bootstrapping(), "partial objArray only at startup");
a61af66fc99e Initial load duke parents: diff changeset	482 return JVM_ACC_ABSTRACT \| JVM_ACC_FINAL \| JVM_ACC_PUBLIC;
a61af66fc99e Initial load duke parents: diff changeset	483 }
398 443791f333a2 6700107: java/lang/Class/forName/TooManyDimensions.java crashes with SIGSEGV in c2 compiler with fastdebug coleenp parents: 356 diff changeset	484 // Return the flags of the bottom element type.
443791f333a2 6700107: java/lang/Class/forName/TooManyDimensions.java crashes with SIGSEGV in c2 compiler with fastdebug coleenp parents: 356 diff changeset	485 jint element_flags = Klass::cast(bottom_klass())->compute_modifier_flags(CHECK_0);
0 a61af66fc99e Initial load duke parents: diff changeset	486
a61af66fc99e Initial load duke parents: diff changeset	487 return (element_flags & (JVM_ACC_PUBLIC \| JVM_ACC_PRIVATE \| JVM_ACC_PROTECTED))
a61af66fc99e Initial load duke parents: diff changeset	488 \| (JVM_ACC_ABSTRACT \| JVM_ACC_FINAL);
a61af66fc99e Initial load duke parents: diff changeset	489 }
a61af66fc99e Initial load duke parents: diff changeset	490
a61af66fc99e Initial load duke parents: diff changeset	491
a61af66fc99e Initial load duke parents: diff changeset	492 #ifndef PRODUCT
a61af66fc99e Initial load duke parents: diff changeset	493 // Printing
a61af66fc99e Initial load duke parents: diff changeset	494
a61af66fc99e Initial load duke parents: diff changeset	495 void objArrayKlass::oop_print_on(oop obj, outputStream* st) {
a61af66fc99e Initial load duke parents: diff changeset	496 arrayKlass::oop_print_on(obj, st);
a61af66fc99e Initial load duke parents: diff changeset	497 assert(obj->is_objArray(), "must be objArray");
a61af66fc99e Initial load duke parents: diff changeset	498 objArrayOop oa = objArrayOop(obj);
a61af66fc99e Initial load duke parents: diff changeset	499 int print_len = MIN2((intx) oa->length(), MaxElementPrintSize);
a61af66fc99e Initial load duke parents: diff changeset	500 for(int index = 0; index < print_len; index++) {
a61af66fc99e Initial load duke parents: diff changeset	501 st->print(" - %3d : ", index);
a61af66fc99e Initial load duke parents: diff changeset	502 oa->obj_at(index)->print_value_on(st);
a61af66fc99e Initial load duke parents: diff changeset	503 st->cr();
a61af66fc99e Initial load duke parents: diff changeset	504 }
a61af66fc99e Initial load duke parents: diff changeset	505 int remaining = oa->length() - print_len;
a61af66fc99e Initial load duke parents: diff changeset	506 if (remaining > 0) {
a61af66fc99e Initial load duke parents: diff changeset	507 tty->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
a61af66fc99e Initial load duke parents: diff changeset	508 }
a61af66fc99e Initial load duke parents: diff changeset	509 }
a61af66fc99e Initial load duke parents: diff changeset	510
1155 4e6abf09f540 6912062: disassembler plugin needs to produce symbolic information in product mode jrose parents: 1142 diff changeset	511 #endif //PRODUCT
4e6abf09f540 6912062: disassembler plugin needs to produce symbolic information in product mode jrose parents: 1142 diff changeset	512
665 c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	513 static int max_objArray_print_length = 4;
0 a61af66fc99e Initial load duke parents: diff changeset	514
a61af66fc99e Initial load duke parents: diff changeset	515 void objArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
a61af66fc99e Initial load duke parents: diff changeset	516 assert(obj->is_objArray(), "must be objArray");
665 c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	517 st->print("a ");
0 a61af66fc99e Initial load duke parents: diff changeset	518 element_klass()->print_value_on(st);
665 c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	519 int len = objArrayOop(obj)->length();
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	520 st->print("[%d] ", len);
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	521 obj->print_address_on(st);
1155 4e6abf09f540 6912062: disassembler plugin needs to produce symbolic information in product mode jrose parents: 1142 diff changeset	522 if (NOT_PRODUCT(PrintOopAddress \|\|) PrintMiscellaneous && (WizardMode \|\| Verbose)) {
665 c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	523 st->print("{");
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	524 for (int i = 0; i < len; i++) {
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	525 if (i > max_objArray_print_length) {
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	526 st->print("..."); break;
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	527 }
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	528 st->print(" "INTPTR_FORMAT, (intptr_t)(void*)objArrayOop(obj)->obj_at(i));
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	529 }
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	530 st->print(" }");
c89f86385056 6814659: separable cleanups and subroutines for 6655638 jrose parents: 398 diff changeset	531 }
0 a61af66fc99e Initial load duke parents: diff changeset	532 }
a61af66fc99e Initial load duke parents: diff changeset	533
a61af66fc99e Initial load duke parents: diff changeset	534 const char* objArrayKlass::internal_name() const {
a61af66fc99e Initial load duke parents: diff changeset	535 return external_name();
a61af66fc99e Initial load duke parents: diff changeset	536 }
a61af66fc99e Initial load duke parents: diff changeset	537
a61af66fc99e Initial load duke parents: diff changeset	538 // Verification
a61af66fc99e Initial load duke parents: diff changeset	539
a61af66fc99e Initial load duke parents: diff changeset	540 void objArrayKlass::oop_verify_on(oop obj, outputStream* st) {
a61af66fc99e Initial load duke parents: diff changeset	541 arrayKlass::oop_verify_on(obj, st);
a61af66fc99e Initial load duke parents: diff changeset	542 guarantee(obj->is_objArray(), "must be objArray");
a61af66fc99e Initial load duke parents: diff changeset	543 objArrayOop oa = objArrayOop(obj);
a61af66fc99e Initial load duke parents: diff changeset	544 for(int index = 0; index < oa->length(); index++) {
a61af66fc99e Initial load duke parents: diff changeset	545 guarantee(oa->obj_at(index)->is_oop_or_null(), "should be oop");
a61af66fc99e Initial load duke parents: diff changeset	546 }
a61af66fc99e Initial load duke parents: diff changeset	547 }

Mercurial > hg > truffle

annotate src/share/vm/oops/objArrayKlass.cpp @ 6087:e2961d14584b