This repository was archived by the owner on Jul 3, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreorder-buffer.c
More file actions
204 lines (195 loc) · 5.86 KB
/
reorder-buffer.c
File metadata and controls
204 lines (195 loc) · 5.86 KB
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
#include <assert.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdlib.h>
#include "branch-predictor.h"
#include "clk.h"
#include "memory.h"
#include "reorder-buffer.h"
#include "bus.h"
#include "lib/closure.h"
#include "inst-unit.h"
#include "ls-queue.h"
#include "reg-store.h"
#include "lib/log.h"
#include "queue.h"
#include "reg.h"
#include "reservation-station.h"
#include "rv32i.h"
bool _rob_is_mispredicted (rob_payload_t payload) {
if (payload.op == ROB_BRANCH) {
return payload.predicted_take.take != payload.value;
} else if (payload.op == ROB_JALR) {
return payload.predicted_addr != (payload.addr & ~1u);
}
debug_log("bad payload op %d", payload.op);
assert(false);
}
addr_t _rob_addr (rob_payload_t payload) {
if (payload.op == ROB_BRANCH) return payload.fallback;
if (payload.op == ROB_JALR) return payload.addr & ~1u;
debug_log("bad payload op %d", payload.op);
assert(false);
}
void _rob_commit (const reorder_buffer_t *rob,
rob_unit_t *unit) {
++unit->commit_count;
const rob_payload_t *data =
rm_read(rob->payload, rob_payload_t);
debug_log("ROB %2d commits for addr %08x!", rob->id,
data->pc);
#ifdef PRINT_PC
printf("%08x\n", data->pc);
#endif
bool success = true;
switch (data->op) {
case ROB_BRANCH:
case ROB_JALR:
if (data->dest >= 0) { // JAL or JALR
reg_store_set(unit->reg_store, data->dest,
data->value);
}
bool mispredicted = _rob_is_mispredicted(*data);
if (data->op == ROB_BRANCH) {
bp_feedback(unit->branch_predictor, data->pc,
data->predicted_take, data->value);
} else {
bp_feedback_jalr(unit->branch_predictor, data->pc,
data->addr & ~1u, !mispredicted);
}
if (mispredicted) {
addr_t addr = _rob_addr(*data);
debug_log("branch prediction failed, writing pc addr %08x",
addr);
inst_unit_force_pc(unit->inst_unit, addr);
reg_file_clear(unit->reg_store);
rob_unit_clear(unit);
rs_unit_clear(unit->rs_unit);
ls_queue_clear(unit->ls_queue);
bus_clear(unit->cdb);
mem_clear(unit->mem);
} else {
debug_log("branch prediction success!");
}
break;
case ROB_REGISTER:
debug_log("commit: reg[%02d] = %08x", data->dest,
data->value);
reg_store_set(unit->reg_store, data->dest, data->value);
break;
case ROB_STORE:
if (ls_queue_full(unit->ls_queue)) {
success = false;
} else {
ls_queue_push(unit->ls_queue, (ls_queue_payload_t) {
.op = LS_STORE,
.size = data->size,
.addr = data->addr,
.value = data->value,
});
}
break;
case ROB_HCF:
hcf = true;
success = false;
break;
default:
debug_log("unknown rob op %d", data->op);
assert(false);
}
if (success) {
if (data->dest >= 0) {
reg_store_rob_id_clear(unit->reg_store, data->dest,
rob->id);
}
rm_write(rob->ready, bool) = false;
queue_pop(unit->robs);
}
}
void _rob_unit_tick (void *state, va_list args) {
rob_unit_t *unit = (rob_unit_t *) state;
if (*rm_read(unit->robs->clear, bool)) return;
if (queue_empty(unit->robs)) return;
const reorder_buffer_t *rob =
rm_read(queue_first(unit->robs), reorder_buffer_t);
if (!*rm_read(rob->ready, bool)) return;
_rob_commit(rob, unit);
}
void _rob_unit_onmsg (void *state, va_list args) {
cdb_message_t *msg = va_arg(args, cdb_message_t *);
rob_unit_t *unit = (rob_unit_t *) state;
if (*rm_read(unit->robs->clear, bool)) return;
reg_mut_t *reg;
queue_foreach (unit->robs, i, reg) {
const reorder_buffer_t *buf =
rm_read(reg, reorder_buffer_t);
if (msg->rob == buf->id) {
rob_payload_t *data =
&rm_write(buf->payload, rob_payload_t);
if (data->op == ROB_JALR) {
data->addr = msg->result;
} else {
data->value = msg->result;
}
rm_write(buf->ready, bool) = true;
}
}
}
rob_unit_t *rob_unit_create (reg_store_t *regs,
ls_queue_t *queue,
inst_unit_t *inst_unit,
rs_unit_t *rs_unit,
memory_t *mem,
branch_predictor_t *bp,
bus_t *cdb,
clk_t *clk) {
rob_unit_t *unit =
(rob_unit_t *) malloc(sizeof(rob_unit_t));
unit->reg_store = regs;
unit->ls_queue = queue;
unit->inst_unit = inst_unit;
unit->rs_unit = rs_unit;
unit->mem = mem;
unit->branch_predictor = bp;
unit->cdb = cdb;
unit->robs = queue_create(ROB_CAPACITY,
sizeof(reorder_buffer_t), clk);
for (int i = 0; i < ROB_CAPACITY; ++i) {
reorder_buffer_t *buf =
&rm_write(queue_id(unit->robs, i), reorder_buffer_t);
buf->id = i + 1;
buf->ready = reg_mut_create(sizeof(bool), clk);
buf->payload =
reg_mut_create(sizeof(rob_payload_t), clk);
}
unit->commit_count = 0;
bus_listen(cdb, closure_create(_rob_unit_onmsg, unit));
clk_add_callback(clk, closure_create(_rob_unit_tick, unit));
return unit;
}
void rob_unit_free (rob_unit_t *unit) {
for (int i = 0; i < ROB_CAPACITY; ++i) {
const reorder_buffer_t *rob =
rm_read(queue_id(unit->robs, i), reorder_buffer_t);
reg_mut_free(rob->ready);
reg_mut_free(rob->payload);
}
queue_free(unit->robs);
free(unit);
}
const reorder_buffer_t *rob_unit_find (rob_unit_t *unit,
rob_id_t id) {
return rm_read(queue_id(unit->robs, id - 1),
reorder_buffer_t);
}
bool rob_unit_full (rob_unit_t *unit) {
return queue_full(unit->robs);
}
reorder_buffer_t *rob_unit_acquire (rob_unit_t *unit) {
reg_mut_t *rm = queue_push(unit->robs);
if (!rm) return NULL;
return &rm_write(rm, reorder_buffer_t);
}
void rob_unit_clear (rob_unit_t *unit) {
queue_clear(unit->robs);
}