Lines Matching refs:entry
414 * single entry. We will use the rest of the space to construct a temporary
487 /* move chain pointers into the last entry of each hash bucket */
682 const U32* entry = &dms->hashTable[ddsIdx];
683 PREFETCH_L1(entry);
847 /* Note: prefetching more of the hash table does not appear to be beneficial for 128-entry rows */
1105 * - Figure out where to insert the new entry:
1109 * - Determine the correct position within the row to insert the entry into. Each row of 16 or 32 can
1112 * - Note: The tagTable has 17 or 33 1-byte entries per row, due to 16 or 32 tags, and 1 "head" entry.
1113 * The 17 or 33 entry rows are spaced out to occur every 32 or 64 bytes, respectively,
1161 { /* Prefetch DDS hashtable entry */