mirror of
				https://github.com/torvalds/linux.git
				synced 2025-11-04 10:40:15 +02:00 
			
		
		
		
	Avoid the RETRY_TASK case in the pick_next_task() slow path. By doing the put_prev_task() early, we get the rt/deadline pull done, and by testing rq->nr_running we know if we need newidle_balance(). This then gives a stable state to pick a task from. Since the fast-path is fair only; it means the other classes will always have pick_next_task(.prev=NULL, .rf=NULL) and we can simplify. Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org> Cc: Aaron Lu <aaron.lwe@gmail.com> Cc: Valentin Schneider <valentin.schneider@arm.com> Cc: mingo@kernel.org Cc: Phil Auld <pauld@redhat.com> Cc: Julien Desfossez <jdesfossez@digitalocean.com> Cc: Nishanth Aravamudan <naravamudan@digitalocean.com> Link: https://lkml.kernel.org/r/aa34d24b36547139248f32a30138791ac6c02bd6.1559129225.git.vpillai@digitalocean.com
		
			
				
	
	
		
			143 lines
		
	
	
	
		
			3.3 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			143 lines
		
	
	
	
		
			3.3 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
// SPDX-License-Identifier: GPL-2.0
 | 
						|
/*
 | 
						|
 * stop-task scheduling class.
 | 
						|
 *
 | 
						|
 * The stop task is the highest priority task in the system, it preempts
 | 
						|
 * everything and will be preempted by nothing.
 | 
						|
 *
 | 
						|
 * See kernel/stop_machine.c
 | 
						|
 */
 | 
						|
#include "sched.h"
 | 
						|
 | 
						|
#ifdef CONFIG_SMP
 | 
						|
static int
 | 
						|
select_task_rq_stop(struct task_struct *p, int cpu, int sd_flag, int flags)
 | 
						|
{
 | 
						|
	return task_cpu(p); /* stop tasks as never migrate */
 | 
						|
}
 | 
						|
#endif /* CONFIG_SMP */
 | 
						|
 | 
						|
static void
 | 
						|
check_preempt_curr_stop(struct rq *rq, struct task_struct *p, int flags)
 | 
						|
{
 | 
						|
	/* we're never preempted */
 | 
						|
}
 | 
						|
 | 
						|
static void set_next_task_stop(struct rq *rq, struct task_struct *stop)
 | 
						|
{
 | 
						|
	stop->se.exec_start = rq_clock_task(rq);
 | 
						|
}
 | 
						|
 | 
						|
static struct task_struct *
 | 
						|
pick_next_task_stop(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
 | 
						|
{
 | 
						|
	struct task_struct *stop = rq->stop;
 | 
						|
 | 
						|
	WARN_ON_ONCE(prev || rf);
 | 
						|
 | 
						|
	if (!stop || !task_on_rq_queued(stop))
 | 
						|
		return NULL;
 | 
						|
 | 
						|
	set_next_task_stop(rq, stop);
 | 
						|
 | 
						|
	return stop;
 | 
						|
}
 | 
						|
 | 
						|
static void
 | 
						|
enqueue_task_stop(struct rq *rq, struct task_struct *p, int flags)
 | 
						|
{
 | 
						|
	add_nr_running(rq, 1);
 | 
						|
}
 | 
						|
 | 
						|
static void
 | 
						|
dequeue_task_stop(struct rq *rq, struct task_struct *p, int flags)
 | 
						|
{
 | 
						|
	sub_nr_running(rq, 1);
 | 
						|
}
 | 
						|
 | 
						|
static void yield_task_stop(struct rq *rq)
 | 
						|
{
 | 
						|
	BUG(); /* the stop task should never yield, its pointless. */
 | 
						|
}
 | 
						|
 | 
						|
static void put_prev_task_stop(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
 | 
						|
{
 | 
						|
	struct task_struct *curr = rq->curr;
 | 
						|
	u64 delta_exec;
 | 
						|
 | 
						|
	delta_exec = rq_clock_task(rq) - curr->se.exec_start;
 | 
						|
	if (unlikely((s64)delta_exec < 0))
 | 
						|
		delta_exec = 0;
 | 
						|
 | 
						|
	schedstat_set(curr->se.statistics.exec_max,
 | 
						|
			max(curr->se.statistics.exec_max, delta_exec));
 | 
						|
 | 
						|
	curr->se.sum_exec_runtime += delta_exec;
 | 
						|
	account_group_exec_runtime(curr, delta_exec);
 | 
						|
 | 
						|
	curr->se.exec_start = rq_clock_task(rq);
 | 
						|
	cgroup_account_cputime(curr, delta_exec);
 | 
						|
}
 | 
						|
 | 
						|
/*
 | 
						|
 * scheduler tick hitting a task of our scheduling class.
 | 
						|
 *
 | 
						|
 * NOTE: This function can be called remotely by the tick offload that
 | 
						|
 * goes along full dynticks. Therefore no local assumption can be made
 | 
						|
 * and everything must be accessed through the @rq and @curr passed in
 | 
						|
 * parameters.
 | 
						|
 */
 | 
						|
static void task_tick_stop(struct rq *rq, struct task_struct *curr, int queued)
 | 
						|
{
 | 
						|
}
 | 
						|
 | 
						|
static void switched_to_stop(struct rq *rq, struct task_struct *p)
 | 
						|
{
 | 
						|
	BUG(); /* its impossible to change to this class */
 | 
						|
}
 | 
						|
 | 
						|
static void
 | 
						|
prio_changed_stop(struct rq *rq, struct task_struct *p, int oldprio)
 | 
						|
{
 | 
						|
	BUG(); /* how!?, what priority? */
 | 
						|
}
 | 
						|
 | 
						|
static unsigned int
 | 
						|
get_rr_interval_stop(struct rq *rq, struct task_struct *task)
 | 
						|
{
 | 
						|
	return 0;
 | 
						|
}
 | 
						|
 | 
						|
static void update_curr_stop(struct rq *rq)
 | 
						|
{
 | 
						|
}
 | 
						|
 | 
						|
/*
 | 
						|
 * Simple, special scheduling class for the per-CPU stop tasks:
 | 
						|
 */
 | 
						|
const struct sched_class stop_sched_class = {
 | 
						|
	.next			= &dl_sched_class,
 | 
						|
 | 
						|
	.enqueue_task		= enqueue_task_stop,
 | 
						|
	.dequeue_task		= dequeue_task_stop,
 | 
						|
	.yield_task		= yield_task_stop,
 | 
						|
 | 
						|
	.check_preempt_curr	= check_preempt_curr_stop,
 | 
						|
 | 
						|
	.pick_next_task		= pick_next_task_stop,
 | 
						|
	.put_prev_task		= put_prev_task_stop,
 | 
						|
	.set_next_task          = set_next_task_stop,
 | 
						|
 | 
						|
#ifdef CONFIG_SMP
 | 
						|
	.select_task_rq		= select_task_rq_stop,
 | 
						|
	.set_cpus_allowed	= set_cpus_allowed_common,
 | 
						|
#endif
 | 
						|
 | 
						|
	.task_tick		= task_tick_stop,
 | 
						|
 | 
						|
	.get_rr_interval	= get_rr_interval_stop,
 | 
						|
 | 
						|
	.prio_changed		= prio_changed_stop,
 | 
						|
	.switched_to		= switched_to_stop,
 | 
						|
	.update_curr		= update_curr_stop,
 | 
						|
};
 |