63    struct HashEntry *Table[TABLE_SIZE];  /**< the lookup table */  member
104       struct HashEntry *entry = table->Table[pos];  in _mesa_DeleteHashTable()
136    entry = table->Table[pos];  in _mesa_HashLookup_unlocked()
193    for (entry = table->Table[pos]; entry; entry = entry->Next) {  in _mesa_HashInsert()
212       entry->Next = table->Table[pos];  in _mesa_HashInsert()
213       table->Table[pos] = entry;  in _mesa_HashInsert()
250    entry = table->Table[pos];  in _mesa_HashRemove()
258             table->Table[pos] = entry->Next;  in _mesa_HashRemove()
294       for (entry = table->Table[pos]; entry; entry = next) {  in _mesa_HashDeleteAll()
299       table->Table[pos] = NULL;  in _mesa_HashDeleteAll()
331       for (entry = table->Table[pos]; entry; entry = next) {  in _mesa_HashWalk()
356       if (table->Table[pos]) {  in _mesa_HashFirstEntry()
358          return table->Table[pos]->Key;  in _mesa_HashFirstEntry()
383    for (entry = table->Table[pos]; entry ; entry = entry->Next) {  in _mesa_HashNextEntry()
402          if (table->Table[pos]) {  in _mesa_HashNextEntry()
403             return table->Table[pos]->Key;  in _mesa_HashNextEntry()
423       const struct HashEntry *entry = table->Table[pos];  in _mesa_HashPrint()
493       for (entry = table->Table[pos]; entry; entry = entry->Next) {  in _mesa_HashNumEntries()