blob: 2f9aae6c81f71027fe5f89b684d10ea01e4717d6 (
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
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
|
Require Import BinInt.
Require Import Lia.
Require Import ZBinary.
From bbv Require Import ZLib.
From compcert Require Import Integers Coqlib.
Require Import Coquplib.
Local Open Scope Z_scope.
Module PtrofsExtra.
Ltac ptrofs_mod_match m :=
match goal with
| [ H : ?x = 0 |- context[?x] ] => rewrite H
| [ _ : _ |- context[_ - 0] ] => rewrite Z.sub_0_r
| [ _ : _ |- context[0 + _] ] => rewrite Z.add_0_l
| [ _ : _ |- context[_ + 0] ] => rewrite Z.add_0_r
| [ _ : _ |- context[0 * _] ] => rewrite Z.mul_0_l
| [ _ : _ |- context[_ * 0] ] => rewrite Z.mul_0_r
| [ _ : _ |- context[?m mod ?m] ] =>
rewrite Z_mod_same_full with (a := m)
| [ _ : _ |- context[0 mod _] ] =>
rewrite Z.mod_0_l
| [ _ : _ |- context[(_ mod ?m) mod ?m] ] =>
rewrite Zmod_mod
| [ _ : _ |- context[(_ mod Ptrofs.modulus) mod m ] ] =>
rewrite <- Zmod_div_mod;
try (simplify; lia || assumption)
| [ _ : _ |- context[Ptrofs.modulus mod m] ] =>
rewrite Zdivide_mod with (a := Ptrofs.modulus);
try (lia || assumption)
| [ _ : _ |- context[Ptrofs.signed ?a mod Ptrofs.modulus] ] =>
rewrite Z.mod_small with (a := Ptrofs.signed a) (b := Ptrofs.modulus)
| [ _ : _ |- context[(?x - ?y) mod ?m] ] =>
rewrite Zminus_mod with (a := x) (b := y) (n := m)
| [ _ : _ |- context[((?x + ?y) mod ?m) + _] ] =>
rewrite Zplus_mod with (a := x) (b := y) (n := m)
| [ _ : _ |- context[(?x + ?y) mod ?m] ] =>
rewrite Zplus_mod with (a := x) (b := y) (n := m)
| [ _ : _ |- context[(?x * ?y) mod ?m] ] =>
rewrite Zmult_mod with (a := x) (b := y) (n := m)
end.
Ltac ptrofs_mod_tac m :=
repeat (ptrofs_mod_match m); lia.
Lemma of_int_mod :
forall x m,
Int.signed x mod m = 0 ->
Ptrofs.signed (Ptrofs.of_int x) mod m = 0.
Proof.
intros.
pose proof (Integers.Ptrofs.agree32_of_int eq_refl x) as A.
pose proof Ptrofs.agree32_signed.
apply H0 in A; try reflexivity.
rewrite A. assumption.
Qed.
Lemma mul_mod :
forall x y m,
0 < m ->
(m | Ptrofs.modulus) ->
Ptrofs.signed x mod m = 0 ->
Ptrofs.signed y mod m = 0 ->
(Ptrofs.signed (Ptrofs.mul x y)) mod m = 0.
Proof.
intros. unfold Ptrofs.mul.
rewrite Ptrofs.signed_repr_eq.
repeat match goal with
| [ _ : _ |- context[if ?x then _ else _] ] => destruct x
| [ _ : _ |- context[_ mod Ptrofs.modulus mod m] ] =>
rewrite <- Zmod_div_mod; try lia; try assumption
| [ _ : _ |- context[Ptrofs.unsigned _] ] => rewrite Ptrofs.unsigned_signed
end; try (simplify; lia); ptrofs_mod_tac m.
Qed.
Lemma add_mod :
forall x y m,
0 < m ->
(m | Ptrofs.modulus) ->
Ptrofs.signed x mod m = 0 ->
Ptrofs.signed y mod m = 0 ->
(Ptrofs.signed (Ptrofs.add x y)) mod m = 0.
Proof.
intros. unfold Ptrofs.add.
rewrite Ptrofs.signed_repr_eq.
repeat match goal with
| [ _ : _ |- context[if ?x then _ else _] ] => destruct x
| [ _ : _ |- context[_ mod Ptrofs.modulus mod m] ] =>
rewrite <- Zmod_div_mod; try lia; try assumption
| [ _ : _ |- context[Ptrofs.unsigned _] ] => rewrite Ptrofs.unsigned_signed
end; try (simplify; lia); ptrofs_mod_tac m.
Qed.
Lemma mul_divs :
forall x y,
0 <= Ptrofs.signed y ->
0 < Ptrofs.signed x ->
Ptrofs.signed y mod Ptrofs.signed x = 0 ->
(Integers.Ptrofs.mul x (Integers.Ptrofs.divs y x)) = y.
Proof.
intros.
pose proof (Ptrofs.mods_divs_Euclid y x).
pose proof (Zquot.Zrem_Zmod_zero (Ptrofs.signed y) (Ptrofs.signed x)).
apply <- H3 in H1; try lia; clear H3.
unfold Ptrofs.mods in H2.
rewrite H1 in H2.
replace (Ptrofs.repr 0) with (Ptrofs.zero) in H2 by reflexivity.
rewrite Ptrofs.add_zero in H2.
rewrite Ptrofs.mul_commut.
congruence.
Qed.
Lemma mul_unsigned :
forall x y,
Ptrofs.mul x y =
Ptrofs.repr (Ptrofs.unsigned x * Ptrofs.unsigned y).
Proof.
intros; unfold Ptrofs.mul.
apply Ptrofs.eqm_samerepr.
apply Ptrofs.eqm_mult; exists 0; lia.
Qed.
End PtrofsExtra.
Module IntExtra.
Ltac int_mod_match m :=
match goal with
| [ H : ?x = 0 |- context[?x] ] => rewrite H
| [ _ : _ |- context[_ - 0] ] => rewrite Z.sub_0_r
| [ _ : _ |- context[0 + _] ] => rewrite Z.add_0_l
| [ _ : _ |- context[_ + 0] ] => rewrite Z.add_0_r
| [ _ : _ |- context[0 * _] ] => rewrite Z.mul_0_l
| [ _ : _ |- context[_ * 0] ] => rewrite Z.mul_0_r
| [ _ : _ |- context[?m mod ?m] ] =>
rewrite Z_mod_same_full with (a := m)
| [ _ : _ |- context[0 mod _] ] =>
rewrite Z.mod_0_l
| [ _ : _ |- context[(_ mod ?m) mod ?m] ] =>
rewrite Zmod_mod
| [ _ : _ |- context[(_ mod Int.modulus) mod m ] ] =>
rewrite <- Zmod_div_mod;
try (simplify; lia || assumption)
| [ _ : _ |- context[Int.modulus mod m] ] =>
rewrite Zdivide_mod with (a := Int.modulus);
try (lia || assumption)
| [ _ : _ |- context[Int.signed ?a mod Int.modulus] ] =>
rewrite Z.mod_small with (a := Int.signed a) (b := Int.modulus)
| [ _ : _ |- context[(?x - ?y) mod ?m] ] =>
rewrite Zminus_mod with (a := x) (b := y) (n := m)
| [ _ : _ |- context[((?x + ?y) mod ?m) + _] ] =>
rewrite Zplus_mod with (a := x) (b := y) (n := m)
| [ _ : _ |- context[(?x + ?y) mod ?m] ] =>
rewrite Zplus_mod with (a := x) (b := y) (n := m)
| [ _ : _ |- context[(?x * ?y) mod ?m] ] =>
rewrite Zmult_mod with (a := x) (b := y) (n := m)
end.
Ltac int_mod_tac m :=
repeat (int_mod_match m); lia.
Lemma mul_mod :
forall x y m,
0 < m ->
(m | Int.modulus) ->
Int.signed x mod m = 0 ->
Int.signed y mod m = 0 ->
(Int.signed (Int.mul x y)) mod m = 0.
Proof.
intros. unfold Int.mul.
rewrite Int.signed_repr_eq.
repeat match goal with
| [ _ : _ |- context[if ?x then _ else _] ] => destruct x
| [ _ : _ |- context[_ mod Int.modulus mod m] ] =>
rewrite <- Zmod_div_mod; try lia; try assumption
| [ _ : _ |- context[Int.unsigned _] ] => rewrite Int.unsigned_signed
end; try (simplify; lia); int_mod_tac m.
Qed.
Lemma add_mod :
forall x y m,
0 < m ->
(m | Int.modulus) ->
Int.signed x mod m = 0 ->
Int.signed y mod m = 0 ->
(Int.signed (Int.add x y)) mod m = 0.
Proof.
intros. unfold Int.add.
rewrite Int.signed_repr_eq.
repeat match goal with
| [ _ : _ |- context[if ?x then _ else _] ] => destruct x
| [ _ : _ |- context[_ mod Int.modulus mod m] ] =>
rewrite <- Zmod_div_mod; try lia; try assumption
| [ _ : _ |- context[Int.unsigned _] ] => rewrite Int.unsigned_signed
end; try (simplify; lia); int_mod_tac m.
Qed.
End IntExtra.
|
