31 	root->children = devm_kcalloc(ice_hw_to_dev(hw), hw->max_children[0],  in ice_sched_add_root_node()
33 	if (!root->children) {  in ice_sched_add_root_node()
63 	/* The node has no children or is at the max layer */  in ice_sched_find_node_by_teid()
69 	/* Check if TEID matches to any of the children nodes */  in ice_sched_find_node_by_teid()
71 		if (ICE_TXSCHED_GET_NODE_TEID(start_node->children[i]) == teid)  in ice_sched_find_node_by_teid()
72 			return start_node->children[i];  in ice_sched_find_node_by_teid()
78 		tmp = ice_sched_find_node_by_teid(start_node->children[i],  in ice_sched_find_node_by_teid()
184 		node->children = devm_kcalloc(ice_hw_to_dev(hw),  in ice_sched_add_node()
187 		if (!node->children) {  in ice_sched_add_node()
196 	parent->children[parent->num_children++] = node;  in ice_sched_add_node()
289 		if (pi->root->children[i]->tc_num == tc)  in ice_sched_get_tc_node()
290 			return pi->root->children[i];  in ice_sched_get_tc_node()
309 	/* Free the children before freeing up the parent node  in ice_free_sched_node()
311 	 * in the array. So always pick the first child if num children > 0  in ice_free_sched_node()
314 		ice_free_sched_node(pi, node->children[0]);  in ice_free_sched_node()
332 			if (parent->children[i] == node) {  in ice_free_sched_node()
334 					parent->children[j - 1] =  in ice_free_sched_node()
335 						parent->children[j];  in ice_free_sched_node()
355 	/* leaf nodes have no children */  in ice_free_sched_node()
356 	if (node->children)  in ice_free_sched_node()
357 		devm_kfree(ice_hw_to_dev(hw), node->children);  in ice_free_sched_node()
994 	/* max children per node per layer */  in ice_sched_add_nodes_to_hw_layer()
997 	/* current number of children + required nodes exceed max children */  in ice_sched_add_nodes_to_hw_layer()
1057 		/* Exceeded the max children */  in ice_sched_add_nodes_to_layer()
1151 		node = node->children[0];  in ice_rm_dflt_leaf_node()
1189 		node = node->children[0];  in ice_sched_rm_dflt_nodes()
1327 	/* max sibling group size of current layer refers to the max children  in ice_sched_query_res_alloc()
1329 	 * layer 1 node max children will be layer 2 max sibling group size  in ice_sched_query_res_alloc()
1330 	 * layer 2 node max children will be layer 3 max sibling group size  in ice_sched_query_res_alloc()
1332 	 * qgroup layer 7. Leaf node has no children.  in ice_sched_query_res_alloc()
1409 		struct ice_sched_node *child = base->children[i];  in ice_sched_find_node_in_subtree()
1452 	 * minimum number of children. This way all queue group nodes get  in ice_sched_get_free_qgrp()
1464 				/* break if it has no children, */  in ice_sched_get_free_qgrp()
1655 			parent = parent->children[0];  in ice_sched_add_vsi_child_nodes()
1682 		/* Add intermediate nodes if TC has no children and  in ice_sched_calc_vsi_support_nodes()
1688 			/* If intermediate nodes are reached max children  in ice_sched_calc_vsi_support_nodes()
1749 			parent = parent->children[0];  in ice_sched_add_vsi_support_nodes()
1981 		if (ice_sched_is_leaf_node_present(node->children[i]))  in ice_sched_is_leaf_node_present()
1988  * ice_sched_rm_vsi_cfg - remove the VSI and its children nodes
1993  * This function removes the VSI and its LAN or RDMA children nodes from the
2029 			if (vsi_node->children[j]->owner == owner) {  in ice_sched_rm_vsi_cfg()
2030 				ice_free_sched_node(pi, vsi_node->children[j]);  in ice_sched_rm_vsi_cfg()
2033 				 * children will be updated after node removal  in ice_sched_rm_vsi_cfg()
2040 		/* remove the VSI if it has no children */  in ice_sched_rm_vsi_cfg()
2061  * ice_rm_vsi_lan_cfg - remove VSI and its LAN children nodes
2065  * This function clears the VSI and its LAN children nodes from scheduler tree
2074  * ice_rm_vsi_rdma_cfg - remove VSI and its RDMA children nodes
2078  * This function clears the VSI and its RDMA children nodes from scheduler tree
2140 		parent = ice_sched_get_free_vsi_parent(hw, node->children[i],  in ice_sched_get_free_vsi_parent()
2166 	/* update the old parent children */  in ice_sched_update_parent()
2168 		if (old_parent->children[i] == node) {  in ice_sched_update_parent()
2170 				old_parent->children[j - 1] =  in ice_sched_update_parent()
2171 					old_parent->children[j];  in ice_sched_update_parent()
2177 	new_parent->children[new_parent->num_children++] = node;  in ice_sched_update_parent()
2291 						       agg_node->children[i],  in ice_sched_move_vsi_to_agg()
2314 			parent = parent->children[0];  in ice_sched_move_vsi_to_agg()
2383 			if (ice_sched_is_agg_inuse(pi, node->children[i]))  in ice_sched_is_agg_inuse()
2414 	/* Can't remove the aggregator node if it has children */  in ice_sched_rm_agg_cfg()
2571 			parent = parent->children[0];  in ice_sched_add_agg_cfg()
3365 		return node->children[0];  in ice_sched_get_srl_node()