/*

 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 *

 */

#include "precompiled.hpp"

#include "classfile/symbolTable.hpp"

#include "classfile/systemDictionary.hpp"

#include "classfile/vmSymbols.hpp"

#include "gc_implementation/shared/markSweep.inline.hpp"

#include "gc_interface/collectedHeap.inline.hpp"

#include "memory/genOopClosures.inline.hpp"

#include "memory/metadataFactory.hpp"

#include "memory/resourceArea.hpp"

#include "memory/universe.inline.hpp"

#include "oops/instanceKlass.hpp"

#include "oops/klass.inline.hpp"

#include "oops/objArrayKlass.hpp"

#include "oops/objArrayKlass.inline.hpp"

#include "oops/objArrayOop.hpp"

#include "oops/oop.inline.hpp"

#include "oops/oop.inline2.hpp"

#include "oops/symbol.hpp"

#include "runtime/handles.inline.hpp"

#include "runtime/mutexLocker.hpp"

#include "utilities/copy.hpp"

#ifndef SERIALGC

#include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp"

#include "gc_implementation/g1/g1CollectedHeap.inline.hpp"

#include "gc_implementation/g1/g1OopClosures.inline.hpp"

#include "gc_implementation/g1/g1RemSet.inline.hpp"

#include "gc_implementation/g1/heapRegionSeq.inline.hpp"

#include "gc_implementation/parNew/parOopClosures.inline.hpp"

#include "gc_implementation/parallelScavenge/psCompactionManager.hpp"

#include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"

#include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"

#include "oops/oop.pcgc.inline.hpp"

#endif

      "array klasses must be same size as InstanceKlass");

}

                                                int n, KlassHandle element_klass, TRAPS) {

  // Eagerly allocate the direct array supertype.

  KlassHandle super_klass = KlassHandle();

  if (!Universe::is_bootstrapping() || SystemDictionary::Object_klass_loaded()) {

    KlassHandle element_super (THREAD, element_klass->super());

    if (element_super.not_null()) {

      // The element type has a direct super.  E.g., String[] has direct super of Object[].

      super_klass = KlassHandle(THREAD, element_super->array_klass_or_null());

      bool supers_exist = super_klass.not_null();

      // Also, see if the element has secondary supertypes.

      // We need an array type for each.

      Array<Klass*>* element_supers = element_klass->secondary_supers();

      for( int i = element_supers->length()-1; i >= 0; i-- ) {

        Klass* elem_super = element_supers->at(i);

        if (Klass::cast(elem_super)->array_klass_or_null() == NULL) {

          supers_exist = false;

          break;

        }

      }

      if (!supers_exist) {

        // Oops.  Not allocated yet.  Back out, allocate it, and retry.

#ifndef PRODUCT

        if (WizardMode) {

          tty->print_cr("Must retry array klass creation for depth %d",n);

        }

#endif

        KlassHandle ek;

        {

          MutexUnlocker mu(MultiArray_lock);

          MutexUnlocker mc(Compile_lock);   // for vtables

          Klass* sk = element_super->array_klass(CHECK_0);

          super_klass = KlassHandle(THREAD, sk);

          for( int i = element_supers->length()-1; i >= 0; i-- ) {

            KlassHandle elem_super (THREAD, element_supers->at(i));

            elem_super->array_klass(CHECK_0);

          }

          // Now retry from the beginning

          Klass* klass_oop = element_klass->array_klass(n, CHECK_0);

          // Create a handle because the enclosing brace, when locking

          // can cause a gc.  Better to have this function return a Handle.

          ek = KlassHandle(THREAD, klass_oop);

        }  // re-lock

        return ek();

      }

    } else {

      // The element type is already Object.  Object[] has direct super of Object.

      super_klass = KlassHandle(THREAD, SystemDictionary::Object_klass());

    }

  }

  // Create type name for klass.

  Symbol* name = NULL;

  if (!element_klass->oop_is_instance() ||

      (name = InstanceKlass::cast(element_klass())->array_name()) == NULL) {

    ResourceMark rm(THREAD);

    char *name_str = element_klass->name()->as_C_string();

    int len = element_klass->name()->utf8_length();

    char *new_str = NEW_RESOURCE_ARRAY(char, len + 4);

    int idx = 0;

    new_str[idx++] = '[';

    if (element_klass->oop_is_instance()) { // it could be an array or simple type

      new_str[idx++] = 'L';

    }

    memcpy(&new_str[idx], name_str, len * sizeof(char));

    idx += len;

    if (element_klass->oop_is_instance()) {

      new_str[idx++] = ';';

    }

    new_str[idx++] = '\0';

    name = SymbolTable::new_permanent_symbol(new_str, CHECK_0);

    if (element_klass->oop_is_instance()) {

      InstanceKlass* ik = InstanceKlass::cast(element_klass());

      ik->set_array_name(name);

    }

  }

  // Initialize instance variables

  // Add all classes to our internal class loader list here,

  // including classes in the bootstrap (NULL) class loader.

  // GC walks these as strong roots.

  loader_data->add_class(oak);

  // Call complete_create_array_klass after all instance variables has been initialized.

  return oak;

}

  this->set_dimension(n);

  this->set_element_klass(element_klass());

  // decrement refcount because object arrays are not explicitly freed.  The

  // InstanceKlass array_name() keeps the name counted while the klass is

  // loaded.

  name->decrement_refcount();

  Klass* bk;

  if (element_klass->oop_is_objArray()) {

  } else {

    bk = element_klass();

  }

  assert(bk != NULL && (Klass::cast(bk)->oop_is_instance() || Klass::cast(bk)->oop_is_typeArray()), "invalid bottom klass");

  this->set_bottom_klass(bk);

  this->set_class_loader_data(bk->class_loader_data());

  this->set_layout_helper(array_layout_helper(T_OBJECT));

  assert(this->oop_is_array(), "sanity");

  assert(this->oop_is_objArray(), "sanity");

}

  assert(obj->is_objArray(), "must be object array");

  return objArrayOop(obj)->object_size();

}

  if (length >= 0) {

    if (length <= arrayOopDesc::max_array_length(T_OBJECT)) {

      int size = objArrayOopDesc::object_size(length);

      KlassHandle h_k(THREAD, this);

      return (objArrayOop)CollectedHeap::array_allocate(h_k, size, length, CHECK_NULL);

    } else {

      report_java_out_of_memory("Requested array size exceeds VM limit");

      JvmtiExport::post_array_size_exhausted();

      THROW_OOP_0(Universe::out_of_memory_error_array_size());

    }

  } else {

    THROW_0(vmSymbols::java_lang_NegativeArraySizeException());

  }

}

static int multi_alloc_counter = 0;

  int length = *sizes;

  // Call to lower_dimension uses this pointer, so most be called before a

  // possible GC

  KlassHandle h_lower_dimension(THREAD, lower_dimension());

  // If length < 0 allocate will throw an exception.

  objArrayOop array = allocate(length, CHECK_NULL);

  objArrayHandle h_array (THREAD, array);

  if (rank > 1) {

    if (length != 0) {

      for (int index = 0; index < length; index++) {

        oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);

        h_array->obj_at_put(index, sub_array);

      }

    } else {

      // Since this array dimension has zero length, nothing will be

      // allocated, however the lower dimension values must be checked

      // for illegal values.

      for (int i = 0; i < rank - 1; ++i) {

        sizes += 1;

        if (*sizes < 0) {

          THROW_0(vmSymbols::java_lang_NegativeArraySizeException());

        }

      }

    }

  }

  return h_array();

}

// Either oop or narrowOop depending on UseCompressedOops.

                               arrayOop d, T* dst, int length, TRAPS) {

  BarrierSet* bs = Universe::heap()->barrier_set();

  // For performance reasons, we assume we are that the write barrier we

  // are using has optimized modes for arrays of references.  At least one

  // of the asserts below will fail if this is not the case.

  assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");

  assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well.");

  if (s == d) {

    // since source and destination are equal we do not need conversion checks.

    assert(length > 0, "sanity check");

    bs->write_ref_array_pre(dst, length);

    Copy::conjoint_oops_atomic(src, dst, length);

  } else {

    // We have to make sure all elements conform to the destination array

    if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) {

      // elements are guaranteed to be subtypes, so no check necessary

      bs->write_ref_array_pre(dst, length);

      Copy::conjoint_oops_atomic(src, dst, length);

    } else {

      // slow case: need individual subtype checks

      // note: don't use obj_at_put below because it includes a redundant store check

      T* from = src;

      T* end = from + length;

      for (T* p = dst; from < end; from++, p++) {

        // XXX this is going to be slow.

        T element = *from;

        // even slower now

        bool element_is_null = oopDesc::is_null(element);

        oop new_val = element_is_null ? oop(NULL)

                                      : oopDesc::decode_heap_oop_not_null(element);

        if (element_is_null ||

            Klass::cast((new_val->klass()))->is_subtype_of(bound)) {

          bs->write_ref_field_pre(p, new_val);

          *p = *from;

        } else {

          // We must do a barrier to cover the partial copy.

          const size_t pd = pointer_delta(p, dst, (size_t)heapOopSize);

          // pointer delta is scaled to number of elements (length field in

          // objArrayOop) which we assume is 32 bit.

          assert(pd == (size_t)(int)pd, "length field overflow");

          bs->write_ref_array((HeapWord*)dst, pd);

          THROW(vmSymbols::java_lang_ArrayStoreException());

          return;

        }

      }

    }

  }

  bs->write_ref_array((HeapWord*)dst, length);

}

                               int dst_pos, int length, TRAPS) {

  assert(s->is_objArray(), "must be obj array");

  if (!d->is_objArray()) {

    THROW(vmSymbols::java_lang_ArrayStoreException());

  }

  // Check is all offsets and lengths are non negative

  if (src_pos < 0 || dst_pos < 0 || length < 0) {

    THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());

  }

  // Check if the ranges are valid

  if  ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length())

     || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) {

    THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException());

  }

  // Special case. Boundary cases must be checked first

  // This allows the following call: copy_array(s, s.length(), d.length(), 0).

  // This is correct, since the position is supposed to be an 'in between point', i.e., s.length(),

  // points to the right of the last element.

  if (length==0) {

    return;

  }

  if (UseCompressedOops) {

    narrowOop* const src = objArrayOop(s)->obj_at_addr<narrowOop>(src_pos);

    narrowOop* const dst = objArrayOop(d)->obj_at_addr<narrowOop>(dst_pos);

    do_copy<narrowOop>(s, src, d, dst, length, CHECK);

  } else {

    oop* const src = objArrayOop(s)->obj_at_addr<oop>(src_pos);

    oop* const dst = objArrayOop(d)->obj_at_addr<oop>(dst_pos);

    do_copy<oop> (s, src, d, dst, length, CHECK);

  }

}

  assert(dimension() <= n, "check order of chain");

  int dim = dimension();

  if (dim == n) return this;

  if (higher_dimension() == NULL) {

    if (or_null)  return NULL;

    ResourceMark rm;

    JavaThread *jt = (JavaThread *)THREAD;

    {

      MutexLocker mc(Compile_lock, THREAD);   // for vtables

      // Ensure atomic creation of higher dimensions

      MutexLocker mu(MultiArray_lock, THREAD);

      // Check if another thread beat us

      if (higher_dimension() == NULL) {

        // Create multi-dim klass object and link them together

        Klass* k =

        ak->set_lower_dimension(this);

        OrderAccess::storestore();

        set_higher_dimension(ak);

      }

    }

  } else {

    CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());

  }

  if (or_null) {

    return ak->array_klass_or_null(n);

  }

  return ak->array_klass(n, CHECK_NULL);

}

  return array_klass_impl(or_null, dimension() +  1, CHECK_NULL);

}

  if (!bottom_klass()->can_be_primary_super())

    // array of interfaces

    return false;

  else

    return Klass::can_be_primary_super_slow();

}

  // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };

  Array<Klass*>* elem_supers = Klass::cast(element_klass())->secondary_supers();

  int num_elem_supers = elem_supers == NULL ? 0 : elem_supers->length();

  int num_secondaries = num_extra_slots + 2 + num_elem_supers;

  if (num_secondaries == 2) {

    // Must share this for correct bootstrapping!

    set_secondary_supers(Universe::the_array_interfaces_array());

    return NULL;

  } else {

    GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2);

    secondaries->push(SystemDictionary::Cloneable_klass());

    secondaries->push(SystemDictionary::Serializable_klass());

    for (int i = 0; i < num_elem_supers; i++) {

      Klass* elem_super = (Klass*) elem_supers->at(i);

      Klass* array_super = elem_super->array_klass_or_null();

      assert(array_super != NULL, "must already have been created");

      secondaries->push(array_super);

    }

    return secondaries;

  }

}

  if (!k->oop_is_objArray())

  return element_klass()->is_subtype_of(oak->element_klass());

}

}

#define ObjArrayKlass_SPECIALIZED_OOP_ITERATE(T, a, p, do_oop) \

{                                   \

  T* p         = (T*)(a)->base();   \

  T* const end = p + (a)->length(); \

  while (p < end) {                 \

    do_oop;                         \

    p++;                            \

  }                                 \

}

#define ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(T, a, p, low, high, do_oop) \

{                                   \

  T* const l = (T*)(low);           \

  T* const h = (T*)(high);          \

  T* p       = (T*)(a)->base();     \

  T* end     = p + (a)->length();   \

  if (p < l) p = l;                 \

  if (end > h) end = h;             \

  while (p < end) {                 \

    do_oop;                         \

    ++p;                            \

  }                                 \

}

#define ObjArrayKlass_OOP_ITERATE(a, p, do_oop)      \

  if (UseCompressedOops) {                           \

    ObjArrayKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \

      a, p, do_oop)                                  \

  } else {                                           \

    ObjArrayKlass_SPECIALIZED_OOP_ITERATE(oop,       \

      a, p, do_oop)                                  \

  }

#define ObjArrayKlass_BOUNDED_OOP_ITERATE(a, p, low, high, do_oop) \

  if (UseCompressedOops) {                                   \

    ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \

      a, p, low, high, do_oop)                               \

  } else {                                                   \

    ObjArrayKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop,       \

      a, p, low, high, do_oop)                               \

  }

  assert (obj->is_array(), "obj must be array");

  MarkSweep::follow_klass(obj->klass());

  if (UseCompressedOops) {

    objarray_follow_contents<narrowOop>(obj, 0);

  } else {

    objarray_follow_contents<oop>(obj, 0);

  }

}

#ifndef SERIALGC

                                        oop obj) {

  assert(obj->is_array(), "obj must be array");

  PSParallelCompact::follow_klass(cm, obj->klass());

  if (UseCompressedOops) {

    objarray_follow_contents<narrowOop>(cm, obj, 0);

  } else {

    objarray_follow_contents<oop>(cm, obj, 0);

  }

}

#endif // SERIALGC

#define if_do_metadata_checked(closure, nv_suffix)                    \

  /* Make sure the non-virtual and the virtual versions match. */     \

  assert(closure->do_metadata##nv_suffix() == closure->do_metadata(), \

      "Inconsistency in do_metadata");                                \

  if (closure->do_metadata##nv_suffix())

#define ObjArrayKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix)           \

                                                                                \

                                              OopClosureType* closure) {        \

  SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::oa); \

  assert (obj->is_array(), "obj must be array");                                \

  objArrayOop a = objArrayOop(obj);                                             \

  /* Get size before changing pointers. */                                      \

  /* Don't call size() or oop_size() since that is a virtual call. */           \

  int size = a->object_size();                                                  \