Home
last modified time | relevance | path

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

/kernel/sched/
Dfair.c7979 struct sched_group *busiest; /* Busiest group in this sd */ member
7999 .busiest = NULL, in init_sd_lb_stats()
8401 struct sg_lb_stats *busiest = &sds->busiest_stat; in update_sd_pick_busiest() local
8414 if (sgs->group_type > busiest->group_type) in update_sd_pick_busiest()
8417 if (sgs->group_type < busiest->group_type) in update_sd_pick_busiest()
8420 if (sgs->avg_load <= busiest->avg_load) in update_sd_pick_busiest()
8440 sgs->group_misfit_task_load < busiest->group_misfit_task_load) in update_sd_pick_busiest()
8458 if (!sds->busiest) in update_sd_pick_busiest()
8462 if (sched_asym_prefer(sds->busiest->asym_prefer_cpu, in update_sd_pick_busiest()
8556 sds->busiest = sg; in update_sd_lb_stats()
[all …]
Dsched.h2031 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
2033 __acquires(busiest->lock) in _double_lock_balance()
2037 double_rq_lock(this_rq, busiest); in _double_lock_balance()
2050 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
2052 __acquires(busiest->lock) in _double_lock_balance()
2057 if (unlikely(!raw_spin_trylock(&busiest->lock))) { in _double_lock_balance()
2058 if (busiest < this_rq) { in _double_lock_balance()
2060 raw_spin_lock(&busiest->lock); in _double_lock_balance()
2065 raw_spin_lock_nested(&busiest->lock, in _double_lock_balance()
2076 static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) in double_lock_balance() argument
[all …]