blob: c13b9db7aeb16761b4702628a0542c3287ec007c (
plain)
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
|
// Memory subsystem for the RISC-V[ECTOR] mini-ISA
// Copyright (C) 2025 Siddarth Suresh
// Copyright (C) 2025 bdunahu
// 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 3 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, see <https://www.gnu.org/licenses/>.
#include "storage.h"
#include "definitions.h"
#include <algorithm>
#include <stdexcept>
Storage::Storage(int delay)
{
this->data = new std::vector<std::array<signed int, LINE_SIZE>>;
this->delay = delay;
this->lower = nullptr;
this->current_request = nullptr;
this->wait_time = this->delay;
}
std::vector<std::array<signed int, LINE_SIZE>>
Storage::view(int base, int lines) const
{
base = (base / LINE_SIZE) * LINE_SIZE;
std::vector<std::array<signed int, LINE_SIZE>> ret(lines + 1);
std::copy(this->data->begin() + base, this->data->begin() + base + lines, ret.begin());
return ret;
}
int
Storage::preprocess(void *id)
{
if (id == nullptr)
throw std::invalid_argument("Accessor cannot be nullptr.");
if (this->current_request == nullptr)
this->current_request = id;
return this->current_request == id;
}
int
Storage::is_data_ready()
{
int r;
r = 0;
if (this->wait_time == 0) {
this->current_request = nullptr;
this->wait_time = delay;
r = 1;
} else {
--this->wait_time;
}
return r;
}
|
