83 	struct rl_sla *sla;  in validate_sla_id()
120 static struct rl_sla *find_parent(struct adf_rl *rl_data,  in find_parent()
124 	struct rl_sla *root = NULL;  in find_parent()
125 	struct rl_sla *parent_sla;  in find_parent()
194 			       struct rl_sla ***sla_arr)  in adf_rl_get_sla_arr_of_type()
243 static int prepare_rp_ids(struct adf_accel_dev *accel_dev, struct rl_sla *sla,  in prepare_rp_ids()
281 static void mark_rps_usage(struct rl_sla *sla, bool *rp_in_use, bool used)  in mark_rps_usage()
293 			       struct rl_sla *sla, bool clear)  in assign_rps_to_leaf()
309 				   struct rl_sla *sla, bool clear)  in assign_leaf_to_cluster()
323 				   struct rl_sla *sla, bool clear)  in assign_cluster_to_root()
337 				  struct rl_sla *sla, bool clear_assignment)  in assign_node_to_parent()
369 				  struct rl_sla *sla_parent, u32 sla_cir,  in can_parent_afford_sla()
396 				   struct rl_sla *sla)  in can_node_afford_update()
411 static bool is_enough_budget(struct adf_rl *rl_data, struct rl_sla *sla,  in is_enough_budget()
416 	struct rl_sla *parent = sla->parent;  in is_enough_budget()
448 static void update_budget(struct rl_sla *sla, u32 old_cir, bool is_update)  in update_budget()
509 static int get_next_free_node_id(struct adf_rl *rl_data, struct rl_sla *sla)  in get_next_free_node_id()
513 	struct rl_sla **sla_list;  in get_next_free_node_id()
650 			     struct rl_sla **sla_out)  in add_new_sla_entry()
653 	struct rl_sla *sla;  in add_new_sla_entry()
764 static void clear_sla(struct adf_rl *rl_data, struct rl_sla *sla)  in clear_sla()
767 	struct rl_sla **sla_type_arr = NULL;  in clear_sla()
825 	struct rl_sla **sla_type_arr = NULL;  in add_update_sla()
826 	struct rl_sla *sla = NULL;  in add_update_sla()
942 	struct rl_sla *sla;  in adf_rl_get_sla()
987 	struct rl_sla *sla = NULL;  in adf_rl_get_capability_remaining()
1027 	struct rl_sla *sla;  in adf_rl_remove_sla()
1060 	struct rl_sla **sla_type_arr = NULL;  in adf_rl_remove_sla_all()