Searched refs:busiest (Results 1 – 3 of 3) sorted by relevance
8058 struct sched_group *busiest; /* Busiest group in this sd */ member8079 .busiest = NULL, in init_sd_lb_stats()8470 struct sg_lb_stats *busiest = &sds->busiest_stat; in update_sd_pick_busiest() local8487 if (sgs->group_type > busiest->group_type) in update_sd_pick_busiest()8490 if (sgs->group_type < busiest->group_type) in update_sd_pick_busiest()8501 if (sgs->avg_load <= busiest->avg_load) in update_sd_pick_busiest()8514 if (sched_asym_prefer(sg->asym_prefer_cpu, sds->busiest->asym_prefer_cpu)) in update_sd_pick_busiest()8523 if (sgs->group_misfit_task_load < busiest->group_misfit_task_load) in update_sd_pick_busiest()8538 if (sgs->avg_load <= busiest->avg_load) in update_sd_pick_busiest()8550 if (sgs->idle_cpus > busiest->idle_cpus) in update_sd_pick_busiest()[all …]
2089 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument2091 __acquires(busiest->lock) in _double_lock_balance()2095 double_rq_lock(this_rq, busiest); in _double_lock_balance()2108 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) in _double_lock_balance() argument2110 __acquires(busiest->lock) in _double_lock_balance()2115 if (unlikely(!raw_spin_trylock(&busiest->lock))) { in _double_lock_balance()2116 if (busiest < this_rq) { in _double_lock_balance()2118 raw_spin_lock(&busiest->lock); in _double_lock_balance()2123 raw_spin_lock_nested(&busiest->lock, in _double_lock_balance()2134 static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) in double_lock_balance() argument[all …]
48 Initially, load_balance() 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
