src/dpdk/drivers/net/ice/base/ice_sched.c
bool ice_sched_is_tree_balanced(struct ice_hw *hw, struct ice_sched_node *node)
{
	u8 i;

	/* start from the leaf node */
	for (i = 0; i < node->num_children; i++)
		/* Fail if node doesn't match with the SW DB
		 * this recursion is intentional, and wouldn't
		 * go more than 9 calls
		 */
		if (!ice_sched_is_tree_balanced(hw, node->children[i]))
			return false;

	return ice_sched_check_node(hw, node);
}
/**
 * ice_sched_is_tree_balanced - Check tree nodes are identical or not
 * @hw: pointer to the HW struct
 * @node: pointer to the ice_sched_node struct
 *
 * This function compares all the nodes for a given tree against HW DB nodes
 * This function needs to be called with the port_info->sched_lock held
 */
Check tree nodes are identical or not
@hw: pointer to the HW struct
@node: pointer to the ice_sched_node struct

This function compares all the nodes for a given tree against HW DB nodes
This function needs to be called with the port_info->sched_lock held
Check tree nodes are identical or not @hw : pointer to the HW struct @node : pointer to the ice_sched_node struct This function compares all the nodes for a given tree against HW DB nodes This function needs to be called with the port_info - > sched_lock held
bool ice_sched_is_tree_balanced(struct ice_hw *hw, struct ice_sched_node *node)
{
	u8 i;
	for (i = 0; i < node->num_children; i++)
		if (!ice_sched_is_tree_balanced(hw, node->children[i]))
			return false;
	return ice_sched_check_node(hw, node);
}
bool ice_sched_is_tree_balanced ( struct ice_hw * hw , struct ice_sched_node * node ) { u8 i ; for ( i = 0 ; i < node -> num_children ; i ++ ) if ( ! ice_sched_is_tree_balanced ( hw , node -> children [ i ] ) ) return false ; return ice_sched_check_node ( hw , node ) ; }
ice_sched_is_tree_balanced - Check tree nodes are identical or not
 @hw: pointer to the HW struct
 @node: pointer to the ice_sched_node struct
ice_sched_is_tree_balanced - Check tree nodes are identical or not @hw : pointer to the HW struct @node : pointer to the ice_sched_node struct
/* start from the leaf node */ /* Fail if node doesn't match with the SW DB
		 * this recursion is intentional, and wouldn't
		 * go more than 9 calls
		 */