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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
|
(*
* Vericert: Verified high-level synthesis.
* Copyright (C) 2020-2022 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 Import 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.verilog.Op.
Require Import vericert.common.Vericertlib.
Require Import vericert.hls.GibleSeq.
Require Import vericert.hls.GiblePar.
Require Import vericert.hls.Gible.
Require Import vericert.hls.Predicate.
Require Import vericert.hls.Abstr.
Require Import vericert.common.DecEq.
Import NE.NonEmptyNotation.
#[local] Open Scope positive.
#[local] Open Scope forest.
#[local] Open Scope pred_op.
(*|
====================
Gible Par Generation
====================
Abstract Computations
=====================
Define the abstract computation using the [update] function, which will set each
register to its symbolic value. First we need to define a few helper functions
to correctly translate the predicates.
|*)
Fixpoint list_translation (l : list reg) (f : forest) {struct l}
: list pred_expr :=
match l with
| nil => nil
| i :: l => (f # (Reg i)) :: (list_translation l f)
end.
Fixpoint replicate {A} (n: nat) (l: A) :=
match n with
| O => nil
| S n => l :: replicate n l
end.
Definition merge''' x y :=
match x, y with
| Some p1, Some p2 => Some (Pand p1 p2)
| Some p, None | None, Some p => Some p
| None, None => None
end.
Definition merge'' x :=
match x with
| ((a, e), (b, el)) => (merge''' a b, Econs e el)
end.
Definition map_pred_op {A B} (pf: option pred_op * (A -> B))
(pa: option pred_op * A): option pred_op * B :=
match pa, pf with
| (p, a), (p', f) => (merge''' p p', f a)
end.
Definition predicated_prod {A B: Type} (p1: predicated A) (p2: predicated B) :=
NE.map (fun x => match x with ((a, b), (c, d)) => (Pand a c, (b, d)) end)
(NE.non_empty_prod p1 p2).
Definition predicated_map {A B: Type} (f: A -> B) (p: predicated A)
: predicated B := NE.map (fun x => (fst x, f (snd x))) p.
(*map (fun x => (fst x, Econs (snd x) Enil)) pel*)
Definition merge' (pel: pred_expr) (tpel: predicated expression_list) :=
predicated_map (uncurry Econs) (predicated_prod pel tpel).
Fixpoint merge (pel: list pred_expr): predicated expression_list :=
match pel with
| nil => NE.singleton (T, Enil)
| a :: b => merge' a (merge b)
end.
Definition map_predicated {A B} (pf: predicated (A -> B)) (pa: predicated A)
: predicated B :=
predicated_map (fun x => (fst x) (snd x)) (predicated_prod pf pa).
Definition predicated_apply1 {A B} (pf: predicated (A -> B)) (pa: A)
: predicated B :=
NE.map (fun x => (fst x, (snd x) pa)) pf.
Definition predicated_apply2 {A B C} (pf: predicated (A -> B -> C)) (pa: A)
(pb: B): predicated C :=
NE.map (fun x => (fst x, (snd x) pa pb)) pf.
Definition predicated_apply3 {A B C D} (pf: predicated (A -> B -> C -> D))
(pa: A) (pb: B) (pc: C): predicated D :=
NE.map (fun x => (fst x, (snd x) pa pb pc)) pf.
Definition predicated_from_opt {A: Type} (p: option pred_op) (a: A) :=
match p with
| Some p' => NE.singleton (p', a)
| None => NE.singleton (T, a)
end.
#[local] Open Scope non_empty_scope.
#[local] Open Scope pred_op.
Fixpoint NEfold_left {A B} (f: A -> B -> A) (l: NE.non_empty B) (a: A) : A :=
match l with
| NE.singleton a' => f a a'
| a' ::| b => NEfold_left f b (f a a')
end.
Fixpoint NEapp {A} (l m: NE.non_empty A) :=
match l with
| NE.singleton a => a ::| m
| a ::| b => a ::| NEapp b m
end.
Definition app_predicated' {A: Type} (a b: predicated A) :=
let negation := ¬ (NEfold_left (fun a b => a ∨ (fst b)) b ⟂) in
NEapp (NE.map (fun x => (negation ∧ fst x, snd x)) a) b.
Definition app_predicated {A: Type} (p: option pred_op) (a b: predicated A) :=
match p with
| Some p' => NEapp (NE.map (fun x => (¬ p' ∧ fst x, snd x)) a)
(NE.map (fun x => (p' ∧ fst x, snd x)) b)
| None => b
end.
Definition pred_ret {A: Type} (a: A) : predicated A :=
NE.singleton (T, a).
(*|
Update Function
---------------
The ``update`` function will generate a new forest given an existing forest and
a new instruction, so that it can evaluate a symbolic expression by folding over
a list of instructions. The main problem is that predicates need to be merged
as well, so that:
1. The predicates are *independent*.
2. The expression assigned to the register should still be correct.
This is done by multiplying the predicates together, and assigning the negation
of the expression to the other predicates.
|*)
Definition upd_pred_forest (p: option pred_op) (f: forest) :=
match p with
| Some p' =>
PTree.map (fun i e =>
NE.map (fun (x: pred_op * expression) =>
let (pred, expr) := x in
(Pand p' pred, expr)
) e) f
| None => f
end.
Definition update (fop : option pred_op * forest) (i : instr): (option pred_op * forest) :=
let (pred, f) := fop in
match i with
| RBnop => fop
| RBop p op rl r =>
(pred, f # (Reg r) <-
(app_predicated (combine_pred p pred)
(f # (Reg r))
(map_predicated (pred_ret (Eop op)) (merge (list_translation rl f)))))
| RBload p chunk addr rl r =>
(pred, f # (Reg r) <-
(app_predicated (combine_pred p pred)
(f # (Reg r))
(map_predicated
(map_predicated (pred_ret (Eload chunk addr))
(merge (list_translation rl f)))
(f # Mem))))
| RBstore p chunk addr rl r =>
(pred, f # Mem <-
(app_predicated (combine_pred p pred)
(f # Mem)
(map_predicated
(map_predicated
(predicated_apply2 (map_predicated (pred_ret Estore)
(f # (Reg r))) chunk addr)
(merge (list_translation rl f))) (f # Mem))))
| RBsetpred p' c args p =>
(pred, f # (Pred p) <-
(app_predicated (combine_pred p' pred)
(f # (Pred p))
(map_predicated (pred_ret (Esetpred c))
(merge (list_translation args f)))))
| RBexit p c =>
(combine_pred (Some (negate (Option.default T p))) pred,
f # Exit <-
(app_predicated (combine_pred p pred) (f # Exit) (pred_ret (Eexit c))))
end.
(*|
Implementing which are necessary to show the correctness of the translation
validation by showing that there aren't any more effects in the resultant RTLPar
code than in the RTLBlock code.
Get a sequence from the basic block.
|*)
Definition abstract_sequence (b : list instr) : forest :=
snd (fold_left update b (None, empty)).
(*|
Check equivalence of control flow instructions. As none of the basic blocks
should have been moved, none of the labels should be different, meaning the
control-flow instructions should match exactly.
|*)
Definition check_control_flow_instr (c1 c2: cf_instr) : bool :=
if cf_instr_eq c1 c2 then true else false.
(*|
We define the top-level oracle that will check if two basic blocks are
equivalent after a scheduling transformation.
|*)
Definition empty_trees (bb: SeqBB.t) (bbt: ParBB.t) : bool :=
match bb with
| nil =>
match bbt with
| nil => true
| _ => false
end
| _ => true
end.
Definition schedule_oracle (bb: SeqBB.t) (bbt: ParBB.t) : bool :=
(check (abstract_sequence bb) (abstract_sequence (concat (concat bbt))))
&& empty_trees bb bbt.
Definition check_scheduled_trees := beq2 schedule_oracle.
Ltac solve_scheduled_trees_correct :=
intros; unfold check_scheduled_trees in *;
match goal with
| [ H: context[beq2 _ _ _], x: positive |- _ ] =>
rewrite beq2_correct in H; specialize (H x)
end; repeat destruct_match; crush.
Lemma check_scheduled_trees_correct:
forall f1 f2 x y1,
check_scheduled_trees f1 f2 = true ->
PTree.get x f1 = Some y1 ->
exists y2, PTree.get x f2 = Some y2 /\ schedule_oracle y1 y2 = true.
Proof. solve_scheduled_trees_correct; eexists; crush. Qed.
Lemma check_scheduled_trees_correct2:
forall f1 f2 x,
check_scheduled_trees f1 f2 = true ->
PTree.get x f1 = None ->
PTree.get x f2 = None.
Proof. solve_scheduled_trees_correct. Qed.
(*|
Top-level Functions
===================
|*)
Parameter schedule : GibleSeq.function -> GiblePar.function.
Definition transl_function (f: GibleSeq.function)
: Errors.res GiblePar.function :=
let tfcode := fn_code (schedule f) in
if check_scheduled_trees f.(GibleSeq.fn_code) tfcode then
Errors.OK (mkfunction f.(GibleSeq.fn_sig)
f.(GibleSeq.fn_params)
f.(GibleSeq.fn_stacksize)
tfcode
f.(GibleSeq.fn_entrypoint))
else
Errors.Error
(Errors.msg "RTLPargen: Could not prove the blocks equivalent.").
Definition transl_fundef := transf_partial_fundef transl_function.
Definition transl_program (p : GibleSeq.program) : Errors.res GiblePar.program :=
transform_partial_program transl_fundef p.
|
