forked from google/binexport
-
Notifications
You must be signed in to change notification settings - Fork 0
/
virtual_memory.h
112 lines (91 loc) · 3.7 KB
/
virtual_memory.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
// Copyright 2011-2024 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef VIRTUAL_MEMORY_H_
#define VIRTUAL_MEMORY_H_
#include <atomic>
#include <map>
#include <vector>
#include "third_party/absl/container/btree_map.h"
#include "third_party/absl/container/flat_hash_map.h"
#include "third_party/zynamics/binexport/util/types.h"
class AddressSpace {
public:
enum {
kRead = 1 << 0, // Address space is readable.
kWrite = 1 << 1, // Address space is writable.
kExecute = 1 << 2 // Address space is executable.
};
using MemoryBlock = std::vector<Byte>;
using Data = absl::btree_map<Address, MemoryBlock>;
using Flags = absl::flat_hash_map<Address, int>;
// Copies the block. Returns true iff the block was added successfully, false
// if the block overlaps with existing memory.
bool AddMemoryBlock(Address address, const MemoryBlock& block, int flags);
// Returns the memory block containing address.
Data::const_iterator GetMemoryBlock(Address address) const;
Data::iterator GetMemoryBlock(Address address);
// Returns true iff address is mapped in this address space, i.e. falls into
// one of the memory blocks owned by this class.
bool IsValidAddress(Address address) const;
// Returns true iff the MemoryBlock at this address is readable.
bool IsReadable(Address address) const;
// Returns true iff the MemoryBlock at this address is writable.
bool IsWritable(Address address) const;
// Returns true iff the MemoryBlock at this address is executable.
bool IsExecutable(Address address) const;
// Get flags for a specific address:
int GetFlags(Address address) const;
// Size of the entire address space in bytes. Runtime O(number of memory
// blocks).
size_t size() const;
// Read only address to the map of memory blocks. Sorted by ascending address.
const Data& data() const { return data_; }
// Access the byte at address. Undefined behavior if address is not mapped in
// this AddressSpace.
const Byte& operator[](Address address) const;
Byte& operator[](Address address);
// Interprets the bytes at address as a little endian value and stores the
// results. Returns true if the read was successful.
template <typename T>
bool ReadLittleEndian(Address address, T* data) const;
template <typename T>
bool ReadLittleEndian(const MemoryBlock& memory_block,
MemoryBlock::size_type index, T* data) const;
private:
Data data_;
Flags flags_;
};
template <typename T>
bool AddressSpace::ReadLittleEndian(Address address, T* data) const {
const auto memory_block = GetMemoryBlock(address);
if (memory_block == data_.end()) {
return false;
}
return ReadLittleEndian(memory_block->second, address - memory_block->first,
data);
}
template <typename T>
bool AddressSpace::ReadLittleEndian(const MemoryBlock& memory_block,
MemoryBlock::size_type index,
T* data) const {
if (!data || index + sizeof(T) > memory_block.size()) {
return false;
}
*data = 0;
for (T i = 0; i < sizeof(T); ++i) {
*data |= static_cast<T>(memory_block[index + i]) << (i * 8);
}
return true;
}
#endif // VIRTUAL_MEMORY_H_