Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

The "priority" of a handler is no longer ignored: the handlers are now

Browse Source 
inserted into the list according to their priority; higher priority
handlers are now called first.


git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@22359 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Axel Dörfler 2007-09-28 21:47:31 +00:00
parent eee9e86c6b
commit a3fc7b4b33
1 changed files with 28 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
src/system/kernel/vm/vm_low_memory.cpp
View File

@ -24,7 +24,6 @@
# define TRACE(x) ; # define TRACE(x) ;
#endif #endif
// TODO: the priority is currently ignored, and probably can be removed
struct low_memory_handler : public DoublyLinkedListLinkImpl<low_memory_handler> { struct low_memory_handler : public DoublyLinkedListLinkImpl<low_memory_handler> {
low_memory_func function; low_memory_func function;
@ -174,22 +173,43 @@ unregister_low_memory_handler(low_memory_func function, void *data)
} }
/*! Registers a low memory handler. The higher the \a priority, the earlier
the handler will be called in low memory situations.
*/
status_t status_t
register_low_memory_handler(low_memory_func function, void *data, int32 priority) register_low_memory_handler(low_memory_func function, void *data,
int32 priority)
{ {
TRACE(("register_low_memory_handler(function = %p, data = %p)\n", TRACE(("register_low_memory_handler(function = %p, data = %p)\n",
function, data)); function, data));
low_memory_handler *handler = (low_memory_handler *)malloc(sizeof(low_memory_handler)); low_memory_handler *newHandler = (low_memory_handler *)malloc(
if (handler == NULL) sizeof(low_memory_handler));
if (newHandler == NULL)
return B_NO_MEMORY; return B_NO_MEMORY;
handler->function = function; newHandler->function = function;
handler->data = data; newHandler->data = data;
handler->priority = priority; newHandler->priority = priority;
MutexLocker locker(&sLowMemoryMutex); MutexLocker locker(&sLowMemoryMutex);
sLowMemoryHandlers.Add(handler);
// sort it in after priority (higher priority comes first)
HandlerList::ReverseIterator iterator
= sLowMemoryHandlers.GetReverseIterator();
low_memory_handler *last = NULL;
while (iterator.HasNext()) {
low_memory_handler *handler = iterator.Next();
if (handler->priority >= priority) {
sLowMemoryHandlers.Insert(last, newHandler);
return B_OK;
}
last = handler;
}
sLowMemoryHandlers.Add(newHandler, false);
return B_OK; return B_OK;
} }