lkml.org 
[lkml]   [2002]   [Jan]   [20]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
Patch in this message
/
Date
From
Subject[sched] [patch] comment-fixes-2.5.3-pre2-A0

the attached patch from Rusty Russell fixes three comments in
kernel/sched.c. (I've updated it to apply cleanly against 2.5.3-pre2.)

Ingo
--- linux/kernel/sched.c.orig Sun Jan 20 10:41:39 2002
+++ linux/kernel/sched.c Sun Jan 20 10:57:17 2002
@@ -37,11 +37,7 @@
*
* Locking rule: those places that want to lock multiple runqueues
* (such as the load balancing or the process migration code), lock
- * acquire operations must be ordered by the runqueue's cpu id.
- *
- * The RT event id is used to avoid calling into the the RT scheduler
- * if there is a RT task active in an SMP system but there is no
- * RT scheduling activity otherwise.
+ * acquire operations must be ordered by ascending &runqueue.
*/
struct runqueue {
spinlock_t lock;
@@ -538,7 +553,7 @@
* do not update a process's priority until it either
* goes to sleep or uses up its timeslice. This makes
* it possible for interactive tasks to use up their
- * timeslices at their high priority levels.
+ * timeslices at their highest priority levels.
*/
if (p->sleep_avg)
p->sleep_avg--;
@@ -853,7 +838,7 @@
if (array) {
enqueue_task(p, array);
/*
- * If the task is runnable and lowered its priority,
+ * If the task is running and lowered its priority,
* or increased its priority then reschedule its CPU:
*/
if ((nice < p->__nice) ||
\
 
 \ /
  Last update: 2005-03-22 13:15    [W:0.022 / U:0.448 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site