blob: 1c06ac28c886216b371eb1ef51c439615d5c5093 (
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
|
// Simulator 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/>.
#ifndef EX_H
#define EX_H
#include "instrDTO.h"
#include "response.h"
#include "stage.h"
#include <exception>
#include <unordered_map>
class HaltException : public std::exception
{
const char *what() const noexcept override {
return "";
}
};
class EX : public Stage
{
public:
/**
* Constructor.
* @param The next stage in the pipeline.
* @return A newly allocated EX object.
*/
EX(Stage *next);
using Stage::advance;
private:
void advance_helper();
/**
* Wrapper for division functions, which detects HALT instructinos (division
* by 0).
* @param the numerator
* @param the denominator
* @param if the modulo operator should instead be used
*/
void handle_divide(signed int &s1, signed int s2, bool is_mod);
/**
* Maps each mnemonic to a function which carries out the instruction's base
* logic.
* All instructions store the result into s1.
*/
std::unordered_map<
Mnemonic,
std::function<void(
signed int &s1, signed int s2, signed int s3, unsigned int pc)>>
instr_map;
};
#endif /* EX_H_INCLUDED */
|
