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

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

// Copyright (c) 2019 Maxim Egorushkin. MIT License. See the full licence in file LICENSE.

#include "benchmarks.h"

#include <concurrentqueue/concurrentqueue.h>
#include <readerwriterqueue/readerwriterqueue.h>

#include "atomic_queue/defs.h"

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

namespace atomic_queue {

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

template<class T, unsigned Capacity>
struct MoodyCamelQueue : moodycamel::ConcurrentQueue<T> {
    using producer_token_t = typename moodycamel::ConcurrentQueue<T>::producer_token_t;
    using consumer_token_t = typename moodycamel::ConcurrentQueue<T>::consumer_token_t;

    using ContextType = Context;

    struct Producer {
        producer_token_t t_;
        Producer(MoodyCamelQueue& q) noexcept : t_(q) {}
        void push(MoodyCamelQueue& q, T element) { q.push(t_, element); }
    };

    struct Consumer {
        consumer_token_t t_;
        Consumer(MoodyCamelQueue& q) noexcept : t_(q) {}
        T pop(MoodyCamelQueue& q) { return q.pop(t_); }
    };

    MoodyCamelQueue(Context context)
        : moodycamel::ConcurrentQueue<T>(Capacity, context.producers, 0)
    {}

    void push(producer_token_t& tok, T element) noexcept {
        while(!this->try_enqueue(tok, element))
            spin_loop_pause();
    }

    T pop(consumer_token_t& tok) noexcept {
        T element;
        while(!this->try_dequeue(tok, element))
            spin_loop_pause();
        return element;
    }
};

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

template<class T, unsigned Capacity>
struct MoodyCamelReaderWriterQueue : moodycamel::ReaderWriterQueue<T> {
    MoodyCamelReaderWriterQueue()
        : moodycamel::ReaderWriterQueue<T>(Capacity)
    {}

    void push(T element) noexcept {
        while(!this->try_enqueue(element))
            spin_loop_pause();
    }

    T pop() noexcept {
        T element;
        while(!this->try_dequeue(element))
            spin_loop_pause();
        return element;
    }
};

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

} // namespace atomic_queue

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

#endif // MOODYCAMEL_H_INCLUDED