lib/librte_table/rte_table_hash_key16.c

   1 /*-
   2  *       BSD LICENSE
   3  *
   4  *       Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
   5  *       All rights reserved.
   6  *
   7  *       Redistribution and use in source and binary forms, with or without
   8  *       modification, are permitted provided that the following conditions
   9  *       are met:
  10  *
  11  *      * Redistributions of source code must retain the above copyright
  12  *               notice, this list of conditions and the following disclaimer.
  13  *      * Redistributions in binary form must reproduce the above copyright
  14  *               notice, this list of conditions and the following disclaimer in
  15  *               the documentation and/or other materials provided with the
  16  *               distribution.
  17  *      * Neither the name of Intel Corporation nor the names of its
  18  *               contributors may be used to endorse or promote products derived
  19  *               from this software without specific prior written permission.
  20  *
  21  *       THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  22  *       "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  23  *       LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  24  *       A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  25  *       OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  26  *       SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  27  *       LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  28  *       DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  29  *       THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  30  *       (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  31  *       OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  32  */
  33 #include <string.h>
  34 #include <stdio.h>
  35
  36 #include <rte_common.h>
  37 #include <rte_mbuf.h>
  38 #include <rte_memory.h>
  39 #include <rte_malloc.h>
  40 #include <rte_log.h>
  41
  42 #include "rte_table_hash.h"
  43 #include "rte_lru.h"
  44
  45 #define RTE_TABLE_HASH_KEY_SIZE                                         16
  46
  47 #define RTE_BUCKET_ENTRY_VALID                                          0x1LLU
  48
  49 #ifdef RTE_TABLE_STATS_COLLECT
  50
  51 #define RTE_TABLE_HASH_KEY16_STATS_PKTS_IN_ADD(table, val) \
  52         table->stats.n_pkts_in += val
  53 #define RTE_TABLE_HASH_KEY16_STATS_PKTS_LOOKUP_MISS(table, val) \
  54         table->stats.n_pkts_lookup_miss += val
  55
  56 #else
  57
  58 #define RTE_TABLE_HASH_KEY16_STATS_PKTS_IN_ADD(table, val)
  59 #define RTE_TABLE_HASH_KEY16_STATS_PKTS_LOOKUP_MISS(table, val)
  60
  61 #endif
  62
  63 struct rte_bucket_4_16 {
  64         /* Cache line 0 */
  65         uint64_t signature[4 + 1];
  66         uint64_t lru_list;
  67         struct rte_bucket_4_16 *next;
  68         uint64_t next_valid;
  69
  70         /* Cache line 1 */
  71         uint64_t key[4][2];
  72
  73         /* Cache line 2 */
  74         uint8_t data[0];
  75 };
  76
  77 struct rte_table_hash {
  78         struct rte_table_stats stats;
  79
  80         /* Input parameters */
  81         uint32_t n_buckets;
  82         uint32_t n_entries_per_bucket;
  83         uint32_t key_size;
  84         uint32_t entry_size;
  85         uint32_t bucket_size;
  86         uint32_t signature_offset;
  87         uint32_t key_offset;
  88         uint64_t key_mask[2];
  89         rte_table_hash_op_hash f_hash;
  90         uint64_t seed;
  91
  92         /* Extendible buckets */
  93         uint32_t n_buckets_ext;
  94         uint32_t stack_pos;
  95         uint32_t *stack;
  96
  97         /* Lookup table */
  98         uint8_t memory[0] __rte_cache_aligned;
  99 };
 100
 101 static int
 102 check_params_create_lru(struct rte_table_hash_key16_lru_params *params) {
 103         /* n_entries */
 104         if (params->n_entries == 0) {
 105                 RTE_LOG(ERR, TABLE, "%s: n_entries is zero\n", __func__);
 106                 return -EINVAL;
 107         }
 108
 109         /* f_hash */
 110         if (params->f_hash == NULL) {
 111                 RTE_LOG(ERR, TABLE,
 112                         "%s: f_hash function pointer is NULL\n", __func__);
 113                 return -EINVAL;
 114         }
 115
 116         return 0;
 117 }
 118
 119 static void *
 120 rte_table_hash_create_key16_lru(void *params,
 121                 int socket_id,
 122                 uint32_t entry_size)
 123 {
 124         struct rte_table_hash_key16_lru_params *p =
 125                         (struct rte_table_hash_key16_lru_params *) params;
 126         struct rte_table_hash *f;
 127         uint32_t n_buckets, n_entries_per_bucket,
 128                         key_size, bucket_size_cl, total_size, i;
 129
 130         /* Check input parameters */
 131         if ((check_params_create_lru(p) != 0) ||
 132                 ((sizeof(struct rte_table_hash) % RTE_CACHE_LINE_SIZE) != 0) ||
 133                 ((sizeof(struct rte_bucket_4_16) % RTE_CACHE_LINE_SIZE) != 0))
 134                 return NULL;
 135         n_entries_per_bucket = 4;
 136         key_size = 16;
 137
 138         /* Memory allocation */
 139         n_buckets = rte_align32pow2((p->n_entries + n_entries_per_bucket - 1) /
 140                 n_entries_per_bucket);
 141         bucket_size_cl = (sizeof(struct rte_bucket_4_16) + n_entries_per_bucket
 142                 * entry_size + RTE_CACHE_LINE_SIZE - 1) / RTE_CACHE_LINE_SIZE;
 143         total_size = sizeof(struct rte_table_hash) + n_buckets *
 144                 bucket_size_cl * RTE_CACHE_LINE_SIZE;
 145
 146         f = rte_zmalloc_socket("TABLE", total_size, RTE_CACHE_LINE_SIZE, socket_id);
 147         if (f == NULL) {
 148                 RTE_LOG(ERR, TABLE,
 149                 "%s: Cannot allocate %u bytes for hash table\n",
 150                 __func__, total_size);
 151                 return NULL;
 152         }
 153         RTE_LOG(INFO, TABLE,
 154                 "%s: Hash table memory footprint is %u bytes\n",
 155                 __func__, total_size);
 156
 157         /* Memory initialization */
 158         f->n_buckets = n_buckets;
 159         f->n_entries_per_bucket = n_entries_per_bucket;
 160         f->key_size = key_size;
 161         f->entry_size = entry_size;
 162         f->bucket_size = bucket_size_cl * RTE_CACHE_LINE_SIZE;
 163         f->signature_offset = p->signature_offset;
 164         f->key_offset = p->key_offset;
 165         f->f_hash = p->f_hash;
 166         f->seed = p->seed;
 167
 168         if (p->key_mask != NULL) {
 169                 f->key_mask[0] = ((uint64_t *)p->key_mask)[0];
 170                 f->key_mask[1] = ((uint64_t *)p->key_mask)[1];
 171         } else {
 172                 f->key_mask[0] = 0xFFFFFFFFFFFFFFFFLLU;
 173                 f->key_mask[1] = 0xFFFFFFFFFFFFFFFFLLU;
 174         }
 175
 176         for (i = 0; i < n_buckets; i++) {
 177                 struct rte_bucket_4_16 *bucket;
 178
 179                 bucket = (struct rte_bucket_4_16 *) &f->memory[i *
 180                         f->bucket_size];
 181                 lru_init(bucket);
 182         }
 183
 184         return f;
 185 }
 186
 187 static int
 188 rte_table_hash_free_key16_lru(void *table)
 189 {
 190         struct rte_table_hash *f = (struct rte_table_hash *) table;
 191
 192         /* Check input parameters */
 193         if (f == NULL) {
 194                 RTE_LOG(ERR, TABLE, "%s: table parameter is NULL\n", __func__);
 195                 return -EINVAL;
 196         }
 197
 198         rte_free(f);
 199         return 0;
 200 }
 201
 202 static int
 203 rte_table_hash_entry_add_key16_lru(
 204         void *table,
 205         void *key,
 206         void *entry,
 207         int *key_found,
 208         void **entry_ptr)
 209 {
 210         struct rte_table_hash *f = (struct rte_table_hash *) table;
 211         struct rte_bucket_4_16 *bucket;
 212         uint64_t signature, pos;
 213         uint32_t bucket_index, i;
 214
 215         signature = f->f_hash(key, f->key_size, f->seed);
 216         bucket_index = signature & (f->n_buckets - 1);
 217         bucket = (struct rte_bucket_4_16 *)
 218                         &f->memory[bucket_index * f->bucket_size];
 219         signature |= RTE_BUCKET_ENTRY_VALID;
 220
 221         /* Key is present in the bucket */
 222         for (i = 0; i < 4; i++) {
 223                 uint64_t bucket_signature = bucket->signature[i];
 224                 uint8_t *bucket_key = (uint8_t *) bucket->key[i];
 225
 226                 if ((bucket_signature == signature) &&
 227                                 (memcmp(key, bucket_key, f->key_size) == 0)) {
 228                         uint8_t *bucket_data = &bucket->data[i * f->entry_size];
 229
 230                         memcpy(bucket_data, entry, f->entry_size);
 231                         lru_update(bucket, i);
 232                         *key_found = 1;
 233                         *entry_ptr = (void *) bucket_data;
 234                         return 0;
 235                 }
 236         }
 237
 238         /* Key is not present in the bucket */
 239         for (i = 0; i < 4; i++) {
 240                 uint64_t bucket_signature = bucket->signature[i];
 241                 uint8_t *bucket_key = (uint8_t *) bucket->key[i];
 242
 243                 if (bucket_signature == 0) {
 244                         uint8_t *bucket_data = &bucket->data[i * f->entry_size];
 245
 246                         bucket->signature[i] = signature;
 247                         memcpy(bucket_key, key, f->key_size);
 248                         memcpy(bucket_data, entry, f->entry_size);
 249                         lru_update(bucket, i);
 250                         *key_found = 0;
 251                         *entry_ptr = (void *) bucket_data;
 252
 253                         return 0;
 254                 }
 255         }
 256
 257         /* Bucket full: replace LRU entry */
 258         pos = lru_pos(bucket);
 259         bucket->signature[pos] = signature;
 260         memcpy(bucket->key[pos], key, f->key_size);
 261         memcpy(&bucket->data[pos * f->entry_size], entry, f->entry_size);
 262         lru_update(bucket, pos);
 263         *key_found = 0;
 264         *entry_ptr = (void *) &bucket->data[pos * f->entry_size];
 265
 266         return 0;
 267 }
 268
 269 static int
 270 rte_table_hash_entry_delete_key16_lru(
 271         void *table,
 272         void *key,
 273         int *key_found,
 274         void *entry)
 275 {
 276         struct rte_table_hash *f = (struct rte_table_hash *) table;
 277         struct rte_bucket_4_16 *bucket;
 278         uint64_t signature;
 279         uint32_t bucket_index, i;
 280
 281         signature = f->f_hash(key, f->key_size, f->seed);
 282         bucket_index = signature & (f->n_buckets - 1);
 283         bucket = (struct rte_bucket_4_16 *)
 284                         &f->memory[bucket_index * f->bucket_size];
 285         signature |= RTE_BUCKET_ENTRY_VALID;
 286
 287         /* Key is present in the bucket */
 288         for (i = 0; i < 4; i++) {
 289                 uint64_t bucket_signature = bucket->signature[i];
 290                 uint8_t *bucket_key = (uint8_t *) bucket->key[i];
 291
 292                 if ((bucket_signature == signature) &&
 293                                 (memcmp(key, bucket_key, f->key_size) == 0)) {
 294                         uint8_t *bucket_data = &bucket->data[i * f->entry_size];
 295
 296                         bucket->signature[i] = 0;
 297                         *key_found = 1;
 298                         if (entry)
 299                                 memcpy(entry, bucket_data, f->entry_size);
 300                         return 0;
 301                 }
 302         }
 303
 304         /* Key is not present in the bucket */
 305         *key_found = 0;
 306         return 0;
 307 }
 308
 309 static int
 310 check_params_create_ext(struct rte_table_hash_key16_ext_params *params) {
 311         /* n_entries */
 312         if (params->n_entries == 0) {
 313                 RTE_LOG(ERR, TABLE, "%s: n_entries is zero\n", __func__);
 314                 return -EINVAL;
 315         }
 316
 317         /* n_entries_ext */
 318         if (params->n_entries_ext == 0) {
 319                 RTE_LOG(ERR, TABLE, "%s: n_entries_ext is zero\n", __func__);
 320                 return -EINVAL;
 321         }
 322
 323         /* f_hash */
 324         if (params->f_hash == NULL) {
 325                 RTE_LOG(ERR, TABLE,
 326                         "%s: f_hash function pointer is NULL\n", __func__);
 327                 return -EINVAL;
 328         }
 329
 330         return 0;
 331 }
 332
 333 static void *
 334 rte_table_hash_create_key16_ext(void *params,
 335                 int socket_id,
 336                 uint32_t entry_size)
 337 {
 338         struct rte_table_hash_key16_ext_params *p =
 339                         (struct rte_table_hash_key16_ext_params *) params;
 340         struct rte_table_hash *f;
 341         uint32_t n_buckets, n_buckets_ext, n_entries_per_bucket, key_size,
 342                         bucket_size_cl, stack_size_cl, total_size, i;
 343
 344         /* Check input parameters */
 345         if ((check_params_create_ext(p) != 0) ||
 346                 ((sizeof(struct rte_table_hash) % RTE_CACHE_LINE_SIZE) != 0) ||
 347                 ((sizeof(struct rte_bucket_4_16) % RTE_CACHE_LINE_SIZE) != 0))
 348                 return NULL;
 349
 350         n_entries_per_bucket = 4;
 351         key_size = 16;
 352
 353         /* Memory allocation */
 354         n_buckets = rte_align32pow2((p->n_entries + n_entries_per_bucket - 1) /
 355                 n_entries_per_bucket);
 356         n_buckets_ext = (p->n_entries_ext + n_entries_per_bucket - 1) /
 357                 n_entries_per_bucket;
 358         bucket_size_cl = (sizeof(struct rte_bucket_4_16) + n_entries_per_bucket
 359                 * entry_size + RTE_CACHE_LINE_SIZE - 1) / RTE_CACHE_LINE_SIZE;
 360         stack_size_cl = (n_buckets_ext * sizeof(uint32_t) + RTE_CACHE_LINE_SIZE - 1)
 361                 / RTE_CACHE_LINE_SIZE;
 362         total_size = sizeof(struct rte_table_hash) +
 363                 ((n_buckets + n_buckets_ext) * bucket_size_cl + stack_size_cl) *
 364                 RTE_CACHE_LINE_SIZE;
 365
 366         f = rte_zmalloc_socket("TABLE", total_size, RTE_CACHE_LINE_SIZE, socket_id);
 367         if (f == NULL) {
 368                 RTE_LOG(ERR, TABLE,
 369                         "%s: Cannot allocate %u bytes for hash table\n",
 370                         __func__, total_size);
 371                 return NULL;
 372         }
 373         RTE_LOG(INFO, TABLE,
 374                 "%s: Hash table memory footprint is %u bytes\n",
 375                 __func__, total_size);
 376
 377         /* Memory initialization */
 378         f->n_buckets = n_buckets;
 379         f->n_entries_per_bucket = n_entries_per_bucket;
 380         f->key_size = key_size;
 381         f->entry_size = entry_size;
 382         f->bucket_size = bucket_size_cl * RTE_CACHE_LINE_SIZE;
 383         f->signature_offset = p->signature_offset;
 384         f->key_offset = p->key_offset;
 385         f->f_hash = p->f_hash;
 386         f->seed = p->seed;
 387
 388         f->n_buckets_ext = n_buckets_ext;
 389         f->stack_pos = n_buckets_ext;
 390         f->stack = (uint32_t *)
 391                 &f->memory[(n_buckets + n_buckets_ext) * f->bucket_size];
 392
 393         for (i = 0; i < n_buckets_ext; i++)
 394                 f->stack[i] = i;
 395
 396         if (p->key_mask != NULL) {
 397                 f->key_mask[0] = (((uint64_t *)p->key_mask)[0]);
 398                 f->key_mask[1] = (((uint64_t *)p->key_mask)[1]);
 399         } else {
 400                 f->key_mask[0] = 0xFFFFFFFFFFFFFFFFLLU;
 401                 f->key_mask[1] = 0xFFFFFFFFFFFFFFFFLLU;
 402         }
 403
 404         return f;
 405 }
 406
 407 static int
 408 rte_table_hash_free_key16_ext(void *table)
 409 {
 410         struct rte_table_hash *f = (struct rte_table_hash *) table;
 411
 412         /* Check input parameters */
 413         if (f == NULL) {
 414                 RTE_LOG(ERR, TABLE, "%s: table parameter is NULL\n", __func__);
 415                 return -EINVAL;
 416         }
 417
 418         rte_free(f);
 419         return 0;
 420 }
 421
 422 static int
 423 rte_table_hash_entry_add_key16_ext(
 424         void *table,
 425         void *key,
 426         void *entry,
 427         int *key_found,
 428         void **entry_ptr)
 429 {
 430         struct rte_table_hash *f = (struct rte_table_hash *) table;
 431         struct rte_bucket_4_16 *bucket0, *bucket, *bucket_prev;
 432         uint64_t signature;
 433         uint32_t bucket_index, i;
 434
 435         signature = f->f_hash(key, f->key_size, f->seed);
 436         bucket_index = signature & (f->n_buckets - 1);
 437         bucket0 = (struct rte_bucket_4_16 *)
 438                         &f->memory[bucket_index * f->bucket_size];
 439         signature |= RTE_BUCKET_ENTRY_VALID;
 440
 441         /* Key is present in the bucket */
 442         for (bucket = bucket0; bucket != NULL; bucket = bucket->next)
 443                 for (i = 0; i < 4; i++) {
 444                         uint64_t bucket_signature = bucket->signature[i];
 445                         uint8_t *bucket_key = (uint8_t *) bucket->key[i];
 446
 447                         if ((bucket_signature == signature) &&
 448                                 (memcmp(key, bucket_key, f->key_size) == 0)) {
 449                                 uint8_t *bucket_data = &bucket->data[i *
 450                                         f->entry_size];
 451
 452                                 memcpy(bucket_data, entry, f->entry_size);
 453                                 *key_found = 1;
 454                                 *entry_ptr = (void *) bucket_data;
 455                                 return 0;
 456                         }
 457                 }
 458
 459         /* Key is not present in the bucket */
 460         for (bucket_prev = NULL, bucket = bucket0; bucket != NULL;
 461                          bucket_prev = bucket, bucket = bucket->next)
 462                 for (i = 0; i < 4; i++) {
 463                         uint64_t bucket_signature = bucket->signature[i];
 464                         uint8_t *bucket_key = (uint8_t *) bucket->key[i];
 465
 466                         if (bucket_signature == 0) {
 467                                 uint8_t *bucket_data = &bucket->data[i *
 468                                         f->entry_size];
 469
 470                                 bucket->signature[i] = signature;
 471                                 memcpy(bucket_key, key, f->key_size);
 472                                 memcpy(bucket_data, entry, f->entry_size);
 473                                 *key_found = 0;
 474                                 *entry_ptr = (void *) bucket_data;
 475
 476                                 return 0;
 477                         }
 478                 }
 479
 480         /* Bucket full: extend bucket */
 481         if (f->stack_pos > 0) {
 482                 bucket_index = f->stack[--f->stack_pos];
 483
 484                 bucket = (struct rte_bucket_4_16 *) &f->memory[(f->n_buckets +
 485                         bucket_index) * f->bucket_size];
 486                 bucket_prev->next = bucket;
 487                 bucket_prev->next_valid = 1;
 488
 489                 bucket->signature[0] = signature;
 490                 memcpy(bucket->key[0], key, f->key_size);
 491                 memcpy(&bucket->data[0], entry, f->entry_size);
 492                 *key_found = 0;
 493                 *entry_ptr = (void *) &bucket->data[0];
 494                 return 0;
 495         }
 496
 497         return -ENOSPC;
 498 }
 499
 500 static int
 501 rte_table_hash_entry_delete_key16_ext(
 502         void *table,
 503         void *key,
 504         int *key_found,
 505         void *entry)
 506 {
 507         struct rte_table_hash *f = (struct rte_table_hash *) table;
 508         struct rte_bucket_4_16 *bucket0, *bucket, *bucket_prev;
 509         uint64_t signature;
 510         uint32_t bucket_index, i;
 511
 512         signature = f->f_hash(key, f->key_size, f->seed);
 513         bucket_index = signature & (f->n_buckets - 1);
 514         bucket0 = (struct rte_bucket_4_16 *)
 515                 &f->memory[bucket_index * f->bucket_size];
 516         signature |= RTE_BUCKET_ENTRY_VALID;
 517
 518         /* Key is present in the bucket */
 519         for (bucket_prev = NULL, bucket = bucket0; bucket != NULL;
 520                 bucket_prev = bucket, bucket = bucket->next)
 521                 for (i = 0; i < 4; i++) {
 522                         uint64_t bucket_signature = bucket->signature[i];
 523                         uint8_t *bucket_key = (uint8_t *) bucket->key[i];
 524
 525                         if ((bucket_signature == signature) &&
 526                                 (memcmp(key, bucket_key, f->key_size) == 0)) {
 527                                 uint8_t *bucket_data = &bucket->data[i *
 528                                         f->entry_size];
 529
 530                                 bucket->signature[i] = 0;
 531                                 *key_found = 1;
 532                                 if (entry)
 533                                         memcpy(entry, bucket_data,
 534                                         f->entry_size);
 535
 536                                 if ((bucket->signature[0] == 0) &&
 537                                         (bucket->signature[1] == 0) &&
 538                                         (bucket->signature[2] == 0) &&
 539                                         (bucket->signature[3] == 0) &&
 540                                         (bucket_prev != NULL)) {
 541                                         bucket_prev->next = bucket->next;
 542                                         bucket_prev->next_valid =
 543                                                 bucket->next_valid;
 544
 545                                         memset(bucket, 0,
 546                                                 sizeof(struct rte_bucket_4_16));
 547                                         bucket_index = (((uint8_t *)bucket -
 548                                                 (uint8_t *)f->memory)/f->bucket_size) - f->n_buckets;
 549                                         f->stack[f->stack_pos++] = bucket_index;
 550                                 }
 551
 552                                 return 0;
 553                         }
 554                 }
 555
 556         /* Key is not present in the bucket */
 557         *key_found = 0;
 558         return 0;
 559 }
 560
 561 #define lookup_key16_cmp(key_in, bucket, pos)                   \
 562 {                                                               \
 563         uint64_t xor[4][2], or[4], signature[4];                \
 564                                                                 \
 565         signature[0] = (~bucket->signature[0]) & 1;             \
 566         signature[1] = (~bucket->signature[1]) & 1;             \
 567         signature[2] = (~bucket->signature[2]) & 1;             \
 568         signature[3] = (~bucket->signature[3]) & 1;             \
 569                                                                 \
 570         xor[0][0] = key_in[0] ^  bucket->key[0][0];             \
 571         xor[0][1] = key_in[1] ^  bucket->key[0][1];             \
 572                                                                 \
 573         xor[1][0] = key_in[0] ^  bucket->key[1][0];             \
 574         xor[1][1] = key_in[1] ^  bucket->key[1][1];             \
 575                                                                 \
 576         xor[2][0] = key_in[0] ^  bucket->key[2][0];             \
 577         xor[2][1] = key_in[1] ^  bucket->key[2][1];             \
 578                                                                 \
 579         xor[3][0] = key_in[0] ^  bucket->key[3][0];             \
 580         xor[3][1] = key_in[1] ^  bucket->key[3][1];             \
 581                                                                 \
 582         or[0] = xor[0][0] | xor[0][1] | signature[0];           \
 583         or[1] = xor[1][0] | xor[1][1] | signature[1];           \
 584         or[2] = xor[2][0] | xor[2][1] | signature[2];           \
 585         or[3] = xor[3][0] | xor[3][1] | signature[3];           \
 586                                                                 \
 587         pos = 4;                                                \
 588         if (or[0] == 0)                                         \
 589                 pos = 0;                                        \
 590         if (or[1] == 0)                                         \
 591                 pos = 1;                                        \
 592         if (or[2] == 0)                                         \
 593                 pos = 2;                                        \
 594         if (or[3] == 0)                                         \
 595                 pos = 3;                                        \
 596 }
 597
 598 #define lookup1_stage0(pkt0_index, mbuf0, pkts, pkts_mask)      \
 599 {                                                               \
 600         uint64_t pkt_mask;                                      \
 601                                                                 \
 602         pkt0_index = __builtin_ctzll(pkts_mask);                \
 603         pkt_mask = 1LLU << pkt0_index;                          \
 604         pkts_mask &= ~pkt_mask;                                 \
 605                                                                 \
 606         mbuf0 = pkts[pkt0_index];                               \
 607         rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf0, 0));   \
 608 }
 609
 610 #define lookup1_stage1(mbuf1, bucket1, f)                       \
 611 {                                                               \
 612         uint64_t signature;                                     \
 613         uint32_t bucket_index;                                  \
 614                                                                 \
 615         signature = RTE_MBUF_METADATA_UINT32(mbuf1, f->signature_offset);\
 616         bucket_index = signature & (f->n_buckets - 1);          \
 617         bucket1 = (struct rte_bucket_4_16 *)                    \
 618                 &f->memory[bucket_index * f->bucket_size];      \
 619         rte_prefetch0(bucket1);                                 \
 620         rte_prefetch0((void *)(((uintptr_t) bucket1) + RTE_CACHE_LINE_SIZE));\
 621 }
 622
 623 #define lookup1_stage2_lru(pkt2_index, mbuf2, bucket2,          \
 624                 pkts_mask_out, entries, f)                      \
 625 {                                                               \
 626         void *a;                                                \
 627         uint64_t pkt_mask;                                      \
 628         uint64_t *key;                                          \
 629         uint64_t hash_key_buffer[2];            \
 630         uint32_t pos;                                           \
 631                                                                 \
 632         key = RTE_MBUF_METADATA_UINT64_PTR(mbuf2, f->key_offset);\
 633         hash_key_buffer[0] = key[0] & f->key_mask[0];   \
 634         hash_key_buffer[1] = key[1] & f->key_mask[1];   \
 635                                                                 \
 636         lookup_key16_cmp(hash_key_buffer, bucket2, pos);        \
 637                                                                 \
 638         pkt_mask = (bucket2->signature[pos] & 1LLU) << pkt2_index;\
 639         pkts_mask_out |= pkt_mask;                              \
 640                                                                 \
 641         a = (void *) &bucket2->data[pos * f->entry_size];       \
 642         rte_prefetch0(a);                                       \
 643         entries[pkt2_index] = a;                                \
 644         lru_update(bucket2, pos);                               \
 645 }
 646
 647 #define lookup1_stage2_ext(pkt2_index, mbuf2, bucket2, pkts_mask_out, entries, \
 648         buckets_mask, buckets, keys, f)                         \
 649 {                                                               \
 650         struct rte_bucket_4_16 *bucket_next;                    \
 651         void *a;                                                \
 652         uint64_t pkt_mask, bucket_mask;                         \
 653         uint64_t *key;                                          \
 654         uint64_t hash_key_buffer[2];            \
 655         uint32_t pos;                                           \
 656                                                                 \
 657         key = RTE_MBUF_METADATA_UINT64_PTR(mbuf2, f->key_offset);\
 658         hash_key_buffer[0] = key[0] & f->key_mask[0];   \
 659         hash_key_buffer[1] = key[1] & f->key_mask[1];   \
 660                                                                 \
 661         lookup_key16_cmp(hash_key_buffer, bucket2, pos);        \
 662                                                                 \
 663         pkt_mask = (bucket2->signature[pos] & 1LLU) << pkt2_index;\
 664         pkts_mask_out |= pkt_mask;                              \
 665                                                                 \
 666         a = (void *) &bucket2->data[pos * f->entry_size];       \
 667         rte_prefetch0(a);                                       \
 668         entries[pkt2_index] = a;                                \
 669                                                                 \
 670         bucket_mask = (~pkt_mask) & (bucket2->next_valid << pkt2_index);\
 671         buckets_mask |= bucket_mask;                            \
 672         bucket_next = bucket2->next;                            \
 673         buckets[pkt2_index] = bucket_next;                      \
 674         keys[pkt2_index] = key;                                 \
 675 }
 676
 677 #define lookup_grinder(pkt_index, buckets, keys, pkts_mask_out, entries,\
 678         buckets_mask, f)                                        \
 679 {                                                               \
 680         struct rte_bucket_4_16 *bucket, *bucket_next;           \
 681         void *a;                                                \
 682         uint64_t pkt_mask, bucket_mask;                         \
 683         uint64_t *key;                                          \
 684         uint64_t hash_key_buffer[2];            \
 685         uint32_t pos;                                           \
 686                                                                 \
 687         bucket = buckets[pkt_index];                            \
 688         key = keys[pkt_index];                                  \
 689         hash_key_buffer[0] = key[0] & f->key_mask[0];   \
 690         hash_key_buffer[1] = key[1] & f->key_mask[1];   \
 691                                                                 \
 692         lookup_key16_cmp(hash_key_buffer, bucket, pos); \
 693                                                                 \
 694         pkt_mask = (bucket->signature[pos] & 1LLU) << pkt_index;\
 695         pkts_mask_out |= pkt_mask;                              \
 696                                                                 \
 697         a = (void *) &bucket->data[pos * f->entry_size];        \
 698         rte_prefetch0(a);                                       \
 699         entries[pkt_index] = a;                                 \
 700                                                                 \
 701         bucket_mask = (~pkt_mask) & (bucket->next_valid << pkt_index);\
 702         buckets_mask |= bucket_mask;                            \
 703         bucket_next = bucket->next;                             \
 704         rte_prefetch0(bucket_next);                             \
 705         rte_prefetch0((void *)(((uintptr_t) bucket_next) + RTE_CACHE_LINE_SIZE));\
 706         buckets[pkt_index] = bucket_next;                       \
 707         keys[pkt_index] = key;                                  \
 708 }
 709
 710 #define lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01,\
 711                 pkts, pkts_mask)                                \
 712 {                                                               \
 713         uint64_t pkt00_mask, pkt01_mask;                        \
 714                                                                 \
 715         pkt00_index = __builtin_ctzll(pkts_mask);               \
 716         pkt00_mask = 1LLU << pkt00_index;                       \
 717         pkts_mask &= ~pkt00_mask;                               \
 718                                                                 \
 719         mbuf00 = pkts[pkt00_index];                             \
 720         rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf00, 0));  \
 721                                                                 \
 722         pkt01_index = __builtin_ctzll(pkts_mask);               \
 723         pkt01_mask = 1LLU << pkt01_index;                       \
 724         pkts_mask &= ~pkt01_mask;                               \
 725                                                                 \
 726         mbuf01 = pkts[pkt01_index];                             \
 727         rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf01, 0));  \
 728 }
 729
 730 #define lookup2_stage0_with_odd_support(pkt00_index, pkt01_index,\
 731                 mbuf00, mbuf01, pkts, pkts_mask)                \
 732 {                                                               \
 733         uint64_t pkt00_mask, pkt01_mask;                        \
 734                                                                 \
 735         pkt00_index = __builtin_ctzll(pkts_mask);               \
 736         pkt00_mask = 1LLU << pkt00_index;                       \
 737         pkts_mask &= ~pkt00_mask;                               \
 738                                                                 \
 739         mbuf00 = pkts[pkt00_index];                             \
 740         rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf00, 0));  \
 741                                                                 \
 742         pkt01_index = __builtin_ctzll(pkts_mask);               \
 743         if (pkts_mask == 0)                                     \
 744                 pkt01_index = pkt00_index;                      \
 745         pkt01_mask = 1LLU << pkt01_index;                       \
 746         pkts_mask &= ~pkt01_mask;                               \
 747                                                                 \
 748         mbuf01 = pkts[pkt01_index];                             \
 749         rte_prefetch0(RTE_MBUF_METADATA_UINT8_PTR(mbuf01, 0));  \
 750 }
 751
 752 #define lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f)   \
 753 {                                                               \
 754         uint64_t signature10, signature11;                      \
 755         uint32_t bucket10_index, bucket11_index;                \
 756                                                                 \
 757         signature10 = RTE_MBUF_METADATA_UINT32(mbuf10, f->signature_offset);\
 758         bucket10_index = signature10 & (f->n_buckets - 1);      \
 759         bucket10 = (struct rte_bucket_4_16 *)                   \
 760                 &f->memory[bucket10_index * f->bucket_size];    \
 761         rte_prefetch0(bucket10);                                \
 762         rte_prefetch0((void *)(((uintptr_t) bucket10) + RTE_CACHE_LINE_SIZE));\
 763                                                                 \
 764         signature11 = RTE_MBUF_METADATA_UINT32(mbuf11, f->signature_offset);\
 765         bucket11_index = signature11 & (f->n_buckets - 1);      \
 766         bucket11 = (struct rte_bucket_4_16 *)                   \
 767                 &f->memory[bucket11_index * f->bucket_size];    \
 768         rte_prefetch0(bucket11);                                \
 769         rte_prefetch0((void *)(((uintptr_t) bucket11) + RTE_CACHE_LINE_SIZE));\
 770 }
 771
 772 #define lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,\
 773                 bucket20, bucket21, pkts_mask_out, entries, f)  \
 774 {                                                               \
 775         void *a20, *a21;                                        \
 776         uint64_t pkt20_mask, pkt21_mask;                        \
 777         uint64_t *key20, *key21;                                \
 778         uint64_t hash_key_buffer20[2];                  \
 779         uint64_t hash_key_buffer21[2];                  \
 780         uint32_t pos20, pos21;                                  \
 781                                                                 \
 782         key20 = RTE_MBUF_METADATA_UINT64_PTR(mbuf20, f->key_offset);\
 783         key21 = RTE_MBUF_METADATA_UINT64_PTR(mbuf21, f->key_offset);\
 784         hash_key_buffer20[0] = key20[0] & f->key_mask[0];       \
 785         hash_key_buffer20[1] = key20[1] & f->key_mask[1];       \
 786         hash_key_buffer21[0] = key21[0] & f->key_mask[0];       \
 787         hash_key_buffer21[1] = key21[1] & f->key_mask[1];       \
 788                                                                 \
 789         lookup_key16_cmp(hash_key_buffer20, bucket20, pos20);   \
 790         lookup_key16_cmp(hash_key_buffer21, bucket21, pos21);   \
 791                                                                 \
 792         pkt20_mask = (bucket20->signature[pos20] & 1LLU) << pkt20_index;\
 793         pkt21_mask = (bucket21->signature[pos21] & 1LLU) << pkt21_index;\
 794         pkts_mask_out |= pkt20_mask | pkt21_mask;                       \
 795                                                                 \
 796         a20 = (void *) &bucket20->data[pos20 * f->entry_size];  \
 797         a21 = (void *) &bucket21->data[pos21 * f->entry_size];  \
 798         rte_prefetch0(a20);                                     \
 799         rte_prefetch0(a21);                                     \
 800         entries[pkt20_index] = a20;                             \
 801         entries[pkt21_index] = a21;                             \
 802         lru_update(bucket20, pos20);                            \
 803         lru_update(bucket21, pos21);                            \
 804 }
 805
 806 #define lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21, bucket20, \
 807         bucket21, pkts_mask_out, entries, buckets_mask, buckets, keys, f) \
 808 {                                                               \
 809         struct rte_bucket_4_16 *bucket20_next, *bucket21_next;  \
 810         void *a20, *a21;                                        \
 811         uint64_t pkt20_mask, pkt21_mask, bucket20_mask, bucket21_mask;\
 812         uint64_t *key20, *key21;                                \
 813         uint64_t hash_key_buffer20[2];                  \
 814         uint64_t hash_key_buffer21[2];                  \
 815         uint32_t pos20, pos21;                                  \
 816                                                                 \
 817         key20 = RTE_MBUF_METADATA_UINT64_PTR(mbuf20, f->key_offset);\
 818         key21 = RTE_MBUF_METADATA_UINT64_PTR(mbuf21, f->key_offset);\
 819         hash_key_buffer20[0] = key20[0] & f->key_mask[0];       \
 820         hash_key_buffer20[1] = key20[1] & f->key_mask[1];       \
 821         hash_key_buffer21[0] = key21[0] & f->key_mask[0];       \
 822         hash_key_buffer21[1] = key21[1] & f->key_mask[1];       \
 823                                                                 \
 824         lookup_key16_cmp(hash_key_buffer20, bucket20, pos20);   \
 825         lookup_key16_cmp(hash_key_buffer21, bucket21, pos21);   \
 826                                                                 \
 827         pkt20_mask = (bucket20->signature[pos20] & 1LLU) << pkt20_index;\
 828         pkt21_mask = (bucket21->signature[pos21] & 1LLU) << pkt21_index;\
 829         pkts_mask_out |= pkt20_mask | pkt21_mask;               \
 830                                                                 \
 831         a20 = (void *) &bucket20->data[pos20 * f->entry_size];  \
 832         a21 = (void *) &bucket21->data[pos21 * f->entry_size];  \
 833         rte_prefetch0(a20);                                     \
 834         rte_prefetch0(a21);                                     \
 835         entries[pkt20_index] = a20;                             \
 836         entries[pkt21_index] = a21;                             \
 837                                                                 \
 838         bucket20_mask = (~pkt20_mask) & (bucket20->next_valid << pkt20_index);\
 839         bucket21_mask = (~pkt21_mask) & (bucket21->next_valid << pkt21_index);\
 840         buckets_mask |= bucket20_mask | bucket21_mask;          \
 841         bucket20_next = bucket20->next;                         \
 842         bucket21_next = bucket21->next;                         \
 843         buckets[pkt20_index] = bucket20_next;                   \
 844         buckets[pkt21_index] = bucket21_next;                   \
 845         keys[pkt20_index] = key20;                              \
 846         keys[pkt21_index] = key21;                              \
 847 }
 848
 849 static int
 850 rte_table_hash_lookup_key16_lru(
 851         void *table,
 852         struct rte_mbuf **pkts,
 853         uint64_t pkts_mask,
 854         uint64_t *lookup_hit_mask,
 855         void **entries)
 856 {
 857         struct rte_table_hash *f = (struct rte_table_hash *) table;
 858         struct rte_bucket_4_16 *bucket10, *bucket11, *bucket20, *bucket21;
 859         struct rte_mbuf *mbuf00, *mbuf01, *mbuf10, *mbuf11, *mbuf20, *mbuf21;
 860         uint32_t pkt00_index, pkt01_index, pkt10_index;
 861         uint32_t pkt11_index, pkt20_index, pkt21_index;
 862         uint64_t pkts_mask_out = 0;
 863
 864         __rte_unused uint32_t n_pkts_in = __builtin_popcountll(pkts_mask);
 865         RTE_TABLE_HASH_KEY16_STATS_PKTS_IN_ADD(f, n_pkts_in);
 866
 867         /* Cannot run the pipeline with less than 5 packets */
 868         if (__builtin_popcountll(pkts_mask) < 5) {
 869                 for ( ; pkts_mask; ) {
 870                         struct rte_bucket_4_16 *bucket;
 871                         struct rte_mbuf *mbuf;
 872                         uint32_t pkt_index;
 873
 874                         lookup1_stage0(pkt_index, mbuf, pkts, pkts_mask);
 875                         lookup1_stage1(mbuf, bucket, f);
 876                         lookup1_stage2_lru(pkt_index, mbuf, bucket,
 877                                 pkts_mask_out, entries, f);
 878                 }
 879
 880                 *lookup_hit_mask = pkts_mask_out;
 881                 RTE_TABLE_HASH_KEY16_STATS_PKTS_LOOKUP_MISS(f, n_pkts_in - __builtin_popcountll(pkts_mask_out));
 882                 return 0;
 883         }
 884
 885         /*
 886          * Pipeline fill
 887          *
 888          */
 889         /* Pipeline stage 0 */
 890         lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
 891                 pkts_mask);
 892
 893         /* Pipeline feed */
 894         mbuf10 = mbuf00;
 895         mbuf11 = mbuf01;
 896         pkt10_index = pkt00_index;
 897         pkt11_index = pkt01_index;
 898
 899         /* Pipeline stage 0 */
 900         lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
 901                 pkts_mask);
 902
 903         /* Pipeline stage 1 */
 904         lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
 905
 906         /*
 907          * Pipeline run
 908          *
 909          */
 910         for ( ; pkts_mask; ) {
 911                 /* Pipeline feed */
 912                 bucket20 = bucket10;
 913                 bucket21 = bucket11;
 914                 mbuf20 = mbuf10;
 915                 mbuf21 = mbuf11;
 916                 mbuf10 = mbuf00;
 917                 mbuf11 = mbuf01;
 918                 pkt20_index = pkt10_index;
 919                 pkt21_index = pkt11_index;
 920                 pkt10_index = pkt00_index;
 921                 pkt11_index = pkt01_index;
 922
 923                 /* Pipeline stage 0 */
 924                 lookup2_stage0_with_odd_support(pkt00_index, pkt01_index,
 925                         mbuf00, mbuf01, pkts, pkts_mask);
 926
 927                 /* Pipeline stage 1 */
 928                 lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
 929
 930                 /* Pipeline stage 2 */
 931                 lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
 932                         bucket20, bucket21, pkts_mask_out, entries, f);
 933         }
 934
 935         /*
 936          * Pipeline flush
 937          *
 938          */
 939         /* Pipeline feed */
 940         bucket20 = bucket10;
 941         bucket21 = bucket11;
 942         mbuf20 = mbuf10;
 943         mbuf21 = mbuf11;
 944         mbuf10 = mbuf00;
 945         mbuf11 = mbuf01;
 946         pkt20_index = pkt10_index;
 947         pkt21_index = pkt11_index;
 948         pkt10_index = pkt00_index;
 949         pkt11_index = pkt01_index;
 950
 951         /* Pipeline stage 1 */
 952         lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
 953
 954         /* Pipeline stage 2 */
 955         lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
 956                 bucket20, bucket21, pkts_mask_out, entries, f);
 957
 958         /* Pipeline feed */
 959         bucket20 = bucket10;
 960         bucket21 = bucket11;
 961         mbuf20 = mbuf10;
 962         mbuf21 = mbuf11;
 963         pkt20_index = pkt10_index;
 964         pkt21_index = pkt11_index;
 965
 966         /* Pipeline stage 2 */
 967         lookup2_stage2_lru(pkt20_index, pkt21_index, mbuf20, mbuf21,
 968                 bucket20, bucket21, pkts_mask_out, entries, f);
 969
 970         *lookup_hit_mask = pkts_mask_out;
 971         RTE_TABLE_HASH_KEY16_STATS_PKTS_LOOKUP_MISS(f, n_pkts_in - __builtin_popcountll(pkts_mask_out));
 972         return 0;
 973 } /* rte_table_hash_lookup_key16_lru() */
 974
 975 static int
 976 rte_table_hash_lookup_key16_ext(
 977         void *table,
 978         struct rte_mbuf **pkts,
 979         uint64_t pkts_mask,
 980         uint64_t *lookup_hit_mask,
 981         void **entries)
 982 {
 983         struct rte_table_hash *f = (struct rte_table_hash *) table;
 984         struct rte_bucket_4_16 *bucket10, *bucket11, *bucket20, *bucket21;
 985         struct rte_mbuf *mbuf00, *mbuf01, *mbuf10, *mbuf11, *mbuf20, *mbuf21;
 986         uint32_t pkt00_index, pkt01_index, pkt10_index;
 987         uint32_t pkt11_index, pkt20_index, pkt21_index;
 988         uint64_t pkts_mask_out = 0, buckets_mask = 0;
 989         struct rte_bucket_4_16 *buckets[RTE_PORT_IN_BURST_SIZE_MAX];
 990         uint64_t *keys[RTE_PORT_IN_BURST_SIZE_MAX];
 991
 992         __rte_unused uint32_t n_pkts_in = __builtin_popcountll(pkts_mask);
 993         RTE_TABLE_HASH_KEY16_STATS_PKTS_IN_ADD(f, n_pkts_in);
 994
 995         /* Cannot run the pipeline with less than 5 packets */
 996         if (__builtin_popcountll(pkts_mask) < 5) {
 997                 for ( ; pkts_mask; ) {
 998                         struct rte_bucket_4_16 *bucket;
 999                         struct rte_mbuf *mbuf;
1000                         uint32_t pkt_index;
1001
1002                         lookup1_stage0(pkt_index, mbuf, pkts, pkts_mask);
1003                         lookup1_stage1(mbuf, bucket, f);
1004                         lookup1_stage2_ext(pkt_index, mbuf, bucket,
1005                                 pkts_mask_out, entries, buckets_mask,
1006                                 buckets, keys, f);
1007                 }
1008
1009                 goto grind_next_buckets;
1010         }
1011
1012         /*
1013          * Pipeline fill
1014          *
1015          */
1016         /* Pipeline stage 0 */
1017         lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
1018                 pkts_mask);
1019
1020         /* Pipeline feed */
1021         mbuf10 = mbuf00;
1022         mbuf11 = mbuf01;
1023         pkt10_index = pkt00_index;
1024         pkt11_index = pkt01_index;
1025
1026         /* Pipeline stage 0 */
1027         lookup2_stage0(pkt00_index, pkt01_index, mbuf00, mbuf01, pkts,
1028                 pkts_mask);
1029
1030         /* Pipeline stage 1 */
1031         lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
1032
1033         /*
1034          * Pipeline run
1035          *
1036          */
1037         for ( ; pkts_mask; ) {
1038                 /* Pipeline feed */
1039                 bucket20 = bucket10;
1040                 bucket21 = bucket11;
1041                 mbuf20 = mbuf10;
1042                 mbuf21 = mbuf11;
1043                 mbuf10 = mbuf00;
1044                 mbuf11 = mbuf01;
1045                 pkt20_index = pkt10_index;
1046                 pkt21_index = pkt11_index;
1047                 pkt10_index = pkt00_index;
1048                 pkt11_index = pkt01_index;
1049
1050                 /* Pipeline stage 0 */
1051                 lookup2_stage0_with_odd_support(pkt00_index, pkt01_index,
1052                         mbuf00, mbuf01, pkts, pkts_mask);
1053
1054                 /* Pipeline stage 1 */
1055                 lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
1056
1057                 /* Pipeline stage 2 */
1058                 lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1059                         bucket20, bucket21, pkts_mask_out, entries,
1060                         buckets_mask, buckets, keys, f);
1061         }
1062
1063         /*
1064          * Pipeline flush
1065          *
1066          */
1067         /* Pipeline feed */
1068         bucket20 = bucket10;
1069         bucket21 = bucket11;
1070         mbuf20 = mbuf10;
1071         mbuf21 = mbuf11;
1072         mbuf10 = mbuf00;
1073         mbuf11 = mbuf01;
1074         pkt20_index = pkt10_index;
1075         pkt21_index = pkt11_index;
1076         pkt10_index = pkt00_index;
1077         pkt11_index = pkt01_index;
1078
1079         /* Pipeline stage 1 */
1080         lookup2_stage1(mbuf10, mbuf11, bucket10, bucket11, f);
1081
1082         /* Pipeline stage 2 */
1083         lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1084                 bucket20, bucket21, pkts_mask_out, entries,
1085                 buckets_mask, buckets, keys, f);
1086
1087         /* Pipeline feed */
1088         bucket20 = bucket10;
1089         bucket21 = bucket11;
1090         mbuf20 = mbuf10;
1091         mbuf21 = mbuf11;
1092         pkt20_index = pkt10_index;
1093         pkt21_index = pkt11_index;
1094
1095         /* Pipeline stage 2 */
1096         lookup2_stage2_ext(pkt20_index, pkt21_index, mbuf20, mbuf21,
1097                 bucket20, bucket21, pkts_mask_out, entries,
1098                 buckets_mask, buckets, keys, f);
1099
1100 grind_next_buckets:
1101         /* Grind next buckets */
1102         for ( ; buckets_mask; ) {
1103                 uint64_t buckets_mask_next = 0;
1104
1105                 for ( ; buckets_mask; ) {
1106                         uint64_t pkt_mask;
1107                         uint32_t pkt_index;
1108
1109                         pkt_index = __builtin_ctzll(buckets_mask);
1110                         pkt_mask = 1LLU << pkt_index;
1111                         buckets_mask &= ~pkt_mask;
1112
1113                         lookup_grinder(pkt_index, buckets, keys, pkts_mask_out,
1114                                 entries, buckets_mask_next, f);
1115                 }
1116
1117                 buckets_mask = buckets_mask_next;
1118         }
1119
1120         *lookup_hit_mask = pkts_mask_out;
1121         RTE_TABLE_HASH_KEY16_STATS_PKTS_LOOKUP_MISS(f, n_pkts_in - __builtin_popcountll(pkts_mask_out));
1122         return 0;
1123 } /* rte_table_hash_lookup_key16_ext() */
1124
1125 static int
1126 rte_table_hash_key16_stats_read(void *table, struct rte_table_stats *stats, int clear)
1127 {
1128         struct rte_table_hash *t = (struct rte_table_hash *) table;
1129
1130         if (stats != NULL)
1131                 memcpy(stats, &t->stats, sizeof(t->stats));
1132
1133         if (clear)
1134                 memset(&t->stats, 0, sizeof(t->stats));
1135
1136         return 0;
1137 }
1138
1139 struct rte_table_ops rte_table_hash_key16_lru_ops = {
1140         .f_create = rte_table_hash_create_key16_lru,
1141         .f_free = rte_table_hash_free_key16_lru,
1142         .f_add = rte_table_hash_entry_add_key16_lru,
1143         .f_delete = rte_table_hash_entry_delete_key16_lru,
1144         .f_add_bulk = NULL,
1145         .f_delete_bulk = NULL,
1146         .f_lookup = rte_table_hash_lookup_key16_lru,
1147         .f_stats = rte_table_hash_key16_stats_read,
1148 };
1149
1150 struct rte_table_ops rte_table_hash_key16_ext_ops = {
1151         .f_create = rte_table_hash_create_key16_ext,
1152         .f_free = rte_table_hash_free_key16_ext,
1153         .f_add = rte_table_hash_entry_add_key16_ext,
1154         .f_delete = rte_table_hash_entry_delete_key16_ext,
1155         .f_add_bulk = NULL,
1156         .f_delete_bulk = NULL,
1157         .f_lookup = rte_table_hash_lookup_key16_ext,
1158         .f_stats = rte_table_hash_key16_stats_read,
1159 };