Thu, 07 Oct 2010 21:40:55 -0700
6980792: Crash "exception happened outside interpreter, nmethods and vtable stubs (1)"
Reviewed-by: kvn
duke@435 | 1 | /* |
trims@1907 | 2 | * Copyright (c) 1998, 2010, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_parse3.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | //============================================================================= |
duke@435 | 29 | // Helper methods for _get* and _put* bytecodes |
duke@435 | 30 | //============================================================================= |
duke@435 | 31 | bool Parse::static_field_ok_in_clinit(ciField *field, ciMethod *method) { |
duke@435 | 32 | // Could be the field_holder's <clinit> method, or <clinit> for a subklass. |
duke@435 | 33 | // Better to check now than to Deoptimize as soon as we execute |
duke@435 | 34 | assert( field->is_static(), "Only check if field is static"); |
duke@435 | 35 | // is_being_initialized() is too generous. It allows access to statics |
duke@435 | 36 | // by threads that are not running the <clinit> before the <clinit> finishes. |
duke@435 | 37 | // return field->holder()->is_being_initialized(); |
duke@435 | 38 | |
duke@435 | 39 | // The following restriction is correct but conservative. |
duke@435 | 40 | // It is also desirable to allow compilation of methods called from <clinit> |
duke@435 | 41 | // but this generated code will need to be made safe for execution by |
duke@435 | 42 | // other threads, or the transition from interpreted to compiled code would |
duke@435 | 43 | // need to be guarded. |
duke@435 | 44 | ciInstanceKlass *field_holder = field->holder(); |
duke@435 | 45 | |
duke@435 | 46 | bool access_OK = false; |
duke@435 | 47 | if (method->holder()->is_subclass_of(field_holder)) { |
duke@435 | 48 | if (method->is_static()) { |
duke@435 | 49 | if (method->name() == ciSymbol::class_initializer_name()) { |
duke@435 | 50 | // OK to access static fields inside initializer |
duke@435 | 51 | access_OK = true; |
duke@435 | 52 | } |
duke@435 | 53 | } else { |
duke@435 | 54 | if (method->name() == ciSymbol::object_initializer_name()) { |
duke@435 | 55 | // It's also OK to access static fields inside a constructor, |
duke@435 | 56 | // because any thread calling the constructor must first have |
duke@435 | 57 | // synchronized on the class by executing a '_new' bytecode. |
duke@435 | 58 | access_OK = true; |
duke@435 | 59 | } |
duke@435 | 60 | } |
duke@435 | 61 | } |
duke@435 | 62 | |
duke@435 | 63 | return access_OK; |
duke@435 | 64 | |
duke@435 | 65 | } |
duke@435 | 66 | |
duke@435 | 67 | |
duke@435 | 68 | void Parse::do_field_access(bool is_get, bool is_field) { |
duke@435 | 69 | bool will_link; |
duke@435 | 70 | ciField* field = iter().get_field(will_link); |
duke@435 | 71 | assert(will_link, "getfield: typeflow responsibility"); |
duke@435 | 72 | |
duke@435 | 73 | ciInstanceKlass* field_holder = field->holder(); |
duke@435 | 74 | |
duke@435 | 75 | if (is_field == field->is_static()) { |
duke@435 | 76 | // Interpreter will throw java_lang_IncompatibleClassChangeError |
duke@435 | 77 | // Check this before allowing <clinit> methods to access static fields |
duke@435 | 78 | uncommon_trap(Deoptimization::Reason_unhandled, |
duke@435 | 79 | Deoptimization::Action_none); |
duke@435 | 80 | return; |
duke@435 | 81 | } |
duke@435 | 82 | |
duke@435 | 83 | if (!is_field && !field_holder->is_initialized()) { |
duke@435 | 84 | if (!static_field_ok_in_clinit(field, method())) { |
duke@435 | 85 | uncommon_trap(Deoptimization::Reason_uninitialized, |
duke@435 | 86 | Deoptimization::Action_reinterpret, |
duke@435 | 87 | NULL, "!static_field_ok_in_clinit"); |
duke@435 | 88 | return; |
duke@435 | 89 | } |
duke@435 | 90 | } |
duke@435 | 91 | |
duke@435 | 92 | assert(field->will_link(method()->holder(), bc()), "getfield: typeflow responsibility"); |
duke@435 | 93 | |
duke@435 | 94 | // Note: We do not check for an unloaded field type here any more. |
duke@435 | 95 | |
duke@435 | 96 | // Generate code for the object pointer. |
duke@435 | 97 | Node* obj; |
duke@435 | 98 | if (is_field) { |
duke@435 | 99 | int obj_depth = is_get ? 0 : field->type()->size(); |
duke@435 | 100 | obj = do_null_check(peek(obj_depth), T_OBJECT); |
duke@435 | 101 | // Compile-time detect of null-exception? |
duke@435 | 102 | if (stopped()) return; |
duke@435 | 103 | |
duke@435 | 104 | const TypeInstPtr *tjp = TypeInstPtr::make(TypePtr::NotNull, iter().get_declared_field_holder()); |
duke@435 | 105 | assert(_gvn.type(obj)->higher_equal(tjp), "cast_up is no longer needed"); |
duke@435 | 106 | |
duke@435 | 107 | if (is_get) { |
duke@435 | 108 | --_sp; // pop receiver before getting |
duke@435 | 109 | do_get_xxx(tjp, obj, field, is_field); |
duke@435 | 110 | } else { |
duke@435 | 111 | do_put_xxx(tjp, obj, field, is_field); |
duke@435 | 112 | --_sp; // pop receiver after putting |
duke@435 | 113 | } |
duke@435 | 114 | } else { |
duke@435 | 115 | const TypeKlassPtr* tkp = TypeKlassPtr::make(field_holder); |
duke@435 | 116 | obj = _gvn.makecon(tkp); |
duke@435 | 117 | if (is_get) { |
duke@435 | 118 | do_get_xxx(tkp, obj, field, is_field); |
duke@435 | 119 | } else { |
duke@435 | 120 | do_put_xxx(tkp, obj, field, is_field); |
duke@435 | 121 | } |
duke@435 | 122 | } |
duke@435 | 123 | } |
duke@435 | 124 | |
duke@435 | 125 | |
duke@435 | 126 | void Parse::do_get_xxx(const TypePtr* obj_type, Node* obj, ciField* field, bool is_field) { |
duke@435 | 127 | // Does this field have a constant value? If so, just push the value. |
twisti@1573 | 128 | if (field->is_constant()) { |
twisti@1573 | 129 | if (field->is_static()) { |
twisti@1573 | 130 | // final static field |
twisti@1573 | 131 | if (push_constant(field->constant_value())) |
twisti@1573 | 132 | return; |
twisti@1573 | 133 | } |
twisti@1573 | 134 | else { |
twisti@1573 | 135 | // final non-static field of a trusted class ({java,sun}.dyn |
twisti@1573 | 136 | // classes). |
twisti@1573 | 137 | if (obj->is_Con()) { |
twisti@1573 | 138 | const TypeOopPtr* oop_ptr = obj->bottom_type()->isa_oopptr(); |
twisti@1573 | 139 | ciObject* constant_oop = oop_ptr->const_oop(); |
twisti@1573 | 140 | ciConstant constant = field->constant_value_of(constant_oop); |
twisti@1573 | 141 | |
twisti@1573 | 142 | if (push_constant(constant, true)) |
twisti@1573 | 143 | return; |
twisti@1573 | 144 | } |
twisti@1573 | 145 | } |
twisti@1573 | 146 | } |
duke@435 | 147 | |
duke@435 | 148 | ciType* field_klass = field->type(); |
duke@435 | 149 | bool is_vol = field->is_volatile(); |
duke@435 | 150 | |
duke@435 | 151 | // Compute address and memory type. |
duke@435 | 152 | int offset = field->offset_in_bytes(); |
duke@435 | 153 | const TypePtr* adr_type = C->alias_type(field)->adr_type(); |
duke@435 | 154 | Node *adr = basic_plus_adr(obj, obj, offset); |
duke@435 | 155 | BasicType bt = field->layout_type(); |
duke@435 | 156 | |
duke@435 | 157 | // Build the resultant type of the load |
duke@435 | 158 | const Type *type; |
duke@435 | 159 | |
duke@435 | 160 | bool must_assert_null = false; |
duke@435 | 161 | |
duke@435 | 162 | if( bt == T_OBJECT ) { |
duke@435 | 163 | if (!field->type()->is_loaded()) { |
duke@435 | 164 | type = TypeInstPtr::BOTTOM; |
duke@435 | 165 | must_assert_null = true; |
twisti@1573 | 166 | } else if (field->is_constant() && field->is_static()) { |
duke@435 | 167 | // This can happen if the constant oop is non-perm. |
duke@435 | 168 | ciObject* con = field->constant_value().as_object(); |
duke@435 | 169 | // Do not "join" in the previous type; it doesn't add value, |
duke@435 | 170 | // and may yield a vacuous result if the field is of interface type. |
duke@435 | 171 | type = TypeOopPtr::make_from_constant(con)->isa_oopptr(); |
duke@435 | 172 | assert(type != NULL, "field singleton type must be consistent"); |
duke@435 | 173 | } else { |
duke@435 | 174 | type = TypeOopPtr::make_from_klass(field_klass->as_klass()); |
duke@435 | 175 | } |
duke@435 | 176 | } else { |
duke@435 | 177 | type = Type::get_const_basic_type(bt); |
duke@435 | 178 | } |
duke@435 | 179 | // Build the load. |
duke@435 | 180 | Node* ld = make_load(NULL, adr, type, bt, adr_type, is_vol); |
duke@435 | 181 | |
duke@435 | 182 | // Adjust Java stack |
duke@435 | 183 | if (type2size[bt] == 1) |
duke@435 | 184 | push(ld); |
duke@435 | 185 | else |
duke@435 | 186 | push_pair(ld); |
duke@435 | 187 | |
duke@435 | 188 | if (must_assert_null) { |
duke@435 | 189 | // Do not take a trap here. It's possible that the program |
duke@435 | 190 | // will never load the field's class, and will happily see |
duke@435 | 191 | // null values in this field forever. Don't stumble into a |
duke@435 | 192 | // trap for such a program, or we might get a long series |
duke@435 | 193 | // of useless recompilations. (Or, we might load a class |
duke@435 | 194 | // which should not be loaded.) If we ever see a non-null |
duke@435 | 195 | // value, we will then trap and recompile. (The trap will |
duke@435 | 196 | // not need to mention the class index, since the class will |
duke@435 | 197 | // already have been loaded if we ever see a non-null value.) |
duke@435 | 198 | // uncommon_trap(iter().get_field_signature_index()); |
duke@435 | 199 | #ifndef PRODUCT |
duke@435 | 200 | if (PrintOpto && (Verbose || WizardMode)) { |
duke@435 | 201 | method()->print_name(); tty->print_cr(" asserting nullness of field at bci: %d", bci()); |
duke@435 | 202 | } |
duke@435 | 203 | #endif |
duke@435 | 204 | if (C->log() != NULL) { |
duke@435 | 205 | C->log()->elem("assert_null reason='field' klass='%d'", |
duke@435 | 206 | C->log()->identify(field->type())); |
duke@435 | 207 | } |
duke@435 | 208 | // If there is going to be a trap, put it at the next bytecode: |
duke@435 | 209 | set_bci(iter().next_bci()); |
duke@435 | 210 | do_null_assert(peek(), T_OBJECT); |
duke@435 | 211 | set_bci(iter().cur_bci()); // put it back |
duke@435 | 212 | } |
duke@435 | 213 | |
duke@435 | 214 | // If reference is volatile, prevent following memory ops from |
duke@435 | 215 | // floating up past the volatile read. Also prevents commoning |
duke@435 | 216 | // another volatile read. |
duke@435 | 217 | if (field->is_volatile()) { |
duke@435 | 218 | // Memory barrier includes bogus read of value to force load BEFORE membar |
duke@435 | 219 | insert_mem_bar(Op_MemBarAcquire, ld); |
duke@435 | 220 | } |
duke@435 | 221 | } |
duke@435 | 222 | |
duke@435 | 223 | void Parse::do_put_xxx(const TypePtr* obj_type, Node* obj, ciField* field, bool is_field) { |
duke@435 | 224 | bool is_vol = field->is_volatile(); |
duke@435 | 225 | // If reference is volatile, prevent following memory ops from |
duke@435 | 226 | // floating down past the volatile write. Also prevents commoning |
duke@435 | 227 | // another volatile read. |
duke@435 | 228 | if (is_vol) insert_mem_bar(Op_MemBarRelease); |
duke@435 | 229 | |
duke@435 | 230 | // Compute address and memory type. |
duke@435 | 231 | int offset = field->offset_in_bytes(); |
duke@435 | 232 | const TypePtr* adr_type = C->alias_type(field)->adr_type(); |
duke@435 | 233 | Node* adr = basic_plus_adr(obj, obj, offset); |
duke@435 | 234 | BasicType bt = field->layout_type(); |
duke@435 | 235 | // Value to be stored |
duke@435 | 236 | Node* val = type2size[bt] == 1 ? pop() : pop_pair(); |
duke@435 | 237 | // Round doubles before storing |
duke@435 | 238 | if (bt == T_DOUBLE) val = dstore_rounding(val); |
duke@435 | 239 | |
duke@435 | 240 | // Store the value. |
duke@435 | 241 | Node* store; |
duke@435 | 242 | if (bt == T_OBJECT) { |
never@1260 | 243 | const TypeOopPtr* field_type; |
duke@435 | 244 | if (!field->type()->is_loaded()) { |
duke@435 | 245 | field_type = TypeInstPtr::BOTTOM; |
duke@435 | 246 | } else { |
duke@435 | 247 | field_type = TypeOopPtr::make_from_klass(field->type()->as_klass()); |
duke@435 | 248 | } |
duke@435 | 249 | store = store_oop_to_object( control(), obj, adr, adr_type, val, field_type, bt); |
duke@435 | 250 | } else { |
duke@435 | 251 | store = store_to_memory( control(), adr, val, bt, adr_type, is_vol ); |
duke@435 | 252 | } |
duke@435 | 253 | |
duke@435 | 254 | // If reference is volatile, prevent following volatiles ops from |
duke@435 | 255 | // floating up before the volatile write. |
duke@435 | 256 | if (is_vol) { |
duke@435 | 257 | // First place the specific membar for THIS volatile index. This first |
duke@435 | 258 | // membar is dependent on the store, keeping any other membars generated |
duke@435 | 259 | // below from floating up past the store. |
duke@435 | 260 | int adr_idx = C->get_alias_index(adr_type); |
kvn@1535 | 261 | insert_mem_bar_volatile(Op_MemBarVolatile, adr_idx, store); |
duke@435 | 262 | |
duke@435 | 263 | // Now place a membar for AliasIdxBot for the unknown yet-to-be-parsed |
duke@435 | 264 | // volatile alias indices. Skip this if the membar is redundant. |
duke@435 | 265 | if (adr_idx != Compile::AliasIdxBot) { |
kvn@1535 | 266 | insert_mem_bar_volatile(Op_MemBarVolatile, Compile::AliasIdxBot, store); |
duke@435 | 267 | } |
duke@435 | 268 | |
duke@435 | 269 | // Finally, place alias-index-specific membars for each volatile index |
duke@435 | 270 | // that isn't the adr_idx membar. Typically there's only 1 or 2. |
duke@435 | 271 | for( int i = Compile::AliasIdxRaw; i < C->num_alias_types(); i++ ) { |
duke@435 | 272 | if (i != adr_idx && C->alias_type(i)->is_volatile()) { |
kvn@1535 | 273 | insert_mem_bar_volatile(Op_MemBarVolatile, i, store); |
duke@435 | 274 | } |
duke@435 | 275 | } |
duke@435 | 276 | } |
duke@435 | 277 | |
duke@435 | 278 | // If the field is final, the rules of Java say we are in <init> or <clinit>. |
duke@435 | 279 | // Note the presence of writes to final non-static fields, so that we |
duke@435 | 280 | // can insert a memory barrier later on to keep the writes from floating |
duke@435 | 281 | // out of the constructor. |
duke@435 | 282 | if (is_field && field->is_final()) { |
duke@435 | 283 | set_wrote_final(true); |
duke@435 | 284 | } |
duke@435 | 285 | } |
duke@435 | 286 | |
duke@435 | 287 | |
jrose@1424 | 288 | bool Parse::push_constant(ciConstant constant, bool require_constant) { |
duke@435 | 289 | switch (constant.basic_type()) { |
duke@435 | 290 | case T_BOOLEAN: push( intcon(constant.as_boolean()) ); break; |
duke@435 | 291 | case T_INT: push( intcon(constant.as_int()) ); break; |
duke@435 | 292 | case T_CHAR: push( intcon(constant.as_char()) ); break; |
duke@435 | 293 | case T_BYTE: push( intcon(constant.as_byte()) ); break; |
duke@435 | 294 | case T_SHORT: push( intcon(constant.as_short()) ); break; |
duke@435 | 295 | case T_FLOAT: push( makecon(TypeF::make(constant.as_float())) ); break; |
duke@435 | 296 | case T_DOUBLE: push_pair( makecon(TypeD::make(constant.as_double())) ); break; |
duke@435 | 297 | case T_LONG: push_pair( longcon(constant.as_long()) ); break; |
duke@435 | 298 | case T_ARRAY: |
duke@435 | 299 | case T_OBJECT: { |
jrose@1424 | 300 | // cases: |
jrose@1424 | 301 | // can_be_constant = (oop not scavengable || ScavengeRootsInCode != 0) |
jrose@1424 | 302 | // should_be_constant = (oop not scavengable || ScavengeRootsInCode >= 2) |
jrose@1424 | 303 | // An oop is not scavengable if it is in the perm gen. |
duke@435 | 304 | ciObject* oop_constant = constant.as_object(); |
duke@435 | 305 | if (oop_constant->is_null_object()) { |
duke@435 | 306 | push( zerocon(T_OBJECT) ); |
duke@435 | 307 | break; |
jrose@1424 | 308 | } else if (require_constant || oop_constant->should_be_constant()) { |
jrose@1424 | 309 | push( makecon(TypeOopPtr::make_from_constant(oop_constant, require_constant)) ); |
duke@435 | 310 | break; |
duke@435 | 311 | } else { |
duke@435 | 312 | // we cannot inline the oop, but we can use it later to narrow a type |
duke@435 | 313 | return false; |
duke@435 | 314 | } |
duke@435 | 315 | } |
duke@435 | 316 | case T_ILLEGAL: { |
duke@435 | 317 | // Invalid ciConstant returned due to OutOfMemoryError in the CI |
duke@435 | 318 | assert(C->env()->failing(), "otherwise should not see this"); |
duke@435 | 319 | // These always occur because of object types; we are going to |
duke@435 | 320 | // bail out anyway, so make the stack depths match up |
duke@435 | 321 | push( zerocon(T_OBJECT) ); |
duke@435 | 322 | return false; |
duke@435 | 323 | } |
duke@435 | 324 | default: |
duke@435 | 325 | ShouldNotReachHere(); |
duke@435 | 326 | return false; |
duke@435 | 327 | } |
duke@435 | 328 | |
duke@435 | 329 | // success |
duke@435 | 330 | return true; |
duke@435 | 331 | } |
duke@435 | 332 | |
duke@435 | 333 | |
duke@435 | 334 | |
duke@435 | 335 | //============================================================================= |
duke@435 | 336 | void Parse::do_anewarray() { |
duke@435 | 337 | bool will_link; |
duke@435 | 338 | ciKlass* klass = iter().get_klass(will_link); |
duke@435 | 339 | |
duke@435 | 340 | // Uncommon Trap when class that array contains is not loaded |
duke@435 | 341 | // we need the loaded class for the rest of graph; do not |
duke@435 | 342 | // initialize the container class (see Java spec)!!! |
duke@435 | 343 | assert(will_link, "anewarray: typeflow responsibility"); |
duke@435 | 344 | |
duke@435 | 345 | ciObjArrayKlass* array_klass = ciObjArrayKlass::make(klass); |
duke@435 | 346 | // Check that array_klass object is loaded |
duke@435 | 347 | if (!array_klass->is_loaded()) { |
duke@435 | 348 | // Generate uncommon_trap for unloaded array_class |
duke@435 | 349 | uncommon_trap(Deoptimization::Reason_unloaded, |
duke@435 | 350 | Deoptimization::Action_reinterpret, |
duke@435 | 351 | array_klass); |
duke@435 | 352 | return; |
duke@435 | 353 | } |
duke@435 | 354 | |
duke@435 | 355 | kill_dead_locals(); |
duke@435 | 356 | |
duke@435 | 357 | const TypeKlassPtr* array_klass_type = TypeKlassPtr::make(array_klass); |
duke@435 | 358 | Node* count_val = pop(); |
cfang@1165 | 359 | Node* obj = new_array(makecon(array_klass_type), count_val, 1); |
duke@435 | 360 | push(obj); |
duke@435 | 361 | } |
duke@435 | 362 | |
duke@435 | 363 | |
duke@435 | 364 | void Parse::do_newarray(BasicType elem_type) { |
duke@435 | 365 | kill_dead_locals(); |
duke@435 | 366 | |
duke@435 | 367 | Node* count_val = pop(); |
duke@435 | 368 | const TypeKlassPtr* array_klass = TypeKlassPtr::make(ciTypeArrayKlass::make(elem_type)); |
cfang@1165 | 369 | Node* obj = new_array(makecon(array_klass), count_val, 1); |
duke@435 | 370 | // Push resultant oop onto stack |
duke@435 | 371 | push(obj); |
duke@435 | 372 | } |
duke@435 | 373 | |
duke@435 | 374 | // Expand simple expressions like new int[3][5] and new Object[2][nonConLen]. |
duke@435 | 375 | // Also handle the degenerate 1-dimensional case of anewarray. |
cfang@1165 | 376 | Node* Parse::expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions, int nargs) { |
duke@435 | 377 | Node* length = lengths[0]; |
duke@435 | 378 | assert(length != NULL, ""); |
cfang@1165 | 379 | Node* array = new_array(makecon(TypeKlassPtr::make(array_klass)), length, nargs); |
duke@435 | 380 | if (ndimensions > 1) { |
duke@435 | 381 | jint length_con = find_int_con(length, -1); |
duke@435 | 382 | guarantee(length_con >= 0, "non-constant multianewarray"); |
duke@435 | 383 | ciArrayKlass* array_klass_1 = array_klass->as_obj_array_klass()->element_klass()->as_array_klass(); |
duke@435 | 384 | const TypePtr* adr_type = TypeAryPtr::OOPS; |
never@1262 | 385 | const TypeOopPtr* elemtype = _gvn.type(array)->is_aryptr()->elem()->make_oopptr(); |
duke@435 | 386 | const intptr_t header = arrayOopDesc::base_offset_in_bytes(T_OBJECT); |
duke@435 | 387 | for (jint i = 0; i < length_con; i++) { |
cfang@1165 | 388 | Node* elem = expand_multianewarray(array_klass_1, &lengths[1], ndimensions-1, nargs); |
coleenp@548 | 389 | intptr_t offset = header + ((intptr_t)i << LogBytesPerHeapOop); |
duke@435 | 390 | Node* eaddr = basic_plus_adr(array, offset); |
duke@435 | 391 | store_oop_to_array(control(), array, eaddr, adr_type, elem, elemtype, T_OBJECT); |
duke@435 | 392 | } |
duke@435 | 393 | } |
duke@435 | 394 | return array; |
duke@435 | 395 | } |
duke@435 | 396 | |
duke@435 | 397 | void Parse::do_multianewarray() { |
duke@435 | 398 | int ndimensions = iter().get_dimensions(); |
duke@435 | 399 | |
duke@435 | 400 | // the m-dimensional array |
duke@435 | 401 | bool will_link; |
duke@435 | 402 | ciArrayKlass* array_klass = iter().get_klass(will_link)->as_array_klass(); |
duke@435 | 403 | assert(will_link, "multianewarray: typeflow responsibility"); |
duke@435 | 404 | |
duke@435 | 405 | // Note: Array classes are always initialized; no is_initialized check. |
duke@435 | 406 | |
duke@435 | 407 | enum { MAX_DIMENSION = 5 }; |
duke@435 | 408 | if (ndimensions > MAX_DIMENSION || ndimensions <= 0) { |
duke@435 | 409 | uncommon_trap(Deoptimization::Reason_unhandled, |
duke@435 | 410 | Deoptimization::Action_none); |
duke@435 | 411 | return; |
duke@435 | 412 | } |
duke@435 | 413 | |
duke@435 | 414 | kill_dead_locals(); |
duke@435 | 415 | |
duke@435 | 416 | // get the lengths from the stack (first dimension is on top) |
duke@435 | 417 | Node* length[MAX_DIMENSION+1]; |
duke@435 | 418 | length[ndimensions] = NULL; // terminating null for make_runtime_call |
duke@435 | 419 | int j; |
duke@435 | 420 | for (j = ndimensions-1; j >= 0 ; j--) length[j] = pop(); |
duke@435 | 421 | |
duke@435 | 422 | // The original expression was of this form: new T[length0][length1]... |
duke@435 | 423 | // It is often the case that the lengths are small (except the last). |
duke@435 | 424 | // If that happens, use the fast 1-d creator a constant number of times. |
duke@435 | 425 | const jint expand_limit = MIN2((juint)MultiArrayExpandLimit, (juint)100); |
duke@435 | 426 | jint expand_count = 1; // count of allocations in the expansion |
duke@435 | 427 | jint expand_fanout = 1; // running total fanout |
duke@435 | 428 | for (j = 0; j < ndimensions-1; j++) { |
duke@435 | 429 | jint dim_con = find_int_con(length[j], -1); |
duke@435 | 430 | expand_fanout *= dim_con; |
duke@435 | 431 | expand_count += expand_fanout; // count the level-J sub-arrays |
rasbold@541 | 432 | if (dim_con <= 0 |
duke@435 | 433 | || dim_con > expand_limit |
duke@435 | 434 | || expand_count > expand_limit) { |
duke@435 | 435 | expand_count = 0; |
duke@435 | 436 | break; |
duke@435 | 437 | } |
duke@435 | 438 | } |
duke@435 | 439 | |
duke@435 | 440 | // Can use multianewarray instead of [a]newarray if only one dimension, |
duke@435 | 441 | // or if all non-final dimensions are small constants. |
kvn@1687 | 442 | if (ndimensions == 1 || (1 <= expand_count && expand_count <= expand_limit)) { |
kvn@1687 | 443 | Node* obj = NULL; |
kvn@1687 | 444 | // Set the original stack and the reexecute bit for the interpreter |
kvn@1687 | 445 | // to reexecute the multianewarray bytecode if deoptimization happens. |
kvn@1687 | 446 | // Do it unconditionally even for one dimension multianewarray. |
kvn@1687 | 447 | // Note: the reexecute bit will be set in GraphKit::add_safepoint_edges() |
kvn@1687 | 448 | // when AllocateArray node for newarray is created. |
kvn@1687 | 449 | { PreserveReexecuteState preexecs(this); |
kvn@1687 | 450 | _sp += ndimensions; |
kvn@1687 | 451 | // Pass 0 as nargs since uncommon trap code does not need to restore stack. |
kvn@1687 | 452 | obj = expand_multianewarray(array_klass, &length[0], ndimensions, 0); |
kvn@1687 | 453 | } //original reexecute and sp are set back here |
duke@435 | 454 | push(obj); |
duke@435 | 455 | return; |
duke@435 | 456 | } |
duke@435 | 457 | |
duke@435 | 458 | address fun = NULL; |
duke@435 | 459 | switch (ndimensions) { |
duke@435 | 460 | //case 1: Actually, there is no case 1. It's handled by new_array. |
duke@435 | 461 | case 2: fun = OptoRuntime::multianewarray2_Java(); break; |
duke@435 | 462 | case 3: fun = OptoRuntime::multianewarray3_Java(); break; |
duke@435 | 463 | case 4: fun = OptoRuntime::multianewarray4_Java(); break; |
duke@435 | 464 | case 5: fun = OptoRuntime::multianewarray5_Java(); break; |
duke@435 | 465 | default: ShouldNotReachHere(); |
duke@435 | 466 | }; |
duke@435 | 467 | |
duke@435 | 468 | Node* c = make_runtime_call(RC_NO_LEAF | RC_NO_IO, |
duke@435 | 469 | OptoRuntime::multianewarray_Type(ndimensions), |
duke@435 | 470 | fun, NULL, TypeRawPtr::BOTTOM, |
duke@435 | 471 | makecon(TypeKlassPtr::make(array_klass)), |
duke@435 | 472 | length[0], length[1], length[2], |
duke@435 | 473 | length[3], length[4]); |
duke@435 | 474 | Node* res = _gvn.transform(new (C, 1) ProjNode(c, TypeFunc::Parms)); |
duke@435 | 475 | |
duke@435 | 476 | const Type* type = TypeOopPtr::make_from_klass_raw(array_klass); |
duke@435 | 477 | |
duke@435 | 478 | // Improve the type: We know it's not null, exact, and of a given length. |
duke@435 | 479 | type = type->is_ptr()->cast_to_ptr_type(TypePtr::NotNull); |
duke@435 | 480 | type = type->is_aryptr()->cast_to_exactness(true); |
duke@435 | 481 | |
duke@435 | 482 | const TypeInt* ltype = _gvn.find_int_type(length[0]); |
duke@435 | 483 | if (ltype != NULL) |
duke@435 | 484 | type = type->is_aryptr()->cast_to_size(ltype); |
duke@435 | 485 | |
duke@435 | 486 | // We cannot sharpen the nested sub-arrays, since the top level is mutable. |
duke@435 | 487 | |
duke@435 | 488 | Node* cast = _gvn.transform( new (C, 2) CheckCastPPNode(control(), res, type) ); |
duke@435 | 489 | push(cast); |
duke@435 | 490 | |
duke@435 | 491 | // Possible improvements: |
duke@435 | 492 | // - Make a fast path for small multi-arrays. (W/ implicit init. loops.) |
duke@435 | 493 | // - Issue CastII against length[*] values, to TypeInt::POS. |
duke@435 | 494 | } |