From b54721f58c2ecb65ce554d8b34f214d5121a2b0c Mon Sep 17 00:00:00 2001
From: xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e>
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
---
 driver/Driver.ml | 1 +
 1 file changed, 1 insertion(+)

(limited to 'driver')

diff --git a/driver/Driver.ml b/driver/Driver.ml
index fcdc335..d6d1868 100644
--- a/driver/Driver.ml
+++ b/driver/Driver.ml
@@ -356,6 +356,7 @@ let cmdline_actions =
   @ f_opt "madd" option_fmadd
 
 let _ =
+  Gc.set { (Gc.get()) with Gc.minor_heap_size = 524288 };
   Cparser.Machine.config := Cparser.Machine.ilp32ll64;
   Cparser.Builtins.set C2C.builtins;
   CPragmas.initialize();
-- 
cgit v1.2.3