i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

* Applied r34634 to the simple SMP scheduler as well (Rene was right, I just

Browse Source 
overlooked it).


git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@34641 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Axel Dörfler
2009-12-12 15:02:30 +00:00
parent a5852db3c2
commit adf9b14ed6
2 changed files with 28 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/system/kernel/scheduler/scheduler_simple.cpp
+1
View File
@@ -8,6 +8,7 @@
* Distributed under the terms of the NewOS License. * Distributed under the terms of the NewOS License.
*/ */
/*! The thread scheduler */ /*! The thread scheduler */
src/system/kernel/scheduler/scheduler_simple_smp.cpp
+27 -16
View File
@@ -1,6 +1,6 @@
/* /*
* Copyright 2008-2009, Ingo Weinhold, [email protected]. * Copyright 2008-2009, Ingo Weinhold, [email protected].
* Copyright 2002-2007, Axel Dörfler, [email protected]. * Copyright 2002-2009, Axel Dörfler, [email protected].
* Copyright 2002, Angelo Mottola, [email protected]. * Copyright 2002, Angelo Mottola, [email protected].
* Distributed under the terms of the MIT License. * Distributed under the terms of the MIT License.
* *
@@ -8,6 +8,7 @@
* Distributed under the terms of the NewOS License. * Distributed under the terms of the NewOS License.
*/ */
/*! The thread scheduler */ /*! The thread scheduler */
@@ -336,22 +337,32 @@ reschedule(void)
if (nextThread->priority >= B_FIRST_REAL_TIME_PRIORITY) if (nextThread->priority >= B_FIRST_REAL_TIME_PRIORITY)
break; break;
// never skip last non-idle normal thread // find next thread with lower priority
if (nextThread->queue_next && nextThread->queue_next->priority == B_IDLE_PRIORITY) struct thread *lowerNextThread = nextThread->queue_next;
break; struct thread *lowerPrevThread = nextThread;
// skip normal threads sometimes (roughly 20%)
if (_rand() > 0x1a00)
break;
// skip until next lower priority
int32 priority = nextThread->priority; int32 priority = nextThread->priority;
do {
prevThread = nextThread; while (lowerNextThread != NULL
nextThread = nextThread->queue_next; && priority == lowerNextThread->priority) {
} while (nextThread->queue_next != NULL lowerPrevThread = lowerNextThread;
&& priority == nextThread->queue_next->priority lowerNextThread = lowerNextThread->queue_next;
&& nextThread->queue_next->priority > B_IDLE_PRIORITY); }
// never skip last non-idle normal thread
if (lowerNextThread == NULL
|| lowerNextThread->priority == B_IDLE_PRIORITY)
break;
int32 priorityDiff = priority - lowerNextThread->priority;
if (priorityDiff > 15)
break;
// skip normal threads sometimes
// (twice as probable per priority level)
if ((_rand() >> (15 - priorityDiff)) != 0)
break;
nextThread = lowerNextThread;
prevThread = lowerPrevThread;
} }
if (nextThread->cpu if (nextThread->cpu