From b54721f58c2ecb65ce554d8b34f214d5121a2b0c Mon Sep 17 00:00:00 2001 From: xleroy Date: Wed, 27 Oct 2010 09:23:19 +0000 Subject: Various algorithmic improvements that reduce compile times (thanks Alexandre Pilkiewicz): - Lattice: preserve sharing in "combine" operation - Kildall: use splay heaps (lib/Heaps.v) for node sets - RTLgen: add a "nop" before loops so that natural enumeration of nodes coincides with (reverse) postorder - Maps: add PTree.map1 operation, use it in RTL and LTL. - Driver: increase minor heap size git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1543 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e --- backend/CSEproof.v | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'backend/CSEproof.v') diff --git a/backend/CSEproof.v b/backend/CSEproof.v index c5670e8d..275b9fd2 100644 --- a/backend/CSEproof.v +++ b/backend/CSEproof.v @@ -695,7 +695,7 @@ Proof. intros res FIXPOINT WF AT SUCC. assert (Numbering.ge res!!pc' (transfer f pc res!!pc)). eapply Solver.fixpoint_solution; eauto. - unfold successors_list, successors. rewrite PTree.gmap. + unfold successors_list, successors. rewrite PTree.gmap1. rewrite AT. auto. apply H. intros. rewrite PMap.gi. apply empty_numbering_satisfiable. -- cgit