** Processes options 'e' and 'l', which involve running Lua code, and ** 'W', which also affects the state. ** Returns 0 if some code raises an error.

** Search the upvalues of the function 'fs' for one ** with the given 'name'. */

** Look for an active local variable with the name 'n' in the ** function 'fs'. If found, initialize 'var' with it and return ** its expression kind;

** Replace in the path (on the top of the stack) any occurrence ** of LUA_EXEC_DIR with the executable's path. */

** Register the random functions and initialize their state. */

** Set 'trap' for all active Lua frames. ** This function can be called during a signal, under "reasonable" ** assumptions. A new 'ci' is completely l

-------------------------------------------------------------------------*\ * Close module \*---------------------------------------------------------

-------------------------------------------------------------------------*\ * DNS helpers \*----------------------------------------------------------

-------------------------------------------------------------------------*\ * Initializes module \*---------------------------------------------------

-------------------------------------------------------------------------*\ * Select with timeout control \*------------------------------------------

-------------------------------------------------------------------------*\ * Put socket into blocking mode \*----------------------------------------

** Solves the goto at index 'g' to given 'label' and removes it ** from the list of pending goto's. ** If it jumps into the scope of some variable, ra

** Solves forward jumps. Check whether new label 'lb' matches any ** pending gotos in current block and solves them. Return true ** if any of the goto

** Does a major collection after last collection was a "bad collection". ** ** When the program is building a big structure, it allocates lots of ** m

** subexpr -> (simpleexp | unop subexpr) { binop subexpr } ** where 'binop' is any binary operator with a priority higher than 'limit' */

** Check GC invariants. For incremental mode, a black object cannot ** point to a white one. For generational mode, really old objects ** cannot point

return i * 5 */

return i * 9 */

** Traverse a Lua closure, marking its prototype and its upvalues. ** (Both can be NULL while closure is being created.) */

** Traverse a prototype. (While a prototype is being build, its ** arrays can be larger than needed; the extra slots are filled with ** NULL, so the u

** Traverse a thread, marking the elements in the stack up to its top ** and cleaning the rest of the stack in the final traversal. That ** ensures th

** Traverse a table with weak values and link it to proper list. During ** propagate phase, keep it in 'grayagain' list, to be revisited in the ** ato

** Get the next udata to be finalized from the 'tobefnz' list, and ** link it back into the 'allgc' list. */

** generates an error for an undefined 'goto'. */

-------------------------------------------------------------------------*\ * Binds an object to an address \*----------------------------------------

-------------------------------------------------------------------------*\ * Turns a master unixdgram object into a client object. \*----------------

-------------------------------------------------------------------------*\ * Binds an object to an address \*----------------------------------------

-------------------------------------------------------------------------*\ * Turns a master unixstream object into a client object. \*---------------

** Convert a bit mask (for 'gethook') into a string mask */

** Executes "full continuation" (everything in the stack) of a ** previously interrupted coroutine until the stack is empty (or another ** interruptio

-------------------------------------------------------------------------*\ * Protect factory \*------------------------------------------------------

** Return false if folding can raise an error. ** Bitwise operations need operands convertible to integers; division ** operations cannot have 0 as di

** Writes the message and handle 'tocont', finishing the message ** if needed and setting the next warn function. */

-------------------------------------------------------------------------*\ * Try factory \*----------------------------------------------------------

** Does a young collection. First, mark 'OLD1' objects. Then does the ** atomic step. Then, sweep all lists and advance pointers. Finally, ** finish t

Destructor.

Sets default values

Creates a new chunk. ! \param capacity Capacity of the chunk in bytes. \return true if success. */

* Adds a blank, constructed element to the set. The set needs rehashing to make it valid. * * @return - the index of the first element added

Return whether the added states is a match state

* Adds an uninitialized pair to the map. The map needs rehashing to make it valid. * * @return - the index of the added pair. */

* Adds an uninitialized element to the set. The set needs rehashing to make it valid. * * @return - the index of the added element. */

Constructor. ! \param is input stream to be wrapped. \param type UTF encoding type if it is not detected from the stream. */