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

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

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

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

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

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

** performs a basic GC step */

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

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

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

** Calls 'luaF_close' in protected mode. Return the original status ** or, in case of errors, the new status. */

** Calls 'luaF_close' in protected mode. Return the original status ** or, in case of errors, the new status. */

** Call the C function 'func' in protected mode, restoring basic ** thread information ('allowhook', etc.) and in particular ** its stack level in cas

** Call the C function 'func' in protected mode, restoring basic ** thread information ('allowhook', etc.) and in particular ** its stack level in cas

** If stack size is more than 3 times the current use, reduce that size ** to twice the current use. (So, the final stack size is at most 2/3 the ** p

** If stack size is more than 3 times the current use, reduce that size ** to twice the current use. (So, the final stack size is at most 2/3 the ** p

** Close all upvalues up to the given stack level. */

** Close all upvalues up to the given stack level. */

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

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

** Insert a variable in the list of to-be-closed variables. */

** Insert a variable in the list of to-be-closed variables. */

** main search function */

** main search function */

** main search function */

** search function for short strings */

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

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

** beware: when using this function you probably need to check a GC ** barrier and invalidate the TM cache. */

** Check register-stack level, keeping track of its maximum size ** in field 'maxstacksize' */

** Emit instruction 'i', checking for array sizes and saving also its ** line information. Return 'i' position. */

** Format and emit an 'iABx' instruction. */

** 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 a "load constant" instruction, using either 'OP_LOADK' ** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' ** instruction with "extra

** Try to make 'e' a K expression with an index in the range of R/K ** indices. Return true iff succeeded. */

** Ensures final expression result is either in a register, ** in an upvalue, or it is the vararg parameter. */

** Ensures final expression result is either in a register ** or in an upvalue. */

** Ensures final expression result is either in a register or it is ** a constant. */

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

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

** Create expression 't[k]'. 't' must have its final result already in a ** register or upvalue. */

** Add an integer to list of constants and return its index. ** Integers use userdata as keys to avoid collision with floats with ** same value; conve

** Path all jumps in 'list' to jump to 'target'. ** (The assert means that we cannot fix a jump to a forward address ** because we only know addresses

** Path all jumps in 'list' to jump to 'target'. ** (The assert means that we cannot fix a jump to a forward address ** because we only know addresses

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

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

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

** Generate code to store result of expression 'ex' into variable 'var'. */

** ensure that stack[idx][fname] has a table and push that table ** into the stack */