From a82c9c0e4a0b8e37c9c3ea5ae99714982563606f Mon Sep 17 00:00:00 2001 From: xleroy Date: Sat, 14 Jan 2012 14:23:26 +0000 Subject: Merge of the nonstrict-ops branch: - Most RTL operators now evaluate to Some Vundef instead of None when undefined behavior occurs. - More aggressive instruction selection. - "Bertotization" of pattern-matchings now implemented by a proper preprocessor. - Cast optimization moved to cfrontend/Cminorgen; removed backend/CastOptim. git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1790 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e --- powerpc/Asmgenretaddr.v | 10 ++++++++++ 1 file changed, 10 insertions(+) (limited to 'powerpc/Asmgenretaddr.v') diff --git a/powerpc/Asmgenretaddr.v b/powerpc/Asmgenretaddr.v index adc15297..081336ca 100644 --- a/powerpc/Asmgenretaddr.v +++ b/powerpc/Asmgenretaddr.v @@ -112,6 +112,11 @@ Lemma addimm_tail: Proof. unfold addimm; intros; IsTail. Qed. Hint Resolve addimm_tail: ppcretaddr. +Lemma andimm_base_tail: + forall r1 r2 n k, is_tail k (andimm_base r1 r2 n k). +Proof. unfold andimm_base; intros; IsTail. Qed. +Hint Resolve andimm_base_tail: ppcretaddr. + Lemma andimm_tail: forall r1 r2 n k, is_tail k (andimm r1 r2 n k). Proof. unfold andimm; intros; IsTail. Qed. @@ -127,6 +132,11 @@ Lemma xorimm_tail: Proof. unfold xorimm; intros; IsTail. Qed. Hint Resolve xorimm_tail: ppcretaddr. +Lemma rolm_tail: + forall r1 r2 amount mask k, is_tail k (rolm r1 r2 amount mask k). +Proof. unfold rolm; intros; IsTail. Qed. +Hint Resolve rolm_tail: ppcretaddr. + Lemma loadind_tail: forall base ofs ty dst k, is_tail k (loadind base ofs ty dst k). Proof. unfold loadind; intros. destruct ty; IsTail. Qed. -- cgit