2 * Copyright (c) 2019 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:
7 * http://www.apache.org/licenses/LICENSE-2.0
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.
15 #include <svm/svm_fifo.h>
16 #include <vlib/vlib.h>
18 #define SFIFO_TEST_I(_cond, _comment, _args...) \
20 int _evald = (_cond); \
22 fformat(stderr, "FAIL:%d: " _comment "\n", \
25 fformat(stderr, "PASS:%d: " _comment "\n", \
31 #define SFIFO_TEST(_cond, _comment, _args...) \
33 if (!SFIFO_TEST_I(_cond, _comment, ##_args)) { \
45 test_pattern_t test_pattern[] = {
46 {380, 8}, {768, 8}, {1156, 8}, {1544, 8}, {1932, 8}, {2320, 8}, {2708, 8},
47 {2992, 8}, {372, 8}, {760, 8}, {1148, 8}, {1536, 8}, {1924, 8}, {2312, 8},
48 {2700, 8}, {2984, 8}, {364, 8}, {752, 8}, {1140, 8}, {1528, 8}, {1916, 8},
49 {2304, 8}, {2692, 8}, {2976, 8}, {356, 8}, {744, 8}, {1132, 8}, {1520, 8},
50 {1908, 8}, {2296, 8}, {2684, 8}, {2968, 8}, {348, 8}, {736, 8}, {1124, 8},
51 {1512, 8}, {1900, 8}, {2288, 8}, {2676, 8}, {2960, 8}, {340, 8}, {728, 8},
52 {1116, 8}, {1504, 8}, {1892, 8}, {2280, 8}, {2668, 8}, {2952, 8}, {332, 8},
53 {720, 8}, {1108, 8}, {1496, 8}, {1884, 8}, {2272, 8}, {2660, 8}, {2944, 8},
54 {324, 8}, {712, 8}, {1100, 8}, {1488, 8}, {1876, 8}, {2264, 8}, {2652, 8},
55 {2936, 8}, {316, 8}, {704, 8}, {1092, 8}, {1480, 8}, {1868, 8}, {2256, 8},
56 {2644, 8}, {2928, 8}, {308, 8}, {696, 8}, {1084, 8}, {1472, 8}, {1860, 8},
57 {2248, 8}, {2636, 8}, {2920, 8}, {300, 8}, {688, 8}, {1076, 8}, {1464, 8},
58 {1852, 8}, {2240, 8}, {2628, 8}, {2912, 8}, {292, 8}, {680, 8}, {1068, 8},
59 {1456, 8}, {1844, 8}, {2232, 8}, {2620, 8}, {2904, 8}, {284, 8}, {672, 8},
60 {1060, 8}, {1448, 8}, {1836, 8}, {2224, 8}, {2612, 8}, {2896, 8}, {276, 8},
61 {664, 8}, {1052, 8}, {1440, 8}, {1828, 8}, {2216, 8}, {2604, 8}, {2888, 8},
62 {268, 8}, {656, 8}, {1044, 8}, {1432, 8}, {1820, 8}, {2208, 8}, {2596, 8},
63 {2880, 8}, {260, 8}, {648, 8}, {1036, 8}, {1424, 8}, {1812, 8}, {2200, 8},
64 {2588, 8}, {2872, 8}, {252, 8}, {640, 8}, {1028, 8}, {1416, 8}, {1804, 8},
65 {2192, 8}, {2580, 8}, {2864, 8}, {244, 8}, {632, 8}, {1020, 8}, {1408, 8},
66 {1796, 8}, {2184, 8}, {2572, 8}, {2856, 8}, {236, 8}, {624, 8}, {1012, 8},
67 {1400, 8}, {1788, 8}, {2176, 8}, {2564, 8}, {2848, 8}, {228, 8}, {616, 8},
68 {1004, 8}, {1392, 8}, {1780, 8}, {2168, 8}, {2556, 8}, {2840, 8}, {220, 8},
69 {608, 8}, {996, 8}, {1384, 8}, {1772, 8}, {2160, 8}, {2548, 8}, {2832, 8},
70 {212, 8}, {600, 8}, {988, 8}, {1376, 8}, {1764, 8}, {2152, 8}, {2540, 8},
71 {2824, 8}, {204, 8}, {592, 8}, {980, 8}, {1368, 8}, {1756, 8}, {2144, 8},
72 {2532, 8}, {2816, 8}, {196, 8}, {584, 8}, {972, 8}, {1360, 8}, {1748, 8},
73 {2136, 8}, {2524, 8}, {2808, 8}, {188, 8}, {576, 8}, {964, 8}, {1352, 8},
74 {1740, 8}, {2128, 8}, {2516, 8}, {2800, 8}, {180, 8}, {568, 8}, {956, 8},
75 {1344, 8}, {1732, 8}, {2120, 8}, {2508, 8}, {2792, 8}, {172, 8}, {560, 8},
76 {948, 8}, {1336, 8}, {1724, 8}, {2112, 8}, {2500, 8}, {2784, 8}, {164, 8},
77 {552, 8}, {940, 8}, {1328, 8}, {1716, 8}, {2104, 8}, {2492, 8}, {2776, 8},
78 {156, 8}, {544, 8}, {932, 8}, {1320, 8}, {1708, 8}, {2096, 8}, {2484, 8},
79 {2768, 8}, {148, 8}, {536, 8}, {924, 8}, {1312, 8}, {1700, 8}, {2088, 8},
80 {2476, 8}, {2760, 8}, {140, 8}, {528, 8}, {916, 8}, {1304, 8}, {1692, 8},
81 {2080, 8}, {2468, 8}, {2752, 8}, {132, 8}, {520, 8}, {908, 8}, {1296, 8},
82 {1684, 8}, {2072, 8}, {2460, 8}, {2744, 8}, {124, 8}, {512, 8}, {900, 8},
83 {1288, 8}, {1676, 8}, {2064, 8}, {2452, 8}, {2736, 8}, {116, 8}, {504, 8},
84 {892, 8}, {1280, 8}, {1668, 8}, {2056, 8}, {2444, 8}, {2728, 8}, {108, 8},
85 {496, 8}, {884, 8}, {1272, 8}, {1660, 8}, {2048, 8}, {2436, 8}, {2720, 8},
86 {100, 8}, {488, 8}, {876, 8}, {1264, 8}, {1652, 8}, {2040, 8}, {2428, 8},
87 {2716, 4}, {92, 8}, {480, 8}, {868, 8}, {1256, 8}, {1644, 8}, {2032, 8},
88 {2420, 8}, {84, 8}, {472, 8}, {860, 8}, {1248, 8}, {1636, 8}, {2024, 8},
89 {2412, 8}, {76, 8}, {464, 8}, {852, 8}, {1240, 8}, {1628, 8}, {2016, 8},
90 {2404, 8}, {68, 8}, {456, 8}, {844, 8}, {1232, 8}, {1620, 8}, {2008, 8},
91 {2396, 8}, {60, 8}, {448, 8}, {836, 8}, {1224, 8}, {1612, 8}, {2000, 8},
92 {2388, 8}, {52, 8}, {440, 8}, {828, 8}, {1216, 8}, {1604, 8}, {1992, 8},
93 {2380, 8}, {44, 8}, {432, 8}, {820, 8}, {1208, 8}, {1596, 8}, {1984, 8},
94 {2372, 8}, {36, 8}, {424, 8}, {812, 8}, {1200, 8}, {1588, 8}, {1976, 8},
95 {2364, 8}, {28, 8}, {416, 8}, {804, 8}, {1192, 8}, {1580, 8}, {1968, 8},
96 {2356, 8}, {20, 8}, {408, 8}, {796, 8}, {1184, 8}, {1572, 8}, {1960, 8},
97 {2348, 8}, {12, 8}, {400, 8}, {788, 8}, {1176, 8}, {1564, 8}, {1952, 8},
98 {2340, 8}, {4, 8}, {392, 8}, {780, 8}, {1168, 8}, {1556, 8}, {1944, 8},
100 /* missing from original data set */
101 {388, 4}, {776, 4}, {1164, 4}, {1552, 4}, {1940, 4}, {2328, 4},
106 pattern_cmp (const void *arg1, const void *arg2)
108 test_pattern_t *a1 = (test_pattern_t *) arg1;
109 test_pattern_t *a2 = (test_pattern_t *) arg2;
111 if (a1->offset < a2->offset)
113 else if (a1->offset > a2->offset)
119 fifo_validate_pattern (vlib_main_t * vm, test_pattern_t * pattern,
122 test_pattern_t *tp = pattern;
125 /* Go through the pattern and make 100% sure it's sane */
126 for (i = 0; i < pattern_length - 1; i++)
128 if (tp->offset + tp->len != (tp + 1)->offset)
130 vlib_cli_output (vm, "[%d] missing {%d, %d}", i,
131 (tp->offset + tp->len),
132 (tp + 1)->offset - (tp->offset + tp->len));
140 static test_pattern_t *
141 fifo_get_validate_pattern (vlib_main_t * vm, test_pattern_t * test_data,
144 test_pattern_t *validate_pattern = 0;
146 /* Validate, and try segments in order... */
147 vec_validate (validate_pattern, test_data_len - 1);
148 memcpy (validate_pattern, test_data,
149 test_data_len * sizeof (test_pattern_t));
150 qsort ((u8 *) validate_pattern, test_data_len, sizeof (test_pattern_t),
153 if (fifo_validate_pattern (vm, validate_pattern, test_data_len) == 0)
156 return validate_pattern;
160 fifo_prepare (u32 fifo_size)
163 f = svm_fifo_create (fifo_size);
165 /* Paint fifo data vector with -1's */
166 clib_memset (f->head_chunk->data, 0xFF, fifo_size);
172 compare_data (u8 * data1, u8 * data2, u32 start, u32 len, u32 * index)
176 for (i = start; i < len; i++)
178 if (data1[i] != data2[i])
188 tcp_test_fifo1 (vlib_main_t * vm, unformat_input_t * input)
191 u32 fifo_size = 1 << 20;
194 int i, rv, verbose = 0;
195 u32 data_word, test_data_len, j;
196 ooo_segment_t *ooo_seg;
197 u8 *data, *s, *data_buf = 0;
199 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
201 if (unformat (input, "verbose"))
205 test_data_len = fifo_size / sizeof (u32);
206 vec_validate (test_data, test_data_len - 1);
208 for (i = 0; i < vec_len (test_data); i++)
211 f = fifo_prepare (fifo_size);
214 * Enqueue an initial (un-dequeued) chunk
216 rv = svm_fifo_enqueue_nowait (f, sizeof (u32), (u8 *) test_data);
217 SFIFO_TEST ((rv == sizeof (u32)), "enqueued %d", rv);
218 SFIFO_TEST ((f->tail == 4), "fifo tail %u", f->tail);
221 * Create 3 chunks in the future. The offsets are relative
222 * to the current fifo tail
224 for (i = 0; i < 3; i++)
226 offset = (2 * i + 1) * sizeof (u32) - f->tail;
227 data = (u8 *) (test_data + (2 * i + 1));
230 rv = svm_fifo_enqueue_nowait (f, sizeof (u32), data);
231 rv = rv > 0 ? 0 : rv;
234 rv = svm_fifo_enqueue_with_offset (f, offset, sizeof (u32), data);
236 vlib_cli_output (vm, "add [%d] [%d, %d]", 2 * i + 1, offset,
237 offset + sizeof (u32));
240 clib_warning ("enqueue returned %d", rv);
246 vlib_cli_output (vm, "fifo after odd segs: %U", format_svm_fifo, f, 1);
248 SFIFO_TEST ((f->tail == 8), "fifo tail %u", f->tail);
249 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 2),
250 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
253 * Try adding a completely overlapped segment
255 offset = 3 * sizeof (u32) - f->tail;
256 data = (u8 *) (test_data + 3);
257 rv = svm_fifo_enqueue_with_offset (f, offset, sizeof (u32), data);
260 clib_warning ("enqueue returned %d", rv);
265 vlib_cli_output (vm, "fifo after overlap seg: %U", format_svm_fifo, f, 1);
267 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 2),
268 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
271 * Make sure format functions are not buggy
273 s = format (0, "%U", format_svm_fifo, f, 2);
277 * Paint some of missing data backwards
279 for (i = 3; i > 1; i--)
281 offset = (2 * i + 0) * sizeof (u32) - f->tail;
282 data = (u8 *) (test_data + (2 * i + 0));
283 rv = svm_fifo_enqueue_with_offset (f, offset, sizeof (u32), data);
285 vlib_cli_output (vm, "add [%d] [%d, %d]", 2 * i, offset,
286 offset + sizeof (u32));
289 clib_warning ("enqueue returned %d", rv);
295 vlib_cli_output (vm, "fifo before missing link: %U", format_svm_fifo, f,
297 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 1),
298 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
299 ooo_seg = svm_fifo_first_ooo_segment (f);
300 SFIFO_TEST ((ooo_seg->start == 12),
301 "first ooo seg position %u", ooo_seg->start);
302 SFIFO_TEST ((ooo_seg->length == 16),
303 "first ooo seg length %u", ooo_seg->length);
306 * Enqueue the missing u32
308 rv = svm_fifo_enqueue_nowait (f, sizeof (u32), (u8 *) (test_data + 2));
310 vlib_cli_output (vm, "fifo after missing link: %U", format_svm_fifo, f,
312 SFIFO_TEST ((rv == 20), "bytes to be enqueued %u", rv);
313 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 0),
314 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
319 for (i = 0; i < 7; i++)
321 rv = svm_fifo_dequeue_nowait (f, sizeof (u32), (u8 *) & data_word);
322 if (rv != sizeof (u32))
324 clib_warning ("bytes dequeues %u", rv);
327 if (data_word != test_data[i])
329 clib_warning ("recovered [%d] %d not %d", i, data_word,
336 * Test segment overlaps: last ooo segment overlaps all
339 f = fifo_prepare (fifo_size);
341 for (i = 0; i < 4; i++)
343 offset = (2 * i + 1) * sizeof (u32) - f->tail;
344 data = (u8 *) (test_data + (2 * i + 1));
345 rv = svm_fifo_enqueue_with_offset (f, offset, sizeof (u32), data);
347 vlib_cli_output (vm, "add [%d] [%d, %d]", 2 * i + 1, offset,
348 offset + sizeof (u32));
351 clib_warning ("enqueue returned %d", rv);
356 rv = svm_fifo_enqueue_with_offset (f, 8 - f->tail, 21, data);
357 SFIFO_TEST ((rv == 0), "ooo enqueued %u", rv);
358 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 1),
359 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
361 vec_validate (data_buf, vec_len (data));
362 svm_fifo_peek (f, 0, vec_len (data), data_buf);
363 if (compare_data (data_buf, data, 8, vec_len (data), &j))
365 SFIFO_TEST (0, "[%d] peeked %u expected %u", j, data_buf[j], data[j]);
367 vec_reset_length (data_buf);
370 * Test segment overlaps: enqueue and overlap ooo segments
373 f = fifo_prepare (fifo_size);
375 for (i = 0; i < 4; i++)
377 offset = (2 * i + 1) * sizeof (u32) - f->tail;
378 data = (u8 *) (test_data + (2 * i + 1));
379 rv = svm_fifo_enqueue_with_offset (f, offset, sizeof (u32), data);
381 vlib_cli_output (vm, "add [%d] [%d, %d]", 2 * i + 1, offset,
382 offset + sizeof (u32));
385 clib_warning ("enqueue returned %d", rv);
391 vlib_cli_output (vm, "fifo after enqueue: %U", format_svm_fifo, f, 1);
393 rv = svm_fifo_enqueue_nowait (f, 29, data);
395 vlib_cli_output (vm, "fifo after enqueueing 29: %U", format_svm_fifo, f,
397 SFIFO_TEST ((rv == 32), "ooo enqueued %u", rv);
398 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 0),
399 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
401 vec_validate (data_buf, vec_len (data));
402 svm_fifo_peek (f, 0, vec_len (data), data_buf);
403 if (compare_data (data_buf, data, 0, vec_len (data), &j))
405 SFIFO_TEST (0, "[%d] peeked %u expected %u", j, data_buf[j], data[j]);
408 /* Try to peek beyond the data */
409 rv = svm_fifo_peek (f, svm_fifo_max_dequeue (f), vec_len (data), data_buf);
410 SFIFO_TEST ((rv == 0), "peeked %u expected 0", rv);
414 vec_free (test_data);
420 vec_free (test_data);
425 tcp_test_fifo2 (vlib_main_t * vm)
428 u32 fifo_size = 1 << 20;
429 int i, rv, test_data_len;
431 test_pattern_t *tp, *vp, *test_data;
432 ooo_segment_t *ooo_seg;
434 test_data = test_pattern;
435 test_data_len = ARRAY_LEN (test_pattern);
437 vp = fifo_get_validate_pattern (vm, test_data, test_data_len);
440 f = fifo_prepare (fifo_size);
443 * Try with sorted data
445 for (i = 0; i < test_data_len; i++)
449 svm_fifo_enqueue_with_offset (f, tp->offset - f->tail, tp->len,
453 /* Expected result: one big fat chunk at offset 4 */
454 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 1),
455 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
456 ooo_seg = svm_fifo_first_ooo_segment (f);
457 SFIFO_TEST ((ooo_seg->start == 4),
458 "first ooo seg position %u", ooo_seg->start);
459 SFIFO_TEST ((ooo_seg->length == 2996),
460 "first ooo seg length %u", ooo_seg->length);
463 rv = svm_fifo_enqueue_nowait (f, sizeof (u32), (u8 *) & data64);
464 SFIFO_TEST ((rv == 3000), "bytes to be enqueued %u", rv);
470 * Now try it again w/ unsorted data...
473 f = fifo_prepare (fifo_size);
475 for (i = 0; i < test_data_len; i++)
479 rv = svm_fifo_enqueue_with_offset (f, tp->offset - f->tail, tp->len,
483 clib_warning ("enqueue returned %d", rv);
487 /* Expecting the same result: one big fat chunk at offset 4 */
488 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 1),
489 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
490 ooo_seg = svm_fifo_first_ooo_segment (f);
491 SFIFO_TEST ((ooo_seg->start == 4),
492 "first ooo seg position %u", ooo_seg->start);
493 SFIFO_TEST ((ooo_seg->length == 2996),
494 "first ooo seg length %u", ooo_seg->length);
497 rv = svm_fifo_enqueue_nowait (f, sizeof (u32), (u8 *) & data64);
499 SFIFO_TEST ((rv == 3000), "bytes to be enqueued %u", rv);
507 tcp_test_fifo3 (vlib_main_t * vm, unformat_input_t * input)
510 u32 fifo_size = 4 << 10;
511 u32 fifo_initial_offset = 0;
512 u32 total_size = 2 << 10;
513 int overlap = 0, verbose = 0, randomize = 1, drop = 0, in_seq_all = 0;
514 u8 *data_pattern = 0, *data_buf = 0;
515 test_pattern_t *tp, *generate = 0;
516 u32 nsegs = 2, seg_size, length_so_far;
517 u32 current_offset, offset_increment, len_this_chunk;
518 u32 seed = 0xdeaddabe, j;
521 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
523 if (unformat (input, "fifo-size %d", &fifo_size))
525 else if (unformat (input, "total-size %d", &total_size))
527 else if (unformat (input, "verbose"))
529 else if (unformat (input, "overlap"))
531 else if (unformat (input, "initial-offset %d", &fifo_initial_offset))
533 else if (unformat (input, "seed %d", &seed))
535 else if (unformat (input, "nsegs %d", &nsegs))
537 else if (unformat (input, "no-randomize"))
539 else if (unformat (input, "in-seq-all"))
541 else if (unformat (input, "drop"))
545 clib_error_t *e = clib_error_return
546 (0, "unknown input `%U'", format_unformat_error, input);
547 clib_error_report (e);
552 if (total_size > fifo_size)
554 clib_warning ("total_size %d greater than fifo size %d", total_size,
558 if (overlap && randomize == 0)
560 clib_warning ("Can't enqueue in-order with overlap");
567 vec_validate (data_pattern, total_size - 1);
568 for (i = 0; i < vec_len (data_pattern); i++)
569 data_pattern[i] = i & 0xff;
574 seg_size = total_size / nsegs;
576 current_offset = randomize;
577 while (length_so_far < total_size)
579 vec_add2 (generate, tp, 1);
580 len_this_chunk = clib_min (seg_size, total_size - length_so_far);
581 tp->offset = current_offset;
582 tp->len = len_this_chunk;
584 if (overlap && (len_this_chunk == seg_size))
587 offset_increment = len_this_chunk
588 % (1 + (random_u32 (&seed) % len_this_chunk));
590 while (offset_increment == 0);
592 offset_increment = len_this_chunk;
594 current_offset += offset_increment;
595 length_so_far = tp->offset + tp->len;
599 * Validate segment list. Only valid for non-overlap cases.
602 fifo_validate_pattern (vm, generate, vec_len (generate));
606 vlib_cli_output (vm, "raw data pattern:");
607 for (i = 0; i < vec_len (generate); i++)
609 vlib_cli_output (vm, "[%d] offset %u len %u", i,
610 generate[i].offset, generate[i].len);
614 /* Randomize data pattern */
617 for (i = 0; i < vec_len (generate) / 2; i++)
619 u32 src_index, dst_index;
620 test_pattern_t _tmp, *tmp = &_tmp;
622 src_index = random_u32 (&seed) % vec_len (generate);
623 dst_index = random_u32 (&seed) % vec_len (generate);
625 tmp[0] = generate[dst_index];
626 generate[dst_index] = generate[src_index];
627 generate[src_index] = tmp[0];
631 vlib_cli_output (vm, "randomized data pattern:");
632 for (i = 0; i < vec_len (generate); i++)
634 vlib_cli_output (vm, "[%d] offset %u len %u", i,
635 generate[i].offset, generate[i].len);
641 * Create a fifo and add segments
643 f = fifo_prepare (fifo_size);
645 /* manually set head and tail pointers to validate modular arithmetic */
646 fifo_initial_offset = fifo_initial_offset % fifo_size;
647 svm_fifo_init_pointers (f, fifo_initial_offset);
649 for (i = !randomize; i < vec_len (generate); i++)
652 svm_fifo_enqueue_with_offset (f,
653 fifo_initial_offset + tp->offset -
655 (u8 *) data_pattern + tp->offset);
658 /* Add the first segment in order for non random data */
660 svm_fifo_enqueue_nowait (f, generate[0].len, (u8 *) data_pattern);
663 * Expected result: one big fat chunk at offset 1 if randomize == 1
667 vlib_cli_output (vm, "fifo before missing link: %U",
668 format_svm_fifo, f, 1 /* verbose */ );
671 * Add the missing byte if segments were randomized
675 u32 bytes_to_enq = 1;
677 bytes_to_enq = total_size;
678 rv = svm_fifo_enqueue_nowait (f, bytes_to_enq, data_pattern + 0);
681 vlib_cli_output (vm, "in-order enqueue returned %d", rv);
683 SFIFO_TEST ((rv == total_size), "enqueued %u expected %u", rv,
688 SFIFO_TEST ((svm_fifo_has_ooo_data (f) == 0), "number of ooo segments %u",
689 svm_fifo_number_ooo_segments (f));
692 * Test if peeked data is the same as original data
694 vec_validate (data_buf, vec_len (data_pattern));
695 svm_fifo_peek (f, 0, vec_len (data_pattern), data_buf);
696 if (compare_data (data_buf, data_pattern, 0, vec_len (data_pattern), &j))
698 SFIFO_TEST (0, "[%d] peeked %u expected %u", j, data_buf[j],
701 vec_reset_length (data_buf);
704 * Dequeue or drop all data
708 svm_fifo_dequeue_drop (f, vec_len (data_pattern));
712 svm_fifo_dequeue_nowait (f, vec_len (data_pattern), data_buf);
714 (data_buf, data_pattern, 0, vec_len (data_pattern), &j))
716 SFIFO_TEST (0, "[%d] dequeued %u expected %u", j, data_buf[j],
721 SFIFO_TEST ((svm_fifo_max_dequeue (f) == 0), "fifo has %d bytes",
722 svm_fifo_max_dequeue (f));
725 vec_free (data_pattern);
732 tcp_test_fifo4 (vlib_main_t * vm, unformat_input_t * input)
735 u32 fifo_size = 6 << 10;
736 u32 fifo_initial_offset = 1000000000;
737 u32 test_n_bytes = 5000, j;
738 u8 *test_data = 0, *data_buf = 0;
739 int i, rv, verbose = 0;
741 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
743 if (unformat (input, "verbose"))
747 clib_error_t *e = clib_error_return
748 (0, "unknown input `%U'", format_unformat_error, input);
749 clib_error_report (e);
755 * Create a fifo and add segments
757 f = fifo_prepare (fifo_size);
759 /* Set head and tail pointers */
760 fifo_initial_offset = fifo_initial_offset % fifo_size;
761 svm_fifo_init_pointers (f, fifo_initial_offset);
763 vec_validate (test_data, test_n_bytes - 1);
764 for (i = 0; i < vec_len (test_data); i++)
767 for (i = test_n_bytes - 1; i > 0; i--)
769 rv = svm_fifo_enqueue_with_offset (f, fifo_initial_offset + i - f->tail,
770 sizeof (u8), &test_data[i]);
772 vlib_cli_output (vm, "add [%d] [%d, %d]", i, i, i + sizeof (u8));
775 clib_warning ("enqueue returned %d", rv);
777 vec_free (test_data);
782 svm_fifo_enqueue_nowait (f, sizeof (u8), &test_data[0]);
784 vec_validate (data_buf, vec_len (test_data));
786 svm_fifo_dequeue_nowait (f, vec_len (test_data), data_buf);
787 rv = compare_data (data_buf, test_data, 0, vec_len (test_data), &j);
789 vlib_cli_output (vm, "[%d] dequeued %u expected %u", j, data_buf[j],
791 SFIFO_TEST ((rv == 0), "dequeued compared to original returned %d", rv);
794 vec_free (test_data);
799 fifo_pos (svm_fifo_t * f, u32 pos)
805 tcp_test_fifo5 (vlib_main_t * vm, unformat_input_t * input)
808 u32 fifo_size = 401, j = 0, offset = 200;
809 int i, rv, verbose = 0;
810 u8 *test_data = 0, *data_buf = 0;
811 ooo_segment_t *ooo_seg;
813 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
815 if (unformat (input, "verbose"))
819 clib_error_t *e = clib_error_return (0, "unknown input `%U'",
820 format_unformat_error, input);
821 clib_error_report (e);
826 f = fifo_prepare (fifo_size);
827 svm_fifo_init_pointers (f, offset);
829 vec_validate (test_data, 399);
830 for (i = 0; i < vec_len (test_data); i++)
831 test_data[i] = i % 0xff;
834 * Start with [100, 200] and [300, 400]
836 svm_fifo_enqueue_with_offset (f, 100, 100, &test_data[100]);
837 svm_fifo_enqueue_with_offset (f, 300, 100, &test_data[300]);
839 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 2),
840 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
841 SFIFO_TEST ((f->ooos_newest == 1), "newest %u", f->ooos_newest);
843 vlib_cli_output (vm, "fifo after [100, 200] and [300, 400] : %U",
844 format_svm_fifo, f, 2 /* verbose */ );
850 rv = svm_fifo_enqueue_with_offset (f, 225, 50, &test_data[200]);
852 vlib_cli_output (vm, "fifo after [225, 275] : %U",
853 format_svm_fifo, f, 2 /* verbose */ );
854 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 3),
855 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
856 ooo_seg = svm_fifo_first_ooo_segment (f);
857 SFIFO_TEST ((ooo_seg->start == fifo_pos (f, 100 + offset)),
858 "first seg start %u expected %u", ooo_seg->start,
859 fifo_pos (f, 100 + offset));
860 SFIFO_TEST ((ooo_seg->length == 100), "first seg length %u expected %u",
861 ooo_seg->length, 100);
862 ooo_seg = ooo_segment_next (f, ooo_seg);
863 SFIFO_TEST ((ooo_seg->start == fifo_pos (f, 225 + offset)),
864 "second seg start %u expected %u",
865 ooo_seg->start, fifo_pos (f, 225 + offset));
866 SFIFO_TEST ((ooo_seg->length == 50), "second seg length %u expected %u",
867 ooo_seg->length, 50);
868 ooo_seg = ooo_segment_next (f, ooo_seg);
869 SFIFO_TEST ((ooo_seg->start == fifo_pos (f, 300 + offset)),
870 "third seg start %u expected %u",
871 ooo_seg->start, fifo_pos (f, 300 + offset));
872 SFIFO_TEST ((ooo_seg->length == 100), "third seg length %u expected %u",
873 ooo_seg->length, 100);
874 SFIFO_TEST ((f->ooos_newest == 2), "newest %u", f->ooos_newest);
878 rv = svm_fifo_enqueue_with_offset (f, 190, 120, &test_data[190]);
880 vlib_cli_output (vm, "fifo after [190, 310] : %U",
881 format_svm_fifo, f, 1 /* verbose */ );
882 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 1),
883 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
884 ooo_seg = svm_fifo_first_ooo_segment (f);
885 SFIFO_TEST ((ooo_seg->start == fifo_pos (f, offset + 100)),
886 "first seg start %u expected %u",
887 ooo_seg->start, fifo_pos (f, offset + 100));
888 SFIFO_TEST ((ooo_seg->length == 300), "first seg length %u expected %u",
889 ooo_seg->length, 300);
894 rv = svm_fifo_enqueue_nowait (f, 150, test_data);
897 vlib_cli_output (vm, "fifo after [0 150] : %U", format_svm_fifo, f,
900 SFIFO_TEST ((rv == 400), "managed to enqueue %u expected %u", rv, 400);
901 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 0),
902 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
904 vec_validate (data_buf, 399);
905 svm_fifo_peek (f, 0, 400, data_buf);
906 if (compare_data (data_buf, test_data, 0, 400, &j))
908 SFIFO_TEST (0, "[%d] peeked %u expected %u", j, data_buf[j],
913 * Add [100 200] and overlap it with [50 250]
916 f = fifo_prepare (fifo_size);
918 svm_fifo_enqueue_with_offset (f, 100, 100, &test_data[100]);
919 svm_fifo_enqueue_with_offset (f, 50, 200, &test_data[50]);
920 SFIFO_TEST ((svm_fifo_number_ooo_segments (f) == 1),
921 "number of ooo segments %u", svm_fifo_number_ooo_segments (f));
922 ooo_seg = svm_fifo_first_ooo_segment (f);
923 SFIFO_TEST ((ooo_seg->start == 50), "first seg start %u expected %u",
925 SFIFO_TEST ((ooo_seg->length == 200), "first seg length %u expected %u",
926 ooo_seg->length, 200);
929 vec_free (test_data);
934 tcp_test_fifo_grow (vlib_main_t * vm, unformat_input_t * input)
936 int __clib_unused verbose, fifo_size = 201, start_offset = 100, i;
937 svm_fifo_chunk_t *c, *next, *prev;
941 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
943 if (unformat (input, "verbose"))
947 vlib_cli_output (vm, "parse error: '%U'", format_unformat_error,
953 f = fifo_prepare (fifo_size);
954 svm_fifo_init_pointers (f, start_offset);
957 * Add with fifo not wrapped
959 c = clib_mem_alloc (sizeof (svm_fifo_chunk_t) + 100);
964 svm_fifo_add_chunk (f, c);
966 SFIFO_TEST (f->size == fifo_size + 100, "size expected %u is %u",
967 fifo_size + 100, f->size);
968 SFIFO_TEST (c->start_byte == fifo_size, "start byte expected %u is %u",
969 fifo_size, c->start_byte);
972 * Add with fifo wrapped
975 f->tail = f->head + f->nitems;
976 c = clib_mem_alloc (sizeof (svm_fifo_chunk_t) + 100);
981 svm_fifo_add_chunk (f, c);
983 SFIFO_TEST (f->end_chunk != c, "tail chunk should not be updated");
984 SFIFO_TEST (f->size == fifo_size + 100, "size expected %u is %u",
985 fifo_size + 100, f->size);
986 SFIFO_TEST (c->start_byte == ~0, "start byte expected %u is %u", ~0,
992 vec_validate (buf, 200);
993 svm_fifo_dequeue_nowait (f, 201, buf);
995 SFIFO_TEST (f->end_chunk == c, "tail chunk should be updated");
996 SFIFO_TEST (f->size == fifo_size + 200, "size expected %u is %u",
997 fifo_size + 200, f->size);
998 SFIFO_TEST (c->start_byte == fifo_size + 100, "start byte expected %u is "
999 "%u", fifo_size + 100, c->start_byte);
1005 f->head = f->nitems - 100;
1006 f->tail = f->head + f->nitems;
1009 for (i = 0; i < 5; i++)
1011 c = clib_mem_alloc (sizeof (svm_fifo_chunk_t) + 100);
1018 svm_fifo_add_chunk (f, c);
1019 SFIFO_TEST (f->size == fifo_size + 200, "size expected %u is %u",
1020 fifo_size + 200, f->size);
1023 for (i = 0; i < 5; i++)
1025 c = clib_mem_alloc (sizeof (svm_fifo_chunk_t) + 100);
1032 svm_fifo_add_chunk (f, c);
1033 SFIFO_TEST (f->size == fifo_size + 200, "size expected %u is %u",
1034 fifo_size + 200, f->size);
1036 svm_fifo_dequeue_nowait (f, 201, buf);
1038 SFIFO_TEST (f->size == fifo_size + 200 + 10 * 100, "size expected %u is %u",
1039 fifo_size + 200 + 10 * 100, f->size);
1044 c = f->start_chunk->next;
1045 while (c && c != f->start_chunk)
1059 svm_fifo_trace_elem_t fifo_trace[] = {};
1063 tcp_test_fifo_replay (vlib_main_t * vm, unformat_input_t * input)
1067 u8 no_read = 0, *str = 0;
1069 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1071 if (unformat (input, "verbose"))
1073 else if (unformat (input, "no-read"))
1077 clib_error_t *e = clib_error_return
1078 (0, "unknown input `%U'", format_unformat_error, input);
1079 clib_error_report (e);
1085 f.trace = fifo_trace;
1088 str = svm_fifo_replay (str, &f, no_read, verbose);
1089 vlib_cli_output (vm, "%v", str);
1093 static clib_error_t *
1094 svm_fifo_test (vlib_main_t * vm, unformat_input_t * input,
1095 vlib_cli_command_t * cmd_arg)
1100 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1102 if (unformat (input, "fifo1"))
1103 res = tcp_test_fifo1 (vm, input);
1104 else if (unformat (input, "fifo2"))
1105 res = tcp_test_fifo2 (vm);
1106 else if (unformat (input, "fifo3"))
1107 res = tcp_test_fifo3 (vm, input);
1108 else if (unformat (input, "fifo4"))
1109 res = tcp_test_fifo4 (vm, input);
1110 else if (unformat (input, "fifo5"))
1111 res = tcp_test_fifo5 (vm, input);
1112 else if (unformat (input, "replay"))
1113 res = tcp_test_fifo_replay (vm, input);
1114 else if (unformat (input, "grow"))
1115 res = tcp_test_fifo_grow (vm, input);
1116 else if (unformat (input, "all"))
1118 if ((res = tcp_test_fifo1 (vm, input)))
1121 if ((res = tcp_test_fifo2 (vm)))
1125 * Run a number of fifo3 configs
1127 str = "nsegs 10 overlap seed 123";
1128 unformat_init_cstring (input, str);
1129 if ((res = tcp_test_fifo3 (vm, input)))
1131 unformat_free (input);
1133 str = "nsegs 10 overlap seed 123 in-seq-all";
1134 unformat_init_cstring (input, str);
1135 if ((res = tcp_test_fifo3 (vm, input)))
1137 unformat_free (input);
1139 str = "nsegs 10 overlap seed 123 initial-offset 3917";
1140 unformat_init_cstring (input, str);
1141 if ((res = tcp_test_fifo3 (vm, input)))
1143 unformat_free (input);
1145 str = "nsegs 10 overlap seed 123 initial-offset 3917 drop";
1146 unformat_init_cstring (input, str);
1147 if ((res = tcp_test_fifo3 (vm, input)))
1149 unformat_free (input);
1151 str = "nsegs 10 seed 123 initial-offset 3917 drop no-randomize";
1152 unformat_init_cstring (input, str);
1153 if ((res = tcp_test_fifo3 (vm, input)))
1155 unformat_free (input);
1157 if ((res = tcp_test_fifo4 (vm, input)))
1160 if ((res = tcp_test_fifo5 (vm, input)))
1163 if ((res = tcp_test_fifo_grow (vm, input)))
1168 vlib_cli_output (vm, "unknown input `%U'", format_unformat_error,
1178 return clib_error_return (0, "svm fifo unit test failed");
1183 VLIB_CLI_COMMAND (svm_fifo_test_command, static) =
1185 .path = "test svm fifo",
1186 .short_help = "internal svm fifo unit tests",
1187 .function = svm_fifo_test,
1192 * fd.io coding-style-patch-verification: ON
1195 * eval: (c-set-style "gnu")