** Auxiliary function to create the iteration function for 'lines'. ** The iteration function is a closure over 'io_readline', with ** the following u

** Resumes a coroutine. Returns the number of results for non-error ** cases or -1 for errors. */

** t[k] = value at the top of the stack (where 'k' is a string) */

** get (if 'get' is true) or set an upvalue from a closure */

-------------------------------------------------------------------------*\ * Acumulates bytes in input buffer until 4 bytes are available. * Translat

-------------------------------------------------------------------------*\ * Acumulates bytes in input buffer until 3 bytes are available. * Translat

** call all pending finalizers */

** If possible, shrink string table. */

** Check whether message is a control message. If so, execute the ** control or ignore it if unknown. */

** Check that 'arg' either is a table or can behave like one (that is, ** has a metatable with the required metamethods) */

** clear entries with unmarked keys from all weaktables in list 'l' */

** Code arithmetic operators ('+', '-', ...). If second operand is a ** constant in the proper range, use variant opcodes with K operands. */

** Emit an "extra argument" instruction (format 'iAx') */

** Emit code for order comparisons. When using an immediate operand, ** 'isfloat' tells whether the original value was a float. */

** Get the constant value from a constant expression */

** Try to "constant-fold" an operation; return 1 iff successful. ** (In this case, 'e1' has the final result.) */

** Traverse all ephemeron tables propagating marks from keys to values. ** Repeat until it converges, that is, nothing new is marked. 'dir' ** inverts

copy strings in stack from top - n up to top - 1 to buffer */

** Create a new label with the given 'name' at the given 'line'. ** 'last' tells whether label is the last non-op statement in its ** block. Solves al

** creates a new string object */

** Read an integer numeral from string 'fmt' or return 'df' if ** there is no numeral */

** Ensure expression value is in a register, making 'e' a ** non-relocatable expression. ** (Expression still may have jump lists.) */

** Ensure expression value is in register 'reg', making 'e' a ** non-relocatable expression. ** (Expression still may have jump lists.) */

** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and ** print any results. */

** Enter generational mode. Must go until the end of an atomic cycle ** to ensure that all objects are correctly marked and weak tables ** are cleared

** Search for an active label with the given name. */

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. ** (This fail will trigger 'tryagain' and a full GC cycle at every ** allocation.)

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

** 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. */

** Try to find a name for a function based on the code that called it. ** (Only works when function was called by a Lua function.) ** Returns what the

** 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'

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

=========================================================================*\ * Internal functions \*===================================================

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

=========================================================================*\ * Global Lua functions \*=================================================

=========================================================================*\ * Lua methods \*==========================================================

-------------------------------------------------------------------------*\ * Retrieves socket local name \*------------------------------------------

=========================================================================*\ * Internal functions \*===================================================

** Check whether expression 'e' is a small literal string */

** Check whether real size of the array is a power of 2. ** (If it is not, 'alimit' cannot be changed to any other value ** without changing the real

** Emit instruction to jump if 'e' is 'cond' (that is, if 'cond' ** is true, code will jump if 'e' is true.) Return jump position. ** Optimize when 'e

** Convert string 's' to a Lua number (put in 'result'). Return NULL on ** fail or the address of the ending '\0' on success. ('mode' == 'x') ** means

** Compare two strings 'ls' x 'rs', returning an integer less-equal- ** -greater than zero if 'ls' is less-equal-greater than 'rs'. ** The code is a l

** Try to convert a value from string to a number value. ** If the value is not a string or is a string not representing ** a valid numeral (or if coe