* Returns the number of program segments in this elf file. */

Program Headers Access functions */

mod|reg|rm

** Ensures final expression result (including results from its jump ** lists) is in register 'reg'. ** If expression has jumps, need to patch these ju

** Fix jump instruction at position 'pc' to jump to 'dest'. ** (Jump addresses are relative in Lua) */

Obtain a "logical", i.e. relative to the directory entries beginning * (or extent), block from the CDROM. */

** Read, classify, and fill other details about the next option. ** 'psize' is filled with option's size, 'notoalign' with its ** alignment requiremen

** Returns the position of the instruction "controlling" a given ** jump (that is, its condition), or the jump itself if it is ** unconditional. */

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

** Initialize Header */

** Look for a C function named 'sym' in a dynamically loaded library ** 'path'. ** First, check whether the library is already loaded; if not, try **

** Performs a full GC cycle; if 'isemergency', set a flag to avoid ** some operations which could change the interpreter state in some ** unexpected w

** main search function */

** inserts a new key into a hash table; first, check whether key's main ** position is free. If not, check whether colliding node is in its main ** po

** Emit instruction 'i', checking for array sizes and saving also its ** line information. Return 'i' position. */

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

** Ensures final expression result is either in a register or it is ** a constant. */

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

** Create expression 't[k]'. 't' must have its final result already in a ** register or upvalue. */

** Add an integer to list of constants and return its index. ** Integers use userdata as keys to avoid collision with floats with ** same value; conve

** Path all jumps in 'list' to jump to 'target'. ** (The assert means that we cannot fix a jump to a forward address ** because we only know addresses

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

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