blob: c7b370f877fd5a0215f0a734d9df686510bb95f1 [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 Yamauchi967a0ad2013-09-10 16:24:21 -070023#include "thread.h"
24#include "utils.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080025
26namespace art {
27namespace mirror {
28
29inline size_t Array::SizeOf() const {
30 // This is safe from overflow because the array was already allocated, so we know it's sane.
31 size_t component_size = GetClass()->GetComponentSize();
32 int32_t component_count = GetLength();
33 size_t header_size = sizeof(Object) + (component_size == sizeof(int64_t) ? 8 : 4);
34 size_t data_size = component_count * component_size;
35 return header_size + data_size;
36}
37
Hiroshi Yamauchi967a0ad2013-09-10 16:24:21 -070038inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count,
39 size_t component_size) {
40 DCHECK(array_class != NULL);
41 DCHECK_GE(component_count, 0);
42 DCHECK(array_class->IsArrayClass());
43
44 size_t header_size = sizeof(Object) + (component_size == sizeof(int64_t) ? 8 : 4);
45 size_t data_size = component_count * component_size;
46 size_t size = header_size + data_size;
47
48 // Check for overflow and throw OutOfMemoryError if this was an unreasonable request.
49 size_t component_shift = sizeof(size_t) * 8 - 1 - CLZ(component_size);
50 if (UNLIKELY(data_size >> component_shift != size_t(component_count) || size < data_size)) {
51 self->ThrowOutOfMemoryError(StringPrintf("%s of length %d would overflow",
52 PrettyDescriptor(array_class).c_str(),
53 component_count).c_str());
54 return NULL;
55 }
56
57 gc::Heap* heap = Runtime::Current()->GetHeap();
58 Array* array = down_cast<Array*>(heap->AllocObject(self, array_class, size));
59 if (LIKELY(array != NULL)) {
60 DCHECK(array->IsArrayInstance());
61 array->SetLength(component_count);
62 }
63 return array;
64}
65
66inline Array* Array::Alloc(Thread* self, Class* array_class, int32_t component_count) {
67 DCHECK(array_class->IsArrayClass());
68 return Alloc(self, array_class, component_count, array_class->GetComponentSize());
69}
70
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080071} // namespace mirror
72} // namespace art
73
Brian Carlstromfc0e3212013-07-17 14:40:12 -070074#endif // ART_RUNTIME_MIRROR_ARRAY_INL_H_