** Main function for table assignment (invoking metamethods if needed). ** Compute 't[key] = val' */

translate a relative string position: negative means back from end */

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

** Similar to 'tonumber', but does not attempt to convert strings and ** ensure correct precision (no extra bits). Used in comparisons. */

** Use scanner's table to cache position of constants in constant list ** and try to reuse constants */

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

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

** main search function */

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

** returns the 'main' position of an element in a table (that is, the index ** of its hash value) */

** if key is not marked, mark its entry as dead (therefore removing it ** from the table) */

** Check whether 'status' is not OK and, if so, prints the error ** message on the top of the stack. It assumes that the error object ** is a string,

** Variations of 'lua_settable', used by 'db_getinfo' to put results ** from 'lua_getinfo' into result table. Key is always a string; ** value can be

from strlib */ translate a relative string position: negative means back from end */

* Pull off the four lowest bytes of a value and add them to my array, * without the help of the determinately sized C99 data types that * are not ye

** check whether current token is in the follow set of a block. ** 'until' closes syntactical blocks, but do not close scope, ** so it is handled in s

** clear entries with unmarked values from all weaktables in list 'l' up ** to element 'f' */

** Interface to 'lua_pcall', which sets appropriate message function ** and C-signal handler. Used to run all chunks. */

** Read an integer numeral and raises an error if it is larger ** than the maximum size for integers. */

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

** returns true if function has been executed (C function) */

** Look for n-th local variable at line 'line' in function 'func'. ** Returns NULL if not found. */

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

this function handles only '%d', '%c', '%f', '%p', and '%s' conventional formats, plus Lua-specific '%I' and '%U' */

** Convert a number object to a string */

** Main operation for concatenation: concat 'total' values in the stack, ** from 'L->top - total' up to 'L->top - 1'. */

** Shift left operation. (Shift right just negates 'y'.) */

** creates a new string and anchors it in scanner's table so that ** it will not be collected until the end of the compilation ** (by that time it sho

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

** Calls the 'close' function from a file handle. The 'volatile' avoids ** a bug in some versions of the Clang compiler (e.g., clang 3.0 for ** 32 bit

** change all characters 'from' in buffer to 'to' */

** Check whether current char is in set 'set' (with two chars) and ** saves it */

** Check whether a given upvalue from a given closure exists and ** returns its index */

** Code for binary and unary expressions that "produce values" ** (arithmetic operations, bitwise operations, concat, length). First ** try to do cons