69 	hashtab_ptr_t prev, cur, newnode;  in hashtab_insert()  local
85 	newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t));  in hashtab_insert()
86 	if (newnode == NULL)  in hashtab_insert()
88 	memset(newnode, 0, sizeof(struct hashtab_node));  in hashtab_insert()
89 	newnode->key = key;  in hashtab_insert()
90 	newnode->datum = datum;  in hashtab_insert()
92 		newnode->next = prev->next;  in hashtab_insert()
93 		prev->next = newnode;  in hashtab_insert()
95 		newnode->next = h->htable[hvalue];  in hashtab_insert()
96 		h->htable[hvalue] = newnode;  in hashtab_insert()
141 	hashtab_ptr_t prev, cur, newnode;  in hashtab_replace()  local
160 		newnode = (hashtab_ptr_t) malloc(sizeof(hashtab_node_t));  in hashtab_replace()
161 		if (newnode == NULL)  in hashtab_replace()
163 		memset(newnode, 0, sizeof(struct hashtab_node));  in hashtab_replace()
164 		newnode->key = key;  in hashtab_replace()
165 		newnode->datum = datum;  in hashtab_replace()
167 			newnode->next = prev->next;  in hashtab_replace()
168 			prev->next = newnode;  in hashtab_replace()
170 			newnode->next = h->htable[hvalue];  in hashtab_replace()
171 			h->htable[hvalue] = newnode;  in hashtab_replace()