27 			tail->next = a;  in merge()
28 			a = a->next;  in merge()
30 			tail->next = b;  in merge()
31 			b = b->next;  in merge()
33 		tail = tail->next;  in merge()
35 	tail->next = a?:b;  in merge()
36 	return head.next;  in merge()
58 			tail->next = a;  in merge_and_restore_back_links()
60 			a = a->next;  in merge_and_restore_back_links()
62 			tail->next = b;  in merge_and_restore_back_links()
64 			b = b->next;  in merge_and_restore_back_links()
66 		tail = tail->next;  in merge_and_restore_back_links()
68 	tail->next = a ? : b;  in merge_and_restore_back_links()
78 			(*cmp)(priv, tail->next, tail->next);  in merge_and_restore_back_links()
80 		tail->next->prev = tail;  in merge_and_restore_back_links()
81 		tail = tail->next;  in merge_and_restore_back_links()
82 	} while (tail->next);  in merge_and_restore_back_links()
84 	tail->next = head;  in merge_and_restore_back_links()
117 	head->prev->next = NULL;  in list_sort()
118 	list = head->next;  in list_sort()
122 		list = list->next;  in list_sort()
123 		cur->next = NULL;  in list_sort()