10 #include <linux/list.h>
16  * Returns a list organized in an intermediate format suited
43  * Combine final list merge with restoration of standard doubly-linked
44  * list structure.  This approach duplicates code from merge(), but
90  * list_sort - sort a list
92  * @head: the list to sort
111 	struct list_head *list;  in list_sort()  local
119 	list = head->next;  in list_sort()
121 	while (list) {  in list_sort()
122 		struct list_head *cur = list;  in list_sort()
123 		list = list->next;  in list_sort()
132 				printk_once(KERN_DEBUG "list passed to"  in list_sort()
144 			list = merge(priv, cmp, part[lev], list);  in list_sort()
146 	merge_and_restore_back_links(priv, cmp, head, part[max_lev], list);  in list_sort()
155  * The pattern of set bits in the list length determines which cases
165 	struct list_head list;  member
171 /* Array, containing pointers to all elements in the test list */
207 	ela = container_of(a, struct debug_el, list);  in cmp()
208 	elb = container_of(b, struct debug_el, list);  in cmp()
243 		list_add_tail(&el->list, &head);  in list_sort_test()
253 			printk(KERN_ERR "list_sort_test: error: list is "  in list_sort_test()
260 			printk(KERN_ERR "list_sort_test: error: list is not "  in list_sort_test()
265 		el = container_of(cur, struct debug_el, list);  in list_sort_test()
266 		el1 = container_of(cur->next, struct debug_el, list);  in list_sort_test()
282 		printk(KERN_ERR "list_sort_test: error: bad list length %d",  in list_sort_test()
292 		kfree(container_of(cur, struct debug_el, list));  in list_sort_test()