2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[UniqSupply]{The @UniqueSupply@ data type and a (monadic) supply thereof}
9 UniqSupply, -- Abstractly
11 uniqFromSupply, uniqsFromSupply, -- basic ops
13 UniqSM, -- type: unique supply monad
14 initUs, initUs_, thenUs, thenUs_, returnUs, fixUs, getUs, withUs,
15 getUniqueUs, getUniquesUs,
16 mapUs, mapAndUnzipUs, mapAndUnzip3Us,
17 thenMaybeUs, mapAccumLUs,
18 lazyThenUs, lazyMapUs,
24 #include "HsVersions.h"
29 #if __GLASGOW_HASKELL__ < 301
30 import IOBase ( IO(..), IOResult(..) )
40 %************************************************************************
42 \subsection{Splittable Unique supply: @UniqSupply@}
44 %************************************************************************
46 %************************************************************************
48 \subsubsection[UniqSupply-type]{@UniqSupply@ type and operations}
50 %************************************************************************
52 A value of type @UniqSupply@ is unique, and it can
53 supply {\em one} distinct @Unique@. Also, from the supply, one can
54 also manufacture an arbitrary number of further @UniqueSupplies@,
55 which will be distinct from the first and from all others.
59 = MkSplitUniqSupply Int -- make the Unique with this
61 -- when split => these two supplies
65 mkSplitUniqSupply :: Char -> IO UniqSupply
67 splitUniqSupply :: UniqSupply -> (UniqSupply, UniqSupply)
68 uniqFromSupply :: UniqSupply -> Unique
69 uniqsFromSupply :: Int -> UniqSupply -> [Unique]
73 mkSplitUniqSupply (C# c#)
75 mask# = (i2w (ord# c#)) `shiftL#` (i2w_s 24#)
77 -- here comes THE MAGIC:
79 -- This is one of the most hammered bits in the whole compiler
81 = unsafeInterleaveIO (
82 mk_unique >>= \ uniq ->
83 mk_supply# >>= \ s1 ->
84 mk_supply# >>= \ s2 ->
85 return (MkSplitUniqSupply uniq s1 s2)
88 mk_unique = _ccall_ genSymZh >>= \ (W# u#) ->
89 return (I# (w2i (mask# `or#` u#)))
93 splitUniqSupply (MkSplitUniqSupply _ s1 s2) = (s1, s2)
97 uniqFromSupply (MkSplitUniqSupply (I# n) _ _) = mkUniqueGrimily n
99 uniqsFromSupply (I# i) supply = i `get_from` supply
102 get_from n (MkSplitUniqSupply (I# u) _ s2)
103 = mkUniqueGrimily u : get_from (n -# 1#) s2
106 %************************************************************************
108 \subsubsection[UniqSupply-monad]{@UniqSupply@ monad: @UniqSM@}
110 %************************************************************************
113 type UniqSM result = UniqSupply -> (result, UniqSupply)
115 -- the initUs function also returns the final UniqSupply; initUs_ drops it
116 initUs :: UniqSupply -> UniqSM a -> (a,UniqSupply)
117 initUs init_us m = case m init_us of { (r,us) -> (r,us) }
119 initUs_ :: UniqSupply -> UniqSM a -> a
120 initUs_ init_us m = case m init_us of { (r,us) -> r }
122 {-# INLINE thenUs #-}
123 {-# INLINE lazyThenUs #-}
124 {-# INLINE returnUs #-}
125 {-# INLINE splitUniqSupply #-}
128 @thenUs@ is where we split the @UniqSupply@.
130 fixUs :: (a -> UniqSM a) -> UniqSM a
132 = (r,us') where (r,us') = m r us
134 thenUs :: UniqSM a -> (a -> UniqSM b) -> UniqSM b
136 = case (expr us) of { (result, us') -> cont result us' }
138 lazyThenUs :: UniqSM a -> (a -> UniqSM b) -> UniqSM b
139 lazyThenUs expr cont us
140 = let (result, us') = expr us in cont result us'
142 thenUs_ :: UniqSM a -> UniqSM b -> UniqSM b
144 = case (expr us) of { (_, us') -> cont us' }
147 returnUs :: a -> UniqSM a
148 returnUs result us = (result, us)
150 withUs :: (UniqSupply -> (a, UniqSupply)) -> UniqSM a
151 withUs f us = f us -- Ha ha!
153 getUs :: UniqSM UniqSupply
154 getUs us = splitUniqSupply us
156 getUniqueUs :: UniqSM Unique
157 getUniqueUs us = case splitUniqSupply us of
158 (us1,us2) -> (uniqFromSupply us1, us2)
160 getUniquesUs :: Int -> UniqSM [Unique]
161 getUniquesUs n us = case splitUniqSupply us of
162 (us1,us2) -> (uniqsFromSupply n us1, us2)
166 mapUs :: (a -> UniqSM b) -> [a] -> UniqSM [b]
167 mapUs f [] = returnUs []
169 = f x `thenUs` \ r ->
170 mapUs f xs `thenUs` \ rs ->
173 lazyMapUs :: (a -> UniqSM b) -> [a] -> UniqSM [b]
174 lazyMapUs f [] = returnUs []
176 = f x `lazyThenUs` \ r ->
177 lazyMapUs f xs `lazyThenUs` \ rs ->
180 mapAndUnzipUs :: (a -> UniqSM (b,c)) -> [a] -> UniqSM ([b],[c])
181 mapAndUnzip3Us :: (a -> UniqSM (b,c,d)) -> [a] -> UniqSM ([b],[c],[d])
183 mapAndUnzipUs f [] = returnUs ([],[])
184 mapAndUnzipUs f (x:xs)
185 = f x `thenUs` \ (r1, r2) ->
186 mapAndUnzipUs f xs `thenUs` \ (rs1, rs2) ->
187 returnUs (r1:rs1, r2:rs2)
189 mapAndUnzip3Us f [] = returnUs ([],[],[])
190 mapAndUnzip3Us f (x:xs)
191 = f x `thenUs` \ (r1, r2, r3) ->
192 mapAndUnzip3Us f xs `thenUs` \ (rs1, rs2, rs3) ->
193 returnUs (r1:rs1, r2:rs2, r3:rs3)
195 thenMaybeUs :: UniqSM (Maybe a) -> (a -> UniqSM (Maybe b)) -> UniqSM (Maybe b)
197 = m `thenUs` \ result ->
199 Nothing -> returnUs Nothing
202 mapAccumLUs :: (acc -> x -> UniqSM (acc, y))
207 mapAccumLUs f b [] = returnUs (b, [])
208 mapAccumLUs f b (x:xs)
209 = f b x `thenUs` \ (b__2, x__2) ->
210 mapAccumLUs f b__2 xs `thenUs` \ (b__3, xs__2) ->
211 returnUs (b__3, x__2:xs__2)