I´m writing a slab allocator for my os and the allocation does work, but I have a design problem with the deallocation.
I don´t know how the slab allocators in Linux and Solaris are deallocating a slab. Do they go through the lists (free, full, partial) and find the right pg(s) for the slab? Or do they do it another way?
I thought of sorting the lists by the start address of the pg(s). This would be faster for deallocating, but lower for allocating.
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum You cannot attach files in this forum You can download files in this forum