31 	root->children = devm_kcalloc(ice_hw_to_dev(hw), hw->max_children[0],  in ice_sched_add_root_node()
32 				      sizeof(*root->children), GFP_KERNEL);  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()
188 		node->children = devm_kcalloc(ice_hw_to_dev(hw),  in ice_sched_add_node()
190 					      sizeof(*node->children), GFP_KERNEL);  in ice_sched_add_node()
191 		if (!node->children) {  in ice_sched_add_node()
200 	parent->children[parent->num_children++] = node;  in ice_sched_add_node()
285 		if (pi->root->children[i]->tc_num == tc)  in ice_sched_get_tc_node()
286 			return pi->root->children[i];  in ice_sched_get_tc_node()
305 	/* Free the children before freeing up the parent node  in ice_free_sched_node()
307 	 * in the array. So always pick the first child if num children > 0  in ice_free_sched_node()
310 		ice_free_sched_node(pi, node->children[0]);  in ice_free_sched_node()
328 			if (parent->children[i] == node) {  in ice_free_sched_node()
330 					parent->children[j - 1] =  in ice_free_sched_node()
331 						parent->children[j];  in ice_free_sched_node()
351 	devm_kfree(ice_hw_to_dev(hw), node->children);  in ice_free_sched_node()
1019 	/* max children per node per layer */  in ice_sched_add_nodes_to_hw_layer()
1022 	/* current number of children + required nodes exceed max children */  in ice_sched_add_nodes_to_hw_layer()
1081 		/* Exceeded the max children */  in ice_sched_add_nodes_to_layer()
1171 		node = node->children[0];  in ice_rm_dflt_leaf_node()
1209 		node = node->children[0];  in ice_sched_rm_dflt_nodes()
1347 	/* max sibling group size of current layer refers to the max children  in ice_sched_query_res_alloc()
1349 	 * layer 1 node max children will be layer 2 max sibling group size  in ice_sched_query_res_alloc()
1350 	 * layer 2 node max children will be layer 3 max sibling group size  in ice_sched_query_res_alloc()
1352 	 * qgroup layer 7. Leaf node has no children.  in ice_sched_query_res_alloc()
1428 		struct ice_sched_node *child = base->children[i];  in ice_sched_find_node_in_subtree()
1471 	 * minimum number of children. This way all queue group nodes get  in ice_sched_get_free_qgrp()
1483 				/* break if it has no children, */  in ice_sched_get_free_qgrp()
1682 			parent = parent->children[0];  in ice_sched_add_vsi_child_nodes()
1709 		/* Add intermediate nodes if TC has no children and  in ice_sched_calc_vsi_support_nodes()
1715 			/* If intermediate nodes are reached max children  in ice_sched_calc_vsi_support_nodes()
1777 			parent = parent->children[0];  in ice_sched_add_vsi_support_nodes()
2009 		if (ice_sched_is_leaf_node_present(node->children[i]))  in ice_sched_is_leaf_node_present()
2016  * ice_sched_rm_vsi_cfg - remove the VSI and its children nodes
2021  * This function removes the VSI and its LAN or RDMA children nodes from the
2057 			if (vsi_node->children[j]->owner == owner) {  in ice_sched_rm_vsi_cfg()
2058 				ice_free_sched_node(pi, vsi_node->children[j]);  in ice_sched_rm_vsi_cfg()
2061 				 * children will be updated after node removal  in ice_sched_rm_vsi_cfg()
2068 		/* remove the VSI if it has no children */  in ice_sched_rm_vsi_cfg()
2089  * ice_rm_vsi_lan_cfg - remove VSI and its LAN children nodes
2093  * This function clears the VSI and its LAN children nodes from scheduler tree
2102  * ice_rm_vsi_rdma_cfg - remove VSI and its RDMA children nodes
2106  * This function clears the VSI and its RDMA children nodes from scheduler tree
2168 		parent = ice_sched_get_free_vsi_parent(hw, node->children[i],  in ice_sched_get_free_vsi_parent()
2194 	/* update the old parent children */  in ice_sched_update_parent()
2196 		if (old_parent->children[i] == node) {  in ice_sched_update_parent()
2198 				old_parent->children[j - 1] =  in ice_sched_update_parent()
2199 					old_parent->children[j];  in ice_sched_update_parent()
2205 	new_parent->children[new_parent->num_children++] = node;  in ice_sched_update_parent()
2311 						       agg_node->children[i],  in ice_sched_move_vsi_to_agg()
2334 			parent = parent->children[0];  in ice_sched_move_vsi_to_agg()
2403 			if (ice_sched_is_agg_inuse(pi, node->children[i]))  in ice_sched_is_agg_inuse()
2434 	/* Can't remove the aggregator node if it has children */  in ice_sched_rm_agg_cfg()
2591 			parent = parent->children[0];  in ice_sched_add_agg_cfg()
3420 		return node->children[0];  in ice_sched_get_srl_node()