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

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

Default constructor creates a null value.

* Get a script container at the given stack index */

Const member iterator ! \pre IsObject() == true */

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

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

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

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

=========================================================================*\ * Exported functions. \*==================================================

* Get value of the i'th element * * @param Index - the index * @param OutItem - the element in the 'Index' */

* Get the address of userdata, fast path */

Initialize this value as constant string, without calling destructor.

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

** This function can be called during a signal, under "reasonable" ** assumptions. ** Fields 'basehookcount' and 'hookcount' (set by 'resethookcount')

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

* Append another array * * @param SourceArray - the array to be appended */

-------------------------------------------------------------------------*\ * Initializes C structure \*----------------------------------------------

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

-------------------------------------------------------------------------*\ * Initializes C structure \*----------------------------------------------

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

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

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

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

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