about summary refs log tree commit diff
path: root/test/memory/heaps.cpp
blob: 94af2be20868f2a0aea5222308c0da1092177020 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
//
// immer: immutable data structures for C++
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
//
// This software is distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
//

#include <immer/heap/cpp_heap.hpp>
#include <immer/heap/free_list_heap.hpp>
#include <immer/heap/gc_heap.hpp>
#include <immer/heap/malloc_heap.hpp>
#include <immer/heap/thread_local_free_list_heap.hpp>

#include <catch.hpp>
#include <numeric>

void do_stuff_to(void* buf, std::size_t size)
{
    auto ptr = static_cast<unsigned char*>(buf);
    CHECK(buf != 0);
    std::iota(ptr, ptr + size, 42);
}

TEST_CASE("malloc")
{
    using heap = immer::malloc_heap;

    SECTION("basic")
    {
        auto p = heap::allocate(42u);
        do_stuff_to(p, 42u);
        heap::deallocate(42, p);
    }
}

TEST_CASE("gc")
{
    using heap = immer::gc_heap;

    SECTION("basic")
    {
        auto p = heap::allocate(42u);
        do_stuff_to(p, 42u);
        heap::deallocate(42, p);
    }
}

TEST_CASE("cpp")
{
    using heap = immer::cpp_heap;

    SECTION("basic")
    {
        auto p = heap::allocate(42u);
        do_stuff_to(p, 42u);
        heap::deallocate(42, p);
    }
}

template <typename Heap>
void test_free_list_heap()
{
    using heap = Heap;

    SECTION("basic")
    {
        auto p = heap::allocate(42u);
        do_stuff_to(p, 42u);
        heap::deallocate(42, p);
    }

    SECTION("reuse")
    {
        auto p = heap::allocate(42u);
        do_stuff_to(p, 42u);
        heap::deallocate(42, p);

        auto u = heap::allocate(12u);
        do_stuff_to(u, 12u);
        heap::deallocate(12, u);
        CHECK(u == p);
    }
}

TEST_CASE("free list")
{
    test_free_list_heap<immer::free_list_heap<42u, 2, immer::malloc_heap>>();
}

TEST_CASE("thread local free list")
{
    test_free_list_heap<
        immer::thread_local_free_list_heap<42u, 2, immer::malloc_heap>>();
}

TEST_CASE("unsafe free_list")
{
    test_free_list_heap<
        immer::unsafe_free_list_heap<42u, 2, immer::malloc_heap>>();
}