Searched refs:node1 (Results 1 – 4 of 4) sorted by relevance
387 static void move_tree(struct fw_node *node0, struct fw_node *node1, int port) in move_tree() argument392 tree = node1->ports[port]; in move_tree()395 if (tree->ports[i] == node1) { in move_tree()410 struct fw_node *node0, *node1, *next1; in update_tree() local419 node1 = fw_node(list1.next); in update_tree()422 WARN_ON(node0->port_count != node1->port_count); in update_tree()424 if (node0->link_on && !node1->link_on) in update_tree()426 else if (!node0->link_on && node1->link_on) in update_tree()428 else if (node1->initiated_reset && node1->link_on) in update_tree()433 node0->node_id = node1->node_id; in update_tree()[all …]
815 struct pci_resource *node1; in cpqhp_resource_sort_and_combine() local837 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()[all …]
299 symbol_node_t *node1, *node2; in symlist_free() local301 node1 = SLIST_FIRST(symlist); in symlist_free()302 while (node1 != NULL) { in symlist_free()303 node2 = SLIST_NEXT(node1, links); in symlist_free()304 free(node1); in symlist_free()305 node1 = node2; in symlist_free()
1274 const char *node1 = NULL, *node2 = NULL; in show_holes() local1277 node1 = kasprintf(GFP_KERNEL, in show_holes()1287 node1, in show_holes()1292 kfree(node1); in show_holes()