** Try to "constant-fold" an operation; return 1 iff successful. ** (In this case, 'e1' has the final result.) */

** Traverse all ephemeron tables propagating marks from keys to values. ** Repeat until it converges, that is, nothing new is marked. 'dir' ** inverts

copy strings in stack from top - n up to top - 1 to buffer */

** Create a new label with the given 'name' at the given 'line'. ** 'last' tells whether label is the last non-op statement in its ** block. Solves al

** creates a new string object */

** Delete all objects in list 'p' until (but not including) object ** 'limit'. */

** Read an integer numeral from string 'fmt' or return 'df' if ** there is no numeral */

** Ensure expression value is in a register, making 'e' a ** non-relocatable expression. ** (Expression still may have jump lists.) */

** Ensure expression value is in register 'reg', making 'e' a ** non-relocatable expression. ** (Expression still may have jump lists.) */

** Do the REPL: repeatedly read (load) a line, evaluate (call) it, and ** print any results. */

** Enter generational mode. Must go until the end of an atomic cycle ** to ensure that all objects are correctly marked and weak tables ** are cleared

** Search for an active label with the given name. */

Try to code a binary operator negating its second operand. ** For the metamethod, 2nd operand must keep its original value. */

** Finish a young-generation collection. */

** Continuation function for 'pcall' and 'xpcall'. Both functions ** already pushed a 'true' before doing the call, so in case of success ** 'finishpc

** First allocation will fail whenever not building initial state. ** (This fail will trigger 'tryagain' and a full GC cycle at every ** allocation.)

** Check whether 'i' can be stored in an 'sBx' operand. */

** Fix for instruction at position 'pc' to jump to 'dest'. ** (Jump addresses are relative in Lua). 'back' true means ** a back jump. */

** Generate code for a 'for' loop. */

** Free two registers in proper order */

** Does a full collection in generational mode. */

** Try to find a name for a function based on how it was called. */

** get information about the i-th capture. If there are no captures ** and 'i==0', return information about the whole match, which ** is the range 's'

** Gets an optional ending string position from argument 'arg', ** with default value 'def'. ** Negative means back from end: clip result to [0, len]

** Read and classify next option. 'size' is filled with option's size. */

** Hash for integers. To allow a good hash, use the remainder operator ** ('%'). If integer fits as a non-negative int, compute an int ** remainder, w

** Check whether expression 'e' is a small literal string */

** Check whether real size of the array is a power of 2. ** (If it is not, 'alimit' cannot be changed to any other value ** without changing the real

** Emit instruction to jump if 'e' is 'cond' (that is, if 'cond' ** is true, code will jump if 'e' is true.) Return jump position. ** Optimize when 'e