Lines Matching refs:table
7 The cache is organized as a hash table (for lookups by device
179 ht->table = (hash_ent **)calloc(ht->max, sizeof(hash_ent *));
180 if (ht->table == NULL)
194 he = ht->table[i];
202 if (ht->table)
203 free(ht->table);
204 ht->table = NULL;
215 he = ht->table[i];
274 for(he=ht->table[i]; he; he=next) {
283 free(ht->table);
284 ht->table = new_table;
302 curr = ht->table[hash];
308 printf("entry %d:%" B_PRIdOFF " already in the hash table!\n",
317 he->next = ht->table[hash];
318 ht->table[hash] = he;
334 he = ht->table[HASH(dev, bnum) & ht->mask];
356 he = ht->table[hash];
371 if (ht->table[hash] == he)
372 ht->table[hash] = he->next;
376 beos_panic("hash table is inconsistent\n");
1080 "bad hash table entry %" B_PRIdOFF " %p != %p\n",
1446 beos_panic("*** remove_cached_device: bad hash table entry %ld "
2042 hash table any new blocks so that no one else will try to
2050 insert the new block into the hash table with its new block
2051 number. note that the block is still in the hash table for
2210 block numbers from the hash table and set the new block