** Enter generational mode. Must go until the end of an atomic cycle ** to ensure that all threads and weak tables are in the gray lists. ** Then, tur

** Completes the execution of an interrupted C function, calling its ** continuation function. */

Try to code a binary operator negating its second operand. ** For the metamethod, 2nd operand must keep its original value. */

** Finish a young-generation collection. */

** Continuation function for 'pcall' and 'xpcall'. Both functions ** already pushed a 'true' before doing the call, so in case of success ** 'finishpc

** First allocation will fail whenever not building initial state ** and not shrinking a block. (This fail will trigger 'tryagain' and ** a full GC cy

** Check whether 'i' can be stored in an 'sBx' operand. */

Return state with length and distance decoding tables and index sizes set to fixed code decoding. Normally this returns fixed tables from inffixed

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

** Generate code for a 'for' loop. */

** Free two registers in proper order */

** Does a full collection in generational mode. */

A wrapper around fwrite that throws on error.

=========================================================================== * Generate the codes for a given tree and bit counts (which need not be

Returns the argument at specified index. */

Because formatting using c++ streams is stateful, drop down to C is required Alternatively we could use stringstream, but its performance is... not go

IContext

Returns a cached power of 10 `c_k = c_k.f * pow(2, c_k.e)` such that its (binary) exponent satisfies `min_exponent <= c_k.e <= min_exponent + 28`.

========================================================================= * This function can be used by asm versions of crc32() */

** get information about the i-th capture. If there are no captures ** and 'i==0', return information about the whole match, which ** is the range 's'

Given the divisor (normally a power of 10), the remainder = v % divisor for some number v and the error, returns whether v should be rounded up, down,

** Gets an optional ending string position from argument 'arg', ** with default value 'def'. ** Negative means back from end: clip result to [0, len]

** Read and classify next option. 'size' is filled with option's size. */

Load up input buffer and set eof flag if last data loaded -- return -1 on error, 0 otherwise. Note that the eof flag is set when the end of the in

Decompress from input to the provided next_out and avail_out in the state. On return, state->x.have and state->x.next point to the just decompresse

Look for gzip header, set up for inflate or copy. state->x.have must be 0. If this is the first time in, allocate required memory. state->how wil

Reset gzip file state */

-- see zlib.h -- */

the following were split out into separate functions while optimizing; they could be pushed back up but eh. __forceinline showed no change; they're pr