From fc2a0cd162b41ad415a8ad59394c148cc70b9430 Mon Sep 17 00:00:00 2001 From: Philipp Oppermann Date: Wed, 26 Jun 2019 21:11:59 +0200 Subject: [PATCH] Resolve TODOs and update date --- .../second-edition/posts/10-heap-allocation/index.md | 6 +----- 1 file changed, 1 insertion(+), 5 deletions(-) diff --git a/blog/content/second-edition/posts/10-heap-allocation/index.md b/blog/content/second-edition/posts/10-heap-allocation/index.md index 441be9cd..319f2bc3 100644 --- a/blog/content/second-edition/posts/10-heap-allocation/index.md +++ b/blog/content/second-edition/posts/10-heap-allocation/index.md @@ -2,7 +2,7 @@ title = "Heap Allocation" weight = 10 path = "heap-allocation" -date = 0000-01-01 +date = 2019-06-26 +++ This post adds support for heap allocation to our kernel. First, it gives an introduction to dynamic memory and shows how the borrow checker prevents common allocation errors. It then implements the basic allocation interface of Rust, creates a heap memory region, and sets up an allocator crate. At the end of this post all the allocation and collection types of the built-in `alloc` crate will be available to our kernel. @@ -779,7 +779,3 @@ Finally, we added a dependency on the `linked_list_allocator` crate to add a pro ## What's next? While we already added heap allocation support in this post, we left most of the work to the `linked_list_allocator` crate. The next post will show in detail how an allocator can be implemented from scratch. It will present multiple possible allocator designs, shows how to implement simple versions of them, and explain their advantages and drawbacks. - -TODO: -- update date -- create post-10 tag