-- | Pointers exist in Address Spaces 
module LLVM.AST.AddrSpace where

import LLVM.Prelude

-- | See <http://llvm.org/docs/LangRef.html#pointer-type>
data AddrSpace = AddrSpace Word32
   deriving (AddrSpace -> AddrSpace -> Bool
(AddrSpace -> AddrSpace -> Bool)
-> (AddrSpace -> AddrSpace -> Bool) -> Eq AddrSpace
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: AddrSpace -> AddrSpace -> Bool
$c/= :: AddrSpace -> AddrSpace -> Bool
== :: AddrSpace -> AddrSpace -> Bool
$c== :: AddrSpace -> AddrSpace -> Bool
Eq, Eq AddrSpace
Eq AddrSpace =>
(AddrSpace -> AddrSpace -> Ordering)
-> (AddrSpace -> AddrSpace -> Bool)
-> (AddrSpace -> AddrSpace -> Bool)
-> (AddrSpace -> AddrSpace -> Bool)
-> (AddrSpace -> AddrSpace -> Bool)
-> (AddrSpace -> AddrSpace -> AddrSpace)
-> (AddrSpace -> AddrSpace -> AddrSpace)
-> Ord AddrSpace
AddrSpace -> AddrSpace -> Bool
AddrSpace -> AddrSpace -> Ordering
AddrSpace -> AddrSpace -> AddrSpace
forall a.
Eq a =>
(a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: AddrSpace -> AddrSpace -> AddrSpace
$cmin :: AddrSpace -> AddrSpace -> AddrSpace
max :: AddrSpace -> AddrSpace -> AddrSpace
$cmax :: AddrSpace -> AddrSpace -> AddrSpace
>= :: AddrSpace -> AddrSpace -> Bool
$c>= :: AddrSpace -> AddrSpace -> Bool
> :: AddrSpace -> AddrSpace -> Bool
$c> :: AddrSpace -> AddrSpace -> Bool
<= :: AddrSpace -> AddrSpace -> Bool
$c<= :: AddrSpace -> AddrSpace -> Bool
< :: AddrSpace -> AddrSpace -> Bool
$c< :: AddrSpace -> AddrSpace -> Bool
compare :: AddrSpace -> AddrSpace -> Ordering
$ccompare :: AddrSpace -> AddrSpace -> Ordering
$cp1Ord :: Eq AddrSpace
Ord, ReadPrec [AddrSpace]
ReadPrec AddrSpace
Int -> ReadS AddrSpace
ReadS [AddrSpace]
(Int -> ReadS AddrSpace)
-> ReadS [AddrSpace]
-> ReadPrec AddrSpace
-> ReadPrec [AddrSpace]
-> Read AddrSpace
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [AddrSpace]
$creadListPrec :: ReadPrec [AddrSpace]
readPrec :: ReadPrec AddrSpace
$creadPrec :: ReadPrec AddrSpace
readList :: ReadS [AddrSpace]
$creadList :: ReadS [AddrSpace]
readsPrec :: Int -> ReadS AddrSpace
$creadsPrec :: Int -> ReadS AddrSpace
Read, Int -> AddrSpace -> ShowS
[AddrSpace] -> ShowS
AddrSpace -> String
(Int -> AddrSpace -> ShowS)
-> (AddrSpace -> String)
-> ([AddrSpace] -> ShowS)
-> Show AddrSpace
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [AddrSpace] -> ShowS
$cshowList :: [AddrSpace] -> ShowS
show :: AddrSpace -> String
$cshow :: AddrSpace -> String
showsPrec :: Int -> AddrSpace -> ShowS
$cshowsPrec :: Int -> AddrSpace -> ShowS
Show, Typeable, Typeable AddrSpace
DataType
Constr
Typeable AddrSpace =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> AddrSpace -> c AddrSpace)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c AddrSpace)
-> (AddrSpace -> Constr)
-> (AddrSpace -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c AddrSpace))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AddrSpace))
-> ((forall b. Data b => b -> b) -> AddrSpace -> AddrSpace)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> AddrSpace -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> AddrSpace -> r)
-> (forall u. (forall d. Data d => d -> u) -> AddrSpace -> [u])
-> (forall u.
    Int -> (forall d. Data d => d -> u) -> AddrSpace -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace)
-> Data AddrSpace
AddrSpace -> DataType
AddrSpace -> Constr
(forall b. Data b => b -> b) -> AddrSpace -> AddrSpace
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> AddrSpace -> c AddrSpace
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c AddrSpace
forall a.
Typeable a =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> AddrSpace -> u
forall u. (forall d. Data d => d -> u) -> AddrSpace -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> AddrSpace -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> AddrSpace -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c AddrSpace
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> AddrSpace -> c AddrSpace
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c AddrSpace)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AddrSpace)
$cAddrSpace :: Constr
$tAddrSpace :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace
gmapMp :: (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace
gmapM :: (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace
gmapQi :: Int -> (forall d. Data d => d -> u) -> AddrSpace -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> AddrSpace -> u
gmapQ :: (forall d. Data d => d -> u) -> AddrSpace -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> AddrSpace -> [u]
gmapQr :: (r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> AddrSpace -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> AddrSpace -> r
gmapQl :: (r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> AddrSpace -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> AddrSpace -> r
gmapT :: (forall b. Data b => b -> b) -> AddrSpace -> AddrSpace
$cgmapT :: (forall b. Data b => b -> b) -> AddrSpace -> AddrSpace
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AddrSpace)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AddrSpace)
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c AddrSpace)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c AddrSpace)
dataTypeOf :: AddrSpace -> DataType
$cdataTypeOf :: AddrSpace -> DataType
toConstr :: AddrSpace -> Constr
$ctoConstr :: AddrSpace -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c AddrSpace
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c AddrSpace
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> AddrSpace -> c AddrSpace
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> AddrSpace -> c AddrSpace
$cp1Data :: Typeable AddrSpace
Data, (forall x. AddrSpace -> Rep AddrSpace x)
-> (forall x. Rep AddrSpace x -> AddrSpace) -> Generic AddrSpace
forall x. Rep AddrSpace x -> AddrSpace
forall x. AddrSpace -> Rep AddrSpace x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep AddrSpace x -> AddrSpace
$cfrom :: forall x. AddrSpace -> Rep AddrSpace x
Generic)