Commit 7b8a702d authored by Vincent Guittot's avatar Vincent Guittot Committed by Peter Zijlstra
Browse files

sched/fair: Rename h_nr_running into h_nr_queued



With delayed dequeued feature, a sleeping sched_entity remains queued
in the rq until its lag has elapsed but can't run.
Rename h_nr_running into h_nr_queued to reflect this new behavior.

Signed-off-by: default avatarVincent Guittot <vincent.guittot@linaro.org>
Signed-off-by: default avatarPeter Zijlstra (Intel) <peterz@infradead.org>
Reviewed-by: default avatarDietmar Eggemann <dietmar.eggemann@arm.com>
Link: https://lore.kernel.org/r/20241202174606.4074512-4-vincent.guittot@linaro.org
parent 40c3b94f
Loading
Loading
Loading
Loading
+2 −2
Original line number Diff line number Diff line
@@ -1343,7 +1343,7 @@ bool sched_can_stop_tick(struct rq *rq)
	if (scx_enabled() && !scx_can_stop_tick(rq))
		return false;

	if (rq->cfs.h_nr_running > 1)
	if (rq->cfs.h_nr_queued > 1)
		return false;

	/*
@@ -6020,7 +6020,7 @@ __pick_next_task(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
	 * opportunity to pull in more work from other CPUs.
	 */
	if (likely(!sched_class_above(prev->sched_class, &fair_sched_class) &&
		   rq->nr_running == rq->cfs.h_nr_running)) {
		   rq->nr_running == rq->cfs.h_nr_queued)) {

		p = pick_next_task_fair(rq, prev, rf);
		if (unlikely(p == RETRY_TASK))
+3 −3
Original line number Diff line number Diff line
@@ -379,7 +379,7 @@ static ssize_t sched_fair_server_write(struct file *filp, const char __user *ubu
			return  -EINVAL;
		}

		if (rq->cfs.h_nr_running) {
		if (rq->cfs.h_nr_queued) {
			update_rq_clock(rq);
			dl_server_stop(&rq->fair_server);
		}
@@ -392,7 +392,7 @@ static ssize_t sched_fair_server_write(struct file *filp, const char __user *ubu
			printk_deferred("Fair server disabled in CPU %d, system may crash due to starvation.\n",
					cpu_of(rq));

		if (rq->cfs.h_nr_running)
		if (rq->cfs.h_nr_queued)
			dl_server_start(&rq->fair_server);
	}

@@ -844,7 +844,7 @@ void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq)
	spread = right_vruntime - left_vruntime;
	SEQ_printf(m, "  .%-30s: %Ld.%06ld\n", "spread", SPLIT_NS(spread));
	SEQ_printf(m, "  .%-30s: %d\n", "nr_running", cfs_rq->nr_running);
	SEQ_printf(m, "  .%-30s: %d\n", "h_nr_running", cfs_rq->h_nr_running);
	SEQ_printf(m, "  .%-30s: %d\n", "h_nr_queued", cfs_rq->h_nr_queued);
	SEQ_printf(m, "  .%-30s: %d\n", "h_nr_delayed", cfs_rq->h_nr_delayed);
	SEQ_printf(m, "  .%-30s: %d\n", "idle_nr_running",
			cfs_rq->idle_nr_running);
+44 −44
Original line number Diff line number Diff line
@@ -2128,7 +2128,7 @@ static void update_numa_stats(struct task_numa_env *env,
		ns->load += cpu_load(rq);
		ns->runnable += cpu_runnable(rq);
		ns->util += cpu_util_cfs(cpu);
		ns->nr_running += rq->cfs.h_nr_running;
		ns->nr_running += rq->cfs.h_nr_queued;
		ns->compute_capacity += capacity_of(cpu);

		if (find_idle && idle_core < 0 && !rq->nr_running && idle_cpu(cpu)) {
@@ -5394,7 +5394,7 @@ enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
	 * When enqueuing a sched_entity, we must:
	 *   - Update loads to have both entity and cfs_rq synced with now.
	 *   - For group_entity, update its runnable_weight to reflect the new
	 *     h_nr_running of its group cfs_rq.
	 *     h_nr_queued of its group cfs_rq.
	 *   - For group_entity, update its weight to reflect the new share of
	 *     its group cfs_rq
	 *   - Add its new weight to cfs_rq->load.weight
@@ -5531,7 +5531,7 @@ dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
	 * When dequeuing a sched_entity, we must:
	 *   - Update loads to have both entity and cfs_rq synced with now.
	 *   - For group_entity, update its runnable_weight to reflect the new
	 *     h_nr_running of its group cfs_rq.
	 *     h_nr_queued of its group cfs_rq.
	 *   - Subtract its previous weight from cfs_rq->load.weight.
	 *   - For group entity, update its weight to reflect the new share
	 *     of its group cfs_rq.
@@ -5930,8 +5930,8 @@ static bool throttle_cfs_rq(struct cfs_rq *cfs_rq)
	struct rq *rq = rq_of(cfs_rq);
	struct cfs_bandwidth *cfs_b = tg_cfs_bandwidth(cfs_rq->tg);
	struct sched_entity *se;
	long task_delta, idle_task_delta, delayed_delta, dequeue = 1;
	long rq_h_nr_running = rq->cfs.h_nr_running;
	long queued_delta, idle_task_delta, delayed_delta, dequeue = 1;
	long rq_h_nr_queued = rq->cfs.h_nr_queued;

	raw_spin_lock(&cfs_b->lock);
	/* This will start the period timer if necessary */
@@ -5961,7 +5961,7 @@ static bool throttle_cfs_rq(struct cfs_rq *cfs_rq)
	walk_tg_tree_from(cfs_rq->tg, tg_throttle_down, tg_nop, (void *)rq);
	rcu_read_unlock();

	task_delta = cfs_rq->h_nr_running;
	queued_delta = cfs_rq->h_nr_queued;
	idle_task_delta = cfs_rq->idle_h_nr_running;
	delayed_delta = cfs_rq->h_nr_delayed;
	for_each_sched_entity(se) {
@@ -5983,9 +5983,9 @@ static bool throttle_cfs_rq(struct cfs_rq *cfs_rq)
		dequeue_entity(qcfs_rq, se, flags);

		if (cfs_rq_is_idle(group_cfs_rq(se)))
			idle_task_delta = cfs_rq->h_nr_running;
			idle_task_delta = cfs_rq->h_nr_queued;

		qcfs_rq->h_nr_running -= task_delta;
		qcfs_rq->h_nr_queued -= queued_delta;
		qcfs_rq->idle_h_nr_running -= idle_task_delta;
		qcfs_rq->h_nr_delayed -= delayed_delta;

@@ -6006,18 +6006,18 @@ static bool throttle_cfs_rq(struct cfs_rq *cfs_rq)
		se_update_runnable(se);

		if (cfs_rq_is_idle(group_cfs_rq(se)))
			idle_task_delta = cfs_rq->h_nr_running;
			idle_task_delta = cfs_rq->h_nr_queued;

		qcfs_rq->h_nr_running -= task_delta;
		qcfs_rq->h_nr_queued -= queued_delta;
		qcfs_rq->idle_h_nr_running -= idle_task_delta;
		qcfs_rq->h_nr_delayed -= delayed_delta;
	}

	/* At this point se is NULL and we are at root level*/
	sub_nr_running(rq, task_delta);
	sub_nr_running(rq, queued_delta);

	/* Stop the fair server if throttling resulted in no runnable tasks */
	if (rq_h_nr_running && !rq->cfs.h_nr_running)
	if (rq_h_nr_queued && !rq->cfs.h_nr_queued)
		dl_server_stop(&rq->fair_server);
done:
	/*
@@ -6036,8 +6036,8 @@ void unthrottle_cfs_rq(struct cfs_rq *cfs_rq)
	struct rq *rq = rq_of(cfs_rq);
	struct cfs_bandwidth *cfs_b = tg_cfs_bandwidth(cfs_rq->tg);
	struct sched_entity *se;
	long task_delta, idle_task_delta, delayed_delta;
	long rq_h_nr_running = rq->cfs.h_nr_running;
	long queued_delta, idle_task_delta, delayed_delta;
	long rq_h_nr_queued = rq->cfs.h_nr_queued;

	se = cfs_rq->tg->se[cpu_of(rq)];

@@ -6070,7 +6070,7 @@ void unthrottle_cfs_rq(struct cfs_rq *cfs_rq)
		goto unthrottle_throttle;
	}

	task_delta = cfs_rq->h_nr_running;
	queued_delta = cfs_rq->h_nr_queued;
	idle_task_delta = cfs_rq->idle_h_nr_running;
	delayed_delta = cfs_rq->h_nr_delayed;
	for_each_sched_entity(se) {
@@ -6086,9 +6086,9 @@ void unthrottle_cfs_rq(struct cfs_rq *cfs_rq)
		enqueue_entity(qcfs_rq, se, ENQUEUE_WAKEUP);

		if (cfs_rq_is_idle(group_cfs_rq(se)))
			idle_task_delta = cfs_rq->h_nr_running;
			idle_task_delta = cfs_rq->h_nr_queued;

		qcfs_rq->h_nr_running += task_delta;
		qcfs_rq->h_nr_queued += queued_delta;
		qcfs_rq->idle_h_nr_running += idle_task_delta;
		qcfs_rq->h_nr_delayed += delayed_delta;

@@ -6104,9 +6104,9 @@ void unthrottle_cfs_rq(struct cfs_rq *cfs_rq)
		se_update_runnable(se);

		if (cfs_rq_is_idle(group_cfs_rq(se)))
			idle_task_delta = cfs_rq->h_nr_running;
			idle_task_delta = cfs_rq->h_nr_queued;

		qcfs_rq->h_nr_running += task_delta;
		qcfs_rq->h_nr_queued += queued_delta;
		qcfs_rq->idle_h_nr_running += idle_task_delta;
		qcfs_rq->h_nr_delayed += delayed_delta;

@@ -6116,11 +6116,11 @@ void unthrottle_cfs_rq(struct cfs_rq *cfs_rq)
	}

	/* Start the fair server if un-throttling resulted in new runnable tasks */
	if (!rq_h_nr_running && rq->cfs.h_nr_running)
	if (!rq_h_nr_queued && rq->cfs.h_nr_queued)
		dl_server_start(&rq->fair_server);

	/* At this point se is NULL and we are at root level*/
	add_nr_running(rq, task_delta);
	add_nr_running(rq, queued_delta);

unthrottle_throttle:
	assert_list_leaf_cfs_rq(rq);
@@ -6830,7 +6830,7 @@ static void hrtick_start_fair(struct rq *rq, struct task_struct *p)

	SCHED_WARN_ON(task_rq(p) != rq);

	if (rq->cfs.h_nr_running > 1) {
	if (rq->cfs.h_nr_queued > 1) {
		u64 ran = se->sum_exec_runtime - se->prev_sum_exec_runtime;
		u64 slice = se->slice;
		s64 delta = slice - ran;
@@ -6973,7 +6973,7 @@ enqueue_task_fair(struct rq *rq, struct task_struct *p, int flags)
	int idle_h_nr_running = task_has_idle_policy(p);
	int h_nr_delayed = 0;
	int task_new = !(flags & ENQUEUE_WAKEUP);
	int rq_h_nr_running = rq->cfs.h_nr_running;
	int rq_h_nr_queued = rq->cfs.h_nr_queued;
	u64 slice = 0;

	/*
@@ -7021,7 +7021,7 @@ enqueue_task_fair(struct rq *rq, struct task_struct *p, int flags)
		enqueue_entity(cfs_rq, se, flags);
		slice = cfs_rq_min_slice(cfs_rq);

		cfs_rq->h_nr_running++;
		cfs_rq->h_nr_queued++;
		cfs_rq->idle_h_nr_running += idle_h_nr_running;
		cfs_rq->h_nr_delayed += h_nr_delayed;

@@ -7045,7 +7045,7 @@ enqueue_task_fair(struct rq *rq, struct task_struct *p, int flags)
		se->slice = slice;
		slice = cfs_rq_min_slice(cfs_rq);

		cfs_rq->h_nr_running++;
		cfs_rq->h_nr_queued++;
		cfs_rq->idle_h_nr_running += idle_h_nr_running;
		cfs_rq->h_nr_delayed += h_nr_delayed;

@@ -7057,7 +7057,7 @@ enqueue_task_fair(struct rq *rq, struct task_struct *p, int flags)
			goto enqueue_throttle;
	}

	if (!rq_h_nr_running && rq->cfs.h_nr_running) {
	if (!rq_h_nr_queued && rq->cfs.h_nr_queued) {
		/* Account for idle runtime */
		if (!rq->nr_running)
			dl_server_update_idle_time(rq, rq->curr);
@@ -7104,19 +7104,19 @@ static void set_next_buddy(struct sched_entity *se);
static int dequeue_entities(struct rq *rq, struct sched_entity *se, int flags)
{
	bool was_sched_idle = sched_idle_rq(rq);
	int rq_h_nr_running = rq->cfs.h_nr_running;
	int rq_h_nr_queued = rq->cfs.h_nr_queued;
	bool task_sleep = flags & DEQUEUE_SLEEP;
	bool task_delayed = flags & DEQUEUE_DELAYED;
	struct task_struct *p = NULL;
	int idle_h_nr_running = 0;
	int h_nr_running = 0;
	int h_nr_queued = 0;
	int h_nr_delayed = 0;
	struct cfs_rq *cfs_rq;
	u64 slice = 0;

	if (entity_is_task(se)) {
		p = task_of(se);
		h_nr_running = 1;
		h_nr_queued = 1;
		idle_h_nr_running = task_has_idle_policy(p);
		if (!task_sleep && !task_delayed)
			h_nr_delayed = !!se->sched_delayed;
@@ -7135,12 +7135,12 @@ static int dequeue_entities(struct rq *rq, struct sched_entity *se, int flags)
			break;
		}

		cfs_rq->h_nr_running -= h_nr_running;
		cfs_rq->h_nr_queued -= h_nr_queued;
		cfs_rq->idle_h_nr_running -= idle_h_nr_running;
		cfs_rq->h_nr_delayed -= h_nr_delayed;

		if (cfs_rq_is_idle(cfs_rq))
			idle_h_nr_running = h_nr_running;
			idle_h_nr_running = h_nr_queued;

		/* end evaluation on encountering a throttled cfs_rq */
		if (cfs_rq_throttled(cfs_rq))
@@ -7174,21 +7174,21 @@ static int dequeue_entities(struct rq *rq, struct sched_entity *se, int flags)
		se->slice = slice;
		slice = cfs_rq_min_slice(cfs_rq);

		cfs_rq->h_nr_running -= h_nr_running;
		cfs_rq->h_nr_queued -= h_nr_queued;
		cfs_rq->idle_h_nr_running -= idle_h_nr_running;
		cfs_rq->h_nr_delayed -= h_nr_delayed;

		if (cfs_rq_is_idle(cfs_rq))
			idle_h_nr_running = h_nr_running;
			idle_h_nr_running = h_nr_queued;

		/* end evaluation on encountering a throttled cfs_rq */
		if (cfs_rq_throttled(cfs_rq))
			return 0;
	}

	sub_nr_running(rq, h_nr_running);
	sub_nr_running(rq, h_nr_queued);

	if (rq_h_nr_running && !rq->cfs.h_nr_running)
	if (rq_h_nr_queued && !rq->cfs.h_nr_queued)
		dl_server_stop(&rq->fair_server);

	/* balance early to pull high priority tasks */
@@ -10316,7 +10316,7 @@ sched_reduced_capacity(struct rq *rq, struct sched_domain *sd)
	 * When there is more than 1 task, the group_overloaded case already
	 * takes care of cpu with reduced capacity
	 */
	if (rq->cfs.h_nr_running != 1)
	if (rq->cfs.h_nr_queued != 1)
		return false;

	return check_cpu_capacity(rq, sd);
@@ -10351,7 +10351,7 @@ static inline void update_sg_lb_stats(struct lb_env *env,
		sgs->group_load += load;
		sgs->group_util += cpu_util_cfs(i);
		sgs->group_runnable += cpu_runnable(rq);
		sgs->sum_h_nr_running += rq->cfs.h_nr_running;
		sgs->sum_h_nr_running += rq->cfs.h_nr_queued;

		nr_running = rq->nr_running;
		sgs->sum_nr_running += nr_running;
@@ -10666,7 +10666,7 @@ static inline void update_sg_wakeup_stats(struct sched_domain *sd,
		sgs->group_util += cpu_util_without(i, p);
		sgs->group_runnable += cpu_runnable_without(rq, p);
		local = task_running_on_cpu(i, p);
		sgs->sum_h_nr_running += rq->cfs.h_nr_running - local;
		sgs->sum_h_nr_running += rq->cfs.h_nr_queued - local;

		nr_running = rq->nr_running - local;
		sgs->sum_nr_running += nr_running;
@@ -11448,7 +11448,7 @@ static struct rq *sched_balance_find_src_rq(struct lb_env *env,
		if (rt > env->fbq_type)
			continue;

		nr_running = rq->cfs.h_nr_running;
		nr_running = rq->cfs.h_nr_queued;
		if (!nr_running)
			continue;

@@ -11607,7 +11607,7 @@ static int need_active_balance(struct lb_env *env)
	 * available on dst_cpu.
	 */
	if (env->idle &&
	    (env->src_rq->cfs.h_nr_running == 1)) {
	    (env->src_rq->cfs.h_nr_queued == 1)) {
		if ((check_cpu_capacity(env->src_rq, sd)) &&
		    (capacity_of(env->src_cpu)*sd->imbalance_pct < capacity_of(env->dst_cpu)*100))
			return 1;
@@ -12348,7 +12348,7 @@ static void nohz_balancer_kick(struct rq *rq)
		 * If there's a runnable CFS task and the current CPU has reduced
		 * capacity, kick the ILB to see if there's a better CPU to run on:
		 */
		if (rq->cfs.h_nr_running >= 1 && check_cpu_capacity(rq, sd)) {
		if (rq->cfs.h_nr_queued >= 1 && check_cpu_capacity(rq, sd)) {
			flags = NOHZ_STATS_KICK | NOHZ_BALANCE_KICK;
			goto unlock;
		}
@@ -12835,11 +12835,11 @@ static int sched_balance_newidle(struct rq *this_rq, struct rq_flags *rf)
	 * have been enqueued in the meantime. Since we're not going idle,
	 * pretend we pulled a task.
	 */
	if (this_rq->cfs.h_nr_running && !pulled_task)
	if (this_rq->cfs.h_nr_queued && !pulled_task)
		pulled_task = 1;

	/* Is there a task of a high priority class? */
	if (this_rq->nr_running != this_rq->cfs.h_nr_running)
	if (this_rq->nr_running != this_rq->cfs.h_nr_queued)
		pulled_task = -1;

out:
@@ -13526,7 +13526,7 @@ int sched_group_set_idle(struct task_group *tg, long idle)
				parent_cfs_rq->idle_nr_running--;
		}

		idle_task_delta = grp_cfs_rq->h_nr_running -
		idle_task_delta = grp_cfs_rq->h_nr_queued -
				  grp_cfs_rq->idle_h_nr_running;
		if (!cfs_rq_is_idle(grp_cfs_rq))
			idle_task_delta *= -1;
+2 −2
Original line number Diff line number Diff line
@@ -275,7 +275,7 @@ ___update_load_avg(struct sched_avg *sa, unsigned long load)
 *
 *   group: [ see update_cfs_group() ]
 *     se_weight()   = tg->weight * grq->load_avg / tg->load_avg
 *     se_runnable() = grq->h_nr_running
 *     se_runnable() = grq->h_nr_queued
 *
 *   runnable_sum = se_runnable() * runnable = grq->runnable_sum
 *   runnable_avg = runnable_sum
@@ -321,7 +321,7 @@ int __update_load_avg_cfs_rq(u64 now, struct cfs_rq *cfs_rq)
{
	if (___update_load_sum(now, &cfs_rq->avg,
				scale_load_down(cfs_rq->load.weight),
				cfs_rq->h_nr_running - cfs_rq->h_nr_delayed,
				cfs_rq->h_nr_queued - cfs_rq->h_nr_delayed,
				cfs_rq->curr != NULL)) {

		___update_load_avg(&cfs_rq->avg, 1);
+2 −2
Original line number Diff line number Diff line
@@ -646,7 +646,7 @@ struct balance_callback {
struct cfs_rq {
	struct load_weight	load;
	unsigned int		nr_running;
	unsigned int		h_nr_running;      /* SCHED_{NORMAL,BATCH,IDLE} */
	unsigned int		h_nr_queued;       /* SCHED_{NORMAL,BATCH,IDLE} */
	unsigned int		idle_nr_running;   /* SCHED_IDLE */
	unsigned int		idle_h_nr_running; /* SCHED_IDLE */
	unsigned int		h_nr_delayed;
@@ -902,7 +902,7 @@ static inline void se_update_runnable(struct sched_entity *se)
	if (!entity_is_task(se)) {
		struct cfs_rq *cfs_rq = se->my_q;

		se->runnable_weight = cfs_rq->h_nr_running - cfs_rq->h_nr_delayed;
		se->runnable_weight = cfs_rq->h_nr_queued - cfs_rq->h_nr_delayed;
	}
}