michaelkuc6/blog_os
1
0
Fork 0
mirror of https://github.com/phil-opp/blog_os.git synced 2025-12-16 14:27:49 +00:00
Code Issues Projects Releases Wiki Activity

Link to free list wikipedia article

Browse Source
This commit is contained in:
Philipp Oppermann
2020-01-20 10:08:33 +01:00
parent deca65eb1f
commit 6368938b9e
1 changed files with 5 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
blog/content/second-edition/posts/11-allocator-designs/index.md
View File

@@ -423,7 +423,11 @@ The most common implementation approach is to construct a single linked list in
![](linked-list-allocation.svg) ![](linked-list-allocation.svg)
Each list node contains two fields: The size of the memory region and a pointer to the next unused memory region. With this approach, we only need a pointer to the first unused region (called `head`) to keep track of all unused regions, independent of their number. As you can guess from the name, this is the technique that the `linked_list_allocator` crate uses. Each list node contains two fields: The size of the memory region and a pointer to the next unused memory region. With this approach, we only need a pointer to the first unused region (called `head`) to keep track of all unused regions, independent of their number. The resulting data structure is often called a [_free list_].
[_free list_]: https://en.wikipedia.org/wiki/Free_list
As you might guess from the name, this is the technique that the `linked_list_allocator` crate uses.
### Implementation ### Implementation