seqwish 0.1.0

A variation graph inducer - build pangenome graphs from pairwise alignments
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
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169

/* -*- mode: c++; c-basic-offset: 4; indent-tabs-mode: nil; tab-width: 4 -*- */
#ifndef HUGE_PAGES_H_INCLUDED
#define HUGE_PAGES_H_INCLUDED

#include "benchmarks.h"

#include <new>
#include <memory>
#include <utility>

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

namespace atomic_queue {

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

class HugePages {
    unsigned char* cur_;
    unsigned char* end_;
    unsigned char* beg_;

public:
    using WarnFn = void();
    static WarnFn* warn_no_1GB_pages;
    static WarnFn* warn_no_2MB_pages;

    struct Deleter {
        HugePages* hp_;

        template<class T>
        void operator()(T* p) const {
            hp_->destroy(p);
        }
    };

    enum Type { PAGE_DEFAULT = 0, PAGE_2MB = 21, PAGE_1GB = 30 };

    HugePages(Type t, size_t total_size);
    ~HugePages() noexcept;

    HugePages(HugePages const&) = delete;
    HugePages& operator=(HugePages const&) = delete;

    HugePages(HugePages&& b) noexcept
        : cur_(b.cur_)
        , end_(b.end_)
        , beg_(b.beg_)
    {
        b.beg_ = 0;
    }

    HugePages& operator=(HugePages&& b) noexcept {
        b.swap(*this);
        return *this;
    }

    void reset() noexcept {
        cur_ = beg_;
    }

    bool empty() const noexcept {
        return cur_ == beg_;
    }

    size_t available() const noexcept {
        return end_ - cur_;
    }

    size_t capacity() const noexcept {
        return end_ - beg_;
    }

    size_t used() const noexcept {
        return cur_ - beg_;
    }

    void* allocate(size_t size, std::nothrow_t) noexcept {
        if(static_cast<size_t>(end_ - cur_) < size)
            return 0;
        void* p = cur_;
        cur_ += size;
        return p;
    }

    void* allocate(size_t size) {
        void* p = this->allocate(size, std::nothrow_t{});
        if(!p)
            throw std::bad_alloc();
        return p;
    }

    void deallocate(void* p, size_t size) noexcept {
        auto q = cur_ - size;
        if(q == p) // Can only deallocate the last allocation at the end.
            cur_ = q;
    }

    template<class T, class... Args>
    T* create(Args&&... args) {
        return new(this->allocate(sizeof(T))) T{std::forward<Args>(args)...};
    }

    template<class T, class... Args>
    std::unique_ptr<T, Deleter> create_unique_ptr(Args&&... args) {
        return std::unique_ptr<T, Deleter>{new(this->allocate(sizeof(T))) T{std::forward<Args>(args)...}, Deleter{this}};
    }

    template<class T, class... Args>
    std::unique_ptr<T, Deleter> create_unique_ptr(NoContext, Args&&... args) {
        return std::unique_ptr<T, Deleter>{new(this->allocate(sizeof(T))) T{std::forward<Args>(args)...}, Deleter{this}};
    }

    template<class T>
    void destroy(T* p) {
        void* q = p;
        p->~T();
        this->deallocate(q, sizeof(T));
    }

    void swap(HugePages& b) noexcept {
        using std::swap;
        swap(cur_, b.cur_);
        swap(end_, b.end_);
        swap(beg_, b.beg_);
    }
};

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

struct HugePageAllocatorBase {
    static HugePages* hp;
};

template<class T>
struct HugePageAllocator : HugePageAllocatorBase
{
    // static bool constexpr is_always_equal = false;
    // static bool constexpr propagate_on_container_copy_assignment = true;
    // static bool constexpr propagate_on_container_move_assignment = true;
    // static bool constexpr propagate_on_container_swap = true;

    template<class U> struct rebind { using other = HugePageAllocator<U>; };

    using value_type = T;

    T* allocate(size_t n) const {
        return static_cast<T*>(hp->allocate(n * sizeof(T)));
    }

    void deallocate(T* p, size_t n) const {
        hp->deallocate(p, n * sizeof(T));
    }

    bool operator==(HugePageAllocator b) const {
        return hp == b.hp;
    }

    bool operator!=(HugePageAllocator b) const {
        return hp != b.hp;
    }
};

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

} // atomic_queue

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#endif // HUGE_PAGES_H_INCLUDED