48 	hashtab_ptr_t prev, cur, newnode;  in hashtab_insert()  local
64 	newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t));  in hashtab_insert()
65 	if (newnode == NULL)  in hashtab_insert()
67 	memset(newnode, 0, sizeof(struct hashtab_node));  in hashtab_insert()
68 	newnode->key = key;  in hashtab_insert()
69 	newnode->datum = datum;  in hashtab_insert()
71 		newnode->next = prev->next;  in hashtab_insert()
72 		prev->next = newnode;  in hashtab_insert()
74 		newnode->next = h->htable[hvalue];  in hashtab_insert()
75 		h->htable[hvalue] = newnode;  in hashtab_insert()
120 	hashtab_ptr_t prev, cur, newnode;  in hashtab_replace()  local
139 		newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t));  in hashtab_replace()
140 		if (newnode == NULL)  in hashtab_replace()
142 		memset(newnode, 0, sizeof(struct hashtab_node));  in hashtab_replace()
143 		newnode->key = key;  in hashtab_replace()
144 		newnode->datum = datum;  in hashtab_replace()
146 			newnode->next = prev->next;  in hashtab_replace()
147 			prev->next = newnode;  in hashtab_replace()
149 			newnode->next = h->htable[hvalue];  in hashtab_replace()
150 			h->htable[hvalue] = newnode;  in hashtab_replace()