4 * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
5 * Copyright(c) 2016 6WIND S.A.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
18 * * Neither the name of Intel Corporation nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
25 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
26 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
27 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
28 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
32 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
42 #include <sys/queue.h>
45 #include <rte_common.h>
47 #include <rte_debug.h>
48 #include <rte_memory.h>
49 #include <rte_memzone.h>
50 #include <rte_malloc.h>
51 #include <rte_atomic.h>
52 #include <rte_launch.h>
54 #include <rte_eal_memconfig.h>
55 #include <rte_per_lcore.h>
56 #include <rte_lcore.h>
57 #include <rte_branch_prediction.h>
58 #include <rte_errno.h>
59 #include <rte_string_fns.h>
60 #include <rte_spinlock.h>
62 #include "rte_mempool.h"
64 TAILQ_HEAD(rte_mempool_list, rte_tailq_entry);
66 static struct rte_tailq_elem rte_mempool_tailq = {
67 .name = "RTE_MEMPOOL",
69 EAL_REGISTER_TAILQ(rte_mempool_tailq)
71 #define CACHE_FLUSHTHRESH_MULTIPLIER 1.5
72 #define CALC_CACHE_FLUSHTHRESH(c) \
73 ((typeof(c))((c) * CACHE_FLUSHTHRESH_MULTIPLIER))
76 * return the greatest common divisor between a and b (fast algorithm)
79 static unsigned get_gcd(unsigned a, unsigned b)
104 * Depending on memory configuration, objects addresses are spread
105 * between channels and ranks in RAM: the pool allocator will add
106 * padding between objects. This function return the new size of the
109 static unsigned optimize_object_size(unsigned obj_size)
111 unsigned nrank, nchan;
112 unsigned new_obj_size;
114 /* get number of channels */
115 nchan = rte_memory_get_nchannel();
119 nrank = rte_memory_get_nrank();
123 /* process new object size */
124 new_obj_size = (obj_size + RTE_MEMPOOL_ALIGN_MASK) / RTE_MEMPOOL_ALIGN;
125 while (get_gcd(new_obj_size, nrank * nchan) != 1)
127 return new_obj_size * RTE_MEMPOOL_ALIGN;
131 mempool_add_elem(struct rte_mempool *mp, void *obj, phys_addr_t physaddr)
133 struct rte_mempool_objhdr *hdr;
134 struct rte_mempool_objtlr *tlr __rte_unused;
136 /* set mempool ptr in header */
137 hdr = RTE_PTR_SUB(obj, sizeof(*hdr));
139 hdr->physaddr = physaddr;
140 STAILQ_INSERT_TAIL(&mp->elt_list, hdr, next);
141 mp->populated_size++;
143 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
144 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE2;
145 tlr = __mempool_get_trailer(obj);
146 tlr->cookie = RTE_MEMPOOL_TRAILER_COOKIE;
149 /* enqueue in ring */
150 rte_mempool_ops_enqueue_bulk(mp, &obj, 1);
153 /* call obj_cb() for each mempool element */
155 rte_mempool_obj_iter(struct rte_mempool *mp,
156 rte_mempool_obj_cb_t *obj_cb, void *obj_cb_arg)
158 struct rte_mempool_objhdr *hdr;
162 STAILQ_FOREACH(hdr, &mp->elt_list, next) {
163 obj = (char *)hdr + sizeof(*hdr);
164 obj_cb(mp, obj_cb_arg, obj, n);
171 /* call mem_cb() for each mempool memory chunk */
173 rte_mempool_mem_iter(struct rte_mempool *mp,
174 rte_mempool_mem_cb_t *mem_cb, void *mem_cb_arg)
176 struct rte_mempool_memhdr *hdr;
179 STAILQ_FOREACH(hdr, &mp->mem_list, next) {
180 mem_cb(mp, mem_cb_arg, hdr, n);
187 /* get the header, trailer and total size of a mempool element. */
189 rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
190 struct rte_mempool_objsz *sz)
192 struct rte_mempool_objsz lsz;
194 sz = (sz != NULL) ? sz : &lsz;
196 sz->header_size = sizeof(struct rte_mempool_objhdr);
197 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0)
198 sz->header_size = RTE_ALIGN_CEIL(sz->header_size,
201 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
202 sz->trailer_size = sizeof(struct rte_mempool_objtlr);
204 sz->trailer_size = 0;
207 /* element size is 8 bytes-aligned at least */
208 sz->elt_size = RTE_ALIGN_CEIL(elt_size, sizeof(uint64_t));
210 /* expand trailer to next cache line */
211 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0) {
212 sz->total_size = sz->header_size + sz->elt_size +
214 sz->trailer_size += ((RTE_MEMPOOL_ALIGN -
215 (sz->total_size & RTE_MEMPOOL_ALIGN_MASK)) &
216 RTE_MEMPOOL_ALIGN_MASK);
220 * increase trailer to add padding between objects in order to
221 * spread them across memory channels/ranks
223 if ((flags & MEMPOOL_F_NO_SPREAD) == 0) {
225 new_size = optimize_object_size(sz->header_size + sz->elt_size +
227 sz->trailer_size = new_size - sz->header_size - sz->elt_size;
230 /* this is the size of an object, including header and trailer */
231 sz->total_size = sz->header_size + sz->elt_size + sz->trailer_size;
233 return sz->total_size;
238 * Calculate maximum amount of memory required to store given number of objects.
241 rte_mempool_xmem_size(uint32_t elt_num, size_t total_elt_sz, uint32_t pg_shift,
244 size_t obj_per_page, pg_num, pg_sz;
247 mask = MEMPOOL_F_CAPA_BLK_ALIGNED_OBJECTS | MEMPOOL_F_CAPA_PHYS_CONTIG;
248 if ((flags & mask) == mask)
249 /* alignment need one additional object */
252 if (total_elt_sz == 0)
256 return total_elt_sz * elt_num;
258 pg_sz = (size_t)1 << pg_shift;
259 obj_per_page = pg_sz / total_elt_sz;
260 if (obj_per_page == 0)
261 return RTE_ALIGN_CEIL(total_elt_sz, pg_sz) * elt_num;
263 pg_num = (elt_num + obj_per_page - 1) / obj_per_page;
264 return pg_num << pg_shift;
268 * Calculate how much memory would be actually required with the
269 * given memory footprint to store required number of elements.
272 rte_mempool_xmem_usage(__rte_unused void *vaddr, uint32_t elt_num,
273 size_t total_elt_sz, const phys_addr_t paddr[], uint32_t pg_num,
274 uint32_t pg_shift, unsigned int flags)
276 uint32_t elt_cnt = 0;
277 phys_addr_t start, end;
279 size_t pg_sz = (size_t)1 << pg_shift;
282 mask = MEMPOOL_F_CAPA_BLK_ALIGNED_OBJECTS | MEMPOOL_F_CAPA_PHYS_CONTIG;
283 if ((flags & mask) == mask)
284 /* alignment need one additional object */
287 /* if paddr is NULL, assume contiguous memory */
290 end = pg_sz * pg_num;
294 end = paddr[0] + pg_sz;
297 while (elt_cnt < elt_num) {
299 if (end - start >= total_elt_sz) {
300 /* enough contiguous memory, add an object */
301 start += total_elt_sz;
303 } else if (paddr_idx < pg_num) {
304 /* no room to store one obj, add a page */
305 if (end == paddr[paddr_idx]) {
308 start = paddr[paddr_idx];
309 end = paddr[paddr_idx] + pg_sz;
314 /* no more page, return how many elements fit */
315 return -(size_t)elt_cnt;
319 return (size_t)paddr_idx << pg_shift;
322 /* free a memchunk allocated with rte_memzone_reserve() */
324 rte_mempool_memchunk_mz_free(__rte_unused struct rte_mempool_memhdr *memhdr,
327 const struct rte_memzone *mz = opaque;
328 rte_memzone_free(mz);
331 /* Free memory chunks used by a mempool. Objects must be in pool */
333 rte_mempool_free_memchunks(struct rte_mempool *mp)
335 struct rte_mempool_memhdr *memhdr;
338 while (!STAILQ_EMPTY(&mp->elt_list)) {
339 rte_mempool_ops_dequeue_bulk(mp, &elt, 1);
341 STAILQ_REMOVE_HEAD(&mp->elt_list, next);
342 mp->populated_size--;
345 while (!STAILQ_EMPTY(&mp->mem_list)) {
346 memhdr = STAILQ_FIRST(&mp->mem_list);
347 STAILQ_REMOVE_HEAD(&mp->mem_list, next);
348 if (memhdr->free_cb != NULL)
349 memhdr->free_cb(memhdr, memhdr->opaque);
355 /* Add objects in the pool, using a physically contiguous memory
356 * zone. Return the number of objects added, or a negative value
360 rte_mempool_populate_phys(struct rte_mempool *mp, char *vaddr,
361 phys_addr_t paddr, size_t len, rte_mempool_memchunk_free_cb_t *free_cb,
364 unsigned total_elt_sz;
367 struct rte_mempool_memhdr *memhdr;
370 /* Notify memory area to mempool */
371 ret = rte_mempool_ops_register_memory_area(mp, vaddr, paddr, len);
372 if (ret != -ENOTSUP && ret < 0)
375 /* create the internal ring if not already done */
376 if ((mp->flags & MEMPOOL_F_POOL_CREATED) == 0) {
377 ret = rte_mempool_ops_alloc(mp);
380 mp->flags |= MEMPOOL_F_POOL_CREATED;
383 /* mempool is already populated */
384 if (mp->populated_size >= mp->size)
387 total_elt_sz = mp->header_size + mp->elt_size + mp->trailer_size;
389 /* Detect pool area has sufficient space for elements */
390 if (mp->flags & MEMPOOL_F_CAPA_PHYS_CONTIG) {
391 if (len < total_elt_sz * mp->size) {
392 RTE_LOG(ERR, MEMPOOL,
393 "pool area %" PRIx64 " not enough\n",
399 memhdr = rte_zmalloc("MEMPOOL_MEMHDR", sizeof(*memhdr), 0);
404 memhdr->addr = vaddr;
405 memhdr->phys_addr = paddr;
407 memhdr->free_cb = free_cb;
408 memhdr->opaque = opaque;
410 if (mp->flags & MEMPOOL_F_CAPA_BLK_ALIGNED_OBJECTS)
411 /* align object start address to a multiple of total_elt_sz */
412 off = total_elt_sz - ((uintptr_t)vaddr % total_elt_sz);
413 else if (mp->flags & MEMPOOL_F_NO_CACHE_ALIGN)
414 off = RTE_PTR_ALIGN_CEIL(vaddr, 8) - vaddr;
416 off = RTE_PTR_ALIGN_CEIL(vaddr, RTE_CACHE_LINE_SIZE) - vaddr;
418 while (off + total_elt_sz <= len && mp->populated_size < mp->size) {
419 off += mp->header_size;
420 if (paddr == RTE_BAD_PHYS_ADDR)
421 mempool_add_elem(mp, (char *)vaddr + off,
424 mempool_add_elem(mp, (char *)vaddr + off, paddr + off);
425 off += mp->elt_size + mp->trailer_size;
429 /* not enough room to store one object */
433 STAILQ_INSERT_TAIL(&mp->mem_list, memhdr, next);
438 /* Add objects in the pool, using a table of physical pages. Return the
439 * number of objects added, or a negative value on error.
442 rte_mempool_populate_phys_tab(struct rte_mempool *mp, char *vaddr,
443 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift,
444 rte_mempool_memchunk_free_cb_t *free_cb, void *opaque)
448 size_t pg_sz = (size_t)1 << pg_shift;
450 /* mempool must not be populated */
451 if (mp->nb_mem_chunks != 0)
454 if (mp->flags & MEMPOOL_F_NO_PHYS_CONTIG)
455 return rte_mempool_populate_phys(mp, vaddr, RTE_BAD_PHYS_ADDR,
456 pg_num * pg_sz, free_cb, opaque);
458 for (i = 0; i < pg_num && mp->populated_size < mp->size; i += n) {
460 /* populate with the largest group of contiguous pages */
461 for (n = 1; (i + n) < pg_num &&
462 paddr[i + n - 1] + pg_sz == paddr[i + n]; n++)
465 ret = rte_mempool_populate_phys(mp, vaddr + i * pg_sz,
466 paddr[i], n * pg_sz, free_cb, opaque);
468 rte_mempool_free_memchunks(mp);
471 /* no need to call the free callback for next chunks */
478 /* Populate the mempool with a virtual area. Return the number of
479 * objects added, or a negative value on error.
482 rte_mempool_populate_virt(struct rte_mempool *mp, char *addr,
483 size_t len, size_t pg_sz, rte_mempool_memchunk_free_cb_t *free_cb,
487 size_t off, phys_len;
490 /* mempool must not be populated */
491 if (mp->nb_mem_chunks != 0)
493 /* address and len must be page-aligned */
494 if (RTE_PTR_ALIGN_CEIL(addr, pg_sz) != addr)
496 if (RTE_ALIGN_CEIL(len, pg_sz) != len)
499 if (mp->flags & MEMPOOL_F_NO_PHYS_CONTIG)
500 return rte_mempool_populate_phys(mp, addr, RTE_BAD_PHYS_ADDR,
501 len, free_cb, opaque);
503 for (off = 0; off + pg_sz <= len &&
504 mp->populated_size < mp->size; off += phys_len) {
506 paddr = rte_mem_virt2phy(addr + off);
508 if (paddr == RTE_BAD_PHYS_ADDR && rte_eal_has_hugepages()) {
513 /* populate with the largest group of contiguous pages */
514 for (phys_len = pg_sz; off + phys_len < len; phys_len += pg_sz) {
515 phys_addr_t paddr_tmp;
517 paddr_tmp = rte_mem_virt2phy(addr + off + phys_len);
519 if (paddr_tmp != paddr + phys_len)
523 ret = rte_mempool_populate_phys(mp, addr + off, paddr,
524 phys_len, free_cb, opaque);
527 /* no need to call the free callback for next chunks */
535 rte_mempool_free_memchunks(mp);
539 /* Default function to populate the mempool: allocate memory in memzones,
540 * and populate them. Return the number of objects added, or a negative
544 rte_mempool_populate_default(struct rte_mempool *mp)
546 unsigned int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
547 char mz_name[RTE_MEMZONE_NAMESIZE];
548 const struct rte_memzone *mz;
549 size_t size, total_elt_sz, align, pg_sz, pg_shift;
552 unsigned int mp_flags;
555 /* mempool must not be populated */
556 if (mp->nb_mem_chunks != 0)
559 /* Get mempool capabilities */
561 ret = rte_mempool_ops_get_capabilities(mp, &mp_flags);
562 if ((ret < 0) && (ret != -ENOTSUP))
565 /* update mempool capabilities */
566 mp->flags |= mp_flags;
568 if (rte_eal_has_hugepages()) {
569 pg_shift = 0; /* not needed, zone is physically contiguous */
571 align = RTE_CACHE_LINE_SIZE;
573 pg_sz = getpagesize();
574 pg_shift = rte_bsf32(pg_sz);
578 total_elt_sz = mp->header_size + mp->elt_size + mp->trailer_size;
579 for (mz_id = 0, n = mp->size; n > 0; mz_id++, n -= ret) {
580 size = rte_mempool_xmem_size(n, total_elt_sz, pg_shift,
583 ret = snprintf(mz_name, sizeof(mz_name),
584 RTE_MEMPOOL_MZ_FORMAT "_%d", mp->name, mz_id);
585 if (ret < 0 || ret >= (int)sizeof(mz_name)) {
590 mz = rte_memzone_reserve_aligned(mz_name, size,
591 mp->socket_id, mz_flags, align);
592 /* not enough memory, retry with the biggest zone we have */
594 mz = rte_memzone_reserve_aligned(mz_name, 0,
595 mp->socket_id, mz_flags, align);
601 if (mp->flags & MEMPOOL_F_NO_PHYS_CONTIG)
602 paddr = RTE_BAD_PHYS_ADDR;
604 paddr = mz->phys_addr;
606 if (rte_eal_has_hugepages())
607 ret = rte_mempool_populate_phys(mp, mz->addr,
609 rte_mempool_memchunk_mz_free,
610 (void *)(uintptr_t)mz);
612 ret = rte_mempool_populate_virt(mp, mz->addr,
614 rte_mempool_memchunk_mz_free,
615 (void *)(uintptr_t)mz);
617 rte_memzone_free(mz);
625 rte_mempool_free_memchunks(mp);
629 /* return the memory size required for mempool objects in anonymous mem */
631 get_anon_size(const struct rte_mempool *mp)
633 size_t size, total_elt_sz, pg_sz, pg_shift;
635 pg_sz = getpagesize();
636 pg_shift = rte_bsf32(pg_sz);
637 total_elt_sz = mp->header_size + mp->elt_size + mp->trailer_size;
638 size = rte_mempool_xmem_size(mp->size, total_elt_sz, pg_shift,
644 /* unmap a memory zone mapped by rte_mempool_populate_anon() */
646 rte_mempool_memchunk_anon_free(struct rte_mempool_memhdr *memhdr,
649 munmap(opaque, get_anon_size(memhdr->mp));
652 /* populate the mempool with an anonymous mapping */
654 rte_mempool_populate_anon(struct rte_mempool *mp)
660 /* mempool is already populated, error */
661 if (!STAILQ_EMPTY(&mp->mem_list)) {
666 /* get chunk of virtually continuous memory */
667 size = get_anon_size(mp);
668 addr = mmap(NULL, size, PROT_READ | PROT_WRITE,
669 MAP_SHARED | MAP_ANONYMOUS, -1, 0);
670 if (addr == MAP_FAILED) {
674 /* can't use MMAP_LOCKED, it does not exist on BSD */
675 if (mlock(addr, size) < 0) {
681 ret = rte_mempool_populate_virt(mp, addr, size, getpagesize(),
682 rte_mempool_memchunk_anon_free, addr);
686 return mp->populated_size;
689 rte_mempool_free_memchunks(mp);
695 rte_mempool_free(struct rte_mempool *mp)
697 struct rte_mempool_list *mempool_list = NULL;
698 struct rte_tailq_entry *te;
703 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
704 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
705 /* find out tailq entry */
706 TAILQ_FOREACH(te, mempool_list, next) {
707 if (te->data == (void *)mp)
712 TAILQ_REMOVE(mempool_list, te, next);
715 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
717 rte_mempool_free_memchunks(mp);
718 rte_mempool_ops_free(mp);
719 rte_memzone_free(mp->mz);
723 mempool_cache_init(struct rte_mempool_cache *cache, uint32_t size)
726 cache->flushthresh = CALC_CACHE_FLUSHTHRESH(size);
731 * Create and initialize a cache for objects that are retrieved from and
732 * returned to an underlying mempool. This structure is identical to the
733 * local_cache[lcore_id] pointed to by the mempool structure.
735 struct rte_mempool_cache *
736 rte_mempool_cache_create(uint32_t size, int socket_id)
738 struct rte_mempool_cache *cache;
740 if (size == 0 || size > RTE_MEMPOOL_CACHE_MAX_SIZE) {
745 cache = rte_zmalloc_socket("MEMPOOL_CACHE", sizeof(*cache),
746 RTE_CACHE_LINE_SIZE, socket_id);
748 RTE_LOG(ERR, MEMPOOL, "Cannot allocate mempool cache.\n");
753 mempool_cache_init(cache, size);
759 * Free a cache. It's the responsibility of the user to make sure that any
760 * remaining objects in the cache are flushed to the corresponding
764 rte_mempool_cache_free(struct rte_mempool_cache *cache)
769 /* create an empty mempool */
771 rte_mempool_create_empty(const char *name, unsigned n, unsigned elt_size,
772 unsigned cache_size, unsigned private_data_size,
773 int socket_id, unsigned flags)
775 char mz_name[RTE_MEMZONE_NAMESIZE];
776 struct rte_mempool_list *mempool_list;
777 struct rte_mempool *mp = NULL;
778 struct rte_tailq_entry *te = NULL;
779 const struct rte_memzone *mz = NULL;
781 unsigned int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
782 struct rte_mempool_objsz objsz;
786 /* compilation-time checks */
787 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool) &
788 RTE_CACHE_LINE_MASK) != 0);
789 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_cache) &
790 RTE_CACHE_LINE_MASK) != 0);
791 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
792 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_debug_stats) &
793 RTE_CACHE_LINE_MASK) != 0);
794 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, stats) &
795 RTE_CACHE_LINE_MASK) != 0);
798 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
800 /* asked cache too big */
801 if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE ||
802 CALC_CACHE_FLUSHTHRESH(cache_size) > n) {
807 /* "no cache align" imply "no spread" */
808 if (flags & MEMPOOL_F_NO_CACHE_ALIGN)
809 flags |= MEMPOOL_F_NO_SPREAD;
811 /* calculate mempool object sizes. */
812 if (!rte_mempool_calc_obj_size(elt_size, flags, &objsz)) {
817 rte_rwlock_write_lock(RTE_EAL_MEMPOOL_RWLOCK);
820 * reserve a memory zone for this mempool: private data is
823 private_data_size = (private_data_size +
824 RTE_MEMPOOL_ALIGN_MASK) & (~RTE_MEMPOOL_ALIGN_MASK);
827 /* try to allocate tailq entry */
828 te = rte_zmalloc("MEMPOOL_TAILQ_ENTRY", sizeof(*te), 0);
830 RTE_LOG(ERR, MEMPOOL, "Cannot allocate tailq entry!\n");
834 mempool_size = MEMPOOL_HEADER_SIZE(mp, cache_size);
835 mempool_size += private_data_size;
836 mempool_size = RTE_ALIGN_CEIL(mempool_size, RTE_MEMPOOL_ALIGN);
838 ret = snprintf(mz_name, sizeof(mz_name), RTE_MEMPOOL_MZ_FORMAT, name);
839 if (ret < 0 || ret >= (int)sizeof(mz_name)) {
840 rte_errno = ENAMETOOLONG;
844 mz = rte_memzone_reserve(mz_name, mempool_size, socket_id, mz_flags);
848 /* init the mempool structure */
850 memset(mp, 0, MEMPOOL_HEADER_SIZE(mp, cache_size));
851 ret = snprintf(mp->name, sizeof(mp->name), "%s", name);
852 if (ret < 0 || ret >= (int)sizeof(mp->name)) {
853 rte_errno = ENAMETOOLONG;
859 mp->socket_id = socket_id;
860 mp->elt_size = objsz.elt_size;
861 mp->header_size = objsz.header_size;
862 mp->trailer_size = objsz.trailer_size;
863 /* Size of default caches, zero means disabled. */
864 mp->cache_size = cache_size;
865 mp->private_data_size = private_data_size;
866 STAILQ_INIT(&mp->elt_list);
867 STAILQ_INIT(&mp->mem_list);
870 * local_cache pointer is set even if cache_size is zero.
871 * The local_cache points to just past the elt_pa[] array.
873 mp->local_cache = (struct rte_mempool_cache *)
874 RTE_PTR_ADD(mp, MEMPOOL_HEADER_SIZE(mp, 0));
876 /* Init all default caches. */
877 if (cache_size != 0) {
878 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
879 mempool_cache_init(&mp->local_cache[lcore_id],
885 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
886 TAILQ_INSERT_TAIL(mempool_list, te, next);
887 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
888 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
893 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
895 rte_mempool_free(mp);
899 /* create the mempool */
901 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
902 unsigned cache_size, unsigned private_data_size,
903 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
904 rte_mempool_obj_cb_t *obj_init, void *obj_init_arg,
905 int socket_id, unsigned flags)
908 struct rte_mempool *mp;
910 mp = rte_mempool_create_empty(name, n, elt_size, cache_size,
911 private_data_size, socket_id, flags);
916 * Since we have 4 combinations of the SP/SC/MP/MC examine the flags to
917 * set the correct index into the table of ops structs.
919 if ((flags & MEMPOOL_F_SP_PUT) && (flags & MEMPOOL_F_SC_GET))
920 ret = rte_mempool_set_ops_byname(mp, "ring_sp_sc", NULL);
921 else if (flags & MEMPOOL_F_SP_PUT)
922 ret = rte_mempool_set_ops_byname(mp, "ring_sp_mc", NULL);
923 else if (flags & MEMPOOL_F_SC_GET)
924 ret = rte_mempool_set_ops_byname(mp, "ring_mp_sc", NULL);
926 ret = rte_mempool_set_ops_byname(mp, "ring_mp_mc", NULL);
931 /* call the mempool priv initializer */
933 mp_init(mp, mp_init_arg);
935 if (rte_mempool_populate_default(mp) < 0)
938 /* call the object initializers */
940 rte_mempool_obj_iter(mp, obj_init, obj_init_arg);
945 rte_mempool_free(mp);
950 * Create the mempool over already allocated chunk of memory.
951 * That external memory buffer can consists of physically disjoint pages.
952 * Setting vaddr to NULL, makes mempool to fallback to rte_mempool_create()
956 rte_mempool_xmem_create(const char *name, unsigned n, unsigned elt_size,
957 unsigned cache_size, unsigned private_data_size,
958 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
959 rte_mempool_obj_cb_t *obj_init, void *obj_init_arg,
960 int socket_id, unsigned flags, void *vaddr,
961 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
963 struct rte_mempool *mp = NULL;
966 /* no virtual address supplied, use rte_mempool_create() */
968 return rte_mempool_create(name, n, elt_size, cache_size,
969 private_data_size, mp_init, mp_init_arg,
970 obj_init, obj_init_arg, socket_id, flags);
972 /* check that we have both VA and PA */
978 /* Check that pg_shift parameter is valid. */
979 if (pg_shift > MEMPOOL_PG_SHIFT_MAX) {
984 mp = rte_mempool_create_empty(name, n, elt_size, cache_size,
985 private_data_size, socket_id, flags);
989 /* call the mempool priv initializer */
991 mp_init(mp, mp_init_arg);
993 ret = rte_mempool_populate_phys_tab(mp, vaddr, paddr, pg_num, pg_shift,
995 if (ret < 0 || ret != (int)mp->size)
998 /* call the object initializers */
1000 rte_mempool_obj_iter(mp, obj_init, obj_init_arg);
1005 rte_mempool_free(mp);
1009 /* Return the number of entries in the mempool */
1011 rte_mempool_avail_count(const struct rte_mempool *mp)
1016 count = rte_mempool_ops_get_count(mp);
1018 if (mp->cache_size == 0)
1021 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
1022 count += mp->local_cache[lcore_id].len;
1025 * due to race condition (access to len is not locked), the
1026 * total can be greater than size... so fix the result
1028 if (count > mp->size)
1033 /* return the number of entries allocated from the mempool */
1035 rte_mempool_in_use_count(const struct rte_mempool *mp)
1037 return mp->size - rte_mempool_avail_count(mp);
1040 /* dump the cache status */
1042 rte_mempool_dump_cache(FILE *f, const struct rte_mempool *mp)
1046 unsigned cache_count;
1048 fprintf(f, " internal cache infos:\n");
1049 fprintf(f, " cache_size=%"PRIu32"\n", mp->cache_size);
1051 if (mp->cache_size == 0)
1054 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
1055 cache_count = mp->local_cache[lcore_id].len;
1056 fprintf(f, " cache_count[%u]=%"PRIu32"\n",
1057 lcore_id, cache_count);
1058 count += cache_count;
1060 fprintf(f, " total_cache_count=%u\n", count);
1064 #ifndef __INTEL_COMPILER
1065 #pragma GCC diagnostic ignored "-Wcast-qual"
1068 /* check and update cookies or panic (internal) */
1069 void rte_mempool_check_cookies(const struct rte_mempool *mp,
1070 void * const *obj_table_const, unsigned n, int free)
1072 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1073 struct rte_mempool_objhdr *hdr;
1074 struct rte_mempool_objtlr *tlr;
1080 /* Force to drop the "const" attribute. This is done only when
1081 * DEBUG is enabled */
1082 tmp = (void *) obj_table_const;
1088 if (rte_mempool_from_obj(obj) != mp)
1089 rte_panic("MEMPOOL: object is owned by another "
1092 hdr = __mempool_get_header(obj);
1093 cookie = hdr->cookie;
1096 if (cookie != RTE_MEMPOOL_HEADER_COOKIE1) {
1097 RTE_LOG(CRIT, MEMPOOL,
1098 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1099 obj, (const void *) mp, cookie);
1100 rte_panic("MEMPOOL: bad header cookie (put)\n");
1102 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE2;
1103 } else if (free == 1) {
1104 if (cookie != RTE_MEMPOOL_HEADER_COOKIE2) {
1105 RTE_LOG(CRIT, MEMPOOL,
1106 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1107 obj, (const void *) mp, cookie);
1108 rte_panic("MEMPOOL: bad header cookie (get)\n");
1110 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE1;
1111 } else if (free == 2) {
1112 if (cookie != RTE_MEMPOOL_HEADER_COOKIE1 &&
1113 cookie != RTE_MEMPOOL_HEADER_COOKIE2) {
1114 RTE_LOG(CRIT, MEMPOOL,
1115 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1116 obj, (const void *) mp, cookie);
1117 rte_panic("MEMPOOL: bad header cookie (audit)\n");
1120 tlr = __mempool_get_trailer(obj);
1121 cookie = tlr->cookie;
1122 if (cookie != RTE_MEMPOOL_TRAILER_COOKIE) {
1123 RTE_LOG(CRIT, MEMPOOL,
1124 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1125 obj, (const void *) mp, cookie);
1126 rte_panic("MEMPOOL: bad trailer cookie\n");
1131 RTE_SET_USED(obj_table_const);
1137 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1139 mempool_obj_audit(struct rte_mempool *mp, __rte_unused void *opaque,
1140 void *obj, __rte_unused unsigned idx)
1142 __mempool_check_cookies(mp, &obj, 1, 2);
1146 mempool_audit_cookies(struct rte_mempool *mp)
1150 num = rte_mempool_obj_iter(mp, mempool_obj_audit, NULL);
1151 if (num != mp->size) {
1152 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
1153 "iterated only over %u elements\n",
1158 #define mempool_audit_cookies(mp) do {} while(0)
1161 #ifndef __INTEL_COMPILER
1162 #pragma GCC diagnostic error "-Wcast-qual"
1165 /* check cookies before and after objects */
1167 mempool_audit_cache(const struct rte_mempool *mp)
1169 /* check cache size consistency */
1172 if (mp->cache_size == 0)
1175 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
1176 const struct rte_mempool_cache *cache;
1177 cache = &mp->local_cache[lcore_id];
1178 if (cache->len > cache->flushthresh) {
1179 RTE_LOG(CRIT, MEMPOOL, "badness on cache[%u]\n",
1181 rte_panic("MEMPOOL: invalid cache len\n");
1186 /* check the consistency of mempool (size, cookies, ...) */
1188 rte_mempool_audit(struct rte_mempool *mp)
1190 mempool_audit_cache(mp);
1191 mempool_audit_cookies(mp);
1193 /* For case where mempool DEBUG is not set, and cache size is 0 */
1197 /* dump the status of the mempool on the console */
1199 rte_mempool_dump(FILE *f, struct rte_mempool *mp)
1201 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1202 struct rte_mempool_debug_stats sum;
1205 struct rte_mempool_memhdr *memhdr;
1206 unsigned common_count;
1207 unsigned cache_count;
1210 RTE_ASSERT(f != NULL);
1211 RTE_ASSERT(mp != NULL);
1213 fprintf(f, "mempool <%s>@%p\n", mp->name, mp);
1214 fprintf(f, " flags=%x\n", mp->flags);
1215 fprintf(f, " pool=%p\n", mp->pool_data);
1216 fprintf(f, " phys_addr=0x%" PRIx64 "\n", mp->mz->phys_addr);
1217 fprintf(f, " nb_mem_chunks=%u\n", mp->nb_mem_chunks);
1218 fprintf(f, " size=%"PRIu32"\n", mp->size);
1219 fprintf(f, " populated_size=%"PRIu32"\n", mp->populated_size);
1220 fprintf(f, " header_size=%"PRIu32"\n", mp->header_size);
1221 fprintf(f, " elt_size=%"PRIu32"\n", mp->elt_size);
1222 fprintf(f, " trailer_size=%"PRIu32"\n", mp->trailer_size);
1223 fprintf(f, " total_obj_size=%"PRIu32"\n",
1224 mp->header_size + mp->elt_size + mp->trailer_size);
1226 fprintf(f, " private_data_size=%"PRIu32"\n", mp->private_data_size);
1228 STAILQ_FOREACH(memhdr, &mp->mem_list, next)
1229 mem_len += memhdr->len;
1231 fprintf(f, " avg bytes/object=%#Lf\n",
1232 (long double)mem_len / mp->size);
1235 cache_count = rte_mempool_dump_cache(f, mp);
1236 common_count = rte_mempool_ops_get_count(mp);
1237 if ((cache_count + common_count) > mp->size)
1238 common_count = mp->size - cache_count;
1239 fprintf(f, " common_pool_count=%u\n", common_count);
1241 /* sum and dump statistics */
1242 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1243 memset(&sum, 0, sizeof(sum));
1244 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
1245 sum.put_bulk += mp->stats[lcore_id].put_bulk;
1246 sum.put_objs += mp->stats[lcore_id].put_objs;
1247 sum.get_success_bulk += mp->stats[lcore_id].get_success_bulk;
1248 sum.get_success_objs += mp->stats[lcore_id].get_success_objs;
1249 sum.get_fail_bulk += mp->stats[lcore_id].get_fail_bulk;
1250 sum.get_fail_objs += mp->stats[lcore_id].get_fail_objs;
1252 fprintf(f, " stats:\n");
1253 fprintf(f, " put_bulk=%"PRIu64"\n", sum.put_bulk);
1254 fprintf(f, " put_objs=%"PRIu64"\n", sum.put_objs);
1255 fprintf(f, " get_success_bulk=%"PRIu64"\n", sum.get_success_bulk);
1256 fprintf(f, " get_success_objs=%"PRIu64"\n", sum.get_success_objs);
1257 fprintf(f, " get_fail_bulk=%"PRIu64"\n", sum.get_fail_bulk);
1258 fprintf(f, " get_fail_objs=%"PRIu64"\n", sum.get_fail_objs);
1260 fprintf(f, " no statistics available\n");
1263 rte_mempool_audit(mp);
1266 /* dump the status of all mempools on the console */
1268 rte_mempool_list_dump(FILE *f)
1270 struct rte_mempool *mp = NULL;
1271 struct rte_tailq_entry *te;
1272 struct rte_mempool_list *mempool_list;
1274 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1276 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
1278 TAILQ_FOREACH(te, mempool_list, next) {
1279 mp = (struct rte_mempool *) te->data;
1280 rte_mempool_dump(f, mp);
1283 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
1286 /* search a mempool from its name */
1287 struct rte_mempool *
1288 rte_mempool_lookup(const char *name)
1290 struct rte_mempool *mp = NULL;
1291 struct rte_tailq_entry *te;
1292 struct rte_mempool_list *mempool_list;
1294 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1296 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
1298 TAILQ_FOREACH(te, mempool_list, next) {
1299 mp = (struct rte_mempool *) te->data;
1300 if (strncmp(name, mp->name, RTE_MEMPOOL_NAMESIZE) == 0)
1304 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
1314 void rte_mempool_walk(void (*func)(struct rte_mempool *, void *),
1317 struct rte_tailq_entry *te = NULL;
1318 struct rte_mempool_list *mempool_list;
1321 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1323 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
1325 TAILQ_FOREACH_SAFE(te, mempool_list, next, tmp_te) {
1326 (*func)((struct rte_mempool *) te->data, arg);
1329 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);