1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright 2016 6WIND S.A.
3 * Copyright 2020 Mellanox Technologies, Ltd
7 #include <rte_eal_memconfig.h>
8 #include <rte_eal_paging.h>
10 #include <rte_mempool.h>
11 #include <rte_malloc.h>
12 #include <rte_rwlock.h>
14 #include "mlx5_glue.h"
15 #include "mlx5_common.h"
16 #include "mlx5_common_mp.h"
17 #include "mlx5_common_mr.h"
18 #include "mlx5_common_os.h"
19 #include "mlx5_common_log.h"
20 #include "mlx5_malloc.h"
22 struct mr_find_contig_memsegs_data {
26 const struct rte_memseg_list *msl;
29 /* Virtual memory range. */
35 /** Memory region for a mempool. */
36 struct mlx5_mempool_mr {
37 struct mlx5_pmd_mr pmd_mr;
38 uint32_t refcnt; /**< Number of mempools sharing this MR. */
41 /* Mempool registration. */
42 struct mlx5_mempool_reg {
43 LIST_ENTRY(mlx5_mempool_reg) next;
44 /** Registered mempool, used to designate registrations. */
45 struct rte_mempool *mp;
46 /** Memory regions for the address ranges of the mempool. */
47 struct mlx5_mempool_mr *mrs;
48 /** Number of memory regions. */
50 /** Whether the MR were created for external pinned memory. */
55 mlx5_mprq_buf_free_cb(void *addr __rte_unused, void *opaque)
57 struct mlx5_mprq_buf *buf = opaque;
59 if (__atomic_load_n(&buf->refcnt, __ATOMIC_RELAXED) == 1) {
60 rte_mempool_put(buf->mp, buf);
61 } else if (unlikely(__atomic_sub_fetch(&buf->refcnt, 1,
62 __ATOMIC_RELAXED) == 0)) {
63 __atomic_store_n(&buf->refcnt, 1, __ATOMIC_RELAXED);
64 rte_mempool_put(buf->mp, buf);
69 * Expand B-tree table to a given size. Can't be called with holding
70 * memory_hotplug_lock or share_cache.rwlock due to rte_realloc().
73 * Pointer to B-tree structure.
75 * Number of entries for expansion.
78 * 0 on success, -1 on failure.
81 mr_btree_expand(struct mlx5_mr_btree *bt, int n)
89 * Downside of directly using rte_realloc() is that SOCKET_ID_ANY is
90 * used inside if there's no room to expand. Because this is a quite
91 * rare case and a part of very slow path, it is very acceptable.
92 * Initially cache_bh[] will be given practically enough space and once
93 * it is expanded, expansion wouldn't be needed again ever.
95 mem = mlx5_realloc(bt->table, MLX5_MEM_RTE | MLX5_MEM_ZERO,
96 n * sizeof(struct mr_cache_entry), 0, SOCKET_ID_ANY);
98 /* Not an error, B-tree search will be skipped. */
99 DRV_LOG(WARNING, "failed to expand MR B-tree (%p) table",
103 DRV_LOG(DEBUG, "expanded MR B-tree table (size=%u)", n);
111 * Look up LKey from given B-tree lookup table, store the last index and return
115 * Pointer to B-tree structure.
117 * Pointer to index. Even on search failure, returns index where it stops
118 * searching so that index can be used when inserting a new entry.
123 * Searched LKey on success, UINT32_MAX on no match.
126 mr_btree_lookup(struct mlx5_mr_btree *bt, uint16_t *idx, uintptr_t addr)
128 struct mr_cache_entry *lkp_tbl;
132 MLX5_ASSERT(bt != NULL);
133 lkp_tbl = *bt->table;
135 /* First entry must be NULL for comparison. */
136 MLX5_ASSERT(bt->len > 0 || (lkp_tbl[0].start == 0 &&
137 lkp_tbl[0].lkey == UINT32_MAX));
140 register uint16_t delta = n >> 1;
142 if (addr < lkp_tbl[base + delta].start) {
149 MLX5_ASSERT(addr >= lkp_tbl[base].start);
151 if (addr < lkp_tbl[base].end)
152 return lkp_tbl[base].lkey;
158 * Insert an entry to B-tree lookup table.
161 * Pointer to B-tree structure.
163 * Pointer to new entry to insert.
166 * 0 on success, -1 on failure.
169 mr_btree_insert(struct mlx5_mr_btree *bt, struct mr_cache_entry *entry)
171 struct mr_cache_entry *lkp_tbl;
175 MLX5_ASSERT(bt != NULL);
176 MLX5_ASSERT(bt->len <= bt->size);
177 MLX5_ASSERT(bt->len > 0);
178 lkp_tbl = *bt->table;
179 /* Find out the slot for insertion. */
180 if (mr_btree_lookup(bt, &idx, entry->start) != UINT32_MAX) {
182 "abort insertion to B-tree(%p): already exist at"
183 " idx=%u [0x%" PRIxPTR ", 0x%" PRIxPTR ") lkey=0x%x",
184 (void *)bt, idx, entry->start, entry->end, entry->lkey);
185 /* Already exist, return. */
188 /* If table is full, return error. */
189 if (unlikely(bt->len == bt->size)) {
195 shift = (bt->len - idx) * sizeof(struct mr_cache_entry);
197 memmove(&lkp_tbl[idx + 1], &lkp_tbl[idx], shift);
198 lkp_tbl[idx] = *entry;
201 "inserted B-tree(%p)[%u],"
202 " [0x%" PRIxPTR ", 0x%" PRIxPTR ") lkey=0x%x",
203 (void *)bt, idx, entry->start, entry->end, entry->lkey);
208 * Initialize B-tree and allocate memory for lookup table.
211 * Pointer to B-tree structure.
213 * Number of entries to allocate.
215 * NUMA socket on which memory must be allocated.
218 * 0 on success, a negative errno value otherwise and rte_errno is set.
221 mlx5_mr_btree_init(struct mlx5_mr_btree *bt, int n, int socket)
227 MLX5_ASSERT(!bt->table && !bt->size);
228 memset(bt, 0, sizeof(*bt));
229 bt->table = mlx5_malloc(MLX5_MEM_RTE | MLX5_MEM_ZERO,
230 sizeof(struct mr_cache_entry) * n,
232 if (bt->table == NULL) {
235 "failed to allocate memory for btree cache on socket "
240 /* First entry must be NULL for binary search. */
241 (*bt->table)[bt->len++] = (struct mr_cache_entry) {
244 DRV_LOG(DEBUG, "initialized B-tree %p with table %p",
245 (void *)bt, (void *)bt->table);
250 * Free B-tree resources.
253 * Pointer to B-tree structure.
256 mlx5_mr_btree_free(struct mlx5_mr_btree *bt)
260 DRV_LOG(DEBUG, "freeing B-tree %p with table %p",
261 (void *)bt, (void *)bt->table);
262 mlx5_free(bt->table);
263 memset(bt, 0, sizeof(*bt));
267 * Dump all the entries in a B-tree
270 * Pointer to B-tree structure.
273 mlx5_mr_btree_dump(struct mlx5_mr_btree *bt __rte_unused)
275 #ifdef RTE_LIBRTE_MLX5_DEBUG
277 struct mr_cache_entry *lkp_tbl;
281 lkp_tbl = *bt->table;
282 for (idx = 0; idx < bt->len; ++idx) {
283 struct mr_cache_entry *entry = &lkp_tbl[idx];
285 DRV_LOG(DEBUG, "B-tree(%p)[%u],"
286 " [0x%" PRIxPTR ", 0x%" PRIxPTR ") lkey=0x%x",
287 (void *)bt, idx, entry->start, entry->end, entry->lkey);
293 * Initialize per-queue MR control descriptor.
296 * Pointer to MR control structure.
298 * Pointer to generation number of global cache.
300 * NUMA socket on which memory must be allocated.
303 * 0 on success, a negative errno value otherwise and rte_errno is set.
306 mlx5_mr_ctrl_init(struct mlx5_mr_ctrl *mr_ctrl, uint32_t *dev_gen_ptr,
309 if (mr_ctrl == NULL) {
313 /* Save pointer of global generation number to check memory event. */
314 mr_ctrl->dev_gen_ptr = dev_gen_ptr;
315 /* Initialize B-tree and allocate memory for bottom-half cache table. */
316 return mlx5_mr_btree_init(&mr_ctrl->cache_bh, MLX5_MR_BTREE_CACHE_N,
321 * Find virtually contiguous memory chunk in a given MR.
324 * Pointer to MR structure.
326 * Pointer to returning MR cache entry. If not found, this will not be
329 * Start index of the memseg bitmap.
332 * Next index to go on lookup.
335 mr_find_next_chunk(struct mlx5_mr *mr, struct mr_cache_entry *entry,
342 /* MR for external memory doesn't have memseg list. */
343 if (mr->msl == NULL) {
344 MLX5_ASSERT(mr->ms_bmp_n == 1);
345 MLX5_ASSERT(mr->ms_n == 1);
346 MLX5_ASSERT(base_idx == 0);
348 * Can't search it from memseg list but get it directly from
349 * pmd_mr as there's only one chunk.
351 entry->start = (uintptr_t)mr->pmd_mr.addr;
352 entry->end = (uintptr_t)mr->pmd_mr.addr + mr->pmd_mr.len;
353 entry->lkey = rte_cpu_to_be_32(mr->pmd_mr.lkey);
354 /* Returning 1 ends iteration. */
357 for (idx = base_idx; idx < mr->ms_bmp_n; ++idx) {
358 if (rte_bitmap_get(mr->ms_bmp, idx)) {
359 const struct rte_memseg_list *msl;
360 const struct rte_memseg *ms;
363 ms = rte_fbarray_get(&msl->memseg_arr,
364 mr->ms_base_idx + idx);
365 MLX5_ASSERT(msl->page_sz == ms->hugepage_sz);
368 end = ms->addr_64 + ms->hugepage_sz;
370 /* Passed the end of a fragment. */
375 /* Found one chunk. */
376 entry->start = start;
378 entry->lkey = rte_cpu_to_be_32(mr->pmd_mr.lkey);
384 * Insert a MR to the global B-tree cache. It may fail due to low-on-memory.
385 * Then, this entry will have to be searched by mr_lookup_list() in
386 * mlx5_mr_create() on miss.
389 * Pointer to a global shared MR cache.
391 * Pointer to MR to insert.
394 * 0 on success, -1 on failure.
397 mlx5_mr_insert_cache(struct mlx5_mr_share_cache *share_cache,
402 DRV_LOG(DEBUG, "Inserting MR(%p) to global cache(%p)",
403 (void *)mr, (void *)share_cache);
404 for (n = 0; n < mr->ms_bmp_n; ) {
405 struct mr_cache_entry entry;
407 memset(&entry, 0, sizeof(entry));
408 /* Find a contiguous chunk and advance the index. */
409 n = mr_find_next_chunk(mr, &entry, n);
412 if (mr_btree_insert(&share_cache->cache, &entry) < 0) {
414 * Overflowed, but the global table cannot be expanded
415 * because of deadlock.
424 * Look up address in the original global MR list.
427 * Pointer to a global shared MR cache.
429 * Pointer to returning MR cache entry. If no match, this will not be updated.
434 * Found MR on match, NULL otherwise.
437 mlx5_mr_lookup_list(struct mlx5_mr_share_cache *share_cache,
438 struct mr_cache_entry *entry, uintptr_t addr)
442 /* Iterate all the existing MRs. */
443 LIST_FOREACH(mr, &share_cache->mr_list, mr) {
448 for (n = 0; n < mr->ms_bmp_n; ) {
449 struct mr_cache_entry ret;
451 memset(&ret, 0, sizeof(ret));
452 n = mr_find_next_chunk(mr, &ret, n);
453 if (addr >= ret.start && addr < ret.end) {
464 * Look up address on global MR cache.
467 * Pointer to a global shared MR cache.
469 * Pointer to returning MR cache entry. If no match, this will not be updated.
474 * Searched LKey on success, UINT32_MAX on failure and rte_errno is set.
477 mlx5_mr_lookup_cache(struct mlx5_mr_share_cache *share_cache,
478 struct mr_cache_entry *entry, uintptr_t addr)
481 uint32_t lkey = UINT32_MAX;
485 * If the global cache has overflowed since it failed to expand the
486 * B-tree table, it can't have all the existing MRs. Then, the address
487 * has to be searched by traversing the original MR list instead, which
488 * is very slow path. Otherwise, the global cache is all inclusive.
490 if (!unlikely(share_cache->cache.overflow)) {
491 lkey = mr_btree_lookup(&share_cache->cache, &idx, addr);
492 if (lkey != UINT32_MAX)
493 *entry = (*share_cache->cache.table)[idx];
495 /* Falling back to the slowest path. */
496 mr = mlx5_mr_lookup_list(share_cache, entry, addr);
500 MLX5_ASSERT(lkey == UINT32_MAX || (addr >= entry->start &&
506 * Free MR resources. MR lock must not be held to avoid a deadlock. rte_free()
507 * can raise memory free event and the callback function will spin on the lock.
510 * Pointer to MR to free.
513 mlx5_mr_free(struct mlx5_mr *mr, mlx5_dereg_mr_t dereg_mr_cb)
517 DRV_LOG(DEBUG, "freeing MR(%p):", (void *)mr);
518 dereg_mr_cb(&mr->pmd_mr);
519 rte_bitmap_free(mr->ms_bmp);
524 mlx5_mr_rebuild_cache(struct mlx5_mr_share_cache *share_cache)
528 DRV_LOG(DEBUG, "Rebuild dev cache[] %p", (void *)share_cache);
529 /* Flush cache to rebuild. */
530 share_cache->cache.len = 1;
531 share_cache->cache.overflow = 0;
532 /* Iterate all the existing MRs. */
533 LIST_FOREACH(mr, &share_cache->mr_list, mr)
534 if (mlx5_mr_insert_cache(share_cache, mr) < 0)
539 * Release resources of detached MR having no online entry.
542 * Pointer to a global shared MR cache.
545 mlx5_mr_garbage_collect(struct mlx5_mr_share_cache *share_cache)
547 struct mlx5_mr *mr_next;
548 struct mlx5_mr_list free_list = LIST_HEAD_INITIALIZER(free_list);
550 /* Must be called from the primary process. */
551 MLX5_ASSERT(rte_eal_process_type() == RTE_PROC_PRIMARY);
553 * MR can't be freed with holding the lock because rte_free() could call
554 * memory free callback function. This will be a deadlock situation.
556 rte_rwlock_write_lock(&share_cache->rwlock);
557 /* Detach the whole free list and release it after unlocking. */
558 free_list = share_cache->mr_free_list;
559 LIST_INIT(&share_cache->mr_free_list);
560 rte_rwlock_write_unlock(&share_cache->rwlock);
561 /* Release resources. */
562 mr_next = LIST_FIRST(&free_list);
563 while (mr_next != NULL) {
564 struct mlx5_mr *mr = mr_next;
566 mr_next = LIST_NEXT(mr, mr);
567 mlx5_mr_free(mr, share_cache->dereg_mr_cb);
571 /* Called during rte_memseg_contig_walk() by mlx5_mr_create(). */
573 mr_find_contig_memsegs_cb(const struct rte_memseg_list *msl,
574 const struct rte_memseg *ms, size_t len, void *arg)
576 struct mr_find_contig_memsegs_data *data = arg;
578 if (data->addr < ms->addr_64 || data->addr >= ms->addr_64 + len)
580 /* Found, save it and stop walking. */
581 data->start = ms->addr_64;
582 data->end = ms->addr_64 + len;
588 * Create a new global Memory Region (MR) for a missing virtual address.
589 * This API should be called on a secondary process, then a request is sent to
590 * the primary process in order to create a MR for the address. As the global MR
591 * list is on the shared memory, following LKey lookup should succeed unless the
595 * Pointer to the mlx5 common device.
597 * Pointer to a global shared MR cache.
599 * Pointer to returning MR cache entry, found in the global cache or newly
600 * created. If failed to create one, this will not be updated.
602 * Target virtual address to register.
605 * Searched LKey on success, UINT32_MAX on failure and rte_errno is set.
608 mlx5_mr_create_secondary(struct mlx5_common_device *cdev,
609 struct mlx5_mr_share_cache *share_cache,
610 struct mr_cache_entry *entry, uintptr_t addr)
614 DRV_LOG(DEBUG, "Requesting MR creation for address (%p)", (void *)addr);
615 ret = mlx5_mp_req_mr_create(cdev, addr);
617 DRV_LOG(DEBUG, "Fail to request MR creation for address (%p)",
621 rte_rwlock_read_lock(&share_cache->rwlock);
622 /* Fill in output data. */
623 mlx5_mr_lookup_cache(share_cache, entry, addr);
624 /* Lookup can't fail. */
625 MLX5_ASSERT(entry->lkey != UINT32_MAX);
626 rte_rwlock_read_unlock(&share_cache->rwlock);
627 DRV_LOG(DEBUG, "MR CREATED by primary process for %p:\n"
628 " [0x%" PRIxPTR ", 0x%" PRIxPTR "), lkey=0x%x",
629 (void *)addr, entry->start, entry->end, entry->lkey);
634 * Create a new global Memory Region (MR) for a missing virtual address.
635 * Register entire virtually contiguous memory chunk around the address.
638 * Pointer to pd of a device (net, regex, vdpa,...).
640 * Pointer to a global shared MR cache.
642 * Pointer to returning MR cache entry, found in the global cache or newly
643 * created. If failed to create one, this will not be updated.
645 * Target virtual address to register.
646 * @param mr_ext_memseg_en
647 * Configurable flag about external memory segment enable or not.
650 * Searched LKey on success, UINT32_MAX on failure and rte_errno is set.
653 mlx5_mr_create_primary(void *pd,
654 struct mlx5_mr_share_cache *share_cache,
655 struct mr_cache_entry *entry, uintptr_t addr,
656 unsigned int mr_ext_memseg_en)
658 struct mr_find_contig_memsegs_data data = {.addr = addr, };
659 struct mr_find_contig_memsegs_data data_re;
660 const struct rte_memseg_list *msl;
661 const struct rte_memseg *ms;
662 struct mlx5_mr *mr = NULL;
663 int ms_idx_shift = -1;
670 DRV_LOG(DEBUG, "Creating a MR using address (%p)", (void *)addr);
672 * Release detached MRs if any. This can't be called with holding either
673 * memory_hotplug_lock or share_cache->rwlock. MRs on the free list have
674 * been detached by the memory free event but it couldn't be released
675 * inside the callback due to deadlock. As a result, releasing resources
676 * is quite opportunistic.
678 mlx5_mr_garbage_collect(share_cache);
680 * If enabled, find out a contiguous virtual address chunk in use, to
681 * which the given address belongs, in order to register maximum range.
682 * In the best case where mempools are not dynamically recreated and
683 * '--socket-mem' is specified as an EAL option, it is very likely to
684 * have only one MR(LKey) per a socket and per a hugepage-size even
685 * though the system memory is highly fragmented. As the whole memory
686 * chunk will be pinned by kernel, it can't be reused unless entire
687 * chunk is freed from EAL.
689 * If disabled, just register one memseg (page). Then, memory
690 * consumption will be minimized but it may drop performance if there
691 * are many MRs to lookup on the datapath.
693 if (!mr_ext_memseg_en) {
694 data.msl = rte_mem_virt2memseg_list((void *)addr);
695 data.start = RTE_ALIGN_FLOOR(addr, data.msl->page_sz);
696 data.end = data.start + data.msl->page_sz;
697 } else if (!rte_memseg_contig_walk(mr_find_contig_memsegs_cb, &data)) {
699 "Unable to find virtually contiguous"
700 " chunk for address (%p)."
701 " rte_memseg_contig_walk() failed.", (void *)addr);
706 /* Addresses must be page-aligned. */
707 MLX5_ASSERT(data.msl);
708 MLX5_ASSERT(rte_is_aligned((void *)data.start, data.msl->page_sz));
709 MLX5_ASSERT(rte_is_aligned((void *)data.end, data.msl->page_sz));
711 ms = rte_mem_virt2memseg((void *)data.start, msl);
712 len = data.end - data.start;
714 MLX5_ASSERT(msl->page_sz == ms->hugepage_sz);
715 /* Number of memsegs in the range. */
716 ms_n = len / msl->page_sz;
717 DRV_LOG(DEBUG, "Extending %p to [0x%" PRIxPTR ", 0x%" PRIxPTR "),"
718 " page_sz=0x%" PRIx64 ", ms_n=%u",
719 (void *)addr, data.start, data.end, msl->page_sz, ms_n);
720 /* Size of memory for bitmap. */
721 bmp_size = rte_bitmap_get_memory_footprint(ms_n);
722 mr = mlx5_malloc(MLX5_MEM_RTE | MLX5_MEM_ZERO,
723 RTE_ALIGN_CEIL(sizeof(*mr), RTE_CACHE_LINE_SIZE) +
724 bmp_size, RTE_CACHE_LINE_SIZE, msl->socket_id);
726 DRV_LOG(DEBUG, "Unable to allocate memory for a new MR of"
727 " address (%p).", (void *)addr);
733 * Save the index of the first memseg and initialize memseg bitmap. To
734 * see if a memseg of ms_idx in the memseg-list is still valid, check:
735 * rte_bitmap_get(mr->bmp, ms_idx - mr->ms_base_idx)
737 mr->ms_base_idx = rte_fbarray_find_idx(&msl->memseg_arr, ms);
738 bmp_mem = RTE_PTR_ALIGN_CEIL(mr + 1, RTE_CACHE_LINE_SIZE);
739 mr->ms_bmp = rte_bitmap_init(ms_n, bmp_mem, bmp_size);
740 if (mr->ms_bmp == NULL) {
741 DRV_LOG(DEBUG, "Unable to initialize bitmap for a new MR of"
742 " address (%p).", (void *)addr);
747 * Should recheck whether the extended contiguous chunk is still valid.
748 * Because memory_hotplug_lock can't be held if there's any memory
749 * related calls in a critical path, resource allocation above can't be
750 * locked. If the memory has been changed at this point, try again with
751 * just single page. If not, go on with the big chunk atomically from
754 rte_mcfg_mem_read_lock();
756 if (len > msl->page_sz &&
757 !rte_memseg_contig_walk(mr_find_contig_memsegs_cb, &data_re)) {
759 "Unable to find virtually contiguous chunk for address "
760 "(%p). rte_memseg_contig_walk() failed.", (void *)addr);
764 if (data.start != data_re.start || data.end != data_re.end) {
766 * The extended contiguous chunk has been changed. Try again
767 * with single memseg instead.
769 data.start = RTE_ALIGN_FLOOR(addr, msl->page_sz);
770 data.end = data.start + msl->page_sz;
771 rte_mcfg_mem_read_unlock();
772 mlx5_mr_free(mr, share_cache->dereg_mr_cb);
773 goto alloc_resources;
775 MLX5_ASSERT(data.msl == data_re.msl);
776 rte_rwlock_write_lock(&share_cache->rwlock);
778 * Check the address is really missing. If other thread already created
779 * one or it is not found due to overflow, abort and return.
781 if (mlx5_mr_lookup_cache(share_cache, entry, addr) != UINT32_MAX) {
783 * Insert to the global cache table. It may fail due to
784 * low-on-memory. Then, this entry will have to be searched
787 mr_btree_insert(&share_cache->cache, entry);
788 DRV_LOG(DEBUG, "Found MR for %p on final lookup, abort",
790 rte_rwlock_write_unlock(&share_cache->rwlock);
791 rte_mcfg_mem_read_unlock();
793 * Must be unlocked before calling rte_free() because
794 * mlx5_mr_mem_event_free_cb() can be called inside.
796 mlx5_mr_free(mr, share_cache->dereg_mr_cb);
800 * Trim start and end addresses for verbs MR. Set bits for registering
801 * memsegs but exclude already registered ones. Bitmap can be
804 for (n = 0; n < ms_n; ++n) {
806 struct mr_cache_entry ret;
808 memset(&ret, 0, sizeof(ret));
809 start = data_re.start + n * msl->page_sz;
810 /* Exclude memsegs already registered by other MRs. */
811 if (mlx5_mr_lookup_cache(share_cache, &ret, start) ==
814 * Start from the first unregistered memseg in the
817 if (ms_idx_shift == -1) {
818 mr->ms_base_idx += n;
822 data.end = start + msl->page_sz;
823 rte_bitmap_set(mr->ms_bmp, n - ms_idx_shift);
827 len = data.end - data.start;
828 mr->ms_bmp_n = len / msl->page_sz;
829 MLX5_ASSERT(ms_idx_shift + mr->ms_bmp_n <= ms_n);
831 * Finally create an MR for the memory chunk. Verbs: ibv_reg_mr() can
832 * be called with holding the memory lock because it doesn't use
833 * mlx5_alloc_buf_extern() which eventually calls rte_malloc_socket()
834 * through mlx5_alloc_verbs_buf().
836 share_cache->reg_mr_cb(pd, (void *)data.start, len, &mr->pmd_mr);
837 if (mr->pmd_mr.obj == NULL) {
838 DRV_LOG(DEBUG, "Fail to create an MR for address (%p)",
843 MLX5_ASSERT((uintptr_t)mr->pmd_mr.addr == data.start);
844 MLX5_ASSERT(mr->pmd_mr.len);
845 LIST_INSERT_HEAD(&share_cache->mr_list, mr, mr);
846 DRV_LOG(DEBUG, "MR CREATED (%p) for %p:\n"
847 " [0x%" PRIxPTR ", 0x%" PRIxPTR "),"
848 " lkey=0x%x base_idx=%u ms_n=%u, ms_bmp_n=%u",
849 (void *)mr, (void *)addr, data.start, data.end,
850 rte_cpu_to_be_32(mr->pmd_mr.lkey),
851 mr->ms_base_idx, mr->ms_n, mr->ms_bmp_n);
852 /* Insert to the global cache table. */
853 mlx5_mr_insert_cache(share_cache, mr);
854 /* Fill in output data. */
855 mlx5_mr_lookup_cache(share_cache, entry, addr);
856 /* Lookup can't fail. */
857 MLX5_ASSERT(entry->lkey != UINT32_MAX);
858 rte_rwlock_write_unlock(&share_cache->rwlock);
859 rte_mcfg_mem_read_unlock();
862 rte_rwlock_write_unlock(&share_cache->rwlock);
864 rte_mcfg_mem_read_unlock();
867 * In case of error, as this can be called in a datapath, a warning
868 * message per an error is preferable instead. Must be unlocked before
869 * calling rte_free() because mlx5_mr_mem_event_free_cb() can be called
872 mlx5_mr_free(mr, share_cache->dereg_mr_cb);
877 * Create a new global Memory Region (MR) for a missing virtual address.
878 * This can be called from primary and secondary process.
881 * Pointer to the mlx5 common device.
883 * Pointer to a global shared MR cache.
885 * Pointer to returning MR cache entry, found in the global cache or newly
886 * created. If failed to create one, this will not be updated.
888 * Target virtual address to register.
891 * Searched LKey on success, UINT32_MAX on failure and rte_errno is set.
894 mlx5_mr_create(struct mlx5_common_device *cdev,
895 struct mlx5_mr_share_cache *share_cache,
896 struct mr_cache_entry *entry, uintptr_t addr)
900 switch (rte_eal_process_type()) {
901 case RTE_PROC_PRIMARY:
902 ret = mlx5_mr_create_primary(cdev->pd, share_cache, entry, addr,
903 cdev->config.mr_ext_memseg_en);
905 case RTE_PROC_SECONDARY:
906 ret = mlx5_mr_create_secondary(cdev, share_cache, entry, addr);
915 * Look up address in the global MR cache table. If not found, create a new MR.
916 * Insert the found/created entry to local bottom-half cache table.
919 * Pointer to per-queue MR control structure.
921 * Pointer to returning MR cache entry, found in the global cache or newly
922 * created. If failed to create one, this is not written.
927 * Searched LKey on success, UINT32_MAX on no match.
930 mr_lookup_caches(struct mlx5_mr_ctrl *mr_ctrl,
931 struct mr_cache_entry *entry, uintptr_t addr)
933 struct mlx5_mr_share_cache *share_cache =
934 container_of(mr_ctrl->dev_gen_ptr, struct mlx5_mr_share_cache,
936 struct mlx5_common_device *cdev =
937 container_of(share_cache, struct mlx5_common_device, mr_scache);
938 struct mlx5_mr_btree *bt = &mr_ctrl->cache_bh;
942 /* If local cache table is full, try to double it. */
943 if (unlikely(bt->len == bt->size))
944 mr_btree_expand(bt, bt->size << 1);
945 /* Look up in the global cache. */
946 rte_rwlock_read_lock(&share_cache->rwlock);
947 lkey = mr_btree_lookup(&share_cache->cache, &idx, addr);
948 if (lkey != UINT32_MAX) {
950 *entry = (*share_cache->cache.table)[idx];
951 rte_rwlock_read_unlock(&share_cache->rwlock);
953 * Update local cache. Even if it fails, return the found entry
954 * to update top-half cache. Next time, this entry will be found
955 * in the global cache.
957 mr_btree_insert(bt, entry);
960 rte_rwlock_read_unlock(&share_cache->rwlock);
961 /* First time to see the address? Create a new MR. */
962 lkey = mlx5_mr_create(cdev, share_cache, entry, addr);
964 * Update the local cache if successfully created a new global MR. Even
965 * if failed to create one, there's no action to take in this datapath
966 * code. As returning LKey is invalid, this will eventually make HW
969 if (lkey != UINT32_MAX)
970 mr_btree_insert(bt, entry);
975 * Bottom-half of LKey search on datapath. First search in cache_bh[] and if
976 * misses, search in the global MR cache table and update the new entry to
977 * per-queue local caches.
980 * Pointer to per-queue MR control structure.
985 * Searched LKey on success, UINT32_MAX on no match.
988 mlx5_mr_addr2mr_bh(struct mlx5_mr_ctrl *mr_ctrl, uintptr_t addr)
992 /* Victim in top-half cache to replace with new entry. */
993 struct mr_cache_entry *repl = &mr_ctrl->cache[mr_ctrl->head];
995 /* Binary-search MR translation table. */
996 lkey = mr_btree_lookup(&mr_ctrl->cache_bh, &bh_idx, addr);
997 /* Update top-half cache. */
998 if (likely(lkey != UINT32_MAX)) {
999 *repl = (*mr_ctrl->cache_bh.table)[bh_idx];
1002 * If missed in local lookup table, search in the global cache
1003 * and local cache_bh[] will be updated inside if possible.
1004 * Top-half cache entry will also be updated.
1006 lkey = mr_lookup_caches(mr_ctrl, repl, addr);
1007 if (unlikely(lkey == UINT32_MAX))
1010 /* Update the most recently used entry. */
1011 mr_ctrl->mru = mr_ctrl->head;
1012 /* Point to the next victim, the oldest. */
1013 mr_ctrl->head = (mr_ctrl->head + 1) % MLX5_MR_CACHE_N;
1018 * Release all the created MRs and resources on global MR cache of a device
1021 * @param share_cache
1022 * Pointer to a global shared MR cache.
1025 mlx5_mr_release_cache(struct mlx5_mr_share_cache *share_cache)
1027 struct mlx5_mr *mr_next;
1029 rte_rwlock_write_lock(&share_cache->rwlock);
1030 /* Detach from MR list and move to free list. */
1031 mr_next = LIST_FIRST(&share_cache->mr_list);
1032 while (mr_next != NULL) {
1033 struct mlx5_mr *mr = mr_next;
1035 mr_next = LIST_NEXT(mr, mr);
1036 LIST_REMOVE(mr, mr);
1037 LIST_INSERT_HEAD(&share_cache->mr_free_list, mr, mr);
1039 LIST_INIT(&share_cache->mr_list);
1040 /* Free global cache. */
1041 mlx5_mr_btree_free(&share_cache->cache);
1042 rte_rwlock_write_unlock(&share_cache->rwlock);
1043 /* Free all remaining MRs. */
1044 mlx5_mr_garbage_collect(share_cache);
1048 * Initialize global MR cache of a device.
1050 * @param share_cache
1051 * Pointer to a global shared MR cache.
1053 * NUMA socket on which memory must be allocated.
1056 * 0 on success, a negative errno value otherwise and rte_errno is set.
1059 mlx5_mr_create_cache(struct mlx5_mr_share_cache *share_cache, int socket)
1061 /* Set the reg_mr and dereg_mr callback functions */
1062 mlx5_os_set_reg_mr_cb(&share_cache->reg_mr_cb,
1063 &share_cache->dereg_mr_cb);
1064 rte_rwlock_init(&share_cache->rwlock);
1065 rte_rwlock_init(&share_cache->mprwlock);
1066 share_cache->mp_cb_registered = 0;
1067 /* Initialize B-tree and allocate memory for global MR cache table. */
1068 return mlx5_mr_btree_init(&share_cache->cache,
1069 MLX5_MR_BTREE_CACHE_N * 2, socket);
1073 * Flush all of the local cache entries.
1076 * Pointer to per-queue MR local cache.
1079 mlx5_mr_flush_local_cache(struct mlx5_mr_ctrl *mr_ctrl)
1081 /* Reset the most-recently-used index. */
1083 /* Reset the linear search array. */
1085 memset(mr_ctrl->cache, 0, sizeof(mr_ctrl->cache));
1086 /* Reset the B-tree table. */
1087 mr_ctrl->cache_bh.len = 1;
1088 mr_ctrl->cache_bh.overflow = 0;
1089 /* Update the generation number. */
1090 mr_ctrl->cur_gen = *mr_ctrl->dev_gen_ptr;
1091 DRV_LOG(DEBUG, "mr_ctrl(%p): flushed, cur_gen=%d",
1092 (void *)mr_ctrl, mr_ctrl->cur_gen);
1096 * Creates a memory region for external memory, that is memory which is not
1097 * part of the DPDK memory segments.
1100 * Pointer to pd of a device (net, regex, vdpa,...).
1102 * Starting virtual address of memory.
1104 * Length of memory segment being mapped.
1106 * Socket to allocate heap memory for the control structures.
1109 * Pointer to MR structure on success, NULL otherwise.
1112 mlx5_create_mr_ext(void *pd, uintptr_t addr, size_t len, int socket_id,
1113 mlx5_reg_mr_t reg_mr_cb)
1115 struct mlx5_mr *mr = NULL;
1117 mr = mlx5_malloc(MLX5_MEM_RTE | MLX5_MEM_ZERO,
1118 RTE_ALIGN_CEIL(sizeof(*mr), RTE_CACHE_LINE_SIZE),
1119 RTE_CACHE_LINE_SIZE, socket_id);
1122 reg_mr_cb(pd, (void *)addr, len, &mr->pmd_mr);
1123 if (mr->pmd_mr.obj == NULL) {
1125 "Fail to create MR for address (%p)",
1130 mr->msl = NULL; /* Mark it is external memory. */
1135 "MR CREATED (%p) for external memory %p:\n"
1136 " [0x%" PRIxPTR ", 0x%" PRIxPTR "),"
1137 " lkey=0x%x base_idx=%u ms_n=%u, ms_bmp_n=%u",
1138 (void *)mr, (void *)addr,
1139 addr, addr + len, rte_cpu_to_be_32(mr->pmd_mr.lkey),
1140 mr->ms_base_idx, mr->ms_n, mr->ms_bmp_n);
1145 * Callback for memory free event. Iterate freed memsegs and check whether it
1146 * belongs to an existing MR. If found, clear the bit from bitmap of MR. As a
1147 * result, the MR would be fragmented. If it becomes empty, the MR will be freed
1148 * later by mlx5_mr_garbage_collect(). Even if this callback is called from a
1149 * secondary process, the garbage collector will be called in primary process
1150 * as the secondary process can't call mlx5_mr_create().
1152 * The global cache must be rebuilt if there's any change and this event has to
1153 * be propagated to dataplane threads to flush the local caches.
1155 * @param share_cache
1156 * Pointer to a global shared MR cache.
1158 * Name of ibv device.
1160 * Address of freed memory.
1162 * Size of freed memory.
1165 mlx5_free_mr_by_addr(struct mlx5_mr_share_cache *share_cache,
1166 const char *ibdev_name, const void *addr, size_t len)
1168 const struct rte_memseg_list *msl;
1174 DRV_LOG(DEBUG, "device %s free callback: addr=%p, len=%zu",
1175 ibdev_name, addr, len);
1176 msl = rte_mem_virt2memseg_list(addr);
1177 /* addr and len must be page-aligned. */
1178 MLX5_ASSERT((uintptr_t)addr ==
1179 RTE_ALIGN((uintptr_t)addr, msl->page_sz));
1180 MLX5_ASSERT(len == RTE_ALIGN(len, msl->page_sz));
1181 ms_n = len / msl->page_sz;
1182 rte_rwlock_write_lock(&share_cache->rwlock);
1183 /* Clear bits of freed memsegs from MR. */
1184 for (i = 0; i < ms_n; ++i) {
1185 const struct rte_memseg *ms;
1186 struct mr_cache_entry entry;
1191 /* Find MR having this memseg. */
1192 start = (uintptr_t)addr + i * msl->page_sz;
1193 mr = mlx5_mr_lookup_list(share_cache, &entry, start);
1196 MLX5_ASSERT(mr->msl); /* Can't be external memory. */
1197 ms = rte_mem_virt2memseg((void *)start, msl);
1198 MLX5_ASSERT(ms != NULL);
1199 MLX5_ASSERT(msl->page_sz == ms->hugepage_sz);
1200 ms_idx = rte_fbarray_find_idx(&msl->memseg_arr, ms);
1201 pos = ms_idx - mr->ms_base_idx;
1202 MLX5_ASSERT(rte_bitmap_get(mr->ms_bmp, pos));
1203 MLX5_ASSERT(pos < mr->ms_bmp_n);
1204 DRV_LOG(DEBUG, "device %s MR(%p): clear bitmap[%u] for addr %p",
1205 ibdev_name, (void *)mr, pos, (void *)start);
1206 rte_bitmap_clear(mr->ms_bmp, pos);
1207 if (--mr->ms_n == 0) {
1208 LIST_REMOVE(mr, mr);
1209 LIST_INSERT_HEAD(&share_cache->mr_free_list, mr, mr);
1210 DRV_LOG(DEBUG, "device %s remove MR(%p) from list",
1211 ibdev_name, (void *)mr);
1214 * MR is fragmented or will be freed. the global cache must be
1220 mlx5_mr_rebuild_cache(share_cache);
1222 * No explicit wmb is needed after updating dev_gen due to
1223 * store-release ordering in unlock that provides the
1224 * implicit barrier at the software visible level.
1226 ++share_cache->dev_gen;
1227 DRV_LOG(DEBUG, "broadcasting local cache flush, gen=%d",
1228 share_cache->dev_gen);
1230 rte_rwlock_write_unlock(&share_cache->rwlock);
1234 * Dump all the created MRs and the global cache entries.
1236 * @param share_cache
1237 * Pointer to a global shared MR cache.
1240 mlx5_mr_dump_cache(struct mlx5_mr_share_cache *share_cache __rte_unused)
1242 #ifdef RTE_LIBRTE_MLX5_DEBUG
1247 rte_rwlock_read_lock(&share_cache->rwlock);
1248 /* Iterate all the existing MRs. */
1249 LIST_FOREACH(mr, &share_cache->mr_list, mr) {
1252 DRV_LOG(DEBUG, "MR[%u], LKey = 0x%x, ms_n = %u, ms_bmp_n = %u",
1253 mr_n++, rte_cpu_to_be_32(mr->pmd_mr.lkey),
1254 mr->ms_n, mr->ms_bmp_n);
1257 for (n = 0; n < mr->ms_bmp_n; ) {
1258 struct mr_cache_entry ret = { 0, };
1260 n = mr_find_next_chunk(mr, &ret, n);
1264 " chunk[%u], [0x%" PRIxPTR ", 0x%" PRIxPTR ")",
1265 chunk_n++, ret.start, ret.end);
1268 DRV_LOG(DEBUG, "Dumping global cache %p", (void *)share_cache);
1269 mlx5_mr_btree_dump(&share_cache->cache);
1270 rte_rwlock_read_unlock(&share_cache->rwlock);
1275 mlx5_range_compare_start(const void *lhs, const void *rhs)
1277 const struct mlx5_range *r1 = lhs, *r2 = rhs;
1279 if (r1->start > r2->start)
1281 else if (r1->start < r2->start)
1287 mlx5_range_from_mempool_chunk(struct rte_mempool *mp, void *opaque,
1288 struct rte_mempool_memhdr *memhdr,
1291 struct mlx5_range *ranges = opaque, *range = &ranges[idx];
1292 uintptr_t start = (uintptr_t)memhdr->addr;
1293 uint64_t page_size = rte_mem_page_size();
1296 range->start = RTE_ALIGN_FLOOR(start, page_size);
1297 range->end = RTE_ALIGN_CEIL(start + memhdr->len, page_size);
1301 * Collect page-aligned memory ranges of the mempool.
1304 mlx5_mempool_get_chunks(struct rte_mempool *mp, struct mlx5_range **out,
1305 unsigned int *out_n)
1309 DRV_LOG(DEBUG, "Collecting chunks of regular mempool %s", mp->name);
1310 n = mp->nb_mem_chunks;
1311 *out = calloc(sizeof(**out), n);
1314 rte_mempool_mem_iter(mp, mlx5_range_from_mempool_chunk, *out);
1319 struct mlx5_mempool_get_extmem_data {
1320 struct mlx5_range *heap;
1321 unsigned int heap_size;
1326 mlx5_mempool_get_extmem_cb(struct rte_mempool *mp, void *opaque,
1327 void *obj, unsigned int obj_idx)
1329 struct mlx5_mempool_get_extmem_data *data = opaque;
1330 struct rte_mbuf *mbuf = obj;
1331 uintptr_t addr = (uintptr_t)mbuf->buf_addr;
1332 struct mlx5_range *seg, *heap;
1333 struct rte_memseg_list *msl;
1335 uintptr_t page_start;
1336 unsigned int pos = 0, len = data->heap_size, delta;
1339 RTE_SET_USED(obj_idx);
1342 /* Binary search for an already visited page. */
1345 if (addr < data->heap[pos + delta].start) {
1352 if (data->heap != NULL) {
1353 seg = &data->heap[pos];
1354 if (seg->start <= addr && addr < seg->end)
1357 /* Determine the page boundaries and remember them. */
1358 heap = realloc(data->heap, sizeof(heap[0]) * (data->heap_size + 1));
1367 seg = &heap[data->heap_size - 1];
1368 msl = rte_mem_virt2memseg_list((void *)addr);
1369 page_size = msl != NULL ? msl->page_sz : rte_mem_page_size();
1370 page_start = RTE_PTR_ALIGN_FLOOR(addr, page_size);
1371 seg->start = page_start;
1372 seg->end = page_start + page_size;
1373 /* Maintain the heap order. */
1374 qsort(data->heap, data->heap_size, sizeof(heap[0]),
1375 mlx5_range_compare_start);
1379 * Recover pages of external memory as close as possible
1380 * for a mempool with RTE_PKTMBUF_POOL_PINNED_EXT_BUF.
1381 * Pages are stored in a heap for efficient search, for mbufs are many.
1384 mlx5_mempool_get_extmem(struct rte_mempool *mp, struct mlx5_range **out,
1385 unsigned int *out_n)
1387 struct mlx5_mempool_get_extmem_data data;
1389 DRV_LOG(DEBUG, "Recovering external pinned pages of mempool %s",
1391 memset(&data, 0, sizeof(data));
1392 rte_mempool_obj_iter(mp, mlx5_mempool_get_extmem_cb, &data);
1394 *out_n = data.heap_size;
1399 * Get VA-contiguous ranges of the mempool memory.
1400 * Each range start and end is aligned to the system page size.
1404 * @param[in] is_extmem
1405 * Whether the pool is contains only external pinned buffers.
1407 * Receives the ranges, caller must release it with free().
1409 * Receives the number of @p out elements.
1412 * 0 on success, (-1) on failure.
1415 mlx5_get_mempool_ranges(struct rte_mempool *mp, bool is_extmem,
1416 struct mlx5_range **out, unsigned int *out_n)
1418 struct mlx5_range *chunks;
1419 unsigned int chunks_n, contig_n, i;
1422 /* Collect the pool underlying memory. */
1423 ret = is_extmem ? mlx5_mempool_get_extmem(mp, &chunks, &chunks_n) :
1424 mlx5_mempool_get_chunks(mp, &chunks, &chunks_n);
1427 /* Merge adjacent chunks and place them at the beginning. */
1428 qsort(chunks, chunks_n, sizeof(chunks[0]), mlx5_range_compare_start);
1430 for (i = 1; i < chunks_n; i++)
1431 if (chunks[i - 1].end != chunks[i].start) {
1432 chunks[contig_n - 1].end = chunks[i - 1].end;
1433 chunks[contig_n] = chunks[i];
1436 /* Extend the last contiguous chunk to the end of the mempool. */
1437 chunks[contig_n - 1].end = chunks[i - 1].end;
1444 * Analyze mempool memory to select memory ranges to register.
1447 * Mempool to analyze.
1448 * @param[in] is_extmem
1449 * Whether the pool is contains only external pinned buffers.
1451 * Receives memory ranges to register, aligned to the system page size.
1452 * The caller must release them with free().
1454 * Receives the number of @p out items.
1455 * @param[out] share_hugepage
1456 * Receives True if the entire pool resides within a single hugepage.
1459 * 0 on success, (-1) on failure.
1462 mlx5_mempool_reg_analyze(struct rte_mempool *mp, bool is_extmem,
1463 struct mlx5_range **out, unsigned int *out_n,
1464 bool *share_hugepage)
1466 struct mlx5_range *ranges = NULL;
1467 unsigned int i, ranges_n = 0;
1468 struct rte_memseg_list *msl;
1470 if (mlx5_get_mempool_ranges(mp, is_extmem, &ranges, &ranges_n) < 0) {
1471 DRV_LOG(ERR, "Cannot get address ranges for mempool %s",
1475 /* Check if the hugepage of the pool can be shared. */
1476 *share_hugepage = false;
1477 msl = rte_mem_virt2memseg_list((void *)ranges[0].start);
1479 uint64_t hugepage_sz = 0;
1481 /* Check that all ranges are on pages of the same size. */
1482 for (i = 0; i < ranges_n; i++) {
1483 if (hugepage_sz != 0 && hugepage_sz != msl->page_sz)
1485 hugepage_sz = msl->page_sz;
1487 if (i == ranges_n) {
1489 * If the entire pool is within one hugepage,
1490 * combine all ranges into one of the hugepage size.
1492 uintptr_t reg_start = ranges[0].start;
1493 uintptr_t reg_end = ranges[ranges_n - 1].end;
1494 uintptr_t hugepage_start =
1495 RTE_ALIGN_FLOOR(reg_start, hugepage_sz);
1496 uintptr_t hugepage_end = hugepage_start + hugepage_sz;
1497 if (reg_end < hugepage_end) {
1498 ranges[0].start = hugepage_start;
1499 ranges[0].end = hugepage_end;
1501 *share_hugepage = true;
1510 /** Create a registration object for the mempool. */
1511 static struct mlx5_mempool_reg *
1512 mlx5_mempool_reg_create(struct rte_mempool *mp, unsigned int mrs_n,
1515 struct mlx5_mempool_reg *mpr = NULL;
1517 mpr = mlx5_malloc(MLX5_MEM_RTE | MLX5_MEM_ZERO,
1518 sizeof(struct mlx5_mempool_reg),
1519 RTE_CACHE_LINE_SIZE, SOCKET_ID_ANY);
1521 DRV_LOG(ERR, "Cannot allocate mempool %s registration object",
1525 mpr->mrs = mlx5_malloc(MLX5_MEM_RTE | MLX5_MEM_ZERO,
1526 mrs_n * sizeof(struct mlx5_mempool_mr),
1527 RTE_CACHE_LINE_SIZE, SOCKET_ID_ANY);
1529 DRV_LOG(ERR, "Cannot allocate mempool %s registration MRs",
1536 mpr->is_extmem = is_extmem;
1541 * Destroy a mempool registration object.
1544 * Whether @p mpr owns its MRs exclusively, i.e. they are not shared.
1547 mlx5_mempool_reg_destroy(struct mlx5_mr_share_cache *share_cache,
1548 struct mlx5_mempool_reg *mpr, bool standalone)
1553 for (i = 0; i < mpr->mrs_n; i++)
1554 share_cache->dereg_mr_cb(&mpr->mrs[i].pmd_mr);
1555 mlx5_free(mpr->mrs);
1560 /** Find registration object of a mempool. */
1561 static struct mlx5_mempool_reg *
1562 mlx5_mempool_reg_lookup(struct mlx5_mr_share_cache *share_cache,
1563 struct rte_mempool *mp)
1565 struct mlx5_mempool_reg *mpr;
1567 LIST_FOREACH(mpr, &share_cache->mempool_reg_list, next)
1573 /** Increment reference counters of MRs used in the registration. */
1575 mlx5_mempool_reg_attach(struct mlx5_mempool_reg *mpr)
1579 for (i = 0; i < mpr->mrs_n; i++)
1580 __atomic_add_fetch(&mpr->mrs[i].refcnt, 1, __ATOMIC_RELAXED);
1584 * Decrement reference counters of MRs used in the registration.
1586 * @return True if no more references to @p mpr MRs exist, False otherwise.
1589 mlx5_mempool_reg_detach(struct mlx5_mempool_reg *mpr)
1594 for (i = 0; i < mpr->mrs_n; i++)
1595 ret |= __atomic_sub_fetch(&mpr->mrs[i].refcnt, 1,
1596 __ATOMIC_RELAXED) == 0;
1601 mlx5_mr_mempool_register_primary(struct mlx5_mr_share_cache *share_cache,
1602 void *pd, struct rte_mempool *mp,
1605 struct mlx5_range *ranges = NULL;
1606 struct mlx5_mempool_reg *mpr, *old_mpr, *new_mpr;
1607 unsigned int i, ranges_n;
1608 bool share_hugepage, standalone = false;
1611 /* Early check to avoid unnecessary creation of MRs. */
1612 rte_rwlock_read_lock(&share_cache->rwlock);
1613 old_mpr = mlx5_mempool_reg_lookup(share_cache, mp);
1614 rte_rwlock_read_unlock(&share_cache->rwlock);
1615 if (old_mpr != NULL && (!is_extmem || old_mpr->is_extmem)) {
1616 DRV_LOG(DEBUG, "Mempool %s is already registered for PD %p",
1621 if (mlx5_mempool_reg_analyze(mp, is_extmem, &ranges, &ranges_n,
1622 &share_hugepage) < 0) {
1623 DRV_LOG(ERR, "Cannot get mempool %s memory ranges", mp->name);
1627 new_mpr = mlx5_mempool_reg_create(mp, ranges_n, is_extmem);
1628 if (new_mpr == NULL) {
1630 "Cannot create a registration object for mempool %s in PD %p",
1636 * If the entire mempool fits in a single hugepage, the MR for this
1637 * hugepage can be shared across mempools that also fit in it.
1639 if (share_hugepage) {
1640 rte_rwlock_write_lock(&share_cache->rwlock);
1641 LIST_FOREACH(mpr, &share_cache->mempool_reg_list, next) {
1642 if (mpr->mrs[0].pmd_mr.addr == (void *)ranges[0].start)
1646 new_mpr->mrs = mpr->mrs;
1647 mlx5_mempool_reg_attach(new_mpr);
1648 LIST_INSERT_HEAD(&share_cache->mempool_reg_list,
1651 rte_rwlock_write_unlock(&share_cache->rwlock);
1653 DRV_LOG(DEBUG, "Shared MR %#x in PD %p for mempool %s with mempool %s",
1654 mpr->mrs[0].pmd_mr.lkey, pd, mp->name,
1660 for (i = 0; i < ranges_n; i++) {
1661 struct mlx5_mempool_mr *mr = &new_mpr->mrs[i];
1662 const struct mlx5_range *range = &ranges[i];
1663 size_t len = range->end - range->start;
1665 if (share_cache->reg_mr_cb(pd, (void *)range->start, len,
1668 "Failed to create an MR in PD %p for address range "
1669 "[0x%" PRIxPTR ", 0x%" PRIxPTR "] (%zu bytes) for mempool %s",
1670 pd, range->start, range->end, len, mp->name);
1674 "Created a new MR %#x in PD %p for address range "
1675 "[0x%" PRIxPTR ", 0x%" PRIxPTR "] (%zu bytes) for mempool %s",
1676 mr->pmd_mr.lkey, pd, range->start, range->end, len,
1679 if (i != ranges_n) {
1680 mlx5_mempool_reg_destroy(share_cache, new_mpr, true);
1684 /* Concurrent registration is not supposed to happen. */
1685 rte_rwlock_write_lock(&share_cache->rwlock);
1686 mpr = mlx5_mempool_reg_lookup(share_cache, mp);
1687 if (mpr == old_mpr && old_mpr != NULL) {
1688 LIST_REMOVE(old_mpr, next);
1689 standalone = mlx5_mempool_reg_detach(mpr);
1690 /* No need to flush the cache: old MRs cannot be in use. */
1694 mlx5_mempool_reg_attach(new_mpr);
1695 LIST_INSERT_HEAD(&share_cache->mempool_reg_list, new_mpr, next);
1698 rte_rwlock_write_unlock(&share_cache->rwlock);
1700 DRV_LOG(DEBUG, "Mempool %s is already registered for PD %p",
1702 mlx5_mempool_reg_destroy(share_cache, new_mpr, true);
1705 } else if (old_mpr != NULL) {
1706 DRV_LOG(DEBUG, "Mempool %s registration for PD %p updated for external memory",
1708 mlx5_mempool_reg_destroy(share_cache, old_mpr, standalone);
1716 mlx5_mr_mempool_register_secondary(struct mlx5_common_device *cdev,
1717 struct rte_mempool *mp, bool is_extmem)
1719 return mlx5_mp_req_mempool_reg(cdev, mp, true, is_extmem);
1723 * Register the memory of a mempool in the protection domain.
1726 * Pointer to the mlx5 common device.
1728 * Mempool to register.
1731 * 0 on success, (-1) on failure and rte_errno is set.
1734 mlx5_mr_mempool_register(struct mlx5_common_device *cdev,
1735 struct rte_mempool *mp, bool is_extmem)
1737 if (mp->flags & RTE_MEMPOOL_F_NON_IO)
1739 switch (rte_eal_process_type()) {
1740 case RTE_PROC_PRIMARY:
1741 return mlx5_mr_mempool_register_primary(&cdev->mr_scache,
1744 case RTE_PROC_SECONDARY:
1745 return mlx5_mr_mempool_register_secondary(cdev, mp, is_extmem);
1752 mlx5_mr_mempool_unregister_primary(struct mlx5_mr_share_cache *share_cache,
1753 struct rte_mempool *mp)
1755 struct mlx5_mempool_reg *mpr;
1756 bool standalone = false;
1758 rte_rwlock_write_lock(&share_cache->rwlock);
1759 LIST_FOREACH(mpr, &share_cache->mempool_reg_list, next)
1760 if (mpr->mp == mp) {
1761 LIST_REMOVE(mpr, next);
1762 standalone = mlx5_mempool_reg_detach(mpr);
1765 * The unlock operation below provides a memory
1766 * barrier due to its store-release semantics.
1768 ++share_cache->dev_gen;
1771 rte_rwlock_write_unlock(&share_cache->rwlock);
1776 mlx5_mempool_reg_destroy(share_cache, mpr, standalone);
1781 mlx5_mr_mempool_unregister_secondary(struct mlx5_common_device *cdev,
1782 struct rte_mempool *mp)
1784 return mlx5_mp_req_mempool_reg(cdev, mp, false, false /* is_extmem */);
1788 * Unregister the memory of a mempool from the protection domain.
1791 * Pointer to the mlx5 common device.
1793 * Mempool to unregister.
1796 * 0 on success, (-1) on failure and rte_errno is set.
1799 mlx5_mr_mempool_unregister(struct mlx5_common_device *cdev,
1800 struct rte_mempool *mp)
1802 if (mp->flags & RTE_MEMPOOL_F_NON_IO)
1804 switch (rte_eal_process_type()) {
1805 case RTE_PROC_PRIMARY:
1806 return mlx5_mr_mempool_unregister_primary(&cdev->mr_scache, mp);
1807 case RTE_PROC_SECONDARY:
1808 return mlx5_mr_mempool_unregister_secondary(cdev, mp);
1815 * Lookup a MR key by and address in a registered mempool.
1818 * Mempool registration object.
1820 * Address within the mempool.
1822 * Bottom-half cache entry to fill.
1825 * MR key or UINT32_MAX on failure, which can only happen
1826 * if the address is not from within the mempool.
1829 mlx5_mempool_reg_addr2mr(struct mlx5_mempool_reg *mpr, uintptr_t addr,
1830 struct mr_cache_entry *entry)
1832 uint32_t lkey = UINT32_MAX;
1835 for (i = 0; i < mpr->mrs_n; i++) {
1836 const struct mlx5_pmd_mr *mr = &mpr->mrs[i].pmd_mr;
1837 uintptr_t mr_start = (uintptr_t)mr->addr;
1838 uintptr_t mr_end = mr_start + mr->len;
1840 if (mr_start <= addr && addr < mr_end) {
1841 lkey = rte_cpu_to_be_32(mr->lkey);
1842 entry->start = mr_start;
1843 entry->end = mr_end;
1852 * Update bottom-half cache from the list of mempool registrations.
1855 * Per-queue MR control handle.
1857 * Pointer to an entry in the bottom-half cache to update
1858 * with the MR lkey looked up.
1860 * Mempool containing the address.
1862 * Address to lookup.
1864 * MR lkey on success, UINT32_MAX on failure.
1867 mlx5_lookup_mempool_regs(struct mlx5_mr_ctrl *mr_ctrl,
1868 struct mr_cache_entry *entry,
1869 struct rte_mempool *mp, uintptr_t addr)
1871 struct mlx5_mr_share_cache *share_cache =
1872 container_of(mr_ctrl->dev_gen_ptr, struct mlx5_mr_share_cache,
1874 struct mlx5_mr_btree *bt = &mr_ctrl->cache_bh;
1875 struct mlx5_mempool_reg *mpr;
1876 uint32_t lkey = UINT32_MAX;
1878 /* If local cache table is full, try to double it. */
1879 if (unlikely(bt->len == bt->size))
1880 mr_btree_expand(bt, bt->size << 1);
1881 /* Look up in mempool registrations. */
1882 rte_rwlock_read_lock(&share_cache->rwlock);
1883 mpr = mlx5_mempool_reg_lookup(share_cache, mp);
1885 lkey = mlx5_mempool_reg_addr2mr(mpr, addr, entry);
1886 rte_rwlock_read_unlock(&share_cache->rwlock);
1888 * Update local cache. Even if it fails, return the found entry
1889 * to update top-half cache. Next time, this entry will be found
1890 * in the global cache.
1892 if (lkey != UINT32_MAX)
1893 mr_btree_insert(bt, entry);
1898 * Populate cache with LKeys of all MRs used by the mempool.
1899 * It is intended to be used to register Rx mempools in advance.
1902 * Per-queue MR control handle.
1904 * Registered memory pool.
1907 * 0 on success, (-1) on failure and rte_errno is set.
1910 mlx5_mr_mempool_populate_cache(struct mlx5_mr_ctrl *mr_ctrl,
1911 struct rte_mempool *mp)
1913 struct mlx5_mr_share_cache *share_cache =
1914 container_of(mr_ctrl->dev_gen_ptr, struct mlx5_mr_share_cache,
1916 struct mlx5_mr_btree *bt = &mr_ctrl->cache_bh;
1917 struct mlx5_mempool_reg *mpr;
1921 * Registration is valid after the lock is released,
1922 * because the function is called after the mempool is registered.
1924 rte_rwlock_read_lock(&share_cache->rwlock);
1925 mpr = mlx5_mempool_reg_lookup(share_cache, mp);
1926 rte_rwlock_read_unlock(&share_cache->rwlock);
1928 DRV_LOG(ERR, "Mempool %s is not registered", mp->name);
1932 for (i = 0; i < mpr->mrs_n; i++) {
1933 struct mlx5_mempool_mr *mr = &mpr->mrs[i];
1934 struct mr_cache_entry entry;
1938 lkey = mr_btree_lookup(bt, &idx, (uintptr_t)mr->pmd_mr.addr);
1939 if (lkey != UINT32_MAX)
1941 if (bt->len == bt->size)
1942 mr_btree_expand(bt, bt->size << 1);
1943 entry.start = (uintptr_t)mr->pmd_mr.addr;
1944 entry.end = entry.start + mr->pmd_mr.len;
1945 entry.lkey = rte_cpu_to_be_32(mr->pmd_mr.lkey);
1946 if (mr_btree_insert(bt, &entry) < 0) {
1947 DRV_LOG(ERR, "Cannot insert cache entry for mempool %s MR %08x",
1948 mp->name, entry.lkey);
1957 * Bottom-half lookup for the address from the mempool.
1960 * Per-queue MR control handle.
1962 * Mempool containing the address.
1964 * Address to lookup.
1966 * MR lkey on success, UINT32_MAX on failure.
1969 mlx5_mr_mempool2mr_bh(struct mlx5_mr_ctrl *mr_ctrl,
1970 struct rte_mempool *mp, uintptr_t addr)
1972 struct mr_cache_entry *repl = &mr_ctrl->cache[mr_ctrl->head];
1974 uint16_t bh_idx = 0;
1976 /* Binary-search MR translation table. */
1977 lkey = mr_btree_lookup(&mr_ctrl->cache_bh, &bh_idx, addr);
1978 /* Update top-half cache. */
1979 if (likely(lkey != UINT32_MAX)) {
1980 *repl = (*mr_ctrl->cache_bh.table)[bh_idx];
1982 lkey = mlx5_lookup_mempool_regs(mr_ctrl, repl, mp, addr);
1983 /* Can only fail if the address is not from the mempool. */
1984 if (unlikely(lkey == UINT32_MAX))
1987 /* Update the most recently used entry. */
1988 mr_ctrl->mru = mr_ctrl->head;
1989 /* Point to the next victim, the oldest. */
1990 mr_ctrl->head = (mr_ctrl->head + 1) % MLX5_MR_CACHE_N;
1995 mlx5_mr_mb2mr_bh(struct mlx5_mr_ctrl *mr_ctrl, struct rte_mbuf *mb)
1997 struct rte_mempool *mp;
1998 struct mlx5_mprq_buf *buf;
2000 uintptr_t addr = (uintptr_t)mb->buf_addr;
2001 struct mlx5_mr_share_cache *share_cache =
2002 container_of(mr_ctrl->dev_gen_ptr, struct mlx5_mr_share_cache,
2004 struct mlx5_common_device *cdev =
2005 container_of(share_cache, struct mlx5_common_device, mr_scache);
2006 bool external, mprq, pinned = false;
2008 /* Recover MPRQ mempool. */
2009 external = RTE_MBUF_HAS_EXTBUF(mb);
2010 if (external && mb->shinfo->free_cb == mlx5_mprq_buf_free_cb) {
2012 buf = mb->shinfo->fcb_opaque;
2016 mp = mlx5_mb2mp(mb);
2017 pinned = rte_pktmbuf_priv_flags(mp) &
2018 RTE_PKTMBUF_POOL_F_PINNED_EXT_BUF;
2020 if (!external || mprq || pinned) {
2021 lkey = mlx5_mr_mempool2mr_bh(mr_ctrl, mp, addr);
2022 if (lkey != UINT32_MAX)
2024 /* MPRQ is always registered. */
2027 /* Register pinned external memory if the mempool is not used for Rx. */
2028 if (cdev->config.mr_mempool_reg_en && pinned) {
2029 if (mlx5_mr_mempool_register(cdev, mp, true) < 0)
2031 lkey = mlx5_mr_mempool2mr_bh(mr_ctrl, mp, addr);
2032 MLX5_ASSERT(lkey != UINT32_MAX);
2035 /* Fallback to generic mechanism in corner cases. */
2036 return mlx5_mr_addr2mr_bh(mr_ctrl, addr);