array.cc revision 4f6ad8ab428038129b2d0d6c40b7fd625cca15e1
12dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers/* 22dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * Copyright (C) 2011 The Android Open Source Project 32dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * 42dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * Licensed under the Apache License, Version 2.0 (the "License"); 52dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * you may not use this file except in compliance with the License. 62dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * You may obtain a copy of the License at 72dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * 82dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * http://www.apache.org/licenses/LICENSE-2.0 92dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * 102dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * Unless required by applicable law or agreed to in writing, software 112dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * distributed under the License is distributed on an "AS IS" BASIS, 122dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 132dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * See the License for the specific language governing permissions and 142dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers * limitations under the License. 152dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers */ 162dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 172dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "array.h" 182dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 192dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "class.h" 202dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "class-inl.h" 214f6ad8ab428038129b2d0d6c40b7fd625cca15e1Ian Rogers#include "dex_file-inl.h" 222dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "gc/card_table-inl.h" 232dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "object-inl.h" 242dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "object_array.h" 252dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "object_array-inl.h" 262dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "object_utils.h" 272dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "sirt_ref.h" 282dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "thread.h" 292dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers#include "utils.h" 302dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 312dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogersnamespace art { 322dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogersnamespace mirror { 332dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 342dd0e2cea360bc9206eb88ecc40d259e796c239dIan RogersArray* Array::Alloc(Thread* self, Class* array_class, int32_t component_count, 352dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers size_t component_size) { 362dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers DCHECK(array_class != NULL); 372dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers DCHECK_GE(component_count, 0); 382dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers DCHECK(array_class->IsArrayClass()); 392dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 402dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers size_t header_size = sizeof(Object) + (component_size == sizeof(int64_t) ? 8 : 4); 412dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers size_t data_size = component_count * component_size; 422dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers size_t size = header_size + data_size; 432dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 442dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // Check for overflow and throw OutOfMemoryError if this was an unreasonable request. 452dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers size_t component_shift = sizeof(size_t) * 8 - 1 - CLZ(component_size); 462dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers if (data_size >> component_shift != size_t(component_count) || size < data_size) { 472dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers self->ThrowNewExceptionF("Ljava/lang/OutOfMemoryError;", 482dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers "%s of length %d would overflow", 492dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers PrettyDescriptor(array_class).c_str(), component_count); 502dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return NULL; 512dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 522dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 532dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers Heap* heap = Runtime::Current()->GetHeap(); 542dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers Array* array = down_cast<Array*>(heap->AllocObject(self, array_class, size)); 552dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers if (array != NULL) { 562dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers DCHECK(array->IsArrayInstance()); 572dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers array->SetLength(component_count); 582dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 592dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return array; 602dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} 612dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 622dd0e2cea360bc9206eb88ecc40d259e796c239dIan RogersArray* Array::Alloc(Thread* self, Class* array_class, int32_t component_count) { 632dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers DCHECK(array_class->IsArrayClass()); 642dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return Alloc(self, array_class, component_count, array_class->GetComponentSize()); 652dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} 662dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 672dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// Create a multi-dimensional array of Objects or primitive types. 682dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// 692dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// We have to generate the names for X[], X[][], X[][][], and so on. The 702dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// easiest way to deal with that is to create the full name once and then 712dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// subtract pieces off. Besides, we want to start with the outermost 722dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// piece and work our way in. 732dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// Recursively create an array with multiple dimensions. Elements may be 742dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// Objects or primitive types. 752dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogersstatic Array* RecursiveCreateMultiArray(Thread* self, Class* array_class, int current_dimension, 762dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers IntArray* dimensions) 772dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { 782dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers int32_t array_length = dimensions->Get(current_dimension); 792dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers SirtRef<Array> new_array(self, Array::Alloc(self, array_class, array_length)); 802dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers if (UNLIKELY(new_array.get() == NULL)) { 812dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers CHECK(self->IsExceptionPending()); 822dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return NULL; 832dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 842dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers if ((current_dimension + 1) < dimensions->GetLength()) { 852dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // Create a new sub-array in every element of the array. 862dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers for (int32_t i = 0; i < array_length; i++) { 872dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers Array* sub_array = RecursiveCreateMultiArray(self, array_class->GetComponentType(), 882dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers current_dimension + 1, dimensions); 892dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers if (UNLIKELY(sub_array == NULL)) { 902dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers CHECK(self->IsExceptionPending()); 912dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return NULL; 922dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 932dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers new_array->AsObjectArray<Array>()->Set(i, sub_array); 942dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 952dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 962dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return new_array.get(); 972dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} 982dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 992dd0e2cea360bc9206eb88ecc40d259e796c239dIan RogersArray* Array::CreateMultiArray(Thread* self, Class* element_class, IntArray* dimensions) { 1002dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // Verify dimensions. 1012dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // 1022dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // The caller is responsible for verifying that "dimArray" is non-null 1032dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // and has a length > 0 and <= 255. 1042dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers int num_dimensions = dimensions->GetLength(); 1052dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers DCHECK_GT(num_dimensions, 0); 1062dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers DCHECK_LE(num_dimensions, 255); 1072dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1082dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers for (int i = 0; i < num_dimensions; i++) { 1092dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers int dimension = dimensions->Get(i); 1102dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers if (UNLIKELY(dimension < 0)) { 1112dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers self->ThrowNewExceptionF("Ljava/lang/NegativeArraySizeException;", 1122dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers "Dimension %d: %d", i, dimension); 1132dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return NULL; 1142dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 1152dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 1162dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1172dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // Generate the full name of the array class. 1182dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers std::string descriptor(num_dimensions, '['); 1192dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers descriptor += ClassHelper(element_class).GetDescriptor(); 1202dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1212dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // Find/generate the array class. 1222dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers ClassLinker* class_linker = Runtime::Current()->GetClassLinker(); 1232dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers Class* array_class = class_linker->FindClass(descriptor.c_str(), element_class->GetClassLoader()); 1242dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers if (UNLIKELY(array_class == NULL)) { 1252dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers CHECK(self->IsExceptionPending()); 1262dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return NULL; 1272dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 1282dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers // create the array 1292dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers Array* new_array = RecursiveCreateMultiArray(self, array_class, 0, dimensions); 1302dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers if (UNLIKELY(new_array == NULL)) { 1312dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers CHECK(self->IsExceptionPending()); 1322dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return NULL; 1332dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers } 1342dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return new_array; 1352dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} 1362dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1372dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogersbool Array::ThrowArrayIndexOutOfBoundsException(int32_t index) const { 1382dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers Thread::Current()->ThrowNewExceptionF("Ljava/lang/ArrayIndexOutOfBoundsException;", 1392dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers "length=%i; index=%i", length_, index); 1402dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return false; 1412dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} 1422dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1432dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogersbool Array::ThrowArrayStoreException(Object* object) const { 1442dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers Thread::Current()->ThrowNewExceptionF("Ljava/lang/ArrayStoreException;", 1452dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers "%s cannot be stored in an array of type %s", 1462dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers PrettyTypeOf(object).c_str(), PrettyTypeOf(this).c_str()); 1472dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return false; 1482dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} 1492dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1502dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate<typename T> 1512dd0e2cea360bc9206eb88ecc40d259e796c239dIan RogersPrimitiveArray<T>* PrimitiveArray<T>::Alloc(Thread* self, size_t length) { 1522dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers DCHECK(array_class_ != NULL); 1532dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers Array* raw_array = Array::Alloc(self, array_class_, length, sizeof(T)); 1542dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers return down_cast<PrimitiveArray<T>*>(raw_array); 1552dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} 1562dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1572dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate <typename T> Class* PrimitiveArray<T>::array_class_ = NULL; 1582dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1592dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers// Explicitly instantiate all the primitive array types. 1602dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<uint8_t>; // BooleanArray 1612dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<int8_t>; // ByteArray 1622dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<uint16_t>; // CharArray 1632dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<double>; // DoubleArray 1642dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<float>; // FloatArray 1652dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<int32_t>; // IntArray 1662dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<int64_t>; // LongArray 1672dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogerstemplate class PrimitiveArray<int16_t>; // ShortArray 1682dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers 1692dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} // namespace mirror 1702dd0e2cea360bc9206eb88ecc40d259e796c239dIan Rogers} // namespace art 171