blob: be49b42f0de60c191762a038892fe32d66f1a3e5 [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_OBJECT_ARRAY_INL_H_
18#define ART_RUNTIME_MIRROR_OBJECT_ARRAY_INL_H_
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080019
20#include "object_array.h"
21
Ian Rogers1d54e732013-05-02 21:10:01 -070022#include "gc/heap.h"
Brian Carlstromea46f952013-07-30 01:26:50 -070023#include "mirror/art_field.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080024#include "mirror/class.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080025#include "runtime.h"
Mathieu Chartier590fee92013-09-13 13:46:47 -070026#include "sirt_ref.h"
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020027#include "thread.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080028
29namespace art {
30namespace mirror {
31
32template<class T>
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080033inline ObjectArray<T>* ObjectArray<T>::Alloc(Thread* self, Class* object_array_class,
34 int32_t length, gc::AllocatorType allocator_type) {
35 Array* array = Array::Alloc<true>(self, object_array_class, length, sizeof(Object*),
36 allocator_type);
37 if (UNLIKELY(array == nullptr)) {
38 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080039 } else {
40 return array->AsObjectArray<T>();
41 }
42}
43
44template<class T>
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080045inline ObjectArray<T>* ObjectArray<T>::Alloc(Thread* self, Class* object_array_class,
46 int32_t length) {
47 return Alloc(self, object_array_class, length,
48 Runtime::Current()->GetHeap()->GetCurrentAllocator());
49}
50
51template<class T>
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080052inline T* ObjectArray<T>::Get(int32_t i) const {
53 if (UNLIKELY(!IsValidIndex(i))) {
54 return NULL;
55 }
56 MemberOffset data_offset(DataOffset(sizeof(Object*)).Int32Value() + i * sizeof(Object*));
57 return GetFieldObject<T*>(data_offset, false);
58}
59
60template<class T>
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020061inline bool ObjectArray<T>::CheckAssignable(T* object) {
62 if (object != NULL) {
63 Class* element_class = GetClass()->GetComponentType();
64 if (UNLIKELY(!object->InstanceOf(element_class))) {
65 ThrowArrayStoreException(object);
66 return false;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080067 }
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020068 }
69 return true;
70}
71
72template<class T>
73inline void ObjectArray<T>::Set(int32_t i, T* object) {
74 if (LIKELY(IsValidIndex(i) && CheckAssignable(object))) {
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080075 MemberOffset data_offset(DataOffset(sizeof(Object*)).Int32Value() + i * sizeof(Object*));
76 SetFieldObject(data_offset, object, false);
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020077 } else {
78 DCHECK(Thread::Current()->IsExceptionPending());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080079 }
80}
81
82template<class T>
83inline void ObjectArray<T>::SetWithoutChecks(int32_t i, T* object) {
84 DCHECK(IsValidIndex(i));
85 MemberOffset data_offset(DataOffset(sizeof(Object*)).Int32Value() + i * sizeof(Object*));
86 SetFieldObject(data_offset, object, false);
87}
88
89template<class T>
90inline void ObjectArray<T>::SetPtrWithoutChecks(int32_t i, T* object) {
91 DCHECK(IsValidIndex(i));
92 MemberOffset data_offset(DataOffset(sizeof(Object*)).Int32Value() + i * sizeof(Object*));
93 SetFieldPtr(data_offset, object, false);
94}
95
96template<class T>
97inline T* ObjectArray<T>::GetWithoutChecks(int32_t i) const {
98 DCHECK(IsValidIndex(i));
99 MemberOffset data_offset(DataOffset(sizeof(Object*)).Int32Value() + i * sizeof(Object*));
100 return GetFieldObject<T*>(data_offset, false);
101}
102
103template<class T>
104inline void ObjectArray<T>::Copy(const ObjectArray<T>* src, int src_pos,
105 ObjectArray<T>* dst, int dst_pos,
106 size_t length) {
107 if (src->IsValidIndex(src_pos) &&
108 src->IsValidIndex(src_pos+length-1) &&
109 dst->IsValidIndex(dst_pos) &&
110 dst->IsValidIndex(dst_pos+length-1)) {
111 MemberOffset src_offset(DataOffset(sizeof(Object*)).Int32Value() + src_pos * sizeof(Object*));
112 MemberOffset dst_offset(DataOffset(sizeof(Object*)).Int32Value() + dst_pos * sizeof(Object*));
113 Class* array_class = dst->GetClass();
Ian Rogers1d54e732013-05-02 21:10:01 -0700114 gc::Heap* heap = Runtime::Current()->GetHeap();
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800115 if (array_class == src->GetClass()) {
116 // No need for array store checks if arrays are of the same type
117 for (size_t i = 0; i < length; i++) {
118 Object* object = src->GetFieldObject<Object*>(src_offset, false);
119 heap->VerifyObject(object);
120 // directly set field, we do a bulk write barrier at the end
121 dst->SetField32(dst_offset, reinterpret_cast<uint32_t>(object), false, true);
122 src_offset = MemberOffset(src_offset.Uint32Value() + sizeof(Object*));
123 dst_offset = MemberOffset(dst_offset.Uint32Value() + sizeof(Object*));
124 }
125 } else {
126 Class* element_class = array_class->GetComponentType();
127 CHECK(!element_class->IsPrimitive());
128 for (size_t i = 0; i < length; i++) {
129 Object* object = src->GetFieldObject<Object*>(src_offset, false);
130 if (object != NULL && !object->InstanceOf(element_class)) {
131 dst->ThrowArrayStoreException(object);
132 return;
133 }
134 heap->VerifyObject(object);
135 // directly set field, we do a bulk write barrier at the end
136 dst->SetField32(dst_offset, reinterpret_cast<uint32_t>(object), false, true);
137 src_offset = MemberOffset(src_offset.Uint32Value() + sizeof(Object*));
138 dst_offset = MemberOffset(dst_offset.Uint32Value() + sizeof(Object*));
139 }
140 }
141 heap->WriteBarrierArray(dst, dst_pos, length);
142 }
143}
144
145template<class T>
146inline ObjectArray<T>* ObjectArray<T>::CopyOf(Thread* self, int32_t new_length) {
Mathieu Chartier590fee92013-09-13 13:46:47 -0700147 // We may get copied by a compacting GC.
148 SirtRef<ObjectArray<T> > sirt_this(self, this);
Mathieu Chartiercbb2d202013-11-14 17:45:16 -0800149 gc::Heap* heap = Runtime::Current()->GetHeap();
150 gc::AllocatorType allocator_type = heap->IsMovableObject(this) ? heap->GetCurrentAllocator() :
151 heap->GetCurrentNonMovingAllocator();
152 ObjectArray<T>* new_array = Alloc(self, GetClass(), new_length, allocator_type);
Mathieu Chartier590fee92013-09-13 13:46:47 -0700153 if (LIKELY(new_array != nullptr)) {
154 Copy(sirt_this.get(), 0, new_array, 0, std::min(sirt_this->GetLength(), new_length));
Ian Rogersa436fde2013-08-27 23:34:06 -0700155 }
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800156 return new_array;
157}
158
159} // namespace mirror
160} // namespace art
161
Brian Carlstromfc0e3212013-07-17 14:40:12 -0700162#endif // ART_RUNTIME_MIRROR_OBJECT_ARRAY_INL_H_