4 * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of Intel Corporation nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
41 #include <sys/queue.h>
43 #include <rte_common.h>
45 #include <rte_debug.h>
46 #include <rte_memory.h>
47 #include <rte_memzone.h>
48 #include <rte_malloc.h>
49 #include <rte_atomic.h>
50 #include <rte_launch.h>
52 #include <rte_eal_memconfig.h>
53 #include <rte_per_lcore.h>
54 #include <rte_lcore.h>
55 #include <rte_branch_prediction.h>
57 #include <rte_errno.h>
58 #include <rte_string_fns.h>
59 #include <rte_spinlock.h>
61 #include "rte_mempool.h"
63 TAILQ_HEAD(rte_mempool_list, rte_tailq_entry);
65 static struct rte_tailq_elem rte_mempool_tailq = {
66 .name = "RTE_MEMPOOL",
68 EAL_REGISTER_TAILQ(rte_mempool_tailq)
70 #define CACHE_FLUSHTHRESH_MULTIPLIER 1.5
71 #define CALC_CACHE_FLUSHTHRESH(c) \
72 ((typeof(c))((c) * CACHE_FLUSHTHRESH_MULTIPLIER))
75 * return the greatest common divisor between a and b (fast algorithm)
78 static unsigned get_gcd(unsigned a, unsigned b)
103 * Depending on memory configuration, objects addresses are spread
104 * between channels and ranks in RAM: the pool allocator will add
105 * padding between objects. This function return the new size of the
108 static unsigned optimize_object_size(unsigned obj_size)
110 unsigned nrank, nchan;
111 unsigned new_obj_size;
113 /* get number of channels */
114 nchan = rte_memory_get_nchannel();
118 nrank = rte_memory_get_nrank();
122 /* process new object size */
123 new_obj_size = (obj_size + RTE_CACHE_LINE_MASK) / RTE_CACHE_LINE_SIZE;
124 while (get_gcd(new_obj_size, nrank * nchan) != 1)
126 return new_obj_size * RTE_CACHE_LINE_SIZE;
130 mempool_add_elem(struct rte_mempool *mp, void *obj, uint32_t obj_idx,
131 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
133 struct rte_mempool **mpp;
135 obj = (char *)obj + mp->header_size;
137 /* set mempool ptr in header */
138 mpp = __mempool_from_obj(obj);
141 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
142 __mempool_write_header_cookie(obj, 1);
143 __mempool_write_trailer_cookie(obj);
145 /* call the initializer */
147 obj_init(mp, obj_init_arg, obj, obj_idx);
149 /* enqueue in ring */
150 rte_ring_sp_enqueue(mp->ring, obj);
154 rte_mempool_obj_iter(void *vaddr, uint32_t elt_num, size_t elt_sz, size_t align,
155 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift,
156 rte_mempool_obj_iter_t obj_iter, void *obj_iter_arg)
160 uintptr_t end, start, va;
163 pg_sz = (uintptr_t)1 << pg_shift;
164 va = (uintptr_t)vaddr;
169 while (i != elt_num && j != pg_num) {
171 start = RTE_ALIGN_CEIL(va, align);
172 end = start + elt_sz;
174 /* index of the first page for the next element. */
175 pgf = (end >> pg_shift) - (start >> pg_shift);
177 /* index of the last page for the current element. */
178 pgn = ((end - 1) >> pg_shift) - (start >> pg_shift);
181 /* do we have enough space left for the element. */
187 paddr[k] + pg_sz == paddr[k + 1];
192 * if next pgn chunks of memory physically continuous,
193 * use it to create next element.
194 * otherwise, just skip that chunk unused.
197 if (obj_iter != NULL)
198 obj_iter(obj_iter_arg, (void *)start,
204 va = RTE_ALIGN_CEIL((va + 1), pg_sz);
213 * Populate mempool with the objects.
216 struct mempool_populate_arg {
217 struct rte_mempool *mp;
218 rte_mempool_obj_ctor_t *obj_init;
223 mempool_obj_populate(void *arg, void *start, void *end, uint32_t idx)
225 struct mempool_populate_arg *pa = arg;
227 mempool_add_elem(pa->mp, start, idx, pa->obj_init, pa->obj_init_arg);
228 pa->mp->elt_va_end = (uintptr_t)end;
232 mempool_populate(struct rte_mempool *mp, size_t num, size_t align,
233 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
236 struct mempool_populate_arg arg;
238 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
240 arg.obj_init = obj_init;
241 arg.obj_init_arg = obj_init_arg;
243 mp->size = rte_mempool_obj_iter((void *)mp->elt_va_start,
245 mp->elt_pa, mp->pg_num, mp->pg_shift,
246 mempool_obj_populate, &arg);
250 rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
251 struct rte_mempool_objsz *sz)
253 struct rte_mempool_objsz lsz;
255 sz = (sz != NULL) ? sz : &lsz;
258 * In header, we have at least the pointer to the pool, and
259 * optionaly a 64 bits cookie.
262 sz->header_size += sizeof(struct rte_mempool *); /* ptr to pool */
263 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
264 sz->header_size += sizeof(uint64_t); /* cookie */
266 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0)
267 sz->header_size = RTE_ALIGN_CEIL(sz->header_size,
268 RTE_CACHE_LINE_SIZE);
270 /* trailer contains the cookie in debug mode */
271 sz->trailer_size = 0;
272 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
273 sz->trailer_size += sizeof(uint64_t); /* cookie */
275 /* element size is 8 bytes-aligned at least */
276 sz->elt_size = RTE_ALIGN_CEIL(elt_size, sizeof(uint64_t));
278 /* expand trailer to next cache line */
279 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0) {
280 sz->total_size = sz->header_size + sz->elt_size +
282 sz->trailer_size += ((RTE_CACHE_LINE_SIZE -
283 (sz->total_size & RTE_CACHE_LINE_MASK)) &
284 RTE_CACHE_LINE_MASK);
288 * increase trailer to add padding between objects in order to
289 * spread them across memory channels/ranks
291 if ((flags & MEMPOOL_F_NO_SPREAD) == 0) {
293 new_size = optimize_object_size(sz->header_size + sz->elt_size +
295 sz->trailer_size = new_size - sz->header_size - sz->elt_size;
298 if (! rte_eal_has_hugepages()) {
300 * compute trailer size so that pool elements fit exactly in
303 int page_size = getpagesize();
304 int new_size = page_size - sz->header_size - sz->elt_size;
305 if (new_size < 0 || (unsigned int)new_size < sz->trailer_size) {
306 printf("When hugepages are disabled, pool objects "
307 "can't exceed PAGE_SIZE: %d + %d + %d > %d\n",
308 sz->header_size, sz->elt_size, sz->trailer_size,
312 sz->trailer_size = new_size;
315 /* this is the size of an object, including header and trailer */
316 sz->total_size = sz->header_size + sz->elt_size + sz->trailer_size;
318 return (sz->total_size);
323 * Calculate maximum amount of memory required to store given number of objects.
326 rte_mempool_xmem_size(uint32_t elt_num, size_t elt_sz, uint32_t pg_shift)
328 size_t n, pg_num, pg_sz, sz;
330 pg_sz = (size_t)1 << pg_shift;
332 if ((n = pg_sz / elt_sz) > 0) {
333 pg_num = (elt_num + n - 1) / n;
334 sz = pg_num << pg_shift;
336 sz = RTE_ALIGN_CEIL(elt_sz, pg_sz) * elt_num;
343 * Calculate how much memory would be actually required with the
344 * given memory footprint to store required number of elements.
347 mempool_lelem_iter(void *arg, __rte_unused void *start, void *end,
348 __rte_unused uint32_t idx)
350 *(uintptr_t *)arg = (uintptr_t)end;
354 rte_mempool_xmem_usage(void *vaddr, uint32_t elt_num, size_t elt_sz,
355 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
361 pg_sz = (size_t)1 << pg_shift;
362 va = (uintptr_t)vaddr;
365 if ((n = rte_mempool_obj_iter(vaddr, elt_num, elt_sz, 1,
366 paddr, pg_num, pg_shift, mempool_lelem_iter,
368 return (-(ssize_t)n);
371 uv = RTE_ALIGN_CEIL(uv, pg_sz);
376 /* create the mempool */
378 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
379 unsigned cache_size, unsigned private_data_size,
380 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
381 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
382 int socket_id, unsigned flags)
384 #ifdef RTE_LIBRTE_XEN_DOM0
385 return (rte_dom0_mempool_create(name, n, elt_size,
386 cache_size, private_data_size,
387 mp_init, mp_init_arg,
388 obj_init, obj_init_arg,
391 return (rte_mempool_xmem_create(name, n, elt_size,
392 cache_size, private_data_size,
393 mp_init, mp_init_arg,
394 obj_init, obj_init_arg,
396 NULL, NULL, MEMPOOL_PG_NUM_DEFAULT, MEMPOOL_PG_SHIFT_MAX));
401 * Create the mempool over already allocated chunk of memory.
402 * That external memory buffer can consists of physically disjoint pages.
403 * Setting vaddr to NULL, makes mempool to fallback to original behaviour
404 * and allocate space for mempool and it's elements as one big chunk of
405 * physically continuos memory.
408 rte_mempool_xmem_create(const char *name, unsigned n, unsigned elt_size,
409 unsigned cache_size, unsigned private_data_size,
410 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
411 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
412 int socket_id, unsigned flags, void *vaddr,
413 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
415 char mz_name[RTE_MEMZONE_NAMESIZE];
416 char rg_name[RTE_RING_NAMESIZE];
417 struct rte_mempool_list *mempool_list;
418 struct rte_mempool *mp = NULL;
419 struct rte_tailq_entry *te;
421 const struct rte_memzone *mz;
423 int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
426 struct rte_mempool_objsz objsz;
428 int page_size = getpagesize();
430 /* compilation-time checks */
431 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool) &
432 RTE_CACHE_LINE_MASK) != 0);
433 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
434 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_cache) &
435 RTE_CACHE_LINE_MASK) != 0);
436 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, local_cache) &
437 RTE_CACHE_LINE_MASK) != 0);
439 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
440 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_debug_stats) &
441 RTE_CACHE_LINE_MASK) != 0);
442 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, stats) &
443 RTE_CACHE_LINE_MASK) != 0);
446 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
448 /* asked cache too big */
449 if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE ||
450 CALC_CACHE_FLUSHTHRESH(cache_size) > n) {
455 /* check that we have both VA and PA */
456 if (vaddr != NULL && paddr == NULL) {
461 /* Check that pg_num and pg_shift parameters are valid. */
462 if (pg_num < RTE_DIM(mp->elt_pa) || pg_shift > MEMPOOL_PG_SHIFT_MAX) {
467 /* "no cache align" imply "no spread" */
468 if (flags & MEMPOOL_F_NO_CACHE_ALIGN)
469 flags |= MEMPOOL_F_NO_SPREAD;
472 if (flags & MEMPOOL_F_SP_PUT)
473 rg_flags |= RING_F_SP_ENQ;
474 if (flags & MEMPOOL_F_SC_GET)
475 rg_flags |= RING_F_SC_DEQ;
477 /* calculate mempool object sizes. */
478 if (!rte_mempool_calc_obj_size(elt_size, flags, &objsz)) {
483 rte_rwlock_write_lock(RTE_EAL_MEMPOOL_RWLOCK);
485 /* allocate the ring that will be used to store objects */
486 /* Ring functions will return appropriate errors if we are
487 * running as a secondary process etc., so no checks made
488 * in this function for that condition */
489 snprintf(rg_name, sizeof(rg_name), RTE_MEMPOOL_MZ_FORMAT, name);
490 r = rte_ring_create(rg_name, rte_align32pow2(n+1), socket_id, rg_flags);
495 * reserve a memory zone for this mempool: private data is
498 private_data_size = (private_data_size +
499 RTE_CACHE_LINE_MASK) & (~RTE_CACHE_LINE_MASK);
501 if (! rte_eal_has_hugepages()) {
503 * expand private data size to a whole page, so that the
504 * first pool element will start on a new standard page
506 int head = sizeof(struct rte_mempool);
507 int new_size = (private_data_size + head) % page_size;
509 private_data_size += page_size - new_size;
513 /* try to allocate tailq entry */
514 te = rte_zmalloc("MEMPOOL_TAILQ_ENTRY", sizeof(*te), 0);
516 RTE_LOG(ERR, MEMPOOL, "Cannot allocate tailq entry!\n");
521 * If user provided an external memory buffer, then use it to
522 * store mempool objects. Otherwise reserve memzone big enough to
523 * hold mempool header and metadata plus mempool objects.
525 mempool_size = MEMPOOL_HEADER_SIZE(mp, pg_num) + private_data_size;
527 mempool_size += (size_t)objsz.total_size * n;
529 if (! rte_eal_has_hugepages()) {
531 * we want the memory pool to start on a page boundary,
532 * because pool elements crossing page boundaries would
533 * result in discontiguous physical addresses
535 mempool_size += page_size;
538 snprintf(mz_name, sizeof(mz_name), RTE_MEMPOOL_MZ_FORMAT, name);
540 mz = rte_memzone_reserve(mz_name, mempool_size, socket_id, mz_flags);
543 * no more memory: in this case we loose previously reserved
544 * space for the as we cannot free it
551 if (rte_eal_has_hugepages()) {
552 startaddr = (void*)mz->addr;
554 /* align memory pool start address on a page boundary */
555 unsigned long addr = (unsigned long)mz->addr;
556 if (addr & (page_size - 1)) {
558 addr &= ~(page_size - 1);
560 startaddr = (void*)addr;
563 /* init the mempool structure */
565 memset(mp, 0, sizeof(*mp));
566 snprintf(mp->name, sizeof(mp->name), "%s", name);
567 mp->phys_addr = mz->phys_addr;
571 mp->elt_size = objsz.elt_size;
572 mp->header_size = objsz.header_size;
573 mp->trailer_size = objsz.trailer_size;
574 mp->cache_size = cache_size;
575 mp->cache_flushthresh = CALC_CACHE_FLUSHTHRESH(cache_size);
576 mp->private_data_size = private_data_size;
578 /* calculate address of the first element for continuous mempool. */
579 obj = (char *)mp + MEMPOOL_HEADER_SIZE(mp, pg_num) +
582 /* populate address translation fields. */
584 mp->pg_shift = pg_shift;
585 mp->pg_mask = RTE_LEN2MASK(mp->pg_shift, typeof(mp->pg_mask));
587 /* mempool elements allocated together with mempool */
589 mp->elt_va_start = (uintptr_t)obj;
590 mp->elt_pa[0] = mp->phys_addr +
591 (mp->elt_va_start - (uintptr_t)mp);
593 /* mempool elements in a separate chunk of memory. */
595 mp->elt_va_start = (uintptr_t)vaddr;
596 memcpy(mp->elt_pa, paddr, sizeof (mp->elt_pa[0]) * pg_num);
599 mp->elt_va_end = mp->elt_va_start;
601 /* call the initializer */
603 mp_init(mp, mp_init_arg);
605 mempool_populate(mp, n, 1, obj_init, obj_init_arg);
607 te->data = (void *) mp;
609 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
610 TAILQ_INSERT_TAIL(mempool_list, te, next);
611 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
614 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
619 /* Return the number of entries in the mempool */
621 rte_mempool_count(const struct rte_mempool *mp)
625 count = rte_ring_count(mp->ring);
627 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
630 if (mp->cache_size == 0)
633 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
634 count += mp->local_cache[lcore_id].len;
639 * due to race condition (access to len is not locked), the
640 * total can be greater than size... so fix the result
642 if (count > mp->size)
647 /* dump the cache status */
649 rte_mempool_dump_cache(FILE *f, const struct rte_mempool *mp)
651 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
654 unsigned cache_count;
656 fprintf(f, " cache infos:\n");
657 fprintf(f, " cache_size=%"PRIu32"\n", mp->cache_size);
658 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
659 cache_count = mp->local_cache[lcore_id].len;
660 fprintf(f, " cache_count[%u]=%u\n", lcore_id, cache_count);
661 count += cache_count;
663 fprintf(f, " total_cache_count=%u\n", count);
667 fprintf(f, " cache disabled\n");
672 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
673 /* check cookies before and after objects */
674 #ifndef __INTEL_COMPILER
675 #pragma GCC diagnostic ignored "-Wcast-qual"
678 struct mempool_audit_arg {
679 const struct rte_mempool *mp;
685 mempool_obj_audit(void *arg, void *start, void *end, uint32_t idx)
687 struct mempool_audit_arg *pa = arg;
690 obj = (char *)start + pa->mp->header_size;
691 pa->obj_end = (uintptr_t)end;
692 pa->obj_num = idx + 1;
693 __mempool_check_cookies(pa->mp, &obj, 1, 2);
697 mempool_audit_cookies(const struct rte_mempool *mp)
699 uint32_t elt_sz, num;
700 struct mempool_audit_arg arg;
702 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
705 arg.obj_end = mp->elt_va_start;
708 num = rte_mempool_obj_iter((void *)mp->elt_va_start,
710 mp->elt_pa, mp->pg_num, mp->pg_shift,
711 mempool_obj_audit, &arg);
713 if (num != mp->size) {
714 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
715 "iterated only over %u elements\n",
717 } else if (arg.obj_end != mp->elt_va_end || arg.obj_num != mp->size) {
718 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
719 "last callback va_end: %#tx (%#tx expeceted), "
720 "num of objects: %u (%u expected)\n",
722 arg.obj_end, mp->elt_va_end,
723 arg.obj_num, mp->size);
727 #ifndef __INTEL_COMPILER
728 #pragma GCC diagnostic error "-Wcast-qual"
731 #define mempool_audit_cookies(mp) do {} while(0)
734 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
735 /* check cookies before and after objects */
737 mempool_audit_cache(const struct rte_mempool *mp)
739 /* check cache size consistency */
741 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
742 if (mp->local_cache[lcore_id].len > mp->cache_flushthresh) {
743 RTE_LOG(CRIT, MEMPOOL, "badness on cache[%u]\n",
745 rte_panic("MEMPOOL: invalid cache len\n");
750 #define mempool_audit_cache(mp) do {} while(0)
754 /* check the consistency of mempool (size, cookies, ...) */
756 rte_mempool_audit(const struct rte_mempool *mp)
758 mempool_audit_cache(mp);
759 mempool_audit_cookies(mp);
761 /* For case where mempool DEBUG is not set, and cache size is 0 */
765 /* dump the status of the mempool on the console */
767 rte_mempool_dump(FILE *f, const struct rte_mempool *mp)
769 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
770 struct rte_mempool_debug_stats sum;
773 unsigned common_count;
774 unsigned cache_count;
776 RTE_VERIFY(f != NULL);
777 RTE_VERIFY(mp != NULL);
779 fprintf(f, "mempool <%s>@%p\n", mp->name, mp);
780 fprintf(f, " flags=%x\n", mp->flags);
781 fprintf(f, " ring=<%s>@%p\n", mp->ring->name, mp->ring);
782 fprintf(f, " phys_addr=0x%" PRIx64 "\n", mp->phys_addr);
783 fprintf(f, " size=%"PRIu32"\n", mp->size);
784 fprintf(f, " header_size=%"PRIu32"\n", mp->header_size);
785 fprintf(f, " elt_size=%"PRIu32"\n", mp->elt_size);
786 fprintf(f, " trailer_size=%"PRIu32"\n", mp->trailer_size);
787 fprintf(f, " total_obj_size=%"PRIu32"\n",
788 mp->header_size + mp->elt_size + mp->trailer_size);
790 fprintf(f, " private_data_size=%"PRIu32"\n", mp->private_data_size);
791 fprintf(f, " pg_num=%"PRIu32"\n", mp->pg_num);
792 fprintf(f, " pg_shift=%"PRIu32"\n", mp->pg_shift);
793 fprintf(f, " pg_mask=%#tx\n", mp->pg_mask);
794 fprintf(f, " elt_va_start=%#tx\n", mp->elt_va_start);
795 fprintf(f, " elt_va_end=%#tx\n", mp->elt_va_end);
796 fprintf(f, " elt_pa[0]=0x%" PRIx64 "\n", mp->elt_pa[0]);
799 fprintf(f, " avg bytes/object=%#Lf\n",
800 (long double)(mp->elt_va_end - mp->elt_va_start) /
803 cache_count = rte_mempool_dump_cache(f, mp);
804 common_count = rte_ring_count(mp->ring);
805 if ((cache_count + common_count) > mp->size)
806 common_count = mp->size - cache_count;
807 fprintf(f, " common_pool_count=%u\n", common_count);
809 /* sum and dump statistics */
810 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
811 memset(&sum, 0, sizeof(sum));
812 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
813 sum.put_bulk += mp->stats[lcore_id].put_bulk;
814 sum.put_objs += mp->stats[lcore_id].put_objs;
815 sum.get_success_bulk += mp->stats[lcore_id].get_success_bulk;
816 sum.get_success_objs += mp->stats[lcore_id].get_success_objs;
817 sum.get_fail_bulk += mp->stats[lcore_id].get_fail_bulk;
818 sum.get_fail_objs += mp->stats[lcore_id].get_fail_objs;
820 fprintf(f, " stats:\n");
821 fprintf(f, " put_bulk=%"PRIu64"\n", sum.put_bulk);
822 fprintf(f, " put_objs=%"PRIu64"\n", sum.put_objs);
823 fprintf(f, " get_success_bulk=%"PRIu64"\n", sum.get_success_bulk);
824 fprintf(f, " get_success_objs=%"PRIu64"\n", sum.get_success_objs);
825 fprintf(f, " get_fail_bulk=%"PRIu64"\n", sum.get_fail_bulk);
826 fprintf(f, " get_fail_objs=%"PRIu64"\n", sum.get_fail_objs);
828 fprintf(f, " no statistics available\n");
831 rte_mempool_audit(mp);
834 /* dump the status of all mempools on the console */
836 rte_mempool_list_dump(FILE *f)
838 const struct rte_mempool *mp = NULL;
839 struct rte_tailq_entry *te;
840 struct rte_mempool_list *mempool_list;
842 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
844 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
846 TAILQ_FOREACH(te, mempool_list, next) {
847 mp = (struct rte_mempool *) te->data;
848 rte_mempool_dump(f, mp);
851 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
854 /* search a mempool from its name */
856 rte_mempool_lookup(const char *name)
858 struct rte_mempool *mp = NULL;
859 struct rte_tailq_entry *te;
860 struct rte_mempool_list *mempool_list;
862 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
864 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
866 TAILQ_FOREACH(te, mempool_list, next) {
867 mp = (struct rte_mempool *) te->data;
868 if (strncmp(name, mp->name, RTE_MEMPOOL_NAMESIZE) == 0)
872 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
882 void rte_mempool_walk(void (*func)(const struct rte_mempool *, void *),
885 struct rte_tailq_entry *te = NULL;
886 struct rte_mempool_list *mempool_list;
888 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
890 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
892 TAILQ_FOREACH(te, mempool_list, next) {
893 (*func)((struct rte_mempool *) te->data, arg);
896 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);