H A D | sched_fair.c | 1761 struct rq *this_rq, int this_cpu) 1765 activate_task(this_rq, p, 0); 1766 check_preempt_curr(this_rq, p, 0); 1821 * move_one_task tries to move exactly one task from busiest to this_rq, as 1828 move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest, argument 1842 pull_task(busiest, p, this_rq, this_cpu); 1857 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, argument 1879 pull_task(busiest, p, this_rq, this_cpu); 1919 load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, argument 1946 moved_load = balance_tasks(this_rq, this_cp 1760 pull_task(struct rq *src_rq, struct task_struct *p, struct rq *this_rq, int this_cpu) argument 1966 load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest, unsigned long max_load_move, struct sched_domain *sd, enum cpu_idle_type idle, int *all_pinned, int *this_best_prio) argument 1984 move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest, unsigned long max_load_move, struct sched_domain *sd, enum cpu_idle_type idle, int *all_pinned) argument 2954 load_balance(int this_cpu, struct rq *this_rq, struct sched_domain *sd, enum cpu_idle_type idle, int *balance) argument 3124 idle_balance(int this_cpu, struct rq *this_rq) argument 3576 struct rq *this_rq = cpu_rq(this_cpu); local 3668 struct rq *this_rq = cpu_rq(this_cpu); local [all...] |