1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
|
/*-
* BSD LICENSE
*
* Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Intel Corporation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <string.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <inttypes.h>
#include <errno.h>
#include <sys/queue.h>
#include <rte_common.h>
#include <rte_log.h>
#include <rte_memory.h>
#include <rte_memzone.h>
#include <rte_launch.h>
#include <rte_cycles.h>
#include <rte_eal.h>
#include <rte_per_lcore.h>
#include <rte_lcore.h>
#include <rte_atomic.h>
#include <rte_branch_prediction.h>
#include <rte_malloc.h>
#include <rte_ring.h>
#include <rte_random.h>
#include <rte_common.h>
#include <rte_errno.h>
#include <rte_hexdump.h>
#include "test.h"
/*
* Ring
* ====
*
* #. Basic tests: done on one core:
*
* - Using single producer/single consumer functions:
*
* - Enqueue one object, two objects, MAX_BULK objects
* - Dequeue one object, two objects, MAX_BULK objects
* - Check that dequeued pointers are correct
*
* - Using multi producers/multi consumers functions:
*
* - Enqueue one object, two objects, MAX_BULK objects
* - Dequeue one object, two objects, MAX_BULK objects
* - Check that dequeued pointers are correct
*
* - Test watermark and default bulk enqueue/dequeue:
*
* - Set watermark
* - Set default bulk value
* - Enqueue objects, check that -EDQUOT is returned when
* watermark is exceeded
* - Check that dequeued pointers are correct
*
* #. Check live watermark change
*
* - Start a loop on another lcore that will enqueue and dequeue
* objects in a ring. It will monitor the value of watermark.
* - At the same time, change the watermark on the master lcore.
* - The slave lcore will check that watermark changes from 16 to 32.
*
* #. Performance tests.
*
* Tests done in test_ring_perf.c
*/
#define RING_SIZE 4096
#define MAX_BULK 32
#define N 65536
#define TIME_S 5
static rte_atomic32_t synchro;
static struct rte_ring *r;
#define TEST_RING_VERIFY(exp) \
if (!(exp)) { \
printf("error at %s:%d\tcondition " #exp " failed\n", \
__func__, __LINE__); \
rte_ring_dump(stdout, r); \
return -1; \
}
#define TEST_RING_FULL_EMTPY_ITER 8
static int
check_live_watermark_change(__attribute__((unused)) void *dummy)
{
uint64_t hz = rte_get_timer_hz();
void *obj_table[MAX_BULK];
unsigned watermark, watermark_old = 16;
uint64_t cur_time, end_time;
int64_t diff = 0;
int i, ret;
unsigned count = 4;
/* init the object table */
memset(obj_table, 0, sizeof(obj_table));
end_time = rte_get_timer_cycles() + (hz * 2);
/* check that bulk and watermark are 4 and 32 (respectively) */
while (diff >= 0) {
/* add in ring until we reach watermark */
ret = 0;
for (i = 0; i < 16; i ++) {
if (ret != 0)
break;
ret = rte_ring_enqueue_bulk(r, obj_table, count);
}
if (ret != -EDQUOT) {
printf("Cannot enqueue objects, or watermark not "
"reached (ret=%d)\n", ret);
return -1;
}
/* read watermark, the only change allowed is from 16 to 32 */
watermark = r->prod.watermark;
if (watermark != watermark_old &&
(watermark_old != 16 || watermark != 32)) {
printf("Bad watermark change %u -> %u\n", watermark_old,
watermark);
return -1;
}
watermark_old = watermark;
/* dequeue objects from ring */
while (i--) {
ret = rte_ring_dequeue_bulk(r, obj_table, count);
if (ret != 0) {
printf("Cannot dequeue (ret=%d)\n", ret);
return -1;
}
}
cur_time = rte_get_timer_cycles();
diff = end_time - cur_time;
}
if (watermark_old != 32 ) {
printf(" watermark was not updated (wm=%u)\n",
watermark_old);
return -1;
}
return 0;
}
static int
test_live_watermark_change(void)
{
unsigned lcore_id = rte_lcore_id();
unsigned lcore_id2 = rte_get_next_lcore(lcore_id, 0, 1);
printf("Test watermark live modification\n");
rte_ring_set_water_mark(r, 16);
/* launch a thread that will enqueue and dequeue, checking
* watermark and quota */
rte_eal_remote_launch(check_live_watermark_change, NULL, lcore_id2);
rte_delay_ms(1000);
rte_ring_set_water_mark(r, 32);
rte_delay_ms(1000);
if (rte_eal_wait_lcore(lcore_id2) < 0)
return -1;
return 0;
}
/* Test for catch on invalid watermark values */
static int
test_set_watermark( void ){
unsigned count;
int setwm;
struct rte_ring *r = rte_ring_lookup("test_ring_basic_ex");
if(r == NULL){
printf( " ring lookup failed\n" );
goto error;
}
count = r->prod.size*2;
setwm = rte_ring_set_water_mark(r, count);
if (setwm != -EINVAL){
printf("Test failed to detect invalid watermark count value\n");
goto error;
}
count = 0;
rte_ring_set_water_mark(r, count);
if (r->prod.watermark != r->prod.size) {
printf("Test failed to detect invalid watermark count value\n");
goto error;
}
return 0;
error:
return -1;
}
/*
* helper routine for test_ring_basic
*/
static int
test_ring_basic_full_empty(void * const src[], void *dst[])
{
unsigned i, rand;
const unsigned rsz = RING_SIZE - 1;
printf("Basic full/empty test\n");
for (i = 0; TEST_RING_FULL_EMTPY_ITER != i; i++) {
/* random shift in the ring */
rand = RTE_MAX(rte_rand() % RING_SIZE, 1UL);
printf("%s: iteration %u, random shift: %u;\n",
__func__, i, rand);
TEST_RING_VERIFY(-ENOBUFS != rte_ring_enqueue_bulk(r, src,
rand));
TEST_RING_VERIFY(0 == rte_ring_dequeue_bulk(r, dst, rand));
/* fill the ring */
TEST_RING_VERIFY(-ENOBUFS != rte_ring_enqueue_bulk(r, src,
rsz));
TEST_RING_VERIFY(0 == rte_ring_free_count(r));
TEST_RING_VERIFY(rsz == rte_ring_count(r));
TEST_RING_VERIFY(rte_ring_full(r));
TEST_RING_VERIFY(0 == rte_ring_empty(r));
/* empty the ring */
TEST_RING_VERIFY(0 == rte_ring_dequeue_bulk(r, dst, rsz));
TEST_RING_VERIFY(rsz == rte_ring_free_count(r));
TEST_RING_VERIFY(0 == rte_ring_count(r));
TEST_RING_VERIFY(0 == rte_ring_full(r));
TEST_RING_VERIFY(rte_ring_empty(r));
/* check data */
TEST_RING_VERIFY(0 == memcmp(src, dst, rsz));
rte_ring_dump(stdout, r);
}
return 0;
}
static int
test_ring_basic(void)
{
void **src = NULL, **cur_src = NULL, **dst = NULL, **cur_dst = NULL;
int ret;
unsigned i, num_elems;
/* alloc dummy object pointers */
src = malloc(RING_SIZE*2*sizeof(void *));
if (src == NULL)
goto fail;
for (i = 0; i < RING_SIZE*2 ; i++) {
src[i] = (void *)(unsigned long)i;
}
cur_src = src;
/* alloc some room for copied objects */
dst = malloc(RING_SIZE*2*sizeof(void *));
if (dst == NULL)
goto fail;
memset(dst, 0, RING_SIZE*2*sizeof(void *));
cur_dst = dst;
printf("enqueue 1 obj\n");
ret = rte_ring_sp_enqueue_bulk(r, cur_src, 1);
cur_src += 1;
if (ret != 0)
goto fail;
printf("enqueue 2 objs\n");
ret = rte_ring_sp_enqueue_bulk(r, cur_src, 2);
cur_src += 2;
if (ret != 0)
goto fail;
printf("enqueue MAX_BULK objs\n");
ret = rte_ring_sp_enqueue_bulk(r, cur_src, MAX_BULK);
cur_src += MAX_BULK;
if (ret != 0)
goto fail;
printf("dequeue 1 obj\n");
ret = rte_ring_sc_dequeue_bulk(r, cur_dst, 1);
cur_dst += 1;
if (ret != 0)
goto fail;
printf("dequeue 2 objs\n");
ret = rte_ring_sc_dequeue_bulk(r, cur_dst, 2);
cur_dst += 2;
if (ret != 0)
goto fail;
printf("dequeue MAX_BULK objs\n");
ret = rte_ring_sc_dequeue_bulk(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
if (ret != 0)
goto fail;
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
cur_src = src;
cur_dst = dst;
printf("enqueue 1 obj\n");
ret = rte_ring_mp_enqueue_bulk(r, cur_src, 1);
cur_src += 1;
if (ret != 0)
goto fail;
printf("enqueue 2 objs\n");
ret = rte_ring_mp_enqueue_bulk(r, cur_src, 2);
cur_src += 2;
if (ret != 0)
goto fail;
printf("enqueue MAX_BULK objs\n");
ret = rte_ring_mp_enqueue_bulk(r, cur_src, MAX_BULK);
cur_src += MAX_BULK;
if (ret != 0)
goto fail;
printf("dequeue 1 obj\n");
ret = rte_ring_mc_dequeue_bulk(r, cur_dst, 1);
cur_dst += 1;
if (ret != 0)
goto fail;
printf("dequeue 2 objs\n");
ret = rte_ring_mc_dequeue_bulk(r, cur_dst, 2);
cur_dst += 2;
if (ret != 0)
goto fail;
printf("dequeue MAX_BULK objs\n");
ret = rte_ring_mc_dequeue_bulk(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
if (ret != 0)
goto fail;
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
cur_src = src;
cur_dst = dst;
printf("fill and empty the ring\n");
for (i = 0; i<RING_SIZE/MAX_BULK; i++) {
ret = rte_ring_mp_enqueue_bulk(r, cur_src, MAX_BULK);
cur_src += MAX_BULK;
if (ret != 0)
goto fail;
ret = rte_ring_mc_dequeue_bulk(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
if (ret != 0)
goto fail;
}
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
if (test_ring_basic_full_empty(src, dst) != 0)
goto fail;
cur_src = src;
cur_dst = dst;
printf("test watermark and default bulk enqueue / dequeue\n");
rte_ring_set_water_mark(r, 20);
num_elems = 16;
cur_src = src;
cur_dst = dst;
ret = rte_ring_enqueue_bulk(r, cur_src, num_elems);
cur_src += num_elems;
if (ret != 0) {
printf("Cannot enqueue\n");
goto fail;
}
ret = rte_ring_enqueue_bulk(r, cur_src, num_elems);
cur_src += num_elems;
if (ret != -EDQUOT) {
printf("Watermark not exceeded\n");
goto fail;
}
ret = rte_ring_dequeue_bulk(r, cur_dst, num_elems);
cur_dst += num_elems;
if (ret != 0) {
printf("Cannot dequeue\n");
goto fail;
}
ret = rte_ring_dequeue_bulk(r, cur_dst, num_elems);
cur_dst += num_elems;
if (ret != 0) {
printf("Cannot dequeue2\n");
goto fail;
}
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
cur_src = src;
cur_dst = dst;
ret = rte_ring_mp_enqueue(r, cur_src);
if (ret != 0)
goto fail;
ret = rte_ring_mc_dequeue(r, cur_dst);
if (ret != 0)
goto fail;
free(src);
free(dst);
return 0;
fail:
free(src);
free(dst);
return -1;
}
static int
test_ring_burst_basic(void)
{
void **src = NULL, **cur_src = NULL, **dst = NULL, **cur_dst = NULL;
int ret;
unsigned i;
/* alloc dummy object pointers */
src = malloc(RING_SIZE*2*sizeof(void *));
if (src == NULL)
goto fail;
for (i = 0; i < RING_SIZE*2 ; i++) {
src[i] = (void *)(unsigned long)i;
}
cur_src = src;
/* alloc some room for copied objects */
dst = malloc(RING_SIZE*2*sizeof(void *));
if (dst == NULL)
goto fail;
memset(dst, 0, RING_SIZE*2*sizeof(void *));
cur_dst = dst;
printf("Test SP & SC basic functions \n");
printf("enqueue 1 obj\n");
ret = rte_ring_sp_enqueue_burst(r, cur_src, 1);
cur_src += 1;
if ((ret & RTE_RING_SZ_MASK) != 1)
goto fail;
printf("enqueue 2 objs\n");
ret = rte_ring_sp_enqueue_burst(r, cur_src, 2);
cur_src += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
printf("enqueue MAX_BULK objs\n");
ret = rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK) ;
cur_src += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
printf("dequeue 1 obj\n");
ret = rte_ring_sc_dequeue_burst(r, cur_dst, 1) ;
cur_dst += 1;
if ((ret & RTE_RING_SZ_MASK) != 1)
goto fail;
printf("dequeue 2 objs\n");
ret = rte_ring_sc_dequeue_burst(r, cur_dst, 2);
cur_dst += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
printf("dequeue MAX_BULK objs\n");
ret = rte_ring_sc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
cur_src = src;
cur_dst = dst;
printf("Test enqueue without enough memory space \n");
for (i = 0; i< (RING_SIZE/MAX_BULK - 1); i++) {
ret = rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK);
cur_src += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK) {
goto fail;
}
}
printf("Enqueue 2 objects, free entries = MAX_BULK - 2 \n");
ret = rte_ring_sp_enqueue_burst(r, cur_src, 2);
cur_src += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
printf("Enqueue the remaining entries = MAX_BULK - 2 \n");
/* Always one free entry left */
ret = rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK);
cur_src += MAX_BULK - 3;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK - 3)
goto fail;
printf("Test if ring is full \n");
if (rte_ring_full(r) != 1)
goto fail;
printf("Test enqueue for a full entry \n");
ret = rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK);
if ((ret & RTE_RING_SZ_MASK) != 0)
goto fail;
printf("Test dequeue without enough objects \n");
for (i = 0; i<RING_SIZE/MAX_BULK - 1; i++) {
ret = rte_ring_sc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
}
/* Available memory space for the exact MAX_BULK entries */
ret = rte_ring_sc_dequeue_burst(r, cur_dst, 2);
cur_dst += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
ret = rte_ring_sc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK - 3;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK - 3)
goto fail;
printf("Test if ring is empty \n");
/* Check if ring is empty */
if (1 != rte_ring_empty(r))
goto fail;
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
cur_src = src;
cur_dst = dst;
printf("Test MP & MC basic functions \n");
printf("enqueue 1 obj\n");
ret = rte_ring_mp_enqueue_burst(r, cur_src, 1);
cur_src += 1;
if ((ret & RTE_RING_SZ_MASK) != 1)
goto fail;
printf("enqueue 2 objs\n");
ret = rte_ring_mp_enqueue_burst(r, cur_src, 2);
cur_src += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
printf("enqueue MAX_BULK objs\n");
ret = rte_ring_mp_enqueue_burst(r, cur_src, MAX_BULK);
cur_src += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
printf("dequeue 1 obj\n");
ret = rte_ring_mc_dequeue_burst(r, cur_dst, 1);
cur_dst += 1;
if ((ret & RTE_RING_SZ_MASK) != 1)
goto fail;
printf("dequeue 2 objs\n");
ret = rte_ring_mc_dequeue_burst(r, cur_dst, 2);
cur_dst += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
printf("dequeue MAX_BULK objs\n");
ret = rte_ring_mc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
cur_src = src;
cur_dst = dst;
printf("fill and empty the ring\n");
for (i = 0; i<RING_SIZE/MAX_BULK; i++) {
ret = rte_ring_mp_enqueue_burst(r, cur_src, MAX_BULK);
cur_src += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
ret = rte_ring_mc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
}
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
cur_src = src;
cur_dst = dst;
printf("Test enqueue without enough memory space \n");
for (i = 0; i<RING_SIZE/MAX_BULK - 1; i++) {
ret = rte_ring_mp_enqueue_burst(r, cur_src, MAX_BULK);
cur_src += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
}
/* Available memory space for the exact MAX_BULK objects */
ret = rte_ring_mp_enqueue_burst(r, cur_src, 2);
cur_src += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
ret = rte_ring_mp_enqueue_burst(r, cur_src, MAX_BULK);
cur_src += MAX_BULK - 3;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK - 3)
goto fail;
printf("Test dequeue without enough objects \n");
for (i = 0; i<RING_SIZE/MAX_BULK - 1; i++) {
ret = rte_ring_mc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK)
goto fail;
}
/* Available objects - the exact MAX_BULK */
ret = rte_ring_mc_dequeue_burst(r, cur_dst, 2);
cur_dst += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
ret = rte_ring_mc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK - 3;
if ((ret & RTE_RING_SZ_MASK) != MAX_BULK - 3)
goto fail;
/* check data */
if (memcmp(src, dst, cur_dst - dst)) {
rte_hexdump(stdout, "src", src, cur_src - src);
rte_hexdump(stdout, "dst", dst, cur_dst - dst);
printf("data after dequeue is not the same\n");
goto fail;
}
cur_src = src;
cur_dst = dst;
printf("Covering rte_ring_enqueue_burst functions \n");
ret = rte_ring_enqueue_burst(r, cur_src, 2);
cur_src += 2;
if ((ret & RTE_RING_SZ_MASK) != 2)
goto fail;
ret = rte_ring_dequeue_burst(r, cur_dst, 2);
cur_dst += 2;
if (ret != 2)
goto fail;
/* Free memory before test completed */
free(src);
free(dst);
return 0;
fail:
free(src);
free(dst);
return -1;
}
static int
test_ring_stats(void)
{
#ifndef RTE_LIBRTE_RING_DEBUG
printf("Enable RTE_LIBRTE_RING_DEBUG to test ring stats.\n");
return 0;
#else
void **src = NULL, **cur_src = NULL, **dst = NULL, **cur_dst = NULL;
int ret;
unsigned i;
unsigned num_items = 0;
unsigned failed_enqueue_ops = 0;
unsigned failed_enqueue_items = 0;
unsigned failed_dequeue_ops = 0;
unsigned failed_dequeue_items = 0;
unsigned last_enqueue_ops = 0;
unsigned last_enqueue_items = 0;
unsigned last_quota_ops = 0;
unsigned last_quota_items = 0;
unsigned lcore_id = rte_lcore_id();
struct rte_ring_debug_stats *ring_stats = &r->stats[lcore_id];
printf("Test the ring stats.\n");
/* Reset the watermark in case it was set in another test. */
rte_ring_set_water_mark(r, 0);
/* Reset the ring stats. */
memset(&r->stats[lcore_id], 0, sizeof(r->stats[lcore_id]));
/* Allocate some dummy object pointers. */
src = malloc(RING_SIZE*2*sizeof(void *));
if (src == NULL)
goto fail;
for (i = 0; i < RING_SIZE*2 ; i++) {
src[i] = (void *)(unsigned long)i;
}
/* Allocate some memory for copied objects. */
dst = malloc(RING_SIZE*2*sizeof(void *));
if (dst == NULL)
goto fail;
memset(dst, 0, RING_SIZE*2*sizeof(void *));
/* Set the head and tail pointers. */
cur_src = src;
cur_dst = dst;
/* Do Enqueue tests. */
printf("Test the dequeue stats.\n");
/* Fill the ring up to RING_SIZE -1. */
printf("Fill the ring.\n");
for (i = 0; i< (RING_SIZE/MAX_BULK); i++) {
rte_ring_sp_enqueue_burst(r, cur_src, MAX_BULK);
cur_src += MAX_BULK;
}
/* Adjust for final enqueue = MAX_BULK -1. */
cur_src--;
printf("Verify that the ring is full.\n");
if (rte_ring_full(r) != 1)
goto fail;
printf("Verify the enqueue success stats.\n");
/* Stats should match above enqueue operations to fill the ring. */
if (ring_stats->enq_success_bulk != (RING_SIZE/MAX_BULK))
goto fail;
/* Current max objects is RING_SIZE -1. */
if (ring_stats->enq_success_objs != RING_SIZE -1)
goto fail;
/* Shouldn't have any failures yet. */
if (ring_stats->enq_fail_bulk != 0)
goto fail;
if (ring_stats->enq_fail_objs != 0)
goto fail;
printf("Test stats for SP burst enqueue to a full ring.\n");
num_items = 2;
ret = rte_ring_sp_enqueue_burst(r, cur_src, num_items);
if ((ret & RTE_RING_SZ_MASK) != 0)
goto fail;
failed_enqueue_ops += 1;
failed_enqueue_items += num_items;
/* The enqueue should have failed. */
if (ring_stats->enq_fail_bulk != failed_enqueue_ops)
goto fail;
if (ring_stats->enq_fail_objs != failed_enqueue_items)
goto fail;
printf("Test stats for SP bulk enqueue to a full ring.\n");
num_items = 4;
ret = rte_ring_sp_enqueue_bulk(r, cur_src, num_items);
if (ret != -ENOBUFS)
goto fail;
failed_enqueue_ops += 1;
failed_enqueue_items += num_items;
/* The enqueue should have failed. */
if (ring_stats->enq_fail_bulk != failed_enqueue_ops)
goto fail;
if (ring_stats->enq_fail_objs != failed_enqueue_items)
goto fail;
printf("Test stats for MP burst enqueue to a full ring.\n");
num_items = 8;
ret = rte_ring_mp_enqueue_burst(r, cur_src, num_items);
if ((ret & RTE_RING_SZ_MASK) != 0)
goto fail;
failed_enqueue_ops += 1;
failed_enqueue_items += num_items;
/* The enqueue should have failed. */
if (ring_stats->enq_fail_bulk != failed_enqueue_ops)
goto fail;
if (ring_stats->enq_fail_objs != failed_enqueue_items)
goto fail;
printf("Test stats for MP bulk enqueue to a full ring.\n");
num_items = 16;
ret = rte_ring_mp_enqueue_bulk(r, cur_src, num_items);
if (ret != -ENOBUFS)
goto fail;
failed_enqueue_ops += 1;
failed_enqueue_items += num_items;
/* The enqueue should have failed. */
if (ring_stats->enq_fail_bulk != failed_enqueue_ops)
goto fail;
if (ring_stats->enq_fail_objs != failed_enqueue_items)
goto fail;
/* Do Dequeue tests. */
printf("Test the dequeue stats.\n");
printf("Empty the ring.\n");
for (i = 0; i<RING_SIZE/MAX_BULK; i++) {
rte_ring_sc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
}
/* There was only RING_SIZE -1 objects to dequeue. */
cur_dst++;
printf("Verify ring is empty.\n");
if (1 != rte_ring_empty(r))
goto fail;
printf("Verify the dequeue success stats.\n");
/* Stats should match above dequeue operations. */
if (ring_stats->deq_success_bulk != (RING_SIZE/MAX_BULK))
goto fail;
/* Objects dequeued is RING_SIZE -1. */
if (ring_stats->deq_success_objs != RING_SIZE -1)
goto fail;
/* Shouldn't have any dequeue failure stats yet. */
if (ring_stats->deq_fail_bulk != 0)
goto fail;
printf("Test stats for SC burst dequeue with an empty ring.\n");
num_items = 2;
ret = rte_ring_sc_dequeue_burst(r, cur_dst, num_items);
if ((ret & RTE_RING_SZ_MASK) != 0)
goto fail;
failed_dequeue_ops += 1;
failed_dequeue_items += num_items;
/* The dequeue should have failed. */
if (ring_stats->deq_fail_bulk != failed_dequeue_ops)
goto fail;
if (ring_stats->deq_fail_objs != failed_dequeue_items)
goto fail;
printf("Test stats for SC bulk dequeue with an empty ring.\n");
num_items = 4;
ret = rte_ring_sc_dequeue_bulk(r, cur_dst, num_items);
if (ret != -ENOENT)
goto fail;
failed_dequeue_ops += 1;
failed_dequeue_items += num_items;
/* The dequeue should have failed. */
if (ring_stats->deq_fail_bulk != failed_dequeue_ops)
goto fail;
if (ring_stats->deq_fail_objs != failed_dequeue_items)
goto fail;
printf("Test stats for MC burst dequeue with an empty ring.\n");
num_items = 8;
ret = rte_ring_mc_dequeue_burst(r, cur_dst, num_items);
if ((ret & RTE_RING_SZ_MASK) != 0)
goto fail;
failed_dequeue_ops += 1;
failed_dequeue_items += num_items;
/* The dequeue should have failed. */
if (ring_stats->deq_fail_bulk != failed_dequeue_ops)
goto fail;
if (ring_stats->deq_fail_objs != failed_dequeue_items)
goto fail;
printf("Test stats for MC bulk dequeue with an empty ring.\n");
num_items = 16;
ret = rte_ring_mc_dequeue_bulk(r, cur_dst, num_items);
if (ret != -ENOENT)
goto fail;
failed_dequeue_ops += 1;
failed_dequeue_items += num_items;
/* The dequeue should have failed. */
if (ring_stats->deq_fail_bulk != failed_dequeue_ops)
goto fail;
if (ring_stats->deq_fail_objs != failed_dequeue_items)
goto fail;
printf("Test total enqueue/dequeue stats.\n");
/* At this point the enqueue and dequeue stats should be the same. */
if (ring_stats->enq_success_bulk != ring_stats->deq_success_bulk)
goto fail;
if (ring_stats->enq_success_objs != ring_stats->deq_success_objs)
goto fail;
if (ring_stats->enq_fail_bulk != ring_stats->deq_fail_bulk)
goto fail;
if (ring_stats->enq_fail_objs != ring_stats->deq_fail_objs)
goto fail;
/* Watermark Tests. */
printf("Test the watermark/quota stats.\n");
printf("Verify the initial watermark stats.\n");
/* Watermark stats should be 0 since there is no watermark. */
if (ring_stats->enq_quota_bulk != 0)
goto fail;
if (ring_stats->enq_quota_objs != 0)
goto fail;
/* Set a watermark. */
rte_ring_set_water_mark(r, 16);
/* Reset pointers. */
cur_src = src;
cur_dst = dst;
last_enqueue_ops = ring_stats->enq_success_bulk;
last_enqueue_items = ring_stats->enq_success_objs;
printf("Test stats for SP burst enqueue below watermark.\n");
num_items = 8;
ret = rte_ring_sp_enqueue_burst(r, cur_src, num_items);
if ((ret & RTE_RING_SZ_MASK) != num_items)
goto fail;
/* Watermark stats should still be 0. */
if (ring_stats->enq_quota_bulk != 0)
goto fail;
if (ring_stats->enq_quota_objs != 0)
goto fail;
/* Success stats should have increased. */
if (ring_stats->enq_success_bulk != last_enqueue_ops + 1)
goto fail;
if (ring_stats->enq_success_objs != last_enqueue_items + num_items)
goto fail;
last_enqueue_ops = ring_stats->enq_success_bulk;
last_enqueue_items = ring_stats->enq_success_objs;
printf("Test stats for SP burst enqueue at watermark.\n");
num_items = 8;
ret = rte_ring_sp_enqueue_burst(r, cur_src, num_items);
if ((ret & RTE_RING_SZ_MASK) != num_items)
goto fail;
/* Watermark stats should have changed. */
if (ring_stats->enq_quota_bulk != 1)
goto fail;
if (ring_stats->enq_quota_objs != num_items)
goto fail;
last_quota_ops = ring_stats->enq_quota_bulk;
last_quota_items = ring_stats->enq_quota_objs;
printf("Test stats for SP burst enqueue above watermark.\n");
num_items = 1;
ret = rte_ring_sp_enqueue_burst(r, cur_src, num_items);
if ((ret & RTE_RING_SZ_MASK) != num_items)
goto fail;
/* Watermark stats should have changed. */
if (ring_stats->enq_quota_bulk != last_quota_ops +1)
goto fail;
if (ring_stats->enq_quota_objs != last_quota_items + num_items)
goto fail;
last_quota_ops = ring_stats->enq_quota_bulk;
last_quota_items = ring_stats->enq_quota_objs;
printf("Test stats for MP burst enqueue above watermark.\n");
num_items = 2;
ret = rte_ring_mp_enqueue_burst(r, cur_src, num_items);
if ((ret & RTE_RING_SZ_MASK) != num_items)
goto fail;
/* Watermark stats should have changed. */
if (ring_stats->enq_quota_bulk != last_quota_ops +1)
goto fail;
if (ring_stats->enq_quota_objs != last_quota_items + num_items)
goto fail;
last_quota_ops = ring_stats->enq_quota_bulk;
last_quota_items = ring_stats->enq_quota_objs;
printf("Test stats for SP bulk enqueue above watermark.\n");
num_items = 4;
ret = rte_ring_sp_enqueue_bulk(r, cur_src, num_items);
if (ret != -EDQUOT)
goto fail;
/* Watermark stats should have changed. */
if (ring_stats->enq_quota_bulk != last_quota_ops +1)
goto fail;
if (ring_stats->enq_quota_objs != last_quota_items + num_items)
goto fail;
last_quota_ops = ring_stats->enq_quota_bulk;
last_quota_items = ring_stats->enq_quota_objs;
printf("Test stats for MP bulk enqueue above watermark.\n");
num_items = 8;
ret = rte_ring_mp_enqueue_bulk(r, cur_src, num_items);
if (ret != -EDQUOT)
goto fail;
/* Watermark stats should have changed. */
if (ring_stats->enq_quota_bulk != last_quota_ops +1)
goto fail;
if (ring_stats->enq_quota_objs != last_quota_items + num_items)
goto fail;
printf("Test watermark success stats.\n");
/* Success stats should be same as last non-watermarked enqueue. */
if (ring_stats->enq_success_bulk != last_enqueue_ops)
goto fail;
if (ring_stats->enq_success_objs != last_enqueue_items)
goto fail;
/* Cleanup. */
/* Empty the ring. */
for (i = 0; i<RING_SIZE/MAX_BULK; i++) {
rte_ring_sc_dequeue_burst(r, cur_dst, MAX_BULK);
cur_dst += MAX_BULK;
}
/* Reset the watermark. */
rte_ring_set_water_mark(r, 0);
/* Reset the ring stats. */
memset(&r->stats[lcore_id], 0, sizeof(r->stats[lcore_id]));
/* Free memory before test completed */
free(src);
free(dst);
return 0;
fail:
free(src);
free(dst);
return -1;
#endif
}
/*
* it will always fail to create ring with a wrong ring size number in this function
*/
static int
test_ring_creation_with_wrong_size(void)
{
struct rte_ring * rp = NULL;
/* Test if ring size is not power of 2 */
rp = rte_ring_create("test_bad_ring_size", RING_SIZE + 1, SOCKET_ID_ANY, 0);
if (NULL != rp) {
return -1;
}
/* Test if ring size is exceeding the limit */
rp = rte_ring_create("test_bad_ring_size", (RTE_RING_SZ_MASK + 1), SOCKET_ID_ANY, 0);
if (NULL != rp) {
return -1;
}
return 0;
}
/*
* it tests if it would always fail to create ring with an used ring name
*/
static int
test_ring_creation_with_an_used_name(void)
{
struct rte_ring * rp;
rp = rte_ring_create("test", RING_SIZE, SOCKET_ID_ANY, 0);
if (NULL != rp)
return -1;
return 0;
}
/*
* Test to if a non-power of 2 count causes the create
* function to fail correctly
*/
static int
test_create_count_odd(void)
{
struct rte_ring *r = rte_ring_create("test_ring_count",
4097, SOCKET_ID_ANY, 0 );
if(r != NULL){
return -1;
}
return 0;
}
static int
test_lookup_null(void)
{
struct rte_ring *rlp = rte_ring_lookup("ring_not_found");
if (rlp ==NULL)
if (rte_errno != ENOENT){
printf( "test failed to returnn error on null pointer\n");
return -1;
}
return 0;
}
/*
* it tests some more basic ring operations
*/
static int
test_ring_basic_ex(void)
{
int ret = -1;
unsigned i;
struct rte_ring * rp;
void **obj = NULL;
obj = rte_calloc("test_ring_basic_ex_malloc", RING_SIZE, sizeof(void *), 0);
if (obj == NULL) {
printf("test_ring_basic_ex fail to rte_malloc\n");
goto fail_test;
}
rp = rte_ring_create("test_ring_basic_ex", RING_SIZE, SOCKET_ID_ANY,
RING_F_SP_ENQ | RING_F_SC_DEQ);
if (rp == NULL) {
printf("test_ring_basic_ex fail to create ring\n");
goto fail_test;
}
if (rte_ring_lookup("test_ring_basic_ex") != rp) {
goto fail_test;
}
if (rte_ring_empty(rp) != 1) {
printf("test_ring_basic_ex ring is not empty but it should be\n");
goto fail_test;
}
printf("%u ring entries are now free\n", rte_ring_free_count(rp));
for (i = 0; i < RING_SIZE; i ++) {
rte_ring_enqueue(rp, obj[i]);
}
if (rte_ring_full(rp) != 1) {
printf("test_ring_basic_ex ring is not full but it should be\n");
goto fail_test;
}
for (i = 0; i < RING_SIZE; i ++) {
rte_ring_dequeue(rp, &obj[i]);
}
if (rte_ring_empty(rp) != 1) {
printf("test_ring_basic_ex ring is not empty but it should be\n");
goto fail_test;
}
/* Covering the ring burst operation */
ret = rte_ring_enqueue_burst(rp, obj, 2);
if ((ret & RTE_RING_SZ_MASK) != 2) {
printf("test_ring_basic_ex: rte_ring_enqueue_burst fails \n");
goto fail_test;
}
ret = rte_ring_dequeue_burst(rp, obj, 2);
if (ret != 2) {
printf("test_ring_basic_ex: rte_ring_dequeue_burst fails \n");
goto fail_test;
}
ret = 0;
fail_test:
if (obj != NULL)
rte_free(obj);
return ret;
}
static int
test_ring(void)
{
/* some more basic operations */
if (test_ring_basic_ex() < 0)
return -1;
rte_atomic32_init(&synchro);
if (r == NULL)
r = rte_ring_create("test", RING_SIZE, SOCKET_ID_ANY, 0);
if (r == NULL)
return -1;
/* retrieve the ring from its name */
if (rte_ring_lookup("test") != r) {
printf("Cannot lookup ring from its name\n");
return -1;
}
/* burst operations */
if (test_ring_burst_basic() < 0)
return -1;
/* basic operations */
if (test_ring_basic() < 0)
return -1;
/* ring stats */
if (test_ring_stats() < 0)
return -1;
/* basic operations */
if (test_live_watermark_change() < 0)
return -1;
if ( test_set_watermark() < 0){
printf ("Test failed to detect invalid parameter\n");
return -1;
}
else
printf ( "Test detected forced bad watermark values\n");
if ( test_create_count_odd() < 0){
printf ("Test failed to detect odd count\n");
return -1;
}
else
printf ( "Test detected odd count\n");
if ( test_lookup_null() < 0){
printf ("Test failed to detect NULL ring lookup\n");
return -1;
}
else
printf ( "Test detected NULL ring lookup \n");
/* test of creating ring with wrong size */
if (test_ring_creation_with_wrong_size() < 0)
return -1;
/* test of creation ring with an used name */
if (test_ring_creation_with_an_used_name() < 0)
return -1;
/* dump the ring status */
rte_ring_list_dump(stdout);
return 0;
}
static struct test_command ring_cmd = {
.command = "ring_autotest",
.callback = test_ring,
};
REGISTER_TEST_COMMAND(ring_cmd);
|