Lines Matching full:ports
30 node = kzalloc(struct_size(node, ports, port_count), GFP_ATOMIC); in fw_node_create()
69 if (node->ports[i] == NULL) in update_hop_count()
72 if (node->ports[i]->max_hops > max_child_hops) in update_hop_count()
73 max_child_hops = node->ports[i]->max_hops; in update_hop_count()
75 if (node->ports[i]->max_depth > depths[0]) { in update_hop_count()
77 depths[0] = node->ports[i]->max_depth; in update_hop_count()
78 } else if (node->ports[i]->max_depth > depths[1]) in update_hop_count()
79 depths[1] = node->ports[i]->max_depth; in update_hop_count()
204 // the node->ports array where the parent node should be. Later, in build_tree()
211 node->ports[port_index] = child; in build_tree()
213 child->ports[child->color] = node; in build_tree()
279 child = node->ports[i]; in for_each_fw_node()
342 tree = node1->ports[port]; in move_tree()
343 node0->ports[port] = tree; in move_tree()
345 if (tree->ports[i] == node1) { in move_tree()
346 tree->ports[i] = node0; in move_tree()
397 if (node0->ports[i] && node1->ports[i]) { in update_tree()
403 if (node0->ports[i]->color == card->color) in update_tree()
405 list_add_tail(&node0->ports[i]->link, &list0); in update_tree()
406 list_add_tail(&node1->ports[i]->link, &list1); in update_tree()
407 } else if (node0->ports[i]) { in update_tree()
415 for_each_fw_node(card, node0->ports[i], in update_tree()
417 node0->ports[i] = NULL; in update_tree()
418 } else if (node1->ports[i]) { in update_tree()
426 for_each_fw_node(card, node0->ports[i], in update_tree()