DPDK logo

Elixir Cross Referencer

  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
/*-
 *   BSD LICENSE
 * 
 *   Copyright(c) 2010-2013 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 <stdio.h>
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
#include <stdarg.h>
#include <errno.h>
#include <sys/queue.h>

#include <rte_common.h>
#include <rte_lcore.h>
#include <rte_malloc.h>
#include <rte_cycles.h>
#include <rte_random.h>
#include <rte_memory.h>
#include <rte_memzone.h>
#include <rte_tailq.h>
#include <rte_eal.h>
#include <rte_ip.h>
#include <rte_string_fns.h>
#include <cmdline_parse.h>

#include "test.h"

#ifdef RTE_LIBRTE_HASH

#include <rte_hash.h>
#include <rte_fbk_hash.h>
#include <rte_jhash.h>

#ifdef RTE_MACHINE_CPUFLAG_SSE4_2
#include <rte_hash_crc.h>
#endif

/* Types of hash table performance test that can be performed */
enum hash_test_t {
	ADD_ON_EMPTY,		/*< Add keys to empty table */
	DELETE_ON_EMPTY,	/*< Attempt to delete keys from empty table */
	LOOKUP_ON_EMPTY,	/*< Attempt to find keys in an empty table */
	ADD_UPDATE,		/*< Add/update keys in a full table */
	DELETE,			/*< Delete keys from a full table */
	LOOKUP			/*< Find keys in a full table */
};

/* Function type for hash table operations. */
typedef int32_t (*hash_operation)(const struct rte_hash *h, const void *key);

/* Structure to hold parameters used to run a hash table performance test */
struct tbl_perf_test_params {
	enum hash_test_t test_type;
	uint32_t num_iterations;
	uint32_t entries;
	uint32_t bucket_entries;
	uint32_t key_len;
	rte_hash_function hash_func;
	uint32_t hash_func_init_val;
};

#define ITERATIONS 10000
#define LOCAL_FBK_HASH_ENTRIES_MAX (1 << 15)

/*******************************************************************************
 * Hash function performance test configuration section. Each performance test
 * will be performed HASHTEST_ITERATIONS times.
 *
 * The five arrays below control what tests are performed. Every combination
 * from the array entries is tested.
 */
#define HASHTEST_ITERATIONS 1000000

#ifdef RTE_MACHINE_CPUFLAG_SSE4_2
static rte_hash_function hashtest_funcs[] = {rte_jhash, rte_hash_crc};
#else
static rte_hash_function hashtest_funcs[] = {rte_jhash};
#endif
static uint32_t hashtest_initvals[] = {0};
static uint32_t hashtest_key_lens[] = {2, 4, 5, 6, 7, 8, 10, 11, 15, 16, 21, 31, 32, 33, 63, 64};
/******************************************************************************/

/*******************************************************************************
 * Hash table performance test configuration section.
 */
struct tbl_perf_test_params tbl_perf_params[] =
{
/* Small table, add */
/*  Test type | Iterations | Entries | BucketSize | KeyLen |     HashFunc | InitVal */
{ ADD_ON_EMPTY,        1024,     1024,           1,      16,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           2,      16,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           4,      16,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           8,      16,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,          16,      16,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           1,      32,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           2,      32,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           4,      32,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           8,      32,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,          16,      32,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           1,      48,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           2,      48,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           4,      48,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           8,      48,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,          16,      48,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           1,      64,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           2,      64,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           4,      64,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,           8,      64,     rte_jhash,  0},
{ ADD_ON_EMPTY,        1024,     1024,          16,      64,     rte_jhash,  0},
/* Small table, update */
/*  Test type | Iterations | Entries | BucketSize | KeyLen |     HashFunc | InitVal */
{   ADD_UPDATE,  ITERATIONS,     1024,           1,      16,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           2,      16,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           4,      16,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           8,      16,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,          16,      16,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           1,      32,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           2,      32,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           4,      32,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           8,      32,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,          16,      32,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           1,      48,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           2,      48,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           4,      48,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           8,      48,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,          16,      48,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           1,      64,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           2,      64,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           4,      64,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,           8,      64,     rte_jhash,  0},
{   ADD_UPDATE,  ITERATIONS,     1024,          16,      64,     rte_jhash,  0},
/* Small table, lookup */
/*  Test type | Iterations | Entries | BucketSize | KeyLen |     HashFunc | InitVal */
{       LOOKUP,  ITERATIONS,     1024,           1,      16,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           2,      16,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           4,      16,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           8,      16,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,          16,      16,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           1,      32,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           2,      32,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           4,      32,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           8,      32,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,          16,      32,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           1,      48,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           2,      48,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           4,      48,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           8,      48,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,          16,      48,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           1,      64,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           2,      64,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           4,      64,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,           8,      64,     rte_jhash,  0},
{       LOOKUP,  ITERATIONS,     1024,          16,      64,     rte_jhash,  0},
/* Big table, add */
/* Test type  | Iterations | Entries | BucketSize | KeyLen |    HashFunc | InitVal */
{ ADD_ON_EMPTY,     1048576,  1048576,           1,      16,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           2,      16,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           4,      16,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           8,      16,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,          16,      16,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           1,      32,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           2,      32,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           4,      32,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           8,      32,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,          16,      32,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           1,      48,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           2,      48,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           4,      48,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           8,      48,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,          16,      48,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           1,      64,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           2,      64,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           4,      64,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           8,      64,    rte_jhash,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,          16,      64,    rte_jhash,   0},
/* Big table, update */
/* Test type  | Iterations | Entries | BucketSize | KeyLen |    HashFunc | InitVal */
{   ADD_UPDATE,  ITERATIONS,  1048576,           1,      16,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           2,      16,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           4,      16,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           8,      16,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,          16,      16,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           1,      32,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           2,      32,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           4,      32,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           8,      32,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,          16,      32,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           1,      48,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           2,      48,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           4,      48,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           8,      48,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,          16,      48,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           1,      64,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           2,      64,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           4,      64,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           8,      64,    rte_jhash,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,          16,      64,    rte_jhash,   0},
/* Big table, lookup */
/* Test type  | Iterations | Entries | BucketSize | KeyLen |    HashFunc | InitVal */
{       LOOKUP,  ITERATIONS,  1048576,           1,      16,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           2,      16,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           4,      16,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           8,      16,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,          16,      16,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           1,      32,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           2,      32,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           4,      32,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           8,      32,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,          16,      32,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           1,      48,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           2,      48,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           4,      48,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           8,      48,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,          16,      48,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           1,      64,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           2,      64,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           4,      64,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,           8,      64,    rte_jhash,   0},
{       LOOKUP,  ITERATIONS,  1048576,          16,      64,    rte_jhash,   0},
#ifdef RTE_MACHINE_CPUFLAG_SSE4_2
/* Small table, add */
/*  Test type | Iterations | Entries | BucketSize | KeyLen |    HashFunc | InitVal */
{ ADD_ON_EMPTY,        1024,     1024,           1,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           2,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           4,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           8,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,          16,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           1,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           2,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           4,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           8,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,          16,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           1,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           2,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           4,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           8,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,          16,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           1,      64, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           2,      64, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           4,      64, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,           8,      64, rte_hash_crc,   0},
{ ADD_ON_EMPTY,        1024,     1024,          16,      64, rte_hash_crc,   0},
/* Small table, update */
/*  Test type | Iterations | Entries | BucketSize | KeyLen |    HashFunc | InitVal */
{   ADD_UPDATE,  ITERATIONS,     1024,           1,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           2,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           4,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           8,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,          16,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           1,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           2,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           4,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           8,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,          16,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           1,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           2,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           4,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           8,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,          16,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           1,      64, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           2,      64, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           4,      64, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,           8,      64, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,     1024,          16,      64, rte_hash_crc,   0},
/* Small table, lookup */
/*  Test type | Iterations | Entries | BucketSize | KeyLen |    HashFunc | InitVal */
{       LOOKUP,  ITERATIONS,     1024,           1,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           2,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           4,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           8,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,          16,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           1,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           2,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           4,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           8,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,          16,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           1,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           2,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           4,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           8,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,          16,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           1,      64, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           2,      64, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           4,      64, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,           8,      64, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,     1024,          16,      64, rte_hash_crc,   0},
/* Big table, add */
/* Test type  | Iterations | Entries | BucketSize | KeyLen |    HashFunc | InitVal */
{ ADD_ON_EMPTY,     1048576,  1048576,           1,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           2,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           4,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           8,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,          16,      16, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           1,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           2,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           4,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           8,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,          16,      32, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           1,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           2,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           4,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           8,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,          16,      48, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           1,      64, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           2,      64, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           4,      64, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,           8,      64, rte_hash_crc,   0},
{ ADD_ON_EMPTY,     1048576,  1048576,          16,      64, rte_hash_crc,   0},
/* Big table, update */
/* Test type  | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
{   ADD_UPDATE,  ITERATIONS,  1048576,           1,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           2,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           4,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           8,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,          16,      16, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           1,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           2,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           4,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           8,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,          16,      32, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           1,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           2,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           4,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           8,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,          16,      48, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           1,      64, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           2,      64, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           4,      64, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,           8,      64, rte_hash_crc,   0},
{   ADD_UPDATE,  ITERATIONS,  1048576,          16,      64, rte_hash_crc,   0},
/* Big table, lookup */
/* Test type  | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
{       LOOKUP,  ITERATIONS,  1048576,           1,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           2,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           4,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           8,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,          16,      16, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           1,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           2,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           4,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           8,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,          16,      32, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           1,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           2,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           4,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           8,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,          16,      48, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           1,      64, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           2,      64, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           4,      64, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,           8,      64, rte_hash_crc,   0},
{       LOOKUP,  ITERATIONS,  1048576,          16,      64, rte_hash_crc,   0},
#endif
};

/******************************************************************************/

/*
 * Check condition and return an error if true. Assumes that "handle" is the
 * name of the hash structure pointer to be freed.
 */
#define RETURN_IF_ERROR(cond, str, ...) do {				\
	if (cond) {							\
		printf("ERROR line %d: " str "\n", __LINE__, ##__VA_ARGS__); \
		if (handle) rte_hash_free(handle);			\
		return -1;						\
	}								\
} while(0)

#define RETURN_IF_ERROR_FBK(cond, str, ...) do {				\
	if (cond) {							\
		printf("ERROR line %d: " str "\n", __LINE__, ##__VA_ARGS__); \
		if (handle) rte_fbk_hash_free(handle);			\
		return -1;						\
	}								\
} while(0)

/*
 * Find average of array of numbers.
 */
static double
get_avg(const uint32_t *array, uint32_t size)
{
	double sum = 0;
	unsigned i;
	for (i = 0; i < size; i++)
		sum += array[i];
	return sum / (double)size;
}

/*
 * To help print out name of hash functions.
 */
static const char *get_hash_name(rte_hash_function f)
{
	if (f == rte_jhash)
		return "jhash";

#ifdef RTE_MACHINE_CPUFLAG_SSE4_2
	if (f == rte_hash_crc)
		return "rte_hash_crc";
#endif

	return "UnknownHash";
}

/*
 * Do a single performance test, of one type of operation.
 *
 * @param h
 *   hash table to run test on
 * @param func
 *   function to call (add, delete or lookup function)
 * @param avg_occupancy
 *   The average number of entries in each bucket of the hash table
 * @param invalid_pos_count
 *   The amount of errors (e.g. due to a full bucket).
 * @return
 *   The average number of ticks per hash function call. A negative number
 *   signifies failure.
 */
static double
run_single_tbl_perf_test(const struct rte_hash *h, hash_operation func,
		const struct tbl_perf_test_params *params, double *avg_occupancy,
		uint32_t *invalid_pos_count)
{
	uint64_t begin, end, ticks = 0;
	uint8_t *key = NULL;
	uint32_t *bucket_occupancies = NULL;
	uint32_t num_buckets, i, j;
	int32_t pos;

	/* Initialise */
	num_buckets = params->entries / params->bucket_entries;
	key = (uint8_t *) rte_zmalloc("hash key",
			params->key_len * sizeof(uint8_t), 16);
	if (key == NULL)
		return -1;

	bucket_occupancies = (uint32_t *) rte_zmalloc("bucket occupancies",
			num_buckets * sizeof(uint32_t), 16);
	if (bucket_occupancies == NULL) {
		rte_free(key);
		return -1;
	}

	ticks = 0;
	*invalid_pos_count = 0;

	for (i = 0; i < params->num_iterations; i++) {
		/* Prepare inputs for the current iteration */
		for (j = 0; j < params->key_len; j++)
			key[j] = (uint8_t) rte_rand();

		/* Perform operation, and measure time it takes */
		begin = rte_rdtsc();
		pos = func(h, key);
		end = rte_rdtsc();
		ticks += end - begin;

		/* Other work per iteration */
		if (pos < 0)
			*invalid_pos_count += 1;
		else
			bucket_occupancies[pos / params->bucket_entries]++;
	}
	*avg_occupancy = get_avg(bucket_occupancies, num_buckets);

	rte_free(bucket_occupancies);
	rte_free(key);

	return (double)ticks / params->num_iterations;
}

/*
 * To help print out what tests are being done.
 */
static const char *
get_tbl_perf_test_desc(enum hash_test_t type)
{
	switch (type){
	case ADD_ON_EMPTY: return "Add on Empty";
	case DELETE_ON_EMPTY: return "Delete on Empty";
	case LOOKUP_ON_EMPTY: return "Lookup on Empty";
	case ADD_UPDATE: return "Add Update";
	case DELETE: return "Delete";
	case LOOKUP: return "Lookup";
	default: return "UNKNOWN";
	}
}

/*
 * Run a hash table performance test based on params.
 */
static int
run_tbl_perf_test(struct tbl_perf_test_params *params)
{
	static unsigned calledCount = 5;
	struct rte_hash_parameters hash_params = {
		.entries = params->entries,
		.bucket_entries = params->bucket_entries,
		.key_len = params->key_len,
		.hash_func = params->hash_func,
		.hash_func_init_val = params->hash_func_init_val,
		.socket_id = rte_socket_id(),
	};
	struct rte_hash *handle;
	double avg_occupancy = 0, ticks = 0;
	uint32_t num_iterations, invalid_pos;
	char name[RTE_HASH_NAMESIZE];
	char hashname[RTE_HASH_NAMESIZE];

	rte_snprintf(name, 32, "test%u", calledCount++);
	hash_params.name = name;

	handle = rte_hash_create(&hash_params);
	RETURN_IF_ERROR(handle == NULL, "hash creation failed");

	switch (params->test_type){
	case ADD_ON_EMPTY:
		ticks = run_single_tbl_perf_test(handle, rte_hash_add_key,
				params, &avg_occupancy, &invalid_pos);
		break;
	case DELETE_ON_EMPTY:
		ticks = run_single_tbl_perf_test(handle, rte_hash_del_key,
				params, &avg_occupancy, &invalid_pos);
		break;
	case LOOKUP_ON_EMPTY:
		ticks = run_single_tbl_perf_test(handle, rte_hash_lookup,
				params, &avg_occupancy, &invalid_pos);
		break;
	case ADD_UPDATE:
		num_iterations = params->num_iterations;
		params->num_iterations = params->entries;
		run_single_tbl_perf_test(handle, rte_hash_add_key, params,
				&avg_occupancy, &invalid_pos);
		params->num_iterations = num_iterations;
		ticks = run_single_tbl_perf_test(handle, rte_hash_add_key,
				params, &avg_occupancy, &invalid_pos);
		break;
	case DELETE:
		num_iterations = params->num_iterations;
		params->num_iterations = params->entries;
		run_single_tbl_perf_test(handle, rte_hash_add_key, params,
				&avg_occupancy, &invalid_pos);

		params->num_iterations = num_iterations;
		ticks = run_single_tbl_perf_test(handle, rte_hash_del_key,
				params, &avg_occupancy, &invalid_pos);
		break;
	case LOOKUP:
		num_iterations = params->num_iterations;
		params->num_iterations = params->entries;
		run_single_tbl_perf_test(handle, rte_hash_add_key, params,
				&avg_occupancy, &invalid_pos);

		params->num_iterations = num_iterations;
		ticks = run_single_tbl_perf_test(handle, rte_hash_lookup,
				params, &avg_occupancy, &invalid_pos);
		break;
	default: return -1;
	}

	rte_snprintf(hashname, RTE_HASH_NAMESIZE, "%s", get_hash_name(params->hash_func));

	printf("%-12s, %-15s, %-16u, %-7u, %-18u, %-8u, %-19.2f, %.2f\n",
		hashname,
		get_tbl_perf_test_desc(params->test_type),
		(unsigned) params->key_len,
		(unsigned) params->entries,
		(unsigned) params->bucket_entries,
		(unsigned) invalid_pos,
		avg_occupancy,
		ticks
	);

	/* Free */
	rte_hash_free(handle);
	return 0;
}

/*
 * Run all hash table performance tests.
 */
static int run_all_tbl_perf_tests(void)
{
	unsigned i;

	printf(" *** Hash table performance test results ***\n");
	printf("Hash Func.  , Operation      , Key size (bytes), Entries, "
	       "Entries per bucket, Errors  , Avg. bucket entries, Ticks/Op.\n");

	/* Loop through every combination of test parameters */
	for (i = 0;
	     i < sizeof(tbl_perf_params) / sizeof(struct tbl_perf_test_params);
	     i++) {

		/* Perform test */
		if (run_tbl_perf_test(&tbl_perf_params[i]) < 0)
			return -1;
	}
	return 0;
}

/*
 * Test a hash function.
 */
static void run_hash_func_test(rte_hash_function f, uint32_t init_val,
		uint32_t key_len)
{
	static uint8_t key[RTE_HASH_KEY_LENGTH_MAX];
	uint64_t ticks = 0, start, end;
	unsigned i, j;

	for (i = 0; i < HASHTEST_ITERATIONS; i++) {

		for (j = 0; j < key_len; j++)
			key[j] = (uint8_t) rte_rand();

		start = rte_rdtsc();
		f(key, key_len, init_val);
		end = rte_rdtsc();
		ticks += end - start;
	}

	printf("%-12s, %-18u, %-13u, %.02f\n", get_hash_name(f), (unsigned) key_len,
			(unsigned) init_val, (double)ticks / HASHTEST_ITERATIONS);
}

/*
 * Test all hash functions.
 */
static void run_hash_func_tests(void)
{
	unsigned i, j, k;

	printf("\n\n *** Hash function performance test results ***\n");
	printf(" Number of iterations for each test = %d\n",
			HASHTEST_ITERATIONS);
	printf("Hash Func.  , Key Length (bytes), Initial value, Ticks/Op.\n");

	for (i = 0;
	     i < sizeof(hashtest_funcs) / sizeof(rte_hash_function);
	     i++) {
		for (j = 0;
		     j < sizeof(hashtest_initvals) / sizeof(uint32_t);
		     j++) {
			for (k = 0;
			     k < sizeof(hashtest_key_lens) / sizeof(uint32_t);
			     k++) {
				run_hash_func_test(hashtest_funcs[i],
						hashtest_initvals[j],
						hashtest_key_lens[k]);
			}
		}
	}
}

/* Control operation of performance testing of fbk hash. */
#define LOAD_FACTOR 0.667	/* How full to make the hash table. */
#define TEST_SIZE 1000000	/* How many operations to time. */
#define TEST_ITERATIONS 30	/* How many measurements to take. */
#define ENTRIES (1 << 15)	/* How many entries. */

static int
fbk_hash_perf_test(void)
{
	struct rte_fbk_hash_params params = {
		.name = "fbk_hash_test",
		.entries = ENTRIES,
		.entries_per_bucket = 4,
		.socket_id = rte_socket_id(),
	};
	struct rte_fbk_hash_table *handle;
	uint32_t keys[ENTRIES] = {0};
	unsigned indexes[TEST_SIZE];
	uint64_t lookup_time = 0;
	unsigned added = 0;
	unsigned value = 0;
	unsigned i, j;

	handle = rte_fbk_hash_create(&params);
	RETURN_IF_ERROR_FBK(handle == NULL, "fbk hash creation failed");

	/* Generate random keys and values. */
	for (i = 0; i < ENTRIES; i++) {
		uint32_t key = (uint32_t)rte_rand();
		key = ((uint64_t)key << 32) | (uint64_t)rte_rand();
		uint16_t val = (uint16_t)rte_rand();

		if (rte_fbk_hash_add_key(handle, key, val) == 0) {
			keys[added] = key;
			added++;
		}
		if (added > (LOAD_FACTOR * ENTRIES)) {
			break;
		}
	}

	for (i = 0; i < TEST_ITERATIONS; i++) {
		uint64_t begin;
		uint64_t end;

		/* Generate random indexes into keys[] array. */
		for (j = 0; j < TEST_SIZE; j++) {
			indexes[j] = rte_rand() % added;
		}

		begin = rte_rdtsc();
		/* Do lookups */
		for (j = 0; j < TEST_SIZE; j++) {
			value += rte_fbk_hash_lookup(handle, keys[indexes[j]]);
		}
		end = rte_rdtsc();
		lookup_time += (double)(end - begin);
	}

	printf("\n\n *** FBK Hash function performance test results ***\n");
	/*
	 * The use of the 'value' variable ensures that the hash lookup is not
	 * being optimised out by the compiler.
	 */
	if (value != 0)
		printf("Number of ticks per lookup = %g\n",
			(double)lookup_time /
			((double)TEST_ITERATIONS * (double)TEST_SIZE));

	rte_fbk_hash_free(handle);

	return 0;
}

/*
 * Do all unit and performance tests.
 */
int test_hash_perf(void)
{
	if (run_all_tbl_perf_tests() < 0)
		return -1;
	run_hash_func_tests();

	if (fbk_hash_perf_test() < 0)
		return -1;
	return 0;
}
#else /* RTE_LIBRTE_HASH */

int
test_hash_perf(void)
{
	printf("The Hash library is not included in this build\n");
	return 0;
}

#endif /* RTE_LIBRTE_HASH */