** Calls 'luaF_close' in protected mode. Return the original status ** or, in case of errors, the new status. */

** Call the C function 'func' in protected mode, restoring basic ** thread information ('allowhook', etc.) and in particular ** its stack level in cas

** Prepares the call to a function (C or Lua). For C functions, also do ** the call. The function to be called is at '*func'. The arguments ** are on

** If stack size is more than 3 times the current use, reduce that size ** to twice the current use. (So, the final stack size is at most 2/3 the ** p

** Close all upvalues up to the given stack level. */

** Insert a variable in the list of to-be-closed variables. */

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

** Emit a "load constant" instruction, using either 'OP_LOADK' ** (if constant index 'k' fits in 18 bits) or an 'OP_LOADKX' ** instruction with "extra

** Emit code to go through if 'e' is true, jump otherwise. */

** Check whether expression 'e' is a literal integer. */

** Emit a SETLIST instruction. ** 'base' is register that keeps table; ** 'nelems' is #table plus those to be stored now; ** 'tostore' is number of va

** The use of 'lua_pushfstring' ensures this function does not ** need reserved stack space when called. */

** Calls an order tag method. ** For lessequal, LUA_COMPAT_LT_LE keeps compatibility with old ** behavior: if there is no '__le', try '__lt', based on

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

** Returns the main position of an element given as a 'TValue' */

** Mark black 'OLD1' objects when starting a new young collection. ** Gray objects are already in some gray list, and so will be visited ** in the ato

** Mark block where variable at given level was defined ** (to emit close instructions later). */

** When creating file handles, always creates a 'closed' file handle ** before opening the actual file; so, if there is a memory error, the ** handle

** Pack integer 'n' with 'size' bytes and 'islittle' endianness. ** The final 'if' handles the case when 'size' is larger than ** the size of a Lua in

** Traverse a list of tests, patching their destination address and ** registers: tests producing values jump to 'vtarget' (and put their ** values in

* Push a value equals rapidjson.null on to the stack. */

** Read a sequence of (hex)digits */

** Signal an error in the call to 'lua_resume', not in the execution ** of the coroutine itself. (Such errors should not be handled by any ** coroutin

** Reverse the stack segment from 'from' to 'to' ** (auxiliary to 'lua_rotate') ** Note that we move(copy) only the value inside the stack. ** (We do

rotate left 'x' by 'n' bits */

** Set debt for the next minor collection, which will happen when ** memory grows 'genminormul'%. */

** Use 'sigaction' when available. */

** read a sequence '[=*[' or ']=*]', leaving the last bracket. If ** sequence is well formed, return its number of '='s + 2; otherwise, ** return 1 if

-------------------------------------------------------------------------*\ * Creates and sets up a socket \*-----------------------------------------

-------------------------------------------------------------------------*\ * Sendto with timeout \*--------------------------------------------------

-------------------------------------------------------------------------*\ * Put socket into non-blocking mode \*------------------------------------

** Sweep a list of objects to enter generational mode. Deletes dead ** objects and turns the non dead to old. All non-dead threads---which ** are now

=========================================================================*\ * Library functions \*====================================================

-------------------------------------------------------------------------*\ * Determines how much time we have left for the next system call, * if the

-------------------------------------------------------------------------*\ * Gets timeout values for IO operations * Lua Output: block, total \*-----

=========================================================================*\ * Library functions \*====================================================

** Decode one UTF-8 sequence, returning NULL if byte sequence is ** invalid. The array 'limits' stores the minimum value for each ** sequence length,

** Traverse a list making all its elements white and clearing their ** age. In incremental mode, all objects are 'new' all the time, ** except for fix

* Add an element to the array * * @param Item - the element * @return - the index of the added element */

* Adds a blank, constructed pair to the map. The map needs rehashing to make it valid. * * @return - the index of the first pair added.

* Call the UFunction */

* @see FProperty::DestroyValue_InContainer(...) */

Check whether the array is empty.