intel/ice/ice_sched.c

1451  * @qgrp_node: first queue group node identified for scanning
1455  * qgrp_node and its siblings for the queue group with the fewest number
1461 			struct ice_sched_node *qgrp_node, u8 owner)
1466 	if (!qgrp_node)
1467 		return qgrp_node;
1468 	min_children = qgrp_node->num_children;
1470 		return qgrp_node;
1471 	min_qgrp = qgrp_node;
1477 	while (qgrp_node) {
1479 		if (ice_sched_find_node_in_subtree(pi->hw, vsi_node, qgrp_node))
1480 			if (qgrp_node->num_children < min_children &&
1481 			    qgrp_node->owner == owner) {
1483 				min_qgrp = qgrp_node;
1489 		qgrp_node = qgrp_node->sibling;
1507 	struct ice_sched_node *vsi_node, *qgrp_node;
1531 	qgrp_node = ice_sched_get_first_node(pi, vsi_node, qgrp_layer);
1532 	while (qgrp_node) {
1534 		if (ice_sched_find_node_in_subtree(pi->hw, vsi_node, qgrp_node))
1535 			if (qgrp_node->num_children < max_children &&
1536 			    qgrp_node->owner == owner)
1538 		qgrp_node = qgrp_node->sibling;
1542 	return ice_sched_get_free_qgrp(pi, vsi_node, qgrp_node, owner);