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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
// SPDX-License-Identifier: GPL-2.0+
/*******************************************************************************
* QtMips - MIPS 32-bit Architecture Subset Simulator
*
* Implemented to support following courses:
*
* B35APO - Computer Architectures
* https://cw.fel.cvut.cz/wiki/courses/b35apo
*
* B4M35PAP - Advanced Computer Architectures
* https://cw.fel.cvut.cz/wiki/courses/b4m35pap/start
*
* Copyright (c) 2017-2019 Karel Koci<cynerd@email.cz>
* Copyright (c) 2019 Pavel Pisa <pisa@cmp.felk.cvut.cz>
*
* Faculty of Electrical Engineering (http://www.fel.cvut.cz)
* Czech Technical University (http://www.cvut.cz/)
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
******************************************************************************/
#include <QBrush>
#include "memorymodel.h"
MemoryModel::MemoryModel(QObject *parent)
: Super(parent), data_font("Monospace") {
cell_size = CELLSIZE_WORD;
cells_per_row = 1;
index0_offset = 0;
data_font.setStyleHint(QFont::TypeWriter);
machine = nullptr;
memory_change_counter = 0;
cache_data_change_counter = 0;
}
int MemoryModel::rowCount(const QModelIndex & /*parent*/) const {
// std::uint64_t rows = (0x2000 + cells_per_row - 1) / cells_per_row;
return 750;
}
int MemoryModel::columnCount(const QModelIndex & /*parent*/) const {
return cells_per_row + 1;
}
QVariant MemoryModel::headerData(int section, Qt::Orientation orientation, int role) const
{
if(orientation == Qt::Horizontal) {
if(role == Qt::DisplayRole) {
if(section == 0) {
return tr("Address");
}
else {
std::uint32_t addr = (section - 1) * cellSizeBytes();
QString ret = "+" + QString::number(addr, 10);
return ret;
}
}
}
return Super::headerData(section, orientation, role);
}
QVariant MemoryModel::data(const QModelIndex &index, int role) const {
if (role == Qt::DisplayRole)
{
QString s, t;
std::uint32_t address;
std::uint32_t data;
if (!get_row_address(address, index.row()))
return QString("");
if (index.column() == 0) {
t = QString::number(address, 16);
s.fill('0', 8 - t.count());
return "0x" + s + t.toUpper();
}
if (machine == nullptr)
return QString("");
if (machine->memory() == nullptr)
return QString("");
address += cellSizeBytes() * (index.column() - 1);
if (address < index0_offset)
return QString("");
switch (cell_size) {
case CELLSIZE_BYTE:
data = machine->memory()->read_byte(address);
break;
case CELLSIZE_HWORD:
data = machine->memory()->read_hword(address);
break;
default:
case CELLSIZE_WORD:
data = machine->memory()->read_word(address);
break;
}
t = QString::number(data, 16);
s.fill('0', cellSizeBytes() * 2 - t.count());
t = s + t.toUpper();
#if 0
machine::LocationStatus loc_stat = machine::LOCSTAT_NONE;
if (machine->cache_data() != nullptr) {
loc_stat = machine->cache_data()->location_status(address);
if (loc_stat & machine::LOCSTAT_DIRTY)
t += " D";
else if (loc_stat & machine::LOCSTAT_CACHED)
t += " C";
}
#endif
return t;
}
if (role == Qt::BackgroundRole) {
std::uint32_t address;
if (!get_row_address(address, index.row()) ||
machine == nullptr || index.column() == 0)
return QVariant();
address += cellSizeBytes() * (index.column() - 1);
if (machine->cache_data() != nullptr) {
machine::LocationStatus loc_stat;
loc_stat = machine->cache_data()->location_status(address);
if (loc_stat & machine::LOCSTAT_DIRTY) {
QBrush bgd(Qt::yellow);
return bgd;
} else if (loc_stat & machine::LOCSTAT_CACHED) {
QBrush bgd(Qt::lightGray);
return bgd;
}
}
return QVariant();
}
if (role==Qt::FontRole)
return data_font;
return QVariant();
}
void MemoryModel::setup(machine::QtMipsMachine *machine) {
this->machine = machine;
if (machine != nullptr)
connect(machine, SIGNAL(post_tick()), this, SLOT(check_for_updates()));
emit update_all();
}
void MemoryModel::setCellsPerRow(unsigned int cells) {
beginResetModel();
cells_per_row = cells;
endResetModel();
}
void MemoryModel::set_cell_size(int index) {
beginResetModel();
cell_size = (enum MemoryCellSize)index;
index0_offset -= index0_offset % cellSizeBytes();
endResetModel();
emit cell_size_changed();
}
void MemoryModel::update_all() {
if (machine != nullptr && machine->memory() != nullptr) {
memory_change_counter = machine->memory()->get_change_counter();
if (machine->cache_data() != nullptr)
cache_data_change_counter = machine->cache_data()->get_change_counter();
}
emit dataChanged(index(0, 0), index(rowCount() - 1, columnCount() - 1));
}
void MemoryModel::check_for_updates() {
bool need_update = false;
if (machine == nullptr)
return;
if (machine->memory() == nullptr)
return;
if (memory_change_counter != machine->memory()->get_change_counter())
need_update = true;
if (machine->cache_data() != nullptr) {
if (cache_data_change_counter != machine->cache_data()->get_change_counter())
need_update = true;
}
if (!need_update)
return;
update_all();
}
bool MemoryModel::adjustRowAndOffset(int &row, int optimal_row, std::uint32_t address) {
if (optimal_row < rowCount() / 8)
optimal_row = rowCount() / 8;
if (optimal_row >= rowCount() - rowCount() / 8)
optimal_row = rowCount() - rowCount() / 8;
row = rowCount() / 2;
address -= address % cellSizeBytes();
std::uint32_t row_bytes = cells_per_row * cellSizeBytes();
std::uint32_t diff = row * row_bytes;
if (diff > address) {
row = address / row_bytes;
if (row == 0) {
index0_offset = 0;
} else {
index0_offset = address - row * row_bytes;
}
} else {
index0_offset = address - diff;
}
return get_row_for_address(row, address);
}
|
