Searched refs:busiest (Results 1 – 3 of 3) sorted by relevance
9963 .busiest = NULL, in init_sd_lb_stats()11067 if (sds->busiest) in update_sd_lb_stats()11258 (busiest->avg_load - sds->avg_load) * busiest->group_capacity, in calculate_imbalance()11309 if (!sds.busiest) in sched_balance_find_src_group()11526 busiest = rq; in sched_balance_find_src_rq()11543 busiest = rq; in sched_balance_find_src_rq()11550 busiest = rq; in sched_balance_find_src_rq()11561 busiest = rq; in sched_balance_find_src_rq()11569 return busiest; in sched_balance_find_src_rq()11743 struct rq *busiest; in sched_balance_rq() local[all …]
2949 __acquires(busiest->lock) in _double_lock_balance()2953 double_rq_lock(this_rq, busiest); in _double_lock_balance()2968 __acquires(busiest->lock) in _double_lock_balance()2972 likely(raw_spin_rq_trylock(busiest))) { in _double_lock_balance()2973 double_rq_clock_clear_update(this_rq, busiest); in _double_lock_balance()2977 if (rq_order_less(this_rq, busiest)) { in _double_lock_balance()2984 double_rq_lock(this_rq, busiest); in _double_lock_balance()2998 return _double_lock_balance(this_rq, busiest); in double_lock_balance()3002 __releases(busiest->lock) in double_unlock_balance()3004 if (__rq_lockp(this_rq) != __rq_lockp(busiest)) in double_unlock_balance()[all …]
48 Initially, sched_balance_rq() finds the busiest group in the current sched domain.49 If it succeeds, it looks for the busiest runqueue of all the CPUs' runqueues in51 CPU's runqueue and the newly found busiest one and starts moving tasks from it