llvm-hs-pure-4.0.0.0: Pure Haskell LLVM functionality (no FFI).
LLVM.AST.AddrSpace
Description
Pointers exist in Address Spaces
Synopsis
data AddrSpace Source #
See http://llvm.org/docs/LangRef.html#pointer-type
Constructors
Instances
Methods
(==) :: AddrSpace -> AddrSpace -> Bool #
(/=) :: AddrSpace -> AddrSpace -> Bool #
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AddrSpace -> c AddrSpace #
gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AddrSpace #
toConstr :: AddrSpace -> Constr #
dataTypeOf :: AddrSpace -> DataType #
dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c AddrSpace) #
dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AddrSpace) #
gmapT :: (forall b. Data b => b -> b) -> AddrSpace -> AddrSpace #
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AddrSpace -> r #
gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AddrSpace -> r #
gmapQ :: (forall d. Data d => d -> u) -> AddrSpace -> [u] #
gmapQi :: Int -> (forall d. Data d => d -> u) -> AddrSpace -> u #
gmapM :: Monad m => (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace #
gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace #
gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AddrSpace -> m AddrSpace #
compare :: AddrSpace -> AddrSpace -> Ordering #
(<) :: AddrSpace -> AddrSpace -> Bool #
(<=) :: AddrSpace -> AddrSpace -> Bool #
(>) :: AddrSpace -> AddrSpace -> Bool #
(>=) :: AddrSpace -> AddrSpace -> Bool #
max :: AddrSpace -> AddrSpace -> AddrSpace #
min :: AddrSpace -> AddrSpace -> AddrSpace #
readsPrec :: Int -> ReadS AddrSpace #
readList :: ReadS [AddrSpace] #
readPrec :: ReadPrec AddrSpace #
readListPrec :: ReadPrec [AddrSpace] #
showsPrec :: Int -> AddrSpace -> ShowS #
show :: AddrSpace -> String #
showList :: [AddrSpace] -> ShowS #