387 static void move_tree(struct fw_node *node0, struct fw_node *node1, int port)  in move_tree()  argument
393 	node0->ports[port] = tree;  in move_tree()
396 			tree->ports[i] = node0;  in move_tree()
410 	struct fw_node *node0, *node1, *next1;  in update_tree()  local
418 	node0 = fw_node(list0.next);  in update_tree()
421 	while (&node0->link != &list0) {  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()
433 		node0->node_id = node1->node_id;  in update_tree()
434 		node0->color = card->color;  in update_tree()
435 		node0->link_on = node1->link_on;  in update_tree()
436 		node0->initiated_reset = node1->initiated_reset;  in update_tree()
437 		node0->max_hops = node1->max_hops;  in update_tree()
439 		fw_node_event(card, node0, event);  in update_tree()
442 			card->root_node = node0;  in update_tree()
444 			card->irm_node = node0;  in update_tree()
446 		for (i = 0; i < node0->port_count; i++) {  in update_tree()
447 			if (node0->ports[i] && node1->ports[i]) {  in update_tree()
453 				if (node0->ports[i]->color == card->color)  in update_tree()
455 				list_add_tail(&node0->ports[i]->link, &list0);  in update_tree()
457 			} else if (node0->ports[i]) {  in update_tree()
465 				for_each_fw_node(card, node0->ports[i],  in update_tree()
467 				node0->ports[i] = NULL;  in update_tree()
475 				move_tree(node0, node1, i);  in update_tree()
476 				for_each_fw_node(card, node0->ports[i],  in update_tree()
481 		node0 = fw_node(node0->link.next);  in update_tree()