15 #ifndef __included_ssvm_fifo_h__ 16 #define __included_ssvm_fifo_h__ 39 #define SVM_FIFO_TRACE (0) 40 #define OOO_SEGMENT_INVALID_INDEX ((u32)~0) 41 #define SVM_FIFO_INVALID_SESSION_INDEX ((u32)~0) 50 typedef struct _svm_fifo
56 volatile u32 has_event;
59 u32 master_session_index;
60 u32 client_session_index;
61 u8 master_thread_index;
62 u8 client_thread_index;
67 volatile u32 want_tx_evt;
76 struct _svm_fifo *next;
77 struct _svm_fifo *prev;
98 #define svm_fifo_trace_add(_f, _s, _l, _t) \ 100 svm_fifo_trace_elem_t *trace_elt; \ 101 vec_add2(_f->trace, trace_elt, 1); \ 102 trace_elt->offset = _s; \ 103 trace_elt->len = _l; \ 104 trace_elt->action = _t; \ 107 #define svm_fifo_trace_add(_f, _s, _l, _t) 122 return (f->cursize == f->nitems);
128 return (f->cursize == 0);
161 return !__atomic_exchange_n (&f->has_event, 1, __ATOMIC_RELEASE);
172 __sync_lock_release (&f->has_event);
178 f->want_tx_evt = want_evt;
184 return f->want_tx_evt;
191 const u8 * copy_from_here);
193 u32 required_bytes,
u8 * copy_from_here);
228 return ((f->tail > f->head) ? (f->tail - f->head) : (f->nitems - f->head));
237 return ((f->tail >= f->head) ? (f->nitems - f->tail) : (f->head - f->tail));
249 f->tail = (f->tail + bytes) % f->nitems;
256 return (f->data + f->head);
262 return (f->data + f->tail);
272 return (((f->nitems + pos) - f->tail) % f->nitems);
278 return (((f->nitems + f->tail) - pos) % f->nitems);
int svm_fifo_dequeue_drop(svm_fifo_t *f, u32 max_bytes)
static vlib_cli_command_t trace
(constructor) VLIB_CLI_COMMAND (trace)
#define CLIB_CACHE_LINE_ALIGN_MARK(mark)
format_function_t format_ooo_segment
static int svm_fifo_is_full(svm_fifo_t *f)
u8 * svm_fifo_replay(u8 *s, svm_fifo_t *f, u8 no_read, u8 verbose)
static u8 svm_fifo_has_ooo_data(svm_fifo_t *f)
format_function_t format_svm_fifo
Fixed length block allocator.
u32 prev
Previous linked-list element pool index.
void svm_fifo_segments_free(svm_fifo_t *f, svm_fifo_segment_t *fs)
static u32 svm_fifo_max_enqueue(svm_fifo_t *f)
svm_fifo_t * svm_fifo_create(u32 data_size_in_bytes)
create an svm fifo, in the current heap.
static u8 * svm_fifo_tail(svm_fifo_t *f)
static u32 ooo_segment_distance_from_tail(svm_fifo_t *f, u32 pos)
struct _svm_fifo svm_fifo_t
static void svm_fifo_enqueue_nocopy(svm_fifo_t *f, u32 bytes)
Advance tail pointer.
static int svm_fifo_is_empty(svm_fifo_t *f)
static u32 ooo_segment_end_offset(svm_fifo_t *f, ooo_segment_t *s)
static u8 svm_fifo_want_tx_evt(svm_fifo_t *f)
static u32 svm_fifo_max_dequeue(svm_fifo_t *f)
static u32 svm_fifo_max_write_chunk(svm_fifo_t *f)
Max contiguous chunk of data that can be written.
static u32 ooo_segment_length(svm_fifo_t *f, ooo_segment_t *s)
u8 * svm_fifo_dump_trace(u8 *s, svm_fifo_t *f)
int svm_fifo_dequeue_nowait(svm_fifo_t *f, u32 max_bytes, u8 *copy_here)
static u8 * svm_fifo_head(svm_fifo_t *f)
static u32 svm_fifo_max_read_chunk(svm_fifo_t *f)
Max contiguous chunk of data that can be read.
static void svm_fifo_newest_ooo_segment_reset(svm_fifo_t *f)
void svm_fifo_overwrite_head(svm_fifo_t *f, u8 *data, u32 len)
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
void svm_fifo_dequeue_drop_all(svm_fifo_t *f)
static u32 ooo_segment_offset(svm_fifo_t *f, ooo_segment_t *s)
static ooo_segment_t * ooo_segment_next(svm_fifo_t *f, ooo_segment_t *s)
static void svm_fifo_unset_event(svm_fifo_t *f)
Unsets fifo event flag.
static ooo_segment_t * svm_fifo_newest_ooo_segment(svm_fifo_t *f)
static u8 svm_fifo_set_event(svm_fifo_t *f)
Sets fifo event flag.
struct svm_fifo_segment_ svm_fifo_segment_t
format_function_t format_ooo_list
int svm_fifo_enqueue_nowait(svm_fifo_t *f, u32 max_bytes, const u8 *copy_from_here)
static void svm_fifo_set_want_tx_evt(svm_fifo_t *f, u8 want_evt)
static ooo_segment_t * ooo_segment_get_prev(svm_fifo_t *f, ooo_segment_t *s)
#define OOO_SEGMENT_INVALID_INDEX
void svm_fifo_init_pointers(svm_fifo_t *f, u32 pointer)
Set fifo pointers to requested offset.
int svm_fifo_segments(svm_fifo_t *f, svm_fifo_segment_t *fs)
void svm_fifo_free(svm_fifo_t *f)
u32 length
Length of segment.
u32 next
Next linked-list element pool index.
template key/value backing page structure
int svm_fifo_peek(svm_fifo_t *f, u32 offset, u32 max_bytes, u8 *copy_here)
u32 svm_fifo_number_ooo_segments(svm_fifo_t *f)
static int svm_fifo_has_event(svm_fifo_t *f)
u32 start
Start of segment, normalized.
ooo_segment_t * svm_fifo_first_ooo_segment(svm_fifo_t *f)
int svm_fifo_enqueue_with_offset(svm_fifo_t *f, u32 offset, u32 required_bytes, u8 *copy_from_here)
CLIB vectors are ubiquitous dynamically resized arrays with by user defined "headers".
static u32 ooo_segment_distance_to_tail(svm_fifo_t *f, u32 pos)