blob: 46ffaaef60e40b2deeaa7181dd035843e4ba4128 [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
Brian Carlstromfc0e3212013-07-17 14:40:12 -070017#ifndef ART_RUNTIME_MIRROR_ARRAY_INL_H_
18#define ART_RUNTIME_MIRROR_ARRAY_INL_H_
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080019
20#include "array.h"
21
22#include "class.h"
Hiroshi Yamauchi3b4c1892013-09-12 21:33:12 -070023#include "gc/heap-inl.h"
Hiroshi Yamauchi967a0ad2013-09-10 16:24:21 -070024#include "thread.h"
25#include "utils.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080026
27namespace art {
28namespace mirror {
29
30inline 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 Yamauchi3b4c1892013-09-12 21:33:12 -070039static 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 Yamauchi967a0ad2013-09-10 16:24:21 -070042 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 Yamauchi3b4c1892013-09-12 21:33:12 -070056 return 0; // failure
Hiroshi Yamauchi967a0ad2013-09-10 16:24:21 -070057 }
Hiroshi Yamauchi3b4c1892013-09-12 21:33:12 -070058 return size;
59}
Hiroshi Yamauchi967a0ad2013-09-10 16:24:21 -070060
Mathieu Chartier1febddf2013-11-20 12:33:14 -080061class SetLengthVisitor {
62 public:
63 explicit SetLengthVisitor(int32_t length) : length_(length) {
Hiroshi Yamauchi967a0ad2013-09-10 16:24:21 -070064 }
Mathieu Chartier1febddf2013-11-20 12:33:14 -080065
66 void operator()(mirror::Object* obj) const {
67 mirror::Array* array = obj->AsArray();
68 DCHECK(array->IsArrayInstance());
69 array->SetLength(length_);
70 }
71
72 private:
73 const int32_t length_;
74};
Hiroshi Yamauchi967a0ad2013-09-10 16:24:21 -070075
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080076template <bool kIsInstrumented>
Mathieu Chartier590fee92013-09-13 13:46:47 -070077inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count,
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080078 size_t component_size, gc::AllocatorType allocator_type) {
Hiroshi Yamauchi3b4c1892013-09-12 21:33:12 -070079 size_t size = ComputeArraySize(self, array_class, component_count, component_size);
80 if (UNLIKELY(size == 0)) {
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080081 return nullptr;
Hiroshi Yamauchi3b4c1892013-09-12 21:33:12 -070082 }
83 gc::Heap* heap = Runtime::Current()->GetHeap();
Mathieu Chartier1febddf2013-11-20 12:33:14 -080084 SetLengthVisitor visitor(component_count);
85 return down_cast<Array*>(
86 heap->AllocObjectWithAllocator<kIsInstrumented>(self, array_class, size, allocator_type,
87 visitor));
Hiroshi Yamauchi3b4c1892013-09-12 21:33:12 -070088}
89
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080090template <bool kIsInstrumented>
91inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count,
92 gc::AllocatorType allocator_type) {
Hiroshi Yamauchi967a0ad2013-09-10 16:24:21 -070093 DCHECK(array_class->IsArrayClass());
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080094 return Alloc<kIsInstrumented>(self, array_class, component_count, array_class->GetComponentSize(),
95 allocator_type);
96}
97template <bool kIsInstrumented>
98inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count) {
99 return Alloc<kIsInstrumented>(self, array_class, component_count,
100 Runtime::Current()->GetHeap()->GetCurrentAllocator());
101}
102
103template <bool kIsInstrumented>
104inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count,
105 size_t component_size) {
106 return Alloc<kIsInstrumented>(self, array_class, component_count, component_size,
107 Runtime::Current()->GetHeap()->GetCurrentAllocator());
Hiroshi Yamauchi967a0ad2013-09-10 16:24:21 -0700108}
109
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800110} // namespace mirror
111} // namespace art
112
Brian Carlstromfc0e3212013-07-17 14:40:12 -0700113#endif // ART_RUNTIME_MIRROR_ARRAY_INL_H_