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