Lines Matching defs:qgrp_node

1562  * @qgrp_node: first queue group node identified for scanning
1566  * qgrp_node and its siblings for the queue group with the fewest number
1572 			struct ice_sched_node *qgrp_node, u8 owner)
1577 	if (!qgrp_node)
1578 		return qgrp_node;
1579 	min_children = qgrp_node->num_children;
1581 		return qgrp_node;
1582 	min_qgrp = qgrp_node;
1588 	while (qgrp_node) {
1590 		if (ice_sched_find_node_in_subtree(pi->hw, vsi_node, qgrp_node))
1591 			if (qgrp_node->num_children < min_children &&
1592 			    qgrp_node->owner == owner) {
1594 				min_qgrp = qgrp_node;
1600 		qgrp_node = qgrp_node->sibling;
1618 	struct ice_sched_node *vsi_node, *qgrp_node;
1642 	qgrp_node = ice_sched_get_first_node(pi, vsi_node, qgrp_layer);
1643 	while (qgrp_node) {
1645 		if (ice_sched_find_node_in_subtree(pi->hw, vsi_node, qgrp_node))
1646 			if (qgrp_node->num_children < max_children &&
1647 			    qgrp_node->owner == owner)
1649 		qgrp_node = qgrp_node->sibling;
1653 	return ice_sched_get_free_qgrp(pi, vsi_node, qgrp_node, owner);