blob: 212dbc07ef195a26e5d04efc752e5cffdfd57d30 (
plain)
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
|
(*
* CoqUp: Verified high-level synthesis.
* Copyright (C) 2019-2020 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/>.
*)
From Coq Require Import
Structures.OrderedTypeEx
FSets.FMapPositive
Program.Basics
PeanoNat
ZArith.
From bbv Require Word.
From coqup.common Require Import Coquplib Show.
From compcert Require Integers.
Import ListNotations.
Definition reg : Type := positive.
Record value : Type := mkvalue {
vsize : nat;
vword : Word.word vsize
}.
Definition posToValue (p : positive) : value :=
let size := Z.to_nat (Z.succ (log_inf p)) in
mkvalue size (Word.posToWord size p).
Definition ZToValue (s : nat) (z : Z) : value :=
mkvalue s (Word.ZToWord s z).
Definition intToValue (i : Integers.int) : value :=
mkvalue 32%nat (Word.ZToWord 32%nat (Integers.Int.unsigned i)).
Definition valueToZ (v : value) : Z :=
Word.uwordToZ v.(vword).
Definition state : Type := PositiveMap.t value * PositiveMap.t value.
Inductive binop : Type :=
| Vadd : binop (** addition (binary [+]) *)
| Vsub : binop (** subtraction (binary [-]) *)
| Vmul : binop (** multiplication (binary [*]) *)
| Vdiv : binop (** division (binary [/]) *)
| Vdivu : binop (** division unsigned (binary [/]) *)
| Vmod : binop (** remainder ([%]) *)
| Vmodu : binop (** remainder unsigned ([/]) *)
| Vlt : binop (** less than ([<]) *)
| Vltu : binop (** less than unsigned ([<]) *)
| Vgt : binop (** greater than ([>]) *)
| Vgtu : binop (** greater than unsigned ([>]) *)
| Vle : binop (** less than or equal ([<=]) *)
| Vleu : binop (** less than or equal unsigned ([<=]) *)
| Vge : binop (** greater than or equal ([>=]) *)
| Vgeu : binop (** greater than or equal unsigned ([>=]) *)
| Veq : binop (** equal to ([==]) *)
| Vne : binop (** not equal to ([!=]) *)
| Vand : binop (** and (binary [&]) *)
| Vor : binop (** or (binary [|]) *)
| Vxor : binop (** xor (binary [^|]) *)
| Vshl : binop (** shift left ([<<]) *)
| Vshr : binop. (** shift left ([<<]) *)
Inductive unop : Type :=
| Vneg (** negation ([~]) *)
| Vnot. (** not operation [!] *)
Inductive expr : Type :=
| Vlit : value -> expr
| Vvar : reg -> expr
| Vbinop : binop -> expr -> expr -> expr
| Vunop : unop -> expr -> expr
| Vternary : expr -> expr -> expr -> expr.
Definition posToExpr (p : positive) : expr :=
Vlit (posToValue p).
Inductive stmnt : Type :=
| Vskip : stmnt
| Vseq : list stmnt -> stmnt
| Vcond : expr -> stmnt -> stmnt -> stmnt
| Vcase : expr -> list (expr * stmnt) -> stmnt
| Vblock : expr -> expr -> stmnt
| Vnonblock : expr -> expr -> stmnt.
(** [edge] is not part of [stmnt] in this formalisation because is closer to the
semantics that are used. *)
Inductive edge : Type :=
| Vposedge : reg -> edge
| Vnegedge : reg -> edge
| Valledge : edge
| Voredge : edge -> edge -> edge.
Inductive module_item : Type :=
| Vdecl : reg -> nat -> expr -> module_item
| Valways : edge -> stmnt -> module_item.
(** [mod_start] If set, starts the computations in the module. *)
(** [mod_reset] If set, reset the state in the module. *)
(** [mod_clk] The clock that controls the computation in the module. *)
(** [mod_args] The arguments to the module. *)
(** [mod_finish] Bit that is set if the result is ready. *)
(** [mod_return] The return value that was computed. *)
(** [mod_body] The body of the module, including the state machine. *)
Record module : Type := mkmodule {
mod_start : reg;
mod_reset : reg;
mod_clk : reg;
mod_finish : reg;
mod_return : reg;
mod_args : list reg;
mod_body : list module_item;
}.
(** Convert a [positive] to an expression directly, setting it to the right
size. *)
Definition posToLit (p : positive) : expr :=
Vlit (posToValue p).
Coercion Vlit : value >-> expr.
Coercion Vvar : reg >-> expr.
|
