[PATCH] sched: Fix typos in comments

[Wen Jobs <wenxiaolong123@gmail.com>]

Fix several typos in comments across the scheduler subsystem:

- kernel/sched/core.c:     'compability' -> 'compatibility'
- kernel/sched/ext.c:      'upto' -> 'up to' (2 occurrences)
- kernel/sched/fair.c:     'faireness' -> 'fairness'
- kernel/sched/sched.h:    'actualy' -> 'actually';
                           'exhaused' -> 'exhausted';
                           'thottled' -> 'throttled'
- kernel/sched/wait_bit.c: 'condtion' -> 'condition'

Signed-off-by: Wen Jobs <wenxiaolong123@gmail.com>
---
 kernel/sched/core.c     | 2 +-
 kernel/sched/ext.c      | 4 ++--
 kernel/sched/fair.c     | 2 +-
 kernel/sched/sched.h    | 6 +++---
 kernel/sched/wait_bit.c | 2 +-
 5 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/kernel/sched/core.c b/kernel/sched/core.c
index b8871449d3c6..a1993f97bec2 100644
--- a/kernel/sched/core.c
+++ b/kernel/sched/core.c
@@ -10677,7 +10677,7 @@ void call_trace_sched_update_nr_running(struct rq *rq, int count)
  * acceptable tradeoff as it completely avoids complex serialization,
  * memory barriers and atomic operations for the common case.
  *
- * Aside of that this mechanism also ensures RT compability:
+ * Aside of that this mechanism also ensures RT compatibility:
  *
  *   - The task which runs the fixup is fully preemptible except for the
  *     short runqueue lock held sections.
diff --git a/kernel/sched/ext.c b/kernel/sched/ext.c
index 38d90baf78cf..fa99ba358c09 100644
--- a/kernel/sched/ext.c
+++ b/kernel/sched/ext.c
@@ -5203,7 +5203,7 @@ static void bypass_lb_node(struct scx_sched *sch, int node)
 
 	/*
 	 * We don't want CPUs to have more than $nr_donor_target tasks and
-	 * balancing to fill donee CPUs upto $nr_target. Once targets are
+	 * balancing to fill donee CPUs up to $nr_target. Once targets are
 	 * calculated, find the donee CPUs.
 	 */
 	nr_target = DIV_ROUND_UP(nr_tasks, nr_cpus);
@@ -8025,7 +8025,7 @@ __bpf_kfunc_start_defs();
  * task is inserted.
  *
  * When called from ops.dispatch(), there are no restrictions on @p or @dsq_id
- * and this function can be called upto ops.dispatch_max_batch times to insert
+ * and this function can be called up to ops.dispatch_max_batch times to insert
  * multiple tasks. scx_bpf_dispatch_nr_slots() returns the number of the
  * remaining slots. scx_bpf_dsq_move_to_local() flushes the batch and resets the
  * counter.
diff --git a/kernel/sched/fair.c b/kernel/sched/fair.c
index 728965851842..2a3025bce927 100644
--- a/kernel/sched/fair.c
+++ b/kernel/sched/fair.c
@@ -13728,7 +13728,7 @@ static void propagate_entity_cfs_rq(struct sched_entity *se)
 	 * If a task gets attached to this cfs_rq and before being queued,
 	 * it gets migrated to another CPU due to reasons like affinity
 	 * change, make sure this cfs_rq stays on leaf cfs_rq list to have
-	 * that removed load decayed or it can cause faireness problem.
+	 * that removed load decayed or it can cause fairness problem.
 	 */
 	if (!cfs_rq_pelt_clock_throttled(cfs_rq))
 		list_add_leaf_cfs_rq(cfs_rq);
diff --git a/kernel/sched/sched.h b/kernel/sched/sched.h
index 9f63b15d309d..22d8924854a8 100644
--- a/kernel/sched/sched.h
+++ b/kernel/sched/sched.h
@@ -394,9 +394,9 @@ extern s64 dl_scaled_delta_exec(struct rq *rq, struct sched_dl_entity *dl_se, s6
  * between defer and replenish but never actually enqueue the server.
  *
  * Only when the target class does not manage to exhaust the server's runtime
- * (there's actualy starvation in the given period), will the dl_server get on
+ * (there's actually starvation in the given period), will the dl_server get on
  * the runqueue. Once queued it will pick tasks from the target class and run
- * them until either its runtime is exhaused, at which point its back to
+ * them until either its runtime is exhausted, at which point its back to
  * dl_server_timer, or until there are no more tasks to run, at which point
  * the dl_server stops itself.
  *
@@ -405,7 +405,7 @@ extern s64 dl_scaled_delta_exec(struct rq *rq, struct sched_dl_entity *dl_se, s6
  * subject to CBS wakeup rules -- without having to wait for the next period.
  *
  * Additionally, because of the dl_defer behaviour the start/stop behaviour is
- * naturally thottled to once per period, avoiding high context switch
+ * naturally throttled to once per period, avoiding high context switch
  * workloads from spamming the hrtimer program/cancel paths.
  */
 extern void dl_server_update_idle(struct sched_dl_entity *dl_se, s64 delta_exec);
diff --git a/kernel/sched/wait_bit.c b/kernel/sched/wait_bit.c
index 1088d3b7012c..47ab3bcd2ebc 100644
--- a/kernel/sched/wait_bit.c
+++ b/kernel/sched/wait_bit.c
@@ -207,7 +207,7 @@ EXPORT_SYMBOL(init_wait_var_entry);
  * given variable to change.  wait_var_event() can be waiting for an
  * arbitrary condition to be true and associates that condition with an
  * address.  Calling wake_up_var() suggests that the condition has been
- * made true, but does not strictly require the condtion to use the
+ * made true, but does not strictly require the condition to use the
  * address given.
  *
  * The wake-up is sent to tasks in a waitqueue selected by hash from a
-- 
2.34.1