Lines Matching defs:child
130 * the hop count is the sum of the two biggest child depths plus 2.
132 * containted in a child tree, in which case the max hop count is just
133 * the max hop count of this child.
174 struct fw_node *node, *child, *local_node, *irm_node;
213 * start of the child nodes for this node.
221 child = fw_node(h);
255 node->ports[i] = child;
258 * child node.
260 child->ports[child->color] = node;
261 child->color = card->color;
262 child = fw_node(child->link.next);
279 /* Pop the child nodes off the stack and push the new node. */
317 struct fw_node *node, *next, *child, *parent;
329 child = node->ports[i];
330 if (!child)
332 if (child->color == card->color)
333 parent = child;
335 fw_node_get(child);
336 list_add_tail(&child->link, &list);