Home
last modified time | relevance | path

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

/linux/kernel/sched/
H A Dfair.c10287 struct sched_group *busiest; /* Busiest group in this sd */ member
10308 .busiest = NULL, in init_sd_lb_stats()
10646 struct sg_lb_stats *busiest, in sibling_imbalance() argument
10652 if (!env->idle || !busiest->sum_nr_running) in sibling_imbalance()
10655 ncores_busiest = sds->busiest->cores; in sibling_imbalance()
10659 imbalance = busiest->sum_nr_running; in sibling_imbalance()
10665 imbalance = ncores_local * busiest->sum_nr_running; in sibling_imbalance()
10673 busiest->sum_nr_running > 1) in sibling_imbalance()
10803 struct sg_lb_stats *busiest = &sds->busiest_stat; in update_sd_pick_busiest() local
10821 if (sgs->group_type > busiest->group_type) in update_sd_pick_busiest()
[all …]
H A Dsched.h3196 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
3198 __acquires(__rq_lockp(busiest)) in _double_lock_balance()
3201 double_rq_lock(this_rq, busiest); in _double_lock_balance()
3214 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
3216 __acquires(__rq_lockp(busiest)) in _double_lock_balance()
3218 if (__rq_lockp(this_rq) == __rq_lockp(busiest)) { in _double_lock_balance()
3219 __acquire(__rq_lockp(busiest)); /* already held */ in _double_lock_balance()
3220 double_rq_clock_clear_update(this_rq, busiest); in _double_lock_balance()
3224 if (likely(raw_spin_rq_trylock(busiest))) { in _double_lock_balance()
3225 double_rq_clock_clear_update(this_rq, busiest); in _double_lock_balance()
[all …]