Moduleghc-internal-10.0.0Haskell2010

GHC.Internal.Bignum.Backend.Native

Synopsis

value backendName
value count_words_bits
value count_words_bits_int
value bignat_compare
value bignat_add
value bignat_add_word
value bignat_sub_word
value bignat_mul_word
value bignat_mul
value bignat_sub
value bignat_popcount
value bignat_shiftl
value bignat_shiftr
value bignat_shiftr_neg
value bignat_or
value bignat_xor
value bignat_and
value bignat_and_not
value bignat_quotrem
value bignat_quot
value bignat_rem
value bignat_quotrem_normalized
value bignat_quotrem_word
value bignat_quot_word
value bignat_rem_word
value bignat_gcd
value bignat_gcd_word
value bignat_gcd_word_word
value bignat_encode_double
value bignat_powmod_word
value bignat_powmod
value bignat_powmod_words
value integer_gcde
value integer_recip_mod
value integer_powmod

Packageghc-internal-10.0.0
Exports35
LanguageHaskell2010
LicenceBSD-3-Clause
SourceNative.hs

valuebackendName :: [Char]

Source#

ghc-bignum backend name

valuecount_words_bits :: Word# -> (# Word#, Word# #)

valuecount_words_bits_int :: Word# -> (# Int#, Int# #)

valuebignat_compare :: WordArray# -> WordArray# -> Int#

valuebignat_add

:: MutableWordArray# s
Result
-> WordArray#
-> WordArray#
-> State# s
-> State# s

valuebignat_add_word

valuebignat_sub_word

valuebignat_mul_word

valuebignat_mul

valuebignat_sub

valuebignat_popcount :: WordArray# -> Word#

valuebignat_shiftl

:: MutableWordArray# s
-> WordArray#
-> Word#
-> State# s
-> State# s

valuebignat_shiftr

:: MutableWordArray# s
-> WordArray#
-> Word#
-> State# s
-> State# s

valuebignat_shiftr_neg

:: MutableWordArray# s
-> WordArray#
-> Word#
-> State# s
-> State# s

valuebignat_or

valuebignat_xor

valuebignat_and

valuebignat_and_not

valuebignat_quotrem

valuebignat_quot

valuebignat_rem

valuebignat_quotrem_normalized

Source#

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

valuebignat_quotrem_word

:: MutableWordArray# s
Quotient
-> WordArray#
-> Word#
-> State# s
-> (# State# s, Word# #)

valuebignat_quot_word

:: MutableWordArray# s
Quotient
-> WordArray#
-> Word#
-> State# s
-> State# s

valuebignat_rem_word :: WordArray# -> Word# -> Word#

valuebignat_gcd

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

valuebignat_gcd_word :: WordArray# -> Word# -> Word#

valuebignat_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.Internal.Bignum.Primitives.

valuebignat_encode_double :: WordArray# -> Int# -> Double#

valuebignat_powmod_word :: WordArray# -> WordArray# -> Word# -> Word#

valuebignat_powmod

valuebignat_powmod_words :: Word# -> Word# -> Word# -> Word#

valueinteger_gcde :: Integer -> Integer -> (# Integer, Integer, Integer #)

valueinteger_recip_mod :: Integer -> Natural -> (# Natural | () #)

valueinteger_powmod :: Integer -> Natural -> Natural -> Natural