src/share/vm/oops/typeArrayKlass.cpp

Wed, 27 Apr 2016 01:25:04 +0800

author
aoqi
date
Wed, 27 Apr 2016 01:25:04 +0800
changeset 0
f90c822e73f8
child 6876
710a3c8b516e
permissions
-rw-r--r--

Initial load
http://hg.openjdk.java.net/jdk8u/jdk8u/hotspot/
changeset: 6782:28b50d07f6f8
tag: jdk8u25-b17

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

mercurial