** If L1 != L, L1 can be in any state, and therefore there are no ** guarantees about its stack space; any push in L1 must be ** checked. */

** Code a "conditional jump", that is, a test or comparison opcode ** followed by a jump. Return jump position. */

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

** Gets the destination address of a jump instruction. Used to traverse ** a list of jumps. */

** increment line number and skips newline sequence (any of ** \n, \r, \n\r, or \r\n) */

** tells whether a key or value can be cleared from a weak ** table. Non-collectable objects are never removed from weak ** tables. Strings behave as

rbps stands for residual bits per sample * * (ln(2) * err) * rbps = log (-----------) * 2 ( n ) */

** Call a function (C or Lua). The function to be called is at *func. ** The arguments are on the stack, right after the function. ** When returns, al

** Similar to 'luaD_call', but does not allow yields during the call */

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

** search function for short strings */

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

* Calculates the size in bytes of all the nodes contained in the tree summed * up. And gets the amount of items in the tree as well. * * @param

This function frees the memory associated with a single info struct. * Normally, one would use either png_destroy_read_struct() or * png_destroy_wri

Turn on pixel packing */

Checks whether the supplied bytes match the PNG signature. We allow * checking less than the full 8-byte signature so that those apps that * alread

========================================================================= * Put a short in the pending buffer. The 16-bit value is put in MSB order.

bit 0 ~ 27 : interrupt source 27:0. 0 = lowest level, 27 = highest level.

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

* Private functions */

** Variations of 'lua_settable', used by 'db_getinfo' to put results ** from 'lua_getinfo' into result table. Key is always a string; ** value can be

Return current cycle count, in 32 bits (wraps after 21 dreamcast seconds) */