19 					struct list_head *b),  in merge()  argument
20 				struct list_head *a, struct list_head *b)  in merge()
24 	while (a && b) {  in merge()
26 		if ((*cmp)(priv, a, b) <= 0) {  in merge()
30 			tail->next = b;  in merge()
31 			b = b->next;  in merge()
35 	tail->next = a?:b;  in merge()
48 					struct list_head *b),  in merge_and_restore_back_links()  argument
50 				struct list_head *a, struct list_head *b)  in merge_and_restore_back_links()
55 	while (a && b) {  in merge_and_restore_back_links()
57 		if ((*cmp)(priv, a, b) <= 0) {  in merge_and_restore_back_links()
62 			tail->next = b;  in merge_and_restore_back_links()
63 			b->prev = tail;  in merge_and_restore_back_links()
64 			b = b->next;  in merge_and_restore_back_links()
68 	tail->next = a ? : b;  in merge_and_restore_back_links()
104 			struct list_head *b))  in list_sort()  argument