Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Use a queue of slabs for free lists #65

Merged
merged 1 commit into from
Jul 8, 2019
Merged

Use a queue of slabs for free lists #65

merged 1 commit into from
Jul 8, 2019

Commits on Jul 5, 2019

  1. Use a queue of slabs for free lists 

    This commit changes the strategy for finding a free list from
a stack to a queue.  This tends to avoid the slow path considerably more.
It has some memory overheads.

TOOD:  We should move the bump allocation data out of the metaslab and
into the allocator.  At the moment, the slab contains the bump allocation
data, we should move this into the allocator, as it only ever has one slab
it is bump allocating from per sizeclass.
    @mjp41
    mjp41 committed Jul 5, 2019
    Configuration menu
    Copy the full SHA
    d1db6d0 View commit details
    Browse the repository at this point in the history