Lines Matching defs:HashNode

55   FreeList *node_memory;    /* HashNode free-list */
63 typedef struct HashNode HashNode;
64 struct HashNode {
66   HashNode *next;      /* The next hash-table entry in a bucket list */
74   HashNode *head;   /* The head of the bucket hash-node list */
93 static HashNode *_del_HashNode(HashTable *hash, HashNode *node);
94 static HashNode *_new_HashNode(HashTable *hash, const char *name, int code,
96 static HashNode *_find_HashNode(HashTable *hash, HashBucket *bucket,
97 				const char *name, HashNode **prev);
137   mem->node_memory = _new_FreeList(sizeof(HashNode), node_count);
337  *  return  HashNode *  The new entry, or NULL if there was insufficient
344   HashNode *node;      /* The new node */
393  *  return  HashNode *  The deleted hash node (always NULL).
399     HashNode *prev;   /* The node preceding the located node */
400     HashNode *node = _find_HashNode(hash, bucket, name, &prev);
439   HashNode *node;      /* The hash-table node of the requested symbol */
476  *  return    HashNode *  The new node, or NULL on error.
478 static HashNode *_new_HashNode(HashTable *hash, const char *name, int code,
481   HashNode *node;  /* The new node */
486   node = (HashNode *) _new_FreeListNode(hash->mem->node_memory);
531  *  node    HashNode *  The node to be deleted.
533  *  return  HashNode *  The deleted node (always NULL).
535 static HashNode *_del_HashNode(HashTable *hash, HashNode *node)
551     node = (HashNode *) _del_FreeListNode(hash->mem->node_memory, node);
592  *  prev      HashNode ** If prev!=NULL then the pointer to the node
597  * return     HashNode *  The located hash-table node, or NULL if not
600 static HashNode *_find_HashNode(HashTable *hash, HashBucket *bucket,
601 			       const char *name, HashNode **prev)
603   HashNode *last;  /* The previously searched node */
604   HashNode *node;  /* The node that is being searched */
691     HashNode *node = bucket->head;
693       HashNode *next = node->next;
734     HashNode *node;