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_ARRAY_INL_H_ |
| 18 | #define ART_RUNTIME_MIRROR_ARRAY_INL_H_ |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 19 | |
| 20 | #include "array.h" |
| 21 | |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 22 | #include "android-base/stringprintf.h" |
| 23 | |
Vladimir Marko | 80afd02 | 2015-05-19 18:08:00 +0100 | [diff] [blame] | 24 | #include "base/bit_utils.h" |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 25 | #include "base/casts.h" |
Vladimir Marko | 80afd02 | 2015-05-19 18:08:00 +0100 | [diff] [blame] | 26 | #include "base/logging.h" |
Andreas Gampe | c6ea7d0 | 2017-02-01 16:46:28 -0800 | [diff] [blame] | 27 | #include "class.h" |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 28 | #include "gc/heap-inl.h" |
Andreas Gampe | c15a2f4 | 2017-04-21 12:09:39 -0700 | [diff] [blame^] | 29 | #include "object-inl.h" |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 30 | #include "obj_ptr-inl.h" |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 31 | #include "thread.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 32 | |
| 33 | namespace art { |
| 34 | namespace mirror { |
| 35 | |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 36 | inline uint32_t Array::ClassSize(PointerSize pointer_size) { |
Mingyao Yang | 98d1cc8 | 2014-05-15 17:02:16 -0700 | [diff] [blame] | 37 | uint32_t vtable_entries = Object::kVTableLength; |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 38 | return Class::ComputeClassSize(true, vtable_entries, 0, 0, 0, 0, 0, pointer_size); |
Mingyao Yang | 98d1cc8 | 2014-05-15 17:02:16 -0700 | [diff] [blame] | 39 | } |
| 40 | |
Hiroshi Yamauchi | 6e83c17 | 2014-05-01 21:25:41 -0700 | [diff] [blame] | 41 | template<VerifyObjectFlags kVerifyFlags, ReadBarrierOption kReadBarrierOption> |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 42 | inline size_t Array::SizeOf() { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 43 | // This is safe from overflow because the array was already allocated, so we know it's sane. |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 44 | size_t component_size_shift = GetClass<kVerifyFlags, kReadBarrierOption>()-> |
| 45 | template GetComponentSizeShift<kReadBarrierOption>(); |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 46 | // Don't need to check this since we already check this in GetClass. |
| 47 | int32_t component_count = |
| 48 | GetLength<static_cast<VerifyObjectFlags>(kVerifyFlags & ~kVerifyThis)>(); |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 49 | size_t header_size = DataOffset(1U << component_size_shift).SizeValue(); |
| 50 | size_t data_size = component_count << component_size_shift; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 51 | return header_size + data_size; |
| 52 | } |
| 53 | |
Ian Rogers | 7e70b00 | 2014-10-08 11:47:24 -0700 | [diff] [blame] | 54 | inline MemberOffset Array::DataOffset(size_t component_size) { |
| 55 | DCHECK(IsPowerOfTwo(component_size)) << component_size; |
| 56 | size_t data_offset = RoundUp(OFFSETOF_MEMBER(Array, first_element_), component_size); |
| 57 | DCHECK_EQ(RoundUp(data_offset, component_size), data_offset) |
| 58 | << "Array data offset isn't aligned with component size"; |
| 59 | return MemberOffset(data_offset); |
| 60 | } |
| 61 | |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 62 | template<VerifyObjectFlags kVerifyFlags> |
| 63 | inline bool Array::CheckIsValidIndex(int32_t index) { |
| 64 | if (UNLIKELY(static_cast<uint32_t>(index) >= |
| 65 | static_cast<uint32_t>(GetLength<kVerifyFlags>()))) { |
| 66 | ThrowArrayIndexOutOfBoundsException(index); |
| 67 | return false; |
| 68 | } |
| 69 | return true; |
| 70 | } |
| 71 | |
Vladimir Marko | 20f8559 | 2015-03-19 10:07:02 +0000 | [diff] [blame] | 72 | static inline size_t ComputeArraySize(int32_t component_count, size_t component_size_shift) { |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 73 | DCHECK_GE(component_count, 0); |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 74 | |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 75 | size_t component_size = 1U << component_size_shift; |
Hiroshi Yamauchi | aa866f5 | 2014-03-21 16:18:30 -0700 | [diff] [blame] | 76 | size_t header_size = Array::DataOffset(component_size).SizeValue(); |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 77 | size_t data_size = static_cast<size_t>(component_count) << component_size_shift; |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 78 | size_t size = header_size + data_size; |
| 79 | |
Vladimir Marko | 20f8559 | 2015-03-19 10:07:02 +0000 | [diff] [blame] | 80 | // Check for size_t overflow if this was an unreasonable request |
| 81 | // but let the caller throw OutOfMemoryError. |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 82 | #ifdef __LP64__ |
| 83 | // 64-bit. No overflow as component_count is 32-bit and the maximum |
| 84 | // component size is 8. |
| 85 | DCHECK_LE((1U << component_size_shift), 8U); |
| 86 | #else |
| 87 | // 32-bit. |
| 88 | DCHECK_NE(header_size, 0U); |
| 89 | DCHECK_EQ(RoundUp(header_size, component_size), header_size); |
| 90 | // The array length limit (exclusive). |
| 91 | const size_t length_limit = (0U - header_size) >> component_size_shift; |
| 92 | if (UNLIKELY(length_limit <= static_cast<size_t>(component_count))) { |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 93 | return 0; // failure |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 94 | } |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 95 | #endif |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 96 | return size; |
| 97 | } |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 98 | |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 99 | // Used for setting the array length in the allocation code path to ensure it is guarded by a |
| 100 | // StoreStore fence. |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 101 | class SetLengthVisitor { |
| 102 | public: |
| 103 | explicit SetLengthVisitor(int32_t length) : length_(length) { |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 104 | } |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 105 | |
Mathieu Chartier | 9d156d5 | 2016-10-06 17:44:26 -0700 | [diff] [blame] | 106 | void operator()(ObjPtr<Object> obj, size_t usable_size ATTRIBUTE_UNUSED) const |
Andreas Gampe | bdf7f1c | 2016-08-30 16:38:47 -0700 | [diff] [blame] | 107 | REQUIRES_SHARED(Locks::mutator_lock_) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 108 | // Avoid AsArray as object is not yet in live bitmap or allocation stack. |
Mathieu Chartier | 9d156d5 | 2016-10-06 17:44:26 -0700 | [diff] [blame] | 109 | ObjPtr<Array> array = ObjPtr<Array>::DownCast(obj); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 110 | // DCHECK(array->IsArrayInstance()); |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 111 | array->SetLength(length_); |
| 112 | } |
| 113 | |
| 114 | private: |
| 115 | const int32_t length_; |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 116 | |
| 117 | DISALLOW_COPY_AND_ASSIGN(SetLengthVisitor); |
| 118 | }; |
| 119 | |
| 120 | // Similar to SetLengthVisitor, used for setting the array length to fill the usable size of an |
| 121 | // array. |
| 122 | class SetLengthToUsableSizeVisitor { |
| 123 | public: |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 124 | SetLengthToUsableSizeVisitor(int32_t min_length, size_t header_size, |
| 125 | size_t component_size_shift) : |
| 126 | minimum_length_(min_length), header_size_(header_size), |
| 127 | component_size_shift_(component_size_shift) { |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 128 | } |
| 129 | |
Mathieu Chartier | 9d156d5 | 2016-10-06 17:44:26 -0700 | [diff] [blame] | 130 | void operator()(ObjPtr<Object> obj, size_t usable_size) const |
Andreas Gampe | bdf7f1c | 2016-08-30 16:38:47 -0700 | [diff] [blame] | 131 | REQUIRES_SHARED(Locks::mutator_lock_) { |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 132 | // Avoid AsArray as object is not yet in live bitmap or allocation stack. |
Mathieu Chartier | 9d156d5 | 2016-10-06 17:44:26 -0700 | [diff] [blame] | 133 | ObjPtr<Array> array = ObjPtr<Array>::DownCast(obj); |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 134 | // DCHECK(array->IsArrayInstance()); |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 135 | int32_t length = (usable_size - header_size_) >> component_size_shift_; |
Ian Rogers | a55cf41 | 2014-02-27 00:31:26 -0800 | [diff] [blame] | 136 | DCHECK_GE(length, minimum_length_); |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 137 | uint8_t* old_end = reinterpret_cast<uint8_t*>(array->GetRawData(1U << component_size_shift_, |
| 138 | minimum_length_)); |
| 139 | uint8_t* new_end = reinterpret_cast<uint8_t*>(array->GetRawData(1U << component_size_shift_, |
| 140 | length)); |
Ian Rogers | a55cf41 | 2014-02-27 00:31:26 -0800 | [diff] [blame] | 141 | // Ensure space beyond original allocation is zeroed. |
| 142 | memset(old_end, 0, new_end - old_end); |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 143 | array->SetLength(length); |
| 144 | } |
| 145 | |
| 146 | private: |
Ian Rogers | a55cf41 | 2014-02-27 00:31:26 -0800 | [diff] [blame] | 147 | const int32_t minimum_length_; |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 148 | const size_t header_size_; |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 149 | const size_t component_size_shift_; |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 150 | |
| 151 | DISALLOW_COPY_AND_ASSIGN(SetLengthToUsableSizeVisitor); |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 152 | }; |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 153 | |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 154 | template <bool kIsInstrumented, bool kFillUsable> |
Mathieu Chartier | 31e8822 | 2016-10-14 18:43:19 -0700 | [diff] [blame] | 155 | inline Array* Array::Alloc(Thread* self, |
| 156 | ObjPtr<Class> array_class, |
| 157 | int32_t component_count, |
| 158 | size_t component_size_shift, |
| 159 | gc::AllocatorType allocator_type) { |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 160 | DCHECK(allocator_type != gc::kAllocatorTypeLOS); |
Vladimir Marko | 20f8559 | 2015-03-19 10:07:02 +0000 | [diff] [blame] | 161 | DCHECK(array_class != nullptr); |
| 162 | DCHECK(array_class->IsArrayClass()); |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 163 | DCHECK_EQ(array_class->GetComponentSizeShift(), component_size_shift); |
| 164 | DCHECK_EQ(array_class->GetComponentSize(), (1U << component_size_shift)); |
Vladimir Marko | 20f8559 | 2015-03-19 10:07:02 +0000 | [diff] [blame] | 165 | size_t size = ComputeArraySize(component_count, component_size_shift); |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 166 | #ifdef __LP64__ |
| 167 | // 64-bit. No size_t overflow. |
| 168 | DCHECK_NE(size, 0U); |
| 169 | #else |
| 170 | // 32-bit. |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 171 | if (UNLIKELY(size == 0)) { |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 172 | self->ThrowOutOfMemoryError(android::base::StringPrintf("%s of length %d would overflow", |
| 173 | array_class->PrettyDescriptor().c_str(), |
| 174 | component_count).c_str()); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 175 | return nullptr; |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 176 | } |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 177 | #endif |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 178 | gc::Heap* heap = Runtime::Current()->GetHeap(); |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 179 | Array* result; |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 180 | if (!kFillUsable) { |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 181 | SetLengthVisitor visitor(component_count); |
| 182 | result = down_cast<Array*>( |
| 183 | heap->AllocObjectWithAllocator<kIsInstrumented, true>(self, array_class, size, |
| 184 | allocator_type, visitor)); |
| 185 | } else { |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 186 | SetLengthToUsableSizeVisitor visitor(component_count, |
| 187 | DataOffset(1U << component_size_shift).SizeValue(), |
| 188 | component_size_shift); |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 189 | result = down_cast<Array*>( |
| 190 | heap->AllocObjectWithAllocator<kIsInstrumented, true>(self, array_class, size, |
| 191 | allocator_type, visitor)); |
| 192 | } |
| 193 | if (kIsDebugBuild && result != nullptr && Runtime::Current()->IsStarted()) { |
Mathieu Chartier | 8580154 | 2014-02-27 18:06:26 -0800 | [diff] [blame] | 194 | array_class = result->GetClass(); // In case the array class moved. |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 195 | CHECK_EQ(array_class->GetComponentSize(), 1U << component_size_shift); |
| 196 | if (!kFillUsable) { |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 197 | CHECK_EQ(result->SizeOf(), size); |
| 198 | } else { |
| 199 | CHECK_GE(result->SizeOf(), size); |
| 200 | } |
| 201 | } |
| 202 | return result; |
Hiroshi Yamauchi | 967a0ad | 2013-09-10 16:24:21 -0700 | [diff] [blame] | 203 | } |
| 204 | |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 205 | template<class T> |
Mathieu Chartier | bb87e0f | 2015-04-03 11:21:55 -0700 | [diff] [blame] | 206 | inline void PrimitiveArray<T>::VisitRoots(RootVisitor* visitor) { |
| 207 | array_class_.VisitRootIfNonNull(visitor, RootInfo(kRootStickyClass)); |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 208 | } |
| 209 | |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 210 | template<typename T> |
Alex Light | 440b5d9 | 2017-01-24 15:32:25 -0800 | [diff] [blame] | 211 | inline PrimitiveArray<T>* PrimitiveArray<T>::AllocateAndFill(Thread* self, |
| 212 | const T* data, |
| 213 | size_t length) { |
| 214 | StackHandleScope<1> hs(self); |
| 215 | Handle<PrimitiveArray<T>> arr(hs.NewHandle(PrimitiveArray<T>::Alloc(self, length))); |
| 216 | if (!arr.IsNull()) { |
| 217 | // Copy it in. Just skip if it's null |
| 218 | memcpy(arr->GetData(), data, sizeof(T) * length); |
| 219 | } |
| 220 | return arr.Get(); |
| 221 | } |
| 222 | |
| 223 | template<typename T> |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 224 | inline PrimitiveArray<T>* PrimitiveArray<T>::Alloc(Thread* self, size_t length) { |
Mathieu Chartier | 31e8822 | 2016-10-14 18:43:19 -0700 | [diff] [blame] | 225 | Array* raw_array = Array::Alloc<true>(self, |
| 226 | GetArrayClass(), |
| 227 | length, |
Mathieu Chartier | c785344 | 2015-03-27 14:35:38 -0700 | [diff] [blame] | 228 | ComponentSizeShiftWidth(sizeof(T)), |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 229 | Runtime::Current()->GetHeap()->GetCurrentAllocator()); |
| 230 | return down_cast<PrimitiveArray<T>*>(raw_array); |
| 231 | } |
| 232 | |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 233 | template<typename T> |
| 234 | inline T PrimitiveArray<T>::Get(int32_t i) { |
| 235 | if (!CheckIsValidIndex(i)) { |
| 236 | DCHECK(Thread::Current()->IsExceptionPending()); |
| 237 | return T(0); |
| 238 | } |
| 239 | return GetWithoutChecks(i); |
| 240 | } |
| 241 | |
| 242 | template<typename T> |
| 243 | inline void PrimitiveArray<T>::Set(int32_t i, T value) { |
| 244 | if (Runtime::Current()->IsActiveTransaction()) { |
| 245 | Set<true>(i, value); |
| 246 | } else { |
| 247 | Set<false>(i, value); |
| 248 | } |
| 249 | } |
| 250 | |
| 251 | template<typename T> |
| 252 | template<bool kTransactionActive, bool kCheckTransaction> |
| 253 | inline void PrimitiveArray<T>::Set(int32_t i, T value) { |
| 254 | if (CheckIsValidIndex(i)) { |
| 255 | SetWithoutChecks<kTransactionActive, kCheckTransaction>(i, value); |
| 256 | } else { |
| 257 | DCHECK(Thread::Current()->IsExceptionPending()); |
| 258 | } |
| 259 | } |
| 260 | |
| 261 | template<typename T> |
Andreas Gampe | 3b45ef2 | 2015-05-26 21:34:09 -0700 | [diff] [blame] | 262 | template<bool kTransactionActive, bool kCheckTransaction, VerifyObjectFlags kVerifyFlags> |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 263 | inline void PrimitiveArray<T>::SetWithoutChecks(int32_t i, T value) { |
| 264 | if (kCheckTransaction) { |
| 265 | DCHECK_EQ(kTransactionActive, Runtime::Current()->IsActiveTransaction()); |
| 266 | } |
| 267 | if (kTransactionActive) { |
| 268 | Runtime::Current()->RecordWriteArray(this, i, GetWithoutChecks(i)); |
| 269 | } |
Andreas Gampe | 3b45ef2 | 2015-05-26 21:34:09 -0700 | [diff] [blame] | 270 | DCHECK(CheckIsValidIndex<kVerifyFlags>(i)); |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 271 | GetData()[i] = value; |
| 272 | } |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 273 | // Backward copy where elements are of aligned appropriately for T. Count is in T sized units. |
| 274 | // Copies are guaranteed not to tear when the sizeof T is less-than 64bit. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 275 | template<typename T> |
| 276 | static inline void ArrayBackwardCopy(T* d, const T* s, int32_t count) { |
| 277 | d += count; |
| 278 | s += count; |
| 279 | for (int32_t i = 0; i < count; ++i) { |
| 280 | d--; |
| 281 | s--; |
| 282 | *d = *s; |
| 283 | } |
| 284 | } |
| 285 | |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 286 | // Forward copy where elements are of aligned appropriately for T. Count is in T sized units. |
| 287 | // Copies are guaranteed not to tear when the sizeof T is less-than 64bit. |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 288 | template<typename T> |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 289 | static inline void ArrayForwardCopy(T* d, const T* s, int32_t count) { |
| 290 | for (int32_t i = 0; i < count; ++i) { |
| 291 | *d = *s; |
| 292 | d++; |
| 293 | s++; |
| 294 | } |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 295 | } |
| 296 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 297 | template<class T> |
Mathieu Chartier | 31e8822 | 2016-10-14 18:43:19 -0700 | [diff] [blame] | 298 | inline void PrimitiveArray<T>::Memmove(int32_t dst_pos, |
| 299 | ObjPtr<PrimitiveArray<T>> src, |
| 300 | int32_t src_pos, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 301 | int32_t count) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 302 | if (UNLIKELY(count == 0)) { |
| 303 | return; |
| 304 | } |
| 305 | DCHECK_GE(dst_pos, 0); |
| 306 | DCHECK_GE(src_pos, 0); |
| 307 | DCHECK_GT(count, 0); |
| 308 | DCHECK(src != nullptr); |
| 309 | DCHECK_LT(dst_pos, GetLength()); |
| 310 | DCHECK_LE(dst_pos, GetLength() - count); |
| 311 | DCHECK_LT(src_pos, src->GetLength()); |
| 312 | DCHECK_LE(src_pos, src->GetLength() - count); |
| 313 | |
| 314 | // Note for non-byte copies we can't rely on standard libc functions like memcpy(3) and memmove(3) |
| 315 | // in our implementation, because they may copy byte-by-byte. |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 316 | if (LIKELY(src != this)) { |
| 317 | // Memcpy ok for guaranteed non-overlapping distinct arrays. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 318 | Memcpy(dst_pos, src, src_pos, count); |
| 319 | } else { |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 320 | // Handle copies within the same array using the appropriate direction copy. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 321 | void* dst_raw = GetRawData(sizeof(T), dst_pos); |
| 322 | const void* src_raw = src->GetRawData(sizeof(T), src_pos); |
| 323 | if (sizeof(T) == sizeof(uint8_t)) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 324 | uint8_t* d = reinterpret_cast<uint8_t*>(dst_raw); |
| 325 | const uint8_t* s = reinterpret_cast<const uint8_t*>(src_raw); |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 326 | memmove(d, s, count); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 327 | } else { |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 328 | const bool copy_forward = (dst_pos < src_pos) || (dst_pos - src_pos >= count); |
| 329 | if (sizeof(T) == sizeof(uint16_t)) { |
| 330 | uint16_t* d = reinterpret_cast<uint16_t*>(dst_raw); |
| 331 | const uint16_t* s = reinterpret_cast<const uint16_t*>(src_raw); |
| 332 | if (copy_forward) { |
| 333 | ArrayForwardCopy<uint16_t>(d, s, count); |
| 334 | } else { |
| 335 | ArrayBackwardCopy<uint16_t>(d, s, count); |
| 336 | } |
| 337 | } else if (sizeof(T) == sizeof(uint32_t)) { |
| 338 | uint32_t* d = reinterpret_cast<uint32_t*>(dst_raw); |
| 339 | const uint32_t* s = reinterpret_cast<const uint32_t*>(src_raw); |
| 340 | if (copy_forward) { |
| 341 | ArrayForwardCopy<uint32_t>(d, s, count); |
| 342 | } else { |
| 343 | ArrayBackwardCopy<uint32_t>(d, s, count); |
| 344 | } |
| 345 | } else { |
| 346 | DCHECK_EQ(sizeof(T), sizeof(uint64_t)); |
| 347 | uint64_t* d = reinterpret_cast<uint64_t*>(dst_raw); |
| 348 | const uint64_t* s = reinterpret_cast<const uint64_t*>(src_raw); |
| 349 | if (copy_forward) { |
| 350 | ArrayForwardCopy<uint64_t>(d, s, count); |
| 351 | } else { |
| 352 | ArrayBackwardCopy<uint64_t>(d, s, count); |
| 353 | } |
| 354 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 355 | } |
| 356 | } |
| 357 | } |
| 358 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 359 | template<class T> |
Mathieu Chartier | 31e8822 | 2016-10-14 18:43:19 -0700 | [diff] [blame] | 360 | inline void PrimitiveArray<T>::Memcpy(int32_t dst_pos, |
| 361 | ObjPtr<PrimitiveArray<T>> src, |
| 362 | int32_t src_pos, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 363 | int32_t count) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 364 | if (UNLIKELY(count == 0)) { |
| 365 | return; |
| 366 | } |
| 367 | DCHECK_GE(dst_pos, 0); |
| 368 | DCHECK_GE(src_pos, 0); |
| 369 | DCHECK_GT(count, 0); |
| 370 | DCHECK(src != nullptr); |
| 371 | DCHECK_LT(dst_pos, GetLength()); |
| 372 | DCHECK_LE(dst_pos, GetLength() - count); |
| 373 | DCHECK_LT(src_pos, src->GetLength()); |
| 374 | DCHECK_LE(src_pos, src->GetLength() - count); |
| 375 | |
| 376 | // Note for non-byte copies we can't rely on standard libc functions like memcpy(3) and memmove(3) |
| 377 | // in our implementation, because they may copy byte-by-byte. |
| 378 | void* dst_raw = GetRawData(sizeof(T), dst_pos); |
| 379 | const void* src_raw = src->GetRawData(sizeof(T), src_pos); |
| 380 | if (sizeof(T) == sizeof(uint8_t)) { |
| 381 | memcpy(dst_raw, src_raw, count); |
| 382 | } else if (sizeof(T) == sizeof(uint16_t)) { |
| 383 | uint16_t* d = reinterpret_cast<uint16_t*>(dst_raw); |
| 384 | const uint16_t* s = reinterpret_cast<const uint16_t*>(src_raw); |
| 385 | ArrayForwardCopy<uint16_t>(d, s, count); |
| 386 | } else if (sizeof(T) == sizeof(uint32_t)) { |
| 387 | uint32_t* d = reinterpret_cast<uint32_t*>(dst_raw); |
| 388 | const uint32_t* s = reinterpret_cast<const uint32_t*>(src_raw); |
| 389 | ArrayForwardCopy<uint32_t>(d, s, count); |
| 390 | } else { |
| 391 | DCHECK_EQ(sizeof(T), sizeof(uint64_t)); |
| 392 | uint64_t* d = reinterpret_cast<uint64_t*>(dst_raw); |
| 393 | const uint64_t* s = reinterpret_cast<const uint64_t*>(src_raw); |
| 394 | ArrayForwardCopy<uint64_t>(d, s, count); |
| 395 | } |
| 396 | } |
| 397 | |
Mathieu Chartier | dfe02f6 | 2016-02-01 20:15:11 -0800 | [diff] [blame] | 398 | template<typename T, VerifyObjectFlags kVerifyFlags, ReadBarrierOption kReadBarrierOption> |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 399 | inline T PointerArray::GetElementPtrSize(uint32_t idx, PointerSize ptr_size) { |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 400 | // C style casts here since we sometimes have T be a pointer, or sometimes an integer |
| 401 | // (for stack traces). |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 402 | if (ptr_size == PointerSize::k64) { |
Mathieu Chartier | dfe02f6 | 2016-02-01 20:15:11 -0800 | [diff] [blame] | 403 | return (T)static_cast<uintptr_t>( |
| 404 | AsLongArray<kVerifyFlags, kReadBarrierOption>()->GetWithoutChecks(idx)); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 405 | } |
Colin Cross | 32f5388 | 2017-03-15 15:25:24 -0700 | [diff] [blame] | 406 | return (T)static_cast<uintptr_t>(static_cast<uint32_t>( |
| 407 | AsIntArray<kVerifyFlags, kReadBarrierOption>()->GetWithoutChecks(idx))); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 408 | } |
| 409 | |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 410 | template<bool kTransactionActive, bool kUnchecked> |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 411 | inline void PointerArray::SetElementPtrSize(uint32_t idx, uint64_t element, PointerSize ptr_size) { |
| 412 | if (ptr_size == PointerSize::k64) { |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 413 | (kUnchecked ? down_cast<LongArray*>(static_cast<Object*>(this)) : AsLongArray())-> |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 414 | SetWithoutChecks<kTransactionActive>(idx, element); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 415 | } else { |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 416 | DCHECK_LE(element, static_cast<uint64_t>(0xFFFFFFFFu)); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 417 | (kUnchecked ? down_cast<IntArray*>(static_cast<Object*>(this)) : AsIntArray()) |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 418 | ->SetWithoutChecks<kTransactionActive>(idx, static_cast<uint32_t>(element)); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 419 | } |
| 420 | } |
| 421 | |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 422 | template<bool kTransactionActive, bool kUnchecked, typename T> |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 423 | inline void PointerArray::SetElementPtrSize(uint32_t idx, T* element, PointerSize ptr_size) { |
Mathieu Chartier | 1bbfab6 | 2016-01-27 16:37:19 -0800 | [diff] [blame] | 424 | SetElementPtrSize<kTransactionActive, kUnchecked>(idx, |
| 425 | reinterpret_cast<uintptr_t>(element), |
| 426 | ptr_size); |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 427 | } |
| 428 | |
Mathieu Chartier | dfe02f6 | 2016-02-01 20:15:11 -0800 | [diff] [blame] | 429 | template <VerifyObjectFlags kVerifyFlags, ReadBarrierOption kReadBarrierOption, typename Visitor> |
Mathieu Chartier | 4b00d34 | 2015-11-13 10:42:08 -0800 | [diff] [blame] | 430 | inline void PointerArray::Fixup(mirror::PointerArray* dest, |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 431 | PointerSize pointer_size, |
Mathieu Chartier | 4b00d34 | 2015-11-13 10:42:08 -0800 | [diff] [blame] | 432 | const Visitor& visitor) { |
| 433 | for (size_t i = 0, count = GetLength(); i < count; ++i) { |
Mathieu Chartier | dfe02f6 | 2016-02-01 20:15:11 -0800 | [diff] [blame] | 434 | void* ptr = GetElementPtrSize<void*, kVerifyFlags, kReadBarrierOption>(i, pointer_size); |
Mathieu Chartier | 4b00d34 | 2015-11-13 10:42:08 -0800 | [diff] [blame] | 435 | void* new_ptr = visitor(ptr); |
| 436 | if (ptr != new_ptr) { |
| 437 | dest->SetElementPtrSize<false, true>(i, new_ptr, pointer_size); |
| 438 | } |
| 439 | } |
| 440 | } |
| 441 | |
Alex Light | a01de59 | 2016-11-15 10:43:06 -0800 | [diff] [blame] | 442 | template<bool kUnchecked> |
| 443 | void PointerArray::Memcpy(int32_t dst_pos, |
| 444 | ObjPtr<PointerArray> src, |
| 445 | int32_t src_pos, |
| 446 | int32_t count, |
| 447 | PointerSize ptr_size) { |
| 448 | DCHECK(!Runtime::Current()->IsActiveTransaction()); |
| 449 | DCHECK(!src.IsNull()); |
| 450 | if (ptr_size == PointerSize::k64) { |
| 451 | LongArray* l_this = (kUnchecked ? down_cast<LongArray*>(static_cast<Object*>(this)) |
| 452 | : AsLongArray()); |
| 453 | LongArray* l_src = (kUnchecked ? down_cast<LongArray*>(static_cast<Object*>(src.Ptr())) |
| 454 | : src->AsLongArray()); |
| 455 | l_this->Memcpy(dst_pos, l_src, src_pos, count); |
| 456 | } else { |
| 457 | IntArray* i_this = (kUnchecked ? down_cast<IntArray*>(static_cast<Object*>(this)) |
| 458 | : AsIntArray()); |
| 459 | IntArray* i_src = (kUnchecked ? down_cast<IntArray*>(static_cast<Object*>(src.Ptr())) |
| 460 | : src->AsIntArray()); |
| 461 | i_this->Memcpy(dst_pos, i_src, src_pos, count); |
| 462 | } |
| 463 | } |
| 464 | |
Mathieu Chartier | 31e8822 | 2016-10-14 18:43:19 -0700 | [diff] [blame] | 465 | template<typename T> |
| 466 | inline void PrimitiveArray<T>::SetArrayClass(ObjPtr<Class> array_class) { |
| 467 | CHECK(array_class_.IsNull()); |
| 468 | CHECK(array_class != nullptr); |
| 469 | array_class_ = GcRoot<Class>(array_class); |
| 470 | } |
| 471 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 472 | } // namespace mirror |
| 473 | } // namespace art |
| 474 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 475 | #endif // ART_RUNTIME_MIRROR_ARRAY_INL_H_ |