Start with linked list alloc and dealloc

1 files changed, 27 insertions, 0 deletions

diff --git a/arch/x86_64/src/memory/heap/linked_list_allocator.cpp b/arch/x86_64/src/memory/heap/linked_list_allocator.cpp
index b0f011b..006d9c7 100644
--- a/arch/x86_64/src/memory/heap/linked_list_allocator.cpp
+++ b/arch/x86_64/src/memory/heap/linked_list_allocator.cpp
@@ -2,6 +2,8 @@
 
 #include "arch/exception_handling/assert.hpp"
 
+#include <algorithm>
+
 namespace teachos::arch::memory::heap
 {
   linked_list_allocator::linked_list_allocator(std::size_t heap_start, std::size_t heap_end)
@@ -13,4 +15,29 @@ namespace teachos::arch::memory::heap
                                "[Memory Hole List] Total heap size can not be smaller than minimum of 16 bytes to hold "
                                "atleast one memory hole entry");
   }
+
+  auto linked_list_allocator::allocate(std::size_t size) -> void *
+  {
+    if (first.next == nullptr || size)
+    {
+    }
+    return nullptr;
+  }
+
+  auto linked_list_allocator::deallocate(uint8_t * pointer, std::size_t size) -> void
+  {
+    auto const deallocate_size = std::max(size, min_allocatable_size());
+    if (pointer || deallocate_size)
+    {
+    }
+  }
+
+  auto split_hole(memory_hole & current_hole, memory_hole *& new_hole) -> void *
+  {
+    if (new_hole)
+    {
+    }
+    return static_cast<void *>(&current_hole);
+  }
+
 }  // namespace teachos::arch::memory::heap