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

Mention alternative names for bump/linked list allocator design

Browse Source
This commit is contained in:
Philipp Oppermann
2020-05-20 15:19:00 +02:00
parent 5caf136bc2
commit 5e37a0ed5d
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -48,7 +48,7 @@ In the following we present three possible kernel allocator designs and explain
## Bump Allocator
The most simple allocator design is a _bump allocator_. It allocates memory linearly and only keeps track of the number of allocated bytes and the number of allocations. It is only useful in very specific use cases because it has a severe limitation: it can only free all memory at once.
The most simple allocator design is a _bump allocator_ (also known as _stack allocator_). It allocates memory linearly and only keeps track of the number of allocated bytes and the number of allocations. It is only useful in very specific use cases because it has a severe limitation: it can only free all memory at once.
### Idea
@@ -465,7 +465,7 @@ Each list node contains two fields: The size of the memory region and a pointer
[_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.
As you might guess from the name, this is the technique that the `linked_list_allocator` crate uses. Allocators that use this technique are also often called _pool allocators_.
### Implementation