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

** Free registers used by expressions 'e1' and 'e2' (if any) in proper ** order. */

** Get a space of size 'sz' in the buffer. If buffer has not enough ** space, empty it. 'sz' must fit in an empty buffer. */

** Read, classify, and fill other details about the next option. ** 'psize' is filled with option's size, 'notoalign' with its ** alignment requiremen

** "Generic" get version. (Not that generic: not valid for integers, ** which may be in array part, nor for floats with integral values.) */

** Returns the position of the instruction "controlling" a given ** jump (that is, its condition), or the jump itself if it is ** unconditional. */

========================================================================= */

** Check whether table being indexed by instruction 'i' is the ** environment '_ENV' */

Fetch data and put it in the output buffer. Assumes state->x.have is 0. Data is either copied from the input file or decompressed from the input

Use read() to load a buffer -- return -1 on error, otherwise 0. Read from state->fd, and update state->eof, state->err, and state->msg as appropri

Read len bytes into buf from file, or less than len up to the end of the input. Return the number of bytes read. If zero is returned, either the

Skip len uncompressed bytes of output. Return -1 on error, 0 on success. */

* Initialize the encryption keys and the random header according to * the given password. */

** Initialize Header */

** Check whether expression 'e' is a literal integer in ** proper range to fit in register sC */

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

** Prints an error message, adding the program name in front of it ** (if present) */

** Look for a C function named 'sym' in a dynamically loaded library ** 'path'. ** First, check whether the library is already loaded; if not, try **

** Change collector mode to 'newmode'. */

** Performs a full GC cycle; if 'isemergency', set a flag to avoid ** some operations which could change the interpreter state in some ** unexpected w

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

** Create a to-be-closed upvalue. If there is a memory error ** when creating the upvalue, the closing method must be called here, ** as there is no u

** main search function */

** inserts a new key into a hash table; first, check whether key's main ** position is free. If not, check whether colliding node is in its main ** po

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

** Emit code to go through if 'e' is true, jump otherwise. */

** Check whether expression 'e' is a literal integer. */

** Emit a SETLIST instruction. ** 'base' is register that keeps table; ** 'nelems' is #table plus those to be stored now; ** 'tostore' is number of va

** The use of 'lua_pushfstring' ensures this function does not ** need reserved stack space when called. */

** Computes ceil(log2(x)) */

** Calls an order tag method. ** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old ** behavior: if there is no '__le', try '__lt', based on

** creates a new string and anchors it in scanner's table so that ** it will not be collected until the end of the compilation ** (by that time it sho