Lines Matching defs:depths
130 * the hop count is the sum of the two biggest child depths plus 2.
137 int depths[2] = { -1, -1 };
148 if (node->ports[i]->max_depth > depths[0]) {
149 depths[1] = depths[0];
150 depths[0] = node->ports[i]->max_depth;
151 } else if (node->ports[i]->max_depth > depths[1])
152 depths[1] = node->ports[i]->max_depth;
155 node->max_depth = depths[0] + 1;
156 node->max_hops = max(max_child_hops, depths[0] + depths[1] + 2);