blob: c23234ee0bd8f4df8c033a417b7b0ca03b2acf89 [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.
Mathieu Chartier5bb99032014-02-08 16:20:58 -080043static Array* RecursiveCreateMultiArray(Thread* self,
44 const SirtRef<Class>& array_class, int current_dimension,
45 const SirtRef<mirror::IntArray>& dimensions)
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080046 SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) {
47 int32_t array_length = dimensions->Get(current_dimension);
Mathieu Chartier5bb99032014-02-08 16:20:58 -080048 SirtRef<Array> new_array(self, Array::Alloc<true>(self, array_class.get(), array_length));
49 if (UNLIKELY(new_array.get() == nullptr)) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080050 CHECK(self->IsExceptionPending());
Mathieu Chartier5bb99032014-02-08 16:20:58 -080051 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080052 }
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++) {
Mathieu Chartier5bb99032014-02-08 16:20:58 -080056 SirtRef<mirror::Class> sirt_component_type(self, array_class->GetComponentType());
57 Array* sub_array = RecursiveCreateMultiArray(self, sirt_component_type,
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080058 current_dimension + 1, dimensions);
Mathieu Chartier5bb99032014-02-08 16:20:58 -080059 if (UNLIKELY(sub_array == nullptr)) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080060 CHECK(self->IsExceptionPending());
Mathieu Chartier5bb99032014-02-08 16:20:58 -080061 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080062 }
63 new_array->AsObjectArray<Array>()->Set(i, sub_array);
64 }
65 }
66 return new_array.get();
67}
68
Mathieu Chartier5bb99032014-02-08 16:20:58 -080069Array* Array::CreateMultiArray(Thread* self, const SirtRef<Class>& element_class,
70 const SirtRef<IntArray>& dimensions) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080071 // Verify dimensions.
72 //
73 // The caller is responsible for verifying that "dimArray" is non-null
74 // and has a length > 0 and <= 255.
75 int num_dimensions = dimensions->GetLength();
76 DCHECK_GT(num_dimensions, 0);
77 DCHECK_LE(num_dimensions, 255);
78
79 for (int i = 0; i < num_dimensions; i++) {
80 int dimension = dimensions->Get(i);
81 if (UNLIKELY(dimension < 0)) {
Ian Rogers62d6c772013-02-27 08:32:07 -080082 ThrowNegativeArraySizeException(StringPrintf("Dimension %d: %d", i, dimension).c_str());
Mathieu Chartier5bb99032014-02-08 16:20:58 -080083 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080084 }
85 }
86
87 // Generate the full name of the array class.
88 std::string descriptor(num_dimensions, '[');
Mathieu Chartier5bb99032014-02-08 16:20:58 -080089 descriptor += ClassHelper(element_class.get()).GetDescriptor();
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080090
91 // Find/generate the array class.
92 ClassLinker* class_linker = Runtime::Current()->GetClassLinker();
Mathieu Chartier590fee92013-09-13 13:46:47 -070093 SirtRef<mirror::ClassLoader> class_loader(self, element_class->GetClassLoader());
Mathieu Chartier5bb99032014-02-08 16:20:58 -080094 SirtRef<mirror::Class> array_class(self,
95 class_linker->FindClass(descriptor.c_str(), class_loader));
96 if (UNLIKELY(array_class.get() == nullptr)) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080097 CHECK(self->IsExceptionPending());
Mathieu Chartier5bb99032014-02-08 16:20:58 -080098 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080099 }
100 // create the array
Mathieu Chartier5bb99032014-02-08 16:20:58 -0800101 Array* new_array = RecursiveCreateMultiArray(self, array_class, 0, dimensions);
102 if (UNLIKELY(new_array == nullptr)) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800103 CHECK(self->IsExceptionPending());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800104 }
105 return new_array;
106}
107
Ian Rogersef7d42f2014-01-06 12:55:46 -0800108void Array::ThrowArrayIndexOutOfBoundsException(int32_t index) {
Ian Rogers62d6c772013-02-27 08:32:07 -0800109 art::ThrowArrayIndexOutOfBoundsException(index, GetLength());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800110}
111
Ian Rogersef7d42f2014-01-06 12:55:46 -0800112void Array::ThrowArrayStoreException(Object* object) {
Ian Rogers62d6c772013-02-27 08:32:07 -0800113 art::ThrowArrayStoreException(object->GetClass(), this->GetClass());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800114}
115
116template<typename T>
117PrimitiveArray<T>* PrimitiveArray<T>::Alloc(Thread* self, size_t length) {
118 DCHECK(array_class_ != NULL);
Mathieu Chartiercbb2d202013-11-14 17:45:16 -0800119 Array* raw_array = Array::Alloc<true>(self, array_class_, length, sizeof(T));
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800120 return down_cast<PrimitiveArray<T>*>(raw_array);
121}
122
123template <typename T> Class* PrimitiveArray<T>::array_class_ = NULL;
124
125// Explicitly instantiate all the primitive array types.
126template class PrimitiveArray<uint8_t>; // BooleanArray
127template class PrimitiveArray<int8_t>; // ByteArray
128template class PrimitiveArray<uint16_t>; // CharArray
129template class PrimitiveArray<double>; // DoubleArray
130template class PrimitiveArray<float>; // FloatArray
131template class PrimitiveArray<int32_t>; // IntArray
132template class PrimitiveArray<int64_t>; // LongArray
133template class PrimitiveArray<int16_t>; // ShortArray
134
135} // namespace mirror
136} // namespace art