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 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 17 | #ifndef ART_RUNTIME_MIRROR_ARRAY_INL_H_ |
| 18 | #define ART_RUNTIME_MIRROR_ARRAY_INL_H_ |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 19 | |
| 20 | #include "array.h" |
| 21 | |
| 22 | #include "class.h" |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 23 | #include "gc/heap-inl.h" |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 24 | #include "thread.h" |
| 25 | #include "utils.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 26 | |
| 27 | namespace art { |
| 28 | namespace mirror { |
| 29 | |
| 30 | inline size_t Array::SizeOf() const { |
| 31 | // This is safe from overflow because the array was already allocated, so we know it's sane. |
| 32 | size_t component_size = GetClass()->GetComponentSize(); |
| 33 | int32_t component_count = GetLength(); |
| 34 | size_t header_size = sizeof(Object) + (component_size == sizeof(int64_t) ? 8 : 4); |
| 35 | size_t data_size = component_count * component_size; |
| 36 | return header_size + data_size; |
| 37 | } |
| 38 | |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 39 | static inline size_t ComputeArraySize(Thread* self, Class* array_class, int32_t component_count, |
| 40 | size_t component_size) |
| 41 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 42 | DCHECK(array_class != NULL); |
| 43 | DCHECK_GE(component_count, 0); |
| 44 | DCHECK(array_class->IsArrayClass()); |
| 45 | |
| 46 | size_t header_size = sizeof(Object) + (component_size == sizeof(int64_t) ? 8 : 4); |
| 47 | size_t data_size = component_count * component_size; |
| 48 | size_t size = header_size + data_size; |
| 49 | |
| 50 | // Check for overflow and throw OutOfMemoryError if this was an unreasonable request. |
| 51 | size_t component_shift = sizeof(size_t) * 8 - 1 - CLZ(component_size); |
| 52 | if (UNLIKELY(data_size >> component_shift != size_t(component_count) || size < data_size)) { |
| 53 | self->ThrowOutOfMemoryError(StringPrintf("%s of length %d would overflow", |
| 54 | PrettyDescriptor(array_class).c_str(), |
| 55 | component_count).c_str()); |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 56 | return 0; // failure |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 57 | } |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 58 | return size; |
| 59 | } |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 60 | |
Mathieu Chartier | 7410f29 | 2013-11-24 13:17:35 -0800 | [diff] [blame] | 61 | // Used for setting the array length in the allocation code path to ensure it is guarded by a CAS. |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 62 | class SetLengthVisitor { |
| 63 | public: |
| 64 | explicit SetLengthVisitor(int32_t length) : length_(length) { |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 65 | } |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 66 | |
| 67 | void operator()(mirror::Object* obj) const { |
| 68 | mirror::Array* array = obj->AsArray(); |
| 69 | DCHECK(array->IsArrayInstance()); |
| 70 | array->SetLength(length_); |
| 71 | } |
| 72 | |
| 73 | private: |
| 74 | const int32_t length_; |
| 75 | }; |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 76 | |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 77 | template <bool kIsInstrumented> |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 78 | inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count, |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 79 | size_t component_size, gc::AllocatorType allocator_type) { |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 80 | size_t size = ComputeArraySize(self, array_class, component_count, component_size); |
| 81 | if (UNLIKELY(size == 0)) { |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 82 | return nullptr; |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 83 | } |
| 84 | gc::Heap* heap = Runtime::Current()->GetHeap(); |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 85 | SetLengthVisitor visitor(component_count); |
| 86 | return down_cast<Array*>( |
| 87 | heap->AllocObjectWithAllocator<kIsInstrumented>(self, array_class, size, allocator_type, |
| 88 | visitor)); |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 89 | } |
| 90 | |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 91 | template <bool kIsInstrumented> |
| 92 | inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count, |
| 93 | gc::AllocatorType allocator_type) { |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 94 | DCHECK(array_class->IsArrayClass()); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 95 | return Alloc<kIsInstrumented>(self, array_class, component_count, array_class->GetComponentSize(), |
| 96 | allocator_type); |
| 97 | } |
| 98 | template <bool kIsInstrumented> |
| 99 | inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count) { |
| 100 | return Alloc<kIsInstrumented>(self, array_class, component_count, |
| 101 | Runtime::Current()->GetHeap()->GetCurrentAllocator()); |
| 102 | } |
| 103 | |
| 104 | template <bool kIsInstrumented> |
| 105 | inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count, |
| 106 | size_t component_size) { |
| 107 | return Alloc<kIsInstrumented>(self, array_class, component_count, component_size, |
| 108 | Runtime::Current()->GetHeap()->GetCurrentAllocator()); |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 109 | } |
| 110 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 111 | } // namespace mirror |
| 112 | } // namespace art |
| 113 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 114 | #endif // ART_RUNTIME_MIRROR_ARRAY_INL_H_ |