blob: f867f6a75ad09c1375a2836487455477b23dd4be [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>
Elliott Hughes76160052012-12-12 16:31:20 -080021
Roland Levillainda4d79b2015-03-24 14:36:11 +000022#include "base/casts.h"
Elliott Hughes07ed66b2012-12-12 18:34:25 -080023#include "base/logging.h"
Elliott Hughes76160052012-12-12 16:31:20 -080024#include "base/macros.h"
Ian Rogersd4c4d952014-10-16 20:31:53 -070025#include "base/value_object.h"
Brian Carlstrom578bbdc2011-07-21 14:07:47 -070026#include "globals.h"
Roland Levillaina2d8ec62015-03-12 15:25:29 +000027#include "utils.h"
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070028
Carl Shapiro6b6b5f02011-06-21 15:05:09 -070029namespace art {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070030
31// Memory regions are useful for accessing memory with bounds check in
32// debug mode. They can be safely passed by value and do not assume ownership
33// of the region.
Ian Rogersd4c4d952014-10-16 20:31:53 -070034class MemoryRegion FINAL : public ValueObject {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070035 public:
Ian Rogersd4c4d952014-10-16 20:31:53 -070036 MemoryRegion() : pointer_(nullptr), size_(0) {}
Andreas Gampe277ccbd2014-11-03 21:36:10 -080037 MemoryRegion(void* pointer_in, uintptr_t size_in) : pointer_(pointer_in), size_(size_in) {}
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070038
39 void* pointer() const { return pointer_; }
40 size_t size() const { return size_; }
41 size_t size_in_bits() const { return size_ * kBitsPerByte; }
42
43 static size_t pointer_offset() {
44 return OFFSETOF_MEMBER(MemoryRegion, pointer_);
45 }
46
Ian Rogers13735952014-10-08 12:43:28 -070047 uint8_t* start() const { return reinterpret_cast<uint8_t*>(pointer_); }
48 uint8_t* end() const { return start() + size_; }
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070049
Roland Levillaina2d8ec62015-03-12 15:25:29 +000050 // Load value of type `T` at `offset`. The memory address corresponding
51 // to `offset` should be word-aligned.
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070052 template<typename T> T Load(uintptr_t offset) const {
Roland Levillaina2d8ec62015-03-12 15:25:29 +000053 // TODO: DCHECK that the address is word-aligned.
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070054 return *ComputeInternalPointer<T>(offset);
55 }
56
Roland Levillaina2d8ec62015-03-12 15:25:29 +000057 // Store `value` (of type `T`) at `offset`. The memory address
58 // corresponding to `offset` should be word-aligned.
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070059 template<typename T> void Store(uintptr_t offset, T value) const {
Roland Levillaina2d8ec62015-03-12 15:25:29 +000060 // TODO: DCHECK that the address is word-aligned.
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070061 *ComputeInternalPointer<T>(offset) = value;
62 }
63
Roland Levillaina2d8ec62015-03-12 15:25:29 +000064 // Load value of type `T` at `offset`. The memory address corresponding
65 // to `offset` does not need to be word-aligned.
66 template<typename T> T LoadUnaligned(uintptr_t offset) const {
67 // Equivalent unsigned integer type corresponding to T.
68 typedef typename UnsignedIntegerType<sizeof(T)>::type U;
69 U equivalent_unsigned_integer_value = 0;
70 // Read the value byte by byte in a little-endian fashion.
71 for (size_t i = 0; i < sizeof(U); ++i) {
72 equivalent_unsigned_integer_value +=
73 *ComputeInternalPointer<uint8_t>(offset + i) << (i * kBitsPerByte);
74 }
Roland Levillainda4d79b2015-03-24 14:36:11 +000075 return bit_cast<T, U>(equivalent_unsigned_integer_value);
Roland Levillaina2d8ec62015-03-12 15:25:29 +000076 }
77
78 // Store `value` (of type `T`) at `offset`. The memory address
79 // corresponding to `offset` does not need to be word-aligned.
80 template<typename T> void StoreUnaligned(uintptr_t offset, T value) const {
81 // Equivalent unsigned integer type corresponding to T.
82 typedef typename UnsignedIntegerType<sizeof(T)>::type U;
Roland Levillainda4d79b2015-03-24 14:36:11 +000083 U equivalent_unsigned_integer_value = bit_cast<U, T>(value);
Roland Levillaina2d8ec62015-03-12 15:25:29 +000084 // Write the value byte by byte in a little-endian fashion.
85 for (size_t i = 0; i < sizeof(U); ++i) {
86 *ComputeInternalPointer<uint8_t>(offset + i) =
87 (equivalent_unsigned_integer_value >> (i * kBitsPerByte)) & 0xFF;
88 }
89 }
90
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -070091 template<typename T> T* PointerTo(uintptr_t offset) const {
92 return ComputeInternalPointer<T>(offset);
93 }
94
Nicolas Geoffray99ea58c2014-07-02 15:08:17 +010095 // Load a single bit in the region. The bit at offset 0 is the least
96 // significant bit in the first byte.
97 bool LoadBit(uintptr_t bit_offset) const {
98 uint8_t bit_mask;
99 uint8_t byte = *ComputeBitPointer(bit_offset, &bit_mask);
100 return byte & bit_mask;
101 }
102
103 void StoreBit(uintptr_t bit_offset, bool value) const {
104 uint8_t bit_mask;
105 uint8_t* byte = ComputeBitPointer(bit_offset, &bit_mask);
106 if (value) {
107 *byte |= bit_mask;
108 } else {
109 *byte &= ~bit_mask;
110 }
111 }
112
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700113 void CopyFrom(size_t offset, const MemoryRegion& from) const;
114
115 // Compute a sub memory region based on an existing one.
Andreas Gampe277ccbd2014-11-03 21:36:10 -0800116 MemoryRegion Subregion(uintptr_t offset, uintptr_t size_in) const {
117 CHECK_GE(this->size(), size_in);
118 CHECK_LE(offset, this->size() - size_in);
119 return MemoryRegion(reinterpret_cast<void*>(start() + offset), size_in);
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700120 }
121
122 // Compute an extended memory region based on an existing one.
123 void Extend(const MemoryRegion& region, uintptr_t extra) {
124 pointer_ = region.pointer();
125 size_ = (region.size() + extra);
126 }
127
128 private:
129 template<typename T> T* ComputeInternalPointer(size_t offset) const {
130 CHECK_GE(size(), sizeof(T));
131 CHECK_LE(offset, size() - sizeof(T));
132 return reinterpret_cast<T*>(start() + offset);
133 }
134
135 // Locate the bit with the given offset. Returns a pointer to the byte
136 // containing the bit, and sets bit_mask to the bit within that byte.
Ian Rogers13735952014-10-08 12:43:28 -0700137 uint8_t* ComputeBitPointer(uintptr_t bit_offset, uint8_t* bit_mask) const {
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700138 uintptr_t bit_remainder = (bit_offset & (kBitsPerByte - 1));
139 *bit_mask = (1U << bit_remainder);
140 uintptr_t byte_offset = (bit_offset >> kBitsPerByteLog2);
Ian Rogers13735952014-10-08 12:43:28 -0700141 return ComputeInternalPointer<uint8_t>(byte_offset);
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700142 }
143
144 void* pointer_;
145 size_t size_;
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700146};
147
Carl Shapiro6b6b5f02011-06-21 15:05:09 -0700148} // namespace art
Carl Shapiroa5d5cfd2011-06-21 12:46:59 -0700149
Brian Carlstromfc0e3212013-07-17 14:40:12 -0700150#endif // ART_RUNTIME_MEMORY_REGION_H_