array.cc revision cbb2d20bea2861f244da2e2318d8c088300a3710
12dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers/*
22dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * Copyright (C) 2011 The Android Open Source Project
32dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers *
42dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * Licensed under the Apache License, Version 2.0 (the "License");
52dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * you may not use this file except in compliance with the License.
62dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * You may obtain a copy of the License at
72dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers *
82dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers *      http://www.apache.org/licenses/LICENSE-2.0
92dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers *
102dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * Unless required by applicable law or agreed to in writing, software
112dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * distributed under the License is distributed on an "AS IS" BASIS,
122dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
132dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * See the License for the specific language governing permissions and
142dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * limitations under the License.
152dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers */
162dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
172dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "array.h"
182dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
192dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "class.h"
202dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "class-inl.h"
2162d6c772205b8859f0ebf7ad105402ec4c3e2e01Ian Rogers#include "common_throws.h"
224f6ad8ab428038129b2d0d6c40b7fd625cca15e1Ian Rogers#include "dex_file-inl.h"
231d54e73444e017d3a65234e0f193846f3e27472bIan Rogers#include "gc/accounting/card_table-inl.h"
242dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "object-inl.h"
252dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "object_array.h"
262dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "object_array-inl.h"
272dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "object_utils.h"
282dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "sirt_ref.h"
292dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "thread.h"
302dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "utils.h"
312dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
322dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogersnamespace art {
332dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogersnamespace mirror {
342dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
352dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// Create a multi-dimensional array of Objects or primitive types.
362dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers//
372dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// We have to generate the names for X[], X[][], X[][][], and so on.  The
382dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// easiest way to deal with that is to create the full name once and then
392dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// subtract pieces off.  Besides, we want to start with the outermost
402dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// piece and work our way in.
412dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// Recursively create an array with multiple dimensions.  Elements may be
422dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// Objects or primitive types.
432dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogersstatic Array* RecursiveCreateMultiArray(Thread* self, Class* array_class, int current_dimension,
44590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier                                        SirtRef<mirror::IntArray>& dimensions)
452dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) {
462dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  int32_t array_length = dimensions->Get(current_dimension);
47cbb2d20bea2861f244da2e2318d8c088300a3710Mathieu Chartier  SirtRef<Array> new_array(self, Array::Alloc<true>(self, array_class, array_length));
482dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  if (UNLIKELY(new_array.get() == NULL)) {
492dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    CHECK(self->IsExceptionPending());
502dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    return NULL;
512dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  }
52590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  if (current_dimension + 1 < dimensions->GetLength()) {
532dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    // Create a new sub-array in every element of the array.
542dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    for (int32_t i = 0; i < array_length; i++) {
552dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers      Array* sub_array = RecursiveCreateMultiArray(self, array_class->GetComponentType(),
562dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers                                                   current_dimension + 1, dimensions);
572dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers      if (UNLIKELY(sub_array == NULL)) {
582dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers        CHECK(self->IsExceptionPending());
592dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers        return NULL;
602dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers      }
612dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers      new_array->AsObjectArray<Array>()->Set(i, sub_array);
622dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    }
632dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  }
642dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  return new_array.get();
652dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers}
662dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
672dd0e2cea360bc9206eb88ecc40d259e796c239dIan RogersArray* Array::CreateMultiArray(Thread* self, Class* element_class, IntArray* dimensions) {
682dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  // Verify dimensions.
692dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  //
702dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  // The caller is responsible for verifying that "dimArray" is non-null
712dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  // and has a length > 0 and <= 255.
722dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  int num_dimensions = dimensions->GetLength();
732dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  DCHECK_GT(num_dimensions, 0);
742dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  DCHECK_LE(num_dimensions, 255);
752dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
762dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  for (int i = 0; i < num_dimensions; i++) {
772dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    int dimension = dimensions->Get(i);
782dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    if (UNLIKELY(dimension < 0)) {
7962d6c772205b8859f0ebf7ad105402ec4c3e2e01Ian Rogers      ThrowNegativeArraySizeException(StringPrintf("Dimension %d: %d", i, dimension).c_str());
802dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers      return NULL;
812dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    }
822dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  }
832dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
842dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  // Generate the full name of the array class.
852dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  std::string descriptor(num_dimensions, '[');
862dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  descriptor += ClassHelper(element_class).GetDescriptor();
872dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
882dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  // Find/generate the array class.
892dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  ClassLinker* class_linker = Runtime::Current()->GetClassLinker();
90590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  SirtRef<mirror::ClassLoader> class_loader(self, element_class->GetClassLoader());
91590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  Class* array_class = class_linker->FindClass(descriptor.c_str(), class_loader);
922dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  if (UNLIKELY(array_class == NULL)) {
932dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    CHECK(self->IsExceptionPending());
942dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    return NULL;
952dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  }
962dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  // create the array
97590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  SirtRef<mirror::IntArray> sirt_dimensions(self, dimensions);
98590fee9e8972f872301c2d16a575d579ee564beeMathieu Chartier  Array* new_array = RecursiveCreateMultiArray(self, array_class, 0, sirt_dimensions);
992dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  if (UNLIKELY(new_array == NULL)) {
1002dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    CHECK(self->IsExceptionPending());
1012dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers    return NULL;
1022dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  }
1032dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  return new_array;
1042dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers}
1052dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
1069897be996580db9de86f880f9ad9d36c66057a52Sebastien Hertzvoid Array::ThrowArrayIndexOutOfBoundsException(int32_t index) const {
10762d6c772205b8859f0ebf7ad105402ec4c3e2e01Ian Rogers  art::ThrowArrayIndexOutOfBoundsException(index, GetLength());
1082dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers}
1092dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
1109897be996580db9de86f880f9ad9d36c66057a52Sebastien Hertzvoid Array::ThrowArrayStoreException(Object* object) const {
11162d6c772205b8859f0ebf7ad105402ec4c3e2e01Ian Rogers  art::ThrowArrayStoreException(object->GetClass(), this->GetClass());
1122dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers}
1132dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
1142dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate<typename T>
1152dd0e2cea360bc9206eb88ecc40d259e796c239dIan RogersPrimitiveArray<T>* PrimitiveArray<T>::Alloc(Thread* self, size_t length) {
1162dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  DCHECK(array_class_ != NULL);
117cbb2d20bea2861f244da2e2318d8c088300a3710Mathieu Chartier  Array* raw_array = Array::Alloc<true>(self, array_class_, length, sizeof(T));
1182dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers  return down_cast<PrimitiveArray<T>*>(raw_array);
1192dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers}
1202dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
1212dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate <typename T> Class* PrimitiveArray<T>::array_class_ = NULL;
1222dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
1232dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// Explicitly instantiate all the primitive array types.
1242dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<uint8_t>;   // BooleanArray
1252dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<int8_t>;    // ByteArray
1262dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<uint16_t>;  // CharArray
1272dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<double>;    // DoubleArray
1282dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<float>;     // FloatArray
1292dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<int32_t>;   // IntArray
1302dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<int64_t>;   // LongArray
1312dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<int16_t>;   // ShortArray
1322dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers
1332dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers}  // namespace mirror
1342dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers}  // namespace art
135