3  * Rewritten from original source 2006 by Dan Merillat for use in u-boot.
8  * SPDX-License-Identifier:	MIT
16 	struct b_node *p, *q, *e, **tail;  in sort_list()  local
19 	if (!list->listHead)  in sort_list()
22 	for (k = 1; k < list->listCount; k *= 2) {  in sort_list()
23 		tail = &list->listHead;  in sort_list()
24 		for (p = q = list->listHead; p; p = q) {  in sort_list()
27 				q = q->next;  in sort_list()
35 				     list->listCompare(p, q))) {  in sort_list()
37 					e = q;  in sort_list()
38 					q = q->next;  in sort_list()
39 					qsize--;  in sort_list()
41 					e = p;  in sort_list()
42 					p = p->next;  in sort_list()
43 					psize--;  in sort_list()
45 				e->next = NULL; /* break accidental loops. */  in sort_list()
46 				*tail = e;  in sort_list()
47 				tail = &e->next;  in sort_list()