-
Notifications
You must be signed in to change notification settings - Fork 0
/
scsp_fifo.h
160 lines (148 loc) · 4.51 KB
/
scsp_fifo.h
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
#pragma once
/*
* Copyright 2010-2020, Tarantool AUTHORS, please see AUTHORS file.
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following
* conditions are met:
*
* 1. Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
* <COPYRIGHT HOLDER> OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "pmatomic.h"
template<class T>
struct scsp_fifo {
/*
* Next position to be written
*/
unsigned write;
/*
* Next position to be read
*/
unsigned read;
/*
* Circular buffer length
*/
unsigned len;
/*
* Buffer contains pointers
*/
T buffer[];
};
template <class T>
static inline int
scsp_fifo_init(struct scsp_fifo<T> *fifo, unsigned size)
{
/* Ensure size is power of 2 */
if (size & (size - 1))
return -1;
fifo->write = 0;
fifo->read = 0;
fifo->len = size;
return 0;
}
/*
* Adds num elements into the fifo in case when we have one writing thread.
* Return the number actually written.
*/
template <class T>
static inline unsigned
scsp_fifo_put(struct scsp_fifo<T> *fifo, T *data, unsigned num)
{
unsigned i = 0;
unsigned fifo_write = fifo->write;
unsigned new_write = fifo_write;
unsigned fifo_read = pm_atomic_load_explicit(&fifo->read, pm_memory_order_acquire);
for (i = 0; i < num; i++) {
new_write = (new_write + 1) & (fifo->len - 1);
if (new_write == fifo_read)
break;
fifo->buffer[fifo_write] = data[i];
fifo_write = new_write;
}
pm_atomic_store_explicit(&fifo->write, fifo_write, pm_memory_order_release);
return i;
}
/*
* Get up to num elements from the fifo. Return the number actually read
*/
template <class T>
static inline unsigned
scsp_fifo_get(struct scsp_fifo<T> *fifo, T *data, unsigned num)
{
unsigned i = 0;
unsigned new_read = fifo->read;
unsigned fifo_write = pm_atomic_load_explicit(&fifo->write, pm_memory_order_acquire);
for (i = 0; i < num; i++) {
if (new_read == fifo_write)
break;
data[i] = fifo->buffer[new_read];
new_read = (new_read + 1) & (fifo->len - 1);
}
pm_atomic_store_explicit(&fifo->read, new_read, pm_memory_order_release);
return i;
}
/*
* If T is a type that contains a function and a pointer to a function,
* then this function for all queue elements of type T calls the functions
* contained in the corresponding element with their arguments
*/
template <class T>
static inline unsigned
scsp_fifo_execute(struct scsp_fifo<T> *fifo)
{
unsigned i = 0;
unsigned new_read = fifo->read;
unsigned fifo_write = pm_atomic_load_explicit(&fifo->write, pm_memory_order_acquire);
for(;;) {
if (new_read == fifo_write)
break;
fifo->buffer[new_read].fun(fifo->buffer[new_read].fun_arg);
new_read = (new_read + 1) & (fifo->len - 1);
i++;
}
pm_atomic_store_explicit(&fifo->read, new_read, pm_memory_order_release);
return i;
}
/*
* Get the num of elements in the fifo
*/
template <class T>
static inline unsigned
scsp_fifo_count(struct scsp_fifo<T> *fifo)
{
unsigned fifo_write = pm_atomic_load_explicit(&fifo->write, pm_memory_order_acquire);
unsigned fifo_read = pm_atomic_load_explicit(&fifo->read, pm_memory_order_acquire);
return (fifo->len + fifo_write - fifo_read) & (fifo->len - 1);
}
/*
* Get the num of available elements in the fifo
*/
template <class T>
static inline unsigned
scsp_fifo_free_count(struct scsp_fifo<T> *fifo)
{
unsigned fifo_write = pm_atomic_load_explicit(&fifo->write, pm_memory_order_acquire);
unsigned fifo_read = pm_atomic_load_explicit(&fifo->read, pm_memory_order_acquire);
return (fifo_read - fifo_write - 1) & (fifo->len - 1);
}