Lines Matching refs:num_children
65 if (!start_node->num_children || in ice_sched_find_node_by_teid()
71 for (i = 0; i < start_node->num_children; i++) in ice_sched_find_node_by_teid()
76 for (i = 0; i < start_node->num_children; i++) { in ice_sched_find_node_by_teid()
202 parent->children[parent->num_children++] = node; in ice_sched_add_node()
294 for (i = 0; i < pi->root->num_children; i++) in ice_sched_get_tc_node()
319 while (node->num_children) in ice_free_sched_node()
337 for (i = 0; i < parent->num_children; i++) in ice_free_sched_node()
339 for (j = i + 1; j < parent->num_children; j++) in ice_free_sched_node()
342 parent->num_children--; in ice_free_sched_node()
1029 if ((parent->num_children + num_nodes) > max_child_nodes) { in ice_sched_add_nodes_to_hw_layer()
1090 if (parent->num_children < max_child_nodes) { in ice_sched_add_nodes_to_layer()
1091 new_num_nodes = max_child_nodes - parent->num_children; in ice_sched_add_nodes_to_layer()
1179 if (!node->num_children) in ice_rm_dflt_leaf_node()
1217 if (!node->num_children) in ice_sched_rm_dflt_nodes()
1438 for (i = 0; i < base->num_children; i++) { in ice_sched_find_node_in_subtree()
1477 min_children = qgrp_node->num_children; in ice_sched_get_free_qgrp()
1489 if (qgrp_node->num_children < min_children && in ice_sched_get_free_qgrp()
1493 min_children = min_qgrp->num_children; in ice_sched_get_free_qgrp()
1537 if (qgrp_node->num_children < max_children && in ice_sched_get_free_qparent()
1716 if (!tc_node->num_children || i == vsil) { in ice_sched_calc_vsi_support_nodes()
1725 if (node->num_children < pi->hw->max_children[i]) in ice_sched_calc_vsi_support_nodes()
2012 for (i = 0; i < node->num_children; i++) in ice_sched_is_leaf_node_present()
2060 while (j < vsi_node->num_children) { in ice_sched_rm_vsi_cfg()
2073 if (!vsi_node->num_children) { in ice_sched_rm_vsi_cfg()
2158 return (node->num_children < hw->max_children[l]) ? node : NULL; in ice_sched_get_free_vsi_parent()
2163 if (node->num_children < hw->max_children[l]) in ice_sched_get_free_vsi_parent()
2169 for (i = 0; i < node->num_children; i++) { in ice_sched_get_free_vsi_parent()
2199 for (i = 0; i < old_parent->num_children; i++) in ice_sched_update_parent()
2201 for (j = i + 1; j < old_parent->num_children; j++) in ice_sched_update_parent()
2204 old_parent->num_children--; in ice_sched_update_parent()
2209 new_parent->children[new_parent->num_children++] = node; in ice_sched_update_parent()
2240 if (parent->num_children + num_items > in ice_sched_move_nodes()
2321 for (i = 0; i < agg_node->num_children; i++) { in ice_sched_move_vsi_to_agg()
2414 for (i = 0; i < node->num_children; i++) in ice_sched_is_agg_inuse()
2419 return node->num_children ? true : false; in ice_sched_is_agg_inuse()
2459 if (parent->num_children > 1) in ice_sched_rm_agg_cfg()
2570 if (parent->num_children < hw->max_children[i]) in ice_sched_add_agg_cfg()
3769 node->num_children == 1) || in ice_sched_validate_srl_node()
3771 (node->parent && node->parent->num_children == 1))) in ice_sched_validate_srl_node()