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