-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfibonacci.bsv
More file actions
61 lines (50 loc) · 1.53 KB
/
fibonacci.bsv
File metadata and controls
61 lines (50 loc) · 1.53 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
package fibonacci;
import ClientServer :: *;
import GetPut::*;
interface FibonacciInterface;
interface Server #(Bit#(32), Bit#(32)) server;
endinterface
typedef enum { IDLE, THINKING, DONE } FibState deriving (Eq, Bits, FShow);
(* synthesize *)
module mkFibonacciGenerator (FibonacciInterface);
Reg #(FibState) state <- mkReg (IDLE);
Reg #(Bit#(32)) counter <- mkReg(0);
Reg #(Bit#(32)) cur <- mkReg(0);
Reg #(Bit#(32)) prev <- mkReg(0);
rule calc (state == THINKING && counter != 0);
prev <= cur;
cur <= prev + cur;
counter <= counter - 1;
if (counter == 1)
state <= DONE;
endrule
interface Server server;
interface Put request;
method Action put(Bit#(32) index) if (state == IDLE);
state <= THINKING;
cur <= 1;
prev <= 0;
counter <= index;
endmethod
endinterface
interface Get response;
method ActionValue#(Bit#(32)) get() if (state == DONE);
state <= IDLE;
return cur;
endmethod
endinterface
endinterface
endmodule: mkFibonacciGenerator
(* synthesize *)
module mkFbTestbench(Empty);
FibonacciInterface fib <- mkFibonacciGenerator();
rule kick;
fib.server.request.put(11);
endrule
rule get;
let result = fib.server.response.get();
$display("result %d\n", result);
$finish(0);
endrule
endmodule: mkFbTestbench
endpackage: fibonacci