-- | Module to allow importing 'Linkage' distinctly qualified. module LLVM.AST.Linkage where import LLVM.Prelude -- | <http://llvm.org/docs/LangRef.html#linkage> data Linkage = Private | Internal | AvailableExternally | LinkOnce | Weak | Common | Appending | ExternWeak | LinkOnceODR | WeakODR | External deriving (Linkage -> Linkage -> Bool (Linkage -> Linkage -> Bool) -> (Linkage -> Linkage -> Bool) -> Eq Linkage forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a /= :: Linkage -> Linkage -> Bool $c/= :: Linkage -> Linkage -> Bool == :: Linkage -> Linkage -> Bool $c== :: Linkage -> Linkage -> Bool Eq, ReadPrec [Linkage] ReadPrec Linkage Int -> ReadS Linkage ReadS [Linkage] (Int -> ReadS Linkage) -> ReadS [Linkage] -> ReadPrec Linkage -> ReadPrec [Linkage] -> Read Linkage forall a. (Int -> ReadS a) -> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a readListPrec :: ReadPrec [Linkage] $creadListPrec :: ReadPrec [Linkage] readPrec :: ReadPrec Linkage $creadPrec :: ReadPrec Linkage readList :: ReadS [Linkage] $creadList :: ReadS [Linkage] readsPrec :: Int -> ReadS Linkage $creadsPrec :: Int -> ReadS Linkage Read, Int -> Linkage -> ShowS [Linkage] -> ShowS Linkage -> String (Int -> Linkage -> ShowS) -> (Linkage -> String) -> ([Linkage] -> ShowS) -> Show Linkage forall a. (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a showList :: [Linkage] -> ShowS $cshowList :: [Linkage] -> ShowS show :: Linkage -> String $cshow :: Linkage -> String showsPrec :: Int -> Linkage -> ShowS $cshowsPrec :: Int -> Linkage -> ShowS Show, Typeable, Typeable Linkage DataType Constr Typeable Linkage => (forall (c :: * -> *). (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Linkage -> c Linkage) -> (forall (c :: * -> *). (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Linkage) -> (Linkage -> Constr) -> (Linkage -> DataType) -> (forall (t :: * -> *) (c :: * -> *). Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Linkage)) -> (forall (t :: * -> * -> *) (c :: * -> *). Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Linkage)) -> ((forall b. Data b => b -> b) -> Linkage -> Linkage) -> (forall r r'. (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Linkage -> r) -> (forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Linkage -> r) -> (forall u. (forall d. Data d => d -> u) -> Linkage -> [u]) -> (forall u. Int -> (forall d. Data d => d -> u) -> Linkage -> u) -> (forall (m :: * -> *). Monad m => (forall d. Data d => d -> m d) -> Linkage -> m Linkage) -> (forall (m :: * -> *). MonadPlus m => (forall d. Data d => d -> m d) -> Linkage -> m Linkage) -> (forall (m :: * -> *). MonadPlus m => (forall d. Data d => d -> m d) -> Linkage -> m Linkage) -> Data Linkage Linkage -> DataType Linkage -> Constr (forall b. Data b => b -> b) -> Linkage -> Linkage (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Linkage -> c Linkage (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Linkage 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) -> Linkage -> u forall u. (forall d. Data d => d -> u) -> Linkage -> [u] forall r r'. (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Linkage -> r forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Linkage -> r forall (m :: * -> *). Monad m => (forall d. Data d => d -> m d) -> Linkage -> m Linkage forall (m :: * -> *). MonadPlus m => (forall d. Data d => d -> m d) -> Linkage -> m Linkage forall (c :: * -> *). (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Linkage forall (c :: * -> *). (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Linkage -> c Linkage forall (t :: * -> *) (c :: * -> *). Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Linkage) forall (t :: * -> * -> *) (c :: * -> *). Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Linkage) $cExternal :: Constr $cWeakODR :: Constr $cLinkOnceODR :: Constr $cExternWeak :: Constr $cAppending :: Constr $cCommon :: Constr $cWeak :: Constr $cLinkOnce :: Constr $cAvailableExternally :: Constr $cInternal :: Constr $cPrivate :: Constr $tLinkage :: DataType gmapMo :: (forall d. Data d => d -> m d) -> Linkage -> m Linkage $cgmapMo :: forall (m :: * -> *). MonadPlus m => (forall d. Data d => d -> m d) -> Linkage -> m Linkage gmapMp :: (forall d. Data d => d -> m d) -> Linkage -> m Linkage $cgmapMp :: forall (m :: * -> *). MonadPlus m => (forall d. Data d => d -> m d) -> Linkage -> m Linkage gmapM :: (forall d. Data d => d -> m d) -> Linkage -> m Linkage $cgmapM :: forall (m :: * -> *). Monad m => (forall d. Data d => d -> m d) -> Linkage -> m Linkage gmapQi :: Int -> (forall d. Data d => d -> u) -> Linkage -> u $cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Linkage -> u gmapQ :: (forall d. Data d => d -> u) -> Linkage -> [u] $cgmapQ :: forall u. (forall d. Data d => d -> u) -> Linkage -> [u] gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Linkage -> r $cgmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Linkage -> r gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Linkage -> r $cgmapQl :: forall r r'. (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Linkage -> r gmapT :: (forall b. Data b => b -> b) -> Linkage -> Linkage $cgmapT :: (forall b. Data b => b -> b) -> Linkage -> Linkage dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Linkage) $cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *). Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Linkage) dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c Linkage) $cdataCast1 :: forall (t :: * -> *) (c :: * -> *). Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Linkage) dataTypeOf :: Linkage -> DataType $cdataTypeOf :: Linkage -> DataType toConstr :: Linkage -> Constr $ctoConstr :: Linkage -> Constr gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Linkage $cgunfold :: forall (c :: * -> *). (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Linkage gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Linkage -> c Linkage $cgfoldl :: forall (c :: * -> *). (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Linkage -> c Linkage $cp1Data :: Typeable Linkage Data, (forall x. Linkage -> Rep Linkage x) -> (forall x. Rep Linkage x -> Linkage) -> Generic Linkage forall x. Rep Linkage x -> Linkage forall x. Linkage -> Rep Linkage x forall a. (forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a $cto :: forall x. Rep Linkage x -> Linkage $cfrom :: forall x. Linkage -> Rep Linkage x Generic)