1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(c) 2010-2014 Intel Corporation.
3 * Copyright(c) 2016 6WIND S.A.
14 #include <sys/queue.h>
17 #include <rte_common.h>
19 #include <rte_debug.h>
20 #include <rte_memory.h>
21 #include <rte_memzone.h>
22 #include <rte_malloc.h>
23 #include <rte_atomic.h>
24 #include <rte_launch.h>
26 #include <rte_eal_memconfig.h>
27 #include <rte_per_lcore.h>
28 #include <rte_lcore.h>
29 #include <rte_branch_prediction.h>
30 #include <rte_errno.h>
31 #include <rte_string_fns.h>
32 #include <rte_spinlock.h>
33 #include <rte_tailq.h>
35 #include "rte_mempool.h"
37 TAILQ_HEAD(rte_mempool_list, rte_tailq_entry);
39 static struct rte_tailq_elem rte_mempool_tailq = {
40 .name = "RTE_MEMPOOL",
42 EAL_REGISTER_TAILQ(rte_mempool_tailq)
44 #define CACHE_FLUSHTHRESH_MULTIPLIER 1.5
45 #define CALC_CACHE_FLUSHTHRESH(c) \
46 ((typeof(c))((c) * CACHE_FLUSHTHRESH_MULTIPLIER))
49 * return the greatest common divisor between a and b (fast algorithm)
52 static unsigned get_gcd(unsigned a, unsigned b)
77 * Depending on memory configuration, objects addresses are spread
78 * between channels and ranks in RAM: the pool allocator will add
79 * padding between objects. This function return the new size of the
82 static unsigned optimize_object_size(unsigned obj_size)
84 unsigned nrank, nchan;
85 unsigned new_obj_size;
87 /* get number of channels */
88 nchan = rte_memory_get_nchannel();
92 nrank = rte_memory_get_nrank();
96 /* process new object size */
97 new_obj_size = (obj_size + RTE_MEMPOOL_ALIGN_MASK) / RTE_MEMPOOL_ALIGN;
98 while (get_gcd(new_obj_size, nrank * nchan) != 1)
100 return new_obj_size * RTE_MEMPOOL_ALIGN;
103 struct pagesz_walk_arg {
109 find_min_pagesz(const struct rte_memseg_list *msl, void *arg)
111 struct pagesz_walk_arg *wa = arg;
115 * we need to only look at page sizes available for a particular socket
116 * ID. so, we either need an exact match on socket ID (can match both
117 * native and external memory), or, if SOCKET_ID_ANY was specified as a
118 * socket ID argument, we must only look at native memory and ignore any
119 * page sizes associated with external memory.
121 valid = msl->socket_id == wa->socket_id;
122 valid |= wa->socket_id == SOCKET_ID_ANY && msl->external == 0;
124 if (valid && msl->page_sz < wa->min)
125 wa->min = msl->page_sz;
131 get_min_page_size(int socket_id)
133 struct pagesz_walk_arg wa;
136 wa.socket_id = socket_id;
138 rte_memseg_list_walk(find_min_pagesz, &wa);
140 return wa.min == SIZE_MAX ? (size_t) getpagesize() : wa.min;
145 mempool_add_elem(struct rte_mempool *mp, __rte_unused void *opaque,
146 void *obj, rte_iova_t iova)
148 struct rte_mempool_objhdr *hdr;
149 struct rte_mempool_objtlr *tlr __rte_unused;
151 /* set mempool ptr in header */
152 hdr = RTE_PTR_SUB(obj, sizeof(*hdr));
155 STAILQ_INSERT_TAIL(&mp->elt_list, hdr, next);
156 mp->populated_size++;
158 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
159 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE2;
160 tlr = __mempool_get_trailer(obj);
161 tlr->cookie = RTE_MEMPOOL_TRAILER_COOKIE;
165 /* call obj_cb() for each mempool element */
167 rte_mempool_obj_iter(struct rte_mempool *mp,
168 rte_mempool_obj_cb_t *obj_cb, void *obj_cb_arg)
170 struct rte_mempool_objhdr *hdr;
174 STAILQ_FOREACH(hdr, &mp->elt_list, next) {
175 obj = (char *)hdr + sizeof(*hdr);
176 obj_cb(mp, obj_cb_arg, obj, n);
183 /* call mem_cb() for each mempool memory chunk */
185 rte_mempool_mem_iter(struct rte_mempool *mp,
186 rte_mempool_mem_cb_t *mem_cb, void *mem_cb_arg)
188 struct rte_mempool_memhdr *hdr;
191 STAILQ_FOREACH(hdr, &mp->mem_list, next) {
192 mem_cb(mp, mem_cb_arg, hdr, n);
199 /* get the header, trailer and total size of a mempool element. */
201 rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
202 struct rte_mempool_objsz *sz)
204 struct rte_mempool_objsz lsz;
206 sz = (sz != NULL) ? sz : &lsz;
208 sz->header_size = sizeof(struct rte_mempool_objhdr);
209 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0)
210 sz->header_size = RTE_ALIGN_CEIL(sz->header_size,
213 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
214 sz->trailer_size = sizeof(struct rte_mempool_objtlr);
216 sz->trailer_size = 0;
219 /* element size is 8 bytes-aligned at least */
220 sz->elt_size = RTE_ALIGN_CEIL(elt_size, sizeof(uint64_t));
222 /* expand trailer to next cache line */
223 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0) {
224 sz->total_size = sz->header_size + sz->elt_size +
226 sz->trailer_size += ((RTE_MEMPOOL_ALIGN -
227 (sz->total_size & RTE_MEMPOOL_ALIGN_MASK)) &
228 RTE_MEMPOOL_ALIGN_MASK);
232 * increase trailer to add padding between objects in order to
233 * spread them across memory channels/ranks
235 if ((flags & MEMPOOL_F_NO_SPREAD) == 0) {
237 new_size = optimize_object_size(sz->header_size + sz->elt_size +
239 sz->trailer_size = new_size - sz->header_size - sz->elt_size;
242 /* this is the size of an object, including header and trailer */
243 sz->total_size = sz->header_size + sz->elt_size + sz->trailer_size;
245 return sz->total_size;
248 /* free a memchunk allocated with rte_memzone_reserve() */
250 rte_mempool_memchunk_mz_free(__rte_unused struct rte_mempool_memhdr *memhdr,
253 const struct rte_memzone *mz = opaque;
254 rte_memzone_free(mz);
257 /* Free memory chunks used by a mempool. Objects must be in pool */
259 rte_mempool_free_memchunks(struct rte_mempool *mp)
261 struct rte_mempool_memhdr *memhdr;
264 while (!STAILQ_EMPTY(&mp->elt_list)) {
265 rte_mempool_ops_dequeue_bulk(mp, &elt, 1);
267 STAILQ_REMOVE_HEAD(&mp->elt_list, next);
268 mp->populated_size--;
271 while (!STAILQ_EMPTY(&mp->mem_list)) {
272 memhdr = STAILQ_FIRST(&mp->mem_list);
273 STAILQ_REMOVE_HEAD(&mp->mem_list, next);
274 if (memhdr->free_cb != NULL)
275 memhdr->free_cb(memhdr, memhdr->opaque);
282 mempool_ops_alloc_once(struct rte_mempool *mp)
286 /* create the internal ring if not already done */
287 if ((mp->flags & MEMPOOL_F_POOL_CREATED) == 0) {
288 ret = rte_mempool_ops_alloc(mp);
291 mp->flags |= MEMPOOL_F_POOL_CREATED;
296 /* Add objects in the pool, using a physically contiguous memory
297 * zone. Return the number of objects added, or a negative value
301 rte_mempool_populate_iova(struct rte_mempool *mp, char *vaddr,
302 rte_iova_t iova, size_t len, rte_mempool_memchunk_free_cb_t *free_cb,
307 struct rte_mempool_memhdr *memhdr;
310 ret = mempool_ops_alloc_once(mp);
314 /* mempool is already populated */
315 if (mp->populated_size >= mp->size)
318 memhdr = rte_zmalloc("MEMPOOL_MEMHDR", sizeof(*memhdr), 0);
323 memhdr->addr = vaddr;
326 memhdr->free_cb = free_cb;
327 memhdr->opaque = opaque;
329 if (mp->flags & MEMPOOL_F_NO_CACHE_ALIGN)
330 off = RTE_PTR_ALIGN_CEIL(vaddr, 8) - vaddr;
332 off = RTE_PTR_ALIGN_CEIL(vaddr, RTE_CACHE_LINE_SIZE) - vaddr;
339 i = rte_mempool_ops_populate(mp, mp->size - mp->populated_size,
341 (iova == RTE_BAD_IOVA) ? RTE_BAD_IOVA : (iova + off),
342 len - off, mempool_add_elem, NULL);
344 /* not enough room to store one object */
350 STAILQ_INSERT_TAIL(&mp->mem_list, memhdr, next);
359 /* Populate the mempool with a virtual area. Return the number of
360 * objects added, or a negative value on error.
363 rte_mempool_populate_virt(struct rte_mempool *mp, char *addr,
364 size_t len, size_t pg_sz, rte_mempool_memchunk_free_cb_t *free_cb,
368 size_t off, phys_len;
371 if (mp->flags & MEMPOOL_F_NO_IOVA_CONTIG)
372 return rte_mempool_populate_iova(mp, addr, RTE_BAD_IOVA,
373 len, free_cb, opaque);
375 for (off = 0; off < len &&
376 mp->populated_size < mp->size; off += phys_len) {
378 iova = rte_mem_virt2iova(addr + off);
380 if (iova == RTE_BAD_IOVA && rte_eal_has_hugepages()) {
385 /* populate with the largest group of contiguous pages */
386 for (phys_len = RTE_MIN(
387 (size_t)(RTE_PTR_ALIGN_CEIL(addr + off + 1, pg_sz) -
390 off + phys_len < len;
391 phys_len = RTE_MIN(phys_len + pg_sz, len - off)) {
394 iova_tmp = rte_mem_virt2iova(addr + off + phys_len);
396 if (iova_tmp == RTE_BAD_IOVA ||
397 iova_tmp != iova + phys_len)
401 ret = rte_mempool_populate_iova(mp, addr + off, iova,
402 phys_len, free_cb, opaque);
405 /* no need to call the free callback for next chunks */
413 rte_mempool_free_memchunks(mp);
417 /* Default function to populate the mempool: allocate memory in memzones,
418 * and populate them. Return the number of objects added, or a negative
422 rte_mempool_populate_default(struct rte_mempool *mp)
424 unsigned int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
425 char mz_name[RTE_MEMZONE_NAMESIZE];
426 const struct rte_memzone *mz;
428 size_t align, pg_sz, pg_shift;
432 bool need_iova_contig_obj;
433 bool alloc_in_ext_mem;
435 ret = mempool_ops_alloc_once(mp);
439 /* mempool must not be populated */
440 if (mp->nb_mem_chunks != 0)
444 * the following section calculates page shift and page size values.
446 * these values impact the result of calc_mem_size operation, which
447 * returns the amount of memory that should be allocated to store the
448 * desired number of objects. when not zero, it allocates more memory
449 * for the padding between objects, to ensure that an object does not
450 * cross a page boundary. in other words, page size/shift are to be set
451 * to zero if mempool elements won't care about page boundaries.
452 * there are several considerations for page size and page shift here.
454 * if we don't need our mempools to have physically contiguous objects,
455 * then just set page shift and page size to 0, because the user has
456 * indicated that there's no need to care about anything.
458 * if we do need contiguous objects, there is also an option to reserve
459 * the entire mempool memory as one contiguous block of memory, in
460 * which case the page shift and alignment wouldn't matter as well.
462 * if we require contiguous objects, but not necessarily the entire
463 * mempool reserved space to be contiguous, then there are two options.
465 * if our IO addresses are virtual, not actual physical (IOVA as VA
466 * case), then no page shift needed - our memory allocation will give us
467 * contiguous IO memory as far as the hardware is concerned, so
468 * act as if we're getting contiguous memory.
470 * if our IO addresses are physical, we may get memory from bigger
471 * pages, or we might get memory from smaller pages, and how much of it
472 * we require depends on whether we want bigger or smaller pages.
473 * However, requesting each and every memory size is too much work, so
474 * what we'll do instead is walk through the page sizes available, pick
475 * the smallest one and set up page shift to match that one. We will be
476 * wasting some space this way, but it's much nicer than looping around
477 * trying to reserve each and every page size.
479 * If we fail to get enough contiguous memory, then we'll go and
480 * reserve space in smaller chunks.
482 * We also have to take into account the fact that memory that we're
483 * going to allocate from can belong to an externally allocated memory
484 * area, in which case the assumption of IOVA as VA mode being
485 * synonymous with IOVA contiguousness will not hold.
488 /* check if we can retrieve a valid socket ID */
489 ret = rte_malloc_heap_socket_is_external(mp->socket_id);
492 alloc_in_ext_mem = (ret == 1);
493 need_iova_contig_obj = !(mp->flags & MEMPOOL_F_NO_IOVA_CONTIG);
495 if (!need_iova_contig_obj) {
498 } else if (!alloc_in_ext_mem && rte_eal_iova_mode() == RTE_IOVA_VA) {
501 } else if (rte_eal_has_hugepages() || alloc_in_ext_mem) {
502 pg_sz = get_min_page_size(mp->socket_id);
503 pg_shift = rte_bsf32(pg_sz);
505 pg_sz = getpagesize();
506 pg_shift = rte_bsf32(pg_sz);
509 for (mz_id = 0, n = mp->size; n > 0; mz_id++, n -= ret) {
510 size_t min_chunk_size;
512 mem_size = rte_mempool_ops_calc_mem_size(
513 mp, n, pg_shift, &min_chunk_size, &align);
520 ret = snprintf(mz_name, sizeof(mz_name),
521 RTE_MEMPOOL_MZ_FORMAT "_%d", mp->name, mz_id);
522 if (ret < 0 || ret >= (int)sizeof(mz_name)) {
527 /* if we're trying to reserve contiguous memory, add appropriate
530 if (min_chunk_size == (size_t)mem_size)
531 mz_flags |= RTE_MEMZONE_IOVA_CONTIG;
533 mz = rte_memzone_reserve_aligned(mz_name, mem_size,
534 mp->socket_id, mz_flags, align);
536 /* don't try reserving with 0 size if we were asked to reserve
537 * IOVA-contiguous memory.
539 if (min_chunk_size < (size_t)mem_size && mz == NULL) {
540 /* not enough memory, retry with the biggest zone we
543 mz = rte_memzone_reserve_aligned(mz_name, 0,
544 mp->socket_id, mz_flags, align);
551 if (mz->len < min_chunk_size) {
552 rte_memzone_free(mz);
557 if (need_iova_contig_obj)
562 if (pg_sz == 0 || (mz_flags & RTE_MEMZONE_IOVA_CONTIG))
563 ret = rte_mempool_populate_iova(mp, mz->addr,
565 rte_mempool_memchunk_mz_free,
566 (void *)(uintptr_t)mz);
568 ret = rte_mempool_populate_virt(mp, mz->addr,
570 rte_mempool_memchunk_mz_free,
571 (void *)(uintptr_t)mz);
573 rte_memzone_free(mz);
581 rte_mempool_free_memchunks(mp);
585 /* return the memory size required for mempool objects in anonymous mem */
587 get_anon_size(const struct rte_mempool *mp)
590 size_t pg_sz, pg_shift;
591 size_t min_chunk_size;
594 pg_sz = getpagesize();
595 pg_shift = rte_bsf32(pg_sz);
596 size = rte_mempool_ops_calc_mem_size(mp, mp->size, pg_shift,
597 &min_chunk_size, &align);
602 /* unmap a memory zone mapped by rte_mempool_populate_anon() */
604 rte_mempool_memchunk_anon_free(struct rte_mempool_memhdr *memhdr,
610 * Calculate size since memhdr->len has contiguous chunk length
611 * which may be smaller if anon map is split into many contiguous
612 * chunks. Result must be the same as we calculated on populate.
614 size = get_anon_size(memhdr->mp);
618 munmap(opaque, size);
621 /* populate the mempool with an anonymous mapping */
623 rte_mempool_populate_anon(struct rte_mempool *mp)
629 /* mempool is already populated, error */
630 if ((!STAILQ_EMPTY(&mp->mem_list)) || mp->nb_mem_chunks != 0) {
635 ret = mempool_ops_alloc_once(mp);
639 size = get_anon_size(mp);
645 /* get chunk of virtually continuous memory */
646 addr = mmap(NULL, size, PROT_READ | PROT_WRITE,
647 MAP_SHARED | MAP_ANONYMOUS, -1, 0);
648 if (addr == MAP_FAILED) {
652 /* can't use MMAP_LOCKED, it does not exist on BSD */
653 if (mlock(addr, size) < 0) {
659 ret = rte_mempool_populate_virt(mp, addr, size, getpagesize(),
660 rte_mempool_memchunk_anon_free, addr);
664 return mp->populated_size;
667 rte_mempool_free_memchunks(mp);
673 rte_mempool_free(struct rte_mempool *mp)
675 struct rte_mempool_list *mempool_list = NULL;
676 struct rte_tailq_entry *te;
681 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
682 rte_mcfg_tailq_write_lock();
683 /* find out tailq entry */
684 TAILQ_FOREACH(te, mempool_list, next) {
685 if (te->data == (void *)mp)
690 TAILQ_REMOVE(mempool_list, te, next);
693 rte_mcfg_tailq_write_unlock();
695 rte_mempool_free_memchunks(mp);
696 rte_mempool_ops_free(mp);
697 rte_memzone_free(mp->mz);
701 mempool_cache_init(struct rte_mempool_cache *cache, uint32_t size)
704 cache->flushthresh = CALC_CACHE_FLUSHTHRESH(size);
709 * Create and initialize a cache for objects that are retrieved from and
710 * returned to an underlying mempool. This structure is identical to the
711 * local_cache[lcore_id] pointed to by the mempool structure.
713 struct rte_mempool_cache *
714 rte_mempool_cache_create(uint32_t size, int socket_id)
716 struct rte_mempool_cache *cache;
718 if (size == 0 || size > RTE_MEMPOOL_CACHE_MAX_SIZE) {
723 cache = rte_zmalloc_socket("MEMPOOL_CACHE", sizeof(*cache),
724 RTE_CACHE_LINE_SIZE, socket_id);
726 RTE_LOG(ERR, MEMPOOL, "Cannot allocate mempool cache.\n");
731 mempool_cache_init(cache, size);
737 * Free a cache. It's the responsibility of the user to make sure that any
738 * remaining objects in the cache are flushed to the corresponding
742 rte_mempool_cache_free(struct rte_mempool_cache *cache)
747 /* create an empty mempool */
749 rte_mempool_create_empty(const char *name, unsigned n, unsigned elt_size,
750 unsigned cache_size, unsigned private_data_size,
751 int socket_id, unsigned flags)
753 char mz_name[RTE_MEMZONE_NAMESIZE];
754 struct rte_mempool_list *mempool_list;
755 struct rte_mempool *mp = NULL;
756 struct rte_tailq_entry *te = NULL;
757 const struct rte_memzone *mz = NULL;
759 unsigned int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
760 struct rte_mempool_objsz objsz;
764 /* compilation-time checks */
765 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool) &
766 RTE_CACHE_LINE_MASK) != 0);
767 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_cache) &
768 RTE_CACHE_LINE_MASK) != 0);
769 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
770 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_debug_stats) &
771 RTE_CACHE_LINE_MASK) != 0);
772 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, stats) &
773 RTE_CACHE_LINE_MASK) != 0);
776 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
778 /* asked for zero items */
784 /* asked cache too big */
785 if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE ||
786 CALC_CACHE_FLUSHTHRESH(cache_size) > n) {
791 /* "no cache align" imply "no spread" */
792 if (flags & MEMPOOL_F_NO_CACHE_ALIGN)
793 flags |= MEMPOOL_F_NO_SPREAD;
795 /* calculate mempool object sizes. */
796 if (!rte_mempool_calc_obj_size(elt_size, flags, &objsz)) {
801 rte_mcfg_mempool_write_lock();
804 * reserve a memory zone for this mempool: private data is
807 private_data_size = (private_data_size +
808 RTE_MEMPOOL_ALIGN_MASK) & (~RTE_MEMPOOL_ALIGN_MASK);
811 /* try to allocate tailq entry */
812 te = rte_zmalloc("MEMPOOL_TAILQ_ENTRY", sizeof(*te), 0);
814 RTE_LOG(ERR, MEMPOOL, "Cannot allocate tailq entry!\n");
818 mempool_size = MEMPOOL_HEADER_SIZE(mp, cache_size);
819 mempool_size += private_data_size;
820 mempool_size = RTE_ALIGN_CEIL(mempool_size, RTE_MEMPOOL_ALIGN);
822 ret = snprintf(mz_name, sizeof(mz_name), RTE_MEMPOOL_MZ_FORMAT, name);
823 if (ret < 0 || ret >= (int)sizeof(mz_name)) {
824 rte_errno = ENAMETOOLONG;
828 mz = rte_memzone_reserve(mz_name, mempool_size, socket_id, mz_flags);
832 /* init the mempool structure */
834 memset(mp, 0, MEMPOOL_HEADER_SIZE(mp, cache_size));
835 ret = strlcpy(mp->name, name, sizeof(mp->name));
836 if (ret < 0 || ret >= (int)sizeof(mp->name)) {
837 rte_errno = ENAMETOOLONG;
843 mp->socket_id = socket_id;
844 mp->elt_size = objsz.elt_size;
845 mp->header_size = objsz.header_size;
846 mp->trailer_size = objsz.trailer_size;
847 /* Size of default caches, zero means disabled. */
848 mp->cache_size = cache_size;
849 mp->private_data_size = private_data_size;
850 STAILQ_INIT(&mp->elt_list);
851 STAILQ_INIT(&mp->mem_list);
854 * local_cache pointer is set even if cache_size is zero.
855 * The local_cache points to just past the elt_pa[] array.
857 mp->local_cache = (struct rte_mempool_cache *)
858 RTE_PTR_ADD(mp, MEMPOOL_HEADER_SIZE(mp, 0));
860 /* Init all default caches. */
861 if (cache_size != 0) {
862 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
863 mempool_cache_init(&mp->local_cache[lcore_id],
869 rte_mcfg_tailq_write_lock();
870 TAILQ_INSERT_TAIL(mempool_list, te, next);
871 rte_mcfg_tailq_write_unlock();
872 rte_mcfg_mempool_write_unlock();
877 rte_mcfg_mempool_write_unlock();
879 rte_mempool_free(mp);
883 /* create the mempool */
885 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
886 unsigned cache_size, unsigned private_data_size,
887 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
888 rte_mempool_obj_cb_t *obj_init, void *obj_init_arg,
889 int socket_id, unsigned flags)
892 struct rte_mempool *mp;
894 mp = rte_mempool_create_empty(name, n, elt_size, cache_size,
895 private_data_size, socket_id, flags);
900 * Since we have 4 combinations of the SP/SC/MP/MC examine the flags to
901 * set the correct index into the table of ops structs.
903 if ((flags & MEMPOOL_F_SP_PUT) && (flags & MEMPOOL_F_SC_GET))
904 ret = rte_mempool_set_ops_byname(mp, "ring_sp_sc", NULL);
905 else if (flags & MEMPOOL_F_SP_PUT)
906 ret = rte_mempool_set_ops_byname(mp, "ring_sp_mc", NULL);
907 else if (flags & MEMPOOL_F_SC_GET)
908 ret = rte_mempool_set_ops_byname(mp, "ring_mp_sc", NULL);
910 ret = rte_mempool_set_ops_byname(mp, "ring_mp_mc", NULL);
915 /* call the mempool priv initializer */
917 mp_init(mp, mp_init_arg);
919 if (rte_mempool_populate_default(mp) < 0)
922 /* call the object initializers */
924 rte_mempool_obj_iter(mp, obj_init, obj_init_arg);
929 rte_mempool_free(mp);
933 /* Return the number of entries in the mempool */
935 rte_mempool_avail_count(const struct rte_mempool *mp)
940 count = rte_mempool_ops_get_count(mp);
942 if (mp->cache_size == 0)
945 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
946 count += mp->local_cache[lcore_id].len;
949 * due to race condition (access to len is not locked), the
950 * total can be greater than size... so fix the result
952 if (count > mp->size)
957 /* return the number of entries allocated from the mempool */
959 rte_mempool_in_use_count(const struct rte_mempool *mp)
961 return mp->size - rte_mempool_avail_count(mp);
964 /* dump the cache status */
966 rte_mempool_dump_cache(FILE *f, const struct rte_mempool *mp)
970 unsigned cache_count;
972 fprintf(f, " internal cache infos:\n");
973 fprintf(f, " cache_size=%"PRIu32"\n", mp->cache_size);
975 if (mp->cache_size == 0)
978 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
979 cache_count = mp->local_cache[lcore_id].len;
980 fprintf(f, " cache_count[%u]=%"PRIu32"\n",
981 lcore_id, cache_count);
982 count += cache_count;
984 fprintf(f, " total_cache_count=%u\n", count);
988 #ifndef __INTEL_COMPILER
989 #pragma GCC diagnostic ignored "-Wcast-qual"
992 /* check and update cookies or panic (internal) */
993 void rte_mempool_check_cookies(const struct rte_mempool *mp,
994 void * const *obj_table_const, unsigned n, int free)
996 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
997 struct rte_mempool_objhdr *hdr;
998 struct rte_mempool_objtlr *tlr;
1004 /* Force to drop the "const" attribute. This is done only when
1005 * DEBUG is enabled */
1006 tmp = (void *) obj_table_const;
1012 if (rte_mempool_from_obj(obj) != mp)
1013 rte_panic("MEMPOOL: object is owned by another "
1016 hdr = __mempool_get_header(obj);
1017 cookie = hdr->cookie;
1020 if (cookie != RTE_MEMPOOL_HEADER_COOKIE1) {
1021 RTE_LOG(CRIT, MEMPOOL,
1022 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1023 obj, (const void *) mp, cookie);
1024 rte_panic("MEMPOOL: bad header cookie (put)\n");
1026 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE2;
1027 } else if (free == 1) {
1028 if (cookie != RTE_MEMPOOL_HEADER_COOKIE2) {
1029 RTE_LOG(CRIT, MEMPOOL,
1030 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1031 obj, (const void *) mp, cookie);
1032 rte_panic("MEMPOOL: bad header cookie (get)\n");
1034 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE1;
1035 } else if (free == 2) {
1036 if (cookie != RTE_MEMPOOL_HEADER_COOKIE1 &&
1037 cookie != RTE_MEMPOOL_HEADER_COOKIE2) {
1038 RTE_LOG(CRIT, MEMPOOL,
1039 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1040 obj, (const void *) mp, cookie);
1041 rte_panic("MEMPOOL: bad header cookie (audit)\n");
1044 tlr = __mempool_get_trailer(obj);
1045 cookie = tlr->cookie;
1046 if (cookie != RTE_MEMPOOL_TRAILER_COOKIE) {
1047 RTE_LOG(CRIT, MEMPOOL,
1048 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1049 obj, (const void *) mp, cookie);
1050 rte_panic("MEMPOOL: bad trailer cookie\n");
1055 RTE_SET_USED(obj_table_const);
1062 rte_mempool_contig_blocks_check_cookies(const struct rte_mempool *mp,
1063 void * const *first_obj_table_const, unsigned int n, int free)
1065 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1066 struct rte_mempool_info info;
1067 const size_t total_elt_sz =
1068 mp->header_size + mp->elt_size + mp->trailer_size;
1071 rte_mempool_ops_get_info(mp, &info);
1073 for (i = 0; i < n; ++i) {
1074 void *first_obj = first_obj_table_const[i];
1076 for (j = 0; j < info.contig_block_size; ++j) {
1079 obj = (void *)((uintptr_t)first_obj + j * total_elt_sz);
1080 rte_mempool_check_cookies(mp, &obj, 1, free);
1085 RTE_SET_USED(first_obj_table_const);
1091 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1093 mempool_obj_audit(struct rte_mempool *mp, __rte_unused void *opaque,
1094 void *obj, __rte_unused unsigned idx)
1096 __mempool_check_cookies(mp, &obj, 1, 2);
1100 mempool_audit_cookies(struct rte_mempool *mp)
1104 num = rte_mempool_obj_iter(mp, mempool_obj_audit, NULL);
1105 if (num != mp->size) {
1106 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
1107 "iterated only over %u elements\n",
1112 #define mempool_audit_cookies(mp) do {} while(0)
1115 #ifndef __INTEL_COMPILER
1116 #pragma GCC diagnostic error "-Wcast-qual"
1119 /* check cookies before and after objects */
1121 mempool_audit_cache(const struct rte_mempool *mp)
1123 /* check cache size consistency */
1126 if (mp->cache_size == 0)
1129 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
1130 const struct rte_mempool_cache *cache;
1131 cache = &mp->local_cache[lcore_id];
1132 if (cache->len > cache->flushthresh) {
1133 RTE_LOG(CRIT, MEMPOOL, "badness on cache[%u]\n",
1135 rte_panic("MEMPOOL: invalid cache len\n");
1140 /* check the consistency of mempool (size, cookies, ...) */
1142 rte_mempool_audit(struct rte_mempool *mp)
1144 mempool_audit_cache(mp);
1145 mempool_audit_cookies(mp);
1147 /* For case where mempool DEBUG is not set, and cache size is 0 */
1151 /* dump the status of the mempool on the console */
1153 rte_mempool_dump(FILE *f, struct rte_mempool *mp)
1155 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1156 struct rte_mempool_info info;
1157 struct rte_mempool_debug_stats sum;
1160 struct rte_mempool_memhdr *memhdr;
1161 unsigned common_count;
1162 unsigned cache_count;
1165 RTE_ASSERT(f != NULL);
1166 RTE_ASSERT(mp != NULL);
1168 fprintf(f, "mempool <%s>@%p\n", mp->name, mp);
1169 fprintf(f, " flags=%x\n", mp->flags);
1170 fprintf(f, " pool=%p\n", mp->pool_data);
1171 fprintf(f, " iova=0x%" PRIx64 "\n", mp->mz->iova);
1172 fprintf(f, " nb_mem_chunks=%u\n", mp->nb_mem_chunks);
1173 fprintf(f, " size=%"PRIu32"\n", mp->size);
1174 fprintf(f, " populated_size=%"PRIu32"\n", mp->populated_size);
1175 fprintf(f, " header_size=%"PRIu32"\n", mp->header_size);
1176 fprintf(f, " elt_size=%"PRIu32"\n", mp->elt_size);
1177 fprintf(f, " trailer_size=%"PRIu32"\n", mp->trailer_size);
1178 fprintf(f, " total_obj_size=%"PRIu32"\n",
1179 mp->header_size + mp->elt_size + mp->trailer_size);
1181 fprintf(f, " private_data_size=%"PRIu32"\n", mp->private_data_size);
1183 STAILQ_FOREACH(memhdr, &mp->mem_list, next)
1184 mem_len += memhdr->len;
1186 fprintf(f, " avg bytes/object=%#Lf\n",
1187 (long double)mem_len / mp->size);
1190 cache_count = rte_mempool_dump_cache(f, mp);
1191 common_count = rte_mempool_ops_get_count(mp);
1192 if ((cache_count + common_count) > mp->size)
1193 common_count = mp->size - cache_count;
1194 fprintf(f, " common_pool_count=%u\n", common_count);
1196 /* sum and dump statistics */
1197 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1198 rte_mempool_ops_get_info(mp, &info);
1199 memset(&sum, 0, sizeof(sum));
1200 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
1201 sum.put_bulk += mp->stats[lcore_id].put_bulk;
1202 sum.put_objs += mp->stats[lcore_id].put_objs;
1203 sum.get_success_bulk += mp->stats[lcore_id].get_success_bulk;
1204 sum.get_success_objs += mp->stats[lcore_id].get_success_objs;
1205 sum.get_fail_bulk += mp->stats[lcore_id].get_fail_bulk;
1206 sum.get_fail_objs += mp->stats[lcore_id].get_fail_objs;
1207 sum.get_success_blks += mp->stats[lcore_id].get_success_blks;
1208 sum.get_fail_blks += mp->stats[lcore_id].get_fail_blks;
1210 fprintf(f, " stats:\n");
1211 fprintf(f, " put_bulk=%"PRIu64"\n", sum.put_bulk);
1212 fprintf(f, " put_objs=%"PRIu64"\n", sum.put_objs);
1213 fprintf(f, " get_success_bulk=%"PRIu64"\n", sum.get_success_bulk);
1214 fprintf(f, " get_success_objs=%"PRIu64"\n", sum.get_success_objs);
1215 fprintf(f, " get_fail_bulk=%"PRIu64"\n", sum.get_fail_bulk);
1216 fprintf(f, " get_fail_objs=%"PRIu64"\n", sum.get_fail_objs);
1217 if (info.contig_block_size > 0) {
1218 fprintf(f, " get_success_blks=%"PRIu64"\n",
1219 sum.get_success_blks);
1220 fprintf(f, " get_fail_blks=%"PRIu64"\n", sum.get_fail_blks);
1223 fprintf(f, " no statistics available\n");
1226 rte_mempool_audit(mp);
1229 /* dump the status of all mempools on the console */
1231 rte_mempool_list_dump(FILE *f)
1233 struct rte_mempool *mp = NULL;
1234 struct rte_tailq_entry *te;
1235 struct rte_mempool_list *mempool_list;
1237 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1239 rte_mcfg_mempool_read_lock();
1241 TAILQ_FOREACH(te, mempool_list, next) {
1242 mp = (struct rte_mempool *) te->data;
1243 rte_mempool_dump(f, mp);
1246 rte_mcfg_mempool_read_unlock();
1249 /* search a mempool from its name */
1250 struct rte_mempool *
1251 rte_mempool_lookup(const char *name)
1253 struct rte_mempool *mp = NULL;
1254 struct rte_tailq_entry *te;
1255 struct rte_mempool_list *mempool_list;
1257 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1259 rte_mcfg_mempool_read_lock();
1261 TAILQ_FOREACH(te, mempool_list, next) {
1262 mp = (struct rte_mempool *) te->data;
1263 if (strncmp(name, mp->name, RTE_MEMPOOL_NAMESIZE) == 0)
1267 rte_mcfg_mempool_read_unlock();
1277 void rte_mempool_walk(void (*func)(struct rte_mempool *, void *),
1280 struct rte_tailq_entry *te = NULL;
1281 struct rte_mempool_list *mempool_list;
1284 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1286 rte_mcfg_mempool_read_lock();
1288 TAILQ_FOREACH_SAFE(te, mempool_list, next, tmp_te) {
1289 (*func)((struct rte_mempool *) te->data, arg);
1292 rte_mcfg_mempool_read_unlock();