lbug 0.16.1

An in-process property graph database management system built for query speed and scalability
Documentation 
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

#pragma once

#include "memory_manager.h"

namespace lbug {
namespace storage {

template<class T>
class MmAllocator {
public:
    using value_type = T;

    explicit MmAllocator(MemoryManager* mm) : mm{mm} {}

    MmAllocator(const MmAllocator& other) : mm{other.mm} {}
    MmAllocator& operator=(const MmAllocator& other) = default;
    DELETE_BOTH_MOVE(MmAllocator);

    [[nodiscard]] T* allocate(const std::size_t size) {
        ASSERT(mm != nullptr);
        ASSERT(size > 0);
        ASSERT(size <= std::numeric_limits<std::size_t>::max() / sizeof(T));

        auto buffer = mm->mallocBuffer(false, size * sizeof(T));
        auto p = reinterpret_cast<T*>(buffer.data());

        // Ensure proper alignment
        ASSERT(reinterpret_cast<std::uintptr_t>(p) % alignof(T) == 0);

        return p;
    }

    void deallocate(T* p, const std::size_t size) noexcept {
        ASSERT(mm != nullptr);
        ASSERT(p != nullptr);
        ASSERT(size > 0);

        const auto buffer = std::span(reinterpret_cast<uint8_t*>(p), size * sizeof(T));
        if (buffer.data() != nullptr) {
            mm->freeBlock(common::INVALID_PAGE_IDX, buffer);
        }
    }

private:
    MemoryManager* mm;
};

template<class T, class U>
bool operator==(const MmAllocator<T>& a, const MmAllocator<U>& b) {
    return a.mm == b.mm;
}

} // namespace storage
} // namespace lbug