Lines Matching refs:next
80 } else if (table[x].next == NULL) { in ht_insert()
81 table[x].next = kmem_cache_alloc(ht_node_cache, KM_SLEEP); in ht_insert()
82 table[x].next->elements = NULL; in ht_insert()
83 table[x].next->next = NULL; in ht_insert()
84 table[x].next->key = key; in ht_insert()
85 table[x].next->info = 1; in ht_insert()
86 (void) ipgpc_list_insert(&table[x].next->elements, id); in ht_insert()
88 p = table[x].next; in ht_insert()
100 p = p->next; in ht_insert()
104 p->next = NULL; in ht_insert()
108 p->next = table[x].next; in ht_insert()
109 table[x].next = p->next; in ht_insert()
135 p = table[x].next; in ht_search()
140 p = p->next; in ht_search()
222 if (table[x].next != NULL) { in ht_remove()
223 table[x].elements = table[x].next->elements; in ht_remove()
224 table[x].info = table[x].next->info; in ht_remove()
225 table[x].key = table[x].next->key; in ht_remove()
226 p = table[x].next; /* use p as temp */ in ht_remove()
227 table[x].next = table[x].next->next; in ht_remove()
236 while (p->next != NULL) { in ht_remove()
237 if ((p->next->key == key) && (p->next->info == 1)) { in ht_remove()
238 if (ipgpc_list_remove(&p->next->elements, id)) { in ht_remove()
242 if (p->next->elements == NULL) { in ht_remove()
244 if (p->next->next == NULL) { in ht_remove()
246 p->next); in ht_remove()
247 p->next = NULL; in ht_remove()
249 t = p->next; in ht_remove()
250 p->next = p->next->next; in ht_remove()
257 p = p->next; in ht_remove()