move logger

c_os/kernel/allocator/BumpAllocator.h

@@ -13,7 +13,7 @@
 #define BumpAllocator_include__
 
 #include "kernel/Allocator.h"
-#include "user/lib/Logger.h"
+#include "user/lib/utility/Logger.h"
 
 class BumpAllocator : Allocator {
 private:

c_os/kernel/allocator/LinkedListAllocator.cc

@@ -11,7 +11,7 @@
 
 #include "kernel/allocator/LinkedListAllocator.h"
 #include "kernel/Globals.h"
-#include "user/lib/Logger.h"
+#include "user/lib/utility/Logger.h"
 
 // I don't order the list by size so that the block order corresponds to the location in memory
 // Then I can easily merge adjacent free blocks by finding the previous block without looking at

c_os/kernel/allocator/LinkedListAllocator.h

@@ -14,7 +14,7 @@
 
 #include "kernel/Allocator.h"
 #include "lib/SpinLock.h"
-#include "user/lib/Logger.h"
+#include "user/lib/utility/Logger.h"
 
 // Format eines freien Blocks, 4 + 4 + 4 Byte
 typedef struct free_block {

c_os/kernel/allocator/TreeAllocator.h

@@ -2,7 +2,7 @@
 #define TreeAllocator_include__
 
 #include "kernel/Allocator.h"
-#include "user/lib/Logger.h"
+#include "user/lib/utility/Logger.h"
 
 // I can't imagine that this is fast with all the tree logic?