duke@435: /*
drchase@4540:  * Copyright (c) 1998, 2013, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "compiler/compileLog.hpp"
stefank@2314: #include "interpreter/linkResolver.hpp"
stefank@2314: #include "memory/universe.inline.hpp"
stefank@2314: #include "oops/objArrayKlass.hpp"
stefank@2314: #include "opto/addnode.hpp"
stefank@2314: #include "opto/memnode.hpp"
stefank@2314: #include "opto/parse.hpp"
stefank@2314: #include "opto/rootnode.hpp"
stefank@2314: #include "opto/runtime.hpp"
stefank@2314: #include "opto/subnode.hpp"
stefank@2314: #include "runtime/deoptimization.hpp"
stefank@2314: #include "runtime/handles.inline.hpp"
duke@435: 
duke@435: //=============================================================================
duke@435: // Helper methods for _get* and _put* bytecodes
duke@435: //=============================================================================
duke@435: bool Parse::static_field_ok_in_clinit(ciField *field, ciMethod *method) {
duke@435:   // Could be the field_holder's <clinit> method, or <clinit> for a subklass.
duke@435:   // Better to check now than to Deoptimize as soon as we execute
duke@435:   assert( field->is_static(), "Only check if field is static");
duke@435:   // is_being_initialized() is too generous.  It allows access to statics
duke@435:   // by threads that are not running the <clinit> before the <clinit> finishes.
duke@435:   // return field->holder()->is_being_initialized();
duke@435: 
duke@435:   // The following restriction is correct but conservative.
duke@435:   // It is also desirable to allow compilation of methods called from <clinit>
duke@435:   // but this generated code will need to be made safe for execution by
duke@435:   // other threads, or the transition from interpreted to compiled code would
duke@435:   // need to be guarded.
duke@435:   ciInstanceKlass *field_holder = field->holder();
duke@435: 
duke@435:   bool access_OK = false;
duke@435:   if (method->holder()->is_subclass_of(field_holder)) {
duke@435:     if (method->is_static()) {
duke@435:       if (method->name() == ciSymbol::class_initializer_name()) {
duke@435:         // OK to access static fields inside initializer
duke@435:         access_OK = true;
duke@435:       }
duke@435:     } else {
duke@435:       if (method->name() == ciSymbol::object_initializer_name()) {
duke@435:         // It's also OK to access static fields inside a constructor,
duke@435:         // because any thread calling the constructor must first have
duke@435:         // synchronized on the class by executing a '_new' bytecode.
duke@435:         access_OK = true;
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   return access_OK;
duke@435: 
duke@435: }
duke@435: 
duke@435: 
duke@435: void Parse::do_field_access(bool is_get, bool is_field) {
duke@435:   bool will_link;
duke@435:   ciField* field = iter().get_field(will_link);
duke@435:   assert(will_link, "getfield: typeflow responsibility");
duke@435: 
duke@435:   ciInstanceKlass* field_holder = field->holder();
duke@435: 
duke@435:   if (is_field == field->is_static()) {
duke@435:     // Interpreter will throw java_lang_IncompatibleClassChangeError
duke@435:     // Check this before allowing <clinit> methods to access static fields
duke@435:     uncommon_trap(Deoptimization::Reason_unhandled,
duke@435:                   Deoptimization::Action_none);
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   if (!is_field && !field_holder->is_initialized()) {
duke@435:     if (!static_field_ok_in_clinit(field, method())) {
duke@435:       uncommon_trap(Deoptimization::Reason_uninitialized,
duke@435:                     Deoptimization::Action_reinterpret,
duke@435:                     NULL, "!static_field_ok_in_clinit");
duke@435:       return;
duke@435:     }
duke@435:   }
duke@435: 
twisti@3101:   // Deoptimize on putfield writes to call site target field.
twisti@3050:   if (!is_get && field->is_call_site_target()) {
twisti@3050:     uncommon_trap(Deoptimization::Reason_unhandled,
twisti@3050:                   Deoptimization::Action_reinterpret,
twisti@3101:                   NULL, "put to call site target field");
twisti@3050:     return;
twisti@3050:   }
twisti@3050: 
duke@435:   assert(field->will_link(method()->holder(), bc()), "getfield: typeflow responsibility");
duke@435: 
duke@435:   // Note:  We do not check for an unloaded field type here any more.
duke@435: 
duke@435:   // Generate code for the object pointer.
duke@435:   Node* obj;
duke@435:   if (is_field) {
duke@435:     int obj_depth = is_get ? 0 : field->type()->size();
twisti@4313:     obj = null_check(peek(obj_depth));
duke@435:     // Compile-time detect of null-exception?
duke@435:     if (stopped())  return;
duke@435: 
never@2658: #ifdef ASSERT
duke@435:     const TypeInstPtr *tjp = TypeInstPtr::make(TypePtr::NotNull, iter().get_declared_field_holder());
duke@435:     assert(_gvn.type(obj)->higher_equal(tjp), "cast_up is no longer needed");
never@2658: #endif
duke@435: 
duke@435:     if (is_get) {
twisti@4313:       (void) pop();  // pop receiver before getting
never@2658:       do_get_xxx(obj, field, is_field);
duke@435:     } else {
never@2658:       do_put_xxx(obj, field, is_field);
twisti@4313:       (void) pop();  // pop receiver after putting
duke@435:     }
duke@435:   } else {
never@2658:     const TypeInstPtr* tip = TypeInstPtr::make(field_holder->java_mirror());
never@2658:     obj = _gvn.makecon(tip);
duke@435:     if (is_get) {
never@2658:       do_get_xxx(obj, field, is_field);
duke@435:     } else {
never@2658:       do_put_xxx(obj, field, is_field);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
never@2658: void Parse::do_get_xxx(Node* obj, ciField* field, bool is_field) {
duke@435:   // Does this field have a constant value?  If so, just push the value.
twisti@1573:   if (field->is_constant()) {
vlivanov@5658:     // final or stable field
vlivanov@5658:     const Type* stable_type = NULL;
vlivanov@5658:     if (FoldStableValues && field->is_stable()) {
vlivanov@5658:       stable_type = Type::get_const_type(field->type());
vlivanov@5658:       if (field->type()->is_array_klass()) {
vlivanov@5658:         int stable_dimension = field->type()->as_array_klass()->dimension();
vlivanov@5658:         stable_type = stable_type->is_aryptr()->cast_to_stable(true, stable_dimension);
vlivanov@5658:       }
vlivanov@5658:     }
twisti@1573:     if (field->is_static()) {
twisti@1573:       // final static field
kvn@5110:       if (C->eliminate_boxing()) {
kvn@5110:         // The pointers in the autobox arrays are always non-null.
kvn@5110:         ciSymbol* klass_name = field->holder()->name();
kvn@5110:         if (field->name() == ciSymbol::cache_field_name() &&
kvn@5110:             field->holder()->uses_default_loader() &&
kvn@5110:             (klass_name == ciSymbol::java_lang_Character_CharacterCache() ||
kvn@5110:              klass_name == ciSymbol::java_lang_Byte_ByteCache() ||
kvn@5110:              klass_name == ciSymbol::java_lang_Short_ShortCache() ||
kvn@5110:              klass_name == ciSymbol::java_lang_Integer_IntegerCache() ||
kvn@5110:              klass_name == ciSymbol::java_lang_Long_LongCache())) {
kvn@5110:           bool require_const = true;
kvn@5110:           bool autobox_cache = true;
kvn@5110:           if (push_constant(field->constant_value(), require_const, autobox_cache)) {
kvn@5110:             return;
kvn@5110:           }
kvn@5110:         }
kvn@5110:       }
vlivanov@5658:       if (push_constant(field->constant_value(), false, false, stable_type))
twisti@1573:         return;
vlivanov@5658:     } else {
vlivanov@5658:       // final or stable non-static field
twisti@3102:       // Treat final non-static fields of trusted classes (classes in
twisti@3102:       // java.lang.invoke and sun.invoke packages and subpackages) as
twisti@3102:       // compile time constants.
twisti@1573:       if (obj->is_Con()) {
twisti@1573:         const TypeOopPtr* oop_ptr = obj->bottom_type()->isa_oopptr();
twisti@1573:         ciObject* constant_oop = oop_ptr->const_oop();
twisti@1573:         ciConstant constant = field->constant_value_of(constant_oop);
vlivanov@5658:         if (FoldStableValues && field->is_stable() && constant.is_null_or_zero()) {
vlivanov@5658:           // fall through to field load; the field is not yet initialized
vlivanov@5658:         } else {
vlivanov@5658:           if (push_constant(constant, true, false, stable_type))
vlivanov@5658:             return;
vlivanov@5658:         }
twisti@1573:       }
twisti@1573:     }
twisti@1573:   }
duke@435: 
duke@435:   ciType* field_klass = field->type();
duke@435:   bool is_vol = field->is_volatile();
duke@435: 
duke@435:   // Compute address and memory type.
duke@435:   int offset = field->offset_in_bytes();
duke@435:   const TypePtr* adr_type = C->alias_type(field)->adr_type();
duke@435:   Node *adr = basic_plus_adr(obj, obj, offset);
duke@435:   BasicType bt = field->layout_type();
duke@435: 
duke@435:   // Build the resultant type of the load
duke@435:   const Type *type;
duke@435: 
duke@435:   bool must_assert_null = false;
duke@435: 
duke@435:   if( bt == T_OBJECT ) {
duke@435:     if (!field->type()->is_loaded()) {
duke@435:       type = TypeInstPtr::BOTTOM;
duke@435:       must_assert_null = true;
twisti@1573:     } else if (field->is_constant() && field->is_static()) {
duke@435:       // This can happen if the constant oop is non-perm.
duke@435:       ciObject* con = field->constant_value().as_object();
duke@435:       // Do not "join" in the previous type; it doesn't add value,
duke@435:       // and may yield a vacuous result if the field is of interface type.
duke@435:       type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
duke@435:       assert(type != NULL, "field singleton type must be consistent");
duke@435:     } else {
duke@435:       type = TypeOopPtr::make_from_klass(field_klass->as_klass());
duke@435:     }
duke@435:   } else {
duke@435:     type = Type::get_const_basic_type(bt);
duke@435:   }
duke@435:   // Build the load.
duke@435:   Node* ld = make_load(NULL, adr, type, bt, adr_type, is_vol);
duke@435: 
duke@435:   // Adjust Java stack
duke@435:   if (type2size[bt] == 1)
duke@435:     push(ld);
duke@435:   else
duke@435:     push_pair(ld);
duke@435: 
duke@435:   if (must_assert_null) {
duke@435:     // Do not take a trap here.  It's possible that the program
duke@435:     // will never load the field's class, and will happily see
duke@435:     // null values in this field forever.  Don't stumble into a
duke@435:     // trap for such a program, or we might get a long series
duke@435:     // of useless recompilations.  (Or, we might load a class
duke@435:     // which should not be loaded.)  If we ever see a non-null
duke@435:     // value, we will then trap and recompile.  (The trap will
duke@435:     // not need to mention the class index, since the class will
duke@435:     // already have been loaded if we ever see a non-null value.)
duke@435:     // uncommon_trap(iter().get_field_signature_index());
duke@435: #ifndef PRODUCT
duke@435:     if (PrintOpto && (Verbose || WizardMode)) {
duke@435:       method()->print_name(); tty->print_cr(" asserting nullness of field at bci: %d", bci());
duke@435:     }
duke@435: #endif
duke@435:     if (C->log() != NULL) {
duke@435:       C->log()->elem("assert_null reason='field' klass='%d'",
duke@435:                      C->log()->identify(field->type()));
duke@435:     }
duke@435:     // If there is going to be a trap, put it at the next bytecode:
duke@435:     set_bci(iter().next_bci());
twisti@4313:     null_assert(peek());
duke@435:     set_bci(iter().cur_bci()); // put it back
duke@435:   }
duke@435: 
duke@435:   // If reference is volatile, prevent following memory ops from
duke@435:   // floating up past the volatile read.  Also prevents commoning
duke@435:   // another volatile read.
duke@435:   if (field->is_volatile()) {
duke@435:     // Memory barrier includes bogus read of value to force load BEFORE membar
duke@435:     insert_mem_bar(Op_MemBarAcquire, ld);
duke@435:   }
duke@435: }
duke@435: 
never@2658: void Parse::do_put_xxx(Node* obj, ciField* field, bool is_field) {
duke@435:   bool is_vol = field->is_volatile();
duke@435:   // If reference is volatile, prevent following memory ops from
duke@435:   // floating down past the volatile write.  Also prevents commoning
duke@435:   // another volatile read.
duke@435:   if (is_vol)  insert_mem_bar(Op_MemBarRelease);
duke@435: 
duke@435:   // Compute address and memory type.
duke@435:   int offset = field->offset_in_bytes();
duke@435:   const TypePtr* adr_type = C->alias_type(field)->adr_type();
duke@435:   Node* adr = basic_plus_adr(obj, obj, offset);
duke@435:   BasicType bt = field->layout_type();
duke@435:   // Value to be stored
duke@435:   Node* val = type2size[bt] == 1 ? pop() : pop_pair();
duke@435:   // Round doubles before storing
duke@435:   if (bt == T_DOUBLE)  val = dstore_rounding(val);
duke@435: 
duke@435:   // Store the value.
duke@435:   Node* store;
duke@435:   if (bt == T_OBJECT) {
never@1260:     const TypeOopPtr* field_type;
duke@435:     if (!field->type()->is_loaded()) {
duke@435:       field_type = TypeInstPtr::BOTTOM;
duke@435:     } else {
duke@435:       field_type = TypeOopPtr::make_from_klass(field->type()->as_klass());
duke@435:     }
duke@435:     store = store_oop_to_object( control(), obj, adr, adr_type, val, field_type, bt);
duke@435:   } else {
duke@435:     store = store_to_memory( control(), adr, val, bt, adr_type, is_vol );
duke@435:   }
duke@435: 
duke@435:   // If reference is volatile, prevent following volatiles ops from
duke@435:   // floating up before the volatile write.
duke@435:   if (is_vol) {
kvn@5437:     insert_mem_bar(Op_MemBarVolatile); // Use fat membar
duke@435:   }
duke@435: 
duke@435:   // If the field is final, the rules of Java say we are in <init> or <clinit>.
duke@435:   // Note the presence of writes to final non-static fields, so that we
duke@435:   // can insert a memory barrier later on to keep the writes from floating
duke@435:   // out of the constructor.
vlivanov@5658:   // Any method can write a @Stable field; insert memory barriers after those also.
vlivanov@5658:   if (is_field && (field->is_final() || field->is_stable())) {
duke@435:     set_wrote_final(true);
kvn@5110:     // Preserve allocation ptr to create precedent edge to it in membar
kvn@5110:     // generated on exit from constructor.
kvn@5110:     if (C->eliminate_boxing() &&
kvn@5110:         adr_type->isa_oopptr() && adr_type->is_oopptr()->is_ptr_to_boxed_value() &&
kvn@5110:         AllocateNode::Ideal_allocation(obj, &_gvn) != NULL) {
kvn@5110:       set_alloc_with_final(obj);
kvn@5110:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
vlivanov@5658: 
vlivanov@5658: bool Parse::push_constant(ciConstant constant, bool require_constant, bool is_autobox_cache, const Type* stable_type) {
vlivanov@5658:   const Type* con_type = Type::make_from_constant(constant, require_constant, is_autobox_cache);
duke@435:   switch (constant.basic_type()) {
duke@435:   case T_ARRAY:
vlivanov@5658:   case T_OBJECT:
jrose@1424:     // cases:
jrose@1424:     //   can_be_constant    = (oop not scavengable || ScavengeRootsInCode != 0)
jrose@1424:     //   should_be_constant = (oop not scavengable || ScavengeRootsInCode >= 2)
jrose@1424:     // An oop is not scavengable if it is in the perm gen.
vlivanov@5658:     if (stable_type != NULL && con_type != NULL && con_type->isa_oopptr())
roland@6313:       con_type = con_type->join_speculative(stable_type);
vlivanov@5658:     break;
vlivanov@5658: 
vlivanov@5658:   case T_ILLEGAL:
duke@435:     // Invalid ciConstant returned due to OutOfMemoryError in the CI
duke@435:     assert(C->env()->failing(), "otherwise should not see this");
duke@435:     // These always occur because of object types; we are going to
duke@435:     // bail out anyway, so make the stack depths match up
duke@435:     push( zerocon(T_OBJECT) );
duke@435:     return false;
duke@435:   }
vlivanov@5658: 
vlivanov@5658:   if (con_type == NULL)
vlivanov@5658:     // we cannot inline the oop, but we can use it later to narrow a type
duke@435:     return false;
duke@435: 
vlivanov@5658:   push_node(constant.basic_type(), makecon(con_type));
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: 
duke@435: //=============================================================================
duke@435: void Parse::do_anewarray() {
duke@435:   bool will_link;
duke@435:   ciKlass* klass = iter().get_klass(will_link);
duke@435: 
duke@435:   // Uncommon Trap when class that array contains is not loaded
duke@435:   // we need the loaded class for the rest of graph; do not
duke@435:   // initialize the container class (see Java spec)!!!
duke@435:   assert(will_link, "anewarray: typeflow responsibility");
duke@435: 
duke@435:   ciObjArrayKlass* array_klass = ciObjArrayKlass::make(klass);
duke@435:   // Check that array_klass object is loaded
duke@435:   if (!array_klass->is_loaded()) {
duke@435:     // Generate uncommon_trap for unloaded array_class
duke@435:     uncommon_trap(Deoptimization::Reason_unloaded,
duke@435:                   Deoptimization::Action_reinterpret,
duke@435:                   array_klass);
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   kill_dead_locals();
duke@435: 
duke@435:   const TypeKlassPtr* array_klass_type = TypeKlassPtr::make(array_klass);
duke@435:   Node* count_val = pop();
cfang@1165:   Node* obj = new_array(makecon(array_klass_type), count_val, 1);
duke@435:   push(obj);
duke@435: }
duke@435: 
duke@435: 
duke@435: void Parse::do_newarray(BasicType elem_type) {
duke@435:   kill_dead_locals();
duke@435: 
duke@435:   Node*   count_val = pop();
duke@435:   const TypeKlassPtr* array_klass = TypeKlassPtr::make(ciTypeArrayKlass::make(elem_type));
cfang@1165:   Node*   obj = new_array(makecon(array_klass), count_val, 1);
duke@435:   // Push resultant oop onto stack
duke@435:   push(obj);
duke@435: }
duke@435: 
duke@435: // Expand simple expressions like new int[3][5] and new Object[2][nonConLen].
duke@435: // Also handle the degenerate 1-dimensional case of anewarray.
cfang@1165: Node* Parse::expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions, int nargs) {
duke@435:   Node* length = lengths[0];
duke@435:   assert(length != NULL, "");
cfang@1165:   Node* array = new_array(makecon(TypeKlassPtr::make(array_klass)), length, nargs);
duke@435:   if (ndimensions > 1) {
duke@435:     jint length_con = find_int_con(length, -1);
duke@435:     guarantee(length_con >= 0, "non-constant multianewarray");
duke@435:     ciArrayKlass* array_klass_1 = array_klass->as_obj_array_klass()->element_klass()->as_array_klass();
duke@435:     const TypePtr* adr_type = TypeAryPtr::OOPS;
never@1262:     const TypeOopPtr*    elemtype = _gvn.type(array)->is_aryptr()->elem()->make_oopptr();
duke@435:     const intptr_t header   = arrayOopDesc::base_offset_in_bytes(T_OBJECT);
duke@435:     for (jint i = 0; i < length_con; i++) {
cfang@1165:       Node*    elem   = expand_multianewarray(array_klass_1, &lengths[1], ndimensions-1, nargs);
coleenp@548:       intptr_t offset = header + ((intptr_t)i << LogBytesPerHeapOop);
duke@435:       Node*    eaddr  = basic_plus_adr(array, offset);
duke@435:       store_oop_to_array(control(), array, eaddr, adr_type, elem, elemtype, T_OBJECT);
duke@435:     }
duke@435:   }
duke@435:   return array;
duke@435: }
duke@435: 
duke@435: void Parse::do_multianewarray() {
duke@435:   int ndimensions = iter().get_dimensions();
duke@435: 
duke@435:   // the m-dimensional array
duke@435:   bool will_link;
duke@435:   ciArrayKlass* array_klass = iter().get_klass(will_link)->as_array_klass();
duke@435:   assert(will_link, "multianewarray: typeflow responsibility");
duke@435: 
duke@435:   // Note:  Array classes are always initialized; no is_initialized check.
duke@435: 
duke@435:   kill_dead_locals();
duke@435: 
duke@435:   // get the lengths from the stack (first dimension is on top)
iveresov@3002:   Node** length = NEW_RESOURCE_ARRAY(Node*, ndimensions + 1);
duke@435:   length[ndimensions] = NULL;  // terminating null for make_runtime_call
duke@435:   int j;
duke@435:   for (j = ndimensions-1; j >= 0 ; j--) length[j] = pop();
duke@435: 
duke@435:   // The original expression was of this form: new T[length0][length1]...
duke@435:   // It is often the case that the lengths are small (except the last).
duke@435:   // If that happens, use the fast 1-d creator a constant number of times.
duke@435:   const jint expand_limit = MIN2((juint)MultiArrayExpandLimit, (juint)100);
duke@435:   jint expand_count = 1;        // count of allocations in the expansion
duke@435:   jint expand_fanout = 1;       // running total fanout
duke@435:   for (j = 0; j < ndimensions-1; j++) {
duke@435:     jint dim_con = find_int_con(length[j], -1);
duke@435:     expand_fanout *= dim_con;
duke@435:     expand_count  += expand_fanout; // count the level-J sub-arrays
rasbold@541:     if (dim_con <= 0
duke@435:         || dim_con > expand_limit
duke@435:         || expand_count > expand_limit) {
duke@435:       expand_count = 0;
duke@435:       break;
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   // Can use multianewarray instead of [a]newarray if only one dimension,
duke@435:   // or if all non-final dimensions are small constants.
kvn@1687:   if (ndimensions == 1 || (1 <= expand_count && expand_count <= expand_limit)) {
kvn@1687:     Node* obj = NULL;
kvn@1687:     // Set the original stack and the reexecute bit for the interpreter
kvn@1687:     // to reexecute the multianewarray bytecode if deoptimization happens.
kvn@1687:     // Do it unconditionally even for one dimension multianewarray.
kvn@1687:     // Note: the reexecute bit will be set in GraphKit::add_safepoint_edges()
kvn@1687:     // when AllocateArray node for newarray is created.
kvn@1687:     { PreserveReexecuteState preexecs(this);
twisti@4313:       inc_sp(ndimensions);
kvn@1687:       // Pass 0 as nargs since uncommon trap code does not need to restore stack.
kvn@1687:       obj = expand_multianewarray(array_klass, &length[0], ndimensions, 0);
kvn@1687:     } //original reexecute and sp are set back here
duke@435:     push(obj);
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   address fun = NULL;
duke@435:   switch (ndimensions) {
iveresov@3002:   case 1: ShouldNotReachHere(); break;
duke@435:   case 2: fun = OptoRuntime::multianewarray2_Java(); break;
duke@435:   case 3: fun = OptoRuntime::multianewarray3_Java(); break;
duke@435:   case 4: fun = OptoRuntime::multianewarray4_Java(); break;
duke@435:   case 5: fun = OptoRuntime::multianewarray5_Java(); break;
duke@435:   };
iveresov@3002:   Node* c = NULL;
duke@435: 
iveresov@3002:   if (fun != NULL) {
iveresov@3002:     c = make_runtime_call(RC_NO_LEAF | RC_NO_IO,
iveresov@3002:                           OptoRuntime::multianewarray_Type(ndimensions),
iveresov@3002:                           fun, NULL, TypeRawPtr::BOTTOM,
iveresov@3002:                           makecon(TypeKlassPtr::make(array_klass)),
iveresov@3002:                           length[0], length[1], length[2],
drchase@4540:                           (ndimensions > 2) ? length[3] : NULL,
drchase@4540:                           (ndimensions > 3) ? length[4] : NULL);
iveresov@3002:   } else {
iveresov@3002:     // Create a java array for dimension sizes
iveresov@3002:     Node* dims = NULL;
iveresov@3002:     { PreserveReexecuteState preexecs(this);
twisti@4313:       inc_sp(ndimensions);
iveresov@3002:       Node* dims_array_klass = makecon(TypeKlassPtr::make(ciArrayKlass::make(ciType::make(T_INT))));
iveresov@3002:       dims = new_array(dims_array_klass, intcon(ndimensions), 0);
iveresov@3002: 
iveresov@3002:       // Fill-in it with values
iveresov@3002:       for (j = 0; j < ndimensions; j++) {
iveresov@3002:         Node *dims_elem = array_element_address(dims, intcon(j), T_INT);
iveresov@3002:         store_to_memory(control(), dims_elem, length[j], T_INT, TypeAryPtr::INTS);
iveresov@3002:       }
iveresov@3002:     }
iveresov@3002: 
iveresov@3002:     c = make_runtime_call(RC_NO_LEAF | RC_NO_IO,
iveresov@3002:                           OptoRuntime::multianewarrayN_Type(),
iveresov@3002:                           OptoRuntime::multianewarrayN_Java(), NULL, TypeRawPtr::BOTTOM,
iveresov@3002:                           makecon(TypeKlassPtr::make(array_klass)),
iveresov@3002:                           dims);
iveresov@3002:   }
kvn@4364:   make_slow_call_ex(c, env()->Throwable_klass(), false);
iveresov@3002: 
kvn@4115:   Node* res = _gvn.transform(new (C) ProjNode(c, TypeFunc::Parms));
duke@435: 
duke@435:   const Type* type = TypeOopPtr::make_from_klass_raw(array_klass);
duke@435: 
duke@435:   // Improve the type:  We know it's not null, exact, and of a given length.
duke@435:   type = type->is_ptr()->cast_to_ptr_type(TypePtr::NotNull);
duke@435:   type = type->is_aryptr()->cast_to_exactness(true);
duke@435: 
duke@435:   const TypeInt* ltype = _gvn.find_int_type(length[0]);
duke@435:   if (ltype != NULL)
duke@435:     type = type->is_aryptr()->cast_to_size(ltype);
duke@435: 
iveresov@3002:     // We cannot sharpen the nested sub-arrays, since the top level is mutable.
duke@435: 
kvn@4115:   Node* cast = _gvn.transform( new (C) CheckCastPPNode(control(), res, type) );
duke@435:   push(cast);
duke@435: 
duke@435:   // Possible improvements:
duke@435:   // - Make a fast path for small multi-arrays.  (W/ implicit init. loops.)
duke@435:   // - Issue CastII against length[*] values, to TypeInt::POS.
duke@435: }