1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530
|
{-# LANGUAGE DeriveDataTypeable, TypeFamilies, CPP #-}
-- |
-- Module : Data.UUID
-- Copyright : (c) 2008-2009, 2012 Antoine Latter
-- (c) 2009 Mark Lentczner
--
-- License : BSD-style
--
-- Maintainer : aslatter@gmail.com
-- Stability : experimental
-- Portability : portable
module Data.UUID.Internal
(UUID(..)
,null
,nil
,fromByteString
,toByteString
,fromString
,toString
,fromWords
,toWords
,toList
,buildFromBytes
,buildFromWords
,fromASCIIBytes
,toASCIIBytes
,fromLazyASCIIBytes
,toLazyASCIIBytes
,UnpackedUUID(..)
,pack
,unpack
) where
import Prelude hiding (null)
import Control.Applicative ((<*>))
import Control.DeepSeq (NFData(..))
import Control.Monad (liftM4, guard)
import Data.Functor ((<$>))
import Data.Char
import Data.Bits
import Data.Hashable
import Data.List (elemIndices)
import Foreign.Ptr (Ptr)
#if MIN_VERSION_base(4,0,0)
import Data.Data
#else
import Data.Generics.Basics
#endif
import Foreign.Storable
import Data.Binary
import Data.Binary.Put
import Data.Binary.Get
import qualified Data.ByteString as B
import qualified Data.ByteString.Internal as BI
import qualified Data.ByteString.Lazy as BL
import qualified Data.ByteString.Unsafe as BU
import Data.UUID.Builder
import Data.Word.Util
import System.Random
-- |The UUID type. A 'Random' instance is provided which produces
-- version 4 UUIDs as specified in RFC 4122. The 'Storable' and
-- 'Binary' instances are compatible with RFC 4122, storing the fields
-- in network order as 16 bytes.
data UUID
= UUID
{-# UNPACK #-} !Word32
{-# UNPACK #-} !Word32
{-# UNPACK #-} !Word32
{-# UNPACK #-} !Word32
deriving (Eq, Ord, Typeable)
{-
Other representations that we tried are:
Mimic V1 structure: !Word32 !Word16 !Word16 !Word16
!Word8 !Word8 !Word8 !Word8 !Word8 !Word8
Sixteen bytes: !Word8 ... (x 16)
Simple list of bytes: [Word8]
ByteString (strict) ByteString
Immutable array: UArray Int Word8
Vector: UArr Word8
None was as fast, overall, as the representation used here.
-}
-- | Covert a 'UUID' into a sequence of 'Word32' values.
-- Usefull for when you need to serialize a UUID and
-- neither 'Storable' nor 'Binary' are appropriate.
-- Introduced in version 1.2.2.
toWords :: UUID -> (Word32, Word32, Word32, Word32)
toWords (UUID w1 w2 w3 w4) = (w1, w2, w3, w4)
-- | Create a 'UUID' from a sequence of 'Word32'. The
-- opposite of 'toWords'. Useful when you need a total
-- function for constructing 'UUID' values.
-- Introduced in version 1.2.2.
fromWords :: Word32 -> Word32 -> Word32 -> Word32 -> UUID
fromWords = UUID
data UnpackedUUID =
UnpackedUUID {
time_low :: Word32 -- 0-3
, time_mid :: Word16 -- 4-5
, time_hi_and_version :: Word16 -- 6-7
, clock_seq_hi_res :: Word8 -- 8
, clock_seq_low :: Word8 -- 9
, node_0 :: Word8
, node_1 :: Word8
, node_2 :: Word8
, node_3 :: Word8
, node_4 :: Word8
, node_5 :: Word8
}
deriving (Read, Show, Eq, Ord)
unpack :: UUID -> UnpackedUUID
unpack (UUID w0 w1 w2 w3) =
build /-/ w0 /-/ w1 /-/ w2 /-/ w3
where
build x0 x1 x2 x3 x4 x5 x6 x7 x8 x9 xA xB xC xD xE xF =
UnpackedUUID {
time_low = word x0 x1 x2 x3
, time_mid = w8to16 x4 x5
, time_hi_and_version = w8to16 x6 x7
, clock_seq_hi_res = x8
, clock_seq_low = x9
, node_0 = xA
, node_1 = xB
, node_2 = xC
, node_3 = xD
, node_4 = xE
, node_5 = xF
}
pack :: UnpackedUUID -> UUID
pack unpacked =
makeFromBytes /-/ (time_low unpacked)
/-/ (time_mid unpacked)
/-/ (time_hi_and_version unpacked)
/-/ (clock_seq_hi_res unpacked)
/-/ (clock_seq_low unpacked)
/-/ (node_0 unpacked) /-/ (node_1 unpacked)
/-/ (node_2 unpacked) /-/ (node_3 unpacked)
/-/ (node_4 unpacked) /-/ (node_5 unpacked)
--
-- UTILITIES
--
-- |Build a Word32 from four Word8 values, presented in big-endian order
word :: Word8 -> Word8 -> Word8 -> Word8 -> Word32
word a b c d = (fromIntegral a `shiftL` 24)
.|. (fromIntegral b `shiftL` 16)
.|. (fromIntegral c `shiftL` 8)
.|. (fromIntegral d )
-- |Extract a Word8 from a Word32. Bytes, high to low, are numbered from 3 to 0,
byte :: Int -> Word32 -> Word8
byte i w = fromIntegral (w `shiftR` (i * 8))
-- |Make a UUID from sixteen Word8 values
makeFromBytes :: Word8 -> Word8 -> Word8 -> Word8
-> Word8 -> Word8 -> Word8 -> Word8
-> Word8 -> Word8 -> Word8 -> Word8
-> Word8 -> Word8 -> Word8 -> Word8
-> UUID
makeFromBytes b0 b1 b2 b3 b4 b5 b6 b7 b8 b9 ba bb bc bd be bf
= UUID w0 w1 w2 w3
where w0 = word b0 b1 b2 b3
w1 = word b4 b5 b6 b7
w2 = word b8 b9 ba bb
w3 = word bc bd be bf
-- |Make a UUID from four Word32 values
makeFromWords :: Word32 -> Word32 -> Word32 -> Word32 -> UUID
makeFromWords = UUID
-- |A Builder for constructing a UUID of a given version.
buildFromBytes :: Word8
-> Word8 -> Word8 -> Word8 -> Word8
-> Word8 -> Word8 -> Word8 -> Word8
-> Word8 -> Word8 -> Word8 -> Word8
-> Word8 -> Word8 -> Word8 -> Word8
-> UUID
buildFromBytes v b0 b1 b2 b3 b4 b5 b6 b7 b8 b9 ba bb bc bd be bf =
makeFromBytes b0 b1 b2 b3 b4 b5 b6' b7 b8' b9 ba bb bc bd be bf
where b6' = b6 .&. 0x0f .|. (v `shiftL` 4)
b8' = b8 .&. 0x3f .|. 0x80
-- |Build a UUID of a given version from Word32 values.
buildFromWords :: Word8 -> Word32 -> Word32 -> Word32 -> Word32 -> UUID
buildFromWords v w0 w1 w2 w3 = makeFromWords w0 w1' w2' w3
where w1' = w1 .&. 0xffff0fff .|. ((fromIntegral v) `shiftL` 12)
w2' = w2 .&. 0x3fffffff .|. 0x80000000
-- |Return the bytes that make up the UUID
toList :: UUID -> [Word8]
toList (UUID w0 w1 w2 w3) =
[byte 3 w0, byte 2 w0, byte 1 w0, byte 0 w0,
byte 3 w1, byte 2 w1, byte 1 w1, byte 0 w1,
byte 3 w2, byte 2 w2, byte 1 w2, byte 0 w2,
byte 3 w3, byte 2 w3, byte 1 w3, byte 0 w3]
-- |Construct a UUID from a list of Word8. Returns Nothing if the list isn't
-- exactly sixteen bytes long
fromList :: [Word8] -> Maybe UUID
fromList [b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, ba, bb, bc, bd, be, bf] =
Just $ makeFromBytes b0 b1 b2 b3 b4 b5 b6 b7 b8 b9 ba bb bc bd be bf
fromList _ = Nothing
--
-- UUID API
--
-- |Returns true if the passed-in UUID is the 'nil' UUID.
null :: UUID -> Bool
null = (== nil)
-- Note: This actually faster than:
-- null (UUID 0 0 0 0) = True
-- null _ = False
-- |The nil UUID, as defined in RFC 4122.
-- It is a UUID of all zeros. @'null' u@ iff @'u' == 'nil'@.
nil :: UUID
nil = UUID 0 0 0 0
-- |Extract a UUID from a 'ByteString' in network byte order.
-- The argument must be 16 bytes long, otherwise 'Nothing' is returned.
fromByteString :: BL.ByteString -> Maybe UUID
fromByteString = fromList . BL.unpack
-- |Encode a UUID into a 'ByteString' in network order.
toByteString :: UUID -> BL.ByteString
toByteString = BL.pack . toList
-- |If the passed in 'String' can be parsed as a 'UUID', it will be.
-- The hyphens may not be omitted.
-- Example:
--
-- @
-- fromString \"c2cc10e1-57d6-4b6f-9899-38d972112d8c\"
-- @
--
-- Hex digits may be upper or lower-case.
fromString :: String -> Maybe UUID
fromString xs | validFmt = fromString' xs
| otherwise = Nothing
where validFmt = elemIndices '-' xs == [8,13,18,23]
fromString' :: String -> Maybe UUID
fromString' s0 = do
(w0, s1) <- hexWord s0
(w1, s2) <- hexWord s1
(w2, s3) <- hexWord s2
(w3, s4) <- hexWord s3
if s4 /= "" then Nothing
else Just $ UUID w0 w1 w2 w3
where hexWord :: String -> Maybe (Word32, String)
hexWord s = Just (0, s) >>= hexByte >>= hexByte
>>= hexByte >>= hexByte
hexByte :: (Word32, String) -> Maybe (Word32, String)
hexByte (w, '-':ds) = hexByte (w, ds)
hexByte (w, hi:lo:ds)
| bothHex = Just ((w `shiftL` 8) .|. octet, ds)
| otherwise = Nothing
where bothHex = isHexDigit hi && isHexDigit lo
octet = fromIntegral (16 * digitToInt hi + digitToInt lo)
hexByte _ = Nothing
-- | Convert a UUID into a hypenated string using lower-case letters.
-- Example:
--
-- @
-- toString \<$\> fromString \"550e8400-e29b-41d4-a716-446655440000\"
-- @
toString :: UUID -> String
toString (UUID w0 w1 w2 w3) = hexw w0 $ hexw' w1 $ hexw' w2 $ hexw w3 ""
where hexw :: Word32 -> String -> String
hexw w s = hexn w 28 : hexn w 24 : hexn w 20 : hexn w 16
: hexn w 12 : hexn w 8 : hexn w 4 : hexn w 0 : s
hexw' :: Word32 -> String -> String
hexw' w s = '-' : hexn w 28 : hexn w 24 : hexn w 20 : hexn w 16
: '-' : hexn w 12 : hexn w 8 : hexn w 4 : hexn w 0 : s
hexn :: Word32 -> Int -> Char
hexn w r = intToDigit $ fromIntegral ((w `shiftR` r) .&. 0xf)
-- | Convert a UUID into a hyphentated string using lower-case letters, packed
-- as ASCII bytes into `B.ByteString`.
--
-- This should be equivalent to `toString` with `Data.ByteString.Char8.pack`.
toASCIIBytes :: UUID -> B.ByteString
toASCIIBytes uuid = BI.unsafeCreate 36 (pokeASCII uuid)
-- | Helper function for `toASCIIBytes`
pokeASCII :: UUID -> Ptr Word8 -> IO ()
pokeASCII uuid ptr = do
pokeDash 8
pokeDash 13
pokeDash 18
pokeDash 23
pokeSingle 0 w0
pokeDouble 9 w1
pokeDouble 19 w2
pokeSingle 28 w3
where
(w0, w1, w2, w3) = toWords uuid
-- ord '-' ==> 45
pokeDash ix = pokeElemOff ptr ix 45
pokeSingle ix w = do
pokeWord ix w 28
pokeWord (ix + 1) w 24
pokeWord (ix + 2) w 20
pokeWord (ix + 3) w 16
pokeWord (ix + 4) w 12
pokeWord (ix + 5) w 8
pokeWord (ix + 6) w 4
pokeWord (ix + 7) w 0
-- We skip the dash in the middle
pokeDouble ix w = do
pokeWord ix w 28
pokeWord (ix + 1) w 24
pokeWord (ix + 2) w 20
pokeWord (ix + 3) w 16
pokeWord (ix + 5) w 12
pokeWord (ix + 6) w 8
pokeWord (ix + 7) w 4
pokeWord (ix + 8) w 0
pokeWord ix w r =
pokeElemOff ptr ix (fromIntegral (toDigit ((w `shiftR` r) .&. 0xf)))
toDigit :: Word32 -> Word32
toDigit w = if w < 10 then 48 + w else 97 + w - 10
-- | If the passed in `B.ByteString` can be parsed as an ASCII representation of
-- a `UUID`, it will be. The hyphens may not be omitted.
--
-- This should be equivalent to `fromString` with `Data.ByteString.Char8.unpack`.
fromASCIIBytes :: B.ByteString -> Maybe UUID
fromASCIIBytes bs = do
guard wellFormed
fromWords <$> single 0 <*> double 9 14 <*> double 19 24 <*> single 28
where
-- ord '-' ==> 45
dashIx bs' ix = BU.unsafeIndex bs' ix == 45
-- Important: check the length first, given the `unsafeIndex` later.
wellFormed =
B.length bs == 36 && dashIx bs 8 && dashIx bs 13 &&
dashIx bs 18 && dashIx bs 23
single ix = combine <$> octet ix <*> octet (ix + 2)
<*> octet (ix + 4) <*> octet (ix + 6)
double ix0 ix1 = combine <$> octet ix0 <*> octet (ix0 + 2)
<*> octet ix1 <*> octet (ix1 + 2)
combine o0 o1 o2 o3 = shiftL o0 24 .|. shiftL o1 16 .|. shiftL o2 8 .|. o3
octet ix = do
hi <- fromIntegral <$> toDigit (BU.unsafeIndex bs ix)
lo <- fromIntegral <$> toDigit (BU.unsafeIndex bs (ix + 1))
return (16 * hi + lo)
toDigit :: Word8 -> Maybe Word8
toDigit w
-- Digit
| w >= 48 && w <= 57 = Just (w - 48)
-- Uppercase
| w >= 65 && w <= 70 = Just (10 + w - 65)
-- Lowercase
| w >= 97 && w <= 102 = Just (10 + w - 97)
| otherwise = Nothing
-- | Similar to `toASCIIBytes` except we produce a lazy `BL.ByteString`.
toLazyASCIIBytes :: UUID -> BL.ByteString
toLazyASCIIBytes =
#if MIN_VERSION_bytestring(0,10,0)
BL.fromStrict
#else
BL.fromChunks . return
#endif
. toASCIIBytes
-- | Similar to `fromASCIIBytes` except parses from a lazy `BL.ByteString`.
fromLazyASCIIBytes :: BL.ByteString -> Maybe UUID
fromLazyASCIIBytes bs =
if BL.length bs == 36 then fromASCIIBytes (
#if MIN_VERSION_bytestring(0,10,0)
BL.toStrict bs
#else
B.concat $ BL.toChunks bs
#endif
) else Nothing
--
-- Class Instances
--
instance Random UUID where
random g = (fromGenNext w0 w1 w2 w3 w4, g4)
where (w0, g0) = next g
(w1, g1) = next g0
(w2, g2) = next g1
(w3, g3) = next g2
(w4, g4) = next g3
randomR _ = random -- range is ignored
-- |Build a UUID from the results of five calls to next on a StdGen.
-- While next on StdGet returns an Int, it doesn't provide 32 bits of
-- randomness. This code relies on at last 28 bits of randomness in the
-- and optimizes its use so as to make only five random values, not six.
fromGenNext :: Int -> Int -> Int -> Int -> Int -> UUID
fromGenNext w0 w1 w2 w3 w4 =
buildFromBytes 4 /-/ (ThreeByte w0)
/-/ (ThreeByte w1)
/-/ w2 -- use all 4 bytes because we know the version
-- field will "cover" the upper, non-random bits
/-/ (ThreeByte w3)
/-/ (ThreeByte w4)
-- |A ByteSource to extract only three bytes from an Int, since next on StdGet
-- only returns 31 bits of randomness.
type instance ByteSink ThreeByte g = Takes3Bytes g
newtype ThreeByte = ThreeByte Int
instance ByteSource ThreeByte where
f /-/ (ThreeByte w) = f b1 b2 b3
where b1 = fromIntegral (w `shiftR` 16)
b2 = fromIntegral (w `shiftR` 8)
b3 = fromIntegral w
instance NFData UUID where
rnf = rnf . toWords
instance Hashable UUID where
hash (UUID w0 w1 w2 w3) =
hash w0 `hashWithSalt` w1
`hashWithSalt` w2
`hashWithSalt` w3
hashWithSalt s (UUID w0 w1 w2 w3) =
s `hashWithSalt` w0
`hashWithSalt` w1
`hashWithSalt` w2
`hashWithSalt` w3
instance Show UUID where
show = toString
instance Read UUID where
readsPrec _ str =
let noSpaces = dropWhile isSpace str
in case fromString (take 36 noSpaces) of
Nothing -> []
Just u -> [(u,drop 36 noSpaces)]
instance Storable UUID where
sizeOf _ = 16
alignment _ = 4
peekByteOff p off =
pack <$>
(UnpackedUUID
<$> peekByteOff p off -- Word32
<*> peekByteOff p (off+4) -- Word16
<*> peekByteOff p (off+6) -- Word16
<*> peekByteOff p (off+8) -- Word8
<*> peekByteOff p (off+9) -- Word8
<*> peekByteOff p (off+10) -- Word8
<*> peekByteOff p (off+11) -- Word8
<*> peekByteOff p (off+12) -- Word8
<*> peekByteOff p (off+13) -- Word8
<*> peekByteOff p (off+14) -- Word8
<*> peekByteOff p (off+15) -- Word8
)
pokeByteOff p off u =
case unpack u of
(UnpackedUUID x0 x1 x2 x3 x4 x5 x6 x7 x8 x9 x10) ->
do
pokeByteOff p off x0
pokeByteOff p (off+4) x1
pokeByteOff p (off+6) x2
pokeByteOff p (off+8) x3
pokeByteOff p (off+9) x4
pokeByteOff p (off+10) x5
pokeByteOff p (off+11) x6
pokeByteOff p (off+12) x7
pokeByteOff p (off+13) x8
pokeByteOff p (off+14) x9
pokeByteOff p (off+15) x10
instance Binary UUID where
put (UUID w0 w1 w2 w3) =
putWord32be w0 >> putWord32be w1 >> putWord32be w2 >> putWord32be w3
get = liftM4 UUID getWord32be getWord32be getWord32be getWord32be
-- My goal with this instance was to make it work just enough to do what
-- I want when used with the HStringTemplate library.
instance Data UUID where
toConstr uu = mkConstr uuidType (show uu) [] (error "fixity")
gunfold _ _ = error "gunfold"
dataTypeOf _ = uuidType
uuidType :: DataType
uuidType = mkNoRepType "Data.UUID.UUID"
#if !(MIN_VERSION_base(4,2,0))
mkNoRepType :: String -> DataType
mkNoRepType = mkNorepType
#endif
|