Implement generalised list comprehensions

[ghc-hetmet.git] / compiler / main / Constants.lhs

diff --git a/compiler/main/Constants.lhs b/compiler/main/Constants.lhs
index fc47aad..5db909d 100644 (file)
--- a/compiler/main/Constants.lhs
+++ b/compiler/main/Constants.lhs
@@ -4,11 +4,11 @@
 \section[Constants]{Info about this compilation}
 
 \begin{code}
-{-# OPTIONS_GHC -w #-}
+{-# OPTIONS -w #-}
 -- The above warning supression flag is a temporary kludge.
 -- While working on this module you are encouraged to remove it and fix
 -- any warnings in the module. See
---     http://hackage.haskell.org/trac/ghc/wiki/WorkingConventions#Warnings
+--     http://hackage.haskell.org/trac/ghc/wiki/Commentary/CodingStyle#Warnings
 -- for details
 
 module Constants (module Constants) where
@@ -32,8 +32,8 @@ import Data.Bits (shiftL)
 All pretty arbitrary:
 
 \begin{code}
-mAX_TUPLE_SIZE = (62 :: Int)   -- Should really match the number
-                               -- of decls in Data.Tuple
+mAX_TUPLE_SIZE = (62 :: Int)    -- Should really match the number
+                                -- of decls in Data.Tuple
 mAX_CONTEXT_REDUCTION_DEPTH = (20 :: Int)
 \end{code}
 
@@ -110,6 +110,13 @@ returning to the scheduler.
 rESERVED_STACK_WORDS = (RESERVED_STACK_WORDS :: Int)
 \end{code}
 
+Continuations that need more than this amount of stack should do their
+own stack check (see bug #1466).
+
+\begin{code}
+aP_STACK_SPLIM = (AP_STACK_SPLIM :: Int)
+\end{code}
+
 Size of a word, in bytes
 
 \begin{code}