** compiles the main function, which is a regular vararg function with an ** upvalue named LUA_ENV */

** Convert a string mask (for 'sethook') into a bit mask */

** Adjust pending gotos to outer level of a block. */

** Given 'nres' results at 'firstResult', move 'wanted' of them to 'res'. ** Handle most typical cases (zero results for commands, one result for ** e

** Read multiple lines until a complete Lua statement */

** Compute new size for buffer 'B', enough to accommodate extra 'sz' ** bytes. */

** Create a new upvalue at the given level, and link it to the list of ** open upvalues of 'L' after entry 'prev'. **/

** Add nil to list of constants and return its index. */

** return registry.LUA_NOENV as a boolean */

check whether pattern has no special characters */

** Count keys in array part of table 't': Fill 'nums[i]' with ** number of keys that will go into corresponding slice and return ** total number of no

** Does the partition: Pivot P is at the top of the stack. ** precondition: a[lo] <= P == a[up-1] <= a[up], ** so it only needs to do the partition fr

** Remove firt element from the tbclist plus its dummy nodes. */

** Unrolls a coroutine in protected mode while there are recoverable ** errors, that is, errors inside a protected call. (Any error ** interrupts 'unr

** Prepare and call a closing method. ** If status is CLOSEKTOP, the call to the closing method will be pushed ** at the top of the stack. Otherwise,

** Project the random integer 'ran' into the interval [0, n]. ** Because 'ran' has 2^B possible values, the projection can only be ** uniform when the

** Push on the stack the contents of table 'arg' from 1 to #arg */

** create a new Lua closure, push it in the stack, and initialize ** its upvalues. */

** Given a path such as ";blabla.so;blublu.so", pushes the string ** ** no file 'blabla.so' ** no file 'blublu.so' */

-------------------------------------------------------------------------*\ * Deal with the final characters \*---------------------------------------

** Serialize a floating-point number in such a way that it can be ** scanned back by Lua. Use hexadecimal format for "common" numbers ** (to preserve

** Read a number: first reads a valid prefix of a numeral into a buffer. ** Then it calls 'lua_stringtonumber' to check whether the format is ** corre

-------------------------------------------------------------------------*\ * Reads everything until the connection is closed (buffered) \*-----------

-------------------------------------------------------------------------*\ * Reads a line terminated by a CR LF pair or just by a LF. The CR and LF *

-------------------------------------------------------------------------*\ * Reads a fixed number of bytes (buffered) \*-----------------------------

** Avoid these stat codes from being collected, to avoid possible ** memory error when pushing them. */

** Register a new local variable in the active 'Proto' (for debug ** information). */

** nums[i] = number of keys 'k' where 2^(i - 1) < k <= 2^i */

** (Re)insert all elements from the hash part of 'ot' into table 't'. */

** For each non-marked thread, simulates a barrier between each open ** upvalue and its value. (If the thread is collected, the value will be ** assig

** Remove the last instruction created, correcting line information ** accordingly. */

** Close the scope for all variables up to level 'tolevel'. ** (debug info.) */

** mark root set and reset all gray lists, to start a new collection */

** Parse and compile a multiple assignment. The first "variable" ** (a 'suffixedexp') was already read by the caller. ** ** assignment -> suffixedexp

** Find a "name" for a 'C' value in an RK instruction. */

for offsets larger than 32, rotate right by 64 - offset */

** Call a few finalizers */