kernel_5.10 no rt

hc

2023-12-11 6778948f9de86c3cfaf36725a7c87dcff9ba247f

 kernel/kernel/sched/fair.c
..
..
@@ -4431,7 +4431,7 @@
4431
4431
 	if (skip_preempt)
4432
4432
 		return;
4433
4433
 	if (delta_exec > ideal_runtime) {
4434
-		resched_curr_lazy(rq_of(cfs_rq));
4434
+		resched_curr(rq_of(cfs_rq));
4435
4435
 		/*
4436
4436
 		 * The current task ran long enough, ensure it doesn't get
4437
4437
 		 * re-elected due to buddy favours.
..
..
@@ -4455,7 +4455,7 @@
4455
4455
 		return;
4456
4456
 
4457
4457
 	if (delta > ideal_runtime)
4458
-		resched_curr_lazy(rq_of(cfs_rq));
4458
+		resched_curr(rq_of(cfs_rq));
4459
4459
 }
4460
4460
 
4461
4461
 void set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
..
..
@@ -4604,7 +4604,7 @@
4604
4604
 	 * validating it and just reschedule.
4605
4605
 	 */
4606
4606
 	if (queued) {
4607
-		resched_curr_lazy(rq_of(cfs_rq));
4607
+		resched_curr(rq_of(cfs_rq));
4608
4608
 		return;
4609
4609
 	}
4610
4610
 	/*
..
..
@@ -4741,7 +4741,7 @@
4741
4741
 	 * hierarchy can be throttled
4742
4742
 	 */
4743
4743
 	if (!assign_cfs_rq_runtime(cfs_rq) && likely(cfs_rq->curr))
4744
-		resched_curr_lazy(rq_of(cfs_rq));
4744
+		resched_curr(rq_of(cfs_rq));
4745
4745
 }
4746
4746
 
4747
4747
 static __always_inline
..
..
@@ -5476,7 +5476,7 @@
5476
5476
 
5477
5477
 		if (delta < 0) {
5478
5478
 			if (rq->curr == p)
5479
-				resched_curr_lazy(rq);
5479
+				resched_curr(rq);
5480
5480
 			return;
5481
5481
 		}
5482
5482
 		hrtick_start(rq, delta);
..
..
@@ -7211,7 +7211,7 @@
7211
7211
 	return;
7212
7212
 
7213
7213
 preempt:
7214
-	resched_curr_lazy(rq);
7214
+	resched_curr(rq);
7215
7215
 	/*
7216
7216
 	 * Only set the backward buddy when the current task is still
7217
7217
 	 * on the rq. This can happen when a wakeup gets interleaved
..
..
@@ -11060,7 +11060,7 @@
11060
11060
 		 * 'current' within the tree based on its new key value.
11061
11061
 		 */
11062
11062
 		swap(curr->vruntime, se->vruntime);
11063
-		resched_curr_lazy(rq);
11063
+		resched_curr(rq);
11064
11064
 	}
11065
11065
 
11066
11066
 	se->vruntime -= cfs_rq->min_vruntime;
..
..
@@ -11087,7 +11087,7 @@
11087
11087
 	 */
11088
11088
 	if (rq->curr == p) {
11089
11089
 		if (p->prio > oldprio)
11090
-			resched_curr_lazy(rq);
11090
+			resched_curr(rq);
11091
11091
 	} else
11092
11092
 		check_preempt_curr(rq, p, 0);
11093
11093
 }