Lines Matching defs:tree
125 * setting the gap count. As we build the tree bottom up in
132 * containted in a child tree, in which case the max hop count is just
165 * This function builds the tree representation of the topology given
167 * of the tree, the function checks that the self IDs are valid and
389 struct fw_node *tree;
392 tree = node1->ports[port];
393 node0->ports[port] = tree;
394 for (i = 0; i < tree->port_count; i++) {
395 if (tree->ports[i] == node1) {
396 tree->ports[i] = node0;
403 * Compare the old topology tree for card with the new one specified by root.
405 * Update the nodes in the card topology tree as we go.
472 * the tree and queue FW_NODE_CREATED