Safe Haskell	Safe-Inferred
Language	Haskell2010

Unison.Runtime.MCode

Synopsis

data Args'
- = Arg1 !Int
- | Arg2 !Int !Int
- | ArgN !(PrimArray Int)
- | ArgR !Int !Int
data Args
- = ZArgs
- | VArg1 !Int
- | VArg2 !Int !Int
- | VArgR !Int !Int
- | VArgN !(PrimArray Int)
- | VArgV !Int
data RefNums = RN {
- dnum :: Reference -> Word64
- cnum :: Reference -> Word64
- anum :: Reference -> Maybe Int
}
data MLit
- = MI !Int
- | MN !Word64
- | MC !Char
- | MD !Double
- | MT !Text
- | MM !Referent
- | MY !Reference
data GInstr comb
- = Prim1 !Prim1 !Int
- | Prim2 !Prim2 !Int !Int
- | RefCAS !Int !Int !Int
- | ForeignCall !Bool !ForeignFunc !Args
- | SetDyn !Word64 !Int
- | Capture !Word64
- | Name !(GRef comb) !Args
- | Info !String
- | Pack !Reference !PackedTag !Args
- | Lit !MLit
- | Print !Int
- | Reset !(EnumSet Word64)
- | Fork !Int
- | Atomically !Int
- | Seq !Args
- | TryForce !Int
- | SandboxingFailure !Text
type Instr = GInstr CombIx
type RInstr val = GInstr (RComb val)
data GSection comb where
- App !Bool !(GRef comb) !Args
- Call !Bool !CombIx comb !Args
- Jump !Int !Args
- Match !Int !(GBranch comb)
- Yield !Args
- Ins !(GInstr comb) !(GSection comb)
- Let !(GSection comb) !CombIx !Int !(GSection comb)
- Die String
- Exit
- DMatch !(Maybe Reference) !Int !(GBranch comb)
- NMatch !(Maybe Reference) !Int !(GBranch comb)
- RMatch !Int !(GSection comb) !(EnumMap Word64 (GBranch comb))
- pattern MatchT :: Int -> GSection comb -> Map Text (GSection comb) -> GSection comb
- pattern MatchW :: Int -> GSection comb -> EnumMap Word64 (GSection comb) -> GSection comb
type RSection val = GSection (RComb val)
type Section = GSection CombIx
data GComb val comb where
- Comb !(GCombInfo comb)
- CachedVal !Word64 !val
- pattern Lam :: Int -> Int -> GSection comb -> GComb val comb
data GCombInfo comb = LamI !Int !Int !(GSection comb)
type Comb = GComb Void CombIx
newtype RComb val = RComb {
- unRComb :: GComb val (RComb val)
}
type RCombInfo val = GCombInfo (RComb val)
type GCombs val comb = EnumMap Word64 (GComb val comb)
type RCombs val = GCombs val (RComb val)
data CombIx = CIx !Reference !Word64 !Word64
data GRef comb
- = Stk !Int
- | Env !CombIx comb
- | Dyn !Word64
type RRef val = GRef (RComb val)
type Ref = GRef CombIx
data Prim1
- = DECI
- | DECN
- | INCI
- | INCN
- | NEGI
- | SGNI
- | LZRO
- | TZRO
- | COMN
- | COMI
- | POPC
- | ABSF
- | EXPF
- | LOGF
- | SQRT
- | COSF
- | ACOS
- | COSH
- | ACSH
- | SINF
- | ASIN
- | SINH
- | ASNH
- | TANF
- | ATAN
- | TANH
- | ATNH
- | ITOF
- | NTOF
- | CEIL
- | FLOR
- | TRNF
- | RNDF
- | TRNC
- | NOTB
- | SIZT
- | USNC
- | UCNS
- | ITOT
- | NTOT
- | FTOT
- | TTOI
- | TTON
- | TTOF
- | PAKT
- | UPKT
- | VWLS
- | VWRS
- | SIZS
- | PAKB
- | UPKB
- | SIZB
- | FLTB
- | MISS
- | CACH
- | LKUP
- | LOAD
- | CVLD
- | VALU
- | TLTT
- | DBTX
- | SDBL
- | REFN
- | REFR
- | RRFC
- | TIKR
data Prim2
- = ADDI
- | ADDN
- | SUBI
- | SUBN
- | MULI
- | MULN
- | DIVI
- | DIVN
- | MODI
- | MODN
- | SHLI
- | SHLN
- | SHRI
- | SHRN
- | POWI
- | POWN
- | EQLI
- | EQLN
- | NEQI
- | NEQN
- | LEQI
- | LEQN
- | LESI
- | LESN
- | ANDN
- | ANDI
- | IORN
- | IORI
- | XORN
- | XORI
- | EQLF
- | NEQF
- | LEQF
- | LESF
- | ADDF
- | SUBF
- | MULF
- | DIVF
- | ATN2
- | POWF
- | LOGB
- | MAXF
- | MINF
- | CAST
- | DRPN
- | ANDB
- | IORB
- | EQLU
- | CMPU
- | LEQU
- | LESU
- | DRPT
- | CATT
- | TAKT
- | IXOT
- | EQLT
- | LEQT
- | LEST
- | DRPS
- | CATS
- | TAKS
- | CONS
- | SNOC
- | IDXS
- | SPLL
- | SPLR
- | TAKB
- | DRPB
- | IDXB
- | CATB
- | IXOB
- | THRO
- | TRCE
- | SDBX
- | SDBV
- | REFW
data GBranch comb
- = Test1 !Word64 !(GSection comb) !(GSection comb)
- | Test2 !Word64 !(GSection comb) !Word64 !(GSection comb) !(GSection comb)
- | TestW !(GSection comb) !(EnumMap Word64 (GSection comb))
- | TestT !(GSection comb) !(Map Text (GSection comb))
type Branch = GBranch CombIx
type RBranch val = GBranch (RComb val)
emitCombs :: Var v => RefNums -> Reference -> Word64 -> SuperGroup v -> EnumMap Word64 Comb
emitComb :: Var v => RefNums -> Reference -> Word64 -> RCtx v -> (Word64, SuperNormal v) -> EnumMap Word64 Comb
resolveCombs :: Maybe (EnumMap Word64 (RCombs val)) -> EnumMap Word64 (GCombs val CombIx) -> EnumMap Word64 (RCombs val)
sanitizeCombsOfForeignFuncs :: Bool -> Set ForeignFunc -> EnumMap Word64 (EnumMap Word64 (GComb Void CombIx)) -> EnumMap Word64 (EnumMap Word64 (GComb Void CombIx))
absurdCombs :: EnumMap Word64 (EnumMap Word64 (GComb Void cix)) -> EnumMap Word64 (GCombs any cix)
emptyRNs :: RefNums
argsToLists :: Args -> [Int]
countArgs :: Args -> Int
combRef :: CombIx -> Reference
combDeps :: GComb val comb -> [Word64]
combTypes :: GComb any comb -> [Word64]
prettyCombs :: Word64 -> EnumMap Word64 Comb -> ShowS
prettyComb :: (Show val, Show comb) => Word64 -> Word64 -> GComb val comb -> ShowS

Documentation

data Args' Source #

Constructors

Arg1 !Int
Arg2 !Int !Int
ArgN !(PrimArray Int)
ArgR !Int !Int

Instances

Instances details

Show Args' Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> Args' -> ShowS # show :: Args' -> String # showList :: [Args'] -> ShowS #

data Args Source #

Constructors

ZArgs
VArg1 !Int
VArg2 !Int !Int
VArgR !Int !Int
VArgN !(PrimArray Int)
VArgV !Int

Instances

Instances details

Show Args Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> Args -> ShowS # show :: Args -> String # showList :: [Args] -> ShowS #
Eq Args Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: Args -> Args -> Bool # (/=) :: Args -> Args -> Bool #
Ord Args Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: Args -> Args -> Ordering # (<) :: Args -> Args -> Bool # (<=) :: Args -> Args -> Bool # (>) :: Args -> Args -> Bool # (>=) :: Args -> Args -> Bool # max :: Args -> Args -> Args # min :: Args -> Args -> Args #

data RefNums Source #

Constructors

RN
Fields dnum :: Reference -> Word64 cnum :: Reference -> Word64 anum :: Reference -> Maybe Int

data MLit Source #

Constructors

MI !Int
MN !Word64
MC !Char
MD !Double
MT !Text
MM !Referent
MY !Reference

Instances

Instances details

Show MLit Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> MLit -> ShowS # show :: MLit -> String # showList :: [MLit] -> ShowS #
Eq MLit Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: MLit -> MLit -> Bool # (/=) :: MLit -> MLit -> Bool #
Ord MLit Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: MLit -> MLit -> Ordering # (<) :: MLit -> MLit -> Bool # (<=) :: MLit -> MLit -> Bool # (>) :: MLit -> MLit -> Bool # (>=) :: MLit -> MLit -> Bool # max :: MLit -> MLit -> MLit # min :: MLit -> MLit -> MLit #

data GInstr comb Source #

Constructors

Prim1 !Prim1 !Int
Prim2 !Prim2 !Int !Int
RefCAS !Int !Int !Int
ForeignCall !Bool !ForeignFunc !Args
SetDyn !Word64 !Int
Capture !Word64
Name !(GRef comb) !Args
Info !String
Pack !Reference !PackedTag !Args
Lit !MLit
Print !Int
Reset !(EnumSet Word64)
Fork !Int
Atomically !Int
Seq !Args
TryForce !Int
SandboxingFailure !Text

Instances

Instances details

Foldable GInstr Source #
Instance details Defined in Unison.Runtime.MCode Methods fold :: Monoid m => GInstr m -> m # foldMap :: Monoid m => (a -> m) -> GInstr a -> m # foldMap' :: Monoid m => (a -> m) -> GInstr a -> m # foldr :: (a -> b -> b) -> b -> GInstr a -> b # foldr' :: (a -> b -> b) -> b -> GInstr a -> b # foldl :: (b -> a -> b) -> b -> GInstr a -> b # foldl' :: (b -> a -> b) -> b -> GInstr a -> b # foldr1 :: (a -> a -> a) -> GInstr a -> a # foldl1 :: (a -> a -> a) -> GInstr a -> a # toList :: GInstr a -> [a] # null :: GInstr a -> Bool # length :: GInstr a -> Int # elem :: Eq a => a -> GInstr a -> Bool # maximum :: Ord a => GInstr a -> a # minimum :: Ord a => GInstr a -> a # sum :: Num a => GInstr a -> a # product :: Num a => GInstr a -> a #
Traversable GInstr Source #
Instance details Defined in Unison.Runtime.MCode Methods traverse :: Applicative f => (a -> f b) -> GInstr a -> f (GInstr b) # sequenceA :: Applicative f => GInstr (f a) -> f (GInstr a) # mapM :: Monad m => (a -> m b) -> GInstr a -> m (GInstr b) # sequence :: Monad m => GInstr (m a) -> m (GInstr a) #
Functor GInstr Source #
Instance details Defined in Unison.Runtime.MCode Methods fmap :: (a -> b) -> GInstr a -> GInstr b # (<$) :: a -> GInstr b -> GInstr a #
Show comb => Show (GInstr comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> GInstr comb -> ShowS # show :: GInstr comb -> String # showList :: [GInstr comb] -> ShowS #
Eq (GInstr comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: GInstr comb -> GInstr comb -> Bool # (/=) :: GInstr comb -> GInstr comb -> Bool #
Ord (GInstr comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: GInstr comb -> GInstr comb -> Ordering # (<) :: GInstr comb -> GInstr comb -> Bool # (<=) :: GInstr comb -> GInstr comb -> Bool # (>) :: GInstr comb -> GInstr comb -> Bool # (>=) :: GInstr comb -> GInstr comb -> Bool # max :: GInstr comb -> GInstr comb -> GInstr comb # min :: GInstr comb -> GInstr comb -> GInstr comb #

type Instr = GInstr CombIx Source #

type RInstr val = GInstr (RComb val) Source #

data GSection comb Source #

Constructors

App !Bool !(GRef comb) !Args
Call !Bool !CombIx comb !Args
Jump !Int !Args
Match !Int !(GBranch comb)
Yield !Args
Ins !(GInstr comb) !(GSection comb)
Let !(GSection comb) !CombIx !Int !(GSection comb)
Die String
Exit
DMatch !(Maybe Reference) !Int !(GBranch comb)
NMatch !(Maybe Reference) !Int !(GBranch comb)
RMatch !Int !(GSection comb) !(EnumMap Word64 (GBranch comb))

Bundled Patterns

pattern MatchT :: Int -> GSection comb -> Map Text (GSection comb) -> GSection comb
pattern MatchW :: Int -> GSection comb -> EnumMap Word64 (GSection comb) -> GSection comb

Instances

Instances details

Foldable GSection Source #
Instance details Defined in Unison.Runtime.MCode Methods fold :: Monoid m => GSection m -> m # foldMap :: Monoid m => (a -> m) -> GSection a -> m # foldMap' :: Monoid m => (a -> m) -> GSection a -> m # foldr :: (a -> b -> b) -> b -> GSection a -> b # foldr' :: (a -> b -> b) -> b -> GSection a -> b # foldl :: (b -> a -> b) -> b -> GSection a -> b # foldl' :: (b -> a -> b) -> b -> GSection a -> b # foldr1 :: (a -> a -> a) -> GSection a -> a # foldl1 :: (a -> a -> a) -> GSection a -> a # toList :: GSection a -> [a] # null :: GSection a -> Bool # length :: GSection a -> Int # elem :: Eq a => a -> GSection a -> Bool # maximum :: Ord a => GSection a -> a # minimum :: Ord a => GSection a -> a # sum :: Num a => GSection a -> a # product :: Num a => GSection a -> a #
Traversable GSection Source #
Instance details Defined in Unison.Runtime.MCode Methods traverse :: Applicative f => (a -> f b) -> GSection a -> f (GSection b) # sequenceA :: Applicative f => GSection (f a) -> f (GSection a) # mapM :: Monad m => (a -> m b) -> GSection a -> m (GSection b) # sequence :: Monad m => GSection (m a) -> m (GSection a) #
Functor GSection Source #
Instance details Defined in Unison.Runtime.MCode Methods fmap :: (a -> b) -> GSection a -> GSection b # (<$) :: a -> GSection b -> GSection a #
Show comb => Show (GSection comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> GSection comb -> ShowS # show :: GSection comb -> String # showList :: [GSection comb] -> ShowS #
Eq comb => Eq (GSection comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: GSection comb -> GSection comb -> Bool # (/=) :: GSection comb -> GSection comb -> Bool #
Ord comb => Ord (GSection comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: GSection comb -> GSection comb -> Ordering # (<) :: GSection comb -> GSection comb -> Bool # (<=) :: GSection comb -> GSection comb -> Bool # (>) :: GSection comb -> GSection comb -> Bool # (>=) :: GSection comb -> GSection comb -> Bool # max :: GSection comb -> GSection comb -> GSection comb # min :: GSection comb -> GSection comb -> GSection comb #

type RSection val = GSection (RComb val) Source #

type Section = GSection CombIx Source #

data GComb val comb Source #

Constructors

Comb !(GCombInfo comb)
CachedVal !Word64 !val

Bundled Patterns

pattern Lam :: Int -> Int -> GSection comb -> GComb val comb

Instances

Instances details

Bifoldable GComb Source #
Instance details Defined in Unison.Runtime.MCode Methods bifold :: Monoid m => GComb m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> GComb a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> GComb a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> GComb a b -> c #
Bifunctor GComb Source #
Instance details Defined in Unison.Runtime.MCode Methods bimap :: (a -> b) -> (c -> d) -> GComb a c -> GComb b d # first :: (a -> b) -> GComb a c -> GComb b c # second :: (b -> c) -> GComb a b -> GComb a c #
Bitraversable GComb Source #
Instance details Defined in Unison.Runtime.MCode Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> GComb a b -> f (GComb c d) #
Foldable (GComb val) Source #
Instance details Defined in Unison.Runtime.MCode Methods fold :: Monoid m => GComb val m -> m # foldMap :: Monoid m => (a -> m) -> GComb val a -> m # foldMap' :: Monoid m => (a -> m) -> GComb val a -> m # foldr :: (a -> b -> b) -> b -> GComb val a -> b # foldr' :: (a -> b -> b) -> b -> GComb val a -> b # foldl :: (b -> a -> b) -> b -> GComb val a -> b # foldl' :: (b -> a -> b) -> b -> GComb val a -> b # foldr1 :: (a -> a -> a) -> GComb val a -> a # foldl1 :: (a -> a -> a) -> GComb val a -> a # toList :: GComb val a -> [a] # null :: GComb val a -> Bool # length :: GComb val a -> Int # elem :: Eq a => a -> GComb val a -> Bool # maximum :: Ord a => GComb val a -> a # minimum :: Ord a => GComb val a -> a # sum :: Num a => GComb val a -> a # product :: Num a => GComb val a -> a #
Traversable (GComb val) Source #
Instance details Defined in Unison.Runtime.MCode Methods traverse :: Applicative f => (a -> f b) -> GComb val a -> f (GComb val b) # sequenceA :: Applicative f => GComb val (f a) -> f (GComb val a) # mapM :: Monad m => (a -> m b) -> GComb val a -> m (GComb val b) # sequence :: Monad m => GComb val (m a) -> m (GComb val a) #
Functor (GComb val) Source #
Instance details Defined in Unison.Runtime.MCode Methods fmap :: (a -> b) -> GComb val a -> GComb val b # (<$) :: a -> GComb val b -> GComb val a #
(Show comb, Show val) => Show (GComb val comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> GComb val comb -> ShowS # show :: GComb val comb -> String # showList :: [GComb val comb] -> ShowS #
(Eq comb, Eq val) => Eq (GComb val comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: GComb val comb -> GComb val comb -> Bool # (/=) :: GComb val comb -> GComb val comb -> Bool #
(Ord comb, Ord val) => Ord (GComb val comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: GComb val comb -> GComb val comb -> Ordering # (<) :: GComb val comb -> GComb val comb -> Bool # (<=) :: GComb val comb -> GComb val comb -> Bool # (>) :: GComb val comb -> GComb val comb -> Bool # (>=) :: GComb val comb -> GComb val comb -> Bool # max :: GComb val comb -> GComb val comb -> GComb val comb # min :: GComb val comb -> GComb val comb -> GComb val comb #

data GCombInfo comb Source #

Constructors

LamI !Int !Int !(GSection comb)

Instances

Instances details

Foldable GCombInfo Source #
Instance details Defined in Unison.Runtime.MCode Methods fold :: Monoid m => GCombInfo m -> m # foldMap :: Monoid m => (a -> m) -> GCombInfo a -> m # foldMap' :: Monoid m => (a -> m) -> GCombInfo a -> m # foldr :: (a -> b -> b) -> b -> GCombInfo a -> b # foldr' :: (a -> b -> b) -> b -> GCombInfo a -> b # foldl :: (b -> a -> b) -> b -> GCombInfo a -> b # foldl' :: (b -> a -> b) -> b -> GCombInfo a -> b # foldr1 :: (a -> a -> a) -> GCombInfo a -> a # foldl1 :: (a -> a -> a) -> GCombInfo a -> a # toList :: GCombInfo a -> [a] # null :: GCombInfo a -> Bool # length :: GCombInfo a -> Int # elem :: Eq a => a -> GCombInfo a -> Bool # maximum :: Ord a => GCombInfo a -> a # minimum :: Ord a => GCombInfo a -> a # sum :: Num a => GCombInfo a -> a # product :: Num a => GCombInfo a -> a #
Traversable GCombInfo Source #
Instance details Defined in Unison.Runtime.MCode Methods traverse :: Applicative f => (a -> f b) -> GCombInfo a -> f (GCombInfo b) # sequenceA :: Applicative f => GCombInfo (f a) -> f (GCombInfo a) # mapM :: Monad m => (a -> m b) -> GCombInfo a -> m (GCombInfo b) # sequence :: Monad m => GCombInfo (m a) -> m (GCombInfo a) #
Functor GCombInfo Source #
Instance details Defined in Unison.Runtime.MCode Methods fmap :: (a -> b) -> GCombInfo a -> GCombInfo b # (<$) :: a -> GCombInfo b -> GCombInfo a #
Show comb => Show (GCombInfo comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> GCombInfo comb -> ShowS # show :: GCombInfo comb -> String # showList :: [GCombInfo comb] -> ShowS #
Eq comb => Eq (GCombInfo comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: GCombInfo comb -> GCombInfo comb -> Bool # (/=) :: GCombInfo comb -> GCombInfo comb -> Bool #
Ord comb => Ord (GCombInfo comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: GCombInfo comb -> GCombInfo comb -> Ordering # (<) :: GCombInfo comb -> GCombInfo comb -> Bool # (<=) :: GCombInfo comb -> GCombInfo comb -> Bool # (>) :: GCombInfo comb -> GCombInfo comb -> Bool # (>=) :: GCombInfo comb -> GCombInfo comb -> Bool # max :: GCombInfo comb -> GCombInfo comb -> GCombInfo comb # min :: GCombInfo comb -> GCombInfo comb -> GCombInfo comb #

type Comb = GComb Void CombIx Source #

newtype RComb val Source #

The fixed point of a GComb where all references to a Comb are themselves Combs.

Constructors

RComb
Fields unRComb :: GComb val (RComb val)

Instances

Instances details

Show (RComb val) Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> RComb val -> ShowS # show :: RComb val -> String # showList :: [RComb val] -> ShowS #

type RCombInfo val = GCombInfo (RComb val) Source #

type GCombs val comb = EnumMap Word64 (GComb val comb) Source #

Map of combinators, parameterized by comb reference type

type RCombs val = GCombs val (RComb val) Source #

data CombIx Source #

Constructors

CIx !Reference !Word64 !Word64

Instances

Instances details

Show CombIx Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> CombIx -> ShowS # show :: CombIx -> String # showList :: [CombIx] -> ShowS #
Eq CombIx Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: CombIx -> CombIx -> Bool # (/=) :: CombIx -> CombIx -> Bool #
Ord CombIx Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: CombIx -> CombIx -> Ordering # (<) :: CombIx -> CombIx -> Bool # (<=) :: CombIx -> CombIx -> Bool # (>) :: CombIx -> CombIx -> Bool # (>=) :: CombIx -> CombIx -> Bool # max :: CombIx -> CombIx -> CombIx # min :: CombIx -> CombIx -> CombIx #

data GRef comb Source #

Constructors

Stk !Int
Env !CombIx comb
Dyn !Word64

Instances

Instances details

Foldable GRef Source #
Instance details Defined in Unison.Runtime.MCode Methods fold :: Monoid m => GRef m -> m # foldMap :: Monoid m => (a -> m) -> GRef a -> m # foldMap' :: Monoid m => (a -> m) -> GRef a -> m # foldr :: (a -> b -> b) -> b -> GRef a -> b # foldr' :: (a -> b -> b) -> b -> GRef a -> b # foldl :: (b -> a -> b) -> b -> GRef a -> b # foldl' :: (b -> a -> b) -> b -> GRef a -> b # foldr1 :: (a -> a -> a) -> GRef a -> a # foldl1 :: (a -> a -> a) -> GRef a -> a # toList :: GRef a -> [a] # null :: GRef a -> Bool # length :: GRef a -> Int # elem :: Eq a => a -> GRef a -> Bool # maximum :: Ord a => GRef a -> a # minimum :: Ord a => GRef a -> a # sum :: Num a => GRef a -> a # product :: Num a => GRef a -> a #
Traversable GRef Source #
Instance details Defined in Unison.Runtime.MCode Methods traverse :: Applicative f => (a -> f b) -> GRef a -> f (GRef b) # sequenceA :: Applicative f => GRef (f a) -> f (GRef a) # mapM :: Monad m => (a -> m b) -> GRef a -> m (GRef b) # sequence :: Monad m => GRef (m a) -> m (GRef a) #
Functor GRef Source #
Instance details Defined in Unison.Runtime.MCode Methods fmap :: (a -> b) -> GRef a -> GRef b # (<$) :: a -> GRef b -> GRef a #
Show comb => Show (GRef comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> GRef comb -> ShowS # show :: GRef comb -> String # showList :: [GRef comb] -> ShowS #
Eq (GRef comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: GRef comb -> GRef comb -> Bool # (/=) :: GRef comb -> GRef comb -> Bool #
Ord (GRef comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: GRef comb -> GRef comb -> Ordering # (<) :: GRef comb -> GRef comb -> Bool # (<=) :: GRef comb -> GRef comb -> Bool # (>) :: GRef comb -> GRef comb -> Bool # (>=) :: GRef comb -> GRef comb -> Bool # max :: GRef comb -> GRef comb -> GRef comb # min :: GRef comb -> GRef comb -> GRef comb #

type RRef val = GRef (RComb val) Source #

type Ref = GRef CombIx Source #

A reference to a combinator, parameterized by comb

data Prim1 Source #

Constructors

DECI
DECN
INCI
INCN
NEGI
SGNI
LZRO
TZRO
COMN
COMI
POPC
ABSF
EXPF
LOGF
SQRT
COSF
ACOS
COSH
ACSH
SINF
ASIN
SINH
ASNH
TANF
ATAN
TANH
ATNH
ITOF
NTOF
CEIL
FLOR
TRNF
RNDF
TRNC
NOTB
SIZT
USNC
UCNS
ITOT
NTOT
FTOT
TTOI
TTON
TTOF
PAKT
UPKT
VWLS
VWRS
SIZS
PAKB
UPKB
SIZB
FLTB
MISS
CACH
LKUP
LOAD
CVLD
VALU
TLTT
DBTX
SDBL
REFN
REFR
RRFC
TIKR

Instances

Instances details

Bounded Prim1 Source #
Instance details Defined in Unison.Runtime.MCode Methods minBound :: Prim1 # maxBound :: Prim1 #
Enum Prim1 Source #
Instance details Defined in Unison.Runtime.MCode Methods succ :: Prim1 -> Prim1 # pred :: Prim1 -> Prim1 # toEnum :: Int -> Prim1 # fromEnum :: Prim1 -> Int # enumFrom :: Prim1 -> [Prim1] # enumFromThen :: Prim1 -> Prim1 -> [Prim1] # enumFromTo :: Prim1 -> Prim1 -> [Prim1] # enumFromThenTo :: Prim1 -> Prim1 -> Prim1 -> [Prim1] #
Show Prim1 Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> Prim1 -> ShowS # show :: Prim1 -> String # showList :: [Prim1] -> ShowS #
Eq Prim1 Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: Prim1 -> Prim1 -> Bool # (/=) :: Prim1 -> Prim1 -> Bool #
Ord Prim1 Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: Prim1 -> Prim1 -> Ordering # (<) :: Prim1 -> Prim1 -> Bool # (<=) :: Prim1 -> Prim1 -> Bool # (>) :: Prim1 -> Prim1 -> Bool # (>=) :: Prim1 -> Prim1 -> Bool # max :: Prim1 -> Prim1 -> Prim1 # min :: Prim1 -> Prim1 -> Prim1 #
Tag Prim1 Source #
Instance details Defined in Unison.Runtime.Serialize Methods tag2word :: Prim1 -> Word8 Source # word2tag :: MonadGet m => Word8 -> m Prim1 Source #

data Prim2 Source #

Constructors

ADDI
ADDN
SUBI
SUBN
MULI
MULN
DIVI
DIVN
MODI
MODN
SHLI
SHLN
SHRI
SHRN
POWI
POWN
EQLI
EQLN
NEQI
NEQN
LEQI
LEQN
LESI
LESN
ANDN
ANDI
IORN
IORI
XORN
XORI
EQLF
NEQF
LEQF
LESF
ADDF
SUBF
MULF
DIVF
ATN2
POWF
LOGB
MAXF
MINF
CAST
DRPN
ANDB
IORB
EQLU
CMPU
LEQU
LESU
DRPT
CATT
TAKT
IXOT
EQLT
LEQT
LEST
DRPS
CATS
TAKS
CONS
SNOC
IDXS
SPLL
SPLR
TAKB
DRPB
IDXB
CATB
IXOB
THRO
TRCE
SDBX
SDBV
REFW

Instances

Instances details

Bounded Prim2 Source #
Instance details Defined in Unison.Runtime.MCode Methods minBound :: Prim2 # maxBound :: Prim2 #
Enum Prim2 Source #
Instance details Defined in Unison.Runtime.MCode Methods succ :: Prim2 -> Prim2 # pred :: Prim2 -> Prim2 # toEnum :: Int -> Prim2 # fromEnum :: Prim2 -> Int # enumFrom :: Prim2 -> [Prim2] # enumFromThen :: Prim2 -> Prim2 -> [Prim2] # enumFromTo :: Prim2 -> Prim2 -> [Prim2] # enumFromThenTo :: Prim2 -> Prim2 -> Prim2 -> [Prim2] #
Show Prim2 Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> Prim2 -> ShowS # show :: Prim2 -> String # showList :: [Prim2] -> ShowS #
Eq Prim2 Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: Prim2 -> Prim2 -> Bool # (/=) :: Prim2 -> Prim2 -> Bool #
Ord Prim2 Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: Prim2 -> Prim2 -> Ordering # (<) :: Prim2 -> Prim2 -> Bool # (<=) :: Prim2 -> Prim2 -> Bool # (>) :: Prim2 -> Prim2 -> Bool # (>=) :: Prim2 -> Prim2 -> Bool # max :: Prim2 -> Prim2 -> Prim2 # min :: Prim2 -> Prim2 -> Prim2 #
Tag Prim2 Source #
Instance details Defined in Unison.Runtime.Serialize Methods tag2word :: Prim2 -> Word8 Source # word2tag :: MonadGet m => Word8 -> m Prim2 Source #

data GBranch comb Source #

Constructors

Test1 !Word64 !(GSection comb) !(GSection comb)
Test2 !Word64 !(GSection comb) !Word64 !(GSection comb) !(GSection comb)
TestW !(GSection comb) !(EnumMap Word64 (GSection comb))
TestT !(GSection comb) !(Map Text (GSection comb))

Instances

Instances details

Foldable GBranch Source #
Instance details Defined in Unison.Runtime.MCode Methods fold :: Monoid m => GBranch m -> m # foldMap :: Monoid m => (a -> m) -> GBranch a -> m # foldMap' :: Monoid m => (a -> m) -> GBranch a -> m # foldr :: (a -> b -> b) -> b -> GBranch a -> b # foldr' :: (a -> b -> b) -> b -> GBranch a -> b # foldl :: (b -> a -> b) -> b -> GBranch a -> b # foldl' :: (b -> a -> b) -> b -> GBranch a -> b # foldr1 :: (a -> a -> a) -> GBranch a -> a # foldl1 :: (a -> a -> a) -> GBranch a -> a # toList :: GBranch a -> [a] # null :: GBranch a -> Bool # length :: GBranch a -> Int # elem :: Eq a => a -> GBranch a -> Bool # maximum :: Ord a => GBranch a -> a # minimum :: Ord a => GBranch a -> a # sum :: Num a => GBranch a -> a # product :: Num a => GBranch a -> a #
Traversable GBranch Source #
Instance details Defined in Unison.Runtime.MCode Methods traverse :: Applicative f => (a -> f b) -> GBranch a -> f (GBranch b) # sequenceA :: Applicative f => GBranch (f a) -> f (GBranch a) # mapM :: Monad m => (a -> m b) -> GBranch a -> m (GBranch b) # sequence :: Monad m => GBranch (m a) -> m (GBranch a) #
Functor GBranch Source #
Instance details Defined in Unison.Runtime.MCode Methods fmap :: (a -> b) -> GBranch a -> GBranch b # (<$) :: a -> GBranch b -> GBranch a #
Show comb => Show (GBranch comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods showsPrec :: Int -> GBranch comb -> ShowS # show :: GBranch comb -> String # showList :: [GBranch comb] -> ShowS #
Eq comb => Eq (GBranch comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods (==) :: GBranch comb -> GBranch comb -> Bool # (/=) :: GBranch comb -> GBranch comb -> Bool #
Ord comb => Ord (GBranch comb) Source #
Instance details Defined in Unison.Runtime.MCode Methods compare :: GBranch comb -> GBranch comb -> Ordering # (<) :: GBranch comb -> GBranch comb -> Bool # (<=) :: GBranch comb -> GBranch comb -> Bool # (>) :: GBranch comb -> GBranch comb -> Bool # (>=) :: GBranch comb -> GBranch comb -> Bool # max :: GBranch comb -> GBranch comb -> GBranch comb # min :: GBranch comb -> GBranch comb -> GBranch comb #

type Branch = GBranch CombIx Source #

type RBranch val = GBranch (RComb val) Source #

emitCombs :: Var v => RefNums -> Reference -> Word64 -> SuperGroup v -> EnumMap Word64 Comb Source #

emitComb :: Var v => RefNums -> Reference -> Word64 -> RCtx v -> (Word64, SuperNormal v) -> EnumMap Word64 Comb Source #

resolveCombs :: Maybe (EnumMap Word64 (RCombs val)) -> EnumMap Word64 (GCombs val CombIx) -> EnumMap Word64 (RCombs val) Source #

lazily replace all references to combinators with the combinators themselves, tying the knot recursively when necessary.

sanitizeCombsOfForeignFuncs :: Bool -> Set ForeignFunc -> EnumMap Word64 (EnumMap Word64 (GComb Void CombIx)) -> EnumMap Word64 (EnumMap Word64 (GComb Void CombIx)) Source #

If running in a sandboxed environment, replace all restricted foreign functions with an error.

absurdCombs :: EnumMap Word64 (EnumMap Word64 (GComb Void cix)) -> EnumMap Word64 (GCombs any cix) Source #

emptyRNs :: RefNums Source #

argsToLists :: Args -> [Int] Source #

countArgs :: Args -> Int Source #

combRef :: CombIx -> Reference Source #

combDeps :: GComb val comb -> [Word64] Source #

combTypes :: GComb any comb -> [Word64] Source #

prettyCombs :: Word64 -> EnumMap Word64 Comb -> ShowS Source #

prettyComb :: (Show val, Show comb) => Word64 -> Word64 -> GComb val comb -> ShowS Source #