Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1 | /* |
| 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 Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 17 | #ifndef ART_RUNTIME_MIRROR_OBJECT_ARRAY_INL_H_ |
| 18 | #define ART_RUNTIME_MIRROR_OBJECT_ARRAY_INL_H_ |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 19 | |
| 20 | #include "object_array.h" |
| 21 | |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 22 | #include <string> |
| 23 | |
| 24 | #include "android-base/stringprintf.h" |
| 25 | |
Ian Rogers | 7e70b00 | 2014-10-08 11:47:24 -0700 | [diff] [blame] | 26 | #include "array-inl.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 27 | #include "gc/heap.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 28 | #include "mirror/class.h" |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 29 | #include "obj_ptr-inl.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 30 | #include "runtime.h" |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 31 | #include "handle_scope-inl.h" |
Sebastien Hertz | 6bdd8f4 | 2013-05-17 14:44:01 +0200 | [diff] [blame] | 32 | #include "thread.h" |
Vladimir Marko | 80afd02 | 2015-05-19 18:08:00 +0100 | [diff] [blame] | 33 | #include "utils.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 34 | |
| 35 | namespace art { |
| 36 | namespace mirror { |
| 37 | |
| 38 | template<class T> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 39 | inline ObjectArray<T>* ObjectArray<T>::Alloc(Thread* self, |
| 40 | ObjPtr<Class> object_array_class, |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 41 | int32_t length, gc::AllocatorType allocator_type) { |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 42 | Array* array = Array::Alloc<true>(self, |
| 43 | object_array_class.Ptr(), |
| 44 | length, |
| 45 | ComponentSizeShiftWidth(kHeapReferenceSize), |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 46 | allocator_type); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 47 | if (UNLIKELY(array == nullptr)) { |
| 48 | return nullptr; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 49 | } |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 50 | DCHECK_EQ(array->GetClass()->GetComponentSizeShift(), |
| 51 | ComponentSizeShiftWidth(kHeapReferenceSize)); |
| 52 | return array->AsObjectArray<T>(); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 53 | } |
| 54 | |
| 55 | template<class T> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 56 | inline ObjectArray<T>* ObjectArray<T>::Alloc(Thread* self, |
| 57 | ObjPtr<Class> object_array_class, |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 58 | int32_t length) { |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 59 | return Alloc(self, |
| 60 | object_array_class, |
| 61 | length, |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 62 | Runtime::Current()->GetHeap()->GetCurrentAllocator()); |
| 63 | } |
| 64 | |
Mathieu Chartier | fbc3108 | 2016-01-24 11:59:56 -0800 | [diff] [blame] | 65 | template<class T> template<VerifyObjectFlags kVerifyFlags, ReadBarrierOption kReadBarrierOption> |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 66 | inline T* ObjectArray<T>::Get(int32_t i) { |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 67 | if (!CheckIsValidIndex(i)) { |
Sebastien Hertz | abff643 | 2014-01-27 18:01:39 +0100 | [diff] [blame] | 68 | DCHECK(Thread::Current()->IsExceptionPending()); |
Mathieu Chartier | 2cebb24 | 2015-04-21 16:50:40 -0700 | [diff] [blame] | 69 | return nullptr; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 70 | } |
Mathieu Chartier | fbc3108 | 2016-01-24 11:59:56 -0800 | [diff] [blame] | 71 | return GetFieldObject<T, kVerifyFlags, kReadBarrierOption>(OffsetOfElement(i)); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 72 | } |
| 73 | |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 74 | template<class T> template<VerifyObjectFlags kVerifyFlags> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 75 | inline bool ObjectArray<T>::CheckAssignable(ObjPtr<T> object) { |
Mathieu Chartier | 2cebb24 | 2015-04-21 16:50:40 -0700 | [diff] [blame] | 76 | if (object != nullptr) { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 77 | Class* element_class = GetClass<kVerifyFlags>()->GetComponentType(); |
Sebastien Hertz | 6bdd8f4 | 2013-05-17 14:44:01 +0200 | [diff] [blame] | 78 | if (UNLIKELY(!object->InstanceOf(element_class))) { |
| 79 | ThrowArrayStoreException(object); |
| 80 | return false; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 81 | } |
Sebastien Hertz | 6bdd8f4 | 2013-05-17 14:44:01 +0200 | [diff] [blame] | 82 | } |
| 83 | return true; |
| 84 | } |
| 85 | |
| 86 | template<class T> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 87 | inline void ObjectArray<T>::Set(int32_t i, ObjPtr<T> object) { |
Sebastien Hertz | d2fe10a | 2014-01-15 10:20:56 +0100 | [diff] [blame] | 88 | if (Runtime::Current()->IsActiveTransaction()) { |
| 89 | Set<true>(i, object); |
| 90 | } else { |
| 91 | Set<false>(i, object); |
| 92 | } |
| 93 | } |
| 94 | |
| 95 | template<class T> |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 96 | template<bool kTransactionActive, bool kCheckTransaction, VerifyObjectFlags kVerifyFlags> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 97 | inline void ObjectArray<T>::Set(int32_t i, ObjPtr<T> object) { |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 98 | if (CheckIsValidIndex(i) && CheckAssignable<kVerifyFlags>(object)) { |
| 99 | SetFieldObject<kTransactionActive, kCheckTransaction, kVerifyFlags>(OffsetOfElement(i), object); |
Sebastien Hertz | 6bdd8f4 | 2013-05-17 14:44:01 +0200 | [diff] [blame] | 100 | } else { |
| 101 | DCHECK(Thread::Current()->IsExceptionPending()); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 102 | } |
| 103 | } |
| 104 | |
| 105 | template<class T> |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 106 | template<bool kTransactionActive, bool kCheckTransaction, VerifyObjectFlags kVerifyFlags> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 107 | inline void ObjectArray<T>::SetWithoutChecks(int32_t i, ObjPtr<T> object) { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 108 | DCHECK(CheckIsValidIndex<kVerifyFlags>(i)); |
| 109 | DCHECK(CheckAssignable<static_cast<VerifyObjectFlags>(kVerifyFlags & ~kVerifyThis)>(object)); |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 110 | SetFieldObject<kTransactionActive, kCheckTransaction, kVerifyFlags>(OffsetOfElement(i), object); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 111 | } |
| 112 | |
| 113 | template<class T> |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 114 | template<bool kTransactionActive, bool kCheckTransaction, VerifyObjectFlags kVerifyFlags> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 115 | inline void ObjectArray<T>::SetWithoutChecksAndWriteBarrier(int32_t i, ObjPtr<T> object) { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 116 | DCHECK(CheckIsValidIndex<kVerifyFlags>(i)); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 117 | // TODO: enable this check. It fails when writing the image in ImageWriter::FixupObjectArray. |
Sebastien Hertz | abff643 | 2014-01-27 18:01:39 +0100 | [diff] [blame] | 118 | // DCHECK(CheckAssignable(object)); |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 119 | SetFieldObjectWithoutWriteBarrier<kTransactionActive, kCheckTransaction, kVerifyFlags>( |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 120 | OffsetOfElement(i), object); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 121 | } |
| 122 | |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 123 | template<class T> template<VerifyObjectFlags kVerifyFlags, ReadBarrierOption kReadBarrierOption> |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 124 | inline T* ObjectArray<T>::GetWithoutChecks(int32_t i) { |
Sebastien Hertz | abff643 | 2014-01-27 18:01:39 +0100 | [diff] [blame] | 125 | DCHECK(CheckIsValidIndex(i)); |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 126 | return GetFieldObject<T, kVerifyFlags, kReadBarrierOption>(OffsetOfElement(i)); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 127 | } |
| 128 | |
| 129 | template<class T> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 130 | inline void ObjectArray<T>::AssignableMemmove(int32_t dst_pos, |
| 131 | ObjPtr<ObjectArray<T>> src, |
| 132 | int32_t src_pos, |
| 133 | int32_t count) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 134 | if (kIsDebugBuild) { |
| 135 | for (int i = 0; i < count; ++i) { |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 136 | // The get will perform the VerifyObject. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 137 | src->GetWithoutChecks(src_pos + i); |
| 138 | } |
| 139 | } |
| 140 | // Perform the memmove using int memmove then perform the write barrier. |
Roland Levillain | 33d6903 | 2015-06-18 18:20:59 +0100 | [diff] [blame] | 141 | static_assert(sizeof(HeapReference<T>) == sizeof(uint32_t), |
| 142 | "art::mirror::HeapReference<T> and uint32_t have different sizes."); |
Mathieu Chartier | fec13d4 | 2016-10-07 12:59:33 -0700 | [diff] [blame] | 143 | // TODO: Optimize this later? |
| 144 | // We can't use memmove since it does not handle read barriers and may do by per byte copying. |
| 145 | // See b/32012820. |
| 146 | const bool copy_forward = (src != this) || (dst_pos < src_pos) || (dst_pos - src_pos >= count); |
| 147 | if (copy_forward) { |
| 148 | // Forward copy. |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 149 | bool baker_non_gray_case = false; |
| 150 | if (kUseReadBarrier && kUseBakerReadBarrier) { |
| 151 | uintptr_t fake_address_dependency; |
| 152 | if (!ReadBarrier::IsGray(src.Ptr(), &fake_address_dependency)) { |
| 153 | baker_non_gray_case = true; |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 154 | DCHECK_EQ(fake_address_dependency, 0U); |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 155 | src.Assign(reinterpret_cast<ObjectArray<T>*>( |
| 156 | reinterpret_cast<uintptr_t>(src.Ptr()) | fake_address_dependency)); |
| 157 | for (int i = 0; i < count; ++i) { |
| 158 | // We can skip the RB here because 'src' isn't gray. |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 159 | T* obj = src->template GetWithoutChecks<kDefaultVerifyFlags, kWithoutReadBarrier>( |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 160 | src_pos + i); |
| 161 | SetWithoutChecksAndWriteBarrier<false>(dst_pos + i, obj); |
| 162 | } |
| 163 | } |
| 164 | } |
| 165 | if (!baker_non_gray_case) { |
| 166 | for (int i = 0; i < count; ++i) { |
| 167 | // We need a RB here. ObjectArray::GetWithoutChecks() contains a RB. |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 168 | T* obj = src->GetWithoutChecks(src_pos + i); |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 169 | SetWithoutChecksAndWriteBarrier<false>(dst_pos + i, obj); |
| 170 | } |
Hiroshi Yamauchi | 7971928 | 2014-04-10 12:46:22 -0700 | [diff] [blame] | 171 | } |
| 172 | } else { |
Mathieu Chartier | fec13d4 | 2016-10-07 12:59:33 -0700 | [diff] [blame] | 173 | // Backward copy. |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 174 | bool baker_non_gray_case = false; |
| 175 | if (kUseReadBarrier && kUseBakerReadBarrier) { |
| 176 | uintptr_t fake_address_dependency; |
| 177 | if (!ReadBarrier::IsGray(src.Ptr(), &fake_address_dependency)) { |
| 178 | baker_non_gray_case = true; |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 179 | DCHECK_EQ(fake_address_dependency, 0U); |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 180 | src.Assign(reinterpret_cast<ObjectArray<T>*>( |
| 181 | reinterpret_cast<uintptr_t>(src.Ptr()) | fake_address_dependency)); |
| 182 | for (int i = count - 1; i >= 0; --i) { |
| 183 | // We can skip the RB here because 'src' isn't gray. |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 184 | T* obj = src->template GetWithoutChecks<kDefaultVerifyFlags, kWithoutReadBarrier>( |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 185 | src_pos + i); |
| 186 | SetWithoutChecksAndWriteBarrier<false>(dst_pos + i, obj); |
| 187 | } |
| 188 | } |
| 189 | } |
| 190 | if (!baker_non_gray_case) { |
| 191 | for (int i = count - 1; i >= 0; --i) { |
| 192 | // We need a RB here. ObjectArray::GetWithoutChecks() contains a RB. |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 193 | T* obj = src->GetWithoutChecks(src_pos + i); |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 194 | SetWithoutChecksAndWriteBarrier<false>(dst_pos + i, obj); |
| 195 | } |
Mathieu Chartier | fec13d4 | 2016-10-07 12:59:33 -0700 | [diff] [blame] | 196 | } |
Hiroshi Yamauchi | 7971928 | 2014-04-10 12:46:22 -0700 | [diff] [blame] | 197 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 198 | Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count); |
| 199 | if (kIsDebugBuild) { |
| 200 | for (int i = 0; i < count; ++i) { |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 201 | // The get will perform the VerifyObject. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 202 | GetWithoutChecks(dst_pos + i); |
| 203 | } |
| 204 | } |
| 205 | } |
| 206 | |
| 207 | template<class T> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 208 | inline void ObjectArray<T>::AssignableMemcpy(int32_t dst_pos, |
| 209 | ObjPtr<ObjectArray<T>> src, |
| 210 | int32_t src_pos, |
| 211 | int32_t count) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 212 | if (kIsDebugBuild) { |
| 213 | for (int i = 0; i < count; ++i) { |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 214 | // The get will perform the VerifyObject. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 215 | src->GetWithoutChecks(src_pos + i); |
| 216 | } |
| 217 | } |
| 218 | // Perform the memmove using int memcpy then perform the write barrier. |
Roland Levillain | 33d6903 | 2015-06-18 18:20:59 +0100 | [diff] [blame] | 219 | static_assert(sizeof(HeapReference<T>) == sizeof(uint32_t), |
| 220 | "art::mirror::HeapReference<T> and uint32_t have different sizes."); |
Mathieu Chartier | fec13d4 | 2016-10-07 12:59:33 -0700 | [diff] [blame] | 221 | // TODO: Optimize this later? |
| 222 | // We can't use memmove since it does not handle read barriers and may do by per byte copying. |
| 223 | // See b/32012820. |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 224 | bool baker_non_gray_case = false; |
| 225 | if (kUseReadBarrier && kUseBakerReadBarrier) { |
| 226 | uintptr_t fake_address_dependency; |
| 227 | if (!ReadBarrier::IsGray(src.Ptr(), &fake_address_dependency)) { |
| 228 | baker_non_gray_case = true; |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 229 | DCHECK_EQ(fake_address_dependency, 0U); |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 230 | src.Assign(reinterpret_cast<ObjectArray<T>*>( |
| 231 | reinterpret_cast<uintptr_t>(src.Ptr()) | fake_address_dependency)); |
| 232 | for (int i = 0; i < count; ++i) { |
| 233 | // We can skip the RB here because 'src' isn't gray. |
| 234 | Object* obj = src->template GetWithoutChecks<kDefaultVerifyFlags, kWithoutReadBarrier>( |
| 235 | src_pos + i); |
| 236 | SetWithoutChecksAndWriteBarrier<false>(dst_pos + i, obj); |
| 237 | } |
| 238 | } |
| 239 | } |
| 240 | if (!baker_non_gray_case) { |
| 241 | for (int i = 0; i < count; ++i) { |
| 242 | // We need a RB here. ObjectArray::GetWithoutChecks() contains a RB. |
| 243 | T* obj = src->GetWithoutChecks(src_pos + i); |
| 244 | SetWithoutChecksAndWriteBarrier<false>(dst_pos + i, obj); |
| 245 | } |
Hiroshi Yamauchi | 7971928 | 2014-04-10 12:46:22 -0700 | [diff] [blame] | 246 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 247 | Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count); |
| 248 | if (kIsDebugBuild) { |
| 249 | for (int i = 0; i < count; ++i) { |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 250 | // The get will perform the VerifyObject. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 251 | GetWithoutChecks(dst_pos + i); |
| 252 | } |
| 253 | } |
| 254 | } |
| 255 | |
| 256 | template<class T> |
Andreas Gampe | 85a098a | 2016-03-31 13:30:53 -0700 | [diff] [blame] | 257 | template<bool kTransactionActive> |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 258 | inline void ObjectArray<T>::AssignableCheckingMemcpy(int32_t dst_pos, |
| 259 | ObjPtr<ObjectArray<T>> src, |
| 260 | int32_t src_pos, |
| 261 | int32_t count, |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 262 | bool throw_exception) { |
| 263 | DCHECK_NE(this, src) |
| 264 | << "This case should be handled with memmove that handles overlaps correctly"; |
| 265 | // We want to avoid redundant IsAssignableFrom checks where possible, so we cache a class that |
| 266 | // we know is assignable to the destination array's component type. |
| 267 | Class* dst_class = GetClass()->GetComponentType(); |
| 268 | Class* lastAssignableElementClass = dst_class; |
| 269 | |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 270 | T* o = nullptr; |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 271 | int i = 0; |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 272 | bool baker_non_gray_case = false; |
| 273 | if (kUseReadBarrier && kUseBakerReadBarrier) { |
| 274 | uintptr_t fake_address_dependency; |
| 275 | if (!ReadBarrier::IsGray(src.Ptr(), &fake_address_dependency)) { |
| 276 | baker_non_gray_case = true; |
Hiroshi Yamauchi | 6013f77 | 2016-11-16 13:30:17 -0800 | [diff] [blame] | 277 | DCHECK_EQ(fake_address_dependency, 0U); |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 278 | src.Assign(reinterpret_cast<ObjectArray<T>*>( |
| 279 | reinterpret_cast<uintptr_t>(src.Ptr()) | fake_address_dependency)); |
| 280 | for (; i < count; ++i) { |
| 281 | // The follow get operations force the objects to be verified. |
| 282 | // We can skip the RB here because 'src' isn't gray. |
| 283 | o = src->template GetWithoutChecks<kDefaultVerifyFlags, kWithoutReadBarrier>( |
| 284 | src_pos + i); |
| 285 | if (o == nullptr) { |
| 286 | // Null is always assignable. |
| 287 | SetWithoutChecks<kTransactionActive>(dst_pos + i, nullptr); |
| 288 | } else { |
| 289 | // TODO: use the underlying class reference to avoid uncompression when not necessary. |
| 290 | Class* o_class = o->GetClass(); |
| 291 | if (LIKELY(lastAssignableElementClass == o_class)) { |
| 292 | SetWithoutChecks<kTransactionActive>(dst_pos + i, o); |
| 293 | } else if (LIKELY(dst_class->IsAssignableFrom(o_class))) { |
| 294 | lastAssignableElementClass = o_class; |
| 295 | SetWithoutChecks<kTransactionActive>(dst_pos + i, o); |
| 296 | } else { |
| 297 | // Can't put this element into the array, break to perform write-barrier and throw |
| 298 | // exception. |
| 299 | break; |
| 300 | } |
| 301 | } |
| 302 | } |
| 303 | } |
| 304 | } |
| 305 | if (!baker_non_gray_case) { |
| 306 | for (; i < count; ++i) { |
| 307 | // The follow get operations force the objects to be verified. |
| 308 | // We need a RB here. ObjectArray::GetWithoutChecks() contains a RB. |
| 309 | o = src->GetWithoutChecks(src_pos + i); |
| 310 | if (o == nullptr) { |
| 311 | // Null is always assignable. |
| 312 | SetWithoutChecks<kTransactionActive>(dst_pos + i, nullptr); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 313 | } else { |
Hiroshi Yamauchi | e43b80e | 2016-11-14 13:42:50 -0800 | [diff] [blame] | 314 | // TODO: use the underlying class reference to avoid uncompression when not necessary. |
| 315 | Class* o_class = o->GetClass(); |
| 316 | if (LIKELY(lastAssignableElementClass == o_class)) { |
| 317 | SetWithoutChecks<kTransactionActive>(dst_pos + i, o); |
| 318 | } else if (LIKELY(dst_class->IsAssignableFrom(o_class))) { |
| 319 | lastAssignableElementClass = o_class; |
| 320 | SetWithoutChecks<kTransactionActive>(dst_pos + i, o); |
| 321 | } else { |
| 322 | // Can't put this element into the array, break to perform write-barrier and throw |
| 323 | // exception. |
| 324 | break; |
| 325 | } |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 326 | } |
| 327 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 328 | } |
| 329 | Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count); |
| 330 | if (UNLIKELY(i != count)) { |
David Sehr | 709b070 | 2016-10-13 09:12:37 -0700 | [diff] [blame] | 331 | std::string actualSrcType(mirror::Object::PrettyTypeOf(o)); |
| 332 | std::string dstType(PrettyTypeOf()); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 333 | Thread* self = Thread::Current(); |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 334 | std::string msg = android::base::StringPrintf( |
| 335 | "source[%d] of type %s cannot be stored in destination array of type %s", |
| 336 | src_pos + i, |
| 337 | actualSrcType.c_str(), |
| 338 | dstType.c_str()); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 339 | if (throw_exception) { |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 340 | self->ThrowNewException("Ljava/lang/ArrayStoreException;", msg.c_str()); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 341 | } else { |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 342 | LOG(FATAL) << msg; |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 343 | } |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 344 | } |
| 345 | } |
| 346 | |
| 347 | template<class T> |
| 348 | inline ObjectArray<T>* ObjectArray<T>::CopyOf(Thread* self, int32_t new_length) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 349 | DCHECK_GE(new_length, 0); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 350 | // We may get copied by a compacting GC. |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 351 | StackHandleScope<1> hs(self); |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 352 | Handle<ObjectArray<T>> h_this(hs.NewHandle(this)); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 353 | gc::Heap* heap = Runtime::Current()->GetHeap(); |
| 354 | gc::AllocatorType allocator_type = heap->IsMovableObject(this) ? heap->GetCurrentAllocator() : |
| 355 | heap->GetCurrentNonMovingAllocator(); |
| 356 | ObjectArray<T>* new_array = Alloc(self, GetClass(), new_length, allocator_type); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 357 | if (LIKELY(new_array != nullptr)) { |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 358 | new_array->AssignableMemcpy(0, h_this.Get(), 0, std::min(h_this->GetLength(), new_length)); |
Ian Rogers | a436fde | 2013-08-27 23:34:06 -0700 | [diff] [blame] | 359 | } |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 360 | return new_array; |
| 361 | } |
| 362 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 363 | template<class T> |
| 364 | inline MemberOffset ObjectArray<T>::OffsetOfElement(int32_t i) { |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 365 | return MemberOffset(DataOffset(kHeapReferenceSize).Int32Value() + (i * kHeapReferenceSize)); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 366 | } |
| 367 | |
Mathieu Chartier | 059ef3d | 2015-08-18 13:54:21 -0700 | [diff] [blame] | 368 | template<class T> template<typename Visitor> |
Hiroshi Yamauchi | 723e6ce | 2015-10-28 20:59:47 -0700 | [diff] [blame] | 369 | inline void ObjectArray<T>::VisitReferences(const Visitor& visitor) { |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 370 | const size_t length = static_cast<size_t>(GetLength()); |
| 371 | for (size_t i = 0; i < length; ++i) { |
| 372 | visitor(this, OffsetOfElement(i), false); |
| 373 | } |
| 374 | } |
| 375 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 376 | } // namespace mirror |
| 377 | } // namespace art |
| 378 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 379 | #endif // ART_RUNTIME_MIRROR_OBJECT_ARRAY_INL_H_ |