Lines Matching refs:table
60 hash_table table = taid->table; in ht_insert() local
73 if (((table[x].key == key) && (table[x].info == 1)) || in ht_insert()
74 (table[x].info == 0)) { in ht_insert()
75 table[x].key = key; in ht_insert()
76 table[x].info = 1; in ht_insert()
77 (void) ipgpc_list_insert(&table[x].elements, id); in ht_insert()
78 } else if (table[x].next == NULL) { in ht_insert()
79 table[x].next = kmem_cache_alloc(ht_node_cache, KM_SLEEP); in ht_insert()
80 table[x].next->elements = NULL; in ht_insert()
81 table[x].next->next = NULL; in ht_insert()
82 table[x].next->key = key; in ht_insert()
83 table[x].next->info = 1; in ht_insert()
84 (void) ipgpc_list_insert(&table[x].next->elements, id); in ht_insert()
86 p = table[x].next; in ht_insert()
106 p->next = table[x].next; in ht_insert()
107 table[x].next = p->next; in ht_insert()
124 ht_search(hash_table table, int key) in ht_search() argument
130 if ((table[x].key == key) && (table[x].info == 1)) { in ht_search()
131 return (table[x].elements); in ht_search()
133 p = table[x].next; in ht_search()
157 hash_table table = taid->table; in ht_retrieve() local
163 alist = ht_search(table, key); in ht_retrieve()
198 hash_table table = taid->table; in ht_remove() local
211 if ((table[x].key == key) && (table[x].info == 1)) { in ht_remove()
212 if (table[x].elements != NULL) { in ht_remove()
213 if (ipgpc_list_remove(&table[x].elements, id)) { in ht_remove()
218 if (table[x].elements == NULL) { in ht_remove()
220 if (table[x].next != NULL) { in ht_remove()
221 table[x].elements = table[x].next->elements; in ht_remove()
222 table[x].info = table[x].next->info; in ht_remove()
223 table[x].key = table[x].next->key; in ht_remove()
224 p = table[x].next; /* use p as temp */ in ht_remove()
225 table[x].next = table[x].next->next; in ht_remove()
228 table[x].info = 0; /* mark entry as empty */ in ht_remove()
229 table[x].key = 0; in ht_remove()
233 p = &table[x]; in ht_remove()