HashNode
mem->node_memory = _new_FreeList(sizeof(HashNode), node_count);
HashNode *node; /* The new node */
HashNode *prev; /* The node preceding the located node */
HashNode *node = _find_HashNode(hash, bucket, name, &prev);
HashNode *node; /* The hash-table node of the requested symbol */
static HashNode *_new_HashNode(HashTable *hash, const char *name, int code,
HashNode *node; /* The new node */
node = (HashNode *) _new_FreeListNode(hash->mem->node_memory);
static HashNode *_del_HashNode(HashTable *hash, HashNode *node)
node = (HashNode *) _del_FreeListNode(hash->mem->node_memory, node);
static HashNode *_find_HashNode(HashTable *hash, HashBucket *bucket,
const char *name, HashNode **prev)
HashNode *last; /* The previously searched node */
HashNode *node; /* The node that is being searched */
typedef struct HashNode HashNode;
HashNode *next; /* The next hash-table entry in a bucket list */
HashNode *node = bucket->head;
HashNode *next = node->next;
HashNode *head; /* The head of the bucket hash-node list */
HashNode *node;
static HashNode *_del_HashNode(HashTable *hash, HashNode *node);
static HashNode *_new_HashNode(HashTable *hash, const char *name, int code,
static HashNode *_find_HashNode(HashTable *hash, HashBucket *bucket,
const char *name, HashNode **prev);