diff options
| author |  xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e> | 2013-02-10 10:08:27 +0000 |
|---|---|---|
| committer | xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e> | 2013-02-10 10:08:27 +0000 |
| commit | 6f3225b0623b9c97eed7d40ddc320b08c79c6518 (patch) | |
| tree | be4ea0d5624499c40f82d3c2f86c0fba7ead6aef /backend | |
| parent | 77d3c45aa0928420a083a8d25ec52d5f7f3e6c77 (diff) | |
lib/Integers.v: revised and extended, faster implementation based on
bit-level operations provided by ZArith in Coq 8.4.
Other modules: adapted accordingly.
git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@2110 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e
Diffstat (limited to 'backend')
| -rw-r--r-- | backend/InterfGraph.v | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/backend/InterfGraph.v b/backend/InterfGraph.v index 9a5522d..877c7c6 100644 --- a/backend/InterfGraph.v +++ b/backend/InterfGraph.v @@ -119,14 +119,14 @@ Lemma ordered_pair_sym: forall x y, ordered_pair y x = ordered_pair x y. Proof. unfold ordered_pair; intros. - case (plt x y); intro. - case (plt y x); intro. - unfold Plt in *; omegaContradiction. + destruct (plt y x); destruct (plt x y). + elim (Plt_strict x). eapply Plt_trans; eauto. auto. - case (plt y x); intro. auto. - assert (Zpos x = Zpos y). unfold Plt in *. omega. + destruct (Pos.lt_total x y) as [A | [A | A]]. + elim n0; auto. congruence. + elim n; auto. Qed. Lemma interfere_sym: |