1 /* 2 * Copyright (c) 2017, 2018, 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.inline.hpp" 32 #include "memory/iterator.inline.hpp" 33 #include "memory/metadataFactory.hpp" 34 #include "memory/metaspaceClosure.hpp" 35 #include "memory/oopFactory.hpp" 36 #include "memory/resourceArea.hpp" 37 #include "memory/universe.hpp" 38 #include "oops/arrayKlass.inline.hpp" 39 #include "oops/arrayOop.hpp" 40 #include "oops/instanceKlass.hpp" 41 #include "oops/klass.inline.hpp" 42 #include "oops/objArrayKlass.hpp" 43 #include "oops/objArrayOop.inline.hpp" 44 #include "oops/oop.inline.hpp" 45 #include "oops/valueKlass.hpp" 46 #include "oops/valueArrayOop.hpp" 47 #include "oops/valueArrayOop.inline.hpp" 48 #include "oops/verifyOopClosure.hpp" 49 #include "runtime/handles.inline.hpp" 50 #include "runtime/mutexLocker.hpp" 51 #include "utilities/copy.hpp" 52 #include "utilities/macros.hpp" 53 54 #include "oops/valueArrayKlass.hpp" 55 56 // Allocation... 57 58 ValueArrayKlass::ValueArrayKlass(Klass* element_klass, Symbol* name) : ArrayKlass(name, ID) { 59 assert(element_klass->is_value(), "Expected Value"); 60 61 set_element_klass(ValueKlass::cast(element_klass)); 62 set_class_loader_data(element_klass->class_loader_data()); 63 set_layout_helper(array_layout_helper(ValueKlass::cast(element_klass))); 64 65 assert(is_array_klass(), "sanity"); 66 assert(is_valueArray_klass(), "sanity"); 67 68 CMH("tweak name symbol refcnt ?") 69 #ifndef PRODUCT 70 if (PrintValueArrayLayout) { 71 print(); 72 } 73 #endif 74 } 75 76 ValueKlass* ValueArrayKlass::element_klass() const { 77 return ValueKlass::cast(_element_klass); 78 } 79 80 void ValueArrayKlass::set_element_klass(Klass* k) { 81 _element_klass = k; 82 } 83 84 ValueArrayKlass* ValueArrayKlass::allocate_klass(Klass* element_klass, TRAPS) { 85 assert(ValueArrayFlatten, "Flatten array required"); 86 assert(ValueKlass::cast(element_klass)->is_atomic() || (!ValueArrayAtomicAccess), "Atomic by-default"); 87 88 /* 89 * MVT->LWorld, now need to allocate secondaries array types, just like objArrayKlass... 90 * ...so now we are trying out covariant array types, just copy objArrayKlass 91 * TODO refactor any remaining commonality 92 */ 93 94 // Eagerly allocate the direct array supertype, which would be "[L<vt>;" for this "[Q<vt>;" 95 Klass* super_klass = element_klass->array_klass_or_null(ArrayStorageProperties::empty); 96 if (super_klass == NULL) { 97 MutexUnlocker mu(MultiArray_lock); 98 // allocate super...need to drop the lock 99 element_klass->array_klass(ArrayStorageProperties::empty, 1, CHECK_NULL); 100 // retry, start from the beginning since lock dropped... 101 Klass* ak = element_klass->array_klass(ArrayStorageProperties::flattened_and_null_free, 1, CHECK_NULL); 102 return ValueArrayKlass::cast(ak); 103 } 104 105 Symbol* name = ArrayKlass::create_element_klass_array_name(true, element_klass, CHECK_NULL); 106 ClassLoaderData* loader_data = element_klass->class_loader_data(); 107 int size = ArrayKlass::static_size(ValueArrayKlass::header_size()); 108 ValueArrayKlass* vak = new (loader_data, size, THREAD) ValueArrayKlass(element_klass, name); 109 loader_data->add_class(vak); 110 111 ModuleEntry* module = vak->module(); 112 assert(module != NULL, "No module entry for array"); 113 complete_create_array_klass(vak, super_klass, module, CHECK_NULL); 114 return vak; 115 } 116 117 ValueArrayKlass* ValueArrayKlass::allocate_klass(ArrayStorageProperties storage_props, Klass* element_klass, TRAPS) { 118 assert(storage_props.is_flattened(), "Expected flat storage"); 119 return allocate_klass(element_klass, THREAD); 120 } 121 122 void ValueArrayKlass::initialize(TRAPS) { 123 element_klass()->initialize(THREAD); 124 } 125 126 // Oops allocation... 127 valueArrayOop ValueArrayKlass::allocate(int length, TRAPS) { 128 if (length < 0) { 129 THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); 130 } 131 if (length > max_elements()) { 132 report_java_out_of_memory("Requested array size exceeds VM limit"); 133 JvmtiExport::post_array_size_exhausted(); 134 THROW_OOP_0(Universe::out_of_memory_error_array_size()); 135 } 136 137 int size = valueArrayOopDesc::object_size(layout_helper(), length); 138 return (valueArrayOop) Universe::heap()->array_allocate(this, size, length, true, THREAD); 139 } 140 141 142 oop ValueArrayKlass::multi_allocate(int rank, jint* last_size, TRAPS) { 143 // For valueArrays this is only called for the last dimension 144 assert(rank == 1, "just checking"); 145 int length = *last_size; 146 return allocate(length, THREAD); 147 } 148 149 jint ValueArrayKlass::array_layout_helper(ValueKlass* vk) { 150 BasicType etype = T_VALUETYPE; 151 int atag = _lh_array_tag_vt_value; 152 int esize = upper_log2(vk->raw_value_byte_size()); 153 int hsize = arrayOopDesc::base_offset_in_bytes(etype); 154 155 int lh = (atag << _lh_array_tag_shift) 156 | (hsize << _lh_header_size_shift) 157 | ((int)etype << _lh_element_type_shift) 158 | ((esize) << _lh_log2_element_size_shift); 159 160 assert(lh < (int)_lh_neutral_value, "must look like an array layout"); 161 assert(layout_helper_is_array(lh), "correct kind"); 162 assert(layout_helper_is_valueArray(lh), "correct kind"); 163 assert(!layout_helper_is_typeArray(lh), "correct kind"); 164 assert(!layout_helper_is_objArray(lh), "correct kind"); 165 assert(layout_helper_header_size(lh) == hsize, "correct decode"); 166 assert(layout_helper_element_type(lh) == etype, "correct decode"); 167 assert(layout_helper_log2_element_size(lh) == esize, "correct decode"); 168 assert((1 << esize) < BytesPerLong || is_aligned(hsize, HeapWordsPerLong), "unaligned base"); 169 170 return lh; 171 } 172 173 int ValueArrayKlass::oop_size(oop obj) const { 174 assert(obj->is_valueArray(),"must be a value array"); 175 valueArrayOop array = valueArrayOop(obj); 176 return array->object_size(); 177 } 178 179 jint ValueArrayKlass::max_elements() const { 180 return arrayOopDesc::max_array_length(arrayOopDesc::header_size(T_VALUETYPE), element_byte_size()); 181 } 182 183 oop ValueArrayKlass::protection_domain() const { 184 return element_klass()->protection_domain(); 185 } 186 187 void ValueArrayKlass::copy_array(arrayOop s, int src_pos, 188 arrayOop d, int dst_pos, int length, TRAPS) { 189 190 assert(s->is_objArray() || s->is_valueArray(), "must be obj or value array"); 191 192 // Check destination 193 if ((!d->is_valueArray()) && (!d->is_objArray())) { 194 THROW(vmSymbols::java_lang_ArrayStoreException()); 195 } 196 197 // Check if all offsets and lengths are non negative 198 if (src_pos < 0 || dst_pos < 0 || length < 0) { 199 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException()); 200 } 201 // Check if the ranges are valid 202 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) 203 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) { 204 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException()); 205 } 206 // Check zero copy 207 if (length == 0) 208 return; 209 210 ArrayKlass* sk = ArrayKlass::cast(s->klass()); 211 ArrayKlass* dk = ArrayKlass::cast(d->klass()); 212 Klass* d_elem_klass = dk->element_klass(); 213 Klass* s_elem_klass = sk->element_klass(); 214 /**** CMH: compare and contrast impl, re-factor once we find edge cases... ****/ 215 216 if (sk->is_valueArray_klass()) { 217 assert(sk == this, "Unexpected call to copy_array"); 218 // Check subtype, all src homogeneous, so just once 219 if (!s_elem_klass->is_subtype_of(d_elem_klass)) { 220 THROW(vmSymbols::java_lang_ArrayStoreException()); 221 } 222 223 valueArrayOop sa = valueArrayOop(s); 224 ValueKlass* s_elem_vklass = element_klass(); 225 226 // valueArray-to-valueArray 227 if (dk->is_valueArray_klass()) { 228 // element types MUST be exact, subtype check would be dangerous 229 if (dk != this) { 230 THROW(vmSymbols::java_lang_ArrayStoreException()); 231 } 232 233 valueArrayOop da = valueArrayOop(d); 234 address dst = (address) da->value_at_addr(dst_pos, layout_helper()); 235 address src = (address) sa->value_at_addr(src_pos, layout_helper()); 236 if (contains_oops()) { 237 int elem_incr = 1 << log2_element_size(); 238 address src_end = src + (length << log2_element_size()); 239 while (src < src_end) { 240 s_elem_vklass->value_store(src, dst, element_byte_size(), true, false); 241 src += elem_incr; 242 dst += elem_incr; 243 } 244 } else { 245 // we are basically a type array...don't bother limiting element copy 246 // it would have to be a lot wasted space to be worth value_store() calls, need a setting here ? 247 Copy::conjoint_memory_atomic(src, dst, (size_t)length << log2_element_size()); 248 } 249 } 250 else { // valueArray-to-objArray 251 assert(dk->is_objArray_klass(), "Expected objArray here"); 252 // Need to allocate each new src elem payload -> dst oop 253 objArrayHandle dh(THREAD, (objArrayOop)d); 254 valueArrayHandle sh(THREAD, sa); 255 int dst_end = dst_pos + length; 256 while (dst_pos < dst_end) { 257 oop o = s_elem_vklass->allocate_instance(CHECK); 258 s_elem_vklass->value_store(sh->value_at_addr(src_pos, layout_helper()), 259 s_elem_vklass->data_for_oop(o), true, true); 260 dh->obj_at_put(dst_pos, o); 261 dst_pos++; 262 src_pos++; 263 } 264 } 265 } else { 266 assert(s->is_objArray(), "Expected objArray"); 267 objArrayOop sa = objArrayOop(s); 268 assert(d->is_valueArray(), "Excepted valueArray"); // objArray-to-valueArray 269 ValueKlass* d_elem_vklass = ValueKlass::cast(d_elem_klass); 270 valueArrayOop da = valueArrayOop(d); 271 272 int src_end = src_pos + length; 273 int delem_incr = 1 << dk->log2_element_size(); 274 address dst = (address) da->value_at_addr(dst_pos, layout_helper()); 275 while (src_pos < src_end) { 276 oop se = sa->obj_at(src_pos); 277 if (se == NULL) { 278 THROW(vmSymbols::java_lang_NullPointerException()); 279 } 280 // Check exact type per element 281 if (se->klass() != d_elem_klass) { 282 THROW(vmSymbols::java_lang_ArrayStoreException()); 283 } 284 d_elem_vklass->value_store(d_elem_vklass->data_for_oop(se), dst, true, false); 285 dst += delem_incr; 286 src_pos++; 287 } 288 } 289 } 290 291 292 Klass* ValueArrayKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, int n, TRAPS) { 293 assert(storage_props.is_flattened() || n > 1, "Expected flat storage"); 294 assert(dimension() <= n, "check order of chain"); 295 int dim = dimension(); 296 if (dim == n) return this; 297 298 if (higher_dimension_acquire() == NULL) { 299 if (or_null) return NULL; 300 301 ResourceMark rm; 302 { 303 // Ensure atomic creation of higher dimensions 304 MutexLocker mu(MultiArray_lock, THREAD); 305 306 // Check if another thread beat us 307 if (higher_dimension() == NULL) { 308 309 // Create multi-dim klass object and link them together 310 Klass* k = 311 ObjArrayKlass::allocate_objArray_klass(storage_props, dim + 1, this, CHECK_NULL); 312 ObjArrayKlass* ak = ObjArrayKlass::cast(k); 313 ak->set_lower_dimension(this); 314 OrderAccess::storestore(); 315 release_set_higher_dimension(ak); 316 assert(ak->is_objArray_klass(), "incorrect initialization of ObjArrayKlass"); 317 } 318 } 319 } else { 320 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops()); 321 } 322 323 ObjArrayKlass *ak = ObjArrayKlass::cast(higher_dimension()); 324 if (or_null) { 325 return ak->array_klass_or_null(storage_props, n); 326 } 327 return ak->array_klass(storage_props, n, THREAD); 328 } 329 330 Klass* ValueArrayKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, TRAPS) { 331 return array_klass_impl(storage_props, or_null, dimension() + 1, THREAD); 332 } 333 334 ModuleEntry* ValueArrayKlass::module() const { 335 assert(element_klass() != NULL, "ValueArrayKlass returned unexpected NULL bottom_klass"); 336 // The array is defined in the module of its bottom class 337 return element_klass()->module(); 338 } 339 340 PackageEntry* ValueArrayKlass::package() const { 341 assert(element_klass() != NULL, "ValuerrayKlass returned unexpected NULL bottom_klass"); 342 return element_klass()->package(); 343 } 344 345 bool ValueArrayKlass::can_be_primary_super_slow() const { 346 return true; 347 } 348 349 GrowableArray<Klass*>* ValueArrayKlass::compute_secondary_supers(int num_extra_slots, 350 Array<InstanceKlass*>* transitive_interfaces) { 351 assert(transitive_interfaces == NULL, "sanity"); 352 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... }; 353 Array<Klass*>* elem_supers = element_klass()->secondary_supers(); 354 int num_elem_supers = elem_supers == NULL ? 0 : elem_supers->length(); 355 int num_secondaries = num_extra_slots + 2 + num_elem_supers; 356 if (num_secondaries == 2) { 357 // Must share this for correct bootstrapping! 358 set_secondary_supers(Universe::the_array_interfaces_array()); 359 return NULL; 360 } else { 361 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2); 362 secondaries->push(SystemDictionary::Cloneable_klass()); 363 secondaries->push(SystemDictionary::Serializable_klass()); 364 for (int i = 0; i < num_elem_supers; i++) { 365 Klass* elem_super = (Klass*) elem_supers->at(i); 366 Klass* array_super = elem_super->array_klass_or_null(ArrayStorageProperties::empty); 367 assert(array_super != NULL, "must already have been created"); 368 secondaries->push(array_super); 369 } 370 return secondaries; 371 } 372 } 373 374 void ValueArrayKlass::print_on(outputStream* st) const { 375 #ifndef PRODUCT 376 assert(!is_objArray_klass(), "Unimplemented"); 377 378 st->print("Value Type Array: "); 379 Klass::print_on(st); 380 381 st->print(" - element klass: "); 382 element_klass()->print_value_on(st); 383 st->cr(); 384 385 int elem_size = element_byte_size(); 386 st->print(" - element size %i ", elem_size); 387 st->print("aligned layout size %i", 1 << layout_helper_log2_element_size(layout_helper())); 388 st->cr(); 389 #endif //PRODUCT 390 } 391 392 void ValueArrayKlass::print_value_on(outputStream* st) const { 393 assert(is_klass(), "must be klass"); 394 395 element_klass()->print_value_on(st); 396 st->print("[]"); 397 } 398 399 400 #ifndef PRODUCT 401 void ValueArrayKlass::oop_print_on(oop obj, outputStream* st) { 402 ArrayKlass::oop_print_on(obj, st); 403 valueArrayOop va = valueArrayOop(obj); 404 ValueKlass* vk = element_klass(); 405 int print_len = MIN2((intx) va->length(), MaxElementPrintSize); 406 for(int index = 0; index < print_len; index++) { 407 int off = (address) va->value_at_addr(index, layout_helper()) - (address) obj; 408 st->print_cr(" - Index %3d offset %3d: ", index, off); 409 oop obj = (oop) ((address)va->value_at_addr(index, layout_helper()) - vk->first_field_offset()); 410 FieldPrinter print_field(st, obj); 411 vk->do_nonstatic_fields(&print_field); 412 st->cr(); 413 } 414 int remaining = va->length() - print_len; 415 if (remaining > 0) { 416 st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining); 417 } 418 } 419 #endif //PRODUCT 420 421 void ValueArrayKlass::oop_print_value_on(oop obj, outputStream* st) { 422 assert(obj->is_valueArray(), "must be valueArray"); 423 st->print("a "); 424 element_klass()->print_value_on(st); 425 int len = valueArrayOop(obj)->length(); 426 st->print("[%d] ", len); 427 obj->print_address_on(st); 428 if (PrintMiscellaneous && (WizardMode || Verbose)) { 429 int lh = layout_helper(); 430 st->print("{"); 431 for (int i = 0; i < len; i++) { 432 if (i > 4) { 433 st->print("..."); break; 434 } 435 st->print(" " INTPTR_FORMAT, (intptr_t)(void*)valueArrayOop(obj)->value_at_addr(i , lh)); 436 } 437 st->print(" }"); 438 } 439 } 440 441 // Verification 442 class VerifyElementClosure: public BasicOopIterateClosure { 443 public: 444 virtual void do_oop(oop* p) { VerifyOopClosure::verify_oop.do_oop(p); } 445 virtual void do_oop(narrowOop* p) { VerifyOopClosure::verify_oop.do_oop(p); } 446 }; 447 448 void ValueArrayKlass::oop_verify_on(oop obj, outputStream* st) { 449 ArrayKlass::oop_verify_on(obj, st); 450 guarantee(obj->is_valueArray(), "must be valueArray"); 451 452 if (contains_oops()) { 453 valueArrayOop va = valueArrayOop(obj); 454 VerifyElementClosure ec; 455 va->oop_iterate(&ec); 456 } 457 } 458 459 void ValueArrayKlass::verify_on(outputStream* st) { 460 ArrayKlass::verify_on(st); 461 guarantee(element_klass()->is_value(), "should be value type klass"); 462 }