1 |
2 |
dgisselq |
////////////////////////////////////////////////////////////////////////////////
|
2 |
|
|
//
|
3 |
|
|
// Filename: prefetch.v
|
4 |
|
|
//
|
5 |
|
|
// Project: Zip CPU -- a small, lightweight, RISC CPU soft core
|
6 |
|
|
//
|
7 |
|
|
// Purpose: This is a very simple instruction fetch approach. It gets
|
8 |
|
|
// one instruction at a time. Future versions should pipeline
|
9 |
|
|
// fetches and perhaps even cache results--this doesn't do that.
|
10 |
|
|
// It should, however, be simple enough to get things running.
|
11 |
|
|
//
|
12 |
|
|
// The interface is fascinating. The 'i_pc' input wire is just
|
13 |
|
|
// a suggestion of what to load. Other wires may be loaded
|
14 |
|
|
// instead. i_pc is what must be output, not necessarily input.
|
15 |
|
|
//
|
16 |
|
|
// 20150919 -- Added support for the WB error signal. When reading an
|
17 |
|
|
// instruction results in this signal being raised, the pipefetch
|
18 |
|
|
// module will set an illegal instruction flag to be returned to
|
19 |
|
|
// the CPU together with the instruction. Hence, the ZipCPU
|
20 |
|
|
// can trap on it if necessary.
|
21 |
|
|
//
|
22 |
|
|
// Creator: Dan Gisselquist, Ph.D.
|
23 |
|
|
// Gisselquist Technology, LLC
|
24 |
|
|
//
|
25 |
|
|
////////////////////////////////////////////////////////////////////////////////
|
26 |
|
|
//
|
27 |
|
|
// Copyright (C) 2015, Gisselquist Technology, LLC
|
28 |
|
|
//
|
29 |
|
|
// This program is free software (firmware): you can redistribute it and/or
|
30 |
|
|
// modify it under the terms of the GNU General Public License as published
|
31 |
|
|
// by the Free Software Foundation, either version 3 of the License, or (at
|
32 |
|
|
// your option) any later version.
|
33 |
|
|
//
|
34 |
|
|
// This program is distributed in the hope that it will be useful, but WITHOUT
|
35 |
|
|
// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
|
36 |
|
|
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
37 |
|
|
// for more details.
|
38 |
|
|
//
|
39 |
|
|
// License: GPL, v3, as defined and found on www.gnu.org,
|
40 |
|
|
// http://www.gnu.org/licenses/gpl.html
|
41 |
|
|
//
|
42 |
|
|
//
|
43 |
|
|
////////////////////////////////////////////////////////////////////////////////
|
44 |
|
|
//
|
45 |
|
|
// Flash requires a minimum of 4 clocks per byte to read, so that would be
|
46 |
|
|
// 4*(4bytes/32bit word) = 16 clocks per word read---and that's in pipeline
|
47 |
|
|
// mode which this prefetch does not support. In non--pipelined mode, the
|
48 |
|
|
// flash will require (16+6+6)*2 = 56 clocks plus 16 clocks per word read,
|
49 |
|
|
// or 72 clocks to fetch one instruction.
|
50 |
|
|
module prefetch(i_clk, i_rst, i_ce, i_stalled_n, i_pc, i_aux,
|
51 |
|
|
o_i, o_pc, o_aux, o_valid, o_illegal,
|
52 |
|
|
o_wb_cyc, o_wb_stb, o_wb_we, o_wb_addr, o_wb_data,
|
53 |
|
|
i_wb_ack, i_wb_stall, i_wb_err, i_wb_data);
|
54 |
|
|
parameter ADDRESS_WIDTH=32, AUX_WIDTH = 1, AW=ADDRESS_WIDTH;
|
55 |
|
|
input i_clk, i_rst, i_ce, i_stalled_n;
|
56 |
|
|
input [(AW-1):0] i_pc;
|
57 |
|
|
input [(AUX_WIDTH-1):0] i_aux;
|
58 |
|
|
output reg [31:0] o_i;
|
59 |
|
|
output reg [(AW-1):0] o_pc;
|
60 |
|
|
output reg [(AUX_WIDTH-1):0] o_aux;
|
61 |
|
|
output reg o_valid, o_illegal;
|
62 |
|
|
// Wishbone outputs
|
63 |
|
|
output reg o_wb_cyc, o_wb_stb;
|
64 |
|
|
output wire o_wb_we;
|
65 |
|
|
output reg [(AW-1):0] o_wb_addr;
|
66 |
|
|
output wire [31:0] o_wb_data;
|
67 |
|
|
// And return inputs
|
68 |
|
|
input i_wb_ack, i_wb_stall, i_wb_err;
|
69 |
|
|
input [31:0] i_wb_data;
|
70 |
|
|
|
71 |
|
|
assign o_wb_we = 1'b0;
|
72 |
|
|
assign o_wb_data = 32'h0000;
|
73 |
|
|
|
74 |
|
|
// Let's build it simple and upgrade later: For each instruction
|
75 |
|
|
// we do one bus cycle to get the instruction. Later we should
|
76 |
|
|
// pipeline this, but for now let's just do one at a time.
|
77 |
|
|
initial o_wb_cyc = 1'b0;
|
78 |
|
|
initial o_wb_stb = 1'b0;
|
79 |
|
|
initial o_wb_addr= 0;
|
80 |
|
|
always @(posedge i_clk)
|
81 |
|
|
if ((i_rst)||(i_wb_ack))
|
82 |
|
|
begin
|
83 |
|
|
o_wb_cyc <= 1'b0;
|
84 |
|
|
o_wb_stb <= 1'b0;
|
85 |
|
|
end else if ((i_ce)&&(~o_wb_cyc)) // Initiate a bus cycle
|
86 |
|
|
begin
|
87 |
|
|
o_wb_cyc <= 1'b1;
|
88 |
|
|
o_wb_stb <= 1'b1;
|
89 |
|
|
end else if (o_wb_cyc) // Independent of ce
|
90 |
|
|
begin
|
91 |
|
|
if ((o_wb_cyc)&&(o_wb_stb)&&(~i_wb_stall))
|
92 |
|
|
o_wb_stb <= 1'b0;
|
93 |
|
|
if (i_wb_ack)
|
94 |
|
|
o_wb_cyc <= 1'b0;
|
95 |
|
|
end
|
96 |
|
|
|
97 |
|
|
always @(posedge i_clk)
|
98 |
|
|
if (i_rst) // Set the address to guarantee the result is invalid
|
99 |
|
|
o_wb_addr <= {(AW){1'b1}};
|
100 |
|
|
else if ((i_ce)&&(~o_wb_cyc))
|
101 |
|
|
o_wb_addr <= i_pc;
|
102 |
|
|
always @(posedge i_clk)
|
103 |
|
|
if ((o_wb_cyc)&&(i_wb_ack))
|
104 |
|
|
o_aux <= i_aux;
|
105 |
|
|
always @(posedge i_clk)
|
106 |
|
|
if ((o_wb_cyc)&&(i_wb_ack))
|
107 |
|
|
o_i <= i_wb_data;
|
108 |
|
|
always @(posedge i_clk)
|
109 |
|
|
if ((o_wb_cyc)&&(i_wb_ack))
|
110 |
|
|
o_pc <= o_wb_addr;
|
111 |
|
|
initial o_valid = 1'b0;
|
112 |
|
|
initial o_illegal = 1'b0;
|
113 |
|
|
always @(posedge i_clk)
|
114 |
|
|
if ((o_wb_cyc)&&(i_wb_ack))
|
115 |
|
|
begin
|
116 |
|
|
o_valid <= (i_pc == o_wb_addr)&&(~i_wb_err);
|
117 |
|
|
o_illegal <= i_wb_err;
|
118 |
|
|
end else if (i_stalled_n)
|
119 |
|
|
begin
|
120 |
|
|
o_valid <= 1'b0;
|
121 |
|
|
o_illegal <= 1'b0;
|
122 |
|
|
end
|
123 |
|
|
|
124 |
|
|
endmodule
|