From e99d18c442c40a14e6eaea722cbc7ef0ca6dd26a Mon Sep 17 00:00:00 2001 From: xleroy Date: Sat, 21 Aug 2010 10:21:11 +0000 Subject: Integers: cleaned up bitwise operations, redefined shr, zero_ext and sign_ext as bitwise operations rather than arithmetic ones. CastOptimproof: fixed for ARM port. Other files: adapted to changes in Integers. git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1472 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e --- powerpc/SelectOpproof.v | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'powerpc/SelectOpproof.v') diff --git a/powerpc/SelectOpproof.v b/powerpc/SelectOpproof.v index 21614e8..2fc1327 100644 --- a/powerpc/SelectOpproof.v +++ b/powerpc/SelectOpproof.v @@ -355,7 +355,7 @@ Lemma eval_rolm: Proof. intros until x. unfold rolm; case (rolm_match a); intros; InvEval. eauto with evalexpr. - case (Int.is_rlw_mask (Int.and (Int.rol mask1 amount) mask)). + case (is_rlw_mask (Int.and (Int.rol mask1 amount) mask)). EvalOp. simpl. subst x. decEq. decEq. symmetry. apply Int.rolm_rolm. apply int_wordsize_divides_modulus. @@ -460,7 +460,7 @@ Theorem eval_andimm: eval_expr ge sp e m le a (Vint x) -> eval_expr ge sp e m le (andimm n a) (Vint (Int.and x n)). Proof. - intros. unfold andimm. case (Int.is_rlw_mask n). + intros. unfold andimm. case (is_rlw_mask n). rewrite <- Int.rolm_zero. apply eval_rolm; auto. EvalOp. Qed. @@ -500,7 +500,7 @@ Lemma eval_or: Proof. intros until y; unfold or; case (or_match a b); intros; InvEval. caseEq (Int.eq amount1 amount2 - && Int.is_rlw_mask (Int.or mask1 mask2) + && is_rlw_mask (Int.or mask1 mask2) && same_expr_pure t1 t2); intro. destruct (andb_prop _ _ H1). destruct (andb_prop _ _ H4). generalize (Int.eq_spec amount1 amount2). rewrite H6. intro. subst amount2. -- cgit v1.2.3