Relocatable Object Module Format (OMF) Specification

Relocatable Object Module Format
Module table, indexed by module number, with N + 1 fixed-length entries:
WORD module page number
WORD offset from start of extended dictionary to list of required modules
Last entry is null.
Dictionary Hashing Algorithm
Pseudocode for creating a library and inserting names into a dictionary is listed below.
typedef unsigned short hash_value;
typedef struct {
hash_value block_x, block_d, bucket_x, bucket_d;
} hash;
typedef unsigned char block[512];
unsigned short nblocks = choose some prime number such that it is
likely that all the names will fit in those blocks (the value must be
greater than 1 and less than 255);
const int nbuckets = 37;
const int freespace = nbuckets+1;
MORE_BLOCKS: ;
// Allocate storage for the dictionary:
block *blocks = malloc(nblocks*sizeof(block));
// Zero out each block.
memset(blocks,0,nblocks*sizeof(block));
// Initialize freespace pointers.
for (int i = 0; i < nblocks; i++)
blocks[i][freespace] = freespace/2;
for N