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>
59 #include <rte_errno.h>
60 #include <rte_string_fns.h>
61 #include <rte_spinlock.h>
63 #include "rte_mempool.h"
65 TAILQ_HEAD(rte_mempool_list, rte_tailq_entry);
67 static struct rte_tailq_elem rte_mempool_tailq = {
68 .name = "RTE_MEMPOOL",
70 EAL_REGISTER_TAILQ(rte_mempool_tailq)
72 #define CACHE_FLUSHTHRESH_MULTIPLIER 1.5
73 #define CALC_CACHE_FLUSHTHRESH(c) \
74 ((typeof(c))((c) * CACHE_FLUSHTHRESH_MULTIPLIER))
77 * return the greatest common divisor between a and b (fast algorithm)
80 static unsigned get_gcd(unsigned a, unsigned b)
105 * Depending on memory configuration, objects addresses are spread
106 * between channels and ranks in RAM: the pool allocator will add
107 * padding between objects. This function return the new size of the
110 static unsigned optimize_object_size(unsigned obj_size)
112 unsigned nrank, nchan;
113 unsigned new_obj_size;
115 /* get number of channels */
116 nchan = rte_memory_get_nchannel();
120 nrank = rte_memory_get_nrank();
124 /* process new object size */
125 new_obj_size = (obj_size + RTE_MEMPOOL_ALIGN_MASK) / RTE_MEMPOOL_ALIGN;
126 while (get_gcd(new_obj_size, nrank * nchan) != 1)
128 return new_obj_size * RTE_MEMPOOL_ALIGN;
132 mempool_add_elem(struct rte_mempool *mp, void *obj, phys_addr_t physaddr)
134 struct rte_mempool_objhdr *hdr;
135 struct rte_mempool_objtlr *tlr __rte_unused;
137 /* set mempool ptr in header */
138 hdr = RTE_PTR_SUB(obj, sizeof(*hdr));
140 hdr->physaddr = physaddr;
141 STAILQ_INSERT_TAIL(&mp->elt_list, hdr, next);
142 mp->populated_size++;
144 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
145 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE2;
146 tlr = __mempool_get_trailer(obj);
147 tlr->cookie = RTE_MEMPOOL_TRAILER_COOKIE;
150 /* enqueue in ring */
151 rte_mempool_ops_enqueue_bulk(mp, &obj, 1);
154 /* call obj_cb() for each mempool element */
156 rte_mempool_obj_iter(struct rte_mempool *mp,
157 rte_mempool_obj_cb_t *obj_cb, void *obj_cb_arg)
159 struct rte_mempool_objhdr *hdr;
163 STAILQ_FOREACH(hdr, &mp->elt_list, next) {
164 obj = (char *)hdr + sizeof(*hdr);
165 obj_cb(mp, obj_cb_arg, obj, n);
172 /* call mem_cb() for each mempool memory chunk */
174 rte_mempool_mem_iter(struct rte_mempool *mp,
175 rte_mempool_mem_cb_t *mem_cb, void *mem_cb_arg)
177 struct rte_mempool_memhdr *hdr;
180 STAILQ_FOREACH(hdr, &mp->mem_list, next) {
181 mem_cb(mp, mem_cb_arg, hdr, n);
188 /* get the header, trailer and total size of a mempool element. */
190 rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
191 struct rte_mempool_objsz *sz)
193 struct rte_mempool_objsz lsz;
195 sz = (sz != NULL) ? sz : &lsz;
197 sz->header_size = sizeof(struct rte_mempool_objhdr);
198 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0)
199 sz->header_size = RTE_ALIGN_CEIL(sz->header_size,
202 sz->trailer_size = sizeof(struct rte_mempool_objtlr);
204 /* element size is 8 bytes-aligned at least */
205 sz->elt_size = RTE_ALIGN_CEIL(elt_size, sizeof(uint64_t));
207 /* expand trailer to next cache line */
208 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0) {
209 sz->total_size = sz->header_size + sz->elt_size +
211 sz->trailer_size += ((RTE_MEMPOOL_ALIGN -
212 (sz->total_size & RTE_MEMPOOL_ALIGN_MASK)) &
213 RTE_MEMPOOL_ALIGN_MASK);
217 * increase trailer to add padding between objects in order to
218 * spread them across memory channels/ranks
220 if ((flags & MEMPOOL_F_NO_SPREAD) == 0) {
222 new_size = optimize_object_size(sz->header_size + sz->elt_size +
224 sz->trailer_size = new_size - sz->header_size - sz->elt_size;
227 /* this is the size of an object, including header and trailer */
228 sz->total_size = sz->header_size + sz->elt_size + sz->trailer_size;
230 return sz->total_size;
235 * Calculate maximum amount of memory required to store given number of objects.
238 rte_mempool_xmem_size(uint32_t elt_num, size_t total_elt_sz, uint32_t pg_shift)
240 size_t obj_per_page, pg_num, pg_sz;
242 if (total_elt_sz == 0)
246 return total_elt_sz * elt_num;
248 pg_sz = (size_t)1 << pg_shift;
249 obj_per_page = pg_sz / total_elt_sz;
250 if (obj_per_page == 0)
251 return RTE_ALIGN_CEIL(total_elt_sz, pg_sz) * elt_num;
253 pg_num = (elt_num + obj_per_page - 1) / obj_per_page;
254 return pg_num << pg_shift;
258 * Calculate how much memory would be actually required with the
259 * given memory footprint to store required number of elements.
262 rte_mempool_xmem_usage(__rte_unused void *vaddr, uint32_t elt_num,
263 size_t total_elt_sz, const phys_addr_t paddr[], uint32_t pg_num,
266 uint32_t elt_cnt = 0;
267 phys_addr_t start, end;
269 size_t pg_sz = (size_t)1 << pg_shift;
271 /* if paddr is NULL, assume contiguous memory */
274 end = pg_sz * pg_num;
278 end = paddr[0] + pg_sz;
281 while (elt_cnt < elt_num) {
283 if (end - start >= total_elt_sz) {
284 /* enough contiguous memory, add an object */
285 start += total_elt_sz;
287 } else if (paddr_idx < pg_num) {
288 /* no room to store one obj, add a page */
289 if (end == paddr[paddr_idx]) {
292 start = paddr[paddr_idx];
293 end = paddr[paddr_idx] + pg_sz;
298 /* no more page, return how many elements fit */
299 return -(size_t)elt_cnt;
303 return (size_t)paddr_idx << pg_shift;
306 /* free a memchunk allocated with rte_memzone_reserve() */
308 rte_mempool_memchunk_mz_free(__rte_unused struct rte_mempool_memhdr *memhdr,
311 const struct rte_memzone *mz = opaque;
312 rte_memzone_free(mz);
315 /* Free memory chunks used by a mempool. Objects must be in pool */
317 rte_mempool_free_memchunks(struct rte_mempool *mp)
319 struct rte_mempool_memhdr *memhdr;
322 while (!STAILQ_EMPTY(&mp->elt_list)) {
323 rte_mempool_ops_dequeue_bulk(mp, &elt, 1);
325 STAILQ_REMOVE_HEAD(&mp->elt_list, next);
326 mp->populated_size--;
329 while (!STAILQ_EMPTY(&mp->mem_list)) {
330 memhdr = STAILQ_FIRST(&mp->mem_list);
331 STAILQ_REMOVE_HEAD(&mp->mem_list, next);
332 if (memhdr->free_cb != NULL)
333 memhdr->free_cb(memhdr, memhdr->opaque);
339 /* Add objects in the pool, using a physically contiguous memory
340 * zone. Return the number of objects added, or a negative value
344 rte_mempool_populate_phys(struct rte_mempool *mp, char *vaddr,
345 phys_addr_t paddr, size_t len, rte_mempool_memchunk_free_cb_t *free_cb,
348 unsigned total_elt_sz;
351 struct rte_mempool_memhdr *memhdr;
354 /* create the internal ring if not already done */
355 if ((mp->flags & MEMPOOL_F_POOL_CREATED) == 0) {
356 ret = rte_mempool_ops_alloc(mp);
359 mp->flags |= MEMPOOL_F_POOL_CREATED;
362 /* mempool is already populated */
363 if (mp->populated_size >= mp->size)
366 total_elt_sz = mp->header_size + mp->elt_size + mp->trailer_size;
368 memhdr = rte_zmalloc("MEMPOOL_MEMHDR", sizeof(*memhdr), 0);
373 memhdr->addr = vaddr;
374 memhdr->phys_addr = paddr;
376 memhdr->free_cb = free_cb;
377 memhdr->opaque = opaque;
379 if (mp->flags & MEMPOOL_F_NO_CACHE_ALIGN)
380 off = RTE_PTR_ALIGN_CEIL(vaddr, 8) - vaddr;
382 off = RTE_PTR_ALIGN_CEIL(vaddr, RTE_CACHE_LINE_SIZE) - vaddr;
384 while (off + total_elt_sz <= len && mp->populated_size < mp->size) {
385 off += mp->header_size;
386 if (paddr == RTE_BAD_PHYS_ADDR)
387 mempool_add_elem(mp, (char *)vaddr + off,
390 mempool_add_elem(mp, (char *)vaddr + off, paddr + off);
391 off += mp->elt_size + mp->trailer_size;
395 /* not enough room to store one object */
399 STAILQ_INSERT_TAIL(&mp->mem_list, memhdr, next);
404 /* Add objects in the pool, using a table of physical pages. Return the
405 * number of objects added, or a negative value on error.
408 rte_mempool_populate_phys_tab(struct rte_mempool *mp, char *vaddr,
409 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift,
410 rte_mempool_memchunk_free_cb_t *free_cb, void *opaque)
414 size_t pg_sz = (size_t)1 << pg_shift;
416 /* mempool must not be populated */
417 if (mp->nb_mem_chunks != 0)
420 if (mp->flags & MEMPOOL_F_NO_PHYS_CONTIG)
421 return rte_mempool_populate_phys(mp, vaddr, RTE_BAD_PHYS_ADDR,
422 pg_num * pg_sz, free_cb, opaque);
424 for (i = 0; i < pg_num && mp->populated_size < mp->size; i += n) {
426 /* populate with the largest group of contiguous pages */
427 for (n = 1; (i + n) < pg_num &&
428 paddr[i] + pg_sz == paddr[i+n]; n++)
431 ret = rte_mempool_populate_phys(mp, vaddr + i * pg_sz,
432 paddr[i], n * pg_sz, free_cb, opaque);
434 rte_mempool_free_memchunks(mp);
437 /* no need to call the free callback for next chunks */
444 /* Populate the mempool with a virtual area. Return the number of
445 * objects added, or a negative value on error.
448 rte_mempool_populate_virt(struct rte_mempool *mp, char *addr,
449 size_t len, size_t pg_sz, rte_mempool_memchunk_free_cb_t *free_cb,
453 size_t off, phys_len;
456 /* mempool must not be populated */
457 if (mp->nb_mem_chunks != 0)
459 /* address and len must be page-aligned */
460 if (RTE_PTR_ALIGN_CEIL(addr, pg_sz) != addr)
462 if (RTE_ALIGN_CEIL(len, pg_sz) != len)
465 if (mp->flags & MEMPOOL_F_NO_PHYS_CONTIG)
466 return rte_mempool_populate_phys(mp, addr, RTE_BAD_PHYS_ADDR,
467 len, free_cb, opaque);
469 for (off = 0; off + pg_sz <= len &&
470 mp->populated_size < mp->size; off += phys_len) {
472 paddr = rte_mem_virt2phy(addr + off);
473 /* required for xen_dom0 to get the machine address */
474 paddr = rte_mem_phy2mch(-1, paddr);
476 if (paddr == RTE_BAD_PHYS_ADDR) {
481 /* populate with the largest group of contiguous pages */
482 for (phys_len = pg_sz; off + phys_len < len; phys_len += pg_sz) {
483 phys_addr_t paddr_tmp;
485 paddr_tmp = rte_mem_virt2phy(addr + off + phys_len);
486 paddr_tmp = rte_mem_phy2mch(-1, paddr_tmp);
488 if (paddr_tmp != paddr + phys_len)
492 ret = rte_mempool_populate_phys(mp, addr + off, paddr,
493 phys_len, free_cb, opaque);
496 /* no need to call the free callback for next chunks */
504 rte_mempool_free_memchunks(mp);
508 /* Default function to populate the mempool: allocate memory in memzones,
509 * and populate them. Return the number of objects added, or a negative
513 rte_mempool_populate_default(struct rte_mempool *mp)
515 int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
516 char mz_name[RTE_MEMZONE_NAMESIZE];
517 const struct rte_memzone *mz;
518 size_t size, total_elt_sz, align, pg_sz, pg_shift;
523 /* mempool must not be populated */
524 if (mp->nb_mem_chunks != 0)
527 if (rte_eal_has_hugepages()) {
528 pg_shift = 0; /* not needed, zone is physically contiguous */
530 align = RTE_CACHE_LINE_SIZE;
532 pg_sz = getpagesize();
533 pg_shift = rte_bsf32(pg_sz);
537 total_elt_sz = mp->header_size + mp->elt_size + mp->trailer_size;
538 for (mz_id = 0, n = mp->size; n > 0; mz_id++, n -= ret) {
539 size = rte_mempool_xmem_size(n, total_elt_sz, pg_shift);
541 ret = snprintf(mz_name, sizeof(mz_name),
542 RTE_MEMPOOL_MZ_FORMAT "_%d", mp->name, mz_id);
543 if (ret < 0 || ret >= (int)sizeof(mz_name)) {
548 mz = rte_memzone_reserve_aligned(mz_name, size,
549 mp->socket_id, mz_flags, align);
550 /* not enough memory, retry with the biggest zone we have */
552 mz = rte_memzone_reserve_aligned(mz_name, 0,
553 mp->socket_id, mz_flags, align);
559 if (mp->flags & MEMPOOL_F_NO_PHYS_CONTIG)
560 paddr = RTE_BAD_PHYS_ADDR;
562 paddr = mz->phys_addr;
564 if (rte_eal_has_hugepages() && !rte_xen_dom0_supported())
565 ret = rte_mempool_populate_phys(mp, mz->addr,
567 rte_mempool_memchunk_mz_free,
568 (void *)(uintptr_t)mz);
570 ret = rte_mempool_populate_virt(mp, mz->addr,
572 rte_mempool_memchunk_mz_free,
573 (void *)(uintptr_t)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)
589 size_t size, total_elt_sz, pg_sz, pg_shift;
591 pg_sz = getpagesize();
592 pg_shift = rte_bsf32(pg_sz);
593 total_elt_sz = mp->header_size + mp->elt_size + mp->trailer_size;
594 size = rte_mempool_xmem_size(mp->size, total_elt_sz, pg_shift);
599 /* unmap a memory zone mapped by rte_mempool_populate_anon() */
601 rte_mempool_memchunk_anon_free(struct rte_mempool_memhdr *memhdr,
604 munmap(opaque, get_anon_size(memhdr->mp));
607 /* populate the mempool with an anonymous mapping */
609 rte_mempool_populate_anon(struct rte_mempool *mp)
615 /* mempool is already populated, error */
616 if (!STAILQ_EMPTY(&mp->mem_list)) {
621 /* get chunk of virtually continuous memory */
622 size = get_anon_size(mp);
623 addr = mmap(NULL, size, PROT_READ | PROT_WRITE,
624 MAP_SHARED | MAP_ANONYMOUS, -1, 0);
625 if (addr == MAP_FAILED) {
629 /* can't use MMAP_LOCKED, it does not exist on BSD */
630 if (mlock(addr, size) < 0) {
636 ret = rte_mempool_populate_virt(mp, addr, size, getpagesize(),
637 rte_mempool_memchunk_anon_free, addr);
641 return mp->populated_size;
644 rte_mempool_free_memchunks(mp);
650 rte_mempool_free(struct rte_mempool *mp)
652 struct rte_mempool_list *mempool_list = NULL;
653 struct rte_tailq_entry *te;
658 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
659 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
660 /* find out tailq entry */
661 TAILQ_FOREACH(te, mempool_list, next) {
662 if (te->data == (void *)mp)
667 TAILQ_REMOVE(mempool_list, te, next);
670 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
672 rte_mempool_free_memchunks(mp);
673 rte_mempool_ops_free(mp);
674 rte_memzone_free(mp->mz);
678 mempool_cache_init(struct rte_mempool_cache *cache, uint32_t size)
681 cache->flushthresh = CALC_CACHE_FLUSHTHRESH(size);
686 * Create and initialize a cache for objects that are retrieved from and
687 * returned to an underlying mempool. This structure is identical to the
688 * local_cache[lcore_id] pointed to by the mempool structure.
690 struct rte_mempool_cache *
691 rte_mempool_cache_create(uint32_t size, int socket_id)
693 struct rte_mempool_cache *cache;
695 if (size == 0 || size > RTE_MEMPOOL_CACHE_MAX_SIZE) {
700 cache = rte_zmalloc_socket("MEMPOOL_CACHE", sizeof(*cache),
701 RTE_CACHE_LINE_SIZE, socket_id);
703 RTE_LOG(ERR, MEMPOOL, "Cannot allocate mempool cache.\n");
708 mempool_cache_init(cache, size);
714 * Free a cache. It's the responsibility of the user to make sure that any
715 * remaining objects in the cache are flushed to the corresponding
719 rte_mempool_cache_free(struct rte_mempool_cache *cache)
724 /* create an empty mempool */
726 rte_mempool_create_empty(const char *name, unsigned n, unsigned elt_size,
727 unsigned cache_size, unsigned private_data_size,
728 int socket_id, unsigned flags)
730 char mz_name[RTE_MEMZONE_NAMESIZE];
731 struct rte_mempool_list *mempool_list;
732 struct rte_mempool *mp = NULL;
733 struct rte_tailq_entry *te = NULL;
734 const struct rte_memzone *mz = NULL;
736 int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
737 struct rte_mempool_objsz objsz;
741 /* compilation-time checks */
742 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool) &
743 RTE_CACHE_LINE_MASK) != 0);
744 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_cache) &
745 RTE_CACHE_LINE_MASK) != 0);
746 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
747 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_debug_stats) &
748 RTE_CACHE_LINE_MASK) != 0);
749 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, stats) &
750 RTE_CACHE_LINE_MASK) != 0);
753 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
755 /* asked cache too big */
756 if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE ||
757 CALC_CACHE_FLUSHTHRESH(cache_size) > n) {
762 /* "no cache align" imply "no spread" */
763 if (flags & MEMPOOL_F_NO_CACHE_ALIGN)
764 flags |= MEMPOOL_F_NO_SPREAD;
766 /* calculate mempool object sizes. */
767 if (!rte_mempool_calc_obj_size(elt_size, flags, &objsz)) {
772 rte_rwlock_write_lock(RTE_EAL_MEMPOOL_RWLOCK);
775 * reserve a memory zone for this mempool: private data is
778 private_data_size = (private_data_size +
779 RTE_MEMPOOL_ALIGN_MASK) & (~RTE_MEMPOOL_ALIGN_MASK);
782 /* try to allocate tailq entry */
783 te = rte_zmalloc("MEMPOOL_TAILQ_ENTRY", sizeof(*te), 0);
785 RTE_LOG(ERR, MEMPOOL, "Cannot allocate tailq entry!\n");
789 mempool_size = MEMPOOL_HEADER_SIZE(mp, cache_size);
790 mempool_size += private_data_size;
791 mempool_size = RTE_ALIGN_CEIL(mempool_size, RTE_MEMPOOL_ALIGN);
793 ret = snprintf(mz_name, sizeof(mz_name), RTE_MEMPOOL_MZ_FORMAT, name);
794 if (ret < 0 || ret >= (int)sizeof(mz_name)) {
795 rte_errno = ENAMETOOLONG;
799 mz = rte_memzone_reserve(mz_name, mempool_size, socket_id, mz_flags);
803 /* init the mempool structure */
805 memset(mp, 0, MEMPOOL_HEADER_SIZE(mp, cache_size));
806 ret = snprintf(mp->name, sizeof(mp->name), "%s", name);
807 if (ret < 0 || ret >= (int)sizeof(mp->name)) {
808 rte_errno = ENAMETOOLONG;
812 mp->socket_id = socket_id;
815 mp->socket_id = socket_id;
816 mp->elt_size = objsz.elt_size;
817 mp->header_size = objsz.header_size;
818 mp->trailer_size = objsz.trailer_size;
819 /* Size of default caches, zero means disabled. */
820 mp->cache_size = cache_size;
821 mp->private_data_size = private_data_size;
822 STAILQ_INIT(&mp->elt_list);
823 STAILQ_INIT(&mp->mem_list);
826 * local_cache pointer is set even if cache_size is zero.
827 * The local_cache points to just past the elt_pa[] array.
829 mp->local_cache = (struct rte_mempool_cache *)
830 RTE_PTR_ADD(mp, MEMPOOL_HEADER_SIZE(mp, 0));
832 /* Init all default caches. */
833 if (cache_size != 0) {
834 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
835 mempool_cache_init(&mp->local_cache[lcore_id],
841 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
842 TAILQ_INSERT_TAIL(mempool_list, te, next);
843 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
844 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
849 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
851 rte_mempool_free(mp);
855 /* create the mempool */
857 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
858 unsigned cache_size, unsigned private_data_size,
859 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
860 rte_mempool_obj_cb_t *obj_init, void *obj_init_arg,
861 int socket_id, unsigned flags)
863 struct rte_mempool *mp;
865 mp = rte_mempool_create_empty(name, n, elt_size, cache_size,
866 private_data_size, socket_id, flags);
871 * Since we have 4 combinations of the SP/SC/MP/MC examine the flags to
872 * set the correct index into the table of ops structs.
874 if (flags & (MEMPOOL_F_SP_PUT | MEMPOOL_F_SC_GET))
875 rte_mempool_set_ops_byname(mp, "ring_sp_sc", NULL);
876 else if (flags & MEMPOOL_F_SP_PUT)
877 rte_mempool_set_ops_byname(mp, "ring_sp_mc", NULL);
878 else if (flags & MEMPOOL_F_SC_GET)
879 rte_mempool_set_ops_byname(mp, "ring_mp_sc", NULL);
881 rte_mempool_set_ops_byname(mp, "ring_mp_mc", NULL);
883 /* call the mempool priv initializer */
885 mp_init(mp, mp_init_arg);
887 if (rte_mempool_populate_default(mp) < 0)
890 /* call the object initializers */
892 rte_mempool_obj_iter(mp, obj_init, obj_init_arg);
897 rte_mempool_free(mp);
902 * Create the mempool over already allocated chunk of memory.
903 * That external memory buffer can consists of physically disjoint pages.
904 * Setting vaddr to NULL, makes mempool to fallback to original behaviour
905 * and allocate space for mempool and it's elements as one big chunk of
906 * physically continuos memory.
909 rte_mempool_xmem_create(const char *name, unsigned n, unsigned elt_size,
910 unsigned cache_size, unsigned private_data_size,
911 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
912 rte_mempool_obj_cb_t *obj_init, void *obj_init_arg,
913 int socket_id, unsigned flags, void *vaddr,
914 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
916 struct rte_mempool *mp = NULL;
919 /* no virtual address supplied, use rte_mempool_create() */
921 return rte_mempool_create(name, n, elt_size, cache_size,
922 private_data_size, mp_init, mp_init_arg,
923 obj_init, obj_init_arg, socket_id, flags);
925 /* check that we have both VA and PA */
931 /* Check that pg_shift parameter is valid. */
932 if (pg_shift > MEMPOOL_PG_SHIFT_MAX) {
937 mp = rte_mempool_create_empty(name, n, elt_size, cache_size,
938 private_data_size, socket_id, flags);
942 /* call the mempool priv initializer */
944 mp_init(mp, mp_init_arg);
946 ret = rte_mempool_populate_phys_tab(mp, vaddr, paddr, pg_num, pg_shift,
948 if (ret < 0 || ret != (int)mp->size)
951 /* call the object initializers */
953 rte_mempool_obj_iter(mp, obj_init, obj_init_arg);
958 rte_mempool_free(mp);
962 /* Return the number of entries in the mempool */
964 rte_mempool_avail_count(const struct rte_mempool *mp)
969 count = rte_mempool_ops_get_count(mp);
971 if (mp->cache_size == 0)
974 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
975 count += mp->local_cache[lcore_id].len;
978 * due to race condition (access to len is not locked), the
979 * total can be greater than size... so fix the result
981 if (count > mp->size)
986 /* return the number of entries allocated from the mempool */
988 rte_mempool_in_use_count(const struct rte_mempool *mp)
990 return mp->size - rte_mempool_avail_count(mp);
994 rte_mempool_count(const struct rte_mempool *mp)
996 return rte_mempool_avail_count(mp);
999 /* dump the cache status */
1001 rte_mempool_dump_cache(FILE *f, const struct rte_mempool *mp)
1005 unsigned cache_count;
1007 fprintf(f, " internal cache infos:\n");
1008 fprintf(f, " cache_size=%"PRIu32"\n", mp->cache_size);
1010 if (mp->cache_size == 0)
1013 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
1014 cache_count = mp->local_cache[lcore_id].len;
1015 fprintf(f, " cache_count[%u]=%"PRIu32"\n",
1016 lcore_id, cache_count);
1017 count += cache_count;
1019 fprintf(f, " total_cache_count=%u\n", count);
1023 #ifndef __INTEL_COMPILER
1024 #pragma GCC diagnostic ignored "-Wcast-qual"
1027 /* check and update cookies or panic (internal) */
1028 void rte_mempool_check_cookies(const struct rte_mempool *mp,
1029 void * const *obj_table_const, unsigned n, int free)
1031 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1032 struct rte_mempool_objhdr *hdr;
1033 struct rte_mempool_objtlr *tlr;
1039 /* Force to drop the "const" attribute. This is done only when
1040 * DEBUG is enabled */
1041 tmp = (void *) obj_table_const;
1042 obj_table = (void **) tmp;
1047 if (rte_mempool_from_obj(obj) != mp)
1048 rte_panic("MEMPOOL: object is owned by another "
1051 hdr = __mempool_get_header(obj);
1052 cookie = hdr->cookie;
1055 if (cookie != RTE_MEMPOOL_HEADER_COOKIE1) {
1056 RTE_LOG(CRIT, MEMPOOL,
1057 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1058 obj, (const void *) mp, cookie);
1059 rte_panic("MEMPOOL: bad header cookie (put)\n");
1061 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE2;
1062 } else if (free == 1) {
1063 if (cookie != RTE_MEMPOOL_HEADER_COOKIE2) {
1064 RTE_LOG(CRIT, MEMPOOL,
1065 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1066 obj, (const void *) mp, cookie);
1067 rte_panic("MEMPOOL: bad header cookie (get)\n");
1069 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE1;
1070 } else if (free == 2) {
1071 if (cookie != RTE_MEMPOOL_HEADER_COOKIE1 &&
1072 cookie != RTE_MEMPOOL_HEADER_COOKIE2) {
1073 RTE_LOG(CRIT, MEMPOOL,
1074 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1075 obj, (const void *) mp, cookie);
1076 rte_panic("MEMPOOL: bad header cookie (audit)\n");
1079 tlr = __mempool_get_trailer(obj);
1080 cookie = tlr->cookie;
1081 if (cookie != RTE_MEMPOOL_TRAILER_COOKIE) {
1082 RTE_LOG(CRIT, MEMPOOL,
1083 "obj=%p, mempool=%p, cookie=%" PRIx64 "\n",
1084 obj, (const void *) mp, cookie);
1085 rte_panic("MEMPOOL: bad trailer cookie\n");
1090 RTE_SET_USED(obj_table_const);
1096 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1098 mempool_obj_audit(struct rte_mempool *mp, __rte_unused void *opaque,
1099 void *obj, __rte_unused unsigned idx)
1101 __mempool_check_cookies(mp, &obj, 1, 2);
1105 mempool_audit_cookies(struct rte_mempool *mp)
1109 num = rte_mempool_obj_iter(mp, mempool_obj_audit, NULL);
1110 if (num != mp->size) {
1111 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
1112 "iterated only over %u elements\n",
1117 #define mempool_audit_cookies(mp) do {} while(0)
1120 #ifndef __INTEL_COMPILER
1121 #pragma GCC diagnostic error "-Wcast-qual"
1124 /* check cookies before and after objects */
1126 mempool_audit_cache(const struct rte_mempool *mp)
1128 /* check cache size consistency */
1131 if (mp->cache_size == 0)
1134 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
1135 const struct rte_mempool_cache *cache;
1136 cache = &mp->local_cache[lcore_id];
1137 if (cache->len > cache->flushthresh) {
1138 RTE_LOG(CRIT, MEMPOOL, "badness on cache[%u]\n",
1140 rte_panic("MEMPOOL: invalid cache len\n");
1145 /* check the consistency of mempool (size, cookies, ...) */
1147 rte_mempool_audit(struct rte_mempool *mp)
1149 mempool_audit_cache(mp);
1150 mempool_audit_cookies(mp);
1152 /* For case where mempool DEBUG is not set, and cache size is 0 */
1156 /* dump the status of the mempool on the console */
1158 rte_mempool_dump(FILE *f, struct rte_mempool *mp)
1160 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1161 struct rte_mempool_debug_stats sum;
1164 struct rte_mempool_memhdr *memhdr;
1165 unsigned common_count;
1166 unsigned cache_count;
1169 RTE_ASSERT(f != NULL);
1170 RTE_ASSERT(mp != NULL);
1172 fprintf(f, "mempool <%s>@%p\n", mp->name, mp);
1173 fprintf(f, " flags=%x\n", mp->flags);
1174 fprintf(f, " pool=%p\n", mp->pool_data);
1175 fprintf(f, " phys_addr=0x%" PRIx64 "\n", mp->mz->phys_addr);
1176 fprintf(f, " nb_mem_chunks=%u\n", mp->nb_mem_chunks);
1177 fprintf(f, " size=%"PRIu32"\n", mp->size);
1178 fprintf(f, " populated_size=%"PRIu32"\n", mp->populated_size);
1179 fprintf(f, " header_size=%"PRIu32"\n", mp->header_size);
1180 fprintf(f, " elt_size=%"PRIu32"\n", mp->elt_size);
1181 fprintf(f, " trailer_size=%"PRIu32"\n", mp->trailer_size);
1182 fprintf(f, " total_obj_size=%"PRIu32"\n",
1183 mp->header_size + mp->elt_size + mp->trailer_size);
1185 fprintf(f, " private_data_size=%"PRIu32"\n", mp->private_data_size);
1187 STAILQ_FOREACH(memhdr, &mp->mem_list, next)
1188 mem_len += memhdr->len;
1190 fprintf(f, " avg bytes/object=%#Lf\n",
1191 (long double)mem_len / mp->size);
1194 cache_count = rte_mempool_dump_cache(f, mp);
1195 common_count = rte_mempool_ops_get_count(mp);
1196 if ((cache_count + common_count) > mp->size)
1197 common_count = mp->size - cache_count;
1198 fprintf(f, " common_pool_count=%u\n", common_count);
1200 /* sum and dump statistics */
1201 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1202 memset(&sum, 0, sizeof(sum));
1203 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
1204 sum.put_bulk += mp->stats[lcore_id].put_bulk;
1205 sum.put_objs += mp->stats[lcore_id].put_objs;
1206 sum.get_success_bulk += mp->stats[lcore_id].get_success_bulk;
1207 sum.get_success_objs += mp->stats[lcore_id].get_success_objs;
1208 sum.get_fail_bulk += mp->stats[lcore_id].get_fail_bulk;
1209 sum.get_fail_objs += mp->stats[lcore_id].get_fail_objs;
1211 fprintf(f, " stats:\n");
1212 fprintf(f, " put_bulk=%"PRIu64"\n", sum.put_bulk);
1213 fprintf(f, " put_objs=%"PRIu64"\n", sum.put_objs);
1214 fprintf(f, " get_success_bulk=%"PRIu64"\n", sum.get_success_bulk);
1215 fprintf(f, " get_success_objs=%"PRIu64"\n", sum.get_success_objs);
1216 fprintf(f, " get_fail_bulk=%"PRIu64"\n", sum.get_fail_bulk);
1217 fprintf(f, " get_fail_objs=%"PRIu64"\n", sum.get_fail_objs);
1219 fprintf(f, " no statistics available\n");
1222 rte_mempool_audit(mp);
1225 /* dump the status of all mempools on the console */
1227 rte_mempool_list_dump(FILE *f)
1229 struct rte_mempool *mp = NULL;
1230 struct rte_tailq_entry *te;
1231 struct rte_mempool_list *mempool_list;
1233 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1235 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
1237 TAILQ_FOREACH(te, mempool_list, next) {
1238 mp = (struct rte_mempool *) te->data;
1239 rte_mempool_dump(f, mp);
1242 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
1245 /* search a mempool from its name */
1246 struct rte_mempool *
1247 rte_mempool_lookup(const char *name)
1249 struct rte_mempool *mp = NULL;
1250 struct rte_tailq_entry *te;
1251 struct rte_mempool_list *mempool_list;
1253 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1255 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
1257 TAILQ_FOREACH(te, mempool_list, next) {
1258 mp = (struct rte_mempool *) te->data;
1259 if (strncmp(name, mp->name, RTE_MEMPOOL_NAMESIZE) == 0)
1263 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
1273 void rte_mempool_walk(void (*func)(struct rte_mempool *, void *),
1276 struct rte_tailq_entry *te = NULL;
1277 struct rte_mempool_list *mempool_list;
1279 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
1281 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
1283 TAILQ_FOREACH(te, mempool_list, next) {
1284 (*func)((struct rte_mempool *) te->data, arg);
1287 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);