21 					struct list_head *b),  in merge()  argument
22 				struct list_head *a, struct list_head *b)  in merge()
26 	while (a && b) {  in merge()
28 		if ((*cmp)(priv, a, b) <= 0) {  in merge()
32 			tail->next = b;  in merge()
33 			b = b->next;  in merge()
37 	tail->next = a?:b;  in merge()
50 					struct list_head *b),  in merge_and_restore_back_links()  argument
52 				struct list_head *a, struct list_head *b)  in merge_and_restore_back_links()
57 	while (a && b) {  in merge_and_restore_back_links()
59 		if ((*cmp)(priv, a, b) <= 0) {  in merge_and_restore_back_links()
64 			tail->next = b;  in merge_and_restore_back_links()
65 			b->prev = tail;  in merge_and_restore_back_links()
66 			b = b->next;  in merge_and_restore_back_links()
70 	tail->next = a ? : b;  in merge_and_restore_back_links()
106 			struct list_head *b))  in list_sort()  argument
201 static int __init cmp(void *priv, struct list_head *a, struct list_head *b)  in cmp()  argument
206 	elb = container_of(b, struct debug_el, list);  in cmp()