111 static struct fw_node *fw_node_create(u32 sid, int port_count, int color)  in fw_node_create()
113 	struct fw_node *node;  in fw_node_create()
146 static void update_hop_count(struct fw_node *node)  in update_hop_count()
170 static inline struct fw_node *fw_node(struct list_head *l)  in fw_node()  function
172 	return list_entry(l, struct fw_node, link);  in fw_node()
182 static struct fw_node *build_tree(struct fw_card *card,  in build_tree()
185 	struct fw_node *node, *child, *local_node, *irm_node;  in build_tree()
232 		child = fw_node(h);  in build_tree()
273 				child = fw_node(child->link.next);  in build_tree()
321 				   struct fw_node * node,
322 				   struct fw_node * parent);
324 static void for_each_fw_node(struct fw_card *card, struct fw_node *root,  in for_each_fw_node()
328 	struct fw_node *node, *next, *child, *parent;  in for_each_fw_node()
359 			     struct fw_node *node, struct fw_node *parent)  in report_lost_node()
369 			      struct fw_node *node, struct fw_node *parent)  in report_found_node()
401 static void move_tree(struct fw_node *node0, struct fw_node *node1, int port)  in move_tree()
403 	struct fw_node *tree;  in move_tree()
421 static void update_tree(struct fw_card *card, struct fw_node *root)  in update_tree()
424 	struct fw_node *node0, *node1, *next1;  in update_tree()
432 	node0 = fw_node(list0.next);  in update_tree()
433 	node1 = fw_node(list1.next);  in update_tree()
495 		node0 = fw_node(node0->link.next);  in update_tree()
496 		next1 = fw_node(node1->link.next);  in update_tree()
521 	struct fw_node *local_node;  in fw_core_handle_bus_reset()