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