hash_table
hash_node_t *hash_table[HASHSIZE];
for (node = hash_table[index]; node != NULL; node = node->next) {
node->next = hash_table[index];
hash_table[index] = node;
char *hash_table;
hash_table = malloc_vital(hash_table_num);
if (0 == *(hash_table + hash_value)) {
*(hash_table + hash_value) = 1;
*(hash_table + hash_value) = 2;
if (0 == *(hash_table + hash_value)) {
*(hash_table + hash_value) = 1;
*(hash_table + hash_value) = 2;
if (2 == *(hash_table + i)) {
} else if (1 == *(hash_table + i)) {
} else if (0 == *(hash_table + i)) {
free(hash_table);
hash_table = error_table + hash_table_num;
of_table = hash_table + (pair_size * hash_table_num);
p = hash_table + (pair_size * hash_value);
p = hash_table +
(void) memcpy(hash_table + j + (resultlen - default_data->size),
(uintptr_t)(ht.hash_table+bucket)) == -1) {
bucket, ht.hash_table+bucket);
hash_obj_t *hash_table;
hash_table = &cont_tbl->hash_obj[index_to_hash];
hash_obj->next = hash_table->next;
hash_table->next = hash_obj;
hash_table[(free_obj->obj_hdl % TABLE_SIZE)] =
hash_table[(seg_hash->obj_hdl % TABLE_SIZE)] = seg_hash->next;
hash_obj->next = hash_table[index_to_hash];
hash_table[index_to_hash] = hash_obj; /* hash obj. added */
hash_table[(pkt_hash->obj_hdl % TABLE_SIZE)] = pkt_hash->next;
hash_table[(sec_hash_obj->obj_hdl % TABLE_SIZE)] =
hash_table[(hash_obj->obj_hdl % TABLE_SIZE)] = hash_obj->next;
static hash_obj_t *hash_table[TABLE_SIZE];
hash_table[count] = NULL;
first_hash_obj = hash_table[index_to_hash];
uint32_t *hash_table; /* hash table */
if (p->hash_table == NULL) {
d_hash[i] = SWAP(p, p->hash_table[i]);
p->hash_table = d_hash;
p->hash_table = p->hash_size <= 2 ? NULL :
uint32_t *hash_table;
hash_table = gmnp->hash_table;
(hash_table == NULL || (hash_size <= 2))) {
hash_val = HASH_TBL(gmnp, hash_table[hash_idx]);
while ((i = p->hash_table[idx]) != 0) {
gprintf(0, "%d: %u\n", x, p->hash_table[x]);
gprintf(level, " hash_table: 0x%p\n", (void *)gmnp->hash_table);
read_sync_stats(td_thragent_t *ta_p, psaddr_t hash_table,
if (ps_pdread(ta_p->ph_p, hash_table + ix * sizeof (uint64_t),
Dwarf_Hash_Table hash_table = context->cc_abbrev_hash_table;
_dwarf_free_abbrev_hash_table_contents(dbg,hash_table);
hash_table->tb_entries = 0;
dwarf_dealloc(dbg, hash_table, DW_DLA_HASH_TABLE);
Dwarf_Hash_Table hash_table = 0;
hash_table = context->cc_abbrev_hash_table;
if (hash_table) {
_dwarf_free_abbrev_hash_table_contents(dbg,hash_table);
hash_table->tb_entries = 0;
dwarf_dealloc(dbg,hash_table, DW_DLA_HASH_TABLE);
Dwarf_Hash_Table hash_table)
if(!hash_table) {
if (!hash_table->tb_entries) {
for (; hashnum < hash_table->tb_table_entry_count; ++hashnum) {
&hash_table->tb_entries[hashnum];
dwarf_dealloc(dbg,hash_table->tb_entries,DW_DLA_HASH_TABLE_ENTRY);
hash_table->tb_entries = 0;
struct Dwarf_Hash_Table_s* hash_table);
hash_table[(sec_hash_obj->obj_hdl % TABLE_SIZE)] =
hash_table[(hash_obj->obj_hdl % TABLE_SIZE)] =
hash_table[(free_obj->obj_hdl % TABLE_SIZE)] =
hash_table[(seg_hash->obj_hdl % TABLE_SIZE)] = seg_hash->next;
static hash_obj_t *hash_table[TABLE_SIZE];
hash_table[count] = NULL;
first_hash_obj = hash_table[index_to_hash];
hash_obj->next = hash_table[index_to_hash];
hash_table[index_to_hash] = hash_obj; /* hash obj. added */
static struct ident *hash_table[IDENT_HASH_SIZE];
struct ident * ident = hash_table[i];
ident->next = hash_table[hash];
hash_table[hash] = ident;
p = &hash_table[hash];
for (db = h->hash_table[idx]; db != NULL; db = db->db_hash_next) {
for (dbf = h->hash_table[idx]; dbf != NULL; dbf = dbf->db_hash_next) {
db->db_hash_next = h->hash_table[idx];
h->hash_table[idx] = db;
dbp = &h->hash_table[idx];
h->hash_table = kmem_zalloc(hsize * sizeof (void *), KM_NOSLEEP);
if (h->hash_table == NULL) {
kmem_free(h->hash_table, (h->hash_table_mask + 1) * sizeof (void *));
dmu_buf_impl_t **hash_table;
hash_table table; /* pointer to the hash table structure */
insert_ipgpc_table_list_info(int table_id, hash_table table, int wildcard,
static void insert_ipgpc_table_list_info(int, hash_table, int, uint16_t);
ht_search(hash_table table, int key)
hash_table table = taid->table;
hash_table table = taid->table;
static linked_list ht_search(hash_table, int);
hash_table table = taid->table;
fcram_cell_t *hash_table; /* allocated for Neptune only */