2 * Copyright (c) 2016-2019 Cisco and/or its affiliates.
3 * Copyright (c) 2019 Arm Limited
4 * Copyright (c) 2010-2017 Intel Corporation and/or its affiliates.
5 * Copyright (c) 2007-2009 Kip Macy kmacy@freebsd.org
6 * Inspired from DPDK rte_ring.h (SPSC only) (derived from freebsd bufring.h).
7 * Licensed under the Apache License, Version 2.0 (the "License");
8 * you may not use this file except in compliance with the License.
9 * You may obtain a copy of the License at:
11 * http://www.apache.org/licenses/LICENSE-2.0
13 * Unless required by applicable law or agreed to in writing, software
14 * distributed under the License is distributed on an "AS IS" BASIS,
15 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 * See the License for the specific language governing permissions and
17 * limitations under the License.
19 #ifndef __included_ssvm_fifo_h__
20 #define __included_ssvm_fifo_h__
22 #include <vppinfra/clib.h>
23 #include <vppinfra/vec.h>
24 #include <vppinfra/pool.h>
25 #include <vppinfra/format.h>
26 #include <vppinfra/rbtree.h>
28 /** Out-of-order segment */
31 u32 next; /**< Next linked-list element pool index */
32 u32 prev; /**< Previous linked-list element pool index */
34 u32 start; /**< Start of segment, normalized*/
35 u32 length; /**< Length of segment */
38 #define SVM_FIFO_TRACE (0)
39 #define OOO_SEGMENT_INVALID_INDEX ((u32)~0)
40 #define SVM_FIFO_INVALID_SESSION_INDEX ((u32)~0)
41 #define SVM_FIFO_INVALID_INDEX ((u32)~0)
42 #define SVM_FIFO_MAX_EVT_SUBSCRIBERS 7
46 SVM_FIFO_NO_TX_NOTIF = 0,
47 SVM_FIFO_WANT_TX_NOTIF = 1,
48 SVM_FIFO_WANT_TX_NOTIF_IF_FULL = 2,
56 } svm_fifo_trace_elem_t;
58 typedef struct svm_fifo_chunk_
62 struct svm_fifo_chunk_ *next;
66 typedef enum svm_fifo_flag_
68 SVM_FIFO_F_SIZE_UPDATE = 1 << 0,
69 SVM_FIFO_F_MULTI_CHUNK = 1 << 1,
72 typedef struct _svm_fifo
74 CLIB_CACHE_LINE_ALIGN_MARK (shared_first);
75 u32 size; /**< size of the fifo */
76 u32 nitems; /**< usable size(size-1) */
77 u8 flags; /**< fifo flags */
78 svm_fifo_chunk_t *start_chunk;/**< first chunk in fifo chunk list */
79 svm_fifo_chunk_t *end_chunk; /**< end chunk in fifo chunk list */
80 svm_fifo_chunk_t *new_chunks; /**< chunks yet to be added to list */
81 rb_tree_t chunk_lookup;
83 CLIB_CACHE_LINE_ALIGN_MARK (shared_second);
84 volatile u32 has_event; /**< non-zero if deq event exists */
86 u32 master_session_index;
87 u32 client_session_index;
88 u8 master_thread_index;
89 u8 client_thread_index;
92 u32 ct_session_index; /**< Local session index for vpp */
93 u32 freelist_index; /**< aka log2(allocated_size) - const. */
94 i8 refcnt; /**< reference count */
95 struct _svm_fifo *next; /**< next in freelist/active chain */
96 struct _svm_fifo *prev; /**< prev in active chain */
98 CLIB_CACHE_LINE_ALIGN_MARK (consumer);
99 u32 head; /**< fifo head position/byte */
100 svm_fifo_chunk_t *head_chunk; /**< tracks chunk where head lands */
101 svm_fifo_chunk_t *ooo_deq; /**< last chunk used for ooo dequeue */
102 volatile u32 want_tx_ntf; /**< producer wants nudge */
103 volatile u32 has_tx_ntf;
105 CLIB_CACHE_LINE_ALIGN_MARK (producer);
106 u32 tail; /**< fifo tail position/byte */
107 u32 ooos_list_head; /**< Head of out-of-order linked-list */
108 svm_fifo_chunk_t *tail_chunk; /**< tracks chunk where tail lands */
109 svm_fifo_chunk_t *ooo_enq; /**< last chunk used for ooo enqueue */
110 ooo_segment_t *ooo_segments; /**< Pool of ooo segments */
111 u32 ooos_newest; /**< Last segment to have been updated */
112 volatile u8 n_subscribers;
113 u8 subscribers[SVM_FIFO_MAX_EVT_SUBSCRIBERS];
116 svm_fifo_trace_elem_t *trace;
119 svm_fifo_chunk_t default_chunk;
127 typedef struct svm_fifo_segment_
131 } svm_fifo_segment_t;
134 #define svm_fifo_trace_add(_f, _s, _l, _t) \
136 svm_fifo_trace_elem_t *trace_elt; \
137 vec_add2(_f->trace, trace_elt, 1); \
138 trace_elt->offset = _s; \
139 trace_elt->len = _l; \
140 trace_elt->action = _t; \
143 #define svm_fifo_trace_add(_f, _s, _l, _t)
146 u8 *svm_fifo_dump_trace (u8 * s, svm_fifo_t * f);
147 u8 *svm_fifo_replay (u8 * s, svm_fifo_t * f, u8 no_read, u8 verbose);
149 /* internal function */
151 f_load_head_tail_cons (svm_fifo_t * f, u32 * head, u32 * tail)
153 /* load-relaxed: consumer owned index */
155 /* load-acq: consumer foreign index (paired with store-rel in producer) */
156 *tail = clib_atomic_load_acq_n (&f->tail);
159 /* internal function */
161 f_load_head_tail_prod (svm_fifo_t * f, u32 * head, u32 * tail)
163 /* load relaxed: producer owned index */
165 /* load-acq: producer foreign index (paired with store-rel in consumer) */
166 *head = clib_atomic_load_acq_n (&f->head);
169 /* producer consumer role independent */
170 /* internal function */
172 f_load_head_tail_all_acq (svm_fifo_t * f, u32 * head, u32 * tail)
174 /* load-acq : consumer foreign index (paired with store-rel) */
175 *tail = clib_atomic_load_acq_n (&f->tail);
176 /* load-acq : producer foriegn index (paired with store-rel) */
177 *head = clib_atomic_load_acq_n (&f->head);
180 /* internal function */
182 f_free_count (svm_fifo_t * f, u32 head, u32 tail)
184 return (f->nitems + head - tail);
187 /* internal function */
189 f_cursize (svm_fifo_t * f, u32 head, u32 tail)
191 return (f->nitems - f_free_count (f, head, tail));
194 /* used by consumer */
196 svm_fifo_max_dequeue_cons (svm_fifo_t * f)
199 f_load_head_tail_cons (f, &head, &tail);
200 return f_cursize (f, head, tail);
203 /* used by producer*/
205 svm_fifo_max_dequeue_prod (svm_fifo_t * f)
208 f_load_head_tail_prod (f, &head, &tail);
209 return f_cursize (f, head, tail);
212 /* use producer or consumer specific functions for perfomance.
213 * svm_fifo_max_dequeue_cons (svm_fifo_t *f)
214 * svm_fifo_max_dequeue_prod (svm_fifo_t *f)
217 svm_fifo_max_dequeue (svm_fifo_t * f)
220 f_load_head_tail_all_acq (f, &head, &tail);
221 return f_cursize (f, head, tail);
224 /* used by producer */
226 svm_fifo_is_full_prod (svm_fifo_t * f)
228 return (svm_fifo_max_dequeue_prod (f) == f->nitems);
231 /* use producer or consumer specific functions for perfomance.
232 * svm_fifo_is_full_prod (svm_fifo_t * f)
233 * add cons version if needed
236 svm_fifo_is_full (svm_fifo_t * f)
238 return (svm_fifo_max_dequeue (f) == f->nitems);
241 /* used by consumer */
243 svm_fifo_is_empty_cons (svm_fifo_t * f)
245 return (svm_fifo_max_dequeue_cons (f) == 0);
248 /* used by producer */
250 svm_fifo_is_empty_prod (svm_fifo_t * f)
252 return (svm_fifo_max_dequeue_prod (f) == 0);
255 /* use producer or consumer specific functions for perfomance.
256 * svm_fifo_is_empty_cons (svm_fifo_t * f)
257 * svm_fifo_is_empty_prod (svm_fifo_t * f)
260 svm_fifo_is_empty (svm_fifo_t * f)
262 return (svm_fifo_max_dequeue (f) == 0);
266 svm_fifo_is_wrapped (svm_fifo_t * f)
269 f_load_head_tail_all_acq (f, &head, &tail);
270 return head % f->size > tail % f->size;
273 /* used by producer*/
275 svm_fifo_max_enqueue_prod (svm_fifo_t * f)
278 f_load_head_tail_prod (f, &head, &tail);
279 return f_free_count (f, head, tail);
282 /* use producer or consumer specfic functions for perfomance.
283 * svm_fifo_max_enqueue_prod (svm_fifo_t *f)
284 * add consumer specific version if needed.
287 svm_fifo_max_enqueue (svm_fifo_t * f)
290 f_load_head_tail_all_acq (f, &head, &tail);
291 return f_free_count (f, head, tail);
295 svm_fifo_has_event (svm_fifo_t * f)
301 svm_fifo_has_ooo_data (svm_fifo_t * f)
303 return f->ooos_list_head != OOO_SEGMENT_INVALID_INDEX;
307 * Sets fifo event flag.
309 * Also acts as a release ordering.
311 * @return 1 if flag was not set.
314 svm_fifo_set_event (svm_fifo_t * f)
316 /* return __sync_lock_test_and_set (&f->has_event, 1) == 0;
317 return __sync_bool_compare_and_swap (&f->has_event, 0, 1); */
318 return !clib_atomic_swap_rel_n (&f->has_event, 1);
322 * Unsets fifo event flag.
324 * Also acts as an acquire barrier.
327 svm_fifo_unset_event (svm_fifo_t * f)
329 clib_atomic_swap_acq_n (&f->has_event, 0);
332 svm_fifo_t *svm_fifo_create (u32 data_size_in_bytes);
333 void svm_fifo_init (svm_fifo_t * f, u32 size);
335 * Grow fifo size by adding chunk to chunk list
337 * If fifos are allocated on a segment, this should be called with
338 * the segment's heap pushed.
340 * @param f fifo to be extended
341 * @param c chunk or linked list of chunks to be added
343 void svm_fifo_add_chunk (svm_fifo_t * f, svm_fifo_chunk_t * c);
344 void svm_fifo_free (svm_fifo_t * f);
346 int svm_fifo_enqueue_nowait (svm_fifo_t * f, u32 max_bytes,
347 const u8 * copy_from_here);
348 int svm_fifo_enqueue_with_offset (svm_fifo_t * f, u32 offset,
349 u32 required_bytes, u8 * copy_from_here);
350 int svm_fifo_dequeue_nowait (svm_fifo_t * f, u32 max_bytes, u8 * copy_here);
352 int svm_fifo_peek (svm_fifo_t * f, u32 offset, u32 max_bytes, u8 * copy_here);
353 int svm_fifo_dequeue_drop (svm_fifo_t * f, u32 max_bytes);
354 void svm_fifo_dequeue_drop_all (svm_fifo_t * f);
355 int svm_fifo_segments (svm_fifo_t * f, svm_fifo_segment_t * fs);
356 void svm_fifo_segments_free (svm_fifo_t * f, svm_fifo_segment_t * fs);
357 void svm_fifo_init_pointers (svm_fifo_t * f, u32 head, u32 tail);
358 void svm_fifo_clone (svm_fifo_t * df, svm_fifo_t * sf);
359 void svm_fifo_overwrite_head (svm_fifo_t * f, u8 * data, u32 len);
360 void svm_fifo_add_subscriber (svm_fifo_t * f, u8 subscriber);
361 void svm_fifo_del_subscriber (svm_fifo_t * f, u8 subscriber);
362 format_function_t format_svm_fifo;
365 * Max contiguous chunk of data that can be read
368 svm_fifo_max_read_chunk (svm_fifo_t * f)
371 u32 head_idx, tail_idx;
372 f_load_head_tail_cons (f, &head, &tail);
373 head_idx = head % f->size;
374 tail_idx = tail % f->size;
375 return tail_idx > head_idx ? (tail_idx - head_idx) : (f->size - head_idx);
379 * Max contiguous chunk of data that can be written
382 svm_fifo_max_write_chunk (svm_fifo_t * f)
385 u32 head_idx, tail_idx;
386 f_load_head_tail_prod (f, &head, &tail);
387 head_idx = head % f->size;
388 tail_idx = tail % f->size;
389 return tail_idx >= head_idx ? (f->size - tail_idx) : (head_idx - tail_idx);
393 * Advance tail pointer
395 * Useful for moving tail pointer after external enqueue.
398 svm_fifo_enqueue_nocopy (svm_fifo_t * f, u32 bytes)
400 ASSERT (bytes <= svm_fifo_max_enqueue_prod (f));
401 /* load-relaxed: producer owned index */
404 /* store-rel: producer owned index (paired with load-acq in consumer) */
405 clib_atomic_store_rel_n (&f->tail, tail);
409 svm_fifo_head (svm_fifo_t * f)
411 /* load-relaxed: consumer owned index */
412 return (f->head_chunk->data
413 + ((f->head % f->size) - f->head_chunk->start_byte));
417 svm_fifo_tail (svm_fifo_t * f)
419 /* load-relaxed: producer owned index */
420 return (f->tail_chunk->data
421 + ((f->tail % f->size) - f->tail_chunk->start_byte));
425 svm_fifo_add_want_tx_ntf (svm_fifo_t * f, u8 ntf_type)
427 f->want_tx_ntf |= ntf_type;
431 svm_fifo_del_want_tx_ntf (svm_fifo_t * f, u8 ntf_type)
433 f->want_tx_ntf &= ~ntf_type;
437 svm_fifo_clear_tx_ntf (svm_fifo_t * f)
439 /* Set the flag if want_tx_notif_if_full was the only ntf requested */
440 f->has_tx_ntf = f->want_tx_ntf == SVM_FIFO_WANT_TX_NOTIF_IF_FULL;
441 svm_fifo_del_want_tx_ntf (f, SVM_FIFO_WANT_TX_NOTIF);
445 svm_fifo_reset_tx_ntf (svm_fifo_t * f)
451 svm_fifo_needs_tx_ntf (svm_fifo_t * f, u32 n_last_deq)
453 u8 want_ntf = f->want_tx_ntf;
455 if (PREDICT_TRUE (want_ntf == SVM_FIFO_NO_TX_NOTIF))
457 else if (want_ntf & SVM_FIFO_WANT_TX_NOTIF)
459 else if (want_ntf & SVM_FIFO_WANT_TX_NOTIF_IF_FULL)
461 u32 max_deq = svm_fifo_max_dequeue_cons (f);
462 u32 nitems = f->nitems;
463 if (!f->has_tx_ntf && max_deq < nitems
464 && max_deq + n_last_deq >= nitems)
473 svm_fifo_n_subscribers (svm_fifo_t * f)
475 return f->n_subscribers;
478 u32 svm_fifo_number_ooo_segments (svm_fifo_t * f);
479 ooo_segment_t *svm_fifo_first_ooo_segment (svm_fifo_t * f);
481 always_inline ooo_segment_t *
482 svm_fifo_newest_ooo_segment (svm_fifo_t * f)
484 if (f->ooos_newest == OOO_SEGMENT_INVALID_INDEX)
486 return pool_elt_at_index (f->ooo_segments, f->ooos_newest);
490 svm_fifo_newest_ooo_segment_reset (svm_fifo_t * f)
492 f->ooos_newest = OOO_SEGMENT_INVALID_INDEX;
496 ooo_segment_distance_from_tail (svm_fifo_t * f, u32 pos, u32 tail)
498 return ((pos - tail) % f->size);
502 ooo_segment_distance_to_tail (svm_fifo_t * f, u32 pos, u32 tail)
504 return ((tail - pos) % f->size);
508 ooo_segment_offset_prod (svm_fifo_t * f, ooo_segment_t * s)
511 /* load-relaxed: producer owned index */
514 return ooo_segment_distance_from_tail (f, s->start, tail);
518 ooo_segment_length (svm_fifo_t * f, ooo_segment_t * s)
523 always_inline ooo_segment_t *
524 ooo_segment_get_prev (svm_fifo_t * f, ooo_segment_t * s)
526 if (s->prev == OOO_SEGMENT_INVALID_INDEX)
528 return pool_elt_at_index (f->ooo_segments, s->prev);
531 always_inline ooo_segment_t *
532 ooo_segment_next (svm_fifo_t * f, ooo_segment_t * s)
534 if (s->next == OOO_SEGMENT_INVALID_INDEX)
536 return pool_elt_at_index (f->ooo_segments, s->next);
539 #endif /* __included_ssvm_fifo_h__ */
542 * fd.io coding-style-patch-verification: ON
545 * eval: (c-set-style "gnu")