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()
98 			p = p->next;  in ht_insert()
102 		p->next = NULL;  in ht_insert()
106 		p->next = table[x].next;  in ht_insert()
107 		table[x].next = p->next;  in ht_insert()
133 		p = table[x].next;  in ht_search()
138 			p = p->next;  in ht_search()
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()
234 		while (p->next != NULL) {  in ht_remove()
235 			if ((p->next->key == key) && (p->next->info == 1)) {  in ht_remove()
236 				if (ipgpc_list_remove(&p->next->elements, id)) {  in ht_remove()
240 				if (p->next->elements == NULL) {  in ht_remove()
242 					if (p->next->next == NULL) {  in ht_remove()
244 						    p->next);  in ht_remove()
245 						p->next = NULL;  in ht_remove()
247 						t = p->next;  in ht_remove()
248 						p->next = p->next->next;  in ht_remove()
255 			p = p->next;  in ht_remove()