401 static void move_tree(struct fw_node *node0, struct fw_node *node1, int port)  in move_tree()  argument
407 	node0->ports[port] = tree;  in move_tree()
410 			tree->ports[i] = node0;  in move_tree()
424 	struct fw_node *node0, *node1, *next1;  in update_tree()  local
432 	node0 = fw_node(list0.next);  in update_tree()
435 	while (&node0->link != &list0) {  in update_tree()
436 		WARN_ON(node0->port_count != node1->port_count);  in update_tree()
438 		if (node0->link_on && !node1->link_on)  in update_tree()
440 		else if (!node0->link_on && node1->link_on)  in update_tree()
447 		node0->node_id = node1->node_id;  in update_tree()
448 		node0->color = card->color;  in update_tree()
449 		node0->link_on = node1->link_on;  in update_tree()
450 		node0->initiated_reset = node1->initiated_reset;  in update_tree()
451 		node0->max_hops = node1->max_hops;  in update_tree()
453 		fw_node_event(card, node0, event);  in update_tree()
456 			card->root_node = node0;  in update_tree()
458 			card->irm_node = node0;  in update_tree()
460 		for (i = 0; i < node0->port_count; i++) {  in update_tree()
461 			if (node0->ports[i] && node1->ports[i]) {  in update_tree()
467 				if (node0->ports[i]->color == card->color)  in update_tree()
469 				list_add_tail(&node0->ports[i]->link, &list0);  in update_tree()
471 			} else if (node0->ports[i]) {  in update_tree()
479 				for_each_fw_node(card, node0->ports[i],  in update_tree()
481 				node0->ports[i] = NULL;  in update_tree()
489 				move_tree(node0, node1, i);  in update_tree()
490 				for_each_fw_node(card, node0->ports[i],  in update_tree()
495 		node0 = fw_node(node0->link.next);  in update_tree()