Skip to main content

Loading the code workspace…

LC

Implement Slab Allocator for Fixed-Size Kernel Objects

hard2/10

Implement Buddy Allocator for Physical Memory Management Build Simple Page Table: Map Virtual to Physical Addresses

Language

Compiler

2.0s Limit 256MB

Submit and pass all tests to enable saving to GitHub.

Implementation

Implement slab allocator for fixed-size kernel objects.

Requirements:

Define kmem_cache structure for cache management
Define slab structure for slab management
Implement kmem_cache_create(name, object_size) to create cache
Implement kmem_cache_alloc(cache) to allocate object
Implement kmem_cache_free(cache, obj) to free object
Maintain three slab lists: full, partial, empty
Track objects per slab and in-use count
Print allocation, free, and slab state changes
Support multiple caches with different object sizes
Handle slab creation and destruction
Demonstrate with inode cache and task_struct cache

Why This Matters

Bonwick's 1994 slab allocator design became Linux's SLAB and SLUB subsystems, where kmem_cache pools serve task_struct, inode, and dentry objects on every fork() and file open across a running kernel. Because slabs reuse memory without re-zeroing it, slab corruption bugs are also a favorite target for kernel exploit writers chaining a single stray write into arbitrary code execution.

Hints

0 / 3 revealed

Validation Suite

main.c

Workspace 1.0

← Implement Buddy Allocator for Physical Memory ManagementBuild Simple Page Table: Map Virtual to Physical Addresses →