X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2FbasicTypes%2FUniqSupply.lhs;h=86cf320bf8516007a6c8130a8524b03270e92f4e;hb=f6c31c0fbf77b1c46c508fa56214361671ccfd05;hp=adffd47ab82d6e9ba33838fdd90c234407ad29b2;hpb=2773693e5f92c285ef17aa8720d89ce8689add6e;p=ghc-hetmet.git

diff --git a/ghc/compiler/basicTypes/UniqSupply.lhs b/ghc/compiler/basicTypes/UniqSupply.lhs
index adffd47..86cf320 100644
--- a/ghc/compiler/basicTypes/UniqSupply.lhs
+++ b/ghc/compiler/basicTypes/UniqSupply.lhs
@@ -1,46 +1,32 @@
 %
-% (c) The GRASP/AQUA Project, Glasgow University, 1992-1996
+% (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
 %
 \section[UniqSupply]{The @UniqueSupply@ data type and a (monadic) supply thereof}
 
 \begin{code}
-#include "HsVersions.h"
-
 module UniqSupply (
 
 	UniqSupply,		-- Abstractly
 
-	getUnique, getUniques,	-- basic ops
+	uniqFromSupply, uniqsFromSupply,	-- basic ops
 
-	SYN_IE(UniqSM),		-- type: unique supply monad
-	initUs, thenUs, returnUs, fixUs,
+	UniqSM,		-- type: unique supply monad
+	initUs, initUs_, thenUs, thenUs_, returnUs, fixUs, getUs, withUs,
+	getUniqueUs, getUniquesUs,
 	mapUs, mapAndUnzipUs, mapAndUnzip3Us,
 	thenMaybeUs, mapAccumLUs,
+	lazyThenUs, lazyMapUs,
 
 	mkSplitUniqSupply,
 	splitUniqSupply
   ) where
 
-IMP_Ubiq(){-uitous-}
+#include "HsVersions.h"
 
 import Unique
-import Util
-
-
-#if __GLASGOW_HASKELL__ == 201
-import PreludeGlaST
-# define WHASH	    GHCbase.W#
-#elif __GLASGOW_HASKELL__ >= 202
-import GlaExts
-import STBase
-# if __GLASGOW_HASKELL__ == 202
-import PrelBase ( Char(..) )
-# endif
-# define WHASH      GlaExts.W#
-#else
-import PreludeGlaST
-# define WHASH	    W#
-#endif
+
+import GLAEXTS
+import UNSAFE_IO	( unsafeInterleaveIO )
 
 w2i x = word2Int# x
 i2w x = int2Word# x
@@ -54,12 +40,6 @@ i2w_s x = (x :: Int#)
 %*									*
 %************************************************************************
 
-%************************************************************************
-%*									*
-\subsubsection[UniqSupply-type]{@UniqSupply@ type and operations}
-%*									*
-%************************************************************************
-
 A value of type @UniqSupply@ is unique, and it can
 supply {\em one} distinct @Unique@.  Also, from the supply, one can
 also manufacture an arbitrary number of further @UniqueSupplies@,
@@ -76,61 +56,40 @@ data UniqSupply
 mkSplitUniqSupply :: Char -> IO UniqSupply
 
 splitUniqSupply :: UniqSupply -> (UniqSupply, UniqSupply)
-getUnique :: UniqSupply -> Unique
-getUniques :: Int -> UniqSupply -> [Unique]
+uniqFromSupply  :: UniqSupply -> Unique
+uniqsFromSupply :: UniqSupply -> [Unique]	-- Infinite
 \end{code}
 
 \begin{code}
 mkSplitUniqSupply (C# c#)
   = let
+#if __GLASGOW_HASKELL__ >= 503
+	mask# = (i2w (ord# c#)) `uncheckedShiftL#` (i2w_s 24#)
+#else
 	mask# = (i2w (ord# c#)) `shiftL#` (i2w_s 24#)
-
+#endif
 	-- here comes THE MAGIC:
 
+	-- This is one of the most hammered bits in the whole compiler
 	mk_supply#
-	  = unsafe_interleave (
-		mk_unique   `thenPrimIO` \ uniq ->
-		mk_supply#  `thenPrimIO` \ s1 ->
-		mk_supply#  `thenPrimIO` \ s2 ->
-		returnPrimIO (MkSplitUniqSupply uniq s1 s2)
+	  = unsafeInterleaveIO (
+		mk_unique   >>= \ uniq ->
+		mk_supply#  >>= \ s1 ->
+		mk_supply#  >>= \ s2 ->
+		return (MkSplitUniqSupply uniq s1 s2)
 	    )
-	  where
---
-	    -- inlined copy of unsafeInterleavePrimIO;
-	    -- this is the single-most-hammered bit of code
-	    -- in the compiler....
-	    -- Too bad it's not 1.3-portable...
-	    unsafe_interleave m =
-	       MkST ( \ s ->
-	        let
-		    (MkST m') = m
-		    (r, new_s) = m' s
-	        in
-	        (r, s))
---
-
-	mk_unique = _ccall_ genSymZh		`thenPrimIO` \ (WHASH u#) ->
-		    returnPrimIO (I# (w2i (mask# `or#` u#)))
+
+	mk_unique = _ccall_ genSymZh		>>= \ (W# u#) ->
+		    return (I# (w2i (mask# `or#` u#)))
     in
-#if __GLASGOW_HASKELL__ >= 200
-    primIOToIO mk_supply#	>>= \ s ->
-    return s
-#else
-    mk_supply#	`thenPrimIO` \ s ->
-    return s
-#endif
+    mk_supply#
 
 splitUniqSupply (MkSplitUniqSupply _ s1 s2) = (s1, s2)
 \end{code}
 
 \begin{code}
-getUnique (MkSplitUniqSupply (I# n) _ _) = mkUniqueGrimily n
-
-getUniques (I# i) supply = i `get_from` supply
-  where
-    get_from 0# _ = []
-    get_from n (MkSplitUniqSupply (I# u) _ s2)
-      = mkUniqueGrimily u : get_from (n -# 1#) s2
+uniqFromSupply  (MkSplitUniqSupply (I# n) _ _)  = mkUniqueGrimily n
+uniqsFromSupply (MkSplitUniqSupply (I# n) _ s2) = mkUniqueGrimily n : uniqsFromSupply s2
 \end{code}
 
 %************************************************************************
@@ -140,15 +99,17 @@ getUniques (I# i) supply = i `get_from` supply
 %************************************************************************
 
 \begin{code}
-type UniqSM result = UniqSupply -> result
-
--- the initUs function also returns the final UniqSupply
+type UniqSM result = UniqSupply -> (result, UniqSupply)
 
-initUs :: UniqSupply -> UniqSM a -> a
+-- the initUs function also returns the final UniqSupply; initUs_ drops it
+initUs :: UniqSupply -> UniqSM a -> (a,UniqSupply)
+initUs init_us m = case m init_us of { (r,us) -> (r,us) }
 
-initUs init_us m = m init_us
+initUs_ :: UniqSupply -> UniqSM a -> a
+initUs_ init_us m = case m init_us of { (r,us) -> r }
 
 {-# INLINE thenUs #-}
+{-# INLINE lazyThenUs #-}
 {-# INLINE returnUs #-}
 {-# INLINE splitUniqSupply #-}
 \end{code}
@@ -157,28 +118,54 @@ initUs init_us m = m init_us
 \begin{code}
 fixUs :: (a -> UniqSM a) -> UniqSM a
 fixUs m us
-  = r  where  r = m r us
+  = (r,us')  where  (r,us') = m r us
 
 thenUs :: UniqSM a -> (a -> UniqSM b) -> UniqSM b
-
 thenUs expr cont us
-  = case (splitUniqSupply us) of { (s1, s2) ->
-    case (expr s1)	      of { result ->
-    cont result s2 }}
-\end{code}
+  = case (expr us) of { (result, us') -> cont result us' }
+
+lazyThenUs :: UniqSM a -> (a -> UniqSM b) -> UniqSM b
+lazyThenUs expr cont us
+  = let (result, us') = expr us in cont result us'
+
+thenUs_ :: UniqSM a -> UniqSM b -> UniqSM b
+thenUs_ expr cont us
+  = case (expr us) of { (_, us') -> cont us' }
+
 
-\begin{code}
 returnUs :: a -> UniqSM a
-returnUs result us = result
+returnUs result us = (result, us)
 
-mapUs :: (a -> UniqSM b) -> [a] -> UniqSM [b]
+withUs :: (UniqSupply -> (a, UniqSupply)) -> UniqSM a
+withUs f us = f us	-- Ha ha!
+		
+getUs :: UniqSM UniqSupply
+getUs us = splitUniqSupply us
+
+getUniqueUs :: UniqSM Unique
+getUniqueUs us = case splitUniqSupply us of
+		   (us1,us2) -> (uniqFromSupply us1, us2)
+
+getUniquesUs :: UniqSM [Unique]
+getUniquesUs us = case splitUniqSupply us of
+		      (us1,us2) -> (uniqsFromSupply us1, us2)
+\end{code}
 
+\begin{code}
+mapUs :: (a -> UniqSM b) -> [a] -> UniqSM [b]
 mapUs f []     = returnUs []
 mapUs f (x:xs)
   = f x         `thenUs` \ r  ->
     mapUs f xs  `thenUs` \ rs ->
     returnUs (r:rs)
 
+lazyMapUs :: (a -> UniqSM b) -> [a] -> UniqSM [b]
+lazyMapUs f []     = returnUs []
+lazyMapUs f (x:xs)
+  = f x             `lazyThenUs` \ r  ->
+    lazyMapUs f xs  `lazyThenUs` \ rs ->
+    returnUs (r:rs)
+
 mapAndUnzipUs  :: (a -> UniqSM (b,c))   -> [a] -> UniqSM ([b],[c])
 mapAndUnzip3Us :: (a -> UniqSM (b,c,d)) -> [a] -> UniqSM ([b],[c],[d])