** Call a hook for the given event. Make sure there is a hook to be ** called. (Both 'L->hook' and 'L->hookmask', which trigger this ** function, can

** Call a hook for the given event. Make sure there is a hook to be ** called. (Both 'L->hook' and 'L->hookmask', which trigger this ** function, can

** Call a hook for the given event. Make sure there is a hook to be ** called. (Both 'L->hook' and 'L->hookmask', which triggers this ** function, can

** set GCdebt to a new value keeping the value (totalbytes + GCdebt) ** invariant */

** Raise a type error with "standard" information about the faulty ** object 'o' (using 'varinfo'). */

** Raise a type error with "standard" information about the faulty ** object 'o' (using 'varinfo'). */

** main search function */

** search function for short strings */

** search function for short strings */

** Resize table 't' for the new given sizes. Both allocations (for ** the hash part and for the array part) can fail, which creates some ** subtleties

** beware: when using this function you probably need to check a GC ** barrier and invalidate the TM cache. */

** Format and emit an 'iABC' instruction. (Assertions check consistency ** of parameters versus opcode.) */

** Format and emit an 'iABC' instruction. (Assertions check consistency ** of parameters versus opcode.) */

** Format and emit an 'iABx' instruction. */

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

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

** Generate code to store result of expression 'ex' into variable 'var'. */

** ensure that stack[idx][fname] has a table and push that table ** into the stack */

** ensure that stack[idx][fname] has a table and push that table ** into the stack */

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

** Computes ceil(log2(x)), which is the smallest integer n such that ** x <= (1 << n). */

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

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

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

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

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

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

build a new Rand64 value */

build a new Rand64 value */

! @brief public parser interface @param[in] strict whether to expect the last token to be EOF @param[in,out] result parsed JSON val

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

** translate a relative initial string position ** (negative means back from end): clip result to [1, inf). ** The length of any string in Lua must fi

** translate a relative initial string position ** (negative means back from end): clip result to [1, inf). ** The length of any string in Lua must fi

** If key is not marked, mark its entry as dead. This allows key to be ** collected, but keeps its entry in the table. A dead node is needed ** when

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

** Check whether 'status' is not OK and, if so, prints the error ** message on the top of the stack. */

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