Divides this bignum by divisor, assigning the remainder to this and returning the quotient.

Z = X + Y mod BPO */

Return Y = D mod BPO where D is 512-bit message digest (i.e SHA512 digest) */

Convert little-endian word array to little-endian byte array */

Computes Y = b*X */

** Ensures final expression result (including results from its jump ** lists) is in register 'reg'. ** If expression has jumps, need to patch these ju

** Fix jump instruction at position 'pc' to jump to 'dest'. ** (Jump addresses are relative in Lua) */

Pop first block from a free list

compute 64-bit a*b

** Read, classify, and fill other details about the next option. ** 'psize' is filled with option's size, 'notoalign' with its ** alignment requiremen