-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrte_ring_rts.h
344 lines (324 loc) · 10.7 KB
/
rte_ring_rts.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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
/* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2010-2020 Intel Corporation
* Copyright (c) 2007-2009 Kip Macy kmacy@freebsd.org
* All rights reserved.
* Derived from FreeBSD's bufring.h
* Used as BSD-3 Licensed with permission from Kip Macy.
*/
#ifndef _RTE_RING_RTS_H_
#define _RTE_RING_RTS_H_
/**
* @file rte_ring_rts.h
* It is not recommended to include this file directly.
* Please include <rte_ring.h> instead.
*
* Contains functions for Relaxed Tail Sync (RTS) ring mode.
* The main idea remains the same as for our original MP/MC synchronization
* mechanism.
* The main difference is that tail value is increased not
* by every thread that finished enqueue/dequeue,
* but only by the current last one doing enqueue/dequeue.
* That allows threads to skip spinning on tail value,
* leaving actual tail value change to last thread at a given instance.
* RTS requires 2 64-bit CAS for each enqueue(/dequeue) operation:
* one for head update, second for tail update.
* As a gain it allows thread to avoid spinning/waiting on tail value.
* In comparison original MP/MC algorithm requires one 32-bit CAS
* for head update and waiting/spinning on tail value.
*
* Brief outline:
* - introduce update counter (cnt) for both head and tail.
* - increment head.cnt for each head.value update
* - write head.value and head.cnt atomically (64-bit CAS)
* - move tail.value ahead only when tail.cnt + 1 == head.cnt
* (indicating that this is the last thread updating the tail)
* - increment tail.cnt when each enqueue/dequeue op finishes
* (no matter if tail.value going to change or not)
* - write tail.value and tail.cnt atomically (64-bit CAS)
*
* To avoid producer/consumer starvation:
* - limit max allowed distance between head and tail value (HTD_MAX).
* I.E. thread is allowed to proceed with changing head.value,
* only when: head.value - tail.value <= HTD_MAX
* HTD_MAX is an optional parameter.
* With HTD_MAX == 0 we'll have fully serialized ring -
* i.e. only one thread at a time will be able to enqueue/dequeue
* to/from the ring.
* With HTD_MAX >= ring.capacity - no limitation.
* By default HTD_MAX == ring.capacity / 8.
*/
#include <rte_ring_rts_elem_pvt.h>
#ifdef __cplusplus
extern "C" {
#endif
/**
* Enqueue several objects on the RTS ring (multi-producers safe).
*
* @param r
* A pointer to the ring structure.
* @param obj_table
* A pointer to a table of objects.
* @param esize
* The size of ring element, in bytes. It must be a multiple of 4.
* This must be the same value used while creating the ring. Otherwise
* the results are undefined.
* @param n
* The number of objects to add in the ring from the obj_table.
* @param free_space
* if non-NULL, returns the amount of space in the ring after the
* enqueue operation has finished.
* @return
* The number of objects enqueued, either 0 or n
*/
static __rte_always_inline unsigned int
rte_ring_mp_rts_enqueue_bulk_elem(struct rte_ring *r, const void *obj_table,
unsigned int esize, unsigned int n, unsigned int *free_space)
{
return __rte_ring_do_rts_enqueue_elem(r, obj_table, esize, n,
RTE_RING_QUEUE_FIXED, free_space);
}
/**
* Dequeue several objects from an RTS ring (multi-consumers safe).
*
* @param r
* A pointer to the ring structure.
* @param obj_table
* A pointer to a table of objects that will be filled.
* @param esize
* The size of ring element, in bytes. It must be a multiple of 4.
* This must be the same value used while creating the ring. Otherwise
* the results are undefined.
* @param n
* The number of objects to dequeue from the ring to the obj_table.
* @param available
* If non-NULL, returns the number of remaining ring entries after the
* dequeue has finished.
* @return
* The number of objects dequeued, either 0 or n
*/
static __rte_always_inline unsigned int
rte_ring_mc_rts_dequeue_bulk_elem(struct rte_ring *r, void *obj_table,
unsigned int esize, unsigned int n, unsigned int *available)
{
return __rte_ring_do_rts_dequeue_elem(r, obj_table, esize, n,
RTE_RING_QUEUE_FIXED, available);
}
/**
* Enqueue several objects on the RTS ring (multi-producers safe).
*
* @param r
* A pointer to the ring structure.
* @param obj_table
* A pointer to a table of objects.
* @param esize
* The size of ring element, in bytes. It must be a multiple of 4.
* This must be the same value used while creating the ring. Otherwise
* the results are undefined.
* @param n
* The number of objects to add in the ring from the obj_table.
* @param free_space
* if non-NULL, returns the amount of space in the ring after the
* enqueue operation has finished.
* @return
* - n: Actual number of objects enqueued.
*/
static __rte_always_inline unsigned int
rte_ring_mp_rts_enqueue_burst_elem(struct rte_ring *r, const void *obj_table,
unsigned int esize, unsigned int n, unsigned int *free_space)
{
return __rte_ring_do_rts_enqueue_elem(r, obj_table, esize, n,
RTE_RING_QUEUE_VARIABLE, free_space);
}
/**
* Dequeue several objects from an RTS ring (multi-consumers safe).
* When the requested objects are more than the available objects,
* only dequeue the actual number of objects.
*
* @param r
* A pointer to the ring structure.
* @param obj_table
* A pointer to a table of objects that will be filled.
* @param esize
* The size of ring element, in bytes. It must be a multiple of 4.
* This must be the same value used while creating the ring. Otherwise
* the results are undefined.
* @param n
* The number of objects to dequeue from the ring to the obj_table.
* @param available
* If non-NULL, returns the number of remaining ring entries after the
* dequeue has finished.
* @return
* - n: Actual number of objects dequeued, 0 if ring is empty
*/
static __rte_always_inline unsigned int
rte_ring_mc_rts_dequeue_burst_elem(struct rte_ring *r, void *obj_table,
unsigned int esize, unsigned int n, unsigned int *available)
{
return __rte_ring_do_rts_dequeue_elem(r, obj_table, esize, n,
RTE_RING_QUEUE_VARIABLE, available);
}
/**
* Enqueue several objects on the RTS ring (multi-producers safe).
*
* @param r
* A pointer to the ring structure.
* @param obj_table
* A pointer to a table of void * pointers (objects).
* @param n
* The number of objects to add in the ring from the obj_table.
* @param free_space
* if non-NULL, returns the amount of space in the ring after the
* enqueue operation has finished.
* @return
* The number of objects enqueued, either 0 or n
*/
static __rte_always_inline unsigned int
rte_ring_mp_rts_enqueue_bulk(struct rte_ring *r, void * const *obj_table,
unsigned int n, unsigned int *free_space)
{
return rte_ring_mp_rts_enqueue_bulk_elem(r, obj_table,
sizeof(uintptr_t), n, free_space);
}
/**
* Dequeue several objects from an RTS ring (multi-consumers safe).
*
* @param r
* A pointer to the ring structure.
* @param obj_table
* A pointer to a table of void * pointers (objects) that will be filled.
* @param n
* The number of objects to dequeue from the ring to the obj_table.
* @param available
* If non-NULL, returns the number of remaining ring entries after the
* dequeue has finished.
* @return
* The number of objects dequeued, either 0 or n
*/
static __rte_always_inline unsigned int
rte_ring_mc_rts_dequeue_bulk(struct rte_ring *r, void **obj_table,
unsigned int n, unsigned int *available)
{
return rte_ring_mc_rts_dequeue_bulk_elem(r, obj_table,
sizeof(uintptr_t), n, available);
}
/**
* Enqueue several objects on the RTS ring (multi-producers safe).
*
* @param r
* A pointer to the ring structure.
* @param obj_table
* A pointer to a table of void * pointers (objects).
* @param n
* The number of objects to add in the ring from the obj_table.
* @param free_space
* if non-NULL, returns the amount of space in the ring after the
* enqueue operation has finished.
* @return
* - n: Actual number of objects enqueued.
*/
static __rte_always_inline unsigned int
rte_ring_mp_rts_enqueue_burst(struct rte_ring *r, void * const *obj_table,
unsigned int n, unsigned int *free_space)
{
return rte_ring_mp_rts_enqueue_burst_elem(r, obj_table,
sizeof(uintptr_t), n, free_space);
}
/**
* Dequeue several objects from an RTS ring (multi-consumers safe).
* When the requested objects are more than the available objects,
* only dequeue the actual number of objects.
*
* @param r
* A pointer to the ring structure.
* @param obj_table
* A pointer to a table of void * pointers (objects) that will be filled.
* @param n
* The number of objects to dequeue from the ring to the obj_table.
* @param available
* If non-NULL, returns the number of remaining ring entries after the
* dequeue has finished.
* @return
* - n: Actual number of objects dequeued, 0 if ring is empty
*/
static __rte_always_inline unsigned int
rte_ring_mc_rts_dequeue_burst(struct rte_ring *r, void **obj_table,
unsigned int n, unsigned int *available)
{
return rte_ring_mc_rts_dequeue_burst_elem(r, obj_table,
sizeof(uintptr_t), n, available);
}
/**
* Return producer max Head-Tail-Distance (HTD).
*
* @param r
* A pointer to the ring structure.
* @return
* Producer HTD value, if producer is set in appropriate sync mode,
* or UINT32_MAX otherwise.
*/
static inline uint32_t
rte_ring_get_prod_htd_max(const struct rte_ring *r)
{
if (r->prod.sync_type == RTE_RING_SYNC_MT_RTS)
return r->rts_prod.htd_max;
return UINT32_MAX;
}
/**
* Set producer max Head-Tail-Distance (HTD).
* Note that producer has to use appropriate sync mode (RTS).
*
* @param r
* A pointer to the ring structure.
* @param v
* new HTD value to setup.
* @return
* Zero on success, or negative error code otherwise.
*/
static inline int
rte_ring_set_prod_htd_max(struct rte_ring *r, uint32_t v)
{
if (r->prod.sync_type != RTE_RING_SYNC_MT_RTS)
return -ENOTSUP;
r->rts_prod.htd_max = v;
return 0;
}
/**
* Return consumer max Head-Tail-Distance (HTD).
*
* @param r
* A pointer to the ring structure.
* @return
* Consumer HTD value, if consumer is set in appropriate sync mode,
* or UINT32_MAX otherwise.
*/
static inline uint32_t
rte_ring_get_cons_htd_max(const struct rte_ring *r)
{
if (r->cons.sync_type == RTE_RING_SYNC_MT_RTS)
return r->rts_cons.htd_max;
return UINT32_MAX;
}
/**
* Set consumer max Head-Tail-Distance (HTD).
* Note that consumer has to use appropriate sync mode (RTS).
*
* @param r
* A pointer to the ring structure.
* @param v
* new HTD value to setup.
* @return
* Zero on success, or negative error code otherwise.
*/
static inline int
rte_ring_set_cons_htd_max(struct rte_ring *r, uint32_t v)
{
if (r->cons.sync_type != RTE_RING_SYNC_MT_RTS)
return -ENOTSUP;
r->rts_cons.htd_max = v;
return 0;
}
#ifdef __cplusplus
}
#endif
#endif /* _RTE_RING_RTS_H_ */