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()
185 		node->children = devm_kcalloc(ice_hw_to_dev(hw),  in ice_sched_add_node()
188 		if (!node->children) {  in ice_sched_add_node()
197 	parent->children[parent->num_children++] = node;  in ice_sched_add_node()
290 		if (pi->root->children[i]->tc_num == tc)  in ice_sched_get_tc_node()
291 			return pi->root->children[i];  in ice_sched_get_tc_node()
310 	/* Free the children before freeing up the parent node  in ice_free_sched_node()
312 	 * in the array. So always pick the first child if num children > 0  in ice_free_sched_node()
315 		ice_free_sched_node(pi, node->children[0]);  in ice_free_sched_node()
333 			if (parent->children[i] == node) {  in ice_free_sched_node()
335 					parent->children[j - 1] =  in ice_free_sched_node()
336 						parent->children[j];  in ice_free_sched_node()
356 	/* leaf nodes have no children */  in ice_free_sched_node()
357 	if (node->children)  in ice_free_sched_node()
358 		devm_kfree(ice_hw_to_dev(hw), node->children);  in ice_free_sched_node()
938 	/* max children per node per layer */  in ice_sched_add_nodes_to_layer()
941 	/* current number of children + required nodes exceed max children ? */  in ice_sched_add_nodes_to_layer()
1043 		node = node->children[0];  in ice_rm_dflt_leaf_node()
1081 		node = node->children[0];  in ice_sched_rm_dflt_nodes()
1219 	/* max sibling group size of current layer refers to the max children  in ice_sched_query_res_alloc()
1221 	 * layer 1 node max children will be layer 2 max sibling group size  in ice_sched_query_res_alloc()
1222 	 * layer 2 node max children will be layer 3 max sibling group size  in ice_sched_query_res_alloc()
1224 	 * qgroup layer 7. Leaf node has no children.  in ice_sched_query_res_alloc()
1261 		struct ice_sched_node *child = base->children[i];  in ice_sched_find_node_in_subtree()
1304 	 * minimum number of children. This way all queue group nodes get  in ice_sched_get_free_qgrp()
1316 				/* break if it has no children, */  in ice_sched_get_free_qgrp()
1475 			parent = parent->children[0];  in ice_sched_add_vsi_child_nodes()
1502 		/* Add intermediate nodes if TC has no children and  in ice_sched_calc_vsi_support_nodes()
1508 			/* If intermediate nodes are reached max children  in ice_sched_calc_vsi_support_nodes()
1570 			parent = parent->children[0];  in ice_sched_add_vsi_support_nodes()
1790 		if (ice_sched_is_leaf_node_present(node->children[i]))  in ice_sched_is_leaf_node_present()
1797  * ice_sched_rm_vsi_cfg - remove the VSI and its children nodes
1802  * This function removes the VSI and its LAN or RDMA children nodes from the
1839 			if (vsi_node->children[j]->owner == owner) {  in ice_sched_rm_vsi_cfg()
1840 				ice_free_sched_node(pi, vsi_node->children[j]);  in ice_sched_rm_vsi_cfg()
1843 				 * children will be updated after node removal  in ice_sched_rm_vsi_cfg()
1850 		/* remove the VSI if it has no children */  in ice_sched_rm_vsi_cfg()
1869  * ice_rm_vsi_lan_cfg - remove VSI and its LAN children nodes
1873  * This function clears the VSI and its LAN children nodes from scheduler tree
2401 		return node->children[0];  in ice_sched_get_srl_node()