** Add integer part of 'x' to buffer and return new 'x' */

========================================================================= */

Allocates memory via a fd on shmem/ahmem or even a file on disk

approximate the triangle area

** returns the index for 'key' if 'key' is an appropriate key to live in ** the array part of the table, 0 otherwise. */

** t[k] = value at the top of the stack (where 'k' is a string) */

** get (if 'get' is true) or set an upvalue from a closure */

=========================================================================== * Flush the bit buffer, keeping at most 7 bits in it. */

=========================================================================== * Reverse the first len bits of a code, using straightforward code (a fas

=========================================================================== * Flush the bit buffer and align the output on a byte boundary */

** Add a boolean to list of constants and return its index. */

find 3d bounding box for triangle

@@@@@@ OPT: use bswap/intrinsics

** Check that 'arg' either is a table or can behave like one (that is, ** has a metatable with the required metamethods) */

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

** Emit code for binary expressions that "produce values" ** (everything but logical operators 'and'/'or' and comparison ** operators). ** Expression

** Emit an "extra argument" instruction (format 'iAx') */

=========================================================================== */

=========================================================================== * Send the block data compressed using the given Huffman trees */

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

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

** Copy 'size' bytes from 'src' to 'dest', correcting endianness if ** given 'islittle' is different from native endianness. */

========================================================================= */

** creates a new string object */