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

** Convert a constant in 'v' into an expression description 'e' */

** Correct all gray lists, coalescing them into 'grayagain'. */

** Correct pointers to objects inside 'allgc' list when ** object 'o' is being removed from the list. */

** {================================================================== ** Stack reallocation ** ======================================================

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

** Calls 'require(name)' and stores the result in a global variable ** with the given name. */

-------------------------------------------------------------------------*\ * Takes one byte and stuff it if needed. \*-------------------------------

** Check whether key 'k1' is equal to the key in node 'n2'. This ** equality is raw, so there are no metamethods. Floats with integer ** values have b

** return the final target of a jump (skipping jumps to jumps) */

** Search for 'objidx' in table at index -1. ('objidx' must be an ** absolute index.) Return 1 + string at top if it found a good name. */

** returns the index of a 'key' for table traversals. First goes all ** elements in the array part, then elements in the hash part. The ** beginning o

** find last 'next' field in list 'p' list (to add elements in its end) */

** Try to find a suspended protected call (a "recover point") for the ** given thread. */

** Try to find last instruction before 'lastpc' that modified register 'reg'. */

** Completes the execution of a C function interrupted by an yield. ** The interruption must have happened while the function was either ** closing it

** Finish the job of 'lua_pcallk' after it was interrupted by an yield. ** (The caller, 'finishCcall', does the final call to 'adjustresults'.) ** The

** Execute a step of a float numerical for loop, returning ** true iff the loop must continue. (The integer case is ** written online with opcode OP_F

** Try to convert a 'for' limit to an integer, preserving the semantics ** of the loop. Return true if the loop must not run; otherwise, '*p' ** gets

** Prepare a numerical for loop (opcode OP_FORPREP). ** Return true to skip the loop. Otherwise, ** after preparation, stack will be as follows: **

** Perform a full collection in incremental mode. ** Before running the collection, check 'keepinvariant'; if it is true, ** there may be some objects

** Does a generational "step". ** Usually, this means doing a minor collection and setting the debt to ** make another collection when memory grows 'g

** Return the string to be used as a prompt by the interpreter. Leave ** the string (or nil, if using the default value) on the stack, to keep ** it a

** Get a "base line" to find the line corresponding to an instruction. ** Base lines are regularly placed at MAXIWTHABS intervals, so usually ** an in

** Get the next name in '*path' = 'name1;name2;name3;...', changing ** the ending ';' to '\0' to create a zero-terminated string. Return ** NULL when

** Checks whether value 'o' came from an upvalue. (That can only happen ** with instructions OP_GETTABUP/OP_SETTABUP, which operate directly on ** upv

** Try to find a boundary in the hash part of table 't'. From the ** caller, we know that 'j' is zero or present and that 'j + 1' is ** present. We wa

** Check whether 'status' signals a syntax error and the error ** message at the top of the stack ends with the above mark for ** incomplete statement

** Performs a basic incremental step. The debt and step size are ** converted from bytes to "units of work"; then the function loops ** running single

-------------------------------------------------------------------------*\ * Tries to accept a socket \*---------------------------------------------

-------------------------------------------------------------------------*\ * "Disconnects" a DGRAM socket \*-----------------------------------------

** Create registry table and its predefined values */

** Create an expression representing variable 'vidx' */

** Checks whether short string exists and reuses it or creates a new one. */

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

** Check whether pointer 'o' points to some value in the stack ** frame of the current function. Because 'o' may not point to a ** value in this stack

** Generates an error that a goto jumps into the scope of some ** local variable. */

Check whether 'mode' matches '[rwa]%+?[L_MODEEXT]*' */

** Prints (calling the Lua 'print' function) any values on the stack */

** Use 'time' and 'clock' as sources of "randomness". Because we don't ** know the types 'clock_t' and 'time_t', we cannot cast them to ** anything wi

** Convert string 's' to a Lua number (put in 'result') handling the ** current locale. ** This function accepts both the current locale or a dot as t

** return 'l <= r' for non-numbers. */

** return 'l < r' for non-numbers. */

** Load a non-nullable string into prototype 'p'. */