blob: f8a283224c6b630f607bb008b5b2f119f56c67e8 [file] [log] [blame]
Ian Rogers2dd0e2c2013-01-24 12:42:14 -08001/*
2 * Copyright (C) 2011 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#include "array.h"
18
19#include "class.h"
20#include "class-inl.h"
Ian Rogers62d6c772013-02-27 08:32:07 -080021#include "common_throws.h"
Ian Rogers4f6ad8a2013-03-18 15:27:28 -070022#include "dex_file-inl.h"
Ian Rogers1d54e732013-05-02 21:10:01 -070023#include "gc/accounting/card_table-inl.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080024#include "object-inl.h"
25#include "object_array.h"
26#include "object_array-inl.h"
27#include "object_utils.h"
28#include "sirt_ref.h"
29#include "thread.h"
30#include "utils.h"
31
32namespace art {
33namespace mirror {
34
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080035// Create a multi-dimensional array of Objects or primitive types.
36//
37// We have to generate the names for X[], X[][], X[][][], and so on. The
38// easiest way to deal with that is to create the full name once and then
39// subtract pieces off. Besides, we want to start with the outermost
40// piece and work our way in.
41// Recursively create an array with multiple dimensions. Elements may be
42// Objects or primitive types.
43static Array* RecursiveCreateMultiArray(Thread* self, Class* array_class, int current_dimension,
Mathieu Chartier590fee92013-09-13 13:46:47 -070044 SirtRef<mirror::IntArray>& dimensions)
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080045 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) {
46 int32_t array_length = dimensions->Get(current_dimension);
Mathieu Chartier590fee92013-09-13 13:46:47 -070047 SirtRef<Array> new_array(self, Array::Alloc<kMovingCollector, true>(self, array_class,
48 array_length));
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080049 if (UNLIKELY(new_array.get() == NULL)) {
50 CHECK(self->IsExceptionPending());
51 return NULL;
52 }
Mathieu Chartier590fee92013-09-13 13:46:47 -070053 if (current_dimension + 1 < dimensions->GetLength()) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080054 // Create a new sub-array in every element of the array.
55 for (int32_t i = 0; i < array_length; i++) {
56 Array* sub_array = RecursiveCreateMultiArray(self, array_class->GetComponentType(),
57 current_dimension + 1, dimensions);
58 if (UNLIKELY(sub_array == NULL)) {
59 CHECK(self->IsExceptionPending());
60 return NULL;
61 }
62 new_array->AsObjectArray<Array>()->Set(i, sub_array);
63 }
64 }
65 return new_array.get();
66}
67
68Array* Array::CreateMultiArray(Thread* self, Class* element_class, IntArray* dimensions) {
69 // Verify dimensions.
70 //
71 // The caller is responsible for verifying that "dimArray" is non-null
72 // and has a length > 0 and <= 255.
73 int num_dimensions = dimensions->GetLength();
74 DCHECK_GT(num_dimensions, 0);
75 DCHECK_LE(num_dimensions, 255);
76
77 for (int i = 0; i < num_dimensions; i++) {
78 int dimension = dimensions->Get(i);
79 if (UNLIKELY(dimension < 0)) {
Ian Rogers62d6c772013-02-27 08:32:07 -080080 ThrowNegativeArraySizeException(StringPrintf("Dimension %d: %d", i, dimension).c_str());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080081 return NULL;
82 }
83 }
84
85 // Generate the full name of the array class.
86 std::string descriptor(num_dimensions, '[');
87 descriptor += ClassHelper(element_class).GetDescriptor();
88
89 // Find/generate the array class.
90 ClassLinker* class_linker = Runtime::Current()->GetClassLinker();
Mathieu Chartier590fee92013-09-13 13:46:47 -070091 SirtRef<mirror::ClassLoader> class_loader(self, element_class->GetClassLoader());
92 Class* array_class = class_linker->FindClass(descriptor.c_str(), class_loader);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080093 if (UNLIKELY(array_class == NULL)) {
94 CHECK(self->IsExceptionPending());
95 return NULL;
96 }
97 // create the array
Mathieu Chartier590fee92013-09-13 13:46:47 -070098 SirtRef<mirror::IntArray> sirt_dimensions(self, dimensions);
99 Array* new_array = RecursiveCreateMultiArray(self, array_class, 0, sirt_dimensions);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800100 if (UNLIKELY(new_array == NULL)) {
101 CHECK(self->IsExceptionPending());
102 return NULL;
103 }
104 return new_array;
105}
106
Sebastien Hertz9897be92013-06-27 18:24:46 +0200107void Array::ThrowArrayIndexOutOfBoundsException(int32_t index) const {
Ian Rogers62d6c772013-02-27 08:32:07 -0800108 art::ThrowArrayIndexOutOfBoundsException(index, GetLength());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800109}
110
Sebastien Hertz9897be92013-06-27 18:24:46 +0200111void Array::ThrowArrayStoreException(Object* object) const {
Ian Rogers62d6c772013-02-27 08:32:07 -0800112 art::ThrowArrayStoreException(object->GetClass(), this->GetClass());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800113}
114
115template<typename T>
116PrimitiveArray<T>* PrimitiveArray<T>::Alloc(Thread* self, size_t length) {
117 DCHECK(array_class_ != NULL);
Mathieu Chartier590fee92013-09-13 13:46:47 -0700118 Array* raw_array = Array::Alloc<kMovingCollector, true>(self, array_class_, length, sizeof(T));
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800119 return down_cast<PrimitiveArray<T>*>(raw_array);
120}
121
122template <typename T> Class* PrimitiveArray<T>::array_class_ = NULL;
123
124// Explicitly instantiate all the primitive array types.
125template class PrimitiveArray<uint8_t>; // BooleanArray
126template class PrimitiveArray<int8_t>; // ByteArray
127template class PrimitiveArray<uint16_t>; // CharArray
128template class PrimitiveArray<double>; // DoubleArray
129template class PrimitiveArray<float>; // FloatArray
130template class PrimitiveArray<int32_t>; // IntArray
131template class PrimitiveArray<int64_t>; // LongArray
132template class PrimitiveArray<int16_t>; // ShortArray
133
134} // namespace mirror
135} // namespace art