1 /*
2 * Copyright (c) 2017, 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/moduleEntry.hpp"
27 #include "classfile/packageEntry.hpp"
28 #include "classfile/symbolTable.hpp"
29 #include "classfile/systemDictionary.hpp"
30 #include "classfile/vmSymbols.hpp"
31 #include "gc/shared/collectedHeap.hpp"
32 #include "gc/shared/collectedHeap.inline.hpp"
33 #include "memory/metadataFactory.hpp"
34 #include "memory/resourceArea.hpp"
35 #include "memory/universe.hpp"
36 #include "memory/universe.inline.hpp"
37 #include "oops/instanceKlass.hpp"
38 #include "oops/klass.inline.hpp"
39 #include "oops/objArrayKlass.hpp"
40 #include "oops/oop.inline.hpp"
41 #include "oops/arrayKlass.hpp"
42 #include "oops/arrayOop.hpp"
43 #include "oops/valueKlass.hpp"
44 #include "oops/valueArrayOop.hpp"
45 #include "oops/verifyOopClosure.hpp"
46 #include "runtime/handles.inline.hpp"
47 #include "runtime/orderAccess.inline.hpp"
48 #include "utilities/macros.hpp"
49
50 #include "oops/valueArrayKlass.hpp"
51
52 // Allocation...
53
54 ValueArrayKlass::ValueArrayKlass(Klass* element_klass, Symbol* name) : ArrayKlass(name) {
55 assert(element_klass->is_value(), "Expected Value");
56
57 set_element_klass(ValueKlass::cast(element_klass));
58 set_class_loader_data(element_klass->class_loader_data());
59 set_layout_helper(array_layout_helper(ValueKlass::cast(element_klass)));
60
61 assert((1 << Klass::layout_helper_log2_element_size(layout_helper())) >=
62 element_value_store_size(), "sanity");
63 assert(is_array_klass(), "sanity");
64 assert(is_valueArray_klass(), "sanity");
65
66 CMH("tweak name symbol refcnt ?")
67 #ifndef PRODUCT
68 if (PrintValueArrayLayout) {
69 print();
70 }
71 #endif
72 }
73
74 ValueKlass* ValueArrayKlass::element_klass() const {
75 return ValueKlass::cast(_element_klass);
76 }
77
78 void ValueArrayKlass::set_element_klass(Klass* k) {
79 _element_klass = k;
80 _element_value_store_size = ValueKlass::cast(k)->raw_value_byte_size();
81 }
82
83 ValueArrayKlass* ValueArrayKlass::allocate_klass(Klass* element_klass,
84 Symbol* name,
85 TRAPS) {
86 assert(ValueArrayFlatten, "Flatten array required");
87 assert(ValueKlass::cast(element_klass)->is_atomic() || (!ValueArrayAtomicAccess), "Atomic by-default");
88
89 ClassLoaderData* loader_data = element_klass->class_loader_data();
90 int size = ArrayKlass::static_size(ValueArrayKlass::header_size());
91 ValueArrayKlass* vak = new (loader_data, size, THREAD) ValueArrayKlass(element_klass, name);
92 if (vak == NULL) {
93 return NULL;
94 }
95 loader_data->add_class(vak);
96 complete_create_array_klass(vak, vak->super(), vak->module(), CHECK_NULL);
97 return vak;
98 }
99
100 ValueArrayKlass* ValueArrayKlass::allocate_klass(Klass* element_klass, TRAPS) {
101 Symbol* name = ArrayKlass::create_element_klass_array_name(element_klass, CHECK_NULL);
102 return allocate_klass(element_klass, name, THREAD);
103 }
104
105 void ValueArrayKlass::initialize(TRAPS) {
106 element_klass()->initialize(THREAD);
107 }
108
109 // Oops allocation...
110 oop ValueArrayKlass::allocate(int length, bool do_zero, TRAPS) {
111 if (length < 0) {
112 THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
113 }
114 if (length > max_elements()) {
115 report_java_out_of_memory("Requested array size exceeds VM limit");
116 JvmtiExport::post_array_size_exhausted();
117 THROW_OOP_0(Universe::out_of_memory_error_array_size());
118 }
119
120 size_t size = valueArrayOopDesc::object_size(layout_helper(), length);
121 if (do_zero) {
122 return CollectedHeap::array_allocate(this, (int)size, length, CHECK_NULL);
123 } else {
124 return CollectedHeap::array_allocate_nozero(this, (int)size, length, CHECK_NULL);
125 }
126 }
127
128
129 oop ValueArrayKlass::multi_allocate(int rank, jint* last_size, TRAPS) {
130 // For valueArrays this is only called for the last dimension
131 assert(rank == 1, "just checking");
132 int length = *last_size;
133 return allocate(length, true, THREAD);
134 }
135
136 jint ValueArrayKlass::array_layout_helper(ValueKlass* vk) {
137 BasicType etype = T_VALUETYPE;
138 int atag = _lh_array_tag_vt_value;
139 int esize = upper_log2(vk->raw_value_byte_size());
140 int hsize = arrayOopDesc::base_offset_in_bytes(etype);
141
142 int lh = (atag << _lh_array_tag_shift)
143 | (hsize << _lh_header_size_shift)
144 | ((int)etype << _lh_element_type_shift)
145 | ((esize) << _lh_log2_element_size_shift);
146
147 assert(lh < (int)_lh_neutral_value, "must look like an array layout");
148 assert(layout_helper_is_array(lh), "correct kind");
149 assert(layout_helper_is_valueArray(lh), "correct kind");
150 assert(!layout_helper_is_typeArray(lh), "correct kind");
151 assert(!layout_helper_is_objArray(lh), "correct kind");
152 assert(layout_helper_header_size(lh) == hsize, "correct decode");
153 assert(layout_helper_element_type(lh) == etype, "correct decode");
154 assert(layout_helper_log2_element_size(lh) == esize, "correct decode");
155 assert((1 << esize) < BytesPerLong || is_size_aligned(hsize, HeapWordsPerLong), "unaligned base");
156
157 return lh;
158 }
159
160 int ValueArrayKlass::oop_size(oop obj) const {
161 assert(obj->is_valueArray(),"must be a value array");
162 valueArrayOop array = valueArrayOop(obj);
163 return array->object_size();
164 }
165
166 jint ValueArrayKlass::max_elements() const {
167 return arrayOopDesc::max_array_length(arrayOopDesc::header_size(T_VALUETYPE), element_byte_size());
168 }
169
170 oop ValueArrayKlass::protection_domain() const {
171 return element_klass()->protection_domain();
172 }
173
174 void ValueArrayKlass::copy_array(arrayOop s, int src_pos,
175 arrayOop d, int dst_pos, int length, TRAPS) {
176 assert(s->is_valueArray(), "must be value array");
177
178 // Check destination
179 if (!d->is_valueArray() || element_klass() != ValueArrayKlass::cast(d->klass())->element_klass()) {
180 THROW(vmSymbols::java_lang_ArrayStoreException());
181 }
182
183 // Check is all offsets and lengths are non negative
184 if (src_pos < 0 || dst_pos < 0 || length < 0) {
185 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
186 }
187 // Check if the ranges are valid
188 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
189 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
190 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
191 }
192 // Check zero copy
193 if (length == 0)
194 return;
195
196 valueArrayOop sa = valueArrayOop(s);
197 valueArrayOop da = valueArrayOop(d);
198 address src = (address) sa->value_at_addr(src_pos, layout_helper());
199 address dst = (address) da->value_at_addr(dst_pos, layout_helper());
200 if (contains_oops()) {
201 int elem_incr = 1 << log2_element_size();
202 address src_end = src + (length << log2_element_size());
203 while (src < src_end) {
204 element_klass()->value_store(src, dst, element_value_store_size(), true, false);
205 src += elem_incr;
206 dst += elem_incr;
207 }
208 } else {
209 // we are basically a type array...don't bother limiting element copy
210 // it would have to be a lot wasted space to be worth value_store() calls, need a setting here ?
211 Copy::conjoint_memory_atomic(src, dst, (size_t)length << log2_element_size());
212 }
213 }
214
215
216 Klass* ValueArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
217
218 assert(dimension() <= n, "check order of chain");
219 int dim = dimension();
220 if (dim == n) return this;
221
222 if (higher_dimension() == NULL) {
223 if (or_null) return NULL;
224
225 ResourceMark rm;
226 JavaThread *jt = (JavaThread *)THREAD;
227 {
228 MutexLocker mc(Compile_lock, THREAD); // for vtables
229 // Ensure atomic creation of higher dimensions
230 MutexLocker mu(MultiArray_lock, THREAD);
231
232 // Check if another thread beat us
233 if (higher_dimension() == NULL) {
234
235 // Create multi-dim klass object and link them together
236 Klass* k =
237 ObjArrayKlass::allocate_objArray_klass(class_loader_data(), dim + 1, this, CHECK_NULL);
238 ObjArrayKlass* ak = ObjArrayKlass::cast(k);
239 ak->set_lower_dimension(this);
240 OrderAccess::storestore();
241 set_higher_dimension(ak);
242 assert(ak->is_objArray_klass(), "incorrect initialization of ObjArrayKlass");
243 }
244 }
245 } else {
246 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
247 }
248
249 ObjArrayKlass *ak = ObjArrayKlass::cast(higher_dimension());
250 if (or_null) {
251 return ak->array_klass_or_null(n);
252 }
253 return ak->array_klass(n, THREAD);
254 }
255
256 Klass* ValueArrayKlass::array_klass_impl(bool or_null, TRAPS) {
257 return array_klass_impl(or_null, dimension() + 1, THREAD);
258 }
259
260 ModuleEntry* ValueArrayKlass::module() const {
261 assert(element_klass() != NULL, "ObjArrayKlass returned unexpected NULL bottom_klass");
262 // The array is defined in the module of its bottom class
263 return element_klass()->module();
264 }
265
266 PackageEntry* ValueArrayKlass::package() const {
267 assert(element_klass() != NULL, "ObjArrayKlass returned unexpected NULL bottom_klass");
268 return element_klass()->package();
269 }
270
271 void ValueArrayKlass::print_on(outputStream* st) const {
272 #ifndef PRODUCT
273 assert(!is_objArray_klass(), "Unimplemented");
274
275 st->print("Value Type Array: ");
276 Klass::print_on(st);
277
278 st->print(" - element klass: ");
279 element_klass()->print_value_on(st);
280 st->cr();
281
282 int elem_size = element_byte_size();
283 st->print(" - element size %i ", elem_size);
284 st->print("aligned layout size %i", 1 << layout_helper_log2_element_size(layout_helper()));
285 st->cr();
286 #endif //PRODUCT
287 }
288
289 void ValueArrayKlass::print_value_on(outputStream* st) const {
290 assert(is_klass(), "must be klass");
291
292 element_klass()->print_value_on(st);
293 st->print("[]");
294 }
295
296
297 #ifndef PRODUCT
298 void ValueArrayKlass::oop_print_on(oop obj, outputStream* st) {
299 ArrayKlass::oop_print_on(obj, st);
300 valueArrayOop va = valueArrayOop(obj);
301 ValueKlass* vk = element_klass();
302 int print_len = MIN2((intx) va->length(), MaxElementPrintSize);
303 for(int index = 0; index < print_len; index++) {
304 int off = (address) va->value_at_addr(index, layout_helper()) - (address) obj;
305 st->print_cr(" - Index %3d offset %3d: ", index, off);
306 oop obj = (oop) ((address)va->value_at_addr(index, layout_helper()) - vk->first_field_offset());
307 FieldPrinter print_field(st, obj);
308 vk->do_nonstatic_fields(&print_field);
309 st->cr();
310 }
311 int remaining = va->length() - print_len;
312 if (remaining > 0) {
313 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
314 }
315 }
316 #endif //PRODUCT
317
318 void ValueArrayKlass::oop_print_value_on(oop obj, outputStream* st) {
319 assert(obj->is_valueArray(), "must be valueArray");
320 st->print("a ");
321 element_klass()->print_value_on(st);
322 int len = valueArrayOop(obj)->length();
323 st->print("[%d] ", len);
324 obj->print_address_on(st);
325 if (PrintMiscellaneous && (WizardMode || Verbose)) {
326 int lh = layout_helper();
327 st->print("{");
328 for (int i = 0; i < len; i++) {
329 if (i > 4) {
330 st->print("..."); break;
331 }
332 st->print(" " INTPTR_FORMAT, (intptr_t)(void*)valueArrayOop(obj)->value_at_addr(i , lh));
333 }
334 st->print(" }");
335 }
336 }
337
338 // Verification
339
340 void ValueArrayKlass::oop_verify_on(oop obj, outputStream* st) {
341 ArrayKlass::oop_verify_on(obj, st);
342 guarantee(obj->is_valueArray(), "must be valueArray");
343
344 if (element_klass()->contains_oops()) {
345 valueArrayOop va = valueArrayOop(obj);
346 NoHeaderExtendedOopClosure wrapClosure(&VerifyOopClosure::verify_oop);
347 va->oop_iterate(&wrapClosure);
348 }
349 }
350
351 void ValueArrayKlass::verify_on(outputStream* st) {
352 ArrayKlass::verify_on(st);
353 guarantee(element_klass()->is_value(), "should be value type klass");
354 }