4 * Copyright(c) 2010-2013 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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
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.
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.
40 #include <sys/queue.h>
41 #include <rte_memory.h>
42 #include <rte_memzone.h>
43 #include <rte_tailq.h>
45 #include <rte_eal_memconfig.h>
46 #include <rte_malloc.h>
47 #include <rte_common.h>
48 #include <rte_per_lcore.h>
49 #include <rte_errno.h>
50 #include <rte_string_fns.h>
51 #include <rte_cpuflags.h>
53 #include <rte_spinlock.h>
55 #include "rte_fbk_hash.h"
57 TAILQ_HEAD(rte_fbk_hash_list, rte_fbk_hash_table);
60 * Performs a lookup for an existing hash table, and returns a pointer to
64 * Name of the hash table to find
67 * pointer to hash table structure or NULL on error.
69 struct rte_fbk_hash_table *
70 rte_fbk_hash_find_existing(const char *name)
72 struct rte_fbk_hash_table *h;
73 struct rte_fbk_hash_list *fbk_hash_list;
75 /* check that we have an initialised tail queue */
77 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_FBK_HASH, rte_fbk_hash_list)) == NULL) {
78 rte_errno = E_RTE_NO_TAILQ;
82 rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
83 TAILQ_FOREACH(h, fbk_hash_list, next) {
84 if (strncmp(name, h->name, RTE_FBK_HASH_NAMESIZE) == 0)
87 rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
94 * Create a new hash table for use with four byte keys.
97 * Parameters used in creation of hash table.
100 * Pointer to hash table structure that is used in future hash table
101 * operations, or NULL on error.
103 struct rte_fbk_hash_table *
104 rte_fbk_hash_create(const struct rte_fbk_hash_params *params)
106 struct rte_fbk_hash_table *ht = NULL;
107 char hash_name[RTE_FBK_HASH_NAMESIZE];
108 const uint32_t mem_size =
109 sizeof(*ht) + (sizeof(ht->t[0]) * params->entries);
111 struct rte_fbk_hash_list *fbk_hash_list;
113 /* check that we have an initialised tail queue */
115 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_FBK_HASH, rte_fbk_hash_list)) == NULL) {
116 rte_errno = E_RTE_NO_TAILQ;
120 /* Error checking of parameters. */
121 if ((!rte_is_power_of_2(params->entries)) ||
122 (!rte_is_power_of_2(params->entries_per_bucket)) ||
123 (params->entries == 0) ||
124 (params->entries_per_bucket == 0) ||
125 (params->entries_per_bucket > params->entries) ||
126 (params->entries > RTE_FBK_HASH_ENTRIES_MAX) ||
127 (params->entries_per_bucket > RTE_FBK_HASH_ENTRIES_PER_BUCKET_MAX)){
132 rte_snprintf(hash_name, sizeof(hash_name), "FBK_%s", params->name);
134 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
136 /* guarantee there's no existing */
137 TAILQ_FOREACH(ht, fbk_hash_list, next) {
138 if (strncmp(params->name, ht->name, RTE_FBK_HASH_NAMESIZE) == 0)
144 /* Allocate memory for table. */
145 ht = (struct rte_fbk_hash_table *)rte_malloc_socket(hash_name, mem_size,
146 0, params->socket_id);
150 memset(ht, 0, mem_size);
152 /* Set up hash table context. */
153 rte_snprintf(ht->name, sizeof(ht->name), "%s", params->name);
154 ht->entries = params->entries;
155 ht->entries_per_bucket = params->entries_per_bucket;
156 ht->used_entries = 0;
157 ht->bucket_mask = (params->entries / params->entries_per_bucket) - 1;
158 for (ht->bucket_shift = 0, i = 1;
159 (params->entries_per_bucket & i) == 0;
160 ht->bucket_shift++, i <<= 1)
161 ; /* empty loop body */
163 if (params->hash_func != NULL) {
164 ht->hash_func = params->hash_func;
165 ht->init_val = params->init_val;
168 ht->hash_func = RTE_FBK_HASH_FUNC_DEFAULT;
169 ht->init_val = RTE_FBK_HASH_INIT_VAL_DEFAULT;
172 TAILQ_INSERT_TAIL(fbk_hash_list, ht, next);
175 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
181 * Free all memory used by a hash table.
184 * Hash table to deallocate.
187 rte_fbk_hash_free(struct rte_fbk_hash_table *ht)
192 RTE_EAL_TAILQ_REMOVE(RTE_TAILQ_FBK_HASH, rte_fbk_hash_list, ht);