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.
20 #include <svm/svm_fifo.h>
21 #include <vppinfra/cpu.h>
23 CLIB_MARCH_FN (svm_fifo_copy_to_chunk, void, svm_fifo_t * f,
24 svm_fifo_chunk_t * c, u32 tail_idx, const u8 * src, u32 len,
25 svm_fifo_chunk_t ** last)
29 ASSERT (tail_idx >= c->start_byte && tail_idx < c->start_byte + c->length);
31 tail_idx -= c->start_byte;
32 n_chunk = c->length - tail_idx;
36 clib_memcpy_fast (&c->data[tail_idx], src, n_chunk);
38 while ((to_copy -= n_chunk))
40 n_chunk = clib_min (c->length, to_copy);
41 clib_memcpy_fast (&c->data[0], src + (len - to_copy), n_chunk);
42 c = c->length <= to_copy ? c->next : c;
49 clib_memcpy_fast (&c->data[tail_idx], src, len);
53 CLIB_MARCH_FN (svm_fifo_copy_from_chunk, void, svm_fifo_t * f,
54 svm_fifo_chunk_t * c, u32 head_idx, u8 * dst, u32 len,
55 svm_fifo_chunk_t ** last)
59 ASSERT (head_idx >= c->start_byte && head_idx < c->start_byte + c->length);
61 head_idx -= c->start_byte;
62 n_chunk = c->length - head_idx;
66 clib_memcpy_fast (dst, &c->data[head_idx], n_chunk);
68 while ((to_copy -= n_chunk))
70 n_chunk = clib_min (c->length, to_copy);
71 clib_memcpy_fast (dst + (len - to_copy), &c->data[0], n_chunk);
72 c = c->length <= to_copy ? c->next : c;
79 clib_memcpy_fast (dst, &c->data[head_idx], len);
83 #ifndef CLIB_MARCH_VARIANT
86 svm_fifo_copy_to_chunk (svm_fifo_t * f, svm_fifo_chunk_t * c, u32 tail_idx,
87 const u8 * src, u32 len, svm_fifo_chunk_t ** last)
89 CLIB_MARCH_FN_SELECT (svm_fifo_copy_to_chunk) (f, c, tail_idx, src, len,
94 svm_fifo_copy_from_chunk (svm_fifo_t * f, svm_fifo_chunk_t * c, u32 head_idx,
95 u8 * dst, u32 len, svm_fifo_chunk_t ** last)
97 CLIB_MARCH_FN_SELECT (svm_fifo_copy_from_chunk) (f, c, head_idx, dst, len,
102 position_lt (svm_fifo_t * f, u32 a, u32 b, u32 tail)
104 return (f_distance_to (f, a, tail) < f_distance_to (f, b, tail));
108 position_leq (svm_fifo_t * f, u32 a, u32 b, u32 tail)
110 return (f_distance_to (f, a, tail) <= f_distance_to (f, b, tail));
114 position_gt (svm_fifo_t * f, u32 a, u32 b, u32 tail)
116 return (f_distance_to (f, a, tail) > f_distance_to (f, b, tail));
120 position_diff (svm_fifo_t * f, u32 a, u32 b, u32 tail)
122 return f_distance_to (f, a, tail) - f_distance_to (f, b, tail);
126 ooo_segment_end_pos (svm_fifo_t * f, ooo_segment_t * s)
128 return s->start + s->length;
132 svm_fifo_free_ooo_data (svm_fifo_t * f)
134 pool_free (f->ooo_segments);
137 static inline ooo_segment_t *
138 ooo_segment_get_prev (svm_fifo_t * f, ooo_segment_t * s)
140 if (s->prev == OOO_SEGMENT_INVALID_INDEX)
142 return pool_elt_at_index (f->ooo_segments, s->prev);
145 static inline ooo_segment_t *
146 ooo_segment_next (svm_fifo_t * f, ooo_segment_t * s)
148 if (s->next == OOO_SEGMENT_INVALID_INDEX)
150 return pool_elt_at_index (f->ooo_segments, s->next);
153 static inline ooo_segment_t *
154 ooo_segment_alloc (svm_fifo_t * f, u32 start, u32 length)
158 pool_get (f->ooo_segments, s);
162 s->prev = s->next = OOO_SEGMENT_INVALID_INDEX;
168 ooo_segment_free (svm_fifo_t * f, u32 index)
170 ooo_segment_t *cur, *prev = 0, *next = 0;
171 cur = pool_elt_at_index (f->ooo_segments, index);
173 if (cur->next != OOO_SEGMENT_INVALID_INDEX)
175 next = pool_elt_at_index (f->ooo_segments, cur->next);
176 next->prev = cur->prev;
179 if (cur->prev != OOO_SEGMENT_INVALID_INDEX)
181 prev = pool_elt_at_index (f->ooo_segments, cur->prev);
182 prev->next = cur->next;
186 f->ooos_list_head = cur->next;
189 pool_put (f->ooo_segments, cur);
193 * Add segment to fifo's out-of-order segment list. Takes care of merging
194 * adjacent segments and removing overlapping ones.
197 ooo_segment_add (svm_fifo_t * f, u32 offset, u32 head, u32 tail, u32 length)
199 ooo_segment_t *s, *new_s, *prev, *next, *it;
200 u32 new_index, s_end_pos, s_index;
201 u32 offset_pos, offset_end_pos;
203 ASSERT (offset + length <= f_distance_to (f, head, tail) || head == tail);
205 offset_pos = tail + offset;
206 offset_end_pos = tail + offset + length;
208 f->ooos_newest = OOO_SEGMENT_INVALID_INDEX;
210 if (f->ooos_list_head == OOO_SEGMENT_INVALID_INDEX)
212 s = ooo_segment_alloc (f, offset_pos, length);
213 f->ooos_list_head = s - f->ooo_segments;
214 f->ooos_newest = f->ooos_list_head;
218 /* Find first segment that starts after new segment */
219 s = pool_elt_at_index (f->ooo_segments, f->ooos_list_head);
220 while (s->next != OOO_SEGMENT_INVALID_INDEX
221 && position_lt (f, s->start, offset_pos, tail))
222 s = pool_elt_at_index (f->ooo_segments, s->next);
224 /* If we have a previous and we overlap it, use it as starting point */
225 prev = ooo_segment_get_prev (f, s);
227 && position_leq (f, offset_pos, ooo_segment_end_pos (f, prev), tail))
230 s_end_pos = ooo_segment_end_pos (f, s);
232 /* Since we have previous, offset start position cannot be smaller
233 * than prev->start. Check tail */
234 ASSERT (position_lt (f, s->start, offset_pos, tail));
238 s_index = s - f->ooo_segments;
239 s_end_pos = ooo_segment_end_pos (f, s);
241 /* No overlap, add before current segment */
242 if (position_lt (f, offset_end_pos, s->start, tail))
244 new_s = ooo_segment_alloc (f, offset_pos, length);
245 new_index = new_s - f->ooo_segments;
247 /* Pool might've moved, get segment again */
248 s = pool_elt_at_index (f->ooo_segments, s_index);
249 if (s->prev != OOO_SEGMENT_INVALID_INDEX)
251 new_s->prev = s->prev;
252 prev = pool_elt_at_index (f->ooo_segments, new_s->prev);
253 prev->next = new_index;
258 f->ooos_list_head = new_index;
261 new_s->next = s_index;
263 f->ooos_newest = new_index;
266 /* No overlap, add after current segment */
267 else if (position_gt (f, offset_pos, s_end_pos, tail))
269 new_s = ooo_segment_alloc (f, offset_pos, length);
270 new_index = new_s - f->ooo_segments;
272 /* Pool might've moved, get segment again */
273 s = pool_elt_at_index (f->ooo_segments, s_index);
275 /* Needs to be last */
276 ASSERT (s->next == OOO_SEGMENT_INVALID_INDEX);
278 new_s->prev = s_index;
280 f->ooos_newest = new_index;
290 if (position_lt (f, offset_pos, s->start, tail))
292 s->start = offset_pos;
293 s->length = position_diff (f, s_end_pos, s->start, tail);
294 f->ooos_newest = s - f->ooo_segments;
299 /* Overlapping tail */
300 if (position_gt (f, offset_end_pos, s_end_pos, tail))
302 s->length = position_diff (f, offset_end_pos, s->start, tail);
304 /* Remove the completely overlapped segments in the tail */
305 it = ooo_segment_next (f, s);
306 while (it && position_leq (f, ooo_segment_end_pos (f, it),
307 offset_end_pos, tail))
309 next = ooo_segment_next (f, it);
310 ooo_segment_free (f, it - f->ooo_segments);
314 /* If partial overlap with last, merge */
315 if (it && position_leq (f, it->start, offset_end_pos, tail))
317 s->length = position_diff (f, ooo_segment_end_pos (f, it),
319 ooo_segment_free (f, it - f->ooo_segments);
321 f->ooos_newest = s - f->ooo_segments;
326 * Removes segments that can now be enqueued because the fifo's tail has
327 * advanced. Returns the number of bytes added to tail.
330 ooo_segment_try_collect (svm_fifo_t * f, u32 n_bytes_enqueued, u32 * tail)
332 u32 s_index, bytes = 0;
336 s = pool_elt_at_index (f->ooo_segments, f->ooos_list_head);
337 diff = f_distance_from (f, s->start, *tail);
339 ASSERT (diff != n_bytes_enqueued);
341 if (diff > n_bytes_enqueued)
344 /* If last tail update overlaps one/multiple ooo segments, remove them */
345 while (0 <= diff && diff < n_bytes_enqueued)
347 s_index = s - f->ooo_segments;
349 /* Segment end is beyond the tail. Advance tail and remove segment */
350 if (s->length > diff)
352 bytes = s->length - diff;
353 *tail = *tail + bytes;
354 ooo_segment_free (f, s_index);
358 /* If we have next go on */
359 if (s->next != OOO_SEGMENT_INVALID_INDEX)
361 s = pool_elt_at_index (f->ooo_segments, s->next);
362 diff = f_distance_from (f, s->start, *tail);
363 ooo_segment_free (f, s_index);
368 ooo_segment_free (f, s_index);
373 ASSERT (bytes <= f->nitems);
378 svm_fifo_init (svm_fifo_t * f, u32 size)
382 * usable size of the fifo set to rounded_data_size - 1
383 * to differentiate between free fifo and empty fifo.
385 f->nitems = f->size - 1;
386 f->ooos_list_head = OOO_SEGMENT_INVALID_INDEX;
387 f->segment_index = SVM_FIFO_INVALID_INDEX;
389 f->default_chunk.start_byte = 0;
390 f->default_chunk.length = f->size;
391 f->default_chunk.next = f->start_chunk = f->end_chunk = &f->default_chunk;
392 f->head_chunk = f->tail_chunk = f->ooo_enq = f->ooo_deq = f->start_chunk;
396 * Creates a fifo in the current heap. Fails vs blow up the process
399 svm_fifo_create (u32 data_size_in_bytes)
402 u32 rounded_data_size;
404 /* always round fifo data size to the next highest power-of-two */
405 rounded_data_size = (1 << (max_log2 (data_size_in_bytes)));
406 f = clib_mem_alloc_aligned_or_null (sizeof (*f) + rounded_data_size,
407 CLIB_CACHE_LINE_BYTES);
411 clib_memset (f, 0, sizeof (*f));
412 svm_fifo_init (f, data_size_in_bytes);
417 * Creates a fifo chunk in the current heap
420 svm_fifo_chunk_alloc (u32 size)
425 /* round chunk size to the next highest power-of-two */
426 rounded_size = (1 << (max_log2 (size)));
427 c = clib_mem_alloc_aligned_or_null (sizeof (*c) + rounded_size,
428 CLIB_CACHE_LINE_BYTES);
432 clib_memset (c, 0, sizeof (*c));
433 c->length = rounded_size;
438 svm_fifo_size_update (svm_fifo_t * f, svm_fifo_chunk_t * c)
440 svm_fifo_chunk_t *prev;
446 f->end_chunk->next = c;
449 add_bytes += c->length;
454 prev->next = f->start_chunk;
455 f->size += add_bytes;
456 f->nitems = f->size - 1;
461 svm_fifo_try_size_update (svm_fifo_t * f, u32 new_head)
463 if (new_head % f->size > f->tail % f->size)
466 svm_fifo_size_update (f, f->new_chunks);
467 f->flags &= ~SVM_FIFO_F_SIZE_UPDATE;
471 svm_fifo_add_chunk (svm_fifo_t * f, svm_fifo_chunk_t * c)
473 svm_fifo_chunk_t *cur, *prev;
475 /* Initialize rbtree if needed and add default chunk to it */
476 if (!(f->flags & SVM_FIFO_F_MULTI_CHUNK))
478 rb_tree_init (&f->chunk_lookup);
479 rb_tree_add2 (&f->chunk_lookup, 0, pointer_to_uword (f->start_chunk));
480 f->flags |= SVM_FIFO_F_MULTI_CHUNK;
483 /* Initialize chunks and add to lookup rbtree. Expectation is that this is
484 * called with the heap where the rbtree's pool is pushed. */
488 prev = f->new_chunks;
498 cur->start_byte = prev->start_byte + prev->length;
499 rb_tree_add2 (&f->chunk_lookup, cur->start_byte,
500 pointer_to_uword (cur));
505 /* If fifo is not wrapped, update the size now */
506 if (!svm_fifo_is_wrapped (f))
508 ASSERT (!f->new_chunks);
509 svm_fifo_size_update (f, c);
513 /* Postpone size update */
517 f->flags |= SVM_FIFO_F_SIZE_UPDATE;
522 svm_fifo_chunk_includes_pos (svm_fifo_chunk_t * c, u32 pos)
524 return (pos >= c->start_byte && pos < c->start_byte + c->length);
528 * Find chunk for given byte position
531 * @param pos normalized position in fifo
533 * @return chunk that includes given position or 0
535 static svm_fifo_chunk_t *
536 svm_fifo_find_chunk (svm_fifo_t * f, u32 pos)
538 rb_tree_t *rt = &f->chunk_lookup;
539 rb_node_t *cur, *prev;
542 cur = rb_node (rt, rt->root);
543 while (pos != cur->key)
547 cur = rb_node_left (rt, cur);
549 cur = rb_node_right (rt, cur);
551 if (rb_node_is_tnil (rt, cur))
553 /* Hit tnil as a left child. Find predecessor */
556 cur = rb_tree_predecessor (rt, prev);
557 c = uword_to_pointer (cur->opaque, svm_fifo_chunk_t *);
558 if (svm_fifo_chunk_includes_pos (c, pos))
562 /* Hit tnil as a right child. Check if this is the one */
563 c = uword_to_pointer (prev->opaque, svm_fifo_chunk_t *);
564 if (svm_fifo_chunk_includes_pos (c, pos))
571 if (!rb_node_is_tnil (rt, cur))
572 return uword_to_pointer (cur->opaque, svm_fifo_chunk_t *);
577 svm_fifo_free_chunk_lookup (svm_fifo_t * f)
579 rb_tree_free_nodes (&f->chunk_lookup);
583 svm_fifo_free (svm_fifo_t * f)
585 ASSERT (f->refcnt > 0);
587 if (--f->refcnt == 0)
589 /* ooo data is not allocated on segment heap */
590 svm_fifo_free_chunk_lookup (f);
596 svm_fifo_overwrite_head (svm_fifo_t * f, u8 * src, u32 len)
599 u32 head, tail, head_idx;
602 ASSERT (len <= f->nitems);
604 f_load_head_tail_cons (f, &head, &tail);
606 head_idx = head % f->size;
607 head_idx -= c->start_byte;
608 n_chunk = c->length - head_idx;
610 clib_memcpy_fast (&c->data[head_idx], src, len);
613 clib_memcpy_fast (&c->data[head_idx], src, n_chunk);
614 clib_memcpy_fast (&c->next->data[0], src + n_chunk, len - n_chunk);
619 svm_fifo_enqueue (svm_fifo_t * f, u32 len, const u8 * src)
621 u32 tail, head, free_count;
623 f_load_head_tail_prod (f, &head, &tail);
625 /* free space in fifo can only increase during enqueue: SPSC */
626 free_count = f_free_count (f, head, tail);
628 f->ooos_newest = OOO_SEGMENT_INVALID_INDEX;
630 if (PREDICT_FALSE (free_count == 0))
631 return SVM_FIFO_EFULL;
633 /* number of bytes we're going to copy */
634 len = clib_min (free_count, len);
635 svm_fifo_copy_to_chunk (f, f->tail_chunk, tail % f->size, src, len,
639 svm_fifo_trace_add (f, head, len, 2);
641 /* collect out-of-order segments */
642 if (PREDICT_FALSE (f->ooos_list_head != OOO_SEGMENT_INVALID_INDEX))
643 len += ooo_segment_try_collect (f, len, &tail);
645 /* store-rel: producer owned index (paired with load-acq in consumer) */
646 clib_atomic_store_rel_n (&f->tail, tail);
652 * Enqueue a future segment.
654 * Two choices: either copies the entire segment, or copies nothing
655 * Returns 0 of the entire segment was copied
656 * Returns -1 if none of the segment was copied due to lack of space
659 svm_fifo_enqueue_with_offset (svm_fifo_t * f, u32 offset, u32 len, u8 * src)
661 u32 tail, head, free_count, tail_idx;
663 f_load_head_tail_prod (f, &head, &tail);
665 /* free space in fifo can only increase during enqueue: SPSC */
666 free_count = f_free_count (f, head, tail);
668 /* will this request fit? */
669 if ((len + offset) > free_count)
670 return SVM_FIFO_EFULL;
672 f->ooos_newest = OOO_SEGMENT_INVALID_INDEX;
673 svm_fifo_trace_add (f, offset, len, 1);
674 ooo_segment_add (f, offset, head, tail, len);
675 tail_idx = (tail % f->size + offset) % f->size;
677 if (!svm_fifo_chunk_includes_pos (f->ooo_enq, tail_idx))
678 f->ooo_enq = svm_fifo_find_chunk (f, tail_idx);
680 svm_fifo_copy_to_chunk (f, f->ooo_enq, tail_idx, src, len, &f->ooo_enq);
686 svm_fifo_dequeue (svm_fifo_t * f, u32 len, u8 * dst)
688 u32 tail, head, cursize;
690 f_load_head_tail_cons (f, &head, &tail);
692 /* current size of fifo can only increase during dequeue: SPSC */
693 cursize = f_cursize (f, head, tail);
695 if (PREDICT_FALSE (cursize == 0))
696 return SVM_FIFO_EEMPTY;
698 len = clib_min (cursize, len);
699 svm_fifo_copy_from_chunk (f, f->head_chunk, head % f->size, dst, len,
703 if (PREDICT_FALSE (f->flags & SVM_FIFO_F_SIZE_UPDATE))
704 svm_fifo_try_size_update (f, head);
706 /* store-rel: consumer owned index (paired with load-acq in producer) */
707 clib_atomic_store_rel_n (&f->head, head);
713 svm_fifo_peek (svm_fifo_t * f, u32 offset, u32 len, u8 * dst)
715 u32 tail, head, cursize, head_idx;
717 f_load_head_tail_cons (f, &head, &tail);
719 /* current size of fifo can only increase during peek: SPSC */
720 cursize = f_cursize (f, head, tail);
722 if (PREDICT_FALSE (cursize < offset))
723 return SVM_FIFO_EEMPTY;
725 len = clib_min (cursize - offset, len);
726 head_idx = (head % f->size + offset) % f->size;
727 if (!svm_fifo_chunk_includes_pos (f->ooo_deq, head_idx))
728 f->ooo_deq = svm_fifo_find_chunk (f, head_idx);
730 svm_fifo_copy_from_chunk (f, f->ooo_deq, head_idx, dst, len, &f->ooo_deq);
735 svm_fifo_dequeue_drop (svm_fifo_t * f, u32 len)
737 u32 total_drop_bytes, tail, head, cursize;
739 f_load_head_tail_cons (f, &head, &tail);
741 /* number of bytes available */
742 cursize = f_cursize (f, head, tail);
743 if (PREDICT_FALSE (cursize == 0))
744 return SVM_FIFO_EEMPTY;
746 svm_fifo_trace_add (f, tail, total_drop_bytes, 3);
748 /* number of bytes we're going to drop */
749 total_drop_bytes = clib_min (cursize, len);
752 head += total_drop_bytes;
754 /* store-rel: consumer owned index (paired with load-acq in producer) */
755 clib_atomic_store_rel_n (&f->head, head);
757 return total_drop_bytes;
761 svm_fifo_dequeue_drop_all (svm_fifo_t * f)
763 /* consumer foreign index */
764 u32 tail = clib_atomic_load_acq_n (&f->tail);
765 /* store-rel: consumer owned index (paired with load-acq in producer) */
766 clib_atomic_store_rel_n (&f->head, tail);
770 svm_fifo_segments (svm_fifo_t * f, svm_fifo_seg_t * fs)
772 u32 cursize, head, tail, head_idx;
774 f_load_head_tail_cons (f, &head, &tail);
776 /* consumer function, cursize can only increase while we're working */
777 cursize = f_cursize (f, head, tail);
779 if (PREDICT_FALSE (cursize == 0))
780 return SVM_FIFO_EEMPTY;
782 head_idx = head % f->size;
786 fs[0].len = f->size - head_idx;
787 fs[0].data = f->head_chunk->data + head_idx;
788 fs[1].len = cursize - fs[0].len;
789 fs[1].data = f->head_chunk->data;
794 fs[0].data = f->head_chunk->data + head_idx;
802 svm_fifo_segments_free (svm_fifo_t * f, svm_fifo_seg_t * fs)
806 /* consumer owned index */
808 head_idx = head % f->size;
810 ASSERT (fs[0].data == f->head_chunk->data + head_idx);
811 head += fs[0].len + fs[1].len;
812 /* store-rel: consumer owned index (paired with load-acq in producer) */
813 clib_atomic_store_rel_n (&f->head, head);
820 * - no prod and cons are accessing either dest or src fifo
821 * - fifo is not multi chunk
824 svm_fifo_clone (svm_fifo_t * df, svm_fifo_t * sf)
827 clib_memcpy_fast (df->head_chunk->data, sf->head_chunk->data, sf->size);
829 f_load_head_tail_all_acq (sf, &head, &tail);
830 clib_atomic_store_rel_n (&df->head, head);
831 clib_atomic_store_rel_n (&df->tail, tail);
835 svm_fifo_n_ooo_segments (svm_fifo_t * f)
837 return pool_elts (f->ooo_segments);
841 svm_fifo_first_ooo_segment (svm_fifo_t * f)
843 return pool_elt_at_index (f->ooo_segments, f->ooos_list_head);
847 * Set fifo pointers to requested offset
850 svm_fifo_init_pointers (svm_fifo_t * f, u32 head, u32 tail)
852 clib_atomic_store_rel_n (&f->head, head);
853 clib_atomic_store_rel_n (&f->tail, tail);
854 if (f->flags & SVM_FIFO_F_MULTI_CHUNK)
857 c = svm_fifo_find_chunk (f, head % f->size);
859 f->head_chunk = f->ooo_deq = c;
860 c = svm_fifo_find_chunk (f, tail % f->size);
862 f->tail_chunk = f->ooo_enq = c;
867 svm_fifo_add_subscriber (svm_fifo_t * f, u8 subscriber)
869 if (f->n_subscribers >= SVM_FIFO_MAX_EVT_SUBSCRIBERS)
871 f->subscribers[f->n_subscribers++] = subscriber;
875 svm_fifo_del_subscriber (svm_fifo_t * f, u8 subscriber)
879 for (i = 0; i < f->n_subscribers; i++)
881 if (f->subscribers[i] != subscriber)
883 f->subscribers[i] = f->subscribers[f->n_subscribers - 1];
890 format_ooo_segment (u8 * s, va_list * args)
892 svm_fifo_t *f = va_arg (*args, svm_fifo_t *);
893 ooo_segment_t *seg = va_arg (*args, ooo_segment_t *);
894 u32 normalized_start = (seg->start + f->nitems - f->tail) % f->size;
895 s = format (s, "[%u, %u], len %u, next %d, prev %d", normalized_start,
896 (normalized_start + seg->length) % f->size, seg->length,
897 seg->next, seg->prev);
902 svm_fifo_dump_trace (u8 * s, svm_fifo_t * f)
905 svm_fifo_trace_elem_t *seg = 0;
910 vec_foreach (seg, f->trace)
912 s = format (s, "{%u, %u, %u}, ", seg->offset, seg->len, seg->action);
915 s = format (s, "\n");
917 s = format (s, "\n");
926 svm_fifo_replay (u8 * s, svm_fifo_t * f, u8 no_read, u8 verbose)
930 svm_fifo_trace_elem_t *trace;
932 svm_fifo_t *dummy_fifo;
939 trace_len = vec_len (trace);
945 dummy_fifo = svm_fifo_create (f->size);
946 clib_memset (f->head_chunk->data, 0xFF, f->nitems);
947 vec_validate (data, f->nitems);
948 for (i = 0; i < vec_len (data); i++)
951 for (i = 0; i < trace_len; i++)
953 offset = trace[i].offset;
954 if (trace[i].action == 1)
957 s = format (s, "adding [%u, %u]:", trace[i].offset,
958 (trace[i].offset + trace[i].len) % dummy_fifo->size);
959 svm_fifo_enqueue_with_offset (dummy_fifo, trace[i].offset,
960 trace[i].len, &data[offset]);
962 else if (trace[i].action == 2)
965 s = format (s, "adding [%u, %u]:", 0, trace[i].len);
966 svm_fifo_enqueue (dummy_fifo, trace[i].len, &data[offset]);
971 s = format (s, "read: %u", trace[i].len);
972 svm_fifo_dequeue_drop (dummy_fifo, trace[i].len);
975 s = format (s, "%U", format_svm_fifo, dummy_fifo, 1);
978 s = format (s, "result: %U", format_svm_fifo, dummy_fifo, 1);
984 format_ooo_list (u8 * s, va_list * args)
986 svm_fifo_t *f = va_arg (*args, svm_fifo_t *);
987 u32 indent = va_arg (*args, u32);
988 u32 ooo_segment_index = f->ooos_list_head;
991 while (ooo_segment_index != OOO_SEGMENT_INVALID_INDEX)
993 seg = pool_elt_at_index (f->ooo_segments, ooo_segment_index);
994 s = format (s, "%U%U\n", format_white_space, indent, format_ooo_segment,
996 ooo_segment_index = seg->next;
1003 format_svm_fifo (u8 * s, va_list * args)
1005 svm_fifo_t *f = va_arg (*args, svm_fifo_t *);
1006 int verbose = va_arg (*args, int);
1012 indent = format_get_indent (s);
1013 s = format (s, "cursize %u nitems %u has_event %d\n",
1014 svm_fifo_max_dequeue (f), f->nitems, f->has_event);
1015 s = format (s, "%Uhead %u tail %u segment manager %u\n", format_white_space,
1016 indent, (f->head % f->size), (f->tail % f->size),
1017 f->segment_manager);
1020 s = format (s, "%Uvpp session %d thread %d app session %d thread %d\n",
1021 format_white_space, indent, f->master_session_index,
1022 f->master_thread_index, f->client_session_index,
1023 f->client_thread_index);
1027 s = format (s, "%Uooo pool %d active elts newest %u\n",
1028 format_white_space, indent, pool_elts (f->ooo_segments),
1030 if (svm_fifo_has_ooo_data (f))
1031 s = format (s, " %U", format_ooo_list, f, indent, verbose);
1038 * fd.io coding-style-patch-verification: ON
1041 * eval: (c-set-style "gnu")