Lines Matching defs:hash
678 * we will use a hash table specific to that API. These tables are in
688 * enum table and use bsearch(), but we will use a read-only hash
692 * open addressing hash table, we can find the enum on the first try
1564 * We hash the enum value to get an index into the 'table' array,
1587 int mask, hash;
1594 /* We index into the table_set[] list of per-API hash tables using the API's
1609 hash = (pname * prime_factor);
1611 int idx = table(api)[hash & mask];
1613 /* If the enum isn't valid, the hash walk ends with index 0,
1626 hash += prime_step;