blob: acfffcfbe71c5f8cd4e7e4fecf8ac6293156581b (
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
|
#ifndef WORKER_H
#define WORKER_H
#include "cache.h"
#include "controller.h"
#include "dram.h"
#include "ex.h"
#include "id.h"
#include "if.h"
#include "mm.h"
#include "wb.h"
#include <QDebug>
#include <QObject>
#include <QThread>
#include <deque>
class Worker : public QObject
{
Q_OBJECT
private:
/**
* The storage objects, stored smallest to largest.
*/
std::deque<Storage *> s;
IF *if_stage;
ID *id_stage;
EX *ex_stage;
MM *mm_stage;
WB *wb_stage;
Controller *ct;
/**
* The size each progressive cache level increases by.
*/
unsigned int size_inc;
public:
explicit Worker(QObject *parent = nullptr);
~Worker();
public slots:
void refreshDram();
void refreshCache();
void refreshRegisters();
void runSteps(int steps);
void configure(
std::vector<unsigned int> ways,
std::vector<signed int> program,
bool is_pipelined);
signals:
void clock_cycles(int value, int pc);
void
dram_storage(const std::vector<std::array<signed int, LINE_SIZE>> data);
void
cache_storage(const std::vector<std::array<signed int, LINE_SIZE>> data);
void register_storage(const std::array<int, GPR_NUM> data);
void if_info(const std::vector<int> info);
void id_info(const std::vector<int> info);
void ex_info(const std::vector<int> info);
void mm_info(const std::vector<int> info);
void wb_info(const std::vector<int> info);
void finished();
};
#endif // WORKER_H
|
