Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1 | /* |
| 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 Rogers | 9837939 | 2014-02-24 16:53:16 -0800 | [diff] [blame] | 21 | #include "class_linker-inl.h" |
Ian Rogers | 62d6c77 | 2013-02-27 08:32:07 -0800 | [diff] [blame] | 22 | #include "common_throws.h" |
Ian Rogers | 4f6ad8a | 2013-03-18 15:27:28 -0700 | [diff] [blame] | 23 | #include "dex_file-inl.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 24 | #include "gc/accounting/card_table-inl.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 25 | #include "object-inl.h" |
| 26 | #include "object_array.h" |
| 27 | #include "object_array-inl.h" |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 28 | #include "handle_scope-inl.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 29 | #include "thread.h" |
| 30 | #include "utils.h" |
| 31 | |
| 32 | namespace art { |
| 33 | namespace mirror { |
| 34 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 35 | // 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 Chartier | 5bb9903 | 2014-02-08 16:20:58 -0800 | [diff] [blame] | 43 | static Array* RecursiveCreateMultiArray(Thread* self, |
Mathieu Chartier | 0cd8135 | 2014-05-22 16:48:55 -0700 | [diff] [blame] | 44 | Handle<Class> array_class, int current_dimension, |
| 45 | Handle<mirror::IntArray> dimensions) |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 46 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
| 47 | int32_t array_length = dimensions->Get(current_dimension); |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 48 | StackHandleScope<1> hs(self); |
| 49 | Handle<Array> new_array( |
| 50 | hs.NewHandle( |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame^] | 51 | Array::Alloc<true>(self, array_class.Get(), array_length, |
| 52 | array_class->GetComponentSizeShift(), |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 53 | Runtime::Current()->GetHeap()->GetCurrentAllocator()))); |
| 54 | if (UNLIKELY(new_array.Get() == nullptr)) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 55 | CHECK(self->IsExceptionPending()); |
Mathieu Chartier | 5bb9903 | 2014-02-08 16:20:58 -0800 | [diff] [blame] | 56 | return nullptr; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 57 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 58 | if (current_dimension + 1 < dimensions->GetLength()) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 59 | // Create a new sub-array in every element of the array. |
| 60 | for (int32_t i = 0; i < array_length; i++) { |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 61 | StackHandleScope<1> hs(self); |
| 62 | Handle<mirror::Class> h_component_type(hs.NewHandle(array_class->GetComponentType())); |
| 63 | Array* sub_array = RecursiveCreateMultiArray(self, h_component_type, |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 64 | current_dimension + 1, dimensions); |
Mathieu Chartier | 5bb9903 | 2014-02-08 16:20:58 -0800 | [diff] [blame] | 65 | if (UNLIKELY(sub_array == nullptr)) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 66 | CHECK(self->IsExceptionPending()); |
Mathieu Chartier | 5bb9903 | 2014-02-08 16:20:58 -0800 | [diff] [blame] | 67 | return nullptr; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 68 | } |
Sebastien Hertz | d2fe10a | 2014-01-15 10:20:56 +0100 | [diff] [blame] | 69 | // Use non-transactional mode without check. |
| 70 | new_array->AsObjectArray<Array>()->Set<false, false>(i, sub_array); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 71 | } |
| 72 | } |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 73 | return new_array.Get(); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 74 | } |
| 75 | |
Mathieu Chartier | 0cd8135 | 2014-05-22 16:48:55 -0700 | [diff] [blame] | 76 | Array* Array::CreateMultiArray(Thread* self, Handle<Class> element_class, |
| 77 | Handle<IntArray> dimensions) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 78 | // Verify dimensions. |
| 79 | // |
| 80 | // The caller is responsible for verifying that "dimArray" is non-null |
| 81 | // and has a length > 0 and <= 255. |
| 82 | int num_dimensions = dimensions->GetLength(); |
| 83 | DCHECK_GT(num_dimensions, 0); |
| 84 | DCHECK_LE(num_dimensions, 255); |
| 85 | |
| 86 | for (int i = 0; i < num_dimensions; i++) { |
| 87 | int dimension = dimensions->Get(i); |
| 88 | if (UNLIKELY(dimension < 0)) { |
Ian Rogers | 62d6c77 | 2013-02-27 08:32:07 -0800 | [diff] [blame] | 89 | ThrowNegativeArraySizeException(StringPrintf("Dimension %d: %d", i, dimension).c_str()); |
Mathieu Chartier | 5bb9903 | 2014-02-08 16:20:58 -0800 | [diff] [blame] | 90 | return nullptr; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 91 | } |
| 92 | } |
| 93 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 94 | // Find/generate the array class. |
| 95 | ClassLinker* class_linker = Runtime::Current()->GetClassLinker(); |
Mathieu Chartier | b74cd29 | 2014-05-29 14:31:33 -0700 | [diff] [blame] | 96 | mirror::Class* element_class_ptr = element_class.Get(); |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 97 | StackHandleScope<1> hs(self); |
Andreas Gampe | 5a4b8a2 | 2014-09-11 08:30:08 -0700 | [diff] [blame] | 98 | MutableHandle<mirror::Class> array_class( |
Mathieu Chartier | b74cd29 | 2014-05-29 14:31:33 -0700 | [diff] [blame] | 99 | hs.NewHandle(class_linker->FindArrayClass(self, &element_class_ptr))); |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 100 | if (UNLIKELY(array_class.Get() == nullptr)) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 101 | CHECK(self->IsExceptionPending()); |
Mathieu Chartier | 5bb9903 | 2014-02-08 16:20:58 -0800 | [diff] [blame] | 102 | return nullptr; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 103 | } |
Ian Rogers | 9837939 | 2014-02-24 16:53:16 -0800 | [diff] [blame] | 104 | for (int32_t i = 1; i < dimensions->GetLength(); ++i) { |
Mathieu Chartier | b74cd29 | 2014-05-29 14:31:33 -0700 | [diff] [blame] | 105 | mirror::Class* array_class_ptr = array_class.Get(); |
| 106 | array_class.Assign(class_linker->FindArrayClass(self, &array_class_ptr)); |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 107 | if (UNLIKELY(array_class.Get() == nullptr)) { |
Ian Rogers | 9837939 | 2014-02-24 16:53:16 -0800 | [diff] [blame] | 108 | CHECK(self->IsExceptionPending()); |
| 109 | return nullptr; |
| 110 | } |
| 111 | } |
| 112 | // Create the array. |
Mathieu Chartier | 5bb9903 | 2014-02-08 16:20:58 -0800 | [diff] [blame] | 113 | Array* new_array = RecursiveCreateMultiArray(self, array_class, 0, dimensions); |
| 114 | if (UNLIKELY(new_array == nullptr)) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 115 | CHECK(self->IsExceptionPending()); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 116 | } |
| 117 | return new_array; |
| 118 | } |
| 119 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 120 | void Array::ThrowArrayIndexOutOfBoundsException(int32_t index) { |
Ian Rogers | 62d6c77 | 2013-02-27 08:32:07 -0800 | [diff] [blame] | 121 | art::ThrowArrayIndexOutOfBoundsException(index, GetLength()); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 122 | } |
| 123 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 124 | void Array::ThrowArrayStoreException(Object* object) { |
Ian Rogers | 62d6c77 | 2013-02-27 08:32:07 -0800 | [diff] [blame] | 125 | art::ThrowArrayStoreException(object->GetClass(), this->GetClass()); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 126 | } |
| 127 | |
Hiroshi Yamauchi | 94f7b49 | 2014-07-22 18:08:23 -0700 | [diff] [blame] | 128 | template <typename T> GcRoot<Class> PrimitiveArray<T>::array_class_; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 129 | |
| 130 | // Explicitly instantiate all the primitive array types. |
| 131 | template class PrimitiveArray<uint8_t>; // BooleanArray |
| 132 | template class PrimitiveArray<int8_t>; // ByteArray |
| 133 | template class PrimitiveArray<uint16_t>; // CharArray |
| 134 | template class PrimitiveArray<double>; // DoubleArray |
| 135 | template class PrimitiveArray<float>; // FloatArray |
| 136 | template class PrimitiveArray<int32_t>; // IntArray |
| 137 | template class PrimitiveArray<int64_t>; // LongArray |
| 138 | template class PrimitiveArray<int16_t>; // ShortArray |
| 139 | |
| 140 | } // namespace mirror |
| 141 | } // namespace art |