Lines Matching refs:next
121 slot = slot->next;
307 if (!((*head)->next))
314 if (((*head)->next) &&
315 ((*head)->length > (*head)->next->length)) {
318 *head = (*head)->next;
319 current_res->next = (*head)->next;
320 (*head)->next = current_res;
325 while (current_res->next && current_res->next->next) {
326 if (current_res->next->length > current_res->next->next->length) {
328 next_res = current_res->next;
329 current_res->next = current_res->next->next;
330 current_res = current_res->next;
331 next_res->next = current_res->next;
332 current_res->next = next_res;
334 current_res = current_res->next;
355 if (!((*head)->next))
362 if (((*head)->next) &&
363 ((*head)->length < (*head)->next->length)) {
366 *head = (*head)->next;
367 current_res->next = (*head)->next;
368 (*head)->next = current_res;
373 while (current_res->next && current_res->next->next) {
374 if (current_res->next->length < current_res->next->next->length) {
376 next_res = current_res->next;
377 current_res->next = current_res->next->next;
378 current_res = current_res->next;
379 next_res->next = current_res->next;
380 current_res->next = next_res;
382 current_res = current_res->next;
446 split_node->next = node;
454 *head = node->next;
457 while (prevnode->next != node)
458 prevnode = prevnode->next;
460 prevnode->next = node->next;
462 node->next = NULL;
487 while (node->next) {
489 node = node->next;
542 for (node = *head; node; node = node->next) {
567 split_node->next = node->next;
568 node->next = split_node;
586 split_node->next = node->next;
587 node->next = split_node;
598 *head = node->next;
601 while (prevnode->next != node)
602 prevnode = prevnode->next;
604 prevnode->next = node->next;
606 node->next = NULL;
636 for (max = *head; max; max = max->next) {
638 * instead we'll continue to the next.
663 split_node->next = max->next;
664 max->next = split_node;
681 split_node->next = max->next;
682 max->next = split_node;
692 *head = max->next;
694 while (temp && temp->next != max)
695 temp = temp->next;
698 temp->next = max->next;
701 max->next = NULL;
733 for (node = *head; node; node = node->next) {
760 split_node->next = node->next;
761 node->next = split_node;
780 split_node->next = node->next;
781 node->next = split_node;
788 *head = node->next;
791 while (prevnode->next != node)
792 prevnode = prevnode->next;
794 prevnode->next = node->next;
796 node->next = NULL;
824 dbg("*head->next = %p\n", (*head)->next);
826 if (!(*head)->next)
830 dbg("*head->next->base = 0x%x\n", (*head)->next->base);
835 if (((*head)->next) &&
836 ((*head)->base > (*head)->next->base)) {
838 (*head) = (*head)->next;
839 node1->next = (*head)->next;
840 (*head)->next = node1;
846 while (node1->next && node1->next->next) {
847 if (node1->next->base > node1->next->next->base) {
849 node2 = node1->next;
850 node1->next = node1->next->next;
851 node1 = node1->next;
852 node2->next = node1->next;
853 node1->next = node2;
855 node1 = node1->next;
861 while (node1 && node1->next) {
862 if ((node1->base + node1->length) == node1->next->base) {
865 node1->length += node1->next->length;
866 node2 = node1->next;
867 node1->next = node1->next->next;
870 node1 = node1->next;
957 struct pci_func *next;
963 new_slot->next = NULL;
969 next = cpqhp_slot_list[busnumber];
970 while (next->next != NULL)
971 next = next->next;
972 next->next = new_slot;
986 struct pci_func *next;
991 next = cpqhp_slot_list[old_slot->bus];
992 if (next == NULL)
995 if (next == old_slot) {
996 cpqhp_slot_list[old_slot->bus] = old_slot->next;
1002 while ((next->next != old_slot) && (next->next != NULL))
1003 next = next->next;
1005 if (next->next == old_slot) {
1006 next->next = old_slot->next;
1025 struct pci_func *next;
1031 next = cpqhp_slot_list[tempBus];
1033 while (!slot_remove(next))
1034 next = cpqhp_slot_list[tempBus];
1037 next = cpqhp_slot_list[bridge->bus];
1039 if (next == NULL)
1042 if (next == bridge) {
1043 cpqhp_slot_list[bridge->bus] = bridge->next;
1047 while ((next->next != bridge) && (next->next != NULL))
1048 next = next->next;
1050 if (next->next != bridge)
1052 next->next = bridge->next;
1080 while (func->next != NULL) {
1081 func = func->next;
1130 for (slot = ctrl->slot; slot; slot = slot->next) {
1564 /* next, we will instantiate the linux pci_dev structures (with
1743 for (ctrl = cpqhp_ctrl_list; ctrl; ctrl = ctrl->next)
2125 /* Get ready for next iteration */
2176 /* Get ready for next iteration */
2186 /* Get ready for next iteration */
2270 /* The following loop skips to the next present function
2413 dbg("(base, len, next) (%x, %x, %p)\n", io_node->base,
2414 io_node->length, io_node->next);
2416 dbg("(base, len, next) (%x, %x, %p)\n", mem_node->base,
2417 mem_node->length, mem_node->next);
2419 dbg("(base, len, next) (%x, %x, %p)\n", p_mem_node->base,
2420 p_mem_node->length, p_mem_node->next);
2468 bus_node->next = NULL;
2473 io_node->next = NULL;
2486 mem_node->next = NULL;
2496 p_mem_node->next = NULL;
2566 hold_bus_node->next = func->bus_head;
2608 hold_IO_node->next = func->io_head;
2625 hold_IO_node->next = func->io_head;
2630 hold_IO_node->next = func->io_head;
2658 hold_mem_node->next = func->mem_head;
2677 hold_mem_node->next = func->mem_head;
2682 hold_mem_node->next = func->mem_head;
2711 hold_p_mem_node->next = func->p_mem_head;
2728 hold_p_mem_node->next = func->p_mem_head;
2733 hold_p_mem_node->next = func->p_mem_head;
2784 dbg("Got io_node start = %8.8x, length = %8.8x next (%p)\n",
2785 io_node->base, io_node->length, io_node->next);
2790 io_node->next = func->io_head;
2804 p_mem_node->next = func->p_mem_head;
2820 mem_node->next = func->mem_head;