getUnique, getUniques, -- basic ops
- UniqSM(..), -- type: unique supply monad
+ SYN_IE(UniqSM), -- type: unique supply monad
initUs, thenUs, returnUs,
mapUs, mapAndUnzipUs, mapAndUnzip3Us,
+ thenMaybeUs, mapAccumLUs,
mkSplitUniqSupply,
- splitUniqSupply,
-
- -- and the access functions for the `builtin' UniqueSupply
- getBuiltinUniques, mkBuiltinUnique,
- mkPseudoUnique1, mkPseudoUnique2, mkPseudoUnique3
+ splitUniqSupply
) where
-import Ubiq{-uitous-}
+IMP_Ubiq(){-uitous-}
import Unique
import Util
import PreludeGlaST
+#if __GLASGOW_HASKELL__ >= 200
+# define WHASH GHCbase.W#
+#else
+# define WHASH W#
+#endif
+
w2i x = word2Int# x
i2w x = int2Word# x
i2w_s x = (x :: Int#)
\end{code}
\begin{code}
-mkSplitUniqSupply :: Char -> PrimIO UniqSupply
+mkSplitUniqSupply :: Char -> IO UniqSupply
splitUniqSupply :: UniqSupply -> (UniqSupply, UniqSupply)
getUnique :: UniqSupply -> Unique
\end{code}
\begin{code}
-mkSplitUniqSupply (MkChar c#)
+mkSplitUniqSupply (C# c#)
= let
mask# = (i2w (ord# c#)) `shiftL#` (i2w_s 24#)
-- here comes THE MAGIC:
mk_supply#
- = unsafe_interleave (
+ = unsafeInterleavePrimIO {-unsafe_interleave-} (
mk_unique `thenPrimIO` \ uniq ->
mk_supply# `thenPrimIO` \ s1 ->
mk_supply# `thenPrimIO` \ s2 ->
returnPrimIO (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 s
= let
(r, new_s) = m s
in
(r, s)
+-}
- mk_unique = _ccall_ genSymZh `thenPrimIO` \ (W# u#) ->
- returnPrimIO (MkInt (w2i (mask# `or#` u#)))
+ mk_unique = _ccall_ genSymZh `thenPrimIO` \ (WHASH u#) ->
+ returnPrimIO (I# (w2i (mask# `or#` u#)))
in
- mk_supply#
+#if __GLASGOW_HASKELL__ >= 200
+ primIOToIO mk_supply#
+#else
+ mk_supply# `thenPrimIO` \ s ->
+ return s
+#endif
splitUniqSupply (MkSplitUniqSupply _ s1 s2) = (s1, s2)
\end{code}
\begin{code}
-getUnique (MkSplitUniqSupply (MkInt n) _ _) = mkUniqueGrimily n
+getUnique (MkSplitUniqSupply (I# n) _ _) = mkUniqueGrimily n
-getUniques i@(MkInt i#) supply = i# `get_from` supply
+getUniques (I# i) supply = i `get_from` supply
where
get_from 0# _ = []
- get_from n# (MkSplitUniqSupply (MkInt u#) _ s2)
- = mkUniqueGrimily u# : get_from (n# `minusInt#` 1#) s2
+ get_from n (MkSplitUniqSupply (I# u) _ s2)
+ = mkUniqueGrimily u : get_from (n `minusInt#` 1#) s2
\end{code}
%************************************************************************
= f x `thenUs` \ (r1, r2, r3) ->
mapAndUnzip3Us f xs `thenUs` \ (rs1, rs2, rs3) ->
returnUs (r1:rs1, r2:rs2, r3:rs3)
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[UniqueSupplies-compiler]{@UniqueSupplies@ specific to the compiler}
-%* *
-%************************************************************************
-
-\begin{code}
-mkPseudoUnique1, mkPseudoUnique2, mkPseudoUnique3,
- mkBuiltinUnique :: Int -> Unique
-
-mkBuiltinUnique i = mkUnique 'B' i
-mkPseudoUnique1 i = mkUnique 'C' i -- used for getItsUnique on Regs
-mkPseudoUnique2 i = mkUnique 'D' i -- ditto
-mkPseudoUnique3 i = mkUnique 'E' i -- ditto
-getBuiltinUniques :: Int -> [Unique]
-getBuiltinUniques n = map (mkUnique 'B') [1 .. n]
-\end{code}
-
-The following runs a uniq monad expression, using builtin uniq values:
-\begin{code}
---runBuiltinUs :: UniqSM a -> a
---runBuiltinUs m = snd (initUs uniqSupply_B m)
+thenMaybeUs :: UniqSM (Maybe a) -> (a -> UniqSM (Maybe b)) -> UniqSM (Maybe b)
+thenMaybeUs m k
+ = m `thenUs` \ result ->
+ case result of
+ Nothing -> returnUs Nothing
+ Just x -> k x
+
+mapAccumLUs :: (acc -> x -> UniqSM (acc, y))
+ -> acc
+ -> [x]
+ -> UniqSM (acc, [y])
+
+mapAccumLUs f b [] = returnUs (b, [])
+mapAccumLUs f b (x:xs)
+ = f b x `thenUs` \ (b__2, x__2) ->
+ mapAccumLUs f b__2 xs `thenUs` \ (b__3, xs__2) ->
+ returnUs (b__3, x__2:xs__2)
\end{code}