1 /*
2 * Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "classfile/symbolTable.hpp"
27 #include "classfile/systemDictionary.hpp"
28 #include "classfile/vmSymbols.hpp"
29 #include "gc/shared/collectedHeap.hpp"
30 #include "gc/shared/collectedHeap.inline.hpp"
31 #include "memory/metadataFactory.hpp"
32 #include "memory/resourceArea.hpp"
33 #include "memory/universe.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/oop.inline.hpp"
39 #include "oops/typeArrayKlass.inline.hpp"
40 #include "oops/typeArrayOop.hpp"
41 #include "runtime/handles.inline.hpp"
42 #include "runtime/orderAccess.inline.hpp"
43 #include "utilities/macros.hpp"
44
45 bool TypeArrayKlass::compute_is_subtype_of(Klass* k) {
46 if (!k->oop_is_typeArray()) {
47 return ArrayKlass::compute_is_subtype_of(k);
48 }
49
50 TypeArrayKlass* tak = TypeArrayKlass::cast(k);
51 if (dimension() != tak->dimension()) return false;
52
53 return element_type() == tak->element_type();
54 }
55
56 TypeArrayKlass* TypeArrayKlass::create_klass(BasicType type,
57 const char* name_str, TRAPS) {
58 Symbol* sym = NULL;
59 if (name_str != NULL) {
60 sym = SymbolTable::new_permanent_symbol(name_str, CHECK_NULL);
61 }
62
63 ClassLoaderData* null_loader_data = ClassLoaderData::the_null_class_loader_data();
64
65 TypeArrayKlass* ak = TypeArrayKlass::allocate(null_loader_data, type, sym, CHECK_NULL);
66
67 // Add all classes to our internal class loader list here,
68 // including classes in the bootstrap (NULL) class loader.
69 // GC walks these as strong roots.
70 null_loader_data->add_class(ak);
71
72 // Call complete_create_array_klass after all instance variables have been initialized.
73 complete_create_array_klass(ak, ak->super(), CHECK_NULL);
74
75 return ak;
76 }
77
78 TypeArrayKlass* TypeArrayKlass::allocate(ClassLoaderData* loader_data, BasicType type, Symbol* name, TRAPS) {
79 assert(TypeArrayKlass::header_size() <= InstanceKlass::header_size(),
80 "array klasses must be same size as InstanceKlass");
81
82 int size = ArrayKlass::static_size(TypeArrayKlass::header_size());
83
84 return new (loader_data, size, THREAD) TypeArrayKlass(type, name);
85 }
86
87 TypeArrayKlass::TypeArrayKlass(BasicType type, Symbol* name) : ArrayKlass(name) {
88 set_layout_helper(array_layout_helper(type));
89 assert(oop_is_array(), "sanity");
90 assert(oop_is_typeArray(), "sanity");
91
92 set_max_length(arrayOopDesc::max_array_length(type));
93 assert(size() >= TypeArrayKlass::header_size(), "bad size");
94
95 set_class_loader_data(ClassLoaderData::the_null_class_loader_data());
96 }
97
98 typeArrayOop TypeArrayKlass::allocate_common(int length, bool do_zero, TRAPS) {
99 assert(log2_element_size() >= 0, "bad scale");
100 if (length >= 0) {
101 if (length <= max_length()) {
102 size_t size = typeArrayOopDesc::object_size(layout_helper(), length);
103 KlassHandle h_k(THREAD, this);
104 typeArrayOop t;
105 CollectedHeap* ch = Universe::heap();
106 if (do_zero) {
107 t = (typeArrayOop)CollectedHeap::array_allocate(h_k, (int)size, length, CHECK_NULL);
108 } else {
109 t = (typeArrayOop)CollectedHeap::array_allocate_nozero(h_k, (int)size, length, CHECK_NULL);
110 }
111 return t;
112 } else {
113 report_java_out_of_memory("Requested array size exceeds VM limit");
114 JvmtiExport::post_array_size_exhausted();
115 THROW_OOP_0(Universe::out_of_memory_error_array_size());
116 }
117 } else {
118 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
119 }
120 }
121
122 oop TypeArrayKlass::multi_allocate(int rank, jint* last_size, TRAPS) {
123 // For typeArrays this is only called for the last dimension
124 assert(rank == 1, "just checking");
125 int length = *last_size;
126 return allocate(length, THREAD);
127 }
128
129
130 void TypeArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) {
131 assert(s->is_typeArray(), "must be type array");
132
133 // Check destination
134 if (!d->is_typeArray() || element_type() != TypeArrayKlass::cast(d->klass())->element_type()) {
135 THROW(vmSymbols::java_lang_ArrayStoreException());
136 }
137
138 // Check is all offsets and lengths are non negative
139 if (src_pos < 0 || dst_pos < 0 || length < 0) {
140 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
141 }
142 // Check if the ranges are valid
143 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
144 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
145 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
146 }
147 // Check zero copy
148 if (length == 0)
149 return;
150
151 s = arrayOop(oopDesc::bs()->read_barrier(s));
152 d = arrayOop(oopDesc::bs()->write_barrier(d));
153
154 // This is an attempt to make the copy_array fast.
155 int l2es = log2_element_size();
156 int ihs = array_header_in_bytes() / wordSize;
157 char* src = (char*) ((oop*)s + ihs) + ((size_t)src_pos << l2es);
158 char* dst = (char*) ((oop*)d + ihs) + ((size_t)dst_pos << l2es);
159 Copy::conjoint_memory_atomic(src, dst, (size_t)length << l2es);
160 }
161
162
163 // create a klass of array holding typeArrays
164 Klass* TypeArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
165 int dim = dimension();
166 assert(dim <= n, "check order of chain");
167 if (dim == n)
168 return this;
169
170 if (higher_dimension() == NULL) {
171 if (or_null) return NULL;
172
173 ResourceMark rm;
174 JavaThread *jt = (JavaThread *)THREAD;
175 {
176 MutexLocker mc(Compile_lock, THREAD); // for vtables
177 // Atomic create higher dimension and link into list
178 MutexLocker mu(MultiArray_lock, THREAD);
179
180 if (higher_dimension() == NULL) {
181 Klass* oak = ObjArrayKlass::allocate_objArray_klass(
182 class_loader_data(), dim + 1, this, CHECK_NULL);
183 ObjArrayKlass* h_ak = ObjArrayKlass::cast(oak);
184 h_ak->set_lower_dimension(this);
185 OrderAccess::storestore();
186 set_higher_dimension(h_ak);
187 assert(h_ak->oop_is_objArray(), "incorrect initialization of ObjArrayKlass");
188 }
189 }
190 } else {
191 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
192 }
193 ObjArrayKlass* h_ak = ObjArrayKlass::cast(higher_dimension());
194 if (or_null) {
195 return h_ak->array_klass_or_null(n);
196 }
197 return h_ak->array_klass(n, THREAD);
198 }
199
200 Klass* TypeArrayKlass::array_klass_impl(bool or_null, TRAPS) {
201 return array_klass_impl(or_null, dimension() + 1, THREAD);
202 }
203
204 int TypeArrayKlass::oop_size(oop obj) const {
205 assert(obj->is_typeArray(),"must be a type array");
206 typeArrayOop t = typeArrayOop(obj);
207 return t->object_size();
208 }
209
210 void TypeArrayKlass::initialize(TRAPS) {
211 // Nothing to do. Having this function is handy since objArrayKlasses can be
212 // initialized by calling initialize on their bottom_klass, see ObjArrayKlass::initialize
213 }
214
215 const char* TypeArrayKlass::external_name(BasicType type) {
216 switch (type) {
217 case T_BOOLEAN: return "[Z";
218 case T_CHAR: return "[C";
219 case T_FLOAT: return "[F";
220 case T_DOUBLE: return "[D";
221 case T_BYTE: return "[B";
222 case T_SHORT: return "[S";
223 case T_INT: return "[I";
224 case T_LONG: return "[J";
225 default: ShouldNotReachHere();
226 }
227 return NULL;
228 }
229
230
231 // Printing
232
233 void TypeArrayKlass::print_on(outputStream* st) const {
234 #ifndef PRODUCT
235 assert(is_klass(), "must be klass");
236 print_value_on(st);
237 Klass::print_on(st);
238 #endif //PRODUCT
239 }
240
241 void TypeArrayKlass::print_value_on(outputStream* st) const {
242 assert(is_klass(), "must be klass");
243 st->print("{type array ");
244 switch (element_type()) {
245 case T_BOOLEAN: st->print("bool"); break;
246 case T_CHAR: st->print("char"); break;
247 case T_FLOAT: st->print("float"); break;
248 case T_DOUBLE: st->print("double"); break;
249 case T_BYTE: st->print("byte"); break;
250 case T_SHORT: st->print("short"); break;
251 case T_INT: st->print("int"); break;
252 case T_LONG: st->print("long"); break;
253 default: ShouldNotReachHere();
254 }
255 st->print("}");
256 }
257
258 #ifndef PRODUCT
259
260 static void print_boolean_array(typeArrayOop ta, int print_len, outputStream* st) {
261 for (int index = 0; index < print_len; index++) {
262 st->print_cr(" - %3d: %s", index, (ta->bool_at(index) == 0) ? "false" : "true");
263 }
264 }
265
266
267 static void print_char_array(typeArrayOop ta, int print_len, outputStream* st) {
268 for (int index = 0; index < print_len; index++) {
269 jchar c = ta->char_at(index);
270 st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' ');
271 }
272 }
273
274
275 static void print_float_array(typeArrayOop ta, int print_len, outputStream* st) {
276 for (int index = 0; index < print_len; index++) {
277 st->print_cr(" - %3d: %g", index, ta->float_at(index));
278 }
279 }
280
281
282 static void print_double_array(typeArrayOop ta, int print_len, outputStream* st) {
283 for (int index = 0; index < print_len; index++) {
284 st->print_cr(" - %3d: %g", index, ta->double_at(index));
285 }
286 }
287
288
289 static void print_byte_array(typeArrayOop ta, int print_len, outputStream* st) {
290 for (int index = 0; index < print_len; index++) {
291 jbyte c = ta->byte_at(index);
292 st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' ');
293 }
294 }
295
296
297 static void print_short_array(typeArrayOop ta, int print_len, outputStream* st) {
298 for (int index = 0; index < print_len; index++) {
299 int v = ta->ushort_at(index);
300 st->print_cr(" - %3d: 0x%x\t %d", index, v, v);
301 }
302 }
303
304
305 static void print_int_array(typeArrayOop ta, int print_len, outputStream* st) {
306 for (int index = 0; index < print_len; index++) {
307 jint v = ta->int_at(index);
308 st->print_cr(" - %3d: 0x%x %d", index, v, v);
309 }
310 }
311
312
313 static void print_long_array(typeArrayOop ta, int print_len, outputStream* st) {
314 for (int index = 0; index < print_len; index++) {
315 jlong v = ta->long_at(index);
316 st->print_cr(" - %3d: 0x%x 0x%x", index, high(v), low(v));
317 }
318 }
319
320
321 void TypeArrayKlass::oop_print_on(oop obj, outputStream* st) {
322 ArrayKlass::oop_print_on(obj, st);
323 typeArrayOop ta = typeArrayOop(obj);
324 int print_len = MIN2((intx) ta->length(), MaxElementPrintSize);
325 switch (element_type()) {
326 case T_BOOLEAN: print_boolean_array(ta, print_len, st); break;
327 case T_CHAR: print_char_array(ta, print_len, st); break;
328 case T_FLOAT: print_float_array(ta, print_len, st); break;
329 case T_DOUBLE: print_double_array(ta, print_len, st); break;
330 case T_BYTE: print_byte_array(ta, print_len, st); break;
331 case T_SHORT: print_short_array(ta, print_len, st); break;
332 case T_INT: print_int_array(ta, print_len, st); break;
333 case T_LONG: print_long_array(ta, print_len, st); break;
334 default: ShouldNotReachHere();
335 }
336 int remaining = ta->length() - print_len;
337 if (remaining > 0) {
338 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
339 }
340 }
341
342 #endif // PRODUCT
343
344 const char* TypeArrayKlass::internal_name() const {
345 return Klass::external_name();
346 }