blob: f54af855b48e4bd17029e0cbb2ad4312602c1b39 [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 Rogers98379392014-02-24 16:53:16 -080021#include "class_linker-inl.h"
Ian Rogers62d6c772013-02-27 08:32:07 -080022#include "common_throws.h"
Ian Rogers4f6ad8a2013-03-18 15:27:28 -070023#include "dex_file-inl.h"
Ian Rogers1d54e732013-05-02 21:10:01 -070024#include "gc/accounting/card_table-inl.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080025#include "object-inl.h"
26#include "object_array.h"
27#include "object_array-inl.h"
Mathieu Chartiereb8167a2014-05-07 15:43:14 -070028#include "handle_scope-inl.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080029#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,
Mathieu Chartier0cd81352014-05-22 16:48:55 -070044 Handle<Class> array_class, int current_dimension,
45 Handle<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 Chartiereb8167a2014-05-07 15:43:14 -070048 StackHandleScope<1> hs(self);
49 Handle<Array> new_array(
50 hs.NewHandle(
51 Array::Alloc<true>(self, array_class.Get(), array_length, array_class->GetComponentSize(),
52 Runtime::Current()->GetHeap()->GetCurrentAllocator())));
53 if (UNLIKELY(new_array.Get() == nullptr)) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080054 CHECK(self->IsExceptionPending());
Mathieu Chartier5bb99032014-02-08 16:20:58 -080055 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080056 }
Mathieu Chartier590fee92013-09-13 13:46:47 -070057 if (current_dimension + 1 < dimensions->GetLength()) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080058 // Create a new sub-array in every element of the array.
59 for (int32_t i = 0; i < array_length; i++) {
Mathieu Chartiereb8167a2014-05-07 15:43:14 -070060 StackHandleScope<1> hs(self);
61 Handle<mirror::Class> h_component_type(hs.NewHandle(array_class->GetComponentType()));
62 Array* sub_array = RecursiveCreateMultiArray(self, h_component_type,
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080063 current_dimension + 1, dimensions);
Mathieu Chartier5bb99032014-02-08 16:20:58 -080064 if (UNLIKELY(sub_array == nullptr)) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080065 CHECK(self->IsExceptionPending());
Mathieu Chartier5bb99032014-02-08 16:20:58 -080066 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080067 }
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +010068 // Use non-transactional mode without check.
69 new_array->AsObjectArray<Array>()->Set<false, false>(i, sub_array);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080070 }
71 }
Mathieu Chartiereb8167a2014-05-07 15:43:14 -070072 return new_array.Get();
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080073}
74
Mathieu Chartier0cd81352014-05-22 16:48:55 -070075Array* Array::CreateMultiArray(Thread* self, Handle<Class> element_class,
76 Handle<IntArray> dimensions) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080077 // Verify dimensions.
78 //
79 // The caller is responsible for verifying that "dimArray" is non-null
80 // and has a length > 0 and <= 255.
81 int num_dimensions = dimensions->GetLength();
82 DCHECK_GT(num_dimensions, 0);
83 DCHECK_LE(num_dimensions, 255);
84
85 for (int i = 0; i < num_dimensions; i++) {
86 int dimension = dimensions->Get(i);
87 if (UNLIKELY(dimension < 0)) {
Ian Rogers62d6c772013-02-27 08:32:07 -080088 ThrowNegativeArraySizeException(StringPrintf("Dimension %d: %d", i, dimension).c_str());
Mathieu Chartier5bb99032014-02-08 16:20:58 -080089 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080090 }
91 }
92
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080093 // Find/generate the array class.
94 ClassLinker* class_linker = Runtime::Current()->GetClassLinker();
Mathieu Chartierb74cd292014-05-29 14:31:33 -070095 mirror::Class* element_class_ptr = element_class.Get();
Mathieu Chartiereb8167a2014-05-07 15:43:14 -070096 StackHandleScope<1> hs(self);
97 Handle<mirror::Class> array_class(
Mathieu Chartierb74cd292014-05-29 14:31:33 -070098 hs.NewHandle(class_linker->FindArrayClass(self, &element_class_ptr)));
Mathieu Chartiereb8167a2014-05-07 15:43:14 -070099 if (UNLIKELY(array_class.Get() == nullptr)) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800100 CHECK(self->IsExceptionPending());
Mathieu Chartier5bb99032014-02-08 16:20:58 -0800101 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800102 }
Ian Rogers98379392014-02-24 16:53:16 -0800103 for (int32_t i = 1; i < dimensions->GetLength(); ++i) {
Mathieu Chartierb74cd292014-05-29 14:31:33 -0700104 mirror::Class* array_class_ptr = array_class.Get();
105 array_class.Assign(class_linker->FindArrayClass(self, &array_class_ptr));
Mathieu Chartiereb8167a2014-05-07 15:43:14 -0700106 if (UNLIKELY(array_class.Get() == nullptr)) {
Ian Rogers98379392014-02-24 16:53:16 -0800107 CHECK(self->IsExceptionPending());
108 return nullptr;
109 }
110 }
111 // Create the array.
Mathieu Chartier5bb99032014-02-08 16:20:58 -0800112 Array* new_array = RecursiveCreateMultiArray(self, array_class, 0, dimensions);
113 if (UNLIKELY(new_array == nullptr)) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800114 CHECK(self->IsExceptionPending());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800115 }
116 return new_array;
117}
118
Ian Rogersef7d42f2014-01-06 12:55:46 -0800119void Array::ThrowArrayIndexOutOfBoundsException(int32_t index) {
Ian Rogers62d6c772013-02-27 08:32:07 -0800120 art::ThrowArrayIndexOutOfBoundsException(index, GetLength());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800121}
122
Ian Rogersef7d42f2014-01-06 12:55:46 -0800123void Array::ThrowArrayStoreException(Object* object) {
Ian Rogers62d6c772013-02-27 08:32:07 -0800124 art::ThrowArrayStoreException(object->GetClass(), this->GetClass());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800125}
126
Hiroshi Yamauchi94f7b492014-07-22 18:08:23 -0700127template <typename T> GcRoot<Class> PrimitiveArray<T>::array_class_;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800128
129// Explicitly instantiate all the primitive array types.
130template class PrimitiveArray<uint8_t>; // BooleanArray
131template class PrimitiveArray<int8_t>; // ByteArray
132template class PrimitiveArray<uint16_t>; // CharArray
133template class PrimitiveArray<double>; // DoubleArray
134template class PrimitiveArray<float>; // FloatArray
135template class PrimitiveArray<int32_t>; // IntArray
136template class PrimitiveArray<int64_t>; // LongArray
137template class PrimitiveArray<int16_t>; // ShortArray
138
139} // namespace mirror
140} // namespace art