H A D | st.c | 352 #define PTR_NOT_EQUAL(table, ptr, hash_val, key) \ 353 ((ptr) != 0 && ((ptr)->hash != (hash_val) || !EQUAL((table), (key), (ptr)->key))) 377 #define FIND_ENTRY(table, ptr, hash_val, bin_pos) \ 378 ((ptr) = find_entry((table), key, (hash_val), ((bin_pos) = (hash_val)%(table)->num_bins))) 381 find_entry(st_table *table, st_data_t key, st_index_t hash_val, st_index_t bin_pos) argument 385 if (PTR_NOT_EQUAL(table, ptr, hash_val, key)) { 387 while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) { 396 find_packed_index(st_table *table, st_index_t hash_val, st_data_t key) argument 400 (PHASH(table, i) != hash_val || !EQUA 411 st_index_t hash_val; local 439 st_index_t hash_val; local 468 new_entry(st_table * table, st_data_t key, st_data_t value, st_index_t hash_val, register st_index_t bin_pos) argument 483 add_direct(st_table *table, st_data_t key, st_data_t value, st_index_t hash_val, register st_index_t bin_pos) argument 542 add_packed_direct(st_table *table, st_data_t key, st_data_t value, st_index_t hash_val) argument 561 st_index_t hash_val; local 593 st_index_t hash_val; local 626 st_index_t hash_val; local 641 st_index_t new_num_bins, hash_val; local 663 st_index_t hash_val; local 726 st_index_t hash_val; local 763 st_index_t hash_val; local 836 st_index_t hash_val, bin_pos; local [all...] |