Lines Matching full:ports
103 node = kzalloc(struct_size(node, ports, port_count), GFP_ATOMIC); in fw_node_create()
141 if (node->ports[i] == NULL) in update_hop_count()
144 if (node->ports[i]->max_hops > max_child_hops) in update_hop_count()
145 max_child_hops = node->ports[i]->max_hops; in update_hop_count()
147 if (node->ports[i]->max_depth > depths[0]) { in update_hop_count()
149 depths[0] = node->ports[i]->max_depth; in update_hop_count()
150 } else if (node->ports[i]->max_depth > depths[1]) in update_hop_count()
151 depths[1] = node->ports[i]->max_depth; in update_hop_count()
244 * node->ports array where the parent in build_tree()
254 node->ports[i] = child; in build_tree()
259 child->ports[child->color] = node; in build_tree()
328 child = node->ports[i]; in for_each_fw_node()
394 tree = node1->ports[port]; in move_tree()
395 node0->ports[port] = tree; in move_tree()
397 if (tree->ports[i] == node1) { in move_tree()
398 tree->ports[i] = node0; in move_tree()
449 if (node0->ports[i] && node1->ports[i]) { in update_tree()
455 if (node0->ports[i]->color == card->color) in update_tree()
457 list_add_tail(&node0->ports[i]->link, &list0); in update_tree()
458 list_add_tail(&node1->ports[i]->link, &list1); in update_tree()
459 } else if (node0->ports[i]) { in update_tree()
467 for_each_fw_node(card, node0->ports[i], in update_tree()
469 node0->ports[i] = NULL; in update_tree()
470 } else if (node1->ports[i]) { in update_tree()
478 for_each_fw_node(card, node0->ports[i], in update_tree()