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
|
(* *************************************************************)
(* *)
(* The Compcert verified compiler *)
(* *)
(* David Monniaux CNRS, VERIMAG *)
(* *)
(* Copyright VERIMAG. All rights reserved. *)
(* This file is distributed under the terms of the INRIA *)
(* Non-Commercial License Agreement. *)
(* *)
(* *************************************************************)
Require Import FunInd.
Require Import Coqlib Maps Errors Integers Floats Lattice Kildall.
Require Import AST Linking.
Require Import Values Memory Globalenvs Events Smallstep.
Require Import Registers Op RTL.
Require Import Allnontrap.
Definition match_prog (p tp: RTL.program) :=
match_program (fun ctx f tf => tf = transf_fundef f) eq p tp.
Lemma transf_program_match:
forall p, match_prog p (transf_program p).
Proof.
intros. eapply match_transform_program; eauto.
Qed.
Section PRESERVATION.
Variables prog tprog: program.
Hypothesis TRANSL: match_prog prog tprog.
Let ge := Genv.globalenv prog.
Let tge := Genv.globalenv tprog.
Lemma functions_translated:
forall v f,
Genv.find_funct ge v = Some f ->
Genv.find_funct tge v = Some (transf_fundef f).
Proof (Genv.find_funct_transf TRANSL).
Lemma function_ptr_translated:
forall v f,
Genv.find_funct_ptr ge v = Some f ->
Genv.find_funct_ptr tge v = Some (transf_fundef f).
Proof (Genv.find_funct_ptr_transf TRANSL).
Lemma symbols_preserved:
forall id,
Genv.find_symbol tge id = Genv.find_symbol ge id.
Proof (Genv.find_symbol_transf TRANSL).
Lemma senv_preserved:
Senv.equiv ge tge.
Proof (Genv.senv_transf TRANSL).
Lemma sig_preserved:
forall f, funsig (transf_fundef f) = funsig f.
Proof.
destruct f; reflexivity.
Qed.
Lemma find_function_translated:
forall ros rs fd,
find_function ge ros rs = Some fd ->
find_function tge ros rs = Some (transf_fundef fd).
Proof.
unfold find_function; intros. destruct ros as [r|id].
eapply functions_translated; eauto.
rewrite symbols_preserved. destruct (Genv.find_symbol ge id); try congruence.
eapply function_ptr_translated; eauto.
Qed.
Lemma transf_function_at:
forall f pc i,
f.(fn_code)!pc = Some i ->
(transf_function f).(fn_code)!pc = Some(transf_instr pc i).
Proof.
intros until i. intro Hcode.
unfold transf_function; simpl.
rewrite PTree.gmap.
unfold option_map.
rewrite Hcode.
reflexivity.
Qed.
Ltac TR_AT :=
match goal with
| [ A: (fn_code _)!_ = Some _ |- _ ] =>
generalize (transf_function_at _ _ _ A); intros
end.
Inductive match_frames: RTL.stackframe -> RTL.stackframe -> Prop :=
| match_frames_intro: forall res f sp pc rs,
match_frames (Stackframe res f sp pc rs)
(Stackframe res (transf_function f) sp pc rs).
Inductive match_states: RTL.state -> RTL.state -> Prop :=
| match_regular_states: forall stk f sp pc rs m stk'
(STACKS: list_forall2 match_frames stk stk'),
match_states (State stk f sp pc rs m)
(State stk' (transf_function f) sp pc rs m)
| match_callstates: forall stk f args m stk'
(STACKS: list_forall2 match_frames stk stk'),
match_states (Callstate stk f args m)
(Callstate stk' (transf_fundef f) args m)
| match_returnstates: forall stk v m stk'
(STACKS: list_forall2 match_frames stk stk'),
match_states (Returnstate stk v m)
(Returnstate stk' v m).
(*Lemma load_notrap_simu_correct:*)
Lemma step_simulation:
forall S1 t S2, RTL.step ge S1 t S2 ->
forall S1', match_states S1 S1' ->
exists S2', RTL.step tge S1' t S2' /\ match_states S2 S2'.
Proof.
induction 1; intros S1' MS; inv MS; try TR_AT.
- (* nop *)
econstructor; split. eapply exec_Inop; eauto.
constructor; auto.
- (* op *)
econstructor; split.
eapply exec_Iop with (v := v); eauto.
rewrite <- H0. apply eval_operation_preserved. exact symbols_preserved.
constructor; auto.
(* load *)
- inv H0.
+ econstructor; split.
assert (eval_addressing tge sp addr rs ## args = Some a).
rewrite <- EVAL. apply eval_addressing_preserved. exact symbols_preserved.
eapply exec_Iload; eauto. eapply has_loaded_normal; eauto.
constructor; auto.
+ destruct (eval_addressing) eqn:EVAL in LOAD.
* specialize (LOAD v). econstructor; split.
assert (eval_addressing tge sp addr rs ## args = Some v).
rewrite <- EVAL. apply eval_addressing_preserved. exact symbols_preserved.
eapply exec_Iload; eauto. eapply has_loaded_default; eauto.
intros a EVAL'; rewrite H0 in EVAL'; inv EVAL'. apply LOAD; auto.
constructor; auto.
* econstructor; split.
assert (eval_addressing tge sp addr rs ## args = None).
rewrite <- EVAL. apply eval_addressing_preserved. exact symbols_preserved.
eapply exec_Iload; eauto. eapply has_loaded_default; eauto.
intros a EVAL'; rewrite H0 in EVAL'; inv EVAL'.
constructor; auto.
- (* store *)
econstructor; split.
assert (eval_addressing tge sp addr rs ## args = Some a).
rewrite <- H0. apply eval_addressing_preserved. exact symbols_preserved.
eapply exec_Istore; eauto.
constructor; auto.
(* call *)
- econstructor; split.
eapply exec_Icall with (fd := transf_fundef fd); eauto.
eapply find_function_translated; eauto.
apply sig_preserved.
constructor. constructor; auto. constructor.
(* tailcall *)
- econstructor; split.
eapply exec_Itailcall with (fd := transf_fundef fd); eauto.
eapply find_function_translated; eauto.
apply sig_preserved.
constructor. auto.
(* builtin *)
- econstructor; split.
eapply exec_Ibuiltin; eauto.
eapply eval_builtin_args_preserved with (ge1 := ge); eauto. exact symbols_preserved.
eapply external_call_symbols_preserved; eauto. apply senv_preserved.
constructor; auto.
(* cond *)
- econstructor; split.
eapply exec_Icond; eauto.
constructor; auto.
(* jumptbl *)
- econstructor; split.
eapply exec_Ijumptable; eauto.
constructor; auto.
(* return *)
- econstructor; split.
eapply exec_Ireturn; eauto.
constructor; auto.
(* internal function *)
- simpl. econstructor; split.
eapply exec_function_internal; eauto.
constructor; auto.
(* external function *)
- econstructor; split.
eapply exec_function_external; eauto.
eapply external_call_symbols_preserved; eauto. apply senv_preserved.
constructor; auto.
(* return *)
- inv STACKS. inv H1.
econstructor; split.
eapply exec_return; eauto.
constructor; auto.
Qed.
Lemma transf_initial_states:
forall S1, RTL.initial_state prog S1 ->
exists S2, RTL.initial_state tprog S2 /\ match_states S1 S2.
Proof.
intros. inv H. econstructor; split.
econstructor.
eapply (Genv.init_mem_transf TRANSL); eauto.
rewrite symbols_preserved. rewrite (match_program_main TRANSL). eauto.
eapply function_ptr_translated; eauto.
rewrite <- H3; apply sig_preserved.
constructor. constructor.
Qed.
Lemma transf_final_states:
forall S1 S2 r, match_states S1 S2 -> RTL.final_state S1 r -> RTL.final_state S2 r.
Proof.
intros. inv H0. inv H. inv STACKS. constructor.
Qed.
Theorem transf_program_correct:
forward_simulation (RTL.semantics prog) (RTL.semantics tprog).
Proof.
eapply forward_simulation_step.
apply senv_preserved.
eexact transf_initial_states.
eexact transf_final_states.
exact step_simulation.
Qed.
End PRESERVATION.
|
