blob: 23e0aecbda5f83c8b44a23d4526d0c9b8dab61fd [file] [log] [blame]
Elliott Hughes2faa5f12012-01-30 14:42:07 -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 */
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070016
Brian Carlstromfc0e3212013-07-17 14:40:12 -070017#ifndef ART_RUNTIME_MEMORY_REGION_H_
18#define ART_RUNTIME_MEMORY_REGION_H_
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070019
20#include <stdint.h>
Vladimir Marko80afd022015-05-19 18:08:00 +010021#include <type_traits>
Elliott Hughes76160052012-12-12 16:31:20 -080022
Andreas Gampe57943812017-12-06 21:39:13 -080023#include <android-base/logging.h>
24
Vladimir Marko80afd022015-05-19 18:08:00 +010025#include "arch/instruction_set.h"
26#include "base/bit_utils.h"
Roland Levillainda4d79b2015-03-24 14:36:11 +000027#include "base/casts.h"
Elliott Hughes76160052012-12-12 16:31:20 -080028#include "base/macros.h"
Ian Rogersd4c4d952014-10-16 20:31:53 -070029#include "base/value_object.h"
Brian Carlstrom578bbdc2011-07-21 14:07:47 -070030#include "globals.h"
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070031
Carl Shapiro6b6b5f02011-06-21 15:05:09 -070032namespace art {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070033
34// Memory regions are useful for accessing memory with bounds check in
35// debug mode. They can be safely passed by value and do not assume ownership
36// of the region.
Ian Rogersd4c4d952014-10-16 20:31:53 -070037class MemoryRegion FINAL : public ValueObject {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070038 public:
David Srbecky45aa5982016-03-18 02:15:09 +000039 struct ContentEquals {
40 constexpr bool operator()(const MemoryRegion& lhs, const MemoryRegion& rhs) const {
41 return lhs.size() == rhs.size() && memcmp(lhs.begin(), rhs.begin(), lhs.size()) == 0;
42 }
43 };
44
Ian Rogersd4c4d952014-10-16 20:31:53 -070045 MemoryRegion() : pointer_(nullptr), size_(0) {}
Andreas Gampe277ccbd2014-11-03 21:36:10 -080046 MemoryRegion(void* pointer_in, uintptr_t size_in) : pointer_(pointer_in), size_(size_in) {}
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070047
48 void* pointer() const { return pointer_; }
49 size_t size() const { return size_; }
50 size_t size_in_bits() const { return size_ * kBitsPerByte; }
51
52 static size_t pointer_offset() {
53 return OFFSETOF_MEMBER(MemoryRegion, pointer_);
54 }
55
David Srbecky45aa5982016-03-18 02:15:09 +000056 uint8_t* begin() const { return reinterpret_cast<uint8_t*>(pointer_); }
57 uint8_t* end() const { return begin() + size_; }
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070058
Roland Levillaina2d8ec62015-03-12 15:25:29 +000059 // Load value of type `T` at `offset`. The memory address corresponding
Roland Levillainbdba92d2015-03-31 12:27:44 +010060 // to `offset` should be word-aligned (on ARM, this is a requirement).
David Brazdilb7656832015-03-30 10:08:19 +010061 template<typename T>
62 ALWAYS_INLINE T Load(uintptr_t offset) const {
Roland Levillainbdba92d2015-03-31 12:27:44 +010063 T* address = ComputeInternalPointer<T>(offset);
64 DCHECK(IsWordAligned(address));
65 return *address;
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070066 }
67
Roland Levillaina2d8ec62015-03-12 15:25:29 +000068 // Store `value` (of type `T`) at `offset`. The memory address
Roland Levillainbdba92d2015-03-31 12:27:44 +010069 // corresponding to `offset` should be word-aligned (on ARM, this is
70 // a requirement).
David Brazdilb7656832015-03-30 10:08:19 +010071 template<typename T>
72 ALWAYS_INLINE void Store(uintptr_t offset, T value) const {
Roland Levillainbdba92d2015-03-31 12:27:44 +010073 T* address = ComputeInternalPointer<T>(offset);
74 DCHECK(IsWordAligned(address));
75 *address = value;
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070076 }
77
Roland Levillaina2d8ec62015-03-12 15:25:29 +000078 // Load value of type `T` at `offset`. The memory address corresponding
79 // to `offset` does not need to be word-aligned.
David Brazdilb7656832015-03-30 10:08:19 +010080 template<typename T>
81 ALWAYS_INLINE T LoadUnaligned(uintptr_t offset) const {
Roland Levillaina2d8ec62015-03-12 15:25:29 +000082 // Equivalent unsigned integer type corresponding to T.
Vladimir Marko80afd022015-05-19 18:08:00 +010083 typedef typename std::make_unsigned<T>::type U;
Roland Levillaina2d8ec62015-03-12 15:25:29 +000084 U equivalent_unsigned_integer_value = 0;
85 // Read the value byte by byte in a little-endian fashion.
86 for (size_t i = 0; i < sizeof(U); ++i) {
87 equivalent_unsigned_integer_value +=
88 *ComputeInternalPointer<uint8_t>(offset + i) << (i * kBitsPerByte);
89 }
Roland Levillainda4d79b2015-03-24 14:36:11 +000090 return bit_cast<T, U>(equivalent_unsigned_integer_value);
Roland Levillaina2d8ec62015-03-12 15:25:29 +000091 }
92
93 // Store `value` (of type `T`) at `offset`. The memory address
94 // corresponding to `offset` does not need to be word-aligned.
David Brazdilb7656832015-03-30 10:08:19 +010095 template<typename T>
96 ALWAYS_INLINE void StoreUnaligned(uintptr_t offset, T value) const {
Roland Levillaina2d8ec62015-03-12 15:25:29 +000097 // Equivalent unsigned integer type corresponding to T.
Vladimir Marko80afd022015-05-19 18:08:00 +010098 typedef typename std::make_unsigned<T>::type U;
Roland Levillainda4d79b2015-03-24 14:36:11 +000099 U equivalent_unsigned_integer_value = bit_cast<U, T>(value);
Roland Levillaina2d8ec62015-03-12 15:25:29 +0000100 // Write the value byte by byte in a little-endian fashion.
101 for (size_t i = 0; i < sizeof(U); ++i) {
102 *ComputeInternalPointer<uint8_t>(offset + i) =
103 (equivalent_unsigned_integer_value >> (i * kBitsPerByte)) & 0xFF;
104 }
105 }
106
David Brazdilb7656832015-03-30 10:08:19 +0100107 template<typename T>
108 ALWAYS_INLINE T* PointerTo(uintptr_t offset) const {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700109 return ComputeInternalPointer<T>(offset);
110 }
111
Nicolas Geoffray99ea58c2014-07-02 15:08:17 +0100112 // Load a single bit in the region. The bit at offset 0 is the least
113 // significant bit in the first byte.
David Brazdilb7656832015-03-30 10:08:19 +0100114 ALWAYS_INLINE bool LoadBit(uintptr_t bit_offset) const {
Nicolas Geoffray99ea58c2014-07-02 15:08:17 +0100115 uint8_t bit_mask;
116 uint8_t byte = *ComputeBitPointer(bit_offset, &bit_mask);
117 return byte & bit_mask;
118 }
119
David Brazdilb7656832015-03-30 10:08:19 +0100120 ALWAYS_INLINE void StoreBit(uintptr_t bit_offset, bool value) const {
Nicolas Geoffray99ea58c2014-07-02 15:08:17 +0100121 uint8_t bit_mask;
122 uint8_t* byte = ComputeBitPointer(bit_offset, &bit_mask);
123 if (value) {
124 *byte |= bit_mask;
125 } else {
126 *byte &= ~bit_mask;
127 }
128 }
129
Roland Levillaina552e1c2015-03-26 15:01:03 +0000130 // Load `length` bits from the region starting at bit offset `bit_offset`.
131 // The bit at the smallest offset is the least significant bit in the
132 // loaded value. `length` must not be larger than the number of bits
133 // contained in the return value (32).
Mathieu Chartier3ceedc02017-01-25 11:11:02 -0800134 ALWAYS_INLINE uint32_t LoadBits(uintptr_t bit_offset, size_t length) const {
135 DCHECK_LE(length, BitSizeOf<uint32_t>());
136 DCHECK_LE(bit_offset + length, size_in_bits());
137 if (UNLIKELY(length == 0)) {
138 // Do not touch any memory if the range is empty.
139 return 0;
140 }
David Srbecky45aa5982016-03-18 02:15:09 +0000141 const uint8_t* address = begin() + bit_offset / kBitsPerByte;
Mathieu Chartier3ceedc02017-01-25 11:11:02 -0800142 const uint32_t shift = bit_offset & (kBitsPerByte - 1);
143 // Load the value (reading only the strictly needed bytes).
144 const uint32_t load_bit_count = shift + length;
145 uint32_t value = address[0] >> shift;
146 if (load_bit_count > 8) {
147 value |= static_cast<uint32_t>(address[1]) << (8 - shift);
148 if (load_bit_count > 16) {
149 value |= static_cast<uint32_t>(address[2]) << (16 - shift);
150 if (load_bit_count > 24) {
151 value |= static_cast<uint32_t>(address[3]) << (24 - shift);
152 if (load_bit_count > 32) {
153 value |= static_cast<uint32_t>(address[4]) << (32 - shift);
154 }
155 }
156 }
157 }
158 // Clear unwanted most significant bits.
159 uint32_t clear_bit_count = BitSizeOf(value) - length;
160 value = (value << clear_bit_count) >> clear_bit_count;
Roland Levillaina552e1c2015-03-26 15:01:03 +0000161 for (size_t i = 0; i < length; ++i) {
Mathieu Chartier3ceedc02017-01-25 11:11:02 -0800162 DCHECK_EQ((value >> i) & 1, LoadBit(bit_offset + i));
Roland Levillaina552e1c2015-03-26 15:01:03 +0000163 }
164 return value;
165 }
166
167 // Store `value` on `length` bits in the region starting at bit offset
168 // `bit_offset`. The bit at the smallest offset is the least significant
169 // bit of the stored `value`. `value` must not be larger than `length`
170 // bits.
Mathieu Chartier3ceedc02017-01-25 11:11:02 -0800171 void StoreBits(uintptr_t bit_offset, uint32_t value, size_t length);
Roland Levillaina552e1c2015-03-26 15:01:03 +0000172
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700173 void CopyFrom(size_t offset, const MemoryRegion& from) const;
174
David Srbecky45aa5982016-03-18 02:15:09 +0000175 template<class Vector>
176 void CopyFromVector(size_t offset, Vector& vector) const {
177 if (!vector.empty()) {
178 CopyFrom(offset, MemoryRegion(vector.data(), vector.size()));
179 }
180 }
181
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700182 // Compute a sub memory region based on an existing one.
Mingyao Yangccfa8852017-01-18 14:51:59 -0800183 ALWAYS_INLINE MemoryRegion Subregion(uintptr_t offset, uintptr_t size_in) const {
Andreas Gampe277ccbd2014-11-03 21:36:10 -0800184 CHECK_GE(this->size(), size_in);
185 CHECK_LE(offset, this->size() - size_in);
David Srbecky45aa5982016-03-18 02:15:09 +0000186 return MemoryRegion(reinterpret_cast<void*>(begin() + offset), size_in);
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700187 }
188
189 // Compute an extended memory region based on an existing one.
Mingyao Yangccfa8852017-01-18 14:51:59 -0800190 ALWAYS_INLINE void Extend(const MemoryRegion& region, uintptr_t extra) {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700191 pointer_ = region.pointer();
192 size_ = (region.size() + extra);
193 }
194
195 private:
David Brazdilb7656832015-03-30 10:08:19 +0100196 template<typename T>
197 ALWAYS_INLINE T* ComputeInternalPointer(size_t offset) const {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700198 CHECK_GE(size(), sizeof(T));
199 CHECK_LE(offset, size() - sizeof(T));
David Srbecky45aa5982016-03-18 02:15:09 +0000200 return reinterpret_cast<T*>(begin() + offset);
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700201 }
202
203 // Locate the bit with the given offset. Returns a pointer to the byte
204 // containing the bit, and sets bit_mask to the bit within that byte.
David Brazdilb7656832015-03-30 10:08:19 +0100205 ALWAYS_INLINE uint8_t* ComputeBitPointer(uintptr_t bit_offset, uint8_t* bit_mask) const {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700206 uintptr_t bit_remainder = (bit_offset & (kBitsPerByte - 1));
207 *bit_mask = (1U << bit_remainder);
208 uintptr_t byte_offset = (bit_offset >> kBitsPerByteLog2);
Ian Rogers13735952014-10-08 12:43:28 -0700209 return ComputeInternalPointer<uint8_t>(byte_offset);
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700210 }
211
Roland Levillainbdba92d2015-03-31 12:27:44 +0100212 // Is `address` aligned on a machine word?
Andreas Gampe542451c2016-07-26 09:02:02 -0700213 template<typename T> static constexpr bool IsWordAligned(const T* address) {
Roland Levillainbdba92d2015-03-31 12:27:44 +0100214 // Word alignment in bytes.
Andreas Gampe542451c2016-07-26 09:02:02 -0700215 size_t kWordAlignment = static_cast<size_t>(GetInstructionSetPointerSize(kRuntimeISA));
Roland Levillainbdba92d2015-03-31 12:27:44 +0100216 return IsAlignedParam(address, kWordAlignment);
217 }
218
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700219 void* pointer_;
220 size_t size_;
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700221};
222
Carl Shapiro6b6b5f02011-06-21 15:05:09 -0700223} // namespace art
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700224
Brian Carlstromfc0e3212013-07-17 14:40:12 -0700225#endif // ART_RUNTIME_MEMORY_REGION_H_