Lines Matching refs:Entry
988 /* cache entry. for simplicity, 'hash' and 'hlink' are inlined in this
993 typedef struct Entry {
995 struct Entry* hlink; /* next in collision chain */
996 struct Entry* mru_prev;
997 struct Entry* mru_next;
1003 time_t expires; /* time_t when the entry isn't valid any more */
1005 } Entry;
1105 entry_free( Entry* e )
1114 entry_mru_remove( Entry* e )
1121 entry_mru_add( Entry* e, Entry* list )
1123 Entry* first = list->mru_next;
1132 /* compute the hash of a given entry, this is a hash of most
1135 entry_hash( const Entry* e )
1143 /* initialize an Entry as a search key, this also checks the input query packet
1146 entry_init_key( Entry* e, const void* query, int querylen )
1161 /* allocate a new entry as a cache node */
1162 static Entry*
1163 entry_alloc( const Entry* init, const void* answer, int answerlen )
1165 Entry* e;
1188 entry_equals( const Entry* e1, const Entry* e2 )
1211 * inlined in the Entry structure.
1226 Entry mru_list;
1228 Entry* entries;
1281 _cache_check_pending_request_locked( struct resolv_cache** cache, Entry* key, unsigned netid )
1321 _cache_notify_waiting_tid_locked( struct resolv_cache* cache, Entry* key )
1352 Entry key[1];
1378 Entry** pnode = (Entry**) &cache->entries[nn];
1381 Entry* node = *pnode;
1451 Entry* e;
1517 static Entry**
1519 Entry* key )
1522 Entry** pnode = (Entry**) &cache->entries[ index ];
1525 Entry* node = *pnode;
1538 /* Add a new entry to the hash table. 'lookup' must be the
1541 * newly created entry
1545 Entry** lookup,
1546 Entry* e )
1553 XLOG("%s: entry %d added (count=%d)", __FUNCTION__,
1557 /* Remove an existing entry from the hash table,
1563 Entry** lookup )
1565 Entry* e = *lookup;
1567 XLOG("%s: entry %d removed (count=%d)", __FUNCTION__,
1576 /* Remove the oldest entry from the hash table.
1581 Entry* oldest = cache->mru_list.mru_prev;
1582 Entry** lookup = _cache_lookup_p(cache, oldest);
1598 Entry* e;
1602 // Entry is old, remove
1604 Entry** lookup = _cache_lookup_p(cache, e);
1606 XLOG("%s: ENTRY NOT IN HTABLE ?", __FUNCTION__);
1625 Entry key[1];
1626 Entry** lookup;
1627 Entry* e;
1676 XLOG( " NOT IN CACHE (STALE ENTRY %p DISCARDED)", *lookup );
1692 /* bump up this entry to the top of the MRU list */
1698 XLOG( "FOUND IN CACHE entry=%p", e );
1714 Entry key[1];
1715 Entry* e;
1716 Entry** lookup;
