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

* Parse an individual command-line option. * \returns OKAY if successful. */

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

** Search for a name for a function in all loaded modules ** (registry._LOADED). */

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

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

** call a few (up to 'g->gcfinnum') finalizers */

** move all unreachable objects (or 'all' objects) that need ** finalization from list 'finobj' to list 'tobefnz' (to be finalized) */

** Set a reasonable "time" to wait before starting a new GC cycle; cycle ** will start when memory use hits threshold. (Division by 'estimate' ** shou

Find variable with given name 'n'. If it is an upvalue, add this upvalue into all intermediate functions. */

** reads the first character of file 'f' and skips an optional BOM mark ** in its beginning plus its first line if it starts with '#'. Returns ** true

skip no-op statements */

** sweep at most 'count' elements from a list of GCObjects erasing dead ** objects, where a dead object is one marked with the old (non current) ** wh

** sweep a list until a live object (or end of list) */

** try to convert a value to an integer, rounding according to 'mode': ** mode == 0: accepts only integral values ** mode == 1: takes the floor of the

** Traverse an ephemeron table and link it to proper list. Returns true ** iff any object was marked during this traversal (which implies that ** conv

** In function 'db_getinfo', the call to 'lua_getinfo' may push ** results on the stack; later it creates the result table to put ** these objects. Fu

** Unpack an integer with 'size' bytes and 'islittle' endianness. ** If size is smaller than the size of a Lua integer and integer ** is signed, must

** adds a new prototype into list of prototypes */

** Try to compile line on the stack as 'return <line>'; on return, stack ** has either compiled chunk or original line (if compilation failed). */

** registry.CLIBS[path] = plib -- for queries ** registry.CLIBS[#CLIBS + 1] = plib -- also keep a list of all libraries */

** create a label named 'break' to resolve break statements */

** call all pending finalizers */

** If possible, free concatenation buffer and shrink string table */

** check whether, in an assignment to an upvalue/local variable, the ** upvalue/local variable is begin used in a previous assignment to a ** table. I

** return registry.CLIBS[path] */

check for repeated labels on the same block */

** codes instruction to create new closure in parent function. ** The OP_CLOSURE instruction must use the last available register, ** so that, if it i

** Traverses all arguments from 'argv', returning a mask with those ** needed before running any Lua code (or an error code if it finds ** any invalid

** Compute the optimal size for the array part of table 't'. 'nums' is a ** "count array" where 'nums[i]' is the number of integers in the table ** be

** Try to "constant-fold" an operation; return 1 iff successful */

** Create the 'arg' table, which stores all arguments from the ** command line ('argv'). It should be aligned so that, at index 0, ** it has 'argv[scr

** create table CLIBS to keep track of loaded C libraries, ** setting a finalizer to close all libraries when closing state. */