New build parameters and shared includes

This changes many files but I've just applied some replace commands.. So
- nothing special!

1 files changed, 32 insertions, 34 deletions

diff --git a/src/kernel/memory/alloc.c b/src/kernel/memory/alloc.c
index 825c639..da03d8c 100644
--- a/src/kernel/memory/alloc.c
+++ b/src/kernel/memory/alloc.c
@@ -1,12 +1,12 @@
 #include <stddef.h>
 #include <stdint.h>
-#include <kernel/memory/paging.h>
-#include <kernel/memory/alloc.h>
-#include <kernel/system.h>
-#include <kernel/lib/lib.h>
+#include <memory/paging.h>
+#include <memory/alloc.h>
+#include <system.h>
+#include <lib/lib.h>
 
-extern uint32_t end;
-uint32_t placement_address;
+extern u32 end;
+u32 placement_address;
 
 struct heap_header *kheap = NULL;
 struct heap_header *uheap = NULL;
@@ -21,37 +21,36 @@ void kheap_init()
 	// Make user heap
 	uheap = (struct heap_header *)kmalloc_a(UHEAP_SIZE);
 	init_heap(uheap, UHEAP_SIZE);
-	paging_map_user(paging_root_directory, (uint32_t)&uheap, (uint32_t)&uheap);
+	paging_map_user(paging_root_directory, (u32)&uheap, (u32)&uheap);
 }
 
-void *fmalloc(uint32_t size)
+void *fmalloc(u32 size)
 {
 	assert(placement_address + size < MEM_END);
-	uint32_t hold = placement_address;
+	u32 hold = placement_address;
 	memset((void *)hold, 0, size);
 	placement_address += size;
 	return (void *)hold;
 }
 
-void *kmalloc_a(uint32_t size)
+void *kmalloc_a(u32 size)
 {
 	assert(((placement_address & 0xFFFFF000) + 0x1000) + size < MEM_END);
 	placement_address &= 0xFFFFF000;
 	placement_address += 0x1000;
 
-	uint32_t hold = placement_address;
+	u32 hold = placement_address;
 	placement_address += size;
 
 	return (void *)hold;
 }
 
-struct heap_header *find_sized_heap(struct heap_header *heap, size_t size)
+struct heap_header *find_sized_heap(struct heap_header *heap, u32 size)
 {
 	while ((heap->size < HEAP_FIND_SIZE + size) || (heap->free != true)) {
 		assert(heap->magic == KHEAP_MAGIC);
 		assert(heap->magic2 == KHEAP_MAGIC2);
-		struct heap_footer *foot =
-			(struct heap_footer *)((uint32_t)heap + HEAP_S + heap->size);
+		struct heap_footer *foot = (struct heap_footer *)((u32)heap + HEAP_S + heap->size);
 		assert(foot->magic == KHEAP_MAGIC);
 		assert(foot->magic2 == KHEAP_MAGIC2);
 
@@ -61,29 +60,29 @@ struct heap_header *find_sized_heap(struct heap_header *heap, size_t size)
 		if (foot->size != heap->size)
 			panic("Heap footer/header mismatch");
 
-		heap = (struct heap_header *)((uint32_t)foot + sizeof(struct heap_footer));
+		heap = (struct heap_header *)((u32)foot + sizeof(struct heap_footer));
 	}
 
 	return heap;
 }
 
-void split_heap(struct heap_header *heap, size_t size)
+void split_heap(struct heap_header *heap, u32 size)
 {
-	struct heap_footer *foot = (struct heap_footer *)((uint32_t)heap + HEAP_S + size);
+	struct heap_footer *foot = (struct heap_footer *)((u32)heap + HEAP_S + size);
 	foot->magic = KHEAP_MAGIC;
 	foot->magic2 = KHEAP_MAGIC2;
 	foot->size = size;
 
-	size_t new_size = heap->size - HEAP_TOTAL - size;
+	u32 new_size = heap->size - HEAP_TOTAL - size;
 	heap->size = size;
 
-	heap = (struct heap_header *)((uint32_t)foot + sizeof(struct heap_footer));
+	heap = (struct heap_header *)((u32)foot + sizeof(struct heap_footer));
 	heap->size = new_size;
 	heap->free = true;
 	heap->magic = KHEAP_MAGIC;
 	heap->magic2 = KHEAP_MAGIC2;
 
-	foot = (struct heap_footer *)((uint32_t)heap + HEAP_S + heap->size);
+	foot = (struct heap_footer *)((u32)heap + HEAP_S + heap->size);
 	if ((foot->magic != KHEAP_MAGIC) || (foot->magic2 != KHEAP_MAGIC2)) {
 		warn("Invalid footer in split");
 	}
@@ -94,7 +93,7 @@ void split_heap(struct heap_header *heap, size_t size)
 
 void free_internal(struct heap_header *heap, void *address)
 {
-	struct heap_header *head = (struct heap_header *)((uint32_t)address - HEAP_S);
+	struct heap_header *head = (struct heap_header *)((u32)address - HEAP_S);
 	if (head == heap) {
 		//warn("Can't collapse top of heap"); // TODO: Fix "can't collapse top of heap" at start
 		head->free = true;
@@ -106,11 +105,11 @@ void free_internal(struct heap_header *heap, void *address)
 		return;
 	}
 
-	struct heap_footer *foot = (struct heap_footer *)((uint32_t)head + HEAP_S + head->size);
+	struct heap_footer *foot = (struct heap_footer *)((u32)head + HEAP_S + head->size);
 	if ((foot->magic != KHEAP_MAGIC) || (foot->magic2 != KHEAP_MAGIC2))
 		panic("Bad heap call");
 
-	foot = (struct heap_footer *)((uint32_t)head - sizeof(struct heap_footer));
+	foot = (struct heap_footer *)((u32)head - sizeof(struct heap_footer));
 	if ((foot->magic != KHEAP_MAGIC) || (foot->magic2 != KHEAP_MAGIC2)) {
 		warn("Invalid footer in heap");
 		return;
@@ -119,14 +118,13 @@ void free_internal(struct heap_header *heap, void *address)
 	if (foot->size == KHEAP_END)
 		panic("Impossible condition for heap");
 
-	heap = (struct heap_header *)((uint32_t)foot - foot->size - HEAP_S);
+	heap = (struct heap_header *)((u32)foot - foot->size - HEAP_S);
 	if ((heap->magic != KHEAP_MAGIC) || (heap->magic2 != KHEAP_MAGIC2)) {
 		warn("Invalid parent in heap");
 		return;
 	}
 
-	foot = (struct heap_footer *)((uint32_t)heap + (heap->size + head->size + HEAP_TOTAL) +
-				      HEAP_S);
+	foot = (struct heap_footer *)((u32)heap + (heap->size + head->size + HEAP_TOTAL) + HEAP_S);
 	if ((foot->magic != KHEAP_MAGIC) || (foot->magic2 != KHEAP_MAGIC2)) {
 		panic("Fatal arithmetic error in free() call");
 		return;
@@ -136,28 +134,28 @@ void free_internal(struct heap_header *heap, void *address)
 	foot->size = heap->size;
 }
 
-void *malloc_internal(struct heap_header *heap, size_t size)
+void *malloc_internal(struct heap_header *heap, u32 size)
 {
 	heap = find_sized_heap(heap, size + 8);
 	heap->free = false;
 	split_heap(heap, size);
-	return (void *)((uint32_t)heap + HEAP_S);
+	return (void *)((u32)heap + HEAP_S);
 }
 
-void init_heap(struct heap_header *heap, size_t size)
+void init_heap(struct heap_header *heap, u32 size)
 {
 	heap->magic = KHEAP_MAGIC;
 	heap->magic2 = KHEAP_MAGIC2;
 	heap->free = true;
 	heap->size = size - HEAP_TOTAL;
 
-	struct heap_footer *foot = (struct heap_footer *)((uint32_t)heap + HEAP_S + heap->size);
+	struct heap_footer *foot = (struct heap_footer *)((u32)heap + HEAP_S + heap->size);
 	foot->magic = KHEAP_MAGIC;
 	foot->magic2 = KHEAP_MAGIC2;
 	foot->size = KHEAP_END;
 }
 
-void *kmalloc(uint32_t size)
+void *kmalloc(u32 size)
 {
 	if (kheap == NULL)
 		return fmalloc(size);
@@ -165,7 +163,7 @@ void *kmalloc(uint32_t size)
 	return malloc_internal(kheap, size);
 }
 
-void *kcalloc(uint32_t num, uint32_t size)
+void *kcalloc(u32 num, u32 size)
 {
 	void *ptr = kmalloc(num * size);
 	memset(ptr, 0, num * size);
@@ -180,12 +178,12 @@ void kfree(void *address)
 	free_internal(kheap, address);
 }
 
-void *umalloc(size_t size)
+void *umalloc(u32 size)
 {
 	return malloc_internal(uheap, size);
 }
 
-void *ucalloc(uint32_t num, uint32_t size)
+void *ucalloc(u32 num, u32 size)
 {
 	void *ptr = umalloc(num * size);
 	memset(ptr, 0, num * size);