** advances the garbage collector until it reaches a state allowed ** by 'statemask' */

** Similar to 'luaD_call', but does not allow yields during the call. */

** Finishes a function call: calls hook if necessary, moves current ** number of results to proper place, and returns to previous call ** info. If fun

** Close all upvalues and to-be-closed variables up to the given stack ** level. */

** Get the line corresponding to instruction 'pc' in function 'f'; ** first gets a base line and from there does the increments until ** the desired i

** returns current 'pc' and marks it as a jump target (to avoid wrong ** optimizations with consecutive instructions not in the same basic block). */

** set functions from list 'l' into table at top - 'nup'; each ** function gets the 'nup' elements at the top as upvalues. ** Returns with only the ta

** Finish a table assignment 't[key] = val'. ** If 'slot' is NULL, 't' is not a table. Otherwise, 'slot' points ** to the entry 't[key]', or to a val

** Let x = AB, where A is a prefix of length 'n'. Then, ** rotate x n == BA. But BA == (A^r . B^r)^r. */

** Convert 'nvar', a compiler index level, to its corresponding ** register. For that, search for the highest variable below that level ** that is in

** If expression is a numeric constant, fills 'v' with its value ** and returns 1. Otherwise, returns 0. */

** Add 'str' to the buffer. If string is larger than the buffer space, ** push the string directly to the stack. */

** Check whether a conversion specification is valid. When called, ** first character in 'form' must be '%' and last character must ** be a valid conv

** Copy 'size' bytes from 'src' to 'dest', correcting endianness if ** given 'islittle' is different from native endianness. */

** Auxiliary function used by several library functions: check for ** an optional thread as function's first argument and set 'arg' with ** 1 if this

** External interface for 'ccall' */

** set GCdebt to a new value keeping the value (totalbytes + GCdebt) ** invariant (and avoiding underflows in 'totalbytes') */

** Emit instruction 'i', checking for array sizes and saving also its ** line information. Return 'i' position. */

** Concatenate jump-list 'l2' into jump-list 'l1' */

semantic error */

** The previously freed references form a linked list: ** t[freelist] is the index of a first free index, or zero if list is ** empty; t[t[freelist]]

** try to convert a value to an integer, rounding according to 'mode', ** without string coercion. ** ("Fast track" handled by macro 'tointegerns'.) *

** Create a new local variable with the given 'name'. Return its index ** in the function. */

** Accept current char if it is in 'set' (of size 2) */

i1 ^= i2 */

** If L1 != L, L1 can be in any state, and therefore there are no ** guarantees about its stack space; any push in L1 must be ** checked. */

** Clear keys for empty entries in tables. If entry is empty, mark its ** entry as dead. This allows the collection of the key, but keeps its ** entry

** Emit code for binary expressions that "produce values" ** (everything but logical operators 'and'/'or' and comparison ** operators). ** Expression

** increment line number and skips newline sequence (any of ** \n, \r, \n\r, or \r\n) */

** Convert a valid actual index (not a pseudo-index) to its address. */

** tells whether a key or value can be cleared from a weak ** table. Non-collectable objects are never removed from weak ** tables. Strings behave as

** Call a hook for the given event. Make sure there is a hook to be ** called. (Both 'L->hook' and 'L->hookmask', which trigger this ** function, can

** Raise a type error with "standard" information about the faulty ** object 'o' (using 'varinfo'). */

** search function for short strings */

** Resize table 't' for the new given sizes. Both allocations (for ** the hash part and for the array part) can fail, which creates some ** subtleties

** Format and emit an 'iABC' instruction. (Assertions check consistency ** of parameters versus opcode.) */

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

** Ensures final expression result is in a valid R/K index ** (that is, it is either in a register or in 'k' with an index ** in the range of R/K indi

** ensure that stack[idx][fname] has a table and push that table ** into the stack */

** convert an acceptable stack index into an absolute index */