30 			tail->next = a;  in merge()
31 			a = a->next;  in merge()
33 			tail->next = b;  in merge()
34 			b = b->next;  in merge()
36 		tail = tail->next;  in merge()
38 	tail->next = a?:b;  in merge()
39 	return head.next;  in merge()
60 			tail->next = a;  in merge_and_restore_back_links()
62 			a = a->next;  in merge_and_restore_back_links()
64 			tail->next = b;  in merge_and_restore_back_links()
66 			b = b->next;  in merge_and_restore_back_links()
68 		tail = tail->next;  in merge_and_restore_back_links()
70 	tail->next = a ? : b;  in merge_and_restore_back_links()
79 		(*cmp)(priv, tail->next, tail->next);  in merge_and_restore_back_links()
81 		tail->next->prev = tail;  in merge_and_restore_back_links()
82 		tail = tail->next;  in merge_and_restore_back_links()
83 	} while (tail->next);  in merge_and_restore_back_links()
85 	tail->next = head;  in merge_and_restore_back_links()
118 	head->prev->next = NULL;  in list_sort()
119 	list = head->next;  in list_sort()
123 		list = list->next;  in list_sort()
124 		cur->next = NULL;  in list_sort()
248 	for (cur = head.next; cur->next != &head; cur = cur->next) {  in list_sort_test()
252 		if (cur->next->prev != cur) {  in list_sort_test()
258 		cmp_result = cmp(NULL, cur, cur->next);  in list_sort_test()
266 		el1 = container_of(cur->next, struct debug_el, list);  in list_sort_test()