Lines Matching refs:next
11 * The above copyright notice and this permission notice (including the next
60 range->free_ids = range->free_ids->next;
64 ret = range->next;
76 entry = entry->next;
87 while (prev->next && prev->next->start < start)
88 prev = prev->next;
93 n->next = prev->next;
94 prev->next = n;
98 if (n->next)
99 n->end = n->next->start;
110 pid = &((*pid)->next);
116 (*pid) = id->next;
119 id->next = n->free_ids;
149 range->free_ids = idp->next;
192 range = range->next;
269 range = range->next;
270 fid->next = range->free_ids;
365 head->next = entry;
407 node = &head->next[key];
408 temp = node->next;
410 entry->next = node->next;
412 node->next = entry;
426 list_for_each(entry, &head->next[key]) {
435 struct idr_list *n_node = (ptr)->next; \
438 p_node->next = (ptr)->next; \
440 (ptr)->next = NULL; \
452 list_for_each_safe(entry, temp, &head->next[key]) {
468 list_for_each_safe(entry, temp, &head->next[key]) {
473 kmem_free(head->next,
475 head->next = NULL;
483 empty = list_empty(&(head)->next[key]);