** Ensures expression value is in any register. */

** Ensures expression value is in register 'reg' (and therefore ** 'e' will become a non-relocatable expression). */

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

** Enter first sweep phase. ** The call to 'sweeplist' tries to make pointer point to an object ** inside the list (instead of to the header), so that

** get field and width arguments for field-manipulation functions, ** checking whether they are valid. ** ('luaL_error' called without 'return' to avo

** check whether new label 'lb' matches any pending gotos in current ** block; solves forward jumps */

** try to close a goto with existing labels; this solves backward jumps */

** Completes the execution of an interrupted C function, calling its ** continuation function. */

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

** Free registers used by expressions 'e1' and 'e2' (if any) in proper ** order. */

* Normalize a transition hook's argument length. The hook may be: * - a merged hook (invoker) with the original in .fns * - a wrapped component meth

* Normalize a transition hook's argument length. The hook may be: * - a merged hook (invoker) with the original in .fns * - a wrapped component meth

** "Generic" get version. (Not that generic: not valid for integers, ** which may be in array part, nor for floats with integral values.) */

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

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

** find a "name" for the RK value 'c' */

** Compare two strings 'ls' x 'rs', returning an integer smaller-equal- ** -larger than zero if 'ls' is smaller-equal-larger than 'rs'. ** The code is