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

** Get the constant value from a constant expression */

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

On Windows the count argument to read and write is unsigned, so convert it from size_t preventing integer overflow.

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

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

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

must push at least 1 object on the stack

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

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

** Ensures expression value is in any register. ** (Expression still may have jump lists.) */

** Ensures expression value is in register 'reg' (and therefore ** 'e' will become a non-relocatable expression). ** (Expression still may have jump l

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

Reads and decodes the residual for the sub-frame the decoder is currently sitting on. This function should be called when the decoder is sitting at th

Reads and seeks past the residual for the sub-frame the decoder is currently sitting on. This function should be called when the decoder is sitting at