Lines Matching refs:key
56 DAPL_HASH_KEY key;
96 #define DAPL_DOHASH(key, hashsize) ((uint64_t)((key) % (hashsize)))
109 } else if (element->key == (DAPL_HASH_KEY) (in_key)) { \
130 * Rehash the key (used by add and lookup functions)
132 * Inputs: element element to rehash key
133 * key, datum datum for key head
139 DAPL_HASH_KEY key,
157 if (element->key == key) {
166 * Add a new key to the hash table
169 * table, key and datum to be added
179 DAPL_HASH_KEY key,
205 DAPL_HASHLOOKUP(p_table, key, olddatum, found);
209 * key exists already
217 "dapli_hash_add () called with duplicate key "
218 "(" F64x ")\n", key);
223 hashValue = DAPL_DOHASH(key, p_table->tbl_size);
228 p_table->table[hashValue].key = key;
241 newelement->key = key;
282 * element, key to be deleted
288 DAPL_HASH_KEY key,
298 if (curelement->key == key) {
321 curelement->key = n->key;
387 p_table->table[i].key = 0;
434 * Inserts the specified data into the table with the given key.
441 IN DAPL_HASH_KEY key,
453 if (!dapli_hash_add(p_table, key, data, DAT_FALSE, NULL)) {
467 * Searches for the given key. If found,
475 IN DAPL_HASH_KEY key,
487 DAPL_HASHLOOKUP(p_table, key, olddatum, found);
490 DAPL_HASHLOOKUP(p_table, key, olddatum, found);
507 IN DAPL_HASH_KEY key,
522 hashValue = DAPL_DOHASH(key, p_table->tbl_size);
526 if (dapl_hash_delete_element(&p_table->table[hashValue], key, p_data)) {