From db7277df5ed4a0951698697b62afa823c3ba0d72 Mon Sep 17 00:00:00 2001
From: "Douglas B. Rumbaugh" <doug@douglasrumbaugh.com>
Date: Sun, 2 Nov 2025 13:23:50 -0500
Subject: Intial commit: No free list management yet

---
 src/alloc.c     | 87 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 src/free_list.c | 22 +++++++++++++++
 2 files changed, 109 insertions(+)
 create mode 100644 src/alloc.c
 create mode 100644 src/free_list.c

(limited to 'src')

diff --git a/src/alloc.c b/src/alloc.c
new file mode 100644
index 0000000..c13b1e8
--- /dev/null
+++ b/src/alloc.c
@@ -0,0 +1,87 @@
+/*
+ * src/alloc.c
+ *
+ * Primary implementation of allocator logic for liballoc
+ * CISC 301 -- Operating Systems, Project 3
+ *
+ * Copyright (C) 2025  Douglas B. Rumbaugh <dbrumbaugh@harrisburgu.edu>
+ * 
+ * Distributed under the Modified BSD License
+ *
+ */
+#include "alloc.h"
+#include "constants.h"
+#include "free_list.h"
+
+typedef struct header {
+  size_t size;
+  size_t magic_number;
+} header;
+
+static_assert(sizeof(header) % ALIGNMENT == 0, "Header improperly aligned");
+
+static void *heap_start = 0;
+static void *heap_end = 0;
+free_nd *free_list = NULL;
+
+static void initialize() {
+  heap_start = sbrk(0);
+
+  if (heap_start == (void *)-1) {
+    perror("liballoc initialization:");
+    exit(EXIT_FAILURE);
+  }
+
+  size_t padding = (size_t)heap_start % ALIGNMENT;
+  if (padding) {
+    heap_start = sbrk(padding);
+    if (heap_start == (void *)-1) {
+      perror("liballoc initialization:");
+      exit(EXIT_FAILURE);
+    }
+  }
+
+  assert((size_t)heap_start % ALIGNMENT == 0);
+  heap_end = heap_start;
+}
+
+void *allocate(size_t size) {
+  if (!heap_start) {
+    initialize();
+  }
+
+  /*
+   * pad the requested size to ensure alignment using
+   * the alignment one-liner we discussed in class
+   */
+  size = (size + ALIGNMENT - 1) & ~(ALIGNMENT - 1);
+
+  /* first check for a suitable memory block on the free list */
+  free_nd *nd = fl_find_first_fit(free_list, size);
+  if (nd) {
+    void *return_region = fl_split_node(free_list, nd, size);
+  }
+
+  /*
+   * if there aren't any blocks on the free list, we need to allocate
+   * from scratch
+   */
+  void *new_region = sbrk(size + sizeof(header));
+
+  /* out of memory */
+  if (new_region == (void *)-1) {
+    return NULL;
+  }
+
+  heap_end = new_region + size + sizeof(header);
+
+  ((header *)new_region)->size = size;
+  ((header *)new_region)->magic_number = MAGIC_NUMBER;
+
+  return new_region + sizeof(header);
+}
+
+void release(void *ptr) {
+  fl_add_node(free_list, ptr);
+  fl_coalesce_nodes(free_list);
+}
diff --git a/src/free_list.c b/src/free_list.c
new file mode 100644
index 0000000..c1dd79c
--- /dev/null
+++ b/src/free_list.c
@@ -0,0 +1,22 @@
+/*
+ * src/free_list.c
+ *
+ * Implementation of free list management for liballoc
+ * CISC 301 -- Operating Systems, Project 3
+ *
+ * Copyright (C) 2025  Douglas B. Rumbaugh <dbrumbaugh@harrisburgu.edu>
+ * 
+ * Distributed under the Modified BSD License
+ *
+ */
+#include "free_list.h"
+
+free_nd *fl_find_first_fit(free_nd *free_list, size_t size) { return NULL; }
+
+void *fl_split_node(free_nd *free_list, free_nd *nd, size_t size) {
+  return NULL;
+}
+
+void fl_coalesce_nodes(free_nd *free_list) {}
+
+void fl_add_node(free_nd *free_list, void *ptr) {}
-- 
cgit v1.2.3