rev 49674 : 8198285: More consistent Access API for arraycopy

   1 /*
   2  * Copyright (c) 1997, 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.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.hpp"
  37 #include "oops/arrayKlass.inline.hpp"
  38 #include "oops/instanceKlass.hpp"
  39 #include "oops/klass.inline.hpp"
  40 #include "oops/objArrayKlass.hpp"
  41 #include "oops/oop.inline.hpp"
  42 #include "oops/typeArrayKlass.inline.hpp"
  43 #include "oops/typeArrayOop.inline.hpp"
  44 #include "runtime/handles.inline.hpp"
  45 #include "utilities/macros.hpp"
  46 
  47 bool TypeArrayKlass::compute_is_subtype_of(Klass* k) {
  48   if (!k->is_typeArray_klass()) {
  49     return ArrayKlass::compute_is_subtype_of(k);
  50   }
  51 
  52   TypeArrayKlass* tak = TypeArrayKlass::cast(k);
  53   if (dimension() != tak->dimension()) return false;
  54 
  55   return element_type() == tak->element_type();
  56 }
  57 
  58 TypeArrayKlass* TypeArrayKlass::create_klass(BasicType type,
  59                                       const char* name_str, TRAPS) {
  60   Symbol* sym = NULL;
  61   if (name_str != NULL) {
  62     sym = SymbolTable::new_permanent_symbol(name_str, CHECK_NULL);
  63   }
  64 
  65   ClassLoaderData* null_loader_data = ClassLoaderData::the_null_class_loader_data();
  66 
  67   TypeArrayKlass* ak = TypeArrayKlass::allocate(null_loader_data, type, sym, CHECK_NULL);
  68 
  69   // Add all classes to our internal class loader list here,
  70   // including classes in the bootstrap (NULL) class loader.
  71   // GC walks these as strong roots.
  72   null_loader_data->add_class(ak);
  73 
  74   // Call complete_create_array_klass after all instance variables have been initialized.
  75   complete_create_array_klass(ak, ak->super(), ModuleEntryTable::javabase_moduleEntry(), CHECK_NULL);
  76 
  77   return ak;
  78 }
  79 
  80 TypeArrayKlass* TypeArrayKlass::allocate(ClassLoaderData* loader_data, BasicType type, Symbol* name, TRAPS) {
  81   assert(TypeArrayKlass::header_size() <= InstanceKlass::header_size(),
  82       "array klasses must be same size as InstanceKlass");
  83 
  84   int size = ArrayKlass::static_size(TypeArrayKlass::header_size());
  85 
  86   return new (loader_data, size, THREAD) TypeArrayKlass(type, name);
  87 }
  88 
  89 TypeArrayKlass::TypeArrayKlass(BasicType type, Symbol* name) : ArrayKlass(name) {
  90   set_layout_helper(array_layout_helper(type));
  91   assert(is_array_klass(), "sanity");
  92   assert(is_typeArray_klass(), "sanity");
  93 
  94   set_max_length(arrayOopDesc::max_array_length(type));
  95   assert(size() >= TypeArrayKlass::header_size(), "bad size");
  96 
  97   set_class_loader_data(ClassLoaderData::the_null_class_loader_data());
  98 }
  99 
 100 typeArrayOop TypeArrayKlass::allocate_common(int length, bool do_zero, TRAPS) {
 101   assert(log2_element_size() >= 0, "bad scale");
 102   if (length >= 0) {
 103     if (length <= max_length()) {
 104       size_t size = typeArrayOopDesc::object_size(layout_helper(), length);
 105       typeArrayOop t;
 106       CollectedHeap* ch = Universe::heap();
 107       if (do_zero) {
 108         t = (typeArrayOop)CollectedHeap::array_allocate(this, (int)size, length, CHECK_NULL);
 109       } else {
 110         t = (typeArrayOop)CollectedHeap::array_allocate_nozero(this, (int)size, length, CHECK_NULL);
 111       }
 112       return t;
 113     } else {
 114       report_java_out_of_memory("Requested array size exceeds VM limit");
 115       JvmtiExport::post_array_size_exhausted();
 116       THROW_OOP_0(Universe::out_of_memory_error_array_size());
 117     }
 118   } else {
 119     THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
 120   }
 121 }
 122 
 123 oop TypeArrayKlass::multi_allocate(int rank, jint* last_size, TRAPS) {
 124   // For typeArrays this is only called for the last dimension
 125   assert(rank == 1, "just checking");
 126   int length = *last_size;
 127   return allocate(length, THREAD);
 128 }
 129 
 130 
 131 void TypeArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) {
 132   assert(s->is_typeArray(), "must be type array");
 133 
 134   // Check destination
 135   if (!d->is_typeArray() || element_type() != TypeArrayKlass::cast(d->klass())->element_type()) {
 136     THROW(vmSymbols::java_lang_ArrayStoreException());
 137   }
 138 
 139   // Check is all offsets and lengths are non negative
 140   if (src_pos < 0 || dst_pos < 0 || length < 0) {
 141     THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
 142   }
 143   // Check if the ranges are valid
 144   if  ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())
 145      || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {
 146     THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());
 147   }
 148   // Check zero copy
 149   if (length == 0)
 150     return;
 151 
 152   // This is an attempt to make the copy_array fast.
 153   int l2es = log2_element_size();
 154   int ihs = array_header_in_bytes() / wordSize;
 155   size_t src_offset = arrayOopDesc::base_offset_in_bytes(element_type()) + ((size_t)src_pos << l2es);
 156   size_t dst_offset = arrayOopDesc::base_offset_in_bytes(element_type()) + ((size_t)dst_pos << l2es);
 157   HeapAccess<ARRAYCOPY_ATOMIC>::arraycopy<void>(s, src_offset, NULL, d, dst_offset, NULL, (size_t)length << l2es);
 158 }
 159 
 160 
 161 // create a klass of array holding typeArrays
 162 Klass* TypeArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
 163   int dim = dimension();
 164   assert(dim <= n, "check order of chain");
 165     if (dim == n)
 166       return this;
 167 
 168   // lock-free read needs acquire semantics
 169   if (higher_dimension_acquire() == NULL) {
 170     if (or_null)  return NULL;
 171 
 172     ResourceMark rm;
 173     JavaThread *jt = (JavaThread *)THREAD;
 174     {
 175       MutexLocker mc(Compile_lock, THREAD);   // for vtables
 176       // Atomic create higher dimension and link into list
 177       MutexLocker mu(MultiArray_lock, THREAD);
 178 
 179       if (higher_dimension() == NULL) {
 180         Klass* oak = ObjArrayKlass::allocate_objArray_klass(
 181               class_loader_data(), dim + 1, this, CHECK_NULL);
 182         ObjArrayKlass* h_ak = ObjArrayKlass::cast(oak);
 183         h_ak->set_lower_dimension(this);
 184         // use 'release' to pair with lock-free load
 185         release_set_higher_dimension(h_ak);
 186         assert(h_ak->is_objArray_klass(), "incorrect initialization of ObjArrayKlass");
 187       }
 188     }
 189   } else {
 190     CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
 191   }
 192   ObjArrayKlass* h_ak = ObjArrayKlass::cast(higher_dimension());
 193   if (or_null) {
 194     return h_ak->array_klass_or_null(n);
 195   }
 196   return h_ak->array_klass(n, THREAD);
 197 }
 198 
 199 Klass* TypeArrayKlass::array_klass_impl(bool or_null, TRAPS) {
 200   return array_klass_impl(or_null, dimension() +  1, THREAD);
 201 }
 202 
 203 int TypeArrayKlass::oop_size(oop obj) const {
 204   assert(obj->is_typeArray(),"must be a type array");
 205   typeArrayOop t = typeArrayOop(obj);
 206   return t->object_size();
 207 }
 208 
 209 void TypeArrayKlass::initialize(TRAPS) {
 210   // Nothing to do. Having this function is handy since objArrayKlasses can be
 211   // initialized by calling initialize on their bottom_klass, see ObjArrayKlass::initialize
 212 }
 213 
 214 const char* TypeArrayKlass::external_name(BasicType type) {
 215   switch (type) {
 216     case T_BOOLEAN: return "[Z";
 217     case T_CHAR:    return "[C";
 218     case T_FLOAT:   return "[F";
 219     case T_DOUBLE:  return "[D";
 220     case T_BYTE:    return "[B";
 221     case T_SHORT:   return "[S";
 222     case T_INT:     return "[I";
 223     case T_LONG:    return "[J";
 224     default: ShouldNotReachHere();
 225   }
 226   return NULL;
 227 }
 228 
 229 
 230 // Printing
 231 
 232 void TypeArrayKlass::print_on(outputStream* st) const {
 233 #ifndef PRODUCT
 234   assert(is_klass(), "must be klass");
 235   print_value_on(st);
 236   Klass::print_on(st);
 237 #endif //PRODUCT
 238 }
 239 
 240 void TypeArrayKlass::print_value_on(outputStream* st) const {
 241   assert(is_klass(), "must be klass");
 242   st->print("{type array ");
 243   switch (element_type()) {
 244     case T_BOOLEAN: st->print("bool");    break;
 245     case T_CHAR:    st->print("char");    break;
 246     case T_FLOAT:   st->print("float");   break;
 247     case T_DOUBLE:  st->print("double");  break;
 248     case T_BYTE:    st->print("byte");    break;
 249     case T_SHORT:   st->print("short");   break;
 250     case T_INT:     st->print("int");     break;
 251     case T_LONG:    st->print("long");    break;
 252     default: ShouldNotReachHere();
 253   }
 254   st->print("}");
 255 }
 256 
 257 #ifndef PRODUCT
 258 
 259 static void print_boolean_array(typeArrayOop ta, int print_len, outputStream* st) {
 260   for (int index = 0; index < print_len; index++) {
 261     st->print_cr(" - %3d: %s", index, (ta->bool_at(index) == 0) ? "false" : "true");
 262   }
 263 }
 264 
 265 
 266 static void print_char_array(typeArrayOop ta, int print_len, outputStream* st) {
 267   for (int index = 0; index < print_len; index++) {
 268     jchar c = ta->char_at(index);
 269     st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' ');
 270   }
 271 }
 272 
 273 
 274 static void print_float_array(typeArrayOop ta, int print_len, outputStream* st) {
 275   for (int index = 0; index < print_len; index++) {
 276     st->print_cr(" - %3d: %g", index, ta->float_at(index));
 277   }
 278 }
 279 
 280 
 281 static void print_double_array(typeArrayOop ta, int print_len, outputStream* st) {
 282   for (int index = 0; index < print_len; index++) {
 283     st->print_cr(" - %3d: %g", index, ta->double_at(index));
 284   }
 285 }
 286 
 287 
 288 static void print_byte_array(typeArrayOop ta, int print_len, outputStream* st) {
 289   for (int index = 0; index < print_len; index++) {
 290     jbyte c = ta->byte_at(index);
 291     st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' ');
 292   }
 293 }
 294 
 295 
 296 static void print_short_array(typeArrayOop ta, int print_len, outputStream* st) {
 297   for (int index = 0; index < print_len; index++) {
 298     int v = ta->ushort_at(index);
 299     st->print_cr(" - %3d: 0x%x\t %d", index, v, v);
 300   }
 301 }
 302 
 303 
 304 static void print_int_array(typeArrayOop ta, int print_len, outputStream* st) {
 305   for (int index = 0; index < print_len; index++) {
 306     jint v = ta->int_at(index);
 307     st->print_cr(" - %3d: 0x%x %d", index, v, v);
 308   }
 309 }
 310 
 311 
 312 static void print_long_array(typeArrayOop ta, int print_len, outputStream* st) {
 313   for (int index = 0; index < print_len; index++) {
 314     jlong v = ta->long_at(index);
 315     st->print_cr(" - %3d: 0x%x 0x%x", index, high(v), low(v));
 316   }
 317 }
 318 
 319 
 320 void TypeArrayKlass::oop_print_on(oop obj, outputStream* st) {
 321   ArrayKlass::oop_print_on(obj, st);
 322   typeArrayOop ta = typeArrayOop(obj);
 323   int print_len = MIN2((intx) ta->length(), MaxElementPrintSize);
 324   switch (element_type()) {
 325     case T_BOOLEAN: print_boolean_array(ta, print_len, st); break;
 326     case T_CHAR:    print_char_array(ta, print_len, st);    break;
 327     case T_FLOAT:   print_float_array(ta, print_len, st);   break;
 328     case T_DOUBLE:  print_double_array(ta, print_len, st);  break;
 329     case T_BYTE:    print_byte_array(ta, print_len, st);    break;
 330     case T_SHORT:   print_short_array(ta, print_len, st);   break;
 331     case T_INT:     print_int_array(ta, print_len, st);     break;
 332     case T_LONG:    print_long_array(ta, print_len, st);    break;
 333     default: ShouldNotReachHere();
 334   }
 335   int remaining = ta->length() - print_len;
 336   if (remaining > 0) {
 337     st->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining);
 338   }
 339 }
 340 
 341 #endif // PRODUCT
 342 
 343 const char* TypeArrayKlass::internal_name() const {
 344   return Klass::external_name();
 345 }
 346 
 347 // A TypeArrayKlass is an array of a primitive type, its defining module is java.base
 348 ModuleEntry* TypeArrayKlass::module() const {
 349   return ModuleEntryTable::javabase_moduleEntry();
 350 }
 351 
 352 PackageEntry* TypeArrayKlass::package() const {
 353   return NULL;
 354 }
--- EOF ---