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_MEMPOOL_ALIGN_MASK) / RTE_MEMPOOL_ALIGN;
124 while (get_gcd(new_obj_size, nrank * nchan) != 1)
126 return new_obj_size * RTE_MEMPOOL_ALIGN;
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_objhdr *hdr;
134 struct rte_mempool_objtlr *tlr __rte_unused;
136 obj = (char *)obj + mp->header_size;
138 /* set mempool ptr in header */
139 hdr = RTE_PTR_SUB(obj, sizeof(*hdr));
142 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
143 hdr->cookie = RTE_MEMPOOL_HEADER_COOKIE2;
144 tlr = __mempool_get_trailer(obj);
145 tlr->cookie = RTE_MEMPOOL_TRAILER_COOKIE;
147 /* call the initializer */
149 obj_init(mp, obj_init_arg, obj, obj_idx);
151 /* enqueue in ring */
152 rte_ring_sp_enqueue(mp->ring, obj);
156 rte_mempool_obj_iter(void *vaddr, uint32_t elt_num, size_t elt_sz, size_t align,
157 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift,
158 rte_mempool_obj_iter_t obj_iter, void *obj_iter_arg)
162 uintptr_t end, start, va;
165 pg_sz = (uintptr_t)1 << pg_shift;
166 va = (uintptr_t)vaddr;
171 while (i != elt_num && j != pg_num) {
173 start = RTE_ALIGN_CEIL(va, align);
174 end = start + elt_sz;
176 /* index of the first page for the next element. */
177 pgf = (end >> pg_shift) - (start >> pg_shift);
179 /* index of the last page for the current element. */
180 pgn = ((end - 1) >> pg_shift) - (start >> pg_shift);
183 /* do we have enough space left for the element. */
189 paddr[k] + pg_sz == paddr[k + 1];
194 * if next pgn chunks of memory physically continuous,
195 * use it to create next element.
196 * otherwise, just skip that chunk unused.
199 if (obj_iter != NULL)
200 obj_iter(obj_iter_arg, (void *)start,
206 va = RTE_ALIGN_CEIL((va + 1), pg_sz);
215 * Populate mempool with the objects.
218 struct mempool_populate_arg {
219 struct rte_mempool *mp;
220 rte_mempool_obj_ctor_t *obj_init;
225 mempool_obj_populate(void *arg, void *start, void *end, uint32_t idx)
227 struct mempool_populate_arg *pa = arg;
229 mempool_add_elem(pa->mp, start, idx, pa->obj_init, pa->obj_init_arg);
230 pa->mp->elt_va_end = (uintptr_t)end;
234 mempool_populate(struct rte_mempool *mp, size_t num, size_t align,
235 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
238 struct mempool_populate_arg arg;
240 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
242 arg.obj_init = obj_init;
243 arg.obj_init_arg = obj_init_arg;
245 mp->size = rte_mempool_obj_iter((void *)mp->elt_va_start,
247 mp->elt_pa, mp->pg_num, mp->pg_shift,
248 mempool_obj_populate, &arg);
252 rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
253 struct rte_mempool_objsz *sz)
255 struct rte_mempool_objsz lsz;
257 sz = (sz != NULL) ? sz : &lsz;
260 * In header, we have at least the pointer to the pool, and
261 * optionaly a 64 bits cookie.
264 sz->header_size += sizeof(struct rte_mempool *); /* ptr to pool */
265 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
266 sz->header_size += sizeof(uint64_t); /* cookie */
268 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0)
269 sz->header_size = RTE_ALIGN_CEIL(sz->header_size,
272 /* trailer contains the cookie in debug mode */
273 sz->trailer_size = 0;
274 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
275 sz->trailer_size += sizeof(uint64_t); /* cookie */
277 /* element size is 8 bytes-aligned at least */
278 sz->elt_size = RTE_ALIGN_CEIL(elt_size, sizeof(uint64_t));
280 /* expand trailer to next cache line */
281 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0) {
282 sz->total_size = sz->header_size + sz->elt_size +
284 sz->trailer_size += ((RTE_MEMPOOL_ALIGN -
285 (sz->total_size & RTE_MEMPOOL_ALIGN_MASK)) &
286 RTE_MEMPOOL_ALIGN_MASK);
290 * increase trailer to add padding between objects in order to
291 * spread them across memory channels/ranks
293 if ((flags & MEMPOOL_F_NO_SPREAD) == 0) {
295 new_size = optimize_object_size(sz->header_size + sz->elt_size +
297 sz->trailer_size = new_size - sz->header_size - sz->elt_size;
300 if (! rte_eal_has_hugepages()) {
302 * compute trailer size so that pool elements fit exactly in
305 int page_size = getpagesize();
306 int new_size = page_size - sz->header_size - sz->elt_size;
307 if (new_size < 0 || (unsigned int)new_size < sz->trailer_size) {
308 printf("When hugepages are disabled, pool objects "
309 "can't exceed PAGE_SIZE: %d + %d + %d > %d\n",
310 sz->header_size, sz->elt_size, sz->trailer_size,
314 sz->trailer_size = new_size;
317 /* this is the size of an object, including header and trailer */
318 sz->total_size = sz->header_size + sz->elt_size + sz->trailer_size;
320 return sz->total_size;
325 * Calculate maximum amount of memory required to store given number of objects.
328 rte_mempool_xmem_size(uint32_t elt_num, size_t elt_sz, uint32_t pg_shift)
330 size_t n, pg_num, pg_sz, sz;
332 pg_sz = (size_t)1 << pg_shift;
334 if ((n = pg_sz / elt_sz) > 0) {
335 pg_num = (elt_num + n - 1) / n;
336 sz = pg_num << pg_shift;
338 sz = RTE_ALIGN_CEIL(elt_sz, pg_sz) * elt_num;
345 * Calculate how much memory would be actually required with the
346 * given memory footprint to store required number of elements.
349 mempool_lelem_iter(void *arg, __rte_unused void *start, void *end,
350 __rte_unused uint32_t idx)
352 *(uintptr_t *)arg = (uintptr_t)end;
356 rte_mempool_xmem_usage(void *vaddr, uint32_t elt_num, size_t elt_sz,
357 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
363 pg_sz = (size_t)1 << pg_shift;
364 va = (uintptr_t)vaddr;
367 if ((n = rte_mempool_obj_iter(vaddr, elt_num, elt_sz, 1,
368 paddr, pg_num, pg_shift, mempool_lelem_iter,
373 uv = RTE_ALIGN_CEIL(uv, pg_sz);
378 /* create the mempool */
380 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
381 unsigned cache_size, unsigned private_data_size,
382 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
383 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
384 int socket_id, unsigned flags)
386 #ifdef RTE_LIBRTE_XEN_DOM0
387 return rte_dom0_mempool_create(name, n, elt_size,
388 cache_size, private_data_size,
389 mp_init, mp_init_arg,
390 obj_init, obj_init_arg,
393 return rte_mempool_xmem_create(name, n, elt_size,
394 cache_size, private_data_size,
395 mp_init, mp_init_arg,
396 obj_init, obj_init_arg,
398 NULL, NULL, MEMPOOL_PG_NUM_DEFAULT, MEMPOOL_PG_SHIFT_MAX);
403 * Create the mempool over already allocated chunk of memory.
404 * That external memory buffer can consists of physically disjoint pages.
405 * Setting vaddr to NULL, makes mempool to fallback to original behaviour
406 * and allocate space for mempool and it's elements as one big chunk of
407 * physically continuos memory.
410 rte_mempool_xmem_create(const char *name, unsigned n, unsigned elt_size,
411 unsigned cache_size, unsigned private_data_size,
412 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
413 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
414 int socket_id, unsigned flags, void *vaddr,
415 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
417 char mz_name[RTE_MEMZONE_NAMESIZE];
418 char rg_name[RTE_RING_NAMESIZE];
419 struct rte_mempool_list *mempool_list;
420 struct rte_mempool *mp = NULL;
421 struct rte_tailq_entry *te;
423 const struct rte_memzone *mz;
425 int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
428 struct rte_mempool_objsz objsz;
430 int page_size = getpagesize();
432 /* compilation-time checks */
433 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool) &
434 RTE_CACHE_LINE_MASK) != 0);
435 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
436 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_cache) &
437 RTE_CACHE_LINE_MASK) != 0);
438 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, local_cache) &
439 RTE_CACHE_LINE_MASK) != 0);
441 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
442 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_debug_stats) &
443 RTE_CACHE_LINE_MASK) != 0);
444 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, stats) &
445 RTE_CACHE_LINE_MASK) != 0);
448 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
450 /* asked cache too big */
451 if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE ||
452 CALC_CACHE_FLUSHTHRESH(cache_size) > n) {
457 /* check that we have both VA and PA */
458 if (vaddr != NULL && paddr == NULL) {
463 /* Check that pg_num and pg_shift parameters are valid. */
464 if (pg_num < RTE_DIM(mp->elt_pa) || pg_shift > MEMPOOL_PG_SHIFT_MAX) {
469 /* "no cache align" imply "no spread" */
470 if (flags & MEMPOOL_F_NO_CACHE_ALIGN)
471 flags |= MEMPOOL_F_NO_SPREAD;
474 if (flags & MEMPOOL_F_SP_PUT)
475 rg_flags |= RING_F_SP_ENQ;
476 if (flags & MEMPOOL_F_SC_GET)
477 rg_flags |= RING_F_SC_DEQ;
479 /* calculate mempool object sizes. */
480 if (!rte_mempool_calc_obj_size(elt_size, flags, &objsz)) {
485 rte_rwlock_write_lock(RTE_EAL_MEMPOOL_RWLOCK);
487 /* allocate the ring that will be used to store objects */
488 /* Ring functions will return appropriate errors if we are
489 * running as a secondary process etc., so no checks made
490 * in this function for that condition */
491 snprintf(rg_name, sizeof(rg_name), RTE_MEMPOOL_MZ_FORMAT, name);
492 r = rte_ring_create(rg_name, rte_align32pow2(n+1), socket_id, rg_flags);
497 * reserve a memory zone for this mempool: private data is
500 private_data_size = (private_data_size +
501 RTE_MEMPOOL_ALIGN_MASK) & (~RTE_MEMPOOL_ALIGN_MASK);
503 if (! rte_eal_has_hugepages()) {
505 * expand private data size to a whole page, so that the
506 * first pool element will start on a new standard page
508 int head = sizeof(struct rte_mempool);
509 int new_size = (private_data_size + head) % page_size;
511 private_data_size += page_size - new_size;
515 /* try to allocate tailq entry */
516 te = rte_zmalloc("MEMPOOL_TAILQ_ENTRY", sizeof(*te), 0);
518 RTE_LOG(ERR, MEMPOOL, "Cannot allocate tailq entry!\n");
523 * If user provided an external memory buffer, then use it to
524 * store mempool objects. Otherwise reserve a memzone that is large
525 * enough to hold mempool header and metadata plus mempool objects.
527 mempool_size = MEMPOOL_HEADER_SIZE(mp, pg_num) + private_data_size;
528 mempool_size = RTE_ALIGN_CEIL(mempool_size, RTE_MEMPOOL_ALIGN);
530 mempool_size += (size_t)objsz.total_size * n;
532 if (! rte_eal_has_hugepages()) {
534 * we want the memory pool to start on a page boundary,
535 * because pool elements crossing page boundaries would
536 * result in discontiguous physical addresses
538 mempool_size += page_size;
541 snprintf(mz_name, sizeof(mz_name), RTE_MEMPOOL_MZ_FORMAT, name);
543 mz = rte_memzone_reserve(mz_name, mempool_size, socket_id, mz_flags);
546 * no more memory: in this case we loose previously reserved
547 * space for the ring as we cannot free it
554 if (rte_eal_has_hugepages()) {
555 startaddr = (void*)mz->addr;
557 /* align memory pool start address on a page boundary */
558 unsigned long addr = (unsigned long)mz->addr;
559 if (addr & (page_size - 1)) {
561 addr &= ~(page_size - 1);
563 startaddr = (void*)addr;
566 /* init the mempool structure */
568 memset(mp, 0, sizeof(*mp));
569 snprintf(mp->name, sizeof(mp->name), "%s", name);
570 mp->phys_addr = mz->phys_addr;
574 mp->elt_size = objsz.elt_size;
575 mp->header_size = objsz.header_size;
576 mp->trailer_size = objsz.trailer_size;
577 mp->cache_size = cache_size;
578 mp->cache_flushthresh = CALC_CACHE_FLUSHTHRESH(cache_size);
579 mp->private_data_size = private_data_size;
581 /* calculate address of the first element for continuous mempool. */
582 obj = (char *)mp + MEMPOOL_HEADER_SIZE(mp, pg_num) +
584 obj = RTE_PTR_ALIGN_CEIL(obj, RTE_MEMPOOL_ALIGN);
586 /* populate address translation fields. */
588 mp->pg_shift = pg_shift;
589 mp->pg_mask = RTE_LEN2MASK(mp->pg_shift, typeof(mp->pg_mask));
591 /* mempool elements allocated together with mempool */
593 mp->elt_va_start = (uintptr_t)obj;
594 mp->elt_pa[0] = mp->phys_addr +
595 (mp->elt_va_start - (uintptr_t)mp);
597 /* mempool elements in a separate chunk of memory. */
599 mp->elt_va_start = (uintptr_t)vaddr;
600 memcpy(mp->elt_pa, paddr, sizeof (mp->elt_pa[0]) * pg_num);
603 mp->elt_va_end = mp->elt_va_start;
605 /* call the initializer */
607 mp_init(mp, mp_init_arg);
609 mempool_populate(mp, n, 1, obj_init, obj_init_arg);
611 te->data = (void *) mp;
613 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
614 TAILQ_INSERT_TAIL(mempool_list, te, next);
615 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
618 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
623 /* Return the number of entries in the mempool */
625 rte_mempool_count(const struct rte_mempool *mp)
629 count = rte_ring_count(mp->ring);
631 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
634 if (mp->cache_size == 0)
637 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
638 count += mp->local_cache[lcore_id].len;
643 * due to race condition (access to len is not locked), the
644 * total can be greater than size... so fix the result
646 if (count > mp->size)
651 /* dump the cache status */
653 rte_mempool_dump_cache(FILE *f, const struct rte_mempool *mp)
655 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
658 unsigned cache_count;
660 fprintf(f, " cache infos:\n");
661 fprintf(f, " cache_size=%"PRIu32"\n", mp->cache_size);
662 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
663 cache_count = mp->local_cache[lcore_id].len;
664 fprintf(f, " cache_count[%u]=%u\n", lcore_id, cache_count);
665 count += cache_count;
667 fprintf(f, " total_cache_count=%u\n", count);
671 fprintf(f, " cache disabled\n");
676 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
677 /* check cookies before and after objects */
678 #ifndef __INTEL_COMPILER
679 #pragma GCC diagnostic ignored "-Wcast-qual"
682 struct mempool_audit_arg {
683 const struct rte_mempool *mp;
689 mempool_obj_audit(void *arg, void *start, void *end, uint32_t idx)
691 struct mempool_audit_arg *pa = arg;
694 obj = (char *)start + pa->mp->header_size;
695 pa->obj_end = (uintptr_t)end;
696 pa->obj_num = idx + 1;
697 __mempool_check_cookies(pa->mp, &obj, 1, 2);
701 mempool_audit_cookies(const struct rte_mempool *mp)
703 uint32_t elt_sz, num;
704 struct mempool_audit_arg arg;
706 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
709 arg.obj_end = mp->elt_va_start;
712 num = rte_mempool_obj_iter((void *)mp->elt_va_start,
714 mp->elt_pa, mp->pg_num, mp->pg_shift,
715 mempool_obj_audit, &arg);
717 if (num != mp->size) {
718 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
719 "iterated only over %u elements\n",
721 } else if (arg.obj_end != mp->elt_va_end || arg.obj_num != mp->size) {
722 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
723 "last callback va_end: %#tx (%#tx expeceted), "
724 "num of objects: %u (%u expected)\n",
726 arg.obj_end, mp->elt_va_end,
727 arg.obj_num, mp->size);
731 #ifndef __INTEL_COMPILER
732 #pragma GCC diagnostic error "-Wcast-qual"
735 #define mempool_audit_cookies(mp) do {} while(0)
738 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
739 /* check cookies before and after objects */
741 mempool_audit_cache(const struct rte_mempool *mp)
743 /* check cache size consistency */
745 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
746 if (mp->local_cache[lcore_id].len > mp->cache_flushthresh) {
747 RTE_LOG(CRIT, MEMPOOL, "badness on cache[%u]\n",
749 rte_panic("MEMPOOL: invalid cache len\n");
754 #define mempool_audit_cache(mp) do {} while(0)
758 /* check the consistency of mempool (size, cookies, ...) */
760 rte_mempool_audit(const struct rte_mempool *mp)
762 mempool_audit_cache(mp);
763 mempool_audit_cookies(mp);
765 /* For case where mempool DEBUG is not set, and cache size is 0 */
769 /* dump the status of the mempool on the console */
771 rte_mempool_dump(FILE *f, const struct rte_mempool *mp)
773 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
774 struct rte_mempool_debug_stats sum;
777 unsigned common_count;
778 unsigned cache_count;
780 RTE_VERIFY(f != NULL);
781 RTE_VERIFY(mp != NULL);
783 fprintf(f, "mempool <%s>@%p\n", mp->name, mp);
784 fprintf(f, " flags=%x\n", mp->flags);
785 fprintf(f, " ring=<%s>@%p\n", mp->ring->name, mp->ring);
786 fprintf(f, " phys_addr=0x%" PRIx64 "\n", mp->phys_addr);
787 fprintf(f, " size=%"PRIu32"\n", mp->size);
788 fprintf(f, " header_size=%"PRIu32"\n", mp->header_size);
789 fprintf(f, " elt_size=%"PRIu32"\n", mp->elt_size);
790 fprintf(f, " trailer_size=%"PRIu32"\n", mp->trailer_size);
791 fprintf(f, " total_obj_size=%"PRIu32"\n",
792 mp->header_size + mp->elt_size + mp->trailer_size);
794 fprintf(f, " private_data_size=%"PRIu32"\n", mp->private_data_size);
795 fprintf(f, " pg_num=%"PRIu32"\n", mp->pg_num);
796 fprintf(f, " pg_shift=%"PRIu32"\n", mp->pg_shift);
797 fprintf(f, " pg_mask=%#tx\n", mp->pg_mask);
798 fprintf(f, " elt_va_start=%#tx\n", mp->elt_va_start);
799 fprintf(f, " elt_va_end=%#tx\n", mp->elt_va_end);
800 fprintf(f, " elt_pa[0]=0x%" PRIx64 "\n", mp->elt_pa[0]);
803 fprintf(f, " avg bytes/object=%#Lf\n",
804 (long double)(mp->elt_va_end - mp->elt_va_start) /
807 cache_count = rte_mempool_dump_cache(f, mp);
808 common_count = rte_ring_count(mp->ring);
809 if ((cache_count + common_count) > mp->size)
810 common_count = mp->size - cache_count;
811 fprintf(f, " common_pool_count=%u\n", common_count);
813 /* sum and dump statistics */
814 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
815 memset(&sum, 0, sizeof(sum));
816 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
817 sum.put_bulk += mp->stats[lcore_id].put_bulk;
818 sum.put_objs += mp->stats[lcore_id].put_objs;
819 sum.get_success_bulk += mp->stats[lcore_id].get_success_bulk;
820 sum.get_success_objs += mp->stats[lcore_id].get_success_objs;
821 sum.get_fail_bulk += mp->stats[lcore_id].get_fail_bulk;
822 sum.get_fail_objs += mp->stats[lcore_id].get_fail_objs;
824 fprintf(f, " stats:\n");
825 fprintf(f, " put_bulk=%"PRIu64"\n", sum.put_bulk);
826 fprintf(f, " put_objs=%"PRIu64"\n", sum.put_objs);
827 fprintf(f, " get_success_bulk=%"PRIu64"\n", sum.get_success_bulk);
828 fprintf(f, " get_success_objs=%"PRIu64"\n", sum.get_success_objs);
829 fprintf(f, " get_fail_bulk=%"PRIu64"\n", sum.get_fail_bulk);
830 fprintf(f, " get_fail_objs=%"PRIu64"\n", sum.get_fail_objs);
832 fprintf(f, " no statistics available\n");
835 rte_mempool_audit(mp);
838 /* dump the status of all mempools on the console */
840 rte_mempool_list_dump(FILE *f)
842 const struct rte_mempool *mp = NULL;
843 struct rte_tailq_entry *te;
844 struct rte_mempool_list *mempool_list;
846 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
848 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
850 TAILQ_FOREACH(te, mempool_list, next) {
851 mp = (struct rte_mempool *) te->data;
852 rte_mempool_dump(f, mp);
855 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
858 /* search a mempool from its name */
860 rte_mempool_lookup(const char *name)
862 struct rte_mempool *mp = NULL;
863 struct rte_tailq_entry *te;
864 struct rte_mempool_list *mempool_list;
866 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
868 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
870 TAILQ_FOREACH(te, mempool_list, next) {
871 mp = (struct rte_mempool *) te->data;
872 if (strncmp(name, mp->name, RTE_MEMPOOL_NAMESIZE) == 0)
876 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
886 void rte_mempool_walk(void (*func)(const struct rte_mempool *, void *),
889 struct rte_tailq_entry *te = NULL;
890 struct rte_mempool_list *mempool_list;
892 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
894 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
896 TAILQ_FOREACH(te, mempool_list, next) {
897 (*func)((struct rte_mempool *) te->data, arg);
900 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);