Home
last modified time | relevance | path

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

/linux/kernel/sched/
H A Dfair.c11678 struct sched_group *busiest; /* Busiest group in this sd */ member
11699 .busiest = NULL, in init_sd_lb_stats()
12040 struct sg_lb_stats *busiest, in sibling_imbalance() argument
12046 if (!env->idle || !busiest->sum_nr_running) in sibling_imbalance()
12049 ncores_busiest = sds->busiest->cores; in sibling_imbalance()
12053 imbalance = busiest->sum_nr_running; in sibling_imbalance()
12059 imbalance = ncores_local * busiest->sum_nr_running; in sibling_imbalance()
12067 busiest->sum_nr_running > 1) in sibling_imbalance()
12174 struct sg_lb_stats *busiest, in update_llc_busiest() argument
12180 return sgs->nr_pref_dst_llc > busiest->nr_pref_dst_llc; in update_llc_busiest()
[all …]
H A Dsched.h3338 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
3340 __acquires(__rq_lockp(busiest)) in _double_lock_balance()
3343 double_rq_lock(this_rq, busiest); in _double_lock_balance()
3356 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument
3358 __acquires(__rq_lockp(busiest)) in _double_lock_balance()
3360 if (__rq_lockp(this_rq) == __rq_lockp(busiest)) { in _double_lock_balance()
3361 __acquire(__rq_lockp(busiest)); /* already held */ in _double_lock_balance()
3362 double_rq_clock_clear_update(this_rq, busiest); in _double_lock_balance()
3366 if (likely(raw_spin_rq_trylock(busiest))) { in _double_lock_balance()
3367 double_rq_clock_clear_update(this_rq, busiest); in _double_lock_balance()
[all …]