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()
136 	parent->children[parent->num_children++] = node;  in ice_sched_add_node()
223 	for (i = 0; i < parent->num_children; i++) {  in ice_sched_get_first_node()
251 	for (i = 0; i < pi->root->num_children; i++)  in ice_sched_get_tc_node()
276 	while (node->num_children)  in ice_free_sched_node()
298 		for (i = 0; i < parent->num_children; i++)  in ice_free_sched_node()
300 				for (j = i + 1; j < parent->num_children; j++)  in ice_free_sched_node()
303 				parent->num_children--;  in ice_free_sched_node()
767 	if ((parent->num_children + num_nodes) > max_child_nodes) {  in ice_sched_add_nodes_to_layer()
773 		if (parent->num_children < max_child_nodes) {  in ice_sched_add_nodes_to_layer()
774 			new_num_nodes = max_child_nodes - parent->num_children;  in ice_sched_add_nodes_to_layer()
874 	for (i = 0; i < pi->root->num_children; i++) {  in ice_sched_get_num_nodes_per_layer()
939 		if (!node->num_children)  in ice_rm_dflt_leaf_node()
978 		if (!node->num_children)  in ice_sched_rm_dflt_nodes()
1168 	for (i = 0; i < base->num_children; i++) {  in ice_sched_find_node_in_subtree()
1222 			if (qgrp_node->num_children < max_children &&  in ice_sched_get_free_qparent()
1377 			if (node->owner == owner && !node->num_children) {  in ice_sched_rm_vsi_child_nodes()
1409 		if (!tc_node->num_children || i == vsil) {  in ice_sched_calc_vsi_support_nodes()
1420 				if (node->num_children < max_child)  in ice_sched_calc_vsi_support_nodes()