blob: 521b6ce799e68ce8469e33ef03d1c80b278f8413 [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 Rogersef7d42f2014-01-06 12:55:46 -080028#include <string>
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080029
30namespace art {
31namespace mirror {
32
33template<class T>
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080034inline ObjectArray<T>* ObjectArray<T>::Alloc(Thread* self, Class* object_array_class,
35 int32_t length, gc::AllocatorType allocator_type) {
Ian Rogersef7d42f2014-01-06 12:55:46 -080036 Array* array = Array::Alloc<true>(self, object_array_class, length,
37 sizeof(HeapReference<Object>), allocator_type);
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080038 if (UNLIKELY(array == nullptr)) {
39 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080040 } else {
41 return array->AsObjectArray<T>();
42 }
43}
44
45template<class T>
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080046inline ObjectArray<T>* ObjectArray<T>::Alloc(Thread* self, Class* object_array_class,
47 int32_t length) {
48 return Alloc(self, object_array_class, length,
49 Runtime::Current()->GetHeap()->GetCurrentAllocator());
50}
51
52template<class T>
Ian Rogersef7d42f2014-01-06 12:55:46 -080053inline T* ObjectArray<T>::Get(int32_t i) {
Sebastien Hertzabff6432014-01-27 18:01:39 +010054 if (UNLIKELY(!CheckIsValidIndex(i))) {
55 DCHECK(Thread::Current()->IsExceptionPending());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080056 return NULL;
57 }
Ian Rogersef7d42f2014-01-06 12:55:46 -080058 return GetFieldObject<T>(OffsetOfElement(i), false);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080059}
60
61template<class T>
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020062inline bool ObjectArray<T>::CheckAssignable(T* object) {
63 if (object != NULL) {
64 Class* element_class = GetClass()->GetComponentType();
65 if (UNLIKELY(!object->InstanceOf(element_class))) {
66 ThrowArrayStoreException(object);
67 return false;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080068 }
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020069 }
70 return true;
71}
72
73template<class T>
74inline void ObjectArray<T>::Set(int32_t i, T* object) {
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +010075 if (Runtime::Current()->IsActiveTransaction()) {
76 Set<true>(i, object);
77 } else {
78 Set<false>(i, object);
79 }
80}
81
82template<class T>
83template<bool kTransactionActive, bool kCheckTransaction>
84inline void ObjectArray<T>::Set(int32_t i, T* object) {
Sebastien Hertzabff6432014-01-27 18:01:39 +010085 if (LIKELY(CheckIsValidIndex(i) && CheckAssignable(object))) {
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +010086 SetFieldObject<kTransactionActive, kCheckTransaction>(OffsetOfElement(i), object, false);
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020087 } else {
88 DCHECK(Thread::Current()->IsExceptionPending());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080089 }
90}
91
92template<class T>
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +010093template<bool kTransactionActive, bool kCheckTransaction>
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080094inline void ObjectArray<T>::SetWithoutChecks(int32_t i, T* object) {
Sebastien Hertzabff6432014-01-27 18:01:39 +010095 DCHECK(CheckIsValidIndex(i));
96 DCHECK(CheckAssignable(object));
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +010097 SetFieldObject<kTransactionActive, kCheckTransaction>(OffsetOfElement(i), object, false);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080098}
99
100template<class T>
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +0100101template<bool kTransactionActive, bool kCheckTransaction>
Ian Rogersef7d42f2014-01-06 12:55:46 -0800102inline void ObjectArray<T>::SetWithoutChecksAndWriteBarrier(int32_t i, T* object) {
Sebastien Hertzabff6432014-01-27 18:01:39 +0100103 DCHECK(CheckIsValidIndex(i));
Ian Rogersef7d42f2014-01-06 12:55:46 -0800104 // TODO: enable this check. It fails when writing the image in ImageWriter::FixupObjectArray.
Sebastien Hertzabff6432014-01-27 18:01:39 +0100105 // DCHECK(CheckAssignable(object));
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +0100106 SetFieldObjectWithoutWriteBarrier<kTransactionActive, kCheckTransaction>(OffsetOfElement(i),
107 object, false);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800108}
109
110template<class T>
Ian Rogersef7d42f2014-01-06 12:55:46 -0800111inline T* ObjectArray<T>::GetWithoutChecks(int32_t i) {
Sebastien Hertzabff6432014-01-27 18:01:39 +0100112 DCHECK(CheckIsValidIndex(i));
Ian Rogersef7d42f2014-01-06 12:55:46 -0800113 return GetFieldObject<T>(OffsetOfElement(i), false);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800114}
115
116template<class T>
Ian Rogersef7d42f2014-01-06 12:55:46 -0800117inline void ObjectArray<T>::AssignableMemmove(int32_t dst_pos, ObjectArray<T>* src,
118 int32_t src_pos, int32_t count) {
119 if (kIsDebugBuild) {
120 for (int i = 0; i < count; ++i) {
121 // The Get will perform the VerifyObject.
122 src->GetWithoutChecks(src_pos + i);
123 }
124 }
125 // Perform the memmove using int memmove then perform the write barrier.
126 CHECK_EQ(sizeof(HeapReference<T>), sizeof(uint32_t));
127 IntArray* dstAsIntArray = reinterpret_cast<IntArray*>(this);
128 IntArray* srcAsIntArray = reinterpret_cast<IntArray*>(src);
129 dstAsIntArray->Memmove(dst_pos, srcAsIntArray, src_pos, count);
130 Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count);
131 if (kIsDebugBuild) {
132 for (int i = 0; i < count; ++i) {
133 // The Get will perform the VerifyObject.
134 GetWithoutChecks(dst_pos + i);
135 }
136 }
137}
138
139template<class T>
140inline void ObjectArray<T>::AssignableMemcpy(int32_t dst_pos, ObjectArray<T>* src,
141 int32_t src_pos, int32_t count) {
142 if (kIsDebugBuild) {
143 for (int i = 0; i < count; ++i) {
144 // The Get will perform the VerifyObject.
145 src->GetWithoutChecks(src_pos + i);
146 }
147 }
148 // Perform the memmove using int memcpy then perform the write barrier.
149 CHECK_EQ(sizeof(HeapReference<T>), sizeof(uint32_t));
150 IntArray* dstAsIntArray = reinterpret_cast<IntArray*>(this);
151 IntArray* srcAsIntArray = reinterpret_cast<IntArray*>(src);
152 dstAsIntArray->Memcpy(dst_pos, srcAsIntArray, src_pos, count);
153 Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count);
154 if (kIsDebugBuild) {
155 for (int i = 0; i < count; ++i) {
156 // The Get will perform the VerifyObject.
157 GetWithoutChecks(dst_pos + i);
158 }
159 }
160}
161
162template<class T>
163inline void ObjectArray<T>::AssignableCheckingMemcpy(int32_t dst_pos, ObjectArray<T>* src,
164 int32_t src_pos, int32_t count,
165 bool throw_exception) {
166 DCHECK_NE(this, src)
167 << "This case should be handled with memmove that handles overlaps correctly";
168 // We want to avoid redundant IsAssignableFrom checks where possible, so we cache a class that
169 // we know is assignable to the destination array's component type.
170 Class* dst_class = GetClass()->GetComponentType();
171 Class* lastAssignableElementClass = dst_class;
172
173 Object* o = nullptr;
174 int i = 0;
175 for (; i < count; ++i) {
176 // The follow get operations force the objects to be verified.
177 o = src->GetWithoutChecks(src_pos + i);
178 if (o == nullptr) {
179 // Null is always assignable.
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +0100180 SetWithoutChecks<false>(dst_pos + i, nullptr);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800181 } else {
Ian Rogersef7d42f2014-01-06 12:55:46 -0800182 // TODO: use the underlying class reference to avoid uncompression when not necessary.
183 Class* o_class = o->GetClass();
184 if (LIKELY(lastAssignableElementClass == o_class)) {
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +0100185 SetWithoutChecks<false>(dst_pos + i, o);
Ian Rogersef7d42f2014-01-06 12:55:46 -0800186 } else if (LIKELY(dst_class->IsAssignableFrom(o_class))) {
187 lastAssignableElementClass = o_class;
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +0100188 SetWithoutChecks<false>(dst_pos + i, o);
Ian Rogersef7d42f2014-01-06 12:55:46 -0800189 } else {
190 // Can't put this element into the array, break to perform write-barrier and throw
191 // exception.
192 break;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800193 }
194 }
Ian Rogersef7d42f2014-01-06 12:55:46 -0800195 }
196 Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count);
197 if (UNLIKELY(i != count)) {
198 std::string actualSrcType(PrettyTypeOf(o));
199 std::string dstType(PrettyTypeOf(this));
200 Thread* self = Thread::Current();
201 ThrowLocation throw_location = self->GetCurrentLocationForThrow();
202 if (throw_exception) {
203 self->ThrowNewExceptionF(throw_location, "Ljava/lang/ArrayStoreException;",
204 "source[%d] of type %s cannot be stored in destination array of type %s",
205 src_pos + i, actualSrcType.c_str(), dstType.c_str());
206 } else {
207 LOG(FATAL) << StringPrintf("source[%d] of type %s cannot be stored in destination array of type %s",
208 src_pos + i, actualSrcType.c_str(), dstType.c_str());
209 }
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800210 }
211}
212
213template<class T>
214inline ObjectArray<T>* ObjectArray<T>::CopyOf(Thread* self, int32_t new_length) {
Ian Rogersef7d42f2014-01-06 12:55:46 -0800215 DCHECK_GE(new_length, 0);
Mathieu Chartier590fee92013-09-13 13:46:47 -0700216 // We may get copied by a compacting GC.
217 SirtRef<ObjectArray<T> > sirt_this(self, this);
Mathieu Chartiercbb2d202013-11-14 17:45:16 -0800218 gc::Heap* heap = Runtime::Current()->GetHeap();
219 gc::AllocatorType allocator_type = heap->IsMovableObject(this) ? heap->GetCurrentAllocator() :
220 heap->GetCurrentNonMovingAllocator();
221 ObjectArray<T>* new_array = Alloc(self, GetClass(), new_length, allocator_type);
Mathieu Chartier590fee92013-09-13 13:46:47 -0700222 if (LIKELY(new_array != nullptr)) {
Ian Rogersef7d42f2014-01-06 12:55:46 -0800223 new_array->AssignableMemcpy(0, sirt_this.get(), 0, std::min(sirt_this->GetLength(), new_length));
Ian Rogersa436fde2013-08-27 23:34:06 -0700224 }
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800225 return new_array;
226}
227
Ian Rogersef7d42f2014-01-06 12:55:46 -0800228template<class T>
229inline MemberOffset ObjectArray<T>::OffsetOfElement(int32_t i) {
230 return MemberOffset(DataOffset(sizeof(HeapReference<Object>)).Int32Value() +
231 (i * sizeof(HeapReference<Object>)));
232}
233
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800234} // namespace mirror
235} // namespace art
236
Brian Carlstromfc0e3212013-07-17 14:40:12 -0700237#endif // ART_RUNTIME_MIRROR_OBJECT_ARRAY_INL_H_