Home
last modified time | relevance | path

Searched refs:depths (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-5.10/drivers/firewire/
H A Dcore-topology.c129 * the hop count is the sum of the two biggest child depths plus 2.
136 int depths[2] = { -1, -1 }; in update_hop_count() local
147 if (node->ports[i]->max_depth > depths[0]) { in update_hop_count()
148 depths[1] = 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()
154 node->max_depth = depths[0] + 1; in update_hop_count()
155 node->max_hops = max(max_child_hops, depths[ in update_hop_count()
[all...]
/kernel/linux/linux-6.6/drivers/firewire/
H A Dcore-topology.c130 * the hop count is the sum of the two biggest child depths plus 2.
137 int depths[2] = { -1, -1 }; in update_hop_count() local
148 if (node->ports[i]->max_depth > depths[0]) { in update_hop_count()
149 depths[1] = depths[0]; in update_hop_count()
150 depths[0] = node->ports[i]->max_depth; in update_hop_count()
151 } else if (node->ports[i]->max_depth > depths[1]) in update_hop_count()
152 depths[1] = node->ports[i]->max_depth; in update_hop_count()
155 node->max_depth = depths[0] + 1; in update_hop_count()
156 node->max_hops = max(max_child_hops, depths[ in update_hop_count()
[all...]

Completed in 2 milliseconds