reformat

c_os/kernel/allocator/LinkedListAllocator.h

@@ -34,8 +34,6 @@ private:
     // freie Bloecke werden verkettet
     struct free_block* free_start = nullptr;
 
-    LinkedListAllocator(Allocator& copy) = delete;  // Verhindere Kopieren
-
     // Traverses the whole list forward till previous block is reached.
     // This can only be called on free blocks as allocated blocks
     // aren't reachable from the freelist.
@@ -45,6 +43,8 @@ private:
     SpinLock lock;
 
 public:
+    LinkedListAllocator(Allocator& copy) = delete;  // Verhindere Kopieren
+
     LinkedListAllocator() : log("LL-Alloc") {}
 
     void init() override;

c_os/kernel/allocator/TreeAllocator.h

@@ -38,17 +38,14 @@ private:
 
     NamedLogger log;
 
-    TreeAllocator(Allocator& copy) = delete;  // Verhindere Kopieren
-
     // Returns the size of the usable memory of a block
     unsigned int get_size(list_block_t* block) const;
     unsigned int get_size(tree_block_t* block) const { return this->get_size((list_block_t*)block); }
 
     void dump_free_memory(tree_block_t* node);
 
-    // NOTE: Would be nice to have this stuff somewhere else for general use (scheduling?)
-    //       but that would require different rbt_node/dll_node structures.
-    //       If I need this again later I should move it.
+    // NOTE: Would be nice to have this stuff somewhere else for general use (scheduling?),
+    //       makes no sense to have this as members. I'll move it later
     void rbt_rot_l(tree_block_t* x);
     void rbt_rot_r(tree_block_t* x);
     void rbt_transplant(tree_block_t* a, tree_block_t* b);
@@ -67,6 +64,8 @@ private:
     void dll_remove(list_block_t* node);
 
 public:
+    TreeAllocator(Allocator& copy) = delete;  // Verhindere Kopieren
+
     TreeAllocator() : log("RBT-Alloc") {};
 
     void init() override;