** mark metamethods for basic types */

** Mark 'OLD1' objects when starting a new young collection. ** Gray objects are already in some gray list, and so will be visited ** in the atomic st

** check whether list has any jump that do not produce a value ** or produce an inverted value */

** Negate condition 'e' (where 'e' is a comparison). */

** Adds a new label/goto in the corresponding list. */

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

** Add current char to buffer (if not out of space) and read next one */

** Patch destination register for a TESTSET instruction. ** If instruction in position 'node' is not a TESTSET, return 0 ("fails"). ** Otherwise, if '

=========================================================================== * Restore the heap property by moving down the tree starting at node k,

** preinitialize a thread with consistent values without allocating ** any memory (to avoid errors) */

@OPTIMIZE: primary accumulator for huffman expand the buffer to as many bits as possible without reading off end of packet it might be nice to allow f

** Return the previous instruction of the current code. If there ** may be a jump target between the current instruction and the ** previous one, retu

** traverse one gray object, turning it to black (except for threads, ** which are always gray). */

** Push the i-th capture on the stack. */

** Search for a name for a function in all loaded modules */

** Prompt the user, read a line, and push it into the Lua stack. */

** Push given string to the stack, as part of the buffer. If the stack ** is almost full, join all partial strings in the stack into one. */

** Set a "random" seed. To get some randomness, use the current time ** and the address of 'L' (in case the machine does address space layout ** rando

returns a reverse iterator to the beginning

LUA_NUMBER */ ** This function is quite liberal in what it accepts, as 'luaO_str2num' ** will reject ill-formed numerals. Roughly, it accepts the foll

** Remove line information from the last instruction. ** If line information for that instruction is absolute, set 'iwthabs' ** above its max to force

** Traverse a list of tests ensuring no one produces a value */

Report the error condition

** Find a "name" for the register 'c'. */

** Save line info for a new instruction. If difference from last line ** does not fit in a byte, of after that many instructions, save a new ** absolu

=========================================================================== * Scan a literal or distance tree to determine the frequencies of the cod