testing testing...

src/GC/tests/advance.cpp

@@ -5,40 +5,79 @@
 #include <time.h>
 #include <stdlib.h>
 
-int main() {
-    using namespace std;
-    using TimeStamp = std::chrono::_V2::system_clock::time_point;
+// void time_test()
+// {
+//     using TimeStamp = std::chrono::_V2::system_clock::time_point;
 
-    list<char> l;
-    char c = 'a';
-    for (int i = 1; i <= 5; i++) {
-        l.push_back(c++);
-    }
+//     std::list<char> l;
+//     char c = 'a';
+//     for (int i = 1; i <= 5; i++) {
+//         l.push_back(c++);
+//     }
 
-    auto iter = l.begin();
-    auto stop = l.end();
+//     auto iter = l.begin();
+//     auto stop = l.end();
 
-    while (iter != stop) {
-        cout << *iter << " ";
+//     while (iter != stop) {
+//         std::cout << *iter << " ";
      
+//         iter++;
+//     }
+//     std::cout << std::endl;
+//     iter = l.begin();
+//     while (*iter != *stop) {
+//         std::cout << *iter << " ";
+//         iter++;
+//     }
+//     std::cout << std::endl;
+
+//     std::cout << "rebased" << std::endl;
+//     std::cout << "iter: " << *iter << "\nstop: " << *stop << std::endl;
+
+//     TimeStamp ts = std::chrono::system_clock::now();
+//     std::time_t tt = std::chrono::system_clock::to_time_t(ts);
+//     std::string tstr = std::ctime(&tt);
+//     tstr.resize(tstr.size()-1);
+//     std::cout << tstr << std::endl;
+// }
+
+void iter_test()
+{
+    std::list<int> list;
+    list.push_back(1);
+    list.push_back(2);
+    list.push_back(4);
+    list.push_back(5);
+
+    auto iter = list.begin();
+
+    while (iter != list.end())
+    {
+        if (*iter == 4)
+        {
+            iter = list.erase(iter);
+            std::cout << *iter << "\n";
+            list.insert(iter, 3);
+            // list.insert(iter, 3);
+            // std::cout << "n: " << *(++iter) << "\n";
+            // iter = list.erase(++iter);
+        }
         iter++;
     }
-    cout << endl;
-    iter = l.begin();
-    while (*iter != *stop) {
-        cout << *iter << " ";
-        iter++;
+
+    for (int i : list)
+    {
+        std::cout << i << " ";
     }
-    cout << endl;
+    std::cout << std::endl;
+}
 
-    cout << "rebased" << endl;
-    cout << "iter: " << *iter << "\nstop: " << *stop << endl;
 
-    TimeStamp ts = std::chrono::system_clock::now();
-    std::time_t tt = std::chrono::system_clock::to_time_t(ts);
-    std::string tstr = std::ctime(&tt);
-    tstr.resize(tstr.size()-1);
-    std::cout << tstr << std::endl;
+
+int main() {
+    std::cout << "hello" << std::endl;
+    
+    iter_test();
 
     return 0;
 }

src/GC/tests/alloc_free_list.cpp

@@ -0,0 +1,250 @@
+#include <iostream>
+#include <list>
+
+#include "heap.hpp"
+
+using GC::Chunk;
+
+void alloc_test();
+void add_to_free_list(Chunk *chunk);
+void merge_free_list(Chunk *chunk, bool do_merge);
+void do_merge_list();
+void print_free_list();
+
+std::list<Chunk *> m_free_list;
+
+int main()
+{
+    alloc_test();
+
+    // std::list<int> test;
+
+    // test.push_back(1);
+    // test.push_back(2);
+    // test.push_back(3);
+    // test.push_back(4);
+    // test.push_back(5);
+
+    // auto iter = test.begin();
+
+    // std::cout << "First? " << *(iter++) << "\n";
+    // std::cout << "Second? " << *(iter--) << "\n";
+    // std::cout << "First? " << *iter << std::endl;
+
+    // auto i = test.begin();
+    // while (i != test.end())
+    // {
+    //     std::cout << *i << " ";
+    //     ++i;
+    // }
+
+    // if (i == test.end())
+    //     std::cout << "great success!";
+
+    // std::cout << std::endl;
+
+    return 0;
+}
+
+void alloc_test()
+{
+    auto tmp = static_cast<uintptr_t *>(__builtin_frame_address(0));
+
+    auto c1 = new Chunk((size_t)(8), tmp);
+    auto c2 = new Chunk((size_t)(4), c1->m_start + (size_t)(8));
+    auto c3 = new Chunk((size_t)(16), c2->m_start + (size_t)(4));
+    auto c4 = new Chunk((size_t)(4), c3->m_start + (size_t)(16));
+    auto c5 = new Chunk((size_t)(32), c4->m_start + (size_t)(4));
+
+    // std::cout << "test: " << (uintptr_t *)(tmp + (size_t)(2)) << std::endl;
+
+    std::cout << "tmp: " << tmp << "\ntmp: " << (tmp + (size_t)(28)) << std::endl;
+
+    // add_to_free_list(c1);
+    // add_to_free_list(c2);
+    // add_to_free_list(c3);
+    // add_to_free_list(c4);
+    // add_to_free_list(c5);
+
+    merge_free_list(c1, false);
+    merge_free_list(c2, false);
+    merge_free_list(c3, false);
+    merge_free_list(c4, false);
+    merge_free_list(c5, false);
+
+    std::cout << "----- BEFORE MERGE ----------------------";
+    // print_free_list();
+
+    do_merge_list();
+
+    std::cout << "----- AFTER MERGE -----------------------";
+    // print_free_list();
+}
+
+void add_to_free_list(Chunk *chunk)
+{
+    Chunk *curr;
+    auto iter = m_free_list.begin();
+    uintptr_t *prev_start = nullptr;
+    uintptr_t *prev_end = nullptr;
+
+    if (m_free_list.size() == 0)
+    {
+        m_free_list.push_back(chunk);
+        return;
+    }        
+
+    while (iter != m_free_list.end())
+    {
+        curr = *iter;
+
+        // If the curr chunk is aligned before param
+        if (curr->m_start + curr->m_size == chunk->m_start)
+        {
+            Chunk *merged = new Chunk(
+                curr->m_size + chunk->m_size,
+                curr->m_start);
+            iter = m_free_list.erase(iter);
+            m_free_list.insert(iter, merged);
+            return;
+        }
+
+        // If the curr chunk is aligned after param
+        if (chunk->m_start + chunk->m_size == curr->m_start)
+        {
+            Chunk *merged = new Chunk(
+                curr->m_size + chunk->m_size,
+                chunk->m_start);
+            iter = m_free_list.erase(iter);
+            m_free_list.insert(iter, merged);
+            return;
+        }
+
+        // If the first chunk starts after param
+        if (prev_start == nullptr && curr->m_start > chunk->m_start)
+        {
+            m_free_list.insert(iter, chunk);
+            return;
+        }
+
+        if (prev_end < chunk->m_start && (chunk->m_start + chunk->m_size) < curr->m_start)
+        {
+            m_free_list.insert(iter, chunk);
+            return;
+        }
+
+        prev_start = curr->m_start;
+        prev_end = prev_start + curr->m_size;
+        iter++;
+    }
+
+    // This is only reachable if the chunk is at the end
+    m_free_list.push_back(chunk);
+}
+
+void merge_free_list(Chunk *chunk, bool do_merge)
+{
+    auto i = m_free_list.begin();
+    uintptr_t *prev_start = nullptr, *prev_end;
+    bool chunk_inserted = false;
+
+    while (i != m_free_list.end())
+    {
+
+        // if chunk is left-aligned
+        if ((*i)->m_start + (*i)->m_size == chunk->m_start)
+        {
+            m_free_list.insert(++i, chunk);
+            chunk_inserted = true;
+            break;
+        }
+
+        // if chunk is right-aligned
+        if (chunk->m_start + chunk->m_size == (*i)->m_start)
+        {
+            m_free_list.insert(i, chunk);
+            chunk_inserted = true;
+            break;
+        }
+
+        // is new first
+        if (prev_start == nullptr && (*i)->m_start > chunk->m_start)
+        {
+            m_free_list.insert(i, chunk);
+            chunk_inserted = true;
+            break;
+        }
+
+        // if between chunks
+        if (prev_end < chunk->m_start && (chunk->m_start + chunk->m_size) < (*i)->m_start)
+        {
+            m_free_list.insert(i, chunk);
+            chunk_inserted = true;
+            break;
+        }
+
+        prev_start = (*i)->m_start;
+        prev_end = (*i)->m_start + (*i)->m_size;
+        i++;
+    }
+
+    // is new last
+    if (!chunk_inserted && i == m_free_list.end())
+        m_free_list.push_back(chunk);
+
+    if (do_merge)
+        do_merge_list();
+}
+
+void do_merge_list()
+{
+    std::cout << "DO MERGE" << std::endl;
+    auto i = m_free_list.begin();
+    Chunk *prev = *(i++), *curr;
+    print_free_list();
+    
+    while (i != m_free_list.end())
+    {
+        curr = *i;
+
+        if ((prev->m_start + prev->m_size) == curr->m_start)
+        {
+            Chunk *merged = new Chunk(
+                prev->m_size + curr->m_size,
+                prev->m_start
+            );
+
+            // replace current and previous with merged
+            i = m_free_list.erase(i);
+            i = m_free_list.erase(--i);
+            m_free_list.insert(i, merged);
+
+            prev = merged;
+        }
+        else
+        {
+            prev = curr;
+            i++;
+        }
+        print_free_list();
+    }
+    print_free_list();
+}
+
+void print_free_list()
+{
+    std::cout << "free-list count: " << m_free_list.size() << "\n";
+
+    auto iter = m_free_list.begin();
+    size_t cnt = 1;
+
+    while (iter != m_free_list.end())
+    {
+        std::cout << "C" << cnt << ":\n\tstart: " << (*iter)->m_start
+            << "\n\tsize: " << (*iter)->m_size << "\n";
+        iter++;
+        cnt++;
+    }
+
+    std::cout << std::endl;
+}

src/GC/tests/events.cpp

@@ -1,44 +0,0 @@
-#include <iostream>
-#include <stdio.h>
-
-using namespace std;
-// broken :(
-// [event_source(native)]
-class ESource {
-public:
-    __event void TestEvent(int eValue);
-};
-
-// [event_receiver(native)]
-class EReceiver {
-public:
-    void Handler1(int eValue) {
-        cout << "Handler1 with: " << eValue << endl;
-    }
-
-    void Handler2(int eValue) {
-        cout << "Handler2 with: " << eValue << endl;
-    }
-
-    void hookEvent(ESource *eSource) {
-        __hook(&ESource::TestEvent, eSource, &EReceiver::Handler1);
-        __hook(&ESource::TestEvent, eSource, &EReceiver::Handler2);    
-    }
-
-    void unhookEvent(ESource *eSource) {
-        __unhook(&ESource::TestEvent, eSource, &EReceiver::Handler1);
-        __unhook(&ESource::TestEvent, eSource, &EReceiver::Handler2);
-    }
-};
-
-int main() {
-
-    ESource src;
-    EReceiver rcv;
-
-    rcv.hookEvent(&src);
-    __raise src.TestEvent(12);
-    rcv.unhookEvent(&src);
-
-    return 0;
-}

src/GC/tests/linkedlist.cpp

@@ -0,0 +1,87 @@
+#include <stdio.h>
+#include <stdint.h>
+
+#include "heap.hpp"
+
+#define allocNode   static_cast<Node *>(GC::Heap::alloc(sizeof(Node)))
+
+using std::cout, std::endl;
+
+struct Node // sizeof(Node) = 16
+{
+    int value;
+    Node *next {nullptr};
+};
+
+Node *create_list(size_t length)
+{
+    Node *head = allocNode;
+    head->value = 0;
+
+    Node *prev = head;
+
+    for (size_t i = 1; i < length; i++)
+    {
+        Node *next = allocNode;
+        next->value = i;
+        prev->next = next;
+        prev = next;
+    }
+
+    return head;
+}
+
+void print_list(Node* head)
+{
+    cout << "\nPrinting list...\n";
+    while (head != nullptr)
+    {
+        cout << head->value << " ";
+        head = head->next;
+    }
+    cout << endl;
+}
+
+void clear_list(Node *head)
+{
+    while (head != nullptr)
+    {
+        Node *tmp = head->next;
+        head->next = nullptr;
+        head = tmp;
+    }
+}
+
+void run_list_test1()
+{
+    Node *list_a = create_list(10);
+    print_list(list_a);
+}
+
+void run_list_test2()
+{
+    Node *list_b = create_list(10);
+    print_list(list_b);
+}
+
+void run_list_test3()
+{
+    Node *list_c = create_list(10);
+    print_list(list_c);
+}
+
+int main()
+{
+    GC::Heap::init();
+    GC::Heap &heap = GC::Heap::the();
+    heap.set_profiler(true);
+    GC::Profiler::set_log_options(GC::FunctionCalls);
+
+    run_list_test1();
+    run_list_test2();
+    run_list_test3();
+
+    GC::Heap::dispose();
+
+    return 0;
+}

src/GC/tests/linker.cpp

@@ -9,22 +9,8 @@ struct Obj {
 };
 
 int main() {
-    auto heap = GC::Heap::debug_the();
-
-    std::cout << "heap:\t" << heap << std::endl;
     
-    auto obj = static_cast<Obj *>(GC::Heap::alloc(sizeof(Obj)));
-
-    std::cout << "obj: \t" << obj << std::endl;
-
-    obj->a = 3;
-    obj->b = 4;
-    obj->c = 5;
-
-    std::cout << obj->a << ", " << obj->b << ", " << obj->c << std::endl;
-
-    heap->print_contents();
-    //delete heap;
+    
 
     return 0;
 }