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

kernel: Add support for SMP systems to simple scheduler

Browse Source 
In SMP systems simple scheduler will be used only when all logical
processors share all levels of cache and the number of CPUs is low.
In such systems we do not have to care about cache affinity and
the contention on the lock protecting shared run queue is low. Single
run queue makes load balancing very simple.
This commit is contained in:
Pawel Dziepak
2013-10-15 00:29:04 +02:00
parent 298314fe4b
commit f20ad54be2
4 changed files with 173 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files
headers/private/kernel/util/Heap.h
+17 -3
View File
@@ -79,6 +79,8 @@ public:
inline Element* PeekRoot();
inline const Key& GetKey(Element* element) const;
inline void ModifyKey(Element* element, Key newKey);
inline void RemoveRoot();
@@ -183,11 +185,22 @@ HEAP_CLASS_NAME::PeekRoot()
}
HEAP_TEMPLATE_LIST
const Key&
HEAP_CLASS_NAME::GetKey(Element* element) const
{
HeapLink<Element, Key>* link = sGetLink(element);
ASSERT(link->fIndex >= 0 && link->fIndex < fLastElement);
return link->fKey;
}
HEAP_TEMPLATE_LIST
void
HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey)
{
HeapLink<Element, Key> link = sGetLink(element);
HeapLink<Element, Key>* link = sGetLink(element);
ASSERT(link->fIndex >= 0 && link->fIndex < fLastElement);
Key oldKey = link->fKey;
@@ -208,7 +221,7 @@ HEAP_CLASS_NAME::RemoveRoot()
#if KDEBUG
Element* element = PeekRoot();
HeapLink<Element, Key> link = sGetLink(element);
HeapLink<Element, Key>* link = sGetLink(element);
link->fIndex = -1;
#endif
@@ -240,6 +253,8 @@ HEAP_CLASS_NAME::Insert(Element* element, Key key)
link->fIndex = fLastElement++;
link->fKey = key;
_MoveUp(link);
return B_OK;
}
@@ -266,7 +281,6 @@ HEAP_TEMPLATE_LIST
void
HEAP_CLASS_NAME::_MoveUp(HeapLink<Element, Key>* link)
{
int i = link->fIndex;
while (true) {
int parent = (link->fIndex - 1) / 2;
if (link->fIndex > 0