108     x_list *node, *item, *next;  in hash_table_split()  local
132             item = node->data;  in hash_table_split()
134             b = hash_table_hash_key(h, ITEM_KEY(item)) % new_size;  in hash_table_split()
175     x_list *node, *item;  in X_PFX()  local
183             item = node->data;  in X_PFX()
184             hash_table_destroy_item(h, ITEM_KEY(item), ITEM_VALUE(item));  in X_PFX()
185             ITEM_FREE(item);  in X_PFX()
205     x_list *node, *item;  in hash_table_modify()  local
213         item = node->data;  in hash_table_modify()
215         if (hash_table_compare_keys(h, ITEM_KEY(item), k)) {  in hash_table_modify()
217                 hash_table_destroy_item(h, ITEM_KEY(item),  in hash_table_modify()
218                                         ITEM_VALUE(item));  in hash_table_modify()
219                 item->next = k;  in hash_table_modify()
220                 ITEM_VALUE(item) = v;  in hash_table_modify()
223                 hash_table_destroy_item(h, k, ITEM_VALUE(item));  in hash_table_modify()
224                 ITEM_VALUE(item) = v;  in hash_table_modify()
256     x_list **ptr, *item;  in X_PFX()  local
264         item = (*ptr)->data;  in X_PFX()
266         if (hash_table_compare_keys(h, ITEM_KEY(item), k)) {  in X_PFX()
267             hash_table_destroy_item(h, ITEM_KEY(item), ITEM_VALUE(item));  in X_PFX()
268             ITEM_FREE(item);  in X_PFX()
269             item = *ptr;  in X_PFX()
270             *ptr = item->next;  in X_PFX()
271             X_PFX(list_free_1) (item);  in X_PFX()
281     x_list *node, *item;  in X_PFX()  local
289         item = node->data;  in X_PFX()
291         if (hash_table_compare_keys(h, ITEM_KEY(item), k)) {  in X_PFX()
293                 *k_ret = ITEM_KEY(item);  in X_PFX()
295             return ITEM_VALUE(item);  in X_PFX()
309     x_list *node, *item;  in X_PFX()  local
317             item = node->data;  in X_PFX()
318             (*fun)(ITEM_KEY(item), ITEM_VALUE(item), data);  in X_PFX()