2 % (c) The GRASP/AQUA Project, Glasgow University, 1997-1998
4 \section{Basic ops on packed representations}
6 Some basic operations for working on packed representations of series
7 of bytes (character strings). Used by the interface lexer input
11 {-# OPTIONS -monly-3-regs -optc-DNON_POSIX_SOURCE #-}
14 strLength, -- :: _Addr -> Int
15 copyPrefixStr, -- :: _Addr -> Int -> ByteArray Int
16 copySubStr, -- :: _Addr -> Int -> Int -> ByteArray Int
17 copySubStrBA, -- :: ByteArray Int -> Int -> Int -> ByteArray Int
19 eqStrPrefix, -- :: Addr# -> ByteArray# -> Int# -> Bool
20 eqCharStrPrefix, -- :: Addr# -> Addr# -> Int# -> Bool
21 eqStrPrefixBA, -- :: ByteArray# -> ByteArray# -> Int# -> Int# -> Bool
22 eqCharStrPrefixBA, -- :: Addr# -> ByteArray# -> Int# -> Int# -> Bool
24 addrOffset# -- :: Addr# -> Int# -> Addr#
27 -- This #define suppresses the "import FastString" that
28 -- HsVersions otherwise produces
29 #define COMPILING_FAST_STRING
30 #include "HsVersions.h"
33 #if __GLASGOW_HASKELL__ < 411
34 import PrelAddr ( Addr(..) )
36 import Addr ( Addr(..) )
41 #if __GLASGOW_HASKELL__ < 301
42 import ArrBase ( StateAndMutableByteArray#(..),
43 StateAndByteArray#(..) )
45 #elif __GLASGOW_HASKELL__ < 400
46 import PrelArr ( StateAndMutableByteArray#(..),
47 StateAndByteArray#(..) )
55 Return the length of a @\\NUL@ terminated character string:
58 strLength :: Addr -> Int
61 _ccall_ strlen a >>= \ len@(I# _) ->
64 {-# NOINLINE strLength #-}
67 Copying a char string prefix into a byte array,
68 {\em assuming} the prefix does not contain any
72 copyPrefixStr :: Addr -> Int -> ByteArray Int
73 copyPrefixStr (A# a) len@(I# length#) =
75 {- allocate an array that will hold the string
76 (not forgetting the NUL at the end)
78 (new_ps_array (length# +# 1#)) >>= \ ch_array ->
79 {- Revert back to Haskell-only solution for the moment.
80 _ccall_ memcpy ch_array (A# a) len >>= \ () ->
81 write_ps_array ch_array length# (chr# 0#) >>
83 -- fill in packed string from "addr"
84 fill_in ch_array 0# >>
86 freeze_ps_array ch_array length# >>= \ barr ->
89 fill_in :: MutableByteArray s Int -> Int# -> ST s ()
93 = write_ps_array arr_in# idx (chr# 0#) >>
96 = case (indexCharOffAddr# a idx) of { ch ->
97 write_ps_array arr_in# idx ch >>
98 fill_in arr_in# (idx +# 1#) }
102 Copying out a substring, assume a 0-indexed string:
103 (and positive lengths, thank you).
106 copySubStr :: Addr -> Int -> Int -> ByteArray Int
107 copySubStr a start length =
109 _casm_ `` %r= (char *)((char *)%0 + (int)%1); '' a start
111 return (copyPrefixStr a_start length))
113 -- step on (char *) pointer by x units.
114 addrOffset# :: Addr# -> Int# -> Addr#
116 case unsafePerformIO (_casm_ ``%r=(char *)((char *)%0 + (int)%1); '' (A# a#) (I# i#)) of
119 copySubStrBA :: ByteArray Int -> Int -> Int -> ByteArray Int
120 #if __GLASGOW_HASKELL__ >= 405
121 copySubStrBA (ByteArray _ _ barr#) (I# start#) len@(I# length#) =
123 copySubStrBA (ByteArray _ barr#) (I# start#) len@(I# length#) =
126 {- allocate an array that will hold the string
127 (not forgetting the NUL at the end)
129 new_ps_array (length# +# 1#) >>= \ ch_array ->
130 -- fill in packed string from "addr"
131 fill_in ch_array 0# >>
133 freeze_ps_array ch_array length#)
135 fill_in :: MutableByteArray s Int -> Int# -> ST s ()
139 = write_ps_array arr_in# idx (chr# 0#) >>
142 = case (indexCharArray# barr# (start# +# idx)) of { ch ->
143 write_ps_array arr_in# idx ch >>
144 fill_in arr_in# (idx +# 1#) }
147 (Very :-) ``Specialised'' versions of some CharArray things...
148 [Copied from PackBase; no real reason -- UGH]
151 new_ps_array :: Int# -> ST s (MutableByteArray s Int)
152 write_ps_array :: MutableByteArray s Int -> Int# -> Char# -> ST s ()
153 freeze_ps_array :: MutableByteArray s Int -> Int# -> ST s (ByteArray Int)
155 new_ps_array size = ST $ \ s ->
156 #if __GLASGOW_HASKELL__ < 400
157 case (newCharArray# size s) of { StateAndMutableByteArray# s2# barr# ->
158 STret s2# (MutableByteArray bot barr#) }
159 #elif __GLASGOW_HASKELL__ < 405
160 case (newCharArray# size s) of { (# s2#, barr# #) ->
161 (# s2#, MutableByteArray bot barr# #) }
162 #elif __GLASGOW_HASKELL__ < 411
163 case (newCharArray# size s) of { (# s2#, barr# #) ->
164 (# s2#, MutableByteArray bot bot barr# #) }
165 #else /* 411 and higher */
166 case (newByteArray# size s) of { (# s2#, barr# #) ->
167 (# s2#, MutableByteArray bot bot barr# #) }
170 bot = error "new_ps_array"
172 #if __GLASGOW_HASKELL__ < 400
173 write_ps_array (MutableByteArray _ barr#) n ch = ST $ \ s# ->
174 case writeCharArray# barr# n ch s# of { s2# ->
176 #elif __GLASGOW_HASKELL__ < 405
177 write_ps_array (MutableByteArray _ barr#) n ch = ST $ \ s# ->
178 case writeCharArray# barr# n ch s# of { s2# ->
181 write_ps_array (MutableByteArray _ _ barr#) n ch = ST $ \ s# ->
182 case writeCharArray# barr# n ch s# of { s2# ->
186 -- same as unsafeFreezeByteArray
187 #if __GLASGOW_HASKELL__ < 400
188 freeze_ps_array (MutableByteArray _ arr#) len# = ST $ \ s# ->
189 case unsafeFreezeByteArray# arr# s# of { StateAndByteArray# s2# frozen# ->
190 STret s2# (ByteArray (0,I# len#) frozen#) }
191 #elif __GLASGOW_HASKELL__ < 405
192 freeze_ps_array (MutableByteArray _ arr#) len# = ST $ \ s# ->
193 case unsafeFreezeByteArray# arr# s# of { (# s2#, frozen# #) ->
194 (# s2#, ByteArray (0,I# len#) frozen# #) }
196 freeze_ps_array (MutableByteArray _ _ arr#) len# = ST $ \ s# ->
197 case unsafeFreezeByteArray# arr# s# of { (# s2#, frozen# #) ->
198 (# s2#, ByteArray 0 (I# len#) frozen# #) }
203 Compare two equal-length strings for equality:
206 eqStrPrefix :: Addr# -> ByteArray# -> Int# -> Bool
207 eqStrPrefix a# barr# len# =
209 #if __GLASGOW_HASKELL__ < 405
210 _ccall_ strncmp (A# a#) (ByteArray bot barr#) (I# len#) >>= \ (I# x#) ->
212 _ccall_ strncmp (A# a#) (ByteArray bot bot barr#) (I# len#) >>= \ (I# x#) ->
216 #if __GLASGOW_HASKELL__ < 405
221 bot = error "eqStrPrefix"
223 eqCharStrPrefix :: Addr# -> Addr# -> Int# -> Bool
224 eqCharStrPrefix a1# a2# len# =
226 _ccall_ strncmp (A# a1#) (A# a2#) (I# len#) >>= \ (I# x#) ->
229 eqStrPrefixBA :: ByteArray# -> ByteArray# -> Int# -> Int# -> Bool
230 eqStrPrefixBA b1# b2# start# len# =
232 _casm_ ``%r=(int)strncmp((char *)%0+(int)%1,%2,%3); ''
233 #if __GLASGOW_HASKELL__ < 405
236 (ByteArray bot bot b2#)
239 #if __GLASGOW_HASKELL__ < 405
242 (ByteArray bot bot b1#)
244 (I# len#) >>= \ (I# x#) ->
247 #if __GLASGOW_HASKELL__ < 405
252 bot = error "eqStrPrefixBA"
254 eqCharStrPrefixBA :: Addr# -> ByteArray# -> Int# -> Int# -> Bool
255 eqCharStrPrefixBA a# b2# start# len# =
257 _casm_ ``%r=(int)strncmp((char *)%0+(int)%1,%2,%3); ''
258 #if __GLASGOW_HASKELL__ < 405
261 (ByteArray bot bot b2#)
265 (I# len#) >>= \ (I# x#) ->
268 #if __GLASGOW_HASKELL__ < 405
273 bot = error "eqCharStrPrefixBA"