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
|
(*
* Vericert: Verified high-level synthesis.
* Copyright (C) 2021 Yann Herklotz <yann@yannherklotz.com>
*
* 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/>.
*)
Require Import compcert.backend.Registers.
Require Import compcert.common.AST.
Require Import compcert.common.Globalenvs.
Require compcert.common.Memory.
Require Import compcert.common.Values.
Require Import compcert.lib.Floats.
Require Import compcert.lib.Integers.
Require Import compcert.lib.Maps.
Require compcert.common.Smallstep.
Require compcert.verilog.Op.
Require Import vericert.common.Vericertlib.
Require Import vericert.hls.ValueInt.
Require Import vericert.hls.Verilog.
Require Import vericert.hls.HTL.
Require Import vericert.hls.AssocMap.
Local Open Scope positive.
Definition max_pc_function (m: module) :=
List.fold_left Pos.max (List.map fst (PTree.elements m.(mod_controllogic))) 1.
Definition transf_maps (st addr d_in d_out wr: reg)
(dc: node * PTree.t stmnt * PTree.t stmnt) i :=
match dc with
| (n, d, c) =>
match PTree.get i d, PTree.get i c with
| Some d_s, Some c_s =>
match d_s with
| Vnonblock (Vvari r e1) e2 =>
let nd := Vseq (Vnonblock (Vvar wr) (Vlit (ZToValue 1)))
(Vseq (Vnonblock (Vvar d_in) e2)
(Vnonblock (Vvar addr) e1))
in
(n, PTree.set i nd d, c)
| Vnonblock e1 (Vvari r e2) =>
let nd := Vseq (Vnonblock (Vvar wr) (Vlit (ZToValue 0)))
(Vnonblock (Vvar addr) e2)
in
let aout := Vnonblock e1 (Vvar d_out) in
let redirect := Vnonblock (Vvar st) (Vlit (posToValue n)) in
(n+1, PTree.set i nd
(PTree.set n aout d),
PTree.set i redirect (PTree.set n c_s c))
| _ => dc
end
| _, _ => dc
end
end.
Lemma is_wf:
forall A nc nd,
@map_well_formed A nc /\ @map_well_formed A nd.
Admitted.
Definition transf_module (m: module): module :=
let addr := m.(mod_clk)+1 in
let d_in := m.(mod_clk)+2 in
let d_out := m.(mod_clk)+3 in
let wr_en := m.(mod_clk)+4 in
match fold_left (transf_maps m.(mod_st) addr d_in d_out wr_en)
(map fst (PTree.elements m.(mod_datapath)))
(max_pc_function m + 1, m.(mod_datapath), m.(mod_controllogic))
with
| (_, nd, nc) =>
mkmodule m.(mod_params)
nd
nc
m.(mod_entrypoint)
m.(mod_st)
m.(mod_stk)
(2 ^ Nat.log2_up m.(mod_stk_len))%nat
m.(mod_finish)
m.(mod_return)
m.(mod_start)
m.(mod_reset)
m.(mod_clk)
(AssocMap.set wr_en (None, VScalar 32)
(AssocMap.set d_out (None, VScalar 32)
(AssocMap.set d_in (None, VScalar 32)
(AssocMap.set addr (None, VScalar 32) m.(mod_scldecls)))))
(AssocMap.set m.(mod_stk) (None, VArray 32 (2 ^ Nat.log2_up m.(mod_stk_len)))%nat m.(mod_arrdecls))
(Some (addr, d_in, d_out, wr_en))
(is_wf _ nc nd)
end.
Lemma fold_has_value:
forall st d c addr d_in d_out wr_en mst data ctrl l n dstm cstm,
data ! st = Some dstm ->
ctrl ! st = Some cstm ->
fold_left (transf_maps st addr d_in d_out wr_en) l
(mst, data, ctrl) = (n, d, c) ->
exists dstm' cstm', d ! st = Some dstm' /\ c ! st = Some cstm'.
Admitted.
Definition transf_fundef := transf_fundef transf_module.
Definition transf_program (p : program) :=
transform_program transf_fundef p.
Inductive match_states : HTL.state -> HTL.state -> Prop :=
| match_state :
forall res m st asr asa,
match_states (HTL.State res m st asr asa)
(HTL.State res (transf_module m) st asr asa)
| match_returnstate :
forall res v,
match_states (HTL.Returnstate res v) (HTL.Returnstate res v)
| match_initial_call :
forall m,
match_states (HTL.Callstate nil m nil)
(HTL.Callstate nil (transf_module m) nil).
Hint Constructors match_states : htlproof.
Definition match_prog (p: program) (tp: program) :=
Linking.match_program (fun cu f tf => tf = transf_fundef f) eq p tp.
Lemma transf_program_match:
forall p, match_prog p (transf_program p).
Proof.
intros. unfold transf_program, match_prog.
apply Linking.match_transform_program.
Qed.
Section CORRECTNESS.
Context (prog: program).
Let tprog := transf_program prog.
Let ge : HTL.genv := Globalenvs.Genv.globalenv prog.
Theorem transf_step_correct:
forall (S1 : state) t S2,
step ge S1 t S2 ->
forall R1,
match_states S1 R1 ->
exists R2, Smallstep.plus step ge R1 t R2 /\ match_states S2 R2.
Proof.
induction 1.
- intros. inv H11.
unfold transf_module.
econstructor.
econstructor.
eapply Smallstep.plus_one.
econstructor.
simplify.
all: repeat destruct_match; try assumption; simplify.
End CORRECTNESS.
|
