[PATCH 05/14] sched: fix typos in comments

[Hemanth Selam <hemanth.selam@gmail.com>]

Fix typos in comments, reported by scripts/checkpatch.pl using the
misspelling list in scripts/spelling.txt.  Only touches comments, no code
changes.

Assisted-by: Cursor:claude-opus-5
Signed-off-by: Hemanth Selam <hemanth.selam@gmail.com>
---
 include/linux/sched.h   | 2 +-
 kernel/sched/core.c     | 2 +-
 kernel/sched/cputime.c  | 2 +-
 kernel/sched/fair.c     | 2 +-
 kernel/sched/sched.h    | 2 +-
 kernel/sched/topology.c | 2 +-
 kernel/sched/wait_bit.c | 2 +-
 7 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/include/linux/sched.h b/include/linux/sched.h
index 8b3d47a325cc..364a7ea67d03 100644
--- a/include/linux/sched.h
+++ b/include/linux/sched.h
@@ -688,7 +688,7 @@ struct sched_dl_entity {
 	 * dlserver is started on first cfs enqueue on an idle runqueue
 	 * and is stopped when a dequeue results in 0 cfs tasks on the
 	 * runqueue. In other words, dlserver is active only when cpu's
-	 * runqueue has atleast one cfs task.
+	 * runqueue has at least one cfs task.
 	 *
 	 * @dl_defer tells if this is a deferred or regular server. For
 	 * now only defer server exists.
diff --git a/kernel/sched/core.c b/kernel/sched/core.c
index f78275192036..a2e258646065 100644
--- a/kernel/sched/core.c
+++ b/kernel/sched/core.c
@@ -10751,7 +10751,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/cputime.c b/kernel/sched/cputime.c
index 06bddaa738e5..f0cdf5d5e044 100644
--- a/kernel/sched/cputime.c
+++ b/kernel/sched/cputime.c
@@ -437,7 +437,7 @@ static void kcpustat_idle_stop(struct kernel_cpustat *kc, u64 now)
 
 	/*
 	 * Record the idle time after substracting the steal time from
-	 * previous update sequence. Don't substract the steal time from
+	 * previous update sequence. Don't subtract the steal time from
 	 * the current update sequence to avoid readers moving backward.
 	 */
 	write_seqcount_begin(&kc->idle_sleeptime_seq);
diff --git a/kernel/sched/fair.c b/kernel/sched/fair.c
index 8dff37059faf..8da25c0e87ed 100644
--- a/kernel/sched/fair.c
+++ b/kernel/sched/fair.c
@@ -15105,7 +15105,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 e656c7059bf8..ebaf892a16b6 100644
--- a/kernel/sched/sched.h
+++ b/kernel/sched/sched.h
@@ -394,7 +394,7 @@ 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
  * dl_server_timer, or until there are no more tasks to run, at which point
diff --git a/kernel/sched/topology.c b/kernel/sched/topology.c
index 0248227d983a..66e3aacfa6d4 100644
--- a/kernel/sched/topology.c
+++ b/kernel/sched/topology.c
@@ -2966,7 +2966,7 @@ init_sched_domain_shared(struct s_data *d, struct sched_domain *sd, int flags)
 
 	/*
 	 * Use the sd_shared corresponding to the last
-	 * CPU in the span if none are avaialable.
+	 * CPU in the span if none are available.
 	 */
 	if (WARN_ON_ONCE(!sd->shared))
 		sd->shared = sds;
diff --git a/kernel/sched/wait_bit.c b/kernel/sched/wait_bit.c
index 348f7211b4aa..f3fa7e36449d 100644
--- a/kernel/sched/wait_bit.c
+++ b/kernel/sched/wait_bit.c
@@ -215,7 +215,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