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 | 5794381 | 2017-12-06 21:39:13 -0800 | [diff] [blame] | 22 | #include <android-base/logging.h> |
Andreas Gampe | 46ee31b | 2016-12-14 10:11:49 -0800 | [diff] [blame] | 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" |
Andreas Gampe | c6ea7d0 | 2017-02-01 16:46:28 -0800 | [diff] [blame] | 26 | #include "class.h" |
Mathieu Chartier | 1a5337f | 2016-10-13 13:48:23 -0700 | [diff] [blame] | 27 | #include "obj_ptr-inl.h" |
Andreas Gampe | 88dbad3 | 2018-06-26 19:54:12 -0700 | [diff] [blame] | 28 | #include "runtime.h" |
Andreas Gampe | 895f922 | 2017-07-05 09:53:32 -0700 | [diff] [blame] | 29 | #include "thread-current-inl.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 30 | |
| 31 | namespace art { |
| 32 | namespace mirror { |
| 33 | |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 34 | inline uint32_t Array::ClassSize(PointerSize pointer_size) { |
Mingyao Yang | 98d1cc8 | 2014-05-15 17:02:16 -0700 | [diff] [blame] | 35 | uint32_t vtable_entries = Object::kVTableLength; |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 36 | 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] | 37 | } |
| 38 | |
Hiroshi Yamauchi | 6e83c17 | 2014-05-01 21:25:41 -0700 | [diff] [blame] | 39 | template<VerifyObjectFlags kVerifyFlags, ReadBarrierOption kReadBarrierOption> |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 40 | inline size_t Array::SizeOf() { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 41 | // 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] | 42 | size_t component_size_shift = GetClass<kVerifyFlags, kReadBarrierOption>()-> |
| 43 | template GetComponentSizeShift<kReadBarrierOption>(); |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 44 | // Don't need to check this since we already check this in GetClass. |
| 45 | int32_t component_count = |
| 46 | GetLength<static_cast<VerifyObjectFlags>(kVerifyFlags & ~kVerifyThis)>(); |
Hiroshi Yamauchi | f0edfc3 | 2014-09-25 11:46:46 -0700 | [diff] [blame] | 47 | size_t header_size = DataOffset(1U << component_size_shift).SizeValue(); |
| 48 | size_t data_size = component_count << component_size_shift; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 49 | return header_size + data_size; |
| 50 | } |
| 51 | |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 52 | template<VerifyObjectFlags kVerifyFlags> |
| 53 | inline bool Array::CheckIsValidIndex(int32_t index) { |
| 54 | if (UNLIKELY(static_cast<uint32_t>(index) >= |
| 55 | static_cast<uint32_t>(GetLength<kVerifyFlags>()))) { |
| 56 | ThrowArrayIndexOutOfBoundsException(index); |
| 57 | return false; |
| 58 | } |
| 59 | return true; |
| 60 | } |
| 61 | |
Alex Light | 440b5d9 | 2017-01-24 15:32:25 -0800 | [diff] [blame] | 62 | template<typename T> |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 63 | inline T PrimitiveArray<T>::Get(int32_t i) { |
| 64 | if (!CheckIsValidIndex(i)) { |
| 65 | DCHECK(Thread::Current()->IsExceptionPending()); |
| 66 | return T(0); |
| 67 | } |
| 68 | return GetWithoutChecks(i); |
| 69 | } |
| 70 | |
| 71 | template<typename T> |
| 72 | inline void PrimitiveArray<T>::Set(int32_t i, T value) { |
| 73 | if (Runtime::Current()->IsActiveTransaction()) { |
| 74 | Set<true>(i, value); |
| 75 | } else { |
| 76 | Set<false>(i, value); |
| 77 | } |
| 78 | } |
| 79 | |
| 80 | template<typename T> |
| 81 | template<bool kTransactionActive, bool kCheckTransaction> |
| 82 | inline void PrimitiveArray<T>::Set(int32_t i, T value) { |
| 83 | if (CheckIsValidIndex(i)) { |
| 84 | SetWithoutChecks<kTransactionActive, kCheckTransaction>(i, value); |
| 85 | } else { |
| 86 | DCHECK(Thread::Current()->IsExceptionPending()); |
| 87 | } |
| 88 | } |
| 89 | |
| 90 | template<typename T> |
Andreas Gampe | 3b45ef2 | 2015-05-26 21:34:09 -0700 | [diff] [blame] | 91 | template<bool kTransactionActive, bool kCheckTransaction, VerifyObjectFlags kVerifyFlags> |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 92 | inline void PrimitiveArray<T>::SetWithoutChecks(int32_t i, T value) { |
| 93 | if (kCheckTransaction) { |
| 94 | DCHECK_EQ(kTransactionActive, Runtime::Current()->IsActiveTransaction()); |
| 95 | } |
| 96 | if (kTransactionActive) { |
| 97 | Runtime::Current()->RecordWriteArray(this, i, GetWithoutChecks(i)); |
| 98 | } |
Andreas Gampe | 3b45ef2 | 2015-05-26 21:34:09 -0700 | [diff] [blame] | 99 | DCHECK(CheckIsValidIndex<kVerifyFlags>(i)); |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 100 | GetData()[i] = value; |
| 101 | } |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 102 | // Backward copy where elements are of aligned appropriately for T. Count is in T sized units. |
| 103 | // 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] | 104 | template<typename T> |
| 105 | static inline void ArrayBackwardCopy(T* d, const T* s, int32_t count) { |
| 106 | d += count; |
| 107 | s += count; |
| 108 | for (int32_t i = 0; i < count; ++i) { |
| 109 | d--; |
| 110 | s--; |
| 111 | *d = *s; |
| 112 | } |
| 113 | } |
| 114 | |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 115 | // Forward copy where elements are of aligned appropriately for T. Count is in T sized units. |
| 116 | // 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] | 117 | template<typename T> |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 118 | static inline void ArrayForwardCopy(T* d, const T* s, int32_t count) { |
| 119 | for (int32_t i = 0; i < count; ++i) { |
| 120 | *d = *s; |
| 121 | d++; |
| 122 | s++; |
| 123 | } |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 124 | } |
| 125 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 126 | template<class T> |
Mathieu Chartier | 31e8822 | 2016-10-14 18:43:19 -0700 | [diff] [blame] | 127 | inline void PrimitiveArray<T>::Memmove(int32_t dst_pos, |
| 128 | ObjPtr<PrimitiveArray<T>> src, |
| 129 | int32_t src_pos, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 130 | int32_t count) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 131 | if (UNLIKELY(count == 0)) { |
| 132 | return; |
| 133 | } |
| 134 | DCHECK_GE(dst_pos, 0); |
| 135 | DCHECK_GE(src_pos, 0); |
| 136 | DCHECK_GT(count, 0); |
| 137 | DCHECK(src != nullptr); |
| 138 | DCHECK_LT(dst_pos, GetLength()); |
| 139 | DCHECK_LE(dst_pos, GetLength() - count); |
| 140 | DCHECK_LT(src_pos, src->GetLength()); |
| 141 | DCHECK_LE(src_pos, src->GetLength() - count); |
| 142 | |
| 143 | // Note for non-byte copies we can't rely on standard libc functions like memcpy(3) and memmove(3) |
| 144 | // in our implementation, because they may copy byte-by-byte. |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 145 | if (LIKELY(src != this)) { |
| 146 | // Memcpy ok for guaranteed non-overlapping distinct arrays. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 147 | Memcpy(dst_pos, src, src_pos, count); |
| 148 | } else { |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 149 | // Handle copies within the same array using the appropriate direction copy. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 150 | void* dst_raw = GetRawData(sizeof(T), dst_pos); |
| 151 | const void* src_raw = src->GetRawData(sizeof(T), src_pos); |
| 152 | if (sizeof(T) == sizeof(uint8_t)) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 153 | uint8_t* d = reinterpret_cast<uint8_t*>(dst_raw); |
| 154 | const uint8_t* s = reinterpret_cast<const uint8_t*>(src_raw); |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 155 | memmove(d, s, count); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 156 | } else { |
Ian Rogers | 99cb4ea | 2014-03-26 22:53:56 -0700 | [diff] [blame] | 157 | const bool copy_forward = (dst_pos < src_pos) || (dst_pos - src_pos >= count); |
| 158 | if (sizeof(T) == sizeof(uint16_t)) { |
| 159 | uint16_t* d = reinterpret_cast<uint16_t*>(dst_raw); |
| 160 | const uint16_t* s = reinterpret_cast<const uint16_t*>(src_raw); |
| 161 | if (copy_forward) { |
| 162 | ArrayForwardCopy<uint16_t>(d, s, count); |
| 163 | } else { |
| 164 | ArrayBackwardCopy<uint16_t>(d, s, count); |
| 165 | } |
| 166 | } else if (sizeof(T) == sizeof(uint32_t)) { |
| 167 | uint32_t* d = reinterpret_cast<uint32_t*>(dst_raw); |
| 168 | const uint32_t* s = reinterpret_cast<const uint32_t*>(src_raw); |
| 169 | if (copy_forward) { |
| 170 | ArrayForwardCopy<uint32_t>(d, s, count); |
| 171 | } else { |
| 172 | ArrayBackwardCopy<uint32_t>(d, s, count); |
| 173 | } |
| 174 | } else { |
| 175 | DCHECK_EQ(sizeof(T), sizeof(uint64_t)); |
| 176 | uint64_t* d = reinterpret_cast<uint64_t*>(dst_raw); |
| 177 | const uint64_t* s = reinterpret_cast<const uint64_t*>(src_raw); |
| 178 | if (copy_forward) { |
| 179 | ArrayForwardCopy<uint64_t>(d, s, count); |
| 180 | } else { |
| 181 | ArrayBackwardCopy<uint64_t>(d, s, count); |
| 182 | } |
| 183 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 184 | } |
| 185 | } |
| 186 | } |
| 187 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 188 | template<class T> |
Mathieu Chartier | 31e8822 | 2016-10-14 18:43:19 -0700 | [diff] [blame] | 189 | inline void PrimitiveArray<T>::Memcpy(int32_t dst_pos, |
| 190 | ObjPtr<PrimitiveArray<T>> src, |
| 191 | int32_t src_pos, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 192 | int32_t count) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 193 | if (UNLIKELY(count == 0)) { |
| 194 | return; |
| 195 | } |
| 196 | DCHECK_GE(dst_pos, 0); |
| 197 | DCHECK_GE(src_pos, 0); |
| 198 | DCHECK_GT(count, 0); |
| 199 | DCHECK(src != nullptr); |
| 200 | DCHECK_LT(dst_pos, GetLength()); |
| 201 | DCHECK_LE(dst_pos, GetLength() - count); |
| 202 | DCHECK_LT(src_pos, src->GetLength()); |
| 203 | DCHECK_LE(src_pos, src->GetLength() - count); |
| 204 | |
| 205 | // Note for non-byte copies we can't rely on standard libc functions like memcpy(3) and memmove(3) |
| 206 | // in our implementation, because they may copy byte-by-byte. |
| 207 | void* dst_raw = GetRawData(sizeof(T), dst_pos); |
| 208 | const void* src_raw = src->GetRawData(sizeof(T), src_pos); |
| 209 | if (sizeof(T) == sizeof(uint8_t)) { |
| 210 | memcpy(dst_raw, src_raw, count); |
| 211 | } else if (sizeof(T) == sizeof(uint16_t)) { |
| 212 | uint16_t* d = reinterpret_cast<uint16_t*>(dst_raw); |
| 213 | const uint16_t* s = reinterpret_cast<const uint16_t*>(src_raw); |
| 214 | ArrayForwardCopy<uint16_t>(d, s, count); |
| 215 | } else if (sizeof(T) == sizeof(uint32_t)) { |
| 216 | uint32_t* d = reinterpret_cast<uint32_t*>(dst_raw); |
| 217 | const uint32_t* s = reinterpret_cast<const uint32_t*>(src_raw); |
| 218 | ArrayForwardCopy<uint32_t>(d, s, count); |
| 219 | } else { |
| 220 | DCHECK_EQ(sizeof(T), sizeof(uint64_t)); |
| 221 | uint64_t* d = reinterpret_cast<uint64_t*>(dst_raw); |
| 222 | const uint64_t* s = reinterpret_cast<const uint64_t*>(src_raw); |
| 223 | ArrayForwardCopy<uint64_t>(d, s, count); |
| 224 | } |
| 225 | } |
| 226 | |
Vladimir Marko | 104883b | 2018-11-09 17:12:23 +0000 | [diff] [blame^] | 227 | template<typename T, VerifyObjectFlags kVerifyFlags> |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 228 | inline T PointerArray::GetElementPtrSize(uint32_t idx, PointerSize ptr_size) { |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 229 | // C style casts here since we sometimes have T be a pointer, or sometimes an integer |
| 230 | // (for stack traces). |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 231 | if (ptr_size == PointerSize::k64) { |
Vladimir Marko | 104883b | 2018-11-09 17:12:23 +0000 | [diff] [blame^] | 232 | return (T)static_cast<uintptr_t>(AsLongArray<kVerifyFlags>()->GetWithoutChecks(idx)); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 233 | } |
Vladimir Marko | 104883b | 2018-11-09 17:12:23 +0000 | [diff] [blame^] | 234 | return (T)static_cast<uintptr_t>(AsIntArray<kVerifyFlags>()->GetWithoutChecks(idx)); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 235 | } |
| 236 | |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 237 | template<bool kTransactionActive, bool kUnchecked> |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 238 | inline void PointerArray::SetElementPtrSize(uint32_t idx, uint64_t element, PointerSize ptr_size) { |
| 239 | if (ptr_size == PointerSize::k64) { |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 240 | (kUnchecked ? down_cast<LongArray*>(static_cast<Object*>(this)) : AsLongArray())-> |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 241 | SetWithoutChecks<kTransactionActive>(idx, element); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 242 | } else { |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 243 | DCHECK_LE(element, static_cast<uint64_t>(0xFFFFFFFFu)); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 244 | (kUnchecked ? down_cast<IntArray*>(static_cast<Object*>(this)) : AsIntArray()) |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 245 | ->SetWithoutChecks<kTransactionActive>(idx, static_cast<uint32_t>(element)); |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 246 | } |
| 247 | } |
| 248 | |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 249 | template<bool kTransactionActive, bool kUnchecked, typename T> |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 250 | inline void PointerArray::SetElementPtrSize(uint32_t idx, T* element, PointerSize ptr_size) { |
Mathieu Chartier | 1bbfab6 | 2016-01-27 16:37:19 -0800 | [diff] [blame] | 251 | SetElementPtrSize<kTransactionActive, kUnchecked>(idx, |
| 252 | reinterpret_cast<uintptr_t>(element), |
| 253 | ptr_size); |
Mathieu Chartier | d329a3b | 2016-01-27 15:30:10 -0800 | [diff] [blame] | 254 | } |
| 255 | |
Vladimir Marko | 104883b | 2018-11-09 17:12:23 +0000 | [diff] [blame^] | 256 | template <VerifyObjectFlags kVerifyFlags, typename Visitor> |
Mathieu Chartier | 4b00d34 | 2015-11-13 10:42:08 -0800 | [diff] [blame] | 257 | inline void PointerArray::Fixup(mirror::PointerArray* dest, |
Andreas Gampe | 542451c | 2016-07-26 09:02:02 -0700 | [diff] [blame] | 258 | PointerSize pointer_size, |
Mathieu Chartier | 4b00d34 | 2015-11-13 10:42:08 -0800 | [diff] [blame] | 259 | const Visitor& visitor) { |
| 260 | for (size_t i = 0, count = GetLength(); i < count; ++i) { |
Vladimir Marko | 104883b | 2018-11-09 17:12:23 +0000 | [diff] [blame^] | 261 | void* ptr = GetElementPtrSize<void*, kVerifyFlags>(i, pointer_size); |
Mathieu Chartier | 4b00d34 | 2015-11-13 10:42:08 -0800 | [diff] [blame] | 262 | void* new_ptr = visitor(ptr); |
| 263 | if (ptr != new_ptr) { |
| 264 | dest->SetElementPtrSize<false, true>(i, new_ptr, pointer_size); |
| 265 | } |
| 266 | } |
| 267 | } |
| 268 | |
Alex Light | a01de59 | 2016-11-15 10:43:06 -0800 | [diff] [blame] | 269 | template<bool kUnchecked> |
| 270 | void PointerArray::Memcpy(int32_t dst_pos, |
| 271 | ObjPtr<PointerArray> src, |
| 272 | int32_t src_pos, |
| 273 | int32_t count, |
| 274 | PointerSize ptr_size) { |
| 275 | DCHECK(!Runtime::Current()->IsActiveTransaction()); |
| 276 | DCHECK(!src.IsNull()); |
| 277 | if (ptr_size == PointerSize::k64) { |
| 278 | LongArray* l_this = (kUnchecked ? down_cast<LongArray*>(static_cast<Object*>(this)) |
| 279 | : AsLongArray()); |
| 280 | LongArray* l_src = (kUnchecked ? down_cast<LongArray*>(static_cast<Object*>(src.Ptr())) |
| 281 | : src->AsLongArray()); |
| 282 | l_this->Memcpy(dst_pos, l_src, src_pos, count); |
| 283 | } else { |
| 284 | IntArray* i_this = (kUnchecked ? down_cast<IntArray*>(static_cast<Object*>(this)) |
| 285 | : AsIntArray()); |
| 286 | IntArray* i_src = (kUnchecked ? down_cast<IntArray*>(static_cast<Object*>(src.Ptr())) |
| 287 | : src->AsIntArray()); |
| 288 | i_this->Memcpy(dst_pos, i_src, src_pos, count); |
| 289 | } |
| 290 | } |
| 291 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 292 | } // namespace mirror |
| 293 | } // namespace art |
| 294 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 295 | #endif // ART_RUNTIME_MIRROR_ARRAY_INL_H_ |