128 	INIT_LIST_HEAD(&node->link);  in fw_node_create()
173 	return list_entry(l, struct fw_node, link);  in fw_node()
274 				child = fw_node(child->link.next);  in build_tree()
293 		list_add_tail(&node->link, &stack);  in build_tree()
335 	list_add_tail(&root->link, &list);  in for_each_fw_node()
337 	list_for_each_entry(node, &list, link) {  in for_each_fw_node()
348 				list_add_tail(&child->link, &list);  in for_each_fw_node()
355 	list_for_each_entry_safe(node, next, &list, link)  in for_each_fw_node()
429 	list_add_tail(&card->local_node->link, &list0);  in update_tree()
431 	list_add_tail(&root->link, &list1);  in update_tree()
436 	while (&node0->link != &list0) {  in update_tree()
470 				list_add_tail(&node0->ports[i]->link, &list0);  in update_tree()
471 				list_add_tail(&node1->ports[i]->link, &list1);  in update_tree()
496 		node0 = fw_node(node0->link.next);  in update_tree()
497 		next1 = fw_node(node1->link.next);  in update_tree()