diff options
| author | Xavier Leroy <xavierleroy@users.noreply.github.com> | 2018-06-17 17:48:01 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-06-17 17:48:01 +0200 |
| commit | 7a5aef7aa4b669a722ecce3da6e7f7c646a392cc (patch) | |
| tree | 5f50db9ea90cc8ca55551f364d972d134c3f9177 /backend/Tunnelingproof.v | |
| parent | 3d348f51e343ff84b8e550fbeb905e23bf2b6175 (diff) | |
| download | compcert-7a5aef7aa4b669a722ecce3da6e7f7c646a392cc.tar.gz compcert-7a5aef7aa4b669a722ecce3da6e7f7c646a392cc.zip | |
Treat Outgoing stack slots as caller-save in LTL/Linear semantics (#237)
* Outgoing stack slots are set to Vundef on return from a function call,
modeling the fact that the callee could write into those stack slots.
(CompCert-generated code does not do this, but code generated by other
compilers sometimes does.)
* Adapt Stackingproof to this new semantics. This requires tighter
reasoning on how Linear's locsets are related at call points and
at return points.
* Most of this reasoning was moved from Stackingproof to Lineartyping,
because it can be expressed purely in terms of the Linear semantics,
and tracked through the wt_state predicate.
* Factor out and into Conventions.v: the notion of callee-save
locations, the "agree_callee_save" predicate, and useful lemmas on
Locmap.setpair. Now the same "agree_callee_save" predicate is used
in Allocproof and in Stackingproof.
Diffstat (limited to 'backend/Tunnelingproof.v')
| -rw-r--r-- | backend/Tunnelingproof.v | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/backend/Tunnelingproof.v b/backend/Tunnelingproof.v index fd97ce33..4f95ac9b 100644 --- a/backend/Tunnelingproof.v +++ b/backend/Tunnelingproof.v @@ -339,7 +339,9 @@ Lemma locmap_undef_caller_save_regs_lessdef: locmap_lessdef ls1 ls2 -> locmap_lessdef (undef_caller_save_regs ls1) (undef_caller_save_regs ls2). Proof. intros; red; intros. unfold undef_caller_save_regs. - destruct l; auto. destruct (Conventions1.is_callee_save r); auto. + destruct l. +- destruct (Conventions1.is_callee_save r); auto. +- destruct sl; auto. Qed. Lemma find_function_translated: @@ -371,7 +373,7 @@ Lemma return_regs_lessdef: Proof. intros; red; intros. destruct l; simpl. - destruct (Conventions1.is_callee_save r); auto. -- auto. +- destruct sl; auto. Qed. (** To preserve non-terminating behaviours, we show that the transformed |