** Add the replacement value to the string buffer 'b'. ** Return true if the original string was changed. (Function calls and ** table indexing result

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

** Quicksort algorithm (recursive function) */

** Add a false to list of constants and return its index. */

** Add a true to list of constants and return its index. */

** Break statement. Semantically equivalent to "goto break". */

** Call closing method for object 'obj' with error message 'err'. The ** boolean 'yy' controls whether the call is yieldable. ** (This function assume

** Check whether new instruction 'newpc' is in a different line from ** previous instruction 'oldpc'. More often than not, 'newpc' is only ** one or a

** 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 whether object at given level has a close metamethod and raise ** an error if not. */

** Check whether there is already a label with the given 'name'. */

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

** Code bitwise operations; they are all commutative, so the function ** tries to put an integer constant as the 2nd operand (a K operand). */

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

** Code commutative operators ('+', '*'). If first operand is a ** numeric constant, change order of operands to try to use an ** immediate or K opera

** Create code for '(e1 .. e2)'. ** For '(e1 .. e2.1 .. e2.2)' (which is '(e1 .. (e2.1 .. e2.2))', ** because concatenation is right associative), mer

** Emit code for equality comparisons ('==', '~='). ** 'e1' was already put as RK by 'luaK_infix'. */

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

** Emit code for order comparisons. When using an immediate operand, ** 'isfloat' tells whether the original value was a float. */

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

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

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

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