sched_entity
struct drm_sched_entity sched_entity;
ret = drm_sched_entity_init(ðosu_priv->sched_entity,
struct drm_sched_entity *entity = ðosu_priv->sched_entity;
&file_priv->sched_entity,
struct drm_sched_entity sched_entity;
ret = drm_sched_entity_init(&rocket_priv->sched_entity,
struct drm_sched_entity *entity = &rocket_priv->sched_entity;
&file_priv->sched_entity,
drm_sched_entity_destroy(&ctx->sched_entity[i]);
drm_sched_entity_init(&ctx->sched_entity[i],
struct drm_sched_entity sched_entity[ETNA_MAX_PIPES];
&ctx->sched_entity[args->pipe],
struct drm_sched_entity sched_entity;
drm_sched_entity_to_mock_entity(struct drm_sched_entity *sched_entity)
return container_of(sched_entity, struct drm_mock_sched_entity, base);
drm_sched_entity_init(&v3d_priv->sched_entity[i],
drm_sched_entity_destroy(&v3d_priv->sched_entity[q]);
if (job && job->base.entity == &v3d_priv->sched_entity[q]) {
struct drm_sched_entity sched_entity[V3D_MAX_QUEUES];
ret = drm_sched_job_init(&job->base, &v3d_priv->sched_entity[queue],
struct sched_entity *parent;
struct sched_entity se;
TP_PROTO(struct sched_entity *se),
TP_PROTO(struct sched_entity *se),
struct sched_entity *curr = p->se.cfs_rq->curr;
struct sched_entity *curr = task_rq(p)->cfs.curr;
root_task_group.se = (struct sched_entity **)ptr;
struct sched_entity *se = tg->se[cpu];
struct sched_entity *last, *first, *root;
static struct sched_entity *__pick_eevdf(struct cfs_rq *cfs_rq, bool protect)
struct sched_entity *se = __pick_first_entity(cfs_rq);
struct sched_entity *curr = cfs_rq->curr;
struct sched_entity *best = NULL;
static struct sched_entity *pick_eevdf(struct cfs_rq *cfs_rq)
struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq)
static void clear_buddies(struct cfs_rq *cfs_rq, struct sched_entity *se);
static bool update_deadline(struct cfs_rq *cfs_rq, struct sched_entity *se)
void init_entity_runnable_average(struct sched_entity *se)
struct sched_entity *se = &p->se;
static s64 update_se(struct rq *rq, struct sched_entity *se)
static void set_next_buddy(struct sched_entity *se);
struct sched_entity *curr = cfs_rq->curr;
__entity_slice_used(struct sched_entity *se, int min_nr_tasks)
static void se_fi_update(const struct sched_entity *se, unsigned int fi_seq,
struct sched_entity *se = &p->se;
const struct sched_entity *sea = &a->se;
const struct sched_entity *seb = &b->se;
update_stats_wait_start_fair(struct cfs_rq *cfs_rq, struct sched_entity *se)
struct sched_entity *se = &curr->se;
static void propagate_entity_cfs_rq(struct sched_entity *se)
static void propagate_entity_cfs_rq(struct sched_entity *se) { }
static void detach_entity_cfs_rq(struct sched_entity *se)
static void attach_entity_cfs_rq(struct sched_entity *se)
struct sched_entity *se = &p->se;
struct sched_entity *se = &p->se;
update_stats_wait_end_fair(struct cfs_rq *cfs_rq, struct sched_entity *se)
struct sched_entity *se = &p->se;
struct sched_entity *se = &p->se;
struct sched_entity *se;
struct sched_entity *se;
struct sched_entity *se = tg->se[cpu];
struct sched_entity *se, int cpu,
struct sched_entity *parent)
update_stats_enqueue_sleeper_fair(struct cfs_rq *cfs_rq, struct sched_entity *se)
struct sched_entity *se = tg->se[i];
struct sched_entity *se = tg->se[i];
struct sched_entity *se = &task->se;
update_stats_enqueue_fair(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
update_stats_dequeue_fair(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
update_stats_curr_start(struct cfs_rq *cfs_rq, struct sched_entity *se)
static inline u64 calc_delta_fair(u64 delta, struct sched_entity *se)
account_entity_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se)
account_entity_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se)
enqueue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se)
dequeue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se)
static void place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags);
static void reweight_entity(struct cfs_rq *cfs_rq, struct sched_entity *se,
struct sched_entity *se = &p->se;
static void update_cfs_group(struct sched_entity *se)
static inline void update_cfs_group(struct sched_entity *se)
is_same_group(struct sched_entity *se, struct sched_entity *pse)
static inline struct sched_entity *parent_entity(const struct sched_entity *se)
find_matching_se(struct sched_entity **se, struct sched_entity **pse)
void set_task_rq_fair(struct sched_entity *se,
update_tg_cfs_util(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq)
update_tg_cfs_runnable(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq)
update_tg_cfs_load(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq)
static inline int propagate_entity_load_avg(struct sched_entity *se)
static inline bool skip_blocked_update(struct sched_entity *se)
static inline int propagate_entity_load_avg(struct sched_entity *se)
static inline void migrate_se_pelt_lag(struct sched_entity *se)
static void migrate_se_pelt_lag(struct sched_entity *se) {}
static int se_is_idle(struct sched_entity *se)
static void attach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se)
static void detach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se)
static inline void update_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
static void sync_entity_load_avg(struct sched_entity *se)
static void remove_entity_load_avg(struct sched_entity *se)
static inline struct sched_entity *parent_entity(struct sched_entity *se)
find_matching_se(struct sched_entity **se, struct sched_entity **pse)
static int se_is_idle(struct sched_entity *se)
struct sched_entity *se = &p->se;
place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
struct sched_entity *curr = cfs_rq->curr;
requeue_delayed_entity(struct sched_entity *se);
enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
static void __clear_buddies_next(struct sched_entity *se)
static void clear_buddies(struct cfs_rq *cfs_rq, struct sched_entity *se)
static void set_delayed(struct sched_entity *se)
static void clear_delayed(struct sched_entity *se)
static inline void finish_delayed_dequeue_entity(struct sched_entity *se)
dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, bool first)
static int dequeue_entities(struct rq *rq, struct sched_entity *se, int flags);
static struct sched_entity *
struct sched_entity *se;
static void put_prev_entity(struct cfs_rq *cfs_rq, struct sched_entity *prev)
entity_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr, int queued)
struct sched_entity *se;
static inline bool entity_before(const struct sched_entity *a,
const struct sched_entity *b)
struct sched_entity *se = cfs_rq->tg->se[cpu_of(rq)];
static inline s64 entity_key(struct cfs_rq *cfs_rq, struct sched_entity *se)
rb_entry((node), struct sched_entity, run_node)
sum_w_vruntime_add(struct cfs_rq *cfs_rq, struct sched_entity *se)
struct sched_entity *se = &p->se;
sum_w_vruntime_sub(struct cfs_rq *cfs_rq, struct sched_entity *se)
requeue_delayed_entity(struct sched_entity *se)
struct sched_entity *se = &p->se;
static int dequeue_entities(struct rq *rq, struct sched_entity *se, int flags)
struct sched_entity *curr = cfs_rq->curr;
static void update_entity_lag(struct cfs_rq *cfs_rq, struct sched_entity *se)
struct sched_entity *curr = cfs_rq->curr;
int entity_eligible(struct cfs_rq *cfs_rq, struct sched_entity *se)
struct sched_entity *root = __pick_root_entity(cfs_rq);
struct sched_entity *curr = cfs_rq->curr;
struct sched_entity *root = __pick_root_entity(cfs_rq);
struct sched_entity *curr = cfs_rq->curr;
static inline void __min_vruntime_update(struct sched_entity *se, struct rb_node *node)
struct sched_entity *rse = __node_2_se(node);
static inline void __min_slice_update(struct sched_entity *se, struct rb_node *node)
struct sched_entity *se = &p->se;
struct sched_entity *rse = __node_2_se(node);
struct sched_entity *se = &p->se;
static inline void __max_slice_update(struct sched_entity *se, struct rb_node *node)
static void set_next_buddy(struct sched_entity *se)
struct sched_entity *pse, struct sched_entity *se)
struct sched_entity *rse = __node_2_se(node);
struct sched_entity *pse, struct sched_entity *se)
struct sched_entity *se = &donor->se, *pse = &p->se;
static inline bool min_vruntime_update(struct sched_entity *se, bool exit)
struct sched_entity *se;
struct sched_entity *se;
struct sched_entity *pse = &prev->se;
struct sched_entity *se = &prev->se;
RB_DECLARE_CALLBACKS(static, min_vruntime_cb, struct sched_entity,
struct sched_entity *se = &curr->se;
struct sched_entity *se = &p->se;
static void __enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
static void __dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
struct sched_entity *__pick_root_entity(struct cfs_rq *cfs_rq)
struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq)
static inline void set_protect_slice(struct cfs_rq *cfs_rq, struct sched_entity *se)
static inline void update_protect_slice(struct cfs_rq *cfs_rq, struct sched_entity *se)
static inline bool protect_slice(struct sched_entity *se)
static inline void cancel_protect_slice(struct sched_entity *se)
struct sched_entity *se;
struct sched_entity *se = cfs_rq->tg->se[cpu_of(rq)];
struct sched_entity *se = &rq->idle->se;
int __update_load_avg_blocked_se(u64 now, struct sched_entity *se)
int __update_load_avg_se(u64 now, struct cfs_rq *cfs_rq, struct sched_entity *se)
int __update_load_avg_blocked_se(u64 now, struct sched_entity *se);
int __update_load_avg_se(u64 now, struct cfs_rq *cfs_rq, struct sched_entity *se);
static inline struct task_struct *task_of(struct sched_entity *se)
static inline struct cfs_rq *cfs_rq_of(const struct sched_entity *se)
static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp)
static inline struct cfs_rq *cfs_rq_of(const struct sched_entity *se)
static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp)
extern void init_entity_runnable_average(struct sched_entity *se);
extern struct sched_entity *__pick_root_entity(struct cfs_rq *cfs_rq);
extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq);
extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq);
extern int entity_eligible(struct cfs_rq *cfs_rq, struct sched_entity *se);
struct sched_entity **se;
struct sched_entity *se, int cpu,
struct sched_entity *parent);
extern void set_task_rq_fair(struct sched_entity *se,
struct sched_entity *curr;
struct sched_entity *next;
struct sched_entity *h_load_next;
static inline void se_update_runnable(struct sched_entity *se)
static inline long se_runnable(struct sched_entity *se)
static inline void se_update_runnable(struct sched_entity *se) { }
static inline long se_runnable(struct sched_entity *se)
static inline long se_weight(struct sched_entity *se)
__schedstats_from_se(struct sched_entity *se)
struct sched_entity se;