typeArrayKlass.cpp revision 1879:f95d63e2154a
190075Sobrien/* 290075Sobrien * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. 3169689Skan * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 490075Sobrien * 590075Sobrien * This code is free software; you can redistribute it and/or modify it 690075Sobrien * under the terms of the GNU General Public License version 2 only, as 790075Sobrien * published by the Free Software Foundation. 890075Sobrien * 990075Sobrien * This code is distributed in the hope that it will be useful, but WITHOUT 1090075Sobrien * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 1190075Sobrien * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 1290075Sobrien * version 2 for more details (a copy is included in the LICENSE file that 1390075Sobrien * accompanied this code). 1490075Sobrien * 1590075Sobrien * You should have received a copy of the GNU General Public License version 1690075Sobrien * 2 along with this work; if not, write to the Free Software Foundation, 1790075Sobrien * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1890075Sobrien * 1990075Sobrien * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 2090075Sobrien * or visit www.oracle.com if you need additional information or have any 2190075Sobrien * questions. 2290075Sobrien * 2390075Sobrien */ 2490075Sobrien 2590075Sobrien#include "precompiled.hpp" 26169689Skan#include "classfile/systemDictionary.hpp" 27169689Skan#include "classfile/vmSymbols.hpp" 2890075Sobrien#include "gc_interface/collectedHeap.hpp" 2990075Sobrien#include "gc_interface/collectedHeap.inline.hpp" 3090075Sobrien#include "memory/resourceArea.hpp" 3190075Sobrien#include "memory/universe.hpp" 3290075Sobrien#include "memory/universe.inline.hpp" 3390075Sobrien#include "oops/instanceKlass.hpp" 3490075Sobrien#include "oops/klassOop.hpp" 3590075Sobrien#include "oops/objArrayKlassKlass.hpp" 36169689Skan#include "oops/oop.inline.hpp" 37169689Skan#include "oops/typeArrayKlass.hpp" 3890075Sobrien#include "oops/typeArrayOop.hpp" 3990075Sobrien#include "runtime/handles.inline.hpp" 4090075Sobrien 41169689Skanbool typeArrayKlass::compute_is_subtype_of(klassOop k) { 4290075Sobrien if (!k->klass_part()->oop_is_typeArray()) { 4390075Sobrien return arrayKlass::compute_is_subtype_of(k); 4490075Sobrien } 4590075Sobrien 46169689Skan typeArrayKlass* tak = typeArrayKlass::cast(k); 4790075Sobrien if (dimension() != tak->dimension()) return false; 48169689Skan 4990075Sobrien return element_type() == tak->element_type(); 50169689Skan} 5190075Sobrien 5290075SobrienklassOop typeArrayKlass::create_klass(BasicType type, int scale, 53169689Skan const char* name_str, TRAPS) { 5490075Sobrien typeArrayKlass o; 5590075Sobrien 5690075Sobrien symbolHandle sym(symbolOop(NULL)); 5790075Sobrien // bootstrapping: don't create sym if symbolKlass not created yet 5890075Sobrien if (Universe::symbolKlassObj() != NULL && name_str != NULL) { 5990075Sobrien sym = oopFactory::new_symbol_handle(name_str, CHECK_NULL); 6090075Sobrien } 6190075Sobrien KlassHandle klassklass (THREAD, Universe::typeArrayKlassKlassObj()); 6290075Sobrien 6390075Sobrien arrayKlassHandle k = base_create_array_klass(o.vtbl_value(), header_size(), klassklass, CHECK_NULL); 6490075Sobrien typeArrayKlass* ak = typeArrayKlass::cast(k()); 6590075Sobrien ak->set_name(sym()); 6690075Sobrien ak->set_layout_helper(array_layout_helper(type)); 6790075Sobrien assert(scale == (1 << ak->log2_element_size()), "scale must check out"); 6890075Sobrien assert(ak->oop_is_javaArray(), "sanity"); 69117395Skan assert(ak->oop_is_typeArray(), "sanity"); 70169689Skan ak->set_max_length(arrayOopDesc::max_array_length(type)); 7190075Sobrien assert(k()->size() > header_size(), "bad size"); 7290075Sobrien 73169689Skan // Call complete_create_array_klass after all instance variables have been initialized. 74169689Skan KlassHandle super (THREAD, k->super()); 75169689Skan complete_create_array_klass(k, super, CHECK_NULL); 7690075Sobrien 7790075Sobrien return k(); 7890075Sobrien} 7990075Sobrien 8090075SobrientypeArrayOop typeArrayKlass::allocate(int length, TRAPS) { 8190075Sobrien assert(log2_element_size() >= 0, "bad scale"); 8290075Sobrien if (length >= 0) { 8390075Sobrien if (length <= max_length()) { 8490075Sobrien size_t size = typeArrayOopDesc::object_size(layout_helper(), length); 8590075Sobrien KlassHandle h_k(THREAD, as_klassOop()); 8690075Sobrien typeArrayOop t; 8790075Sobrien CollectedHeap* ch = Universe::heap(); 88169689Skan if (size < ch->large_typearray_limit()) { 89169689Skan t = (typeArrayOop)CollectedHeap::array_allocate(h_k, (int)size, length, CHECK_NULL); 9090075Sobrien } else { 9190075Sobrien t = (typeArrayOop)CollectedHeap::large_typearray_allocate(h_k, (int)size, length, CHECK_NULL); 9290075Sobrien } 9390075Sobrien assert(t->is_parsable(), "Don't publish unless parsable"); 9490075Sobrien return t; 9590075Sobrien } else { 9690075Sobrien report_java_out_of_memory("Requested array size exceeds VM limit"); 9790075Sobrien THROW_OOP_0(Universe::out_of_memory_error_array_size()); 9890075Sobrien } 99169689Skan } else { 10090075Sobrien THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); 10190075Sobrien } 10290075Sobrien} 103169689Skan 104169689SkantypeArrayOop typeArrayKlass::allocate_permanent(int length, TRAPS) { 105169689Skan if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); 10690075Sobrien int size = typeArrayOopDesc::object_size(layout_helper(), length); 10790075Sobrien KlassHandle h_k(THREAD, as_klassOop()); 10890075Sobrien typeArrayOop t = (typeArrayOop) 10990075Sobrien CollectedHeap::permanent_array_allocate(h_k, size, length, CHECK_NULL); 110169689Skan assert(t->is_parsable(), "Can't publish until parsable"); 111169689Skan return t; 11290075Sobrien} 11390075Sobrien 11490075Sobrienoop typeArrayKlass::multi_allocate(int rank, jint* last_size, TRAPS) { 11590075Sobrien // For typeArrays this is only called for the last dimension 11690075Sobrien assert(rank == 1, "just checking"); 11790075Sobrien int length = *last_size; 11890075Sobrien return allocate(length, THREAD); 11990075Sobrien} 120169689Skan 12190075Sobrien 12290075Sobrienvoid typeArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) { 12390075Sobrien assert(s->is_typeArray(), "must be type array"); 12490075Sobrien 12590075Sobrien // Check destination 12690075Sobrien if (!d->is_typeArray() || element_type() != typeArrayKlass::cast(d->klass())->element_type()) { 127169689Skan THROW(vmSymbols::java_lang_ArrayStoreException()); 12890075Sobrien } 12990075Sobrien 13090075Sobrien // Check is all offsets and lengths are non negative 13190075Sobrien if (src_pos < 0 || dst_pos < 0 || length < 0) { 132169689Skan THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException()); 13390075Sobrien } 134169689Skan // Check if the ranges are valid 13590075Sobrien if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) 136 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) { 137 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException()); 138 } 139 // Check zero copy 140 if (length == 0) 141 return; 142 143 // This is an attempt to make the copy_array fast. 144 int l2es = log2_element_size(); 145 int ihs = array_header_in_bytes() / wordSize; 146 char* src = (char*) ((oop*)s + ihs) + ((size_t)src_pos << l2es); 147 char* dst = (char*) ((oop*)d + ihs) + ((size_t)dst_pos << l2es); 148 Copy::conjoint_memory_atomic(src, dst, (size_t)length << l2es); 149} 150 151 152// create a klass of array holding typeArrays 153klassOop typeArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) { 154 typeArrayKlassHandle h_this(THREAD, as_klassOop()); 155 return array_klass_impl(h_this, or_null, n, THREAD); 156} 157 158klassOop typeArrayKlass::array_klass_impl(typeArrayKlassHandle h_this, bool or_null, int n, TRAPS) { 159 int dimension = h_this->dimension(); 160 assert(dimension <= n, "check order of chain"); 161 if (dimension == n) 162 return h_this(); 163 164 objArrayKlassHandle h_ak(THREAD, h_this->higher_dimension()); 165 if (h_ak.is_null()) { 166 if (or_null) return NULL; 167 168 ResourceMark rm; 169 JavaThread *jt = (JavaThread *)THREAD; 170 { 171 MutexLocker mc(Compile_lock, THREAD); // for vtables 172 // Atomic create higher dimension and link into list 173 MutexLocker mu(MultiArray_lock, THREAD); 174 175 h_ak = objArrayKlassHandle(THREAD, h_this->higher_dimension()); 176 if (h_ak.is_null()) { 177 klassOop oak = objArrayKlassKlass::cast( 178 Universe::objArrayKlassKlassObj())->allocate_objArray_klass( 179 dimension + 1, h_this, CHECK_NULL); 180 h_ak = objArrayKlassHandle(THREAD, oak); 181 h_ak->set_lower_dimension(h_this()); 182 h_this->set_higher_dimension(h_ak()); 183 assert(h_ak->oop_is_objArray(), "incorrect initialization of objArrayKlass"); 184 } 185 } 186 } else { 187 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops()); 188 } 189 if (or_null) { 190 return h_ak->array_klass_or_null(n); 191 } 192 return h_ak->array_klass(n, CHECK_NULL); 193} 194 195klassOop typeArrayKlass::array_klass_impl(bool or_null, TRAPS) { 196 return array_klass_impl(or_null, dimension() + 1, THREAD); 197} 198 199int typeArrayKlass::oop_size(oop obj) const { 200 assert(obj->is_typeArray(),"must be a type array"); 201 typeArrayOop t = typeArrayOop(obj); 202 return t->object_size(); 203} 204 205void typeArrayKlass::oop_follow_contents(oop obj) { 206 assert(obj->is_typeArray(),"must be a type array"); 207 // Performance tweak: We skip iterating over the klass pointer since we 208 // know that Universe::typeArrayKlass never moves. 209} 210 211#ifndef SERIALGC 212void typeArrayKlass::oop_follow_contents(ParCompactionManager* cm, oop obj) { 213 assert(obj->is_typeArray(),"must be a type array"); 214 // Performance tweak: We skip iterating over the klass pointer since we 215 // know that Universe::typeArrayKlass never moves. 216} 217#endif // SERIALGC 218 219int typeArrayKlass::oop_adjust_pointers(oop obj) { 220 assert(obj->is_typeArray(),"must be a type array"); 221 typeArrayOop t = typeArrayOop(obj); 222 // Performance tweak: We skip iterating over the klass pointer since we 223 // know that Universe::typeArrayKlass never moves. 224 return t->object_size(); 225} 226 227int typeArrayKlass::oop_oop_iterate(oop obj, OopClosure* blk) { 228 assert(obj->is_typeArray(),"must be a type array"); 229 typeArrayOop t = typeArrayOop(obj); 230 // Performance tweak: We skip iterating over the klass pointer since we 231 // know that Universe::typeArrayKlass never moves. 232 return t->object_size(); 233} 234 235int typeArrayKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { 236 assert(obj->is_typeArray(),"must be a type array"); 237 typeArrayOop t = typeArrayOop(obj); 238 // Performance tweak: We skip iterating over the klass pointer since we 239 // know that Universe::typeArrayKlass never moves. 240 return t->object_size(); 241} 242 243#ifndef SERIALGC 244void typeArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { 245 assert(obj->is_typeArray(),"must be a type array"); 246} 247 248int 249typeArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { 250 assert(obj->is_typeArray(),"must be a type array"); 251 return typeArrayOop(obj)->object_size(); 252} 253 254int 255typeArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, 256 HeapWord* beg_addr, HeapWord* end_addr) { 257 assert(obj->is_typeArray(),"must be a type array"); 258 return typeArrayOop(obj)->object_size(); 259} 260#endif // SERIALGC 261 262void typeArrayKlass::initialize(TRAPS) { 263 // Nothing to do. Having this function is handy since objArrayKlasses can be 264 // initialized by calling initialize on their bottom_klass, see objArrayKlass::initialize 265} 266 267const char* typeArrayKlass::external_name(BasicType type) { 268 switch (type) { 269 case T_BOOLEAN: return "[Z"; 270 case T_CHAR: return "[C"; 271 case T_FLOAT: return "[F"; 272 case T_DOUBLE: return "[D"; 273 case T_BYTE: return "[B"; 274 case T_SHORT: return "[S"; 275 case T_INT: return "[I"; 276 case T_LONG: return "[J"; 277 default: ShouldNotReachHere(); 278 } 279 return NULL; 280} 281 282#ifndef PRODUCT 283// Printing 284 285static void print_boolean_array(typeArrayOop ta, int print_len, outputStream* st) { 286 for (int index = 0; index < print_len; index++) { 287 st->print_cr(" - %3d: %s", index, (ta->bool_at(index) == 0) ? "false" : "true"); 288 } 289} 290 291 292static void print_char_array(typeArrayOop ta, int print_len, outputStream* st) { 293 for (int index = 0; index < print_len; index++) { 294 jchar c = ta->char_at(index); 295 st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' '); 296 } 297} 298 299 300static void print_float_array(typeArrayOop ta, int print_len, outputStream* st) { 301 for (int index = 0; index < print_len; index++) { 302 st->print_cr(" - %3d: %g", index, ta->float_at(index)); 303 } 304} 305 306 307static void print_double_array(typeArrayOop ta, int print_len, outputStream* st) { 308 for (int index = 0; index < print_len; index++) { 309 st->print_cr(" - %3d: %g", index, ta->double_at(index)); 310 } 311} 312 313 314static void print_byte_array(typeArrayOop ta, int print_len, outputStream* st) { 315 for (int index = 0; index < print_len; index++) { 316 jbyte c = ta->byte_at(index); 317 st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' '); 318 } 319} 320 321 322static void print_short_array(typeArrayOop ta, int print_len, outputStream* st) { 323 for (int index = 0; index < print_len; index++) { 324 int v = ta->ushort_at(index); 325 st->print_cr(" - %3d: 0x%x\t %d", index, v, v); 326 } 327} 328 329 330static void print_int_array(typeArrayOop ta, int print_len, outputStream* st) { 331 for (int index = 0; index < print_len; index++) { 332 jint v = ta->int_at(index); 333 st->print_cr(" - %3d: 0x%x %d", index, v, v); 334 } 335} 336 337 338static void print_long_array(typeArrayOop ta, int print_len, outputStream* st) { 339 for (int index = 0; index < print_len; index++) { 340 jlong v = ta->long_at(index); 341 st->print_cr(" - %3d: 0x%x 0x%x", index, high(v), low(v)); 342 } 343} 344 345 346void typeArrayKlass::oop_print_on(oop obj, outputStream* st) { 347 arrayKlass::oop_print_on(obj, st); 348 typeArrayOop ta = typeArrayOop(obj); 349 int print_len = MIN2((intx) ta->length(), MaxElementPrintSize); 350 switch (element_type()) { 351 case T_BOOLEAN: print_boolean_array(ta, print_len, st); break; 352 case T_CHAR: print_char_array(ta, print_len, st); break; 353 case T_FLOAT: print_float_array(ta, print_len, st); break; 354 case T_DOUBLE: print_double_array(ta, print_len, st); break; 355 case T_BYTE: print_byte_array(ta, print_len, st); break; 356 case T_SHORT: print_short_array(ta, print_len, st); break; 357 case T_INT: print_int_array(ta, print_len, st); break; 358 case T_LONG: print_long_array(ta, print_len, st); break; 359 default: ShouldNotReachHere(); 360 } 361 int remaining = ta->length() - print_len; 362 if (remaining > 0) { 363 tty->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining); 364 } 365} 366 367#endif // PRODUCT 368 369const char* typeArrayKlass::internal_name() const { 370 return Klass::external_name(); 371} 372