Lines Matching refs:next
32 tail->next = a; in merge()
33 a = a->next; in merge()
35 tail->next = b; in merge()
36 b = b->next; in merge()
38 tail = tail->next; in merge()
40 tail->next = a?:b; in merge()
41 return head.next; in merge()
62 tail->next = a; in merge_and_restore_back_links()
64 a = a->next; in merge_and_restore_back_links()
66 tail->next = b; in merge_and_restore_back_links()
68 b = b->next; in merge_and_restore_back_links()
70 tail = tail->next; in merge_and_restore_back_links()
72 tail->next = a ? : b; in merge_and_restore_back_links()
81 (*cmp)(priv, tail->next, tail->next); in merge_and_restore_back_links()
83 tail->next->prev = tail; in merge_and_restore_back_links()
84 tail = tail->next; in merge_and_restore_back_links()
85 } while (tail->next); in merge_and_restore_back_links()
87 tail->next = head; in merge_and_restore_back_links()
120 head->prev->next = NULL; in list_sort()
121 list = head->next; in list_sort()
125 list = list->next; in list_sort()
126 cur->next = NULL; in list_sort()
250 for (cur = head.next; cur->next != &head; cur = cur->next) { in list_sort_test()
254 if (cur->next->prev != cur) { in list_sort_test()
260 cmp_result = cmp(NULL, cur, cur->next); in list_sort_test()
268 el1 = container_of(cur->next, struct debug_el, list); in list_sort_test()