X mod BPO */

Courtesy of DJB */ Return out = 1/z mod P */

Computes Z = Y + b*X and return carry */

Assumptions: pre-computed q Cost: 8M + 6add Return: P = P + Q */

-- FOLDING --------------------------------------------------------------- // // The performance boost is achieved by a process that I call it FOLD

slow emulation routine for 32-bit

** Read an integer numeral and raises an error if it is larger ** than the maximum size for integers. */

** advances the garbage collector until it reaches a state allowed ** by 'statemask' */

** Finishes a function call: calls hook if necessary, removes CallInfo, ** moves current number of results to proper place; returns 0 iff call ** want

** Prepares a function call: checks the stack, creates a new CallInfo ** entry, fills in the relevant information, calls hook if needed. ** If functio

** Look for n-th local variable at line 'line' in function 'func'. ** Returns NULL if not found. */

** Emit a "load constant" instruction, using either 'OP_LOADK' ** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' ** instruction with "extra

** Path all jumps in 'list' to close upvalues up to given 'level' ** (The assertion checks that jumps either were closing nothing ** or were closing h

** Stripped-down 'require': After checking "loaded" table, calls 'openf' ** to open a module, registers the result in 'package.loaded' table and, ** i