Home
last modified time | relevance | path

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

/linux/kernel/sched/
H A Dfair.c10060 struct sched_group *busiest; /* Busiest group in this sd */ member
10081 .busiest = NULL, in init_sd_lb_stats()
10412 struct sg_lb_stats *busiest, in sibling_imbalance() argument
10418 if (!env->idle || !busiest->sum_nr_running) in sibling_imbalance()
10421 ncores_busiest = sds->busiest->cores; in sibling_imbalance()
10425 imbalance = busiest->sum_nr_running; in sibling_imbalance()
10431 imbalance = ncores_local * busiest->sum_nr_running; in sibling_imbalance()
10439 busiest->sum_nr_running > 1) in sibling_imbalance()
10571 struct sg_lb_stats *busiest = &sds->busiest_stat; in update_sd_pick_busiest() local
10589 if (sgs->group_type > busiest->group_type) in update_sd_pick_busiest()
[all …]
H A Dsched.h3166 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
3168 __acquires(__rq_lockp(busiest)) in _double_lock_balance()
3171 double_rq_lock(this_rq, busiest); in _double_lock_balance()
3184 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
3186 __acquires(__rq_lockp(busiest)) in _double_lock_balance()
3188 if (__rq_lockp(this_rq) == __rq_lockp(busiest)) { in _double_lock_balance()
3189 __acquire(__rq_lockp(busiest)); /* already held */ in _double_lock_balance()
3190 double_rq_clock_clear_update(this_rq, busiest); in _double_lock_balance()
3194 if (likely(raw_spin_rq_trylock(busiest))) { in _double_lock_balance()
3195 double_rq_clock_clear_update(this_rq, busiest); in _double_lock_balance()
[all …]