blob: bef4af617a471f01ce15df66c6d514b7c324d392 [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
Vladimir Marko80afd022015-05-19 18:08:00 +010020#include <string>
21
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080022#include "object_array.h"
23
Ian Rogers7e70b002014-10-08 11:47:24 -070024#include "array-inl.h"
Ian Rogers576ca0c2014-06-06 15:58:22 -070025#include "base/stringprintf.h"
Ian Rogers1d54e732013-05-02 21:10:01 -070026#include "gc/heap.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080027#include "mirror/class.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080028#include "runtime.h"
Mathieu Chartiereb8167a2014-05-07 15:43:14 -070029#include "handle_scope-inl.h"
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020030#include "thread.h"
Vladimir Marko80afd022015-05-19 18:08:00 +010031#include "utils.h"
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080032
33namespace art {
34namespace mirror {
35
36template<class T>
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080037inline ObjectArray<T>* ObjectArray<T>::Alloc(Thread* self, Class* object_array_class,
38 int32_t length, gc::AllocatorType allocator_type) {
Ian Rogersef7d42f2014-01-06 12:55:46 -080039 Array* array = Array::Alloc<true>(self, object_array_class, length,
Mathieu Chartierc7853442015-03-27 14:35:38 -070040 ComponentSizeShiftWidth(sizeof(HeapReference<Object>)),
Hiroshi Yamauchif0edfc32014-09-25 11:46:46 -070041 allocator_type);
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080042 if (UNLIKELY(array == nullptr)) {
43 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080044 } else {
Hiroshi Yamauchif0edfc32014-09-25 11:46:46 -070045 DCHECK_EQ(array->GetClass()->GetComponentSizeShift(),
Mathieu Chartierc7853442015-03-27 14:35:38 -070046 ComponentSizeShiftWidth(sizeof(HeapReference<Object>)));
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080047 return array->AsObjectArray<T>();
48 }
49}
50
51template<class T>
Mathieu Chartiercbb2d202013-11-14 17:45:16 -080052inline ObjectArray<T>* ObjectArray<T>::Alloc(Thread* self, Class* object_array_class,
53 int32_t length) {
54 return Alloc(self, object_array_class, length,
55 Runtime::Current()->GetHeap()->GetCurrentAllocator());
56}
57
58template<class T>
Ian Rogersef7d42f2014-01-06 12:55:46 -080059inline T* ObjectArray<T>::Get(int32_t i) {
Ian Rogersb0fa5dc2014-04-28 16:47:08 -070060 if (!CheckIsValidIndex(i)) {
Sebastien Hertzabff6432014-01-27 18:01:39 +010061 DCHECK(Thread::Current()->IsExceptionPending());
Mathieu Chartier2cebb242015-04-21 16:50:40 -070062 return nullptr;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080063 }
Ian Rogersb0fa5dc2014-04-28 16:47:08 -070064 return GetFieldObject<T>(OffsetOfElement(i));
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080065}
66
Mathieu Chartier4e305412014-02-19 10:54:44 -080067template<class T> template<VerifyObjectFlags kVerifyFlags>
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020068inline bool ObjectArray<T>::CheckAssignable(T* object) {
Mathieu Chartier2cebb242015-04-21 16:50:40 -070069 if (object != nullptr) {
Mathieu Chartier4e305412014-02-19 10:54:44 -080070 Class* element_class = GetClass<kVerifyFlags>()->GetComponentType();
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020071 if (UNLIKELY(!object->InstanceOf(element_class))) {
72 ThrowArrayStoreException(object);
73 return false;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080074 }
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020075 }
76 return true;
77}
78
79template<class T>
80inline void ObjectArray<T>::Set(int32_t i, T* object) {
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +010081 if (Runtime::Current()->IsActiveTransaction()) {
82 Set<true>(i, object);
83 } else {
84 Set<false>(i, object);
85 }
86}
87
88template<class T>
Mathieu Chartier4e305412014-02-19 10:54:44 -080089template<bool kTransactionActive, bool kCheckTransaction, VerifyObjectFlags kVerifyFlags>
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +010090inline void ObjectArray<T>::Set(int32_t i, T* object) {
Ian Rogersb0fa5dc2014-04-28 16:47:08 -070091 if (CheckIsValidIndex(i) && CheckAssignable<kVerifyFlags>(object)) {
92 SetFieldObject<kTransactionActive, kCheckTransaction, kVerifyFlags>(OffsetOfElement(i), object);
Sebastien Hertz6bdd8f42013-05-17 14:44:01 +020093 } else {
94 DCHECK(Thread::Current()->IsExceptionPending());
Ian Rogers2dd0e2c2013-01-24 12:42:14 -080095 }
96}
97
98template<class T>
Mathieu Chartier4e305412014-02-19 10:54:44 -080099template<bool kTransactionActive, bool kCheckTransaction, VerifyObjectFlags kVerifyFlags>
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800100inline void ObjectArray<T>::SetWithoutChecks(int32_t i, T* object) {
Mathieu Chartier4e305412014-02-19 10:54:44 -0800101 DCHECK(CheckIsValidIndex<kVerifyFlags>(i));
102 DCHECK(CheckAssignable<static_cast<VerifyObjectFlags>(kVerifyFlags & ~kVerifyThis)>(object));
Ian Rogersb0fa5dc2014-04-28 16:47:08 -0700103 SetFieldObject<kTransactionActive, kCheckTransaction, kVerifyFlags>(OffsetOfElement(i), object);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800104}
105
106template<class T>
Mathieu Chartier4e305412014-02-19 10:54:44 -0800107template<bool kTransactionActive, bool kCheckTransaction, VerifyObjectFlags kVerifyFlags>
Ian Rogersef7d42f2014-01-06 12:55:46 -0800108inline void ObjectArray<T>::SetWithoutChecksAndWriteBarrier(int32_t i, T* object) {
Mathieu Chartier4e305412014-02-19 10:54:44 -0800109 DCHECK(CheckIsValidIndex<kVerifyFlags>(i));
Ian Rogersef7d42f2014-01-06 12:55:46 -0800110 // TODO: enable this check. It fails when writing the image in ImageWriter::FixupObjectArray.
Sebastien Hertzabff6432014-01-27 18:01:39 +0100111 // DCHECK(CheckAssignable(object));
Mathieu Chartier4e305412014-02-19 10:54:44 -0800112 SetFieldObjectWithoutWriteBarrier<kTransactionActive, kCheckTransaction, kVerifyFlags>(
Ian Rogersb0fa5dc2014-04-28 16:47:08 -0700113 OffsetOfElement(i), object);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800114}
115
116template<class T>
Ian Rogersef7d42f2014-01-06 12:55:46 -0800117inline T* ObjectArray<T>::GetWithoutChecks(int32_t i) {
Sebastien Hertzabff6432014-01-27 18:01:39 +0100118 DCHECK(CheckIsValidIndex(i));
Ian Rogersb0fa5dc2014-04-28 16:47:08 -0700119 return GetFieldObject<T>(OffsetOfElement(i));
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800120}
121
122template<class T>
Ian Rogersef7d42f2014-01-06 12:55:46 -0800123inline void ObjectArray<T>::AssignableMemmove(int32_t dst_pos, ObjectArray<T>* src,
124 int32_t src_pos, int32_t count) {
125 if (kIsDebugBuild) {
126 for (int i = 0; i < count; ++i) {
Mathieu Chartiereb8167a2014-05-07 15:43:14 -0700127 // The get will perform the VerifyObject.
Ian Rogersef7d42f2014-01-06 12:55:46 -0800128 src->GetWithoutChecks(src_pos + i);
129 }
130 }
131 // Perform the memmove using int memmove then perform the write barrier.
132 CHECK_EQ(sizeof(HeapReference<T>), sizeof(uint32_t));
133 IntArray* dstAsIntArray = reinterpret_cast<IntArray*>(this);
134 IntArray* srcAsIntArray = reinterpret_cast<IntArray*>(src);
Hiroshi Yamauchi2cd334a2015-01-09 14:03:35 -0800135 if (kUseReadBarrier) {
Hiroshi Yamauchi79719282014-04-10 12:46:22 -0700136 // TODO: Optimize this later?
137 const bool copy_forward = (src != this) || (dst_pos < src_pos) || (dst_pos - src_pos >= count);
138 if (copy_forward) {
139 // Forward copy.
140 for (int i = 0; i < count; ++i) {
141 // We need a RB here. ObjectArray::GetWithoutChecks() contains a RB.
142 Object* obj = src->GetWithoutChecks(src_pos + i);
143 SetWithoutChecks<false>(dst_pos + i, obj);
144 }
145 } else {
146 // Backward copy.
147 for (int i = count - 1; i >= 0; --i) {
148 // We need a RB here. ObjectArray::GetWithoutChecks() contains a RB.
149 Object* obj = src->GetWithoutChecks(src_pos + i);
150 SetWithoutChecks<false>(dst_pos + i, obj);
151 }
152 }
153 } else {
154 dstAsIntArray->Memmove(dst_pos, srcAsIntArray, src_pos, count);
155 }
Ian Rogersef7d42f2014-01-06 12:55:46 -0800156 Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count);
157 if (kIsDebugBuild) {
158 for (int i = 0; i < count; ++i) {
Mathieu Chartiereb8167a2014-05-07 15:43:14 -0700159 // The get will perform the VerifyObject.
Ian Rogersef7d42f2014-01-06 12:55:46 -0800160 GetWithoutChecks(dst_pos + i);
161 }
162 }
163}
164
165template<class T>
166inline void ObjectArray<T>::AssignableMemcpy(int32_t dst_pos, ObjectArray<T>* src,
167 int32_t src_pos, int32_t count) {
168 if (kIsDebugBuild) {
169 for (int i = 0; i < count; ++i) {
Mathieu Chartiereb8167a2014-05-07 15:43:14 -0700170 // The get will perform the VerifyObject.
Ian Rogersef7d42f2014-01-06 12:55:46 -0800171 src->GetWithoutChecks(src_pos + i);
172 }
173 }
174 // Perform the memmove using int memcpy then perform the write barrier.
175 CHECK_EQ(sizeof(HeapReference<T>), sizeof(uint32_t));
176 IntArray* dstAsIntArray = reinterpret_cast<IntArray*>(this);
177 IntArray* srcAsIntArray = reinterpret_cast<IntArray*>(src);
Hiroshi Yamauchi2cd334a2015-01-09 14:03:35 -0800178 if (kUseReadBarrier) {
Hiroshi Yamauchi79719282014-04-10 12:46:22 -0700179 // TODO: Optimize this later?
180 for (int i = 0; i < count; ++i) {
181 // We need a RB here. ObjectArray::GetWithoutChecks() contains a RB.
182 T* obj = src->GetWithoutChecks(src_pos + i);
183 SetWithoutChecks<false>(dst_pos + i, obj);
184 }
185 } else {
186 dstAsIntArray->Memcpy(dst_pos, srcAsIntArray, src_pos, count);
187 }
Ian Rogersef7d42f2014-01-06 12:55:46 -0800188 Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count);
189 if (kIsDebugBuild) {
190 for (int i = 0; i < count; ++i) {
Mathieu Chartiereb8167a2014-05-07 15:43:14 -0700191 // The get will perform the VerifyObject.
Ian Rogersef7d42f2014-01-06 12:55:46 -0800192 GetWithoutChecks(dst_pos + i);
193 }
194 }
195}
196
197template<class T>
198inline void ObjectArray<T>::AssignableCheckingMemcpy(int32_t dst_pos, ObjectArray<T>* src,
199 int32_t src_pos, int32_t count,
200 bool throw_exception) {
201 DCHECK_NE(this, src)
202 << "This case should be handled with memmove that handles overlaps correctly";
203 // We want to avoid redundant IsAssignableFrom checks where possible, so we cache a class that
204 // we know is assignable to the destination array's component type.
205 Class* dst_class = GetClass()->GetComponentType();
206 Class* lastAssignableElementClass = dst_class;
207
208 Object* o = nullptr;
209 int i = 0;
210 for (; i < count; ++i) {
211 // The follow get operations force the objects to be verified.
Hiroshi Yamauchi79719282014-04-10 12:46:22 -0700212 // We need a RB here. ObjectArray::GetWithoutChecks() contains a RB.
Ian Rogersef7d42f2014-01-06 12:55:46 -0800213 o = src->GetWithoutChecks(src_pos + i);
214 if (o == nullptr) {
215 // Null is always assignable.
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +0100216 SetWithoutChecks<false>(dst_pos + i, nullptr);
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800217 } else {
Ian Rogersef7d42f2014-01-06 12:55:46 -0800218 // TODO: use the underlying class reference to avoid uncompression when not necessary.
219 Class* o_class = o->GetClass();
220 if (LIKELY(lastAssignableElementClass == o_class)) {
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +0100221 SetWithoutChecks<false>(dst_pos + i, o);
Ian Rogersef7d42f2014-01-06 12:55:46 -0800222 } else if (LIKELY(dst_class->IsAssignableFrom(o_class))) {
223 lastAssignableElementClass = o_class;
Sebastien Hertzd2fe10a2014-01-15 10:20:56 +0100224 SetWithoutChecks<false>(dst_pos + i, o);
Ian Rogersef7d42f2014-01-06 12:55:46 -0800225 } else {
226 // Can't put this element into the array, break to perform write-barrier and throw
227 // exception.
228 break;
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800229 }
230 }
Ian Rogersef7d42f2014-01-06 12:55:46 -0800231 }
232 Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count);
233 if (UNLIKELY(i != count)) {
234 std::string actualSrcType(PrettyTypeOf(o));
235 std::string dstType(PrettyTypeOf(this));
236 Thread* self = Thread::Current();
Ian Rogersef7d42f2014-01-06 12:55:46 -0800237 if (throw_exception) {
Nicolas Geoffray0aa50ce2015-03-10 11:03:29 +0000238 self->ThrowNewExceptionF("Ljava/lang/ArrayStoreException;",
Ian Rogersef7d42f2014-01-06 12:55:46 -0800239 "source[%d] of type %s cannot be stored in destination array of type %s",
240 src_pos + i, actualSrcType.c_str(), dstType.c_str());
241 } else {
242 LOG(FATAL) << StringPrintf("source[%d] of type %s cannot be stored in destination array of type %s",
243 src_pos + i, actualSrcType.c_str(), dstType.c_str());
244 }
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800245 }
246}
247
248template<class T>
249inline ObjectArray<T>* ObjectArray<T>::CopyOf(Thread* self, int32_t new_length) {
Ian Rogersef7d42f2014-01-06 12:55:46 -0800250 DCHECK_GE(new_length, 0);
Mathieu Chartier590fee92013-09-13 13:46:47 -0700251 // We may get copied by a compacting GC.
Mathieu Chartiereb8167a2014-05-07 15:43:14 -0700252 StackHandleScope<1> hs(self);
Ian Rogers700a4022014-05-19 16:49:03 -0700253 Handle<ObjectArray<T>> h_this(hs.NewHandle(this));
Mathieu Chartiercbb2d202013-11-14 17:45:16 -0800254 gc::Heap* heap = Runtime::Current()->GetHeap();
255 gc::AllocatorType allocator_type = heap->IsMovableObject(this) ? heap->GetCurrentAllocator() :
256 heap->GetCurrentNonMovingAllocator();
257 ObjectArray<T>* new_array = Alloc(self, GetClass(), new_length, allocator_type);
Mathieu Chartier590fee92013-09-13 13:46:47 -0700258 if (LIKELY(new_array != nullptr)) {
Mathieu Chartiereb8167a2014-05-07 15:43:14 -0700259 new_array->AssignableMemcpy(0, h_this.Get(), 0, std::min(h_this->GetLength(), new_length));
Ian Rogersa436fde2013-08-27 23:34:06 -0700260 }
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800261 return new_array;
262}
263
Ian Rogersef7d42f2014-01-06 12:55:46 -0800264template<class T>
265inline MemberOffset ObjectArray<T>::OffsetOfElement(int32_t i) {
266 return MemberOffset(DataOffset(sizeof(HeapReference<Object>)).Int32Value() +
267 (i * sizeof(HeapReference<Object>)));
268}
269
Mathieu Chartier407f7022014-02-18 14:37:05 -0800270template<class T> template<const bool kVisitClass, typename Visitor>
271void ObjectArray<T>::VisitReferences(const Visitor& visitor) {
272 if (kVisitClass) {
273 visitor(this, ClassOffset(), false);
274 }
275 const size_t length = static_cast<size_t>(GetLength());
276 for (size_t i = 0; i < length; ++i) {
277 visitor(this, OffsetOfElement(i), false);
278 }
279}
280
Ian Rogers2dd0e2c2013-01-24 12:42:14 -0800281} // namespace mirror
282} // namespace art
283
Brian Carlstromfc0e3212013-07-17 14:40:12 -0700284#endif // ART_RUNTIME_MIRROR_OBJECT_ARRAY_INL_H_