815 	struct pci_resource *node1;  in cpqhp_resource_sort_and_combine()  local
837 			node1 = *head;  in cpqhp_resource_sort_and_combine()
839 			node1->next = (*head)->next;  in cpqhp_resource_sort_and_combine()
840 			(*head)->next = node1;  in cpqhp_resource_sort_and_combine()
844 		node1 = (*head);  in cpqhp_resource_sort_and_combine()
846 		while (node1->next && node1->next->next) {  in cpqhp_resource_sort_and_combine()
847 			if (node1->next->base > node1->next->next->base) {  in cpqhp_resource_sort_and_combine()
849 				node2 = node1->next;  in cpqhp_resource_sort_and_combine()
850 				node1->next = node1->next->next;  in cpqhp_resource_sort_and_combine()
851 				node1 = node1->next;  in cpqhp_resource_sort_and_combine()
852 				node2->next = node1->next;  in cpqhp_resource_sort_and_combine()
853 				node1->next = node2;  in cpqhp_resource_sort_and_combine()
855 				node1 = node1->next;  in cpqhp_resource_sort_and_combine()
859 	node1 = *head;  in cpqhp_resource_sort_and_combine()
861 	while (node1 && node1->next) {  in cpqhp_resource_sort_and_combine()
862 		if ((node1->base + node1->length) == node1->next->base) {  in cpqhp_resource_sort_and_combine()
865 			node1->length += node1->next->length;  in cpqhp_resource_sort_and_combine()
866 			node2 = node1->next;  in cpqhp_resource_sort_and_combine()
867 			node1->next = node1->next->next;  in cpqhp_resource_sort_and_combine()
870 			node1 = node1->next;  in cpqhp_resource_sort_and_combine()