** Return 'l <= r', for numbers. */

** Return 'l < r', for numbers. */

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

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

-------------------------------------------------------------------------*\ * Make sure argument is a boolean \*--------------------------------------

-------------------------------------------------------------------------*\ * Get a userdata pointer if object belongs to a given class. Return NULL

-------------------------------------------------------------------------*\ * Get a userdata pointer if object belongs to a given group. Return NULL

** QuickSort algorithm (recursive function) */

-------------------------------------------------------------------------*\ * Encodes the Base64 last 1 or 2 bytes and adds padding '=' * Result, if

-------------------------------------------------------------------------*\ * Fill base64 decode map. \*---------------------------------------------

-------------------------------------------------------------------------*\ * Setup basic stuff. \*---------------------------------------------------

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

copy code from buffer.cpp in luasocket

** call all pending finalizers */

** If possible, 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] */

** Ensures the 'buff' string uses a dot as the radix character. */

check for repeated labels on the same block */

** Choose an element in the middle (2nd-3th quarters) of [lo,up] ** "randomized" by 'rnd' */

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

** Emit code for comparisons. ** 'e1' was already put in R/K form by 'luaK_infix'. */

** Code 'not e', doing constant folding. */

** Emit code for unary expressions that "produce values" ** (everything but 'not'). ** Expression to produce final result will be encoded in 'e'. */

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

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

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

** Ensure all pending jumps to current position are fixed (jumping ** to current position with no values) and reset list of pending ** jumps */