Data.LLVM.Internal

This module exports some internal modules *for use in testing only*.

Documentation

parseMetadataBlock

Arguments

:: Int

globals seen so far

-> ValueTable

-> [Entry]

-> Parse ParsedMetadata

parseMetadataKindEntry :: Record -> Parse ()

data PartialUnnamedMd

Constructors

PartialUnnamedMd

Fields

• pumIndex :: Int
• pumValues :: PValMd
• pumDistinct :: Bool

Instances

Data PartialUnnamedMd

Defined in Data.LLVM.BitCode.IR.Metadata

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PartialUnnamedMd -> c PartialUnnamedMd

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PartialUnnamedMd

toConstr :: PartialUnnamedMd -> Constr

dataTypeOf :: PartialUnnamedMd -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PartialUnnamedMd)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PartialUnnamedMd)

gmapT :: (forall b. Data b => b -> b) -> PartialUnnamedMd -> PartialUnnamedMd

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PartialUnnamedMd -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PartialUnnamedMd -> r

gmapQ :: (forall d. Data d => d -> u) -> PartialUnnamedMd -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> PartialUnnamedMd -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> PartialUnnamedMd -> m PartialUnnamedMd

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PartialUnnamedMd -> m PartialUnnamedMd

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PartialUnnamedMd -> m PartialUnnamedMd

Generic PartialUnnamedMd

Defined in Data.LLVM.BitCode.IR.Metadata

Associated Types

type Rep PartialUnnamedMd :: Type -> Type

Methods

from :: PartialUnnamedMd -> Rep PartialUnnamedMd x

to :: Rep PartialUnnamedMd x -> PartialUnnamedMd

Show PartialUnnamedMd

Defined in Data.LLVM.BitCode.IR.Metadata

Methods

showsPrec :: Int -> PartialUnnamedMd -> ShowS

show :: PartialUnnamedMd -> String

showList :: [PartialUnnamedMd] -> ShowS

Eq PartialUnnamedMd

Defined in Data.LLVM.BitCode.IR.Metadata

Methods

(==) :: PartialUnnamedMd -> PartialUnnamedMd -> Bool

(/=) :: PartialUnnamedMd -> PartialUnnamedMd -> Bool

Ord PartialUnnamedMd

Defined in Data.LLVM.BitCode.IR.Metadata

Methods

compare :: PartialUnnamedMd -> PartialUnnamedMd -> Ordering

(<) :: PartialUnnamedMd -> PartialUnnamedMd -> Bool

(<=) :: PartialUnnamedMd -> PartialUnnamedMd -> Bool

(>) :: PartialUnnamedMd -> PartialUnnamedMd -> Bool

(>=) :: PartialUnnamedMd -> PartialUnnamedMd -> Bool

max :: PartialUnnamedMd -> PartialUnnamedMd -> PartialUnnamedMd

min :: PartialUnnamedMd -> PartialUnnamedMd -> PartialUnnamedMd

type Rep PartialUnnamedMd

Defined in Data.LLVM.BitCode.IR.Metadata

type Rep PartialUnnamedMd

finalizePartialUnnamedMd :: PartialUnnamedMd -> Finalize UnnamedMd

finalizePValMd :: PValMd -> Finalize ValMd

dedupMetadata :: Seq PartialUnnamedMd -> Seq PartialUnnamedMd

This function generically traverses the given unnamed metadata values. When it encounters one with a PValMd inside of it, it looks up that value in the list. If found, it replaces the value with a reference to it.

Such de-duplication is necessary because the fallback of mdForwardRefOrNull is often called when it is in fact unnecessary, just because the appropriate references aren't available yet.

This function is concise at the cost of efficiency: In the worst case, every metadata node contains a reference to every other metadata node, and the cost is O(n^2*log(n)) where * n^2 comes from looking at every PValMd inside every PartialUnnamedMd * log(n) is the cost of looking them up in a Map.

type InstrMdAttachments = Map Int [(KindMd, PValMd)]

type PFnMdAttachments = Map PKindMd PValMd

type PKindMd = Int

type PGlobalAttachments = Map Symbol (Map KindMd PValMd)