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
|
#ifndef MEMORY_H
#define MEMORY_H
#include <QObject>
#include <cstdint>
#include <qtmipsexception.h>
namespace machine {
// Virtual class for common memory access
class MemoryAccess : public QObject {
Q_OBJECT
public:
void write_byte(std::uint32_t offset, std::uint8_t value);
void write_hword(std::uint32_t offset, std::uint16_t value);
void write_word(std::uint32_t offset, std::uint32_t value);
std::uint8_t read_byte(std::uint32_t offset) const;
std::uint16_t read_hword(std::uint32_t offset) const;
std::uint32_t read_word(std::uint32_t offset) const;
enum AccessControl {
AC_NONE,
AC_BYTE,
AC_HALFWORD,
AC_WORD,
AC_BYTE_UNSIGNED,
AC_HALFWORD_UNSIGNED
};
void write_ctl(enum AccessControl ctl, std::uint32_t offset, std::uint32_t value);
std::uint32_t read_ctl(enum AccessControl ctl, std::uint32_t offset) const;
signals:
void byte_change(std::uint32_t address, std::uint32_t value);
protected:
virtual void wbyte(std::uint32_t offset, std::uint8_t value) = 0;
virtual std::uint8_t rbyte(std::uint32_t offset) const = 0;
};
class MemorySection : public MemoryAccess {
public:
MemorySection(std::uint32_t length);
MemorySection(const MemorySection&);
~MemorySection();
void wbyte(std::uint32_t offset, std::uint8_t value);
std::uint8_t rbyte(std::uint32_t offset) const;
void merge(MemorySection&);
std::uint32_t length() const;
const std::uint8_t* data() const;
bool operator==(const MemorySection&) const;
bool operator!=(const MemorySection&) const;
private:
std::uint32_t len;
std::uint8_t *dt;
};
//////////////////////////////////////////////////////////////////////////////
/// Some optimalization options
// How big memory sections will be (2^8=256)
#define MEMORY_SECTION_BITS 8
// How deep memory lookup tree will be
#define MEMORY_TREE_H 4
//////////////////////////////////////////////////////////////////////////////
union MemoryTree;
class Memory : public MemoryAccess {
Q_OBJECT
public:
Memory();
Memory(const Memory&);
~Memory();
void reset(); // Reset whole content of memory (removes old tree and creates new one)
void reset(const Memory&);
MemorySection *get_section(std::uint32_t address, bool create) const; // returns section containing given address
void wbyte(std::uint32_t address, std::uint8_t value);
std::uint8_t rbyte(std::uint32_t address) const;
bool operator==(const Memory&) const;
bool operator!=(const Memory&) const;
const union MemoryTree *get_memorytree_root() const;
// These functions locate next start or end of next allocated tree leaf
std::uint32_t next_allocated(std::uint32_t) const;
std::uint32_t prev_allocated(std::uint32_t) const;
private:
union MemoryTree *mt_root;
static union MemoryTree *allocate_section_tree();
static void free_section_tree(union MemoryTree*, size_t depth);
static bool compare_section_tree(const union MemoryTree*, const union MemoryTree*, size_t depth);
static bool is_zero_section_tree(const union MemoryTree*, size_t depth);
static union MemoryTree *copy_section_tree(const union MemoryTree*, size_t depth);
};
}
Q_DECLARE_METATYPE(machine::MemoryAccess::AccessControl)
Q_DECLARE_METATYPE(machine::Memory)
#endif // MEMORY_H
|
