** Check that next token is 'c' and skip it. */

** Ensures final expression result is in next available register. */

** Return the "variable description" (Vardesc) of a given variable. ** (Unless noted otherwise, all variables are referred to by their ** compiler ind

** Returns the real size of the 'array' array */

** 'luaL_addvalue' is the only function in the Buffer system where the ** box (if existent) is not on the top of the stack. So, instead of ** calling

** try to convert a float to an integer, rounding according to 'mode'. */

** Return the number of variables in the register stack for the given ** function. */

** Pushes on the stack a string with given length. Avoid using 's' when ** 'len' == 0 (as 's' can be NULL in that case), due to later use of ** 'memcm

** Free register used by expression 'e' (if any) */

** Ensure that expression 'e' is not a variable (nor a <const>). ** (Expression still may have jump lists.) */

** Reserve 'n' registers in register stack */

** Ensures the stack has at least 'space' extra slots, raising an error ** if it cannot fulfill the request. (The error handling needs a few ** extra

** Check that next token is 'what' and skip it. In case of error, ** raise an error that the expected 'what' should match a 'who' ** in line 'where' (

** Create a jump instruction and return its position, so its destination ** can be fixed later (with 'fixjump'). */

** returns a pointer to a free area with at least 'sz' bytes */

** Create or reuse a zero-terminated string, first checking in the ** cache (using the string address as a key). The cache can contain ** only zero-te

** Garbage-collection function */

** Start the scope for the last 'nvars' created variables. */

** create a new collectable object (with given type and size) and link ** it to 'allgc' list. */

** Search function for integers. If integer is inside 'alimit', get it ** directly from the array part. Otherwise, if 'alimit' is not equal to ** the

** Change line information associated with current position, by removing ** previous info and adding it again with new line. */

** new string (with explicit length) */

** Finish the table access 'val = t[key]'. ** if 'slot' is NULL, 't' is not a table; otherwise, 'slot' points to ** t[k] entry (which must be empty).

** About the overflow check: an overflow cannot occur when time ** is represented by a lua_Integer, because either lua_Integer is ** large enough to r

** Add constant 'v' to prototype's list of constants (field 'k'). ** Use scanner's table to cache position of constants in constant list ** and try to

** Free register 'reg', if it is neither a constant index nor ** a local variable. ) */