ghc-bignum-1.3: GHC BigNum library
Safe HaskellSafe-Inferred
LanguageHaskell2010

GHC.Num.Backend.Native

Synopsis

Documentation

backendName :: [Char] Source #

ghc-bignum backend name

bignat_add Source #

Arguments

:: MutableWordArray# s

Result

-> WordArray# 
-> WordArray# 
-> State# s 
-> State# s 

bignat_quotrem_normalized :: MutableWordArray# s -> MutableWordArray# s -> WordArray# -> State# s -> State# s Source #

Perform quotRem on normalized inputs: * highest bit of B is set * A is trimmed * A >= B * B > 1

bignat_quotrem_word Source #

Arguments

:: MutableWordArray# s

Quotient

-> WordArray# 
-> Word# 
-> State# s 
-> (# State# s, Word# #) 

bignat_quot_word Source #

Arguments

:: MutableWordArray# s

Quotient

-> WordArray# 
-> Word# 
-> State# s 
-> State# s 

bignat_gcd_word_word :: Word# -> Word# -> Word# Source #

This operation doesn't really belongs here, but GMP's one is much faster than this simple implementation (basic Euclid algorithm).

Ideally we should make an implementation as fast as GMP's one and put it into GHC.Num.Primitives.