Lines Matching refs:key
1092 * data in the query (key) */
1102 /* initialize an Entry as a search key, this also checks the input query packet
1224 /* return 0 if no pending request is found matching the key
1228 _cache_check_pending_request_locked( struct resolv_cache* cache, Entry* key )
1233 if (cache && key) {
1237 if (ri->hash == key->hash) {
1248 ri->hash = key->hash;
1263 * matching the key has been added to the cache */
1265 _cache_notify_waiting_tid_locked( struct resolv_cache* cache, Entry* key )
1269 if (cache && key) {
1273 if (ri->hash == key->hash) {
1296 Entry key[1];
1298 if (cache && entry_init_key(key, query, querylen)) {
1300 _cache_notify_waiting_tid_locked(cache, key);
1458 /* This function tries to find a key within the hash table
1459 * In case of success, it will return a *pointer* to the hashed key.
1467 * for the key position in the htable.
1474 Entry* key )
1476 int index = key->hash % cache->max_entries;
1485 if (node->hash == key->hash && entry_equals(node, key))
1581 Entry key[1];
1593 if (!entry_init_key(key, query, querylen)) {
1603 lookup = _cache_lookup_p(cache, key);
1610 if (!_cache_check_pending_request_locked(cache, key)) {
1613 lookup = _cache_lookup_p(cache, key);
1663 Entry key[1];
1670 if (!entry_init_key( key, query, querylen )) {
1685 lookup = _cache_lookup_p(cache, key);
1700 lookup = _cache_lookup_p(cache, key);
1711 e = entry_alloc(key, answer, answerlen);
1721 _cache_notify_waiting_tid_locked(cache, key);