summaryrefslogtreecommitdiff
path: root/backend/LTL.v
diff options
context:
space:
mode:
authorGravatar xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e>2010-10-27 09:23:19 +0000
committerGravatar xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e>2010-10-27 09:23:19 +0000
commitb54721f58c2ecb65ce554d8b34f214d5121a2b0c (patch)
tree01bc71f3e5e6b1681dac76de97ab925e005cc2c4 /backend/LTL.v
parent63cc20f9ddb18bebae523c46438abdf2a4b140d4 (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/LTL.v')
-rw-r--r--backend/LTL.v2
1 files changed, 1 insertions, 1 deletions
diff --git a/backend/LTL.v b/backend/LTL.v
index 2eff67c..a68352f 100644
--- a/backend/LTL.v
+++ b/backend/LTL.v
@@ -290,4 +290,4 @@ Definition successors_instr (i: instruction) : list node :=
end.
Definition successors (f: function): PTree.t (list node) :=
- PTree.map (fun pc i => successors_instr i) f.(fn_code).
+ PTree.map1 successors_instr f.(fn_code).