1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright 2019 Mellanox Technologies, Ltd
5 #ifndef RTE_PMD_MLX5_COMMON_UTILS_H_
6 #define RTE_PMD_MLX5_COMMON_UTILS_H_
8 #include "mlx5_common.h"
10 /************************ mlx5 list *****************************/
12 /** Maximum size of string for naming. */
13 #define MLX5_NAME_SIZE 32
18 * Structure of the entry in the mlx5 list, user should define its own struct
19 * that contains this in order to store the data.
21 struct mlx5_list_entry {
22 LIST_ENTRY(mlx5_list_entry) next; /* Entry pointers in the list. */
23 uint32_t ref_cnt __rte_aligned(8); /* 0 means, entry is invalid. */
26 struct mlx5_list_entry *gentry;
31 struct mlx5_list_cache {
32 LIST_HEAD(mlx5_list_head, mlx5_list_entry) h;
33 uint32_t inv_cnt; /* Invalid entries counter. */
34 } __rte_cache_aligned;
37 * Type of callback function for entry removal.
40 * The tool instance user context.
42 * The entry in the list.
44 typedef void (*mlx5_list_remove_cb)(void *tool_ctx,
45 struct mlx5_list_entry *entry);
48 * Type of function for user defined matching.
51 * The tool instance context.
53 * The entry in the list.
55 * The pointer to new entry context.
58 * 0 if matching, non-zero number otherwise.
60 typedef int (*mlx5_list_match_cb)(void *tool_ctx,
61 struct mlx5_list_entry *entry, void *ctx);
63 typedef struct mlx5_list_entry *(*mlx5_list_clone_cb)(void *tool_ctx,
64 struct mlx5_list_entry *entry, void *ctx);
66 typedef void (*mlx5_list_clone_free_cb)(void *tool_ctx,
67 struct mlx5_list_entry *entry);
70 * Type of function for user defined mlx5 list entry creation.
73 * The mlx5 tool instance context.
75 * The pointer to new entry context.
78 * Pointer of entry on success, NULL otherwise.
80 typedef struct mlx5_list_entry *(*mlx5_list_create_cb)(void *tool_ctx,
84 * Linked mlx5 list constant object.
86 struct mlx5_list_const {
87 char name[MLX5_NAME_SIZE]; /**< Name of the mlx5 list. */
88 void *ctx; /* user objects target to callback. */
89 bool lcores_share; /* Whether to share objects between the lcores. */
90 mlx5_list_create_cb cb_create; /**< entry create callback. */
91 mlx5_list_match_cb cb_match; /**< entry match callback. */
92 mlx5_list_remove_cb cb_remove; /**< entry remove callback. */
93 mlx5_list_clone_cb cb_clone; /**< entry clone callback. */
94 mlx5_list_clone_free_cb cb_clone_free;
95 /**< entry clone free callback. */
99 * Linked mlx5 list inconstant data.
101 struct mlx5_list_inconst {
102 rte_rwlock_t lock; /* read/write lock. */
103 volatile uint32_t gen_cnt; /* List modification may update it. */
104 volatile uint32_t count; /* number of entries in list. */
105 struct mlx5_list_cache *cache[RTE_MAX_LCORE + 1];
106 /* Lcore cache, last index is the global cache. */
110 * Linked mlx5 list structure.
112 * Entry in mlx5 list could be reused if entry already exists,
113 * reference count will increase and the existing entry returns.
115 * When destroy an entry from list, decrease reference count and only
116 * destroy when no further reference.
118 * Linked list is designed for limited number of entries,
119 * read mostly, less modification.
121 * For huge amount of entries, please consider hash list.
125 struct mlx5_list_const l_const;
126 struct mlx5_list_inconst l_inconst;
130 * Create a mlx5 list.
132 * For actions in SW-steering is only memory and can be allowed
133 * to create duplicate objects, the lists don't need to check if
134 * there are existing same objects in other sub local lists,
135 * search the object only in local list will be more efficient.
138 * Pointer to the hast list table.
140 * Name of the mlx5 list.
142 * Pointer to the list context data.
143 * @param lcores_share
144 * Whether to share objects between the lcores.
146 * Callback function for entry create.
148 * Callback function for entry match.
150 * Callback function for entry remove.
152 * List pointer on success, otherwise NULL.
155 struct mlx5_list *mlx5_list_create(const char *name, void *ctx,
157 mlx5_list_create_cb cb_create,
158 mlx5_list_match_cb cb_match,
159 mlx5_list_remove_cb cb_remove,
160 mlx5_list_clone_cb cb_clone,
161 mlx5_list_clone_free_cb cb_clone_free);
164 * Search an entry matching the key.
166 * Result returned might be destroyed by other thread, must use
167 * this function only in main thread.
170 * Pointer to the mlx5 list.
172 * Common context parameter used by entry callback function.
175 * Pointer of the list entry if found, NULL otherwise.
178 struct mlx5_list_entry *mlx5_list_lookup(struct mlx5_list *list,
182 * Reuse or create an entry to the mlx5 list.
185 * Pointer to the hast list table.
187 * Common context parameter used by callback function.
190 * registered entry on success, NULL otherwise
193 struct mlx5_list_entry *mlx5_list_register(struct mlx5_list *list,
197 * Remove an entry from the mlx5 list.
199 * User should guarantee the validity of the entry.
202 * Pointer to the hast list.
204 * Entry to be removed from the mlx5 list table.
206 * 0 on entry removed, 1 on entry still referenced.
209 int mlx5_list_unregister(struct mlx5_list *list,
210 struct mlx5_list_entry *entry);
213 * Destroy the mlx5 list.
216 * Pointer to the mlx5 list.
219 void mlx5_list_destroy(struct mlx5_list *list);
222 * Get entry number from the mlx5 list.
225 * Pointer to the hast list.
227 * mlx5 list entry number.
231 mlx5_list_get_entry_num(struct mlx5_list *list);
233 /********************* Hash List **********************/
235 /* Hash list bucket. */
236 struct mlx5_hlist_bucket {
237 struct mlx5_list_inconst l;
238 } __rte_cache_aligned;
241 * Hash list table structure
243 * The hash list bucket using the mlx5_list object for managing.
246 uint32_t mask; /* A mask for the bucket index range. */
248 bool direct_key; /* Whether to use the key directly as hash index. */
249 struct mlx5_list_const l_const; /* List constant data. */
250 struct mlx5_hlist_bucket buckets[] __rte_cache_aligned;
254 * Create a hash list table, the user can specify the list heads array size
255 * of the table, now the size should be a power of 2 in order to get better
256 * distribution for the entries. Each entry is a part of the whole data element
257 * and the caller should be responsible for the data element's allocation and
258 * cleanup / free. Key of each entry will be calculated with CRC in order to
259 * generate a little fairer distribution.
262 * Name of the hash list(optional).
264 * Heads array size of the hash list.
266 * Entry size to allocate if cb_create not specified.
268 * Whether to use the key directly as hash index.
269 * @param lcores_share
270 * Whether to share objects between the lcores.
272 * The hlist instance context.
274 * Callback function for entry create.
276 * Callback function for entry match.
278 * Callback function for entry remove.
280 * Callback function for entry clone.
281 * @param cb_clone_free
282 * Callback function for entry clone free.
284 * Pointer of the hash list table created, NULL on failure.
287 struct mlx5_hlist *mlx5_hlist_create(const char *name, uint32_t size,
288 bool direct_key, bool lcores_share,
289 void *ctx, mlx5_list_create_cb cb_create,
290 mlx5_list_match_cb cb_match,
291 mlx5_list_remove_cb cb_remove,
292 mlx5_list_clone_cb cb_clone,
293 mlx5_list_clone_free_cb cb_clone_free);
296 * Search an entry matching the key.
298 * Result returned might be destroyed by other thread, must use
299 * this function only in main thread.
302 * Pointer to the hast list table.
304 * Key for the searching entry.
306 * Common context parameter used by entry callback function.
309 * Pointer of the hlist entry if found, NULL otherwise.
312 struct mlx5_list_entry *mlx5_hlist_lookup(struct mlx5_hlist *h, uint64_t key,
316 * Insert an entry to the hash list table, the entry is only part of whole data
317 * element and a 64B key is used for matching. User should construct the key or
318 * give a calculated hash signature and guarantee there is no collision.
321 * Pointer to the hast list table.
323 * Entry to be inserted into the hash list table.
325 * Common context parameter used by callback function.
328 * registered entry on success, NULL otherwise
331 struct mlx5_list_entry *mlx5_hlist_register(struct mlx5_hlist *h, uint64_t key,
335 * Remove an entry from the hash list table. User should guarantee the validity
339 * Pointer to the hast list table. (not used)
341 * Entry to be removed from the hash list table.
343 * 0 on entry removed, 1 on entry still referenced.
346 int mlx5_hlist_unregister(struct mlx5_hlist *h, struct mlx5_list_entry *entry);
349 * Destroy the hash list table, all the entries already inserted into the lists
350 * will be handled by the callback function provided by the user (including
351 * free if needed) before the table is freed.
354 * Pointer to the hast list table.
357 void mlx5_hlist_destroy(struct mlx5_hlist *h);
359 #endif /* RTE_PMD_MLX5_COMMON_UTILS_H_ */