1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright 2018 6WIND S.A.
3 * Copyright 2018 Mellanox Technologies, Ltd
6 #ifndef RTE_PMD_MLX5_COMMON_MR_H_
7 #define RTE_PMD_MLX5_COMMON_MR_H_
11 #include <sys/queue.h>
14 #include <rte_rwlock.h>
15 #include <rte_bitmap.h>
17 #include <rte_memory.h>
19 #include "mlx5_glue.h"
20 #include "mlx5_common_mp.h"
21 #include "mlx5_common_defs.h"
23 /* mlx5 PMD MR struct. */
28 void *obj; /* verbs mr object or devx umem object. */
29 struct mlx5_devx_obj *mkey; /* devx mkey object. */
33 * mr operations typedef
35 typedef int (*mlx5_reg_mr_t)(void *pd, void *addr, size_t length,
36 struct mlx5_pmd_mr *pmd_mr);
37 typedef void (*mlx5_dereg_mr_t)(struct mlx5_pmd_mr *pmd_mr);
39 /* Memory Region object. */
41 LIST_ENTRY(mlx5_mr) mr; /**< Pointer to the prev/next entry. */
42 struct mlx5_pmd_mr pmd_mr; /* PMD memory region. */
43 const struct rte_memseg_list *msl;
44 int ms_base_idx; /* Start index of msl->memseg_arr[]. */
45 int ms_n; /* Number of memsegs in use. */
46 uint32_t ms_bmp_n; /* Number of bits in memsegs bit-mask. */
47 struct rte_bitmap *ms_bmp; /* Bit-mask of memsegs belonged to MR. */
50 /* Cache entry for Memory Region. */
51 struct mr_cache_entry {
52 uintptr_t start; /* Start address of MR. */
53 uintptr_t end; /* End address of MR. */
54 uint32_t lkey; /* rte_cpu_to_be_32(lkey). */
57 /* MR Cache table for Binary search. */
58 struct mlx5_mr_btree {
59 uint16_t len; /* Number of entries. */
60 uint16_t size; /* Total number of entries. */
61 int overflow; /* Mark failure of table expansion. */
62 struct mr_cache_entry (*table)[];
65 struct mlx5_common_device;
67 /* Per-queue MR control descriptor. */
69 uint32_t *dev_gen_ptr; /* Generation number of device to poll. */
70 uint32_t cur_gen; /* Generation number saved to flush caches. */
71 uint16_t mru; /* Index of last hit entry in top-half cache. */
72 uint16_t head; /* Index of the oldest entry in top-half cache. */
73 struct mr_cache_entry cache[MLX5_MR_CACHE_N]; /* Cache for top-half. */
74 struct mlx5_mr_btree cache_bh; /* Cache for bottom-half. */
77 LIST_HEAD(mlx5_mr_list, mlx5_mr);
78 LIST_HEAD(mlx5_mempool_reg_list, mlx5_mempool_reg);
80 /* Global per-device MR cache. */
81 struct mlx5_mr_share_cache {
82 uint32_t dev_gen; /* Generation number to flush local caches. */
83 rte_rwlock_t rwlock; /* MR cache Lock. */
84 rte_rwlock_t mprwlock; /* Mempool Registration Lock. */
85 uint8_t mp_cb_registered; /* Mempool are Registered. */
86 struct mlx5_mr_btree cache; /* Global MR cache table. */
87 struct mlx5_mr_list mr_list; /* Registered MR list. */
88 struct mlx5_mr_list mr_free_list; /* Freed MR list. */
89 struct mlx5_mempool_reg_list mempool_reg_list; /* Mempool database. */
90 mlx5_reg_mr_t reg_mr_cb; /* Callback to reg_mr func */
91 mlx5_dereg_mr_t dereg_mr_cb; /* Callback to dereg_mr func */
94 /* Multi-Packet RQ buffer header. */
95 struct mlx5_mprq_buf {
96 struct rte_mempool *mp;
97 uint16_t refcnt; /* Atomically accessed refcnt. */
98 struct rte_mbuf_ext_shared_info shinfos[];
100 * Shared information per stride.
101 * More memory will be allocated for the first stride head-room and for
104 } __rte_cache_aligned;
107 void mlx5_mprq_buf_free_cb(void *addr, void *opaque);
110 * Get Memory Pool (MP) from mbuf. If mbuf is indirect, the pool from which the
111 * cloned mbuf is allocated is returned instead.
117 * Memory pool where data is located for given mbuf.
119 static inline struct rte_mempool *
120 mlx5_mb2mp(struct rte_mbuf *buf)
122 if (unlikely(RTE_MBUF_CLONED(buf)))
123 return rte_mbuf_from_indirect(buf)->pool;
128 * Look up LKey from given lookup table by linear search. Firstly look up the
129 * last-hit entry. If miss, the entire array is searched. If found, update the
130 * last-hit index and return LKey.
133 * Pointer to lookup table.
134 * @param[in,out] cached_idx
135 * Pointer to last-hit index.
137 * Size of lookup table.
142 * Searched LKey on success, UINT32_MAX on no match.
144 static __rte_always_inline uint32_t
145 mlx5_mr_lookup_lkey(struct mr_cache_entry *lkp_tbl, uint16_t *cached_idx,
146 uint16_t n, uintptr_t addr)
150 if (likely(addr >= lkp_tbl[*cached_idx].start &&
151 addr < lkp_tbl[*cached_idx].end))
152 return lkp_tbl[*cached_idx].lkey;
153 for (idx = 0; idx < n && lkp_tbl[idx].start != 0; ++idx) {
154 if (addr >= lkp_tbl[idx].start &&
155 addr < lkp_tbl[idx].end) {
158 return lkp_tbl[idx].lkey;
165 void mlx5_mr_flush_local_cache(struct mlx5_mr_ctrl *mr_ctrl);
168 * Bottom-half of LKey search on. If supported, lookup for the address from
169 * the mempool. Otherwise, search in old mechanism caches.
172 * Pointer to per-queue MR control structure.
177 * Searched LKey on success, UINT32_MAX on no match.
180 uint32_t mlx5_mr_mb2mr_bh(struct mlx5_mr_ctrl *mr_ctrl, struct rte_mbuf *mbuf);
183 * Query LKey from a packet buffer.
186 * Pointer to per-queue MR control structure.
191 * Searched LKey on success, UINT32_MAX on no match.
193 static __rte_always_inline uint32_t
194 mlx5_mr_mb2mr(struct mlx5_mr_ctrl *mr_ctrl, struct rte_mbuf *mbuf)
198 /* Check generation bit to see if there's any change on existing MRs. */
199 if (unlikely(*mr_ctrl->dev_gen_ptr != mr_ctrl->cur_gen))
200 mlx5_mr_flush_local_cache(mr_ctrl);
201 /* Linear search on MR cache array. */
202 lkey = mlx5_mr_lookup_lkey(mr_ctrl->cache, &mr_ctrl->mru,
203 MLX5_MR_CACHE_N, (uintptr_t)mbuf->buf_addr);
204 if (likely(lkey != UINT32_MAX))
206 /* Take slower bottom-half on miss. */
207 return mlx5_mr_mb2mr_bh(mr_ctrl, mbuf);
210 /* mlx5_common_mr.c */
213 int mlx5_mr_ctrl_init(struct mlx5_mr_ctrl *mr_ctrl, uint32_t *dev_gen_ptr,
216 void mlx5_mr_btree_free(struct mlx5_mr_btree *bt);
217 void mlx5_mr_btree_dump(struct mlx5_mr_btree *bt __rte_unused);
219 uint32_t mlx5_mr_mempool2mr_bh(struct mlx5_mr_ctrl *mr_ctrl,
220 struct rte_mempool *mp, uintptr_t addr);
221 void mlx5_mr_release_cache(struct mlx5_mr_share_cache *mr_cache);
222 int mlx5_mr_create_cache(struct mlx5_mr_share_cache *share_cache, int socket);
223 void mlx5_mr_dump_cache(struct mlx5_mr_share_cache *share_cache __rte_unused);
224 void mlx5_mr_rebuild_cache(struct mlx5_mr_share_cache *share_cache);
225 void mlx5_free_mr_by_addr(struct mlx5_mr_share_cache *share_cache,
226 const char *ibdev_name, const void *addr, size_t len);
227 int mlx5_mr_insert_cache(struct mlx5_mr_share_cache *share_cache,
230 mlx5_mr_lookup_list(struct mlx5_mr_share_cache *share_cache,
231 struct mr_cache_entry *entry, uintptr_t addr);
233 mlx5_create_mr_ext(void *pd, uintptr_t addr, size_t len, int socket_id,
234 mlx5_reg_mr_t reg_mr_cb);
235 void mlx5_mr_free(struct mlx5_mr *mr, mlx5_dereg_mr_t dereg_mr_cb);
238 mlx5_mr_create(struct mlx5_common_device *cdev,
239 struct mlx5_mr_share_cache *share_cache,
240 struct mr_cache_entry *entry, uintptr_t addr);
242 /* mlx5_common_verbs.c */
246 mlx5_common_verbs_reg_mr(void *pd, void *addr, size_t length,
247 struct mlx5_pmd_mr *pmd_mr);
250 mlx5_common_verbs_dereg_mr(struct mlx5_pmd_mr *pmd_mr);
253 mlx5_os_set_reg_mr_cb(mlx5_reg_mr_t *reg_mr_cb, mlx5_dereg_mr_t *dereg_mr_cb);
257 mlx5_mr_mempool_register(struct mlx5_common_device *cdev,
258 struct rte_mempool *mp, bool is_extmem);
261 mlx5_mr_mempool_unregister(struct mlx5_common_device *cdev,
262 struct rte_mempool *mp);
266 mlx5_mr_mempool_populate_cache(struct mlx5_mr_ctrl *mr_ctrl,
267 struct rte_mempool *mp);
269 #endif /* RTE_PMD_MLX5_COMMON_MR_H_ */