diff options
| author | Richard Braun <rbraun@sceen.net> | 2013-04-21 01:30:27 +0200 |
|---|---|---|
| committer | Richard Braun <rbraun@sceen.net> | 2013-04-21 01:30:27 +0200 |
| commit | 24832de763ad58be6afdcff6c761b54ccee42667 (patch) | |
| tree | b6858a1d7ccd7ed8948a86085b130623e83190df /kern/kalloc.h | |
| parent | b54c7e38d8871a0c8b7694e7fd02062cf7ca988a (diff) | |
Rework slab lists handling
Don't enforce strong ordering of partial slabs. Separating partial slabs
from free slabs is already effective against fragmentation, and sorting
would sometimes cause pathological scalability issues. In addition, store
new slabs (whether free or partial) in LIFO order for better cache usage.
* kern/slab.c (kmem_cache_grow): Insert new slab at the head of the slabs list.
(kmem_cache_alloc_from_slab): Likewise. In addition, don't sort partial slabs.
(kmem_cache_free_to_slab): Likewise.
* kern/slab.h: Remove comment about partial slabs sorting.
Diffstat (limited to 'kern/kalloc.h')
0 files changed, 0 insertions, 0 deletions