blob: ca0d1f3977286362fba6e70ee535825ebb8edef2 [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 Chartiercbb2d202013-11-14 17:45:16 -080047 SirtRef<Array> new_array(self, Array::Alloc<true>(self, array_class, array_length));
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080048 if (UNLIKELY(new_array.get() == NULL)) {
49 CHECK(self->IsExceptionPending());
50 return NULL;
51 }
Mathieu Chartier590fee92013-09-13 13:46:47 -070052 if (current_dimension + 1 < dimensions->GetLength()) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080053 // Create a new sub-array in every element of the array.
54 for (int32_t i = 0; i < array_length; i++) {
55 Array* sub_array = RecursiveCreateMultiArray(self, array_class->GetComponentType(),
56 current_dimension + 1, dimensions);
57 if (UNLIKELY(sub_array == NULL)) {
58 CHECK(self->IsExceptionPending());
59 return NULL;
60 }
61 new_array->AsObjectArray<Array>()->Set(i, sub_array);
62 }
63 }
64 return new_array.get();
65}
66
67Array* Array::CreateMultiArray(Thread* self, Class* element_class, IntArray* dimensions) {
68 // Verify dimensions.
69 //
70 // The caller is responsible for verifying that "dimArray" is non-null
71 // and has a length > 0 and <= 255.
72 int num_dimensions = dimensions->GetLength();
73 DCHECK_GT(num_dimensions, 0);
74 DCHECK_LE(num_dimensions, 255);
75
76 for (int i = 0; i < num_dimensions; i++) {
77 int dimension = dimensions->Get(i);
78 if (UNLIKELY(dimension < 0)) {
Ian Rogers62d6c772013-02-27 08:32:07 -080079 ThrowNegativeArraySizeException(StringPrintf("Dimension %d: %d", i, dimension).c_str());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080080 return NULL;
81 }
82 }
83
84 // Generate the full name of the array class.
85 std::string descriptor(num_dimensions, '[');
86 descriptor += ClassHelper(element_class).GetDescriptor();
87
88 // Find/generate the array class.
89 ClassLinker* class_linker = Runtime::Current()->GetClassLinker();
Mathieu Chartier590fee92013-09-13 13:46:47 -070090 SirtRef<mirror::ClassLoader> class_loader(self, element_class->GetClassLoader());
91 Class* array_class = class_linker->FindClass(descriptor.c_str(), class_loader);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080092 if (UNLIKELY(array_class == NULL)) {
93 CHECK(self->IsExceptionPending());
94 return NULL;
95 }
96 // create the array
Mathieu Chartier590fee92013-09-13 13:46:47 -070097 SirtRef<mirror::IntArray> sirt_dimensions(self, dimensions);
98 Array* new_array = RecursiveCreateMultiArray(self, array_class, 0, sirt_dimensions);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080099 if (UNLIKELY(new_array == NULL)) {
100 CHECK(self->IsExceptionPending());
101 return NULL;
102 }
103 return new_array;
104}
105
Ian Rogersef7d42f2014-01-06 12:55:46 -0800106void Array::ThrowArrayIndexOutOfBoundsException(int32_t index) {
Ian Rogers62d6c772013-02-27 08:32:07 -0800107 art::ThrowArrayIndexOutOfBoundsException(index, GetLength());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800108}
109
Ian Rogersef7d42f2014-01-06 12:55:46 -0800110void Array::ThrowArrayStoreException(Object* object) {
Ian Rogers62d6c772013-02-27 08:32:07 -0800111 art::ThrowArrayStoreException(object->GetClass(), this->GetClass());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800112}
113
114template<typename T>
115PrimitiveArray<T>* PrimitiveArray<T>::Alloc(Thread* self, size_t length) {
116 DCHECK(array_class_ != NULL);
Mathieu Chartiercbb2d202013-11-14 17:45:16 -0800117 Array* raw_array = Array::Alloc<true>(self, array_class_, length, sizeof(T));
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800118 return down_cast<PrimitiveArray<T>*>(raw_array);
119}
120
121template <typename T> Class* PrimitiveArray<T>::array_class_ = NULL;
122
123// Explicitly instantiate all the primitive array types.
124template class PrimitiveArray<uint8_t>; // BooleanArray
125template class PrimitiveArray<int8_t>; // ByteArray
126template class PrimitiveArray<uint16_t>; // CharArray
127template class PrimitiveArray<double>; // DoubleArray
128template class PrimitiveArray<float>; // FloatArray
129template class PrimitiveArray<int32_t>; // IntArray
130template class PrimitiveArray<int64_t>; // LongArray
131template class PrimitiveArray<int16_t>; // ShortArray
132
133} // namespace mirror
134} // namespace art