99 static struct fw_node *fw_node_create(u32 sid, int port_count, int color)  in fw_node_create()
101 	struct fw_node *node;  in fw_node_create()
134 static void update_hop_count(struct fw_node *node)  in update_hop_count()
158 static inline struct fw_node *fw_node(struct list_head *l)  in fw_node()  function
160 	return list_entry(l, struct fw_node, link);  in fw_node()
170 static struct fw_node *build_tree(struct fw_card *card,  in build_tree()
173 	struct fw_node *node, *child, *local_node, *irm_node;  in build_tree()
220 		child = fw_node(h);  in build_tree()
261 				child = fw_node(child->link.next);  in build_tree()
309 				   struct fw_node * node,
310 				   struct fw_node * parent);
312 static void for_each_fw_node(struct fw_card *card, struct fw_node *root,  in for_each_fw_node()
316 	struct fw_node *node, *next, *child, *parent;  in for_each_fw_node()
347 			     struct fw_node *node, struct fw_node *parent)  in report_lost_node()
357 			      struct fw_node *node, struct fw_node *parent)  in report_found_node()
389 static void move_tree(struct fw_node *node0, struct fw_node *node1, int port)  in move_tree()
391 	struct fw_node *tree;  in move_tree()
409 static void update_tree(struct fw_card *card, struct fw_node *root)  in update_tree()
412 	struct fw_node *node0, *node1, *next1;  in update_tree()
420 	node0 = fw_node(list0.next);  in update_tree()
421 	node1 = fw_node(list1.next);  in update_tree()
483 		node0 = fw_node(node0->link.next);  in update_tree()
484 		next1 = fw_node(node1->link.next);  in update_tree()
509 	struct fw_node *local_node;  in fw_core_handle_bus_reset()