Home
last modified time | relevance | path

Searched refs:busiest (Results 1 – 4 of 4) sorted by relevance

/OK3568_Linux_fs/kernel/kernel/sched/
H A Dfair.c8320 struct sched_group *busiest; /* Busiest group in this sd */ member
8341 .busiest = NULL, in init_sd_lb_stats()
8733 struct sg_lb_stats *busiest = &sds->busiest_stat; in update_sd_pick_busiest() local
8750 if (sgs->group_type > busiest->group_type) in update_sd_pick_busiest()
8753 if (sgs->group_type < busiest->group_type) in update_sd_pick_busiest()
8764 if (sgs->avg_load <= busiest->avg_load) in update_sd_pick_busiest()
8777 if (sched_asym_prefer(sg->asym_prefer_cpu, sds->busiest->asym_prefer_cpu)) in update_sd_pick_busiest()
8786 if (sgs->group_misfit_task_load < busiest->group_misfit_task_load) in update_sd_pick_busiest()
8801 if (sgs->avg_load <= busiest->avg_load) in update_sd_pick_busiest()
8813 if (sgs->idle_cpus > busiest->idle_cpus) in update_sd_pick_busiest()
[all …]
H A Dsched.h2149 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
2151 __acquires(busiest->lock) in _double_lock_balance()
2155 double_rq_lock(this_rq, busiest); in _double_lock_balance()
2168 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
2170 __acquires(busiest->lock) in _double_lock_balance()
2175 if (unlikely(!raw_spin_trylock(&busiest->lock))) { in _double_lock_balance()
2176 if (busiest < this_rq) { in _double_lock_balance()
2178 raw_spin_lock(&busiest->lock); in _double_lock_balance()
2183 raw_spin_lock_nested(&busiest->lock, in _double_lock_balance()
2194 static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) in double_lock_balance() argument
[all …]
/OK3568_Linux_fs/kernel/include/trace/hooks/
H A Dsched.h88 TP_PROTO(struct sched_group *busiest, struct rq *dst_rq, int *out_balance),
89 TP_ARGS(busiest, dst_rq, out_balance), 1);
116 struct cpumask *env_cpus, struct rq **busiest,
118 TP_ARGS(dst_cpu, group, env_cpus, busiest, done), 1);
/OK3568_Linux_fs/kernel/Documentation/scheduler/
H A Dsched-domains.rst48 Initially, load_balance() finds the busiest group in the current sched domain.
49 If it succeeds, it looks for the busiest runqueue of all the CPUs' runqueues in
51 CPU's runqueue and the newly found busiest one and starts moving tasks from it