diff options
| author |  xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e> | 2010-10-27 09:23:19 +0000 |
|---|---|---|
| committer | xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e> | 2010-10-27 09:23:19 +0000 |
| commit | b54721f58c2ecb65ce554d8b34f214d5121a2b0c (patch) | |
| tree | 01bc71f3e5e6b1681dac76de97ab925e005cc2c4 /backend/Linearizeproof.v | |
| parent | 63cc20f9ddb18bebae523c46438abdf2a4b140d4 (diff) | |
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
Diffstat (limited to 'backend/Linearizeproof.v')
| -rw-r--r-- | backend/Linearizeproof.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/backend/Linearizeproof.v b/backend/Linearizeproof.v index df75000..abc497e 100644 --- a/backend/Linearizeproof.v +++ b/backend/Linearizeproof.v @@ -128,7 +128,7 @@ Proof. assert (LBoolean.ge reach!!pc' reach!!pc). change (reach!!pc) with ((fun pc r => r) pc (reach!!pc)). eapply DS.fixpoint_solution. eexact H. - unfold Kildall.successors_list, successors. rewrite PTree.gmap. + unfold Kildall.successors_list, successors. rewrite PTree.gmap1. rewrite H0; auto. elim H3; intro. congruence. auto. intros. apply PMap.gi. |