rl_sla
struct rl_sla **sla_type_arr = NULL;
struct rl_sla **sla_type_arr = NULL;
static struct rl_sla *find_parent(struct adf_rl *rl_data,
struct rl_sla *root = NULL;
struct rl_sla *parent_sla;
struct rl_sla ***sla_arr)
static int prepare_rp_ids(struct adf_accel_dev *accel_dev, struct rl_sla *sla,
static void mark_rps_usage(struct rl_sla *sla, bool *rp_in_use, bool used)
struct rl_sla *sla, bool clear)
struct rl_sla *sla, bool clear)
struct rl_sla *sla, bool clear)
struct rl_sla *sla, bool clear_assignment)
struct rl_sla *sla_parent, u32 sla_cir,
struct rl_sla *sla)
static bool is_enough_budget(struct adf_rl *rl_data, struct rl_sla *sla,
struct rl_sla *parent = sla->parent;
static void update_budget(struct rl_sla *sla, u32 old_cir, bool is_update)
static int get_next_free_node_id(struct adf_rl *rl_data, struct rl_sla *sla)
struct rl_sla **sla_list;
struct rl_sla **sla_out)
struct rl_sla *sla;
static void clear_sla(struct adf_rl *rl_data, struct rl_sla *sla)
struct rl_sla **sla_type_arr = NULL;
struct rl_sla **sla_type_arr = NULL;
struct rl_sla *sla = NULL;
struct rl_sla *sla;
struct rl_sla *sla;
struct rl_sla *sla = NULL;
struct rl_sla *sla;
struct rl_sla *sla[RL_NODES_CNT_MAX];
struct rl_sla *root[RL_ROOT_MAX];
struct rl_sla *cluster[RL_CLUSTER_MAX];
struct rl_sla *leaf[RL_LEAF_MAX];
struct rl_sla *parent;
struct rl_sla ***sla_arr);
prep_admin_req_msg(struct rl_sla *sla, dma_addr_t dma_addr,
prep_admin_req_params(struct adf_accel_dev *accel_dev, struct rl_sla *sla,
struct rl_sla *sla, bool is_update)
struct rl_sla *sla, bool is_update);