From 0ad788465c7505bdadff64c2f3af3ad5edf71cc3 Mon Sep 17 00:00:00 2001
From: Quentin LADEVIE <qladevie@wanadev.fr>
Date: Wed, 30 Apr 2025 00:17:19 +0200
Subject: Compiles files one by one

---
 src/module.c | 36 ++++++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)

(limited to 'src/module.c')

diff --git a/src/module.c b/src/module.c
index fde93fe..ad50d7a 100644
--- a/src/module.c
+++ b/src/module.c
@@ -5,6 +5,8 @@
 struct module modules[64U] = { 0U };
 u64 modules_list = ~0ULL;
 
+// u64 module_symbols
+
 u8 add_module() {
 // struct module* add_module() {
     assert(!modules_list);
@@ -12,9 +14,43 @@ u8 add_module() {
     _BitScanForward64((unsigned long*)&module_index, modules_list);
     modules_list ^= (u64)(0x1 << module_index);
 
+#ifdef HASHMAP
+    modules[module_index].symbols = create_unordered_flat();
+#endif
+
     return (u8)module_index;
 };
 
 void remove_module(u8 index) {
     modules_list |= (u64)(0x1 << (((i8)index) - 1U));
 }
+
+#ifdef HASHMAP
+struct element* find_function(struct module* module, u32 rip_offset) {
+    for (u32 sym_index = 0U; sym_index < module->symbols.capacity; sym_index++) {
+        struct element* cur_sym = &module->symbols.arr[sym_index];
+        if (cur_sym->start != 0U && cur_sym->start <= rip_offset && rip_offset < cur_sym->end) {
+            return cur_sym;
+        }
+    }
+    return NULL;
+}
+#else
+u32 find_function(struct module* module, u64 rip_offset) {
+    if (module->functions_count == 0U) {
+        return (u32)-1;
+    }
+    u32 min = 0U, max = module->functions_count - 1U;
+
+    while(min != max) {
+        u32 mid = (min + max) / 2U;
+        if (module->functions_start[mid] < rip_offset) {
+            min = mid + 1U;
+        } else {
+            max = mid - 1U;
+        }
+    }
+
+    return min;
+}
+#endif
-- 
cgit v1.3