blob: d06d77a42f712d9f184ab5a87dd431074fb73580 [file] [log] [blame]
Dave Barach68b0fb02017-02-28 15:15:56 -05001/*
2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
6 *
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
14 */
15#ifndef __included_ssvm_fifo_h__
16#define __included_ssvm_fifo_h__
17
18#include <vppinfra/clib.h>
19#include <vppinfra/vec.h>
20#include <vppinfra/mheap.h>
21#include <vppinfra/heap.h>
22#include <vppinfra/pool.h>
23#include <vppinfra/format.h>
24#include <pthread.h>
25
Dave Barach68b0fb02017-02-28 15:15:56 -050026/** Out-of-order segment */
27typedef struct
28{
29 u32 next; /**< Next linked-list element pool index */
30 u32 prev; /**< Previous linked-list element pool index */
31
Dave Barach1f75cfd2017-04-14 16:46:44 -040032 u32 start; /**< Start of segment, normalized*/
Florin Corasa5464812017-04-19 13:00:05 -070033 u32 length; /**< Length of segment */
Dave Barach68b0fb02017-02-28 15:15:56 -050034} ooo_segment_t;
35
Dave Barach1f75cfd2017-04-14 16:46:44 -040036format_function_t format_ooo_segment;
37format_function_t format_ooo_list;
38
Florin Coras3eb50622017-07-13 01:24:57 -040039#define SVM_FIFO_TRACE (0)
Dave Barach68b0fb02017-02-28 15:15:56 -050040#define OOO_SEGMENT_INVALID_INDEX ((u32)~0)
41
Florin Coras3eb50622017-07-13 01:24:57 -040042typedef struct
43{
44 u32 offset;
45 u32 len;
46 u32 action;
47} svm_fifo_trace_elem_t;
48
Dave Barach10d8cc62017-05-30 09:30:07 -040049typedef struct _svm_fifo
Dave Barach68b0fb02017-02-28 15:15:56 -050050{
Florin Coras3e350af2017-03-30 02:54:28 -070051 volatile u32 cursize; /**< current fifo size */
52 u32 nitems;
53 CLIB_CACHE_LINE_ALIGN_MARK (end_cursize);
54
Dave Barachacd2a6a2017-05-16 17:41:34 -040055 volatile u32 has_event; /**< non-zero if deq event exists */
Dave Barach68b0fb02017-02-28 15:15:56 -050056
57 /* Backpointers */
Florin Corasa5464812017-04-19 13:00:05 -070058 u32 master_session_index;
Dave Barach68b0fb02017-02-28 15:15:56 -050059 u32 client_session_index;
Florin Corasa5464812017-04-19 13:00:05 -070060 u8 master_thread_index;
Dave Barach68b0fb02017-02-28 15:15:56 -050061 u8 client_thread_index;
Florin Coras6cf30ad2017-04-04 23:08:23 -070062 u32 segment_manager;
Dave Barach68b0fb02017-02-28 15:15:56 -050063 CLIB_CACHE_LINE_ALIGN_MARK (end_shared);
64 u32 head;
65 CLIB_CACHE_LINE_ALIGN_MARK (end_consumer);
66
67 /* producer */
68 u32 tail;
69
70 ooo_segment_t *ooo_segments; /**< Pool of ooo segments */
71 u32 ooos_list_head; /**< Head of out-of-order linked-list */
72 u32 ooos_newest; /**< Last segment to have been updated */
Dave Barach10d8cc62017-05-30 09:30:07 -040073 struct _svm_fifo *next; /**< next in freelist/active chain */
74 struct _svm_fifo *prev; /**< prev in active chain */
Florin Coras3eb50622017-07-13 01:24:57 -040075#if SVM_FIFO_TRACE
76 svm_fifo_trace_elem_t *trace;
77#endif
Dave Barach818eb542017-08-02 13:56:13 -040078 u32 freelist_index; /**< aka log2(allocated_size) - const. */
79 i8 refcnt; /**< reference count */
Dave Barach68b0fb02017-02-28 15:15:56 -050080 CLIB_CACHE_LINE_ALIGN_MARK (data);
81} svm_fifo_t;
82
Florin Coras3eb50622017-07-13 01:24:57 -040083#if SVM_FIFO_TRACE
84#define svm_fifo_trace_add(_f, _s, _l, _t) \
85{ \
86 svm_fifo_trace_elem_t *trace_elt; \
87 vec_add2(_f->trace, trace_elt, 1); \
88 trace_elt->offset = _s; \
89 trace_elt->len = _l; \
90 trace_elt->action = _t; \
91}
92#else
93#define svm_fifo_trace_add(_f, _s, _l, _t)
94#endif
95
96u8 *svm_fifo_dump_trace (u8 * s, svm_fifo_t * f);
97u8 *svm_fifo_replay (u8 * s, svm_fifo_t * f, u8 no_read, u8 verbose);
98
Dave Barach68b0fb02017-02-28 15:15:56 -050099static inline u32
100svm_fifo_max_dequeue (svm_fifo_t * f)
101{
102 return f->cursize;
103}
104
105static inline u32
106svm_fifo_max_enqueue (svm_fifo_t * f)
107{
Florin Coras3e350af2017-03-30 02:54:28 -0700108 return f->nitems - svm_fifo_max_dequeue (f);
Dave Barach68b0fb02017-02-28 15:15:56 -0500109}
110
111static inline u8
112svm_fifo_has_ooo_data (svm_fifo_t * f)
113{
114 return f->ooos_list_head != OOO_SEGMENT_INVALID_INDEX;
115}
116
Florin Coras6792ec02017-03-13 03:49:51 -0700117/**
118 * Sets fifo event flag.
119 *
120 * @return 1 if flag was not set.
121 */
122always_inline u8
123svm_fifo_set_event (svm_fifo_t * f)
124{
125 /* Probably doesn't need to be atomic. Still, better avoid surprises */
126 return __sync_lock_test_and_set (&f->has_event, 1) == 0;
127}
128
129/**
130 * Unsets fifo event flag.
131 */
132always_inline void
133svm_fifo_unset_event (svm_fifo_t * f)
134{
135 /* Probably doesn't need to be atomic. Still, better avoid surprises */
Dave Barachacd2a6a2017-05-16 17:41:34 -0400136 __sync_lock_release (&f->has_event);
Florin Coras6792ec02017-03-13 03:49:51 -0700137}
138
Dave Barach68b0fb02017-02-28 15:15:56 -0500139svm_fifo_t *svm_fifo_create (u32 data_size_in_bytes);
Florin Coras6cf30ad2017-04-04 23:08:23 -0700140void svm_fifo_free (svm_fifo_t * f);
Dave Barach68b0fb02017-02-28 15:15:56 -0500141
Florin Corasa5464812017-04-19 13:00:05 -0700142int svm_fifo_enqueue_nowait (svm_fifo_t * f, u32 max_bytes,
Florin Coras371ca502018-02-21 12:07:41 -0800143 const u8 * copy_from_here);
Florin Corasa5464812017-04-19 13:00:05 -0700144int svm_fifo_enqueue_with_offset (svm_fifo_t * f, u32 offset,
145 u32 required_bytes, u8 * copy_from_here);
146int svm_fifo_dequeue_nowait (svm_fifo_t * f, u32 max_bytes, u8 * copy_here);
Dave Barach68b0fb02017-02-28 15:15:56 -0500147
Florin Corasa5464812017-04-19 13:00:05 -0700148int svm_fifo_peek (svm_fifo_t * f, u32 offset, u32 max_bytes, u8 * copy_here);
149int svm_fifo_dequeue_drop (svm_fifo_t * f, u32 max_bytes);
Dave Barach1f75cfd2017-04-14 16:46:44 -0400150u32 svm_fifo_number_ooo_segments (svm_fifo_t * f);
151ooo_segment_t *svm_fifo_first_ooo_segment (svm_fifo_t * f);
Florin Corasc28764f2017-04-26 00:08:42 -0700152void svm_fifo_init_pointers (svm_fifo_t * f, u32 pointer);
Dave Barach68b0fb02017-02-28 15:15:56 -0500153
Florin Coras6cf30ad2017-04-04 23:08:23 -0700154format_function_t format_svm_fifo;
155
Dave Barach68b0fb02017-02-28 15:15:56 -0500156always_inline ooo_segment_t *
157svm_fifo_newest_ooo_segment (svm_fifo_t * f)
158{
Florin Corasf03a59a2017-06-09 21:07:32 -0700159 if (f->ooos_newest == OOO_SEGMENT_INVALID_INDEX)
160 return 0;
161 return pool_elt_at_index (f->ooo_segments, f->ooos_newest);
162}
163
Florin Coras3eb50622017-07-13 01:24:57 -0400164always_inline void
165svm_fifo_newest_ooo_segment_reset (svm_fifo_t * f)
166{
167 f->ooos_newest = OOO_SEGMENT_INVALID_INDEX;
168}
169
Florin Coras58d36f02018-03-09 13:05:53 -0800170/**
171 * Max contiguous chunk of data that can be read
172 */
173always_inline u32
174svm_fifo_max_read_chunk (svm_fifo_t * f)
175{
176 return ((f->tail > f->head) ? (f->tail - f->head) : (f->nitems - f->head));
177}
178
179/**
180 * Max contiguous chunk of data that can be written
181 */
182always_inline u32
183svm_fifo_max_write_chunk (svm_fifo_t * f)
184{
185 return ((f->tail >= f->head) ? (f->nitems - f->tail) : (f->head - f->tail));
186}
187
188/**
189 * Advance tail pointer
190 *
191 * Useful for moving tail pointer after external enqueue.
192 */
193always_inline void
194svm_fifo_enqueue_nocopy (svm_fifo_t * f, u32 bytes)
195{
196 ASSERT (bytes <= svm_fifo_max_enqueue (f));
197 f->tail = (f->tail + bytes) % f->nitems;
198 f->cursize += bytes;
199}
200
201always_inline u8 *
202svm_fifo_head (svm_fifo_t * f)
203{
204 return (f->data + f->head);
205}
206
207always_inline u8 *
208svm_fifo_tail (svm_fifo_t * f)
209{
210 return (f->data + f->tail);
211}
212
Florin Corasf03a59a2017-06-09 21:07:32 -0700213always_inline u32
Dave Barach2c25a622017-06-26 11:35:07 -0400214ooo_segment_distance_from_tail (svm_fifo_t * f, u32 pos)
Florin Corasf03a59a2017-06-09 21:07:32 -0700215{
216 /* Ambiguous. Assumption is that ooo segments don't touch tail */
Dave Barach2c25a622017-06-26 11:35:07 -0400217 if (PREDICT_FALSE (pos == f->tail && f->tail == f->head))
Florin Corasf03a59a2017-06-09 21:07:32 -0700218 return f->nitems;
219
Dave Barach2c25a622017-06-26 11:35:07 -0400220 return (((f->nitems + pos) - f->tail) % f->nitems);
221}
222
223always_inline u32
224ooo_segment_distance_to_tail (svm_fifo_t * f, u32 pos)
225{
226 return (((f->nitems + f->tail) - pos) % f->nitems);
Dave Barach68b0fb02017-02-28 15:15:56 -0500227}
228
229always_inline u32
230ooo_segment_offset (svm_fifo_t * f, ooo_segment_t * s)
231{
Dave Barach2c25a622017-06-26 11:35:07 -0400232 return ooo_segment_distance_from_tail (f, s->start);
Dave Barach68b0fb02017-02-28 15:15:56 -0500233}
234
235always_inline u32
236ooo_segment_end_offset (svm_fifo_t * f, ooo_segment_t * s)
237{
Dave Barach2c25a622017-06-26 11:35:07 -0400238 return ooo_segment_distance_from_tail (f, s->start) + s->length;
Florin Corasf03a59a2017-06-09 21:07:32 -0700239}
240
241always_inline u32
242ooo_segment_length (svm_fifo_t * f, ooo_segment_t * s)
243{
244 return s->length;
Dave Barach1f75cfd2017-04-14 16:46:44 -0400245}
246
247always_inline ooo_segment_t *
248ooo_segment_get_prev (svm_fifo_t * f, ooo_segment_t * s)
249{
250 if (s->prev == OOO_SEGMENT_INVALID_INDEX)
251 return 0;
252 return pool_elt_at_index (f->ooo_segments, s->prev);
Dave Barach68b0fb02017-02-28 15:15:56 -0500253}
254
Florin Coras3eb50622017-07-13 01:24:57 -0400255always_inline ooo_segment_t *
256ooo_segment_next (svm_fifo_t * f, ooo_segment_t * s)
257{
258 if (s->next == OOO_SEGMENT_INVALID_INDEX)
259 return 0;
260 return pool_elt_at_index (f->ooo_segments, s->next);
261}
262
Dave Barach68b0fb02017-02-28 15:15:56 -0500263#endif /* __included_ssvm_fifo_h__ */
264
265/*
266 * fd.io coding-style-patch-verification: ON
267 *
268 * Local Variables:
269 * eval: (c-set-style "gnu")
270 * End:
271 */