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
73 * return the greatest common divisor between a and b (fast algorithm)
76 static unsigned get_gcd(unsigned a, unsigned b)
101 * Depending on memory configuration, objects addresses are spread
102 * between channels and ranks in RAM: the pool allocator will add
103 * padding between objects. This function return the new size of the
106 static unsigned optimize_object_size(unsigned obj_size)
108 unsigned nrank, nchan;
109 unsigned new_obj_size;
111 /* get number of channels */
112 nchan = rte_memory_get_nchannel();
116 nrank = rte_memory_get_nrank();
120 /* process new object size */
121 new_obj_size = (obj_size + RTE_CACHE_LINE_MASK) / RTE_CACHE_LINE_SIZE;
122 while (get_gcd(new_obj_size, nrank * nchan) != 1)
124 return new_obj_size * RTE_CACHE_LINE_SIZE;
128 mempool_add_elem(struct rte_mempool *mp, void *obj, uint32_t obj_idx,
129 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
131 struct rte_mempool **mpp;
133 obj = (char *)obj + mp->header_size;
135 /* set mempool ptr in header */
136 mpp = __mempool_from_obj(obj);
139 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
140 __mempool_write_header_cookie(obj, 1);
141 __mempool_write_trailer_cookie(obj);
143 /* call the initializer */
145 obj_init(mp, obj_init_arg, obj, obj_idx);
147 /* enqueue in ring */
148 rte_ring_sp_enqueue(mp->ring, obj);
152 rte_mempool_obj_iter(void *vaddr, uint32_t elt_num, size_t elt_sz, size_t align,
153 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift,
154 rte_mempool_obj_iter_t obj_iter, void *obj_iter_arg)
158 uintptr_t end, start, va;
161 pg_sz = (uintptr_t)1 << pg_shift;
162 va = (uintptr_t)vaddr;
167 while (i != elt_num && j != pg_num) {
169 start = RTE_ALIGN_CEIL(va, align);
170 end = start + elt_sz;
172 pgn = (end >> pg_shift) - (start >> pg_shift);
175 /* do we have enough space left for the next element. */
181 paddr[k] + pg_sz == paddr[k + 1];
186 * if next pgn chunks of memory physically continuous,
187 * use it to create next element.
188 * otherwise, just skip that chunk unused.
191 if (obj_iter != NULL)
192 obj_iter(obj_iter_arg, (void *)start,
198 va = RTE_ALIGN_CEIL((va + 1), pg_sz);
207 * Populate mempool with the objects.
210 struct mempool_populate_arg {
211 struct rte_mempool *mp;
212 rte_mempool_obj_ctor_t *obj_init;
217 mempool_obj_populate(void *arg, void *start, void *end, uint32_t idx)
219 struct mempool_populate_arg *pa = arg;
221 mempool_add_elem(pa->mp, start, idx, pa->obj_init, pa->obj_init_arg);
222 pa->mp->elt_va_end = (uintptr_t)end;
226 mempool_populate(struct rte_mempool *mp, size_t num, size_t align,
227 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
230 struct mempool_populate_arg arg;
232 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
234 arg.obj_init = obj_init;
235 arg.obj_init_arg = obj_init_arg;
237 mp->size = rte_mempool_obj_iter((void *)mp->elt_va_start,
239 mp->elt_pa, mp->pg_num, mp->pg_shift,
240 mempool_obj_populate, &arg);
244 rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
245 struct rte_mempool_objsz *sz)
247 struct rte_mempool_objsz lsz;
249 sz = (sz != NULL) ? sz : &lsz;
252 * In header, we have at least the pointer to the pool, and
253 * optionaly a 64 bits cookie.
256 sz->header_size += sizeof(struct rte_mempool *); /* ptr to pool */
257 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
258 sz->header_size += sizeof(uint64_t); /* cookie */
260 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0)
261 sz->header_size = RTE_ALIGN_CEIL(sz->header_size,
262 RTE_CACHE_LINE_SIZE);
264 /* trailer contains the cookie in debug mode */
265 sz->trailer_size = 0;
266 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
267 sz->trailer_size += sizeof(uint64_t); /* cookie */
269 /* element size is 8 bytes-aligned at least */
270 sz->elt_size = RTE_ALIGN_CEIL(elt_size, sizeof(uint64_t));
272 /* expand trailer to next cache line */
273 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0) {
274 sz->total_size = sz->header_size + sz->elt_size +
276 sz->trailer_size += ((RTE_CACHE_LINE_SIZE -
277 (sz->total_size & RTE_CACHE_LINE_MASK)) &
278 RTE_CACHE_LINE_MASK);
282 * increase trailer to add padding between objects in order to
283 * spread them across memory channels/ranks
285 if ((flags & MEMPOOL_F_NO_SPREAD) == 0) {
287 new_size = optimize_object_size(sz->header_size + sz->elt_size +
289 sz->trailer_size = new_size - sz->header_size - sz->elt_size;
292 if (! rte_eal_has_hugepages()) {
294 * compute trailer size so that pool elements fit exactly in
297 int page_size = getpagesize();
298 int new_size = page_size - sz->header_size - sz->elt_size;
299 if (new_size < 0 || (unsigned int)new_size < sz->trailer_size) {
300 printf("When hugepages are disabled, pool objects "
301 "can't exceed PAGE_SIZE: %d + %d + %d > %d\n",
302 sz->header_size, sz->elt_size, sz->trailer_size,
306 sz->trailer_size = new_size;
309 /* this is the size of an object, including header and trailer */
310 sz->total_size = sz->header_size + sz->elt_size + sz->trailer_size;
312 return (sz->total_size);
317 * Calculate maximum amount of memory required to store given number of objects.
320 rte_mempool_xmem_size(uint32_t elt_num, size_t elt_sz, uint32_t pg_shift)
322 size_t n, pg_num, pg_sz, sz;
324 pg_sz = (size_t)1 << pg_shift;
326 if ((n = pg_sz / elt_sz) > 0) {
327 pg_num = (elt_num + n - 1) / n;
328 sz = pg_num << pg_shift;
330 sz = RTE_ALIGN_CEIL(elt_sz, pg_sz) * elt_num;
337 * Calculate how much memory would be actually required with the
338 * given memory footprint to store required number of elements.
341 mempool_lelem_iter(void *arg, __rte_unused void *start, void *end,
342 __rte_unused uint32_t idx)
344 *(uintptr_t *)arg = (uintptr_t)end;
348 rte_mempool_xmem_usage(void *vaddr, uint32_t elt_num, size_t elt_sz,
349 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
355 pg_sz = (size_t)1 << pg_shift;
356 va = (uintptr_t)vaddr;
359 if ((n = rte_mempool_obj_iter(vaddr, elt_num, elt_sz, 1,
360 paddr, pg_num, pg_shift, mempool_lelem_iter,
365 uv = RTE_ALIGN_CEIL(uv, pg_sz);
370 /* create the mempool */
372 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
373 unsigned cache_size, unsigned private_data_size,
374 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
375 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
376 int socket_id, unsigned flags)
378 #ifdef RTE_LIBRTE_XEN_DOM0
379 return (rte_dom0_mempool_create(name, n, elt_size,
380 cache_size, private_data_size,
381 mp_init, mp_init_arg,
382 obj_init, obj_init_arg,
385 return (rte_mempool_xmem_create(name, n, elt_size,
386 cache_size, private_data_size,
387 mp_init, mp_init_arg,
388 obj_init, obj_init_arg,
390 NULL, NULL, MEMPOOL_PG_NUM_DEFAULT, MEMPOOL_PG_SHIFT_MAX));
395 * Create the mempool over already allocated chunk of memory.
396 * That external memory buffer can consists of physically disjoint pages.
397 * Setting vaddr to NULL, makes mempool to fallback to original behaviour
398 * and allocate space for mempool and it's elements as one big chunk of
399 * physically continuos memory.
402 rte_mempool_xmem_create(const char *name, unsigned n, unsigned elt_size,
403 unsigned cache_size, unsigned private_data_size,
404 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
405 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
406 int socket_id, unsigned flags, void *vaddr,
407 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
409 char mz_name[RTE_MEMZONE_NAMESIZE];
410 char rg_name[RTE_RING_NAMESIZE];
411 struct rte_mempool_list *mempool_list;
412 struct rte_mempool *mp = NULL;
413 struct rte_tailq_entry *te;
415 const struct rte_memzone *mz;
417 int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
420 struct rte_mempool_objsz objsz;
422 int page_size = getpagesize();
424 /* compilation-time checks */
425 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool) &
426 RTE_CACHE_LINE_MASK) != 0);
427 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
428 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_cache) &
429 RTE_CACHE_LINE_MASK) != 0);
430 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, local_cache) &
431 RTE_CACHE_LINE_MASK) != 0);
433 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
434 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_debug_stats) &
435 RTE_CACHE_LINE_MASK) != 0);
436 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, stats) &
437 RTE_CACHE_LINE_MASK) != 0);
440 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
442 /* asked cache too big */
443 if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE) {
448 /* check that we have both VA and PA */
449 if (vaddr != NULL && paddr == NULL) {
454 /* Check that pg_num and pg_shift parameters are valid. */
455 if (pg_num < RTE_DIM(mp->elt_pa) || pg_shift > MEMPOOL_PG_SHIFT_MAX) {
460 /* "no cache align" imply "no spread" */
461 if (flags & MEMPOOL_F_NO_CACHE_ALIGN)
462 flags |= MEMPOOL_F_NO_SPREAD;
465 if (flags & MEMPOOL_F_SP_PUT)
466 rg_flags |= RING_F_SP_ENQ;
467 if (flags & MEMPOOL_F_SC_GET)
468 rg_flags |= RING_F_SC_DEQ;
470 /* calculate mempool object sizes. */
471 if (!rte_mempool_calc_obj_size(elt_size, flags, &objsz)) {
476 rte_rwlock_write_lock(RTE_EAL_MEMPOOL_RWLOCK);
478 /* allocate the ring that will be used to store objects */
479 /* Ring functions will return appropriate errors if we are
480 * running as a secondary process etc., so no checks made
481 * in this function for that condition */
482 snprintf(rg_name, sizeof(rg_name), RTE_MEMPOOL_MZ_FORMAT, name);
483 r = rte_ring_create(rg_name, rte_align32pow2(n+1), socket_id, rg_flags);
488 * reserve a memory zone for this mempool: private data is
491 private_data_size = (private_data_size +
492 RTE_CACHE_LINE_MASK) & (~RTE_CACHE_LINE_MASK);
494 if (! rte_eal_has_hugepages()) {
496 * expand private data size to a whole page, so that the
497 * first pool element will start on a new standard page
499 int head = sizeof(struct rte_mempool);
500 int new_size = (private_data_size + head) % page_size;
502 private_data_size += page_size - new_size;
506 /* try to allocate tailq entry */
507 te = rte_zmalloc("MEMPOOL_TAILQ_ENTRY", sizeof(*te), 0);
509 RTE_LOG(ERR, MEMPOOL, "Cannot allocate tailq entry!\n");
514 * If user provided an external memory buffer, then use it to
515 * store mempool objects. Otherwise reserve memzone big enough to
516 * hold mempool header and metadata plus mempool objects.
518 mempool_size = MEMPOOL_HEADER_SIZE(mp, pg_num) + private_data_size;
520 mempool_size += (size_t)objsz.total_size * n;
522 if (! rte_eal_has_hugepages()) {
524 * we want the memory pool to start on a page boundary,
525 * because pool elements crossing page boundaries would
526 * result in discontiguous physical addresses
528 mempool_size += page_size;
531 snprintf(mz_name, sizeof(mz_name), RTE_MEMPOOL_MZ_FORMAT, name);
533 mz = rte_memzone_reserve(mz_name, mempool_size, socket_id, mz_flags);
536 * no more memory: in this case we loose previously reserved
537 * space for the as we cannot free it
544 if (rte_eal_has_hugepages()) {
545 startaddr = (void*)mz->addr;
547 /* align memory pool start address on a page boundary */
548 unsigned long addr = (unsigned long)mz->addr;
549 if (addr & (page_size - 1)) {
551 addr &= ~(page_size - 1);
553 startaddr = (void*)addr;
556 /* init the mempool structure */
558 memset(mp, 0, sizeof(*mp));
559 snprintf(mp->name, sizeof(mp->name), "%s", name);
560 mp->phys_addr = mz->phys_addr;
564 mp->elt_size = objsz.elt_size;
565 mp->header_size = objsz.header_size;
566 mp->trailer_size = objsz.trailer_size;
567 mp->cache_size = cache_size;
568 mp->cache_flushthresh = (uint32_t)
569 (cache_size * CACHE_FLUSHTHRESH_MULTIPLIER);
570 mp->private_data_size = private_data_size;
572 /* calculate address of the first element for continuous mempool. */
573 obj = (char *)mp + MEMPOOL_HEADER_SIZE(mp, pg_num) +
576 /* populate address translation fields. */
578 mp->pg_shift = pg_shift;
579 mp->pg_mask = RTE_LEN2MASK(mp->pg_shift, typeof(mp->pg_mask));
581 /* mempool elements allocated together with mempool */
583 mp->elt_va_start = (uintptr_t)obj;
584 mp->elt_pa[0] = mp->phys_addr +
585 (mp->elt_va_start - (uintptr_t)mp);
587 /* mempool elements in a separate chunk of memory. */
589 mp->elt_va_start = (uintptr_t)vaddr;
590 memcpy(mp->elt_pa, paddr, sizeof (mp->elt_pa[0]) * pg_num);
593 mp->elt_va_end = mp->elt_va_start;
595 /* call the initializer */
597 mp_init(mp, mp_init_arg);
599 mempool_populate(mp, n, 1, obj_init, obj_init_arg);
601 te->data = (void *) mp;
603 rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
604 TAILQ_INSERT_TAIL(mempool_list, te, next);
605 rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
608 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
613 /* Return the number of entries in the mempool */
615 rte_mempool_count(const struct rte_mempool *mp)
619 count = rte_ring_count(mp->ring);
621 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
624 if (mp->cache_size == 0)
627 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
628 count += mp->local_cache[lcore_id].len;
633 * due to race condition (access to len is not locked), the
634 * total can be greater than size... so fix the result
636 if (count > mp->size)
641 /* dump the cache status */
643 rte_mempool_dump_cache(FILE *f, const struct rte_mempool *mp)
645 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
648 unsigned cache_count;
650 fprintf(f, " cache infos:\n");
651 fprintf(f, " cache_size=%"PRIu32"\n", mp->cache_size);
652 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
653 cache_count = mp->local_cache[lcore_id].len;
654 fprintf(f, " cache_count[%u]=%u\n", lcore_id, cache_count);
655 count += cache_count;
657 fprintf(f, " total_cache_count=%u\n", count);
661 fprintf(f, " cache disabled\n");
666 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
667 /* check cookies before and after objects */
668 #ifndef __INTEL_COMPILER
669 #pragma GCC diagnostic ignored "-Wcast-qual"
672 struct mempool_audit_arg {
673 const struct rte_mempool *mp;
679 mempool_obj_audit(void *arg, void *start, void *end, uint32_t idx)
681 struct mempool_audit_arg *pa = arg;
684 obj = (char *)start + pa->mp->header_size;
685 pa->obj_end = (uintptr_t)end;
686 pa->obj_num = idx + 1;
687 __mempool_check_cookies(pa->mp, &obj, 1, 2);
691 mempool_audit_cookies(const struct rte_mempool *mp)
693 uint32_t elt_sz, num;
694 struct mempool_audit_arg arg;
696 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
699 arg.obj_end = mp->elt_va_start;
702 num = rte_mempool_obj_iter((void *)mp->elt_va_start,
704 mp->elt_pa, mp->pg_num, mp->pg_shift,
705 mempool_obj_audit, &arg);
707 if (num != mp->size) {
708 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
709 "iterated only over %u elements\n",
711 } else if (arg.obj_end != mp->elt_va_end || arg.obj_num != mp->size) {
712 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
713 "last callback va_end: %#tx (%#tx expeceted), "
714 "num of objects: %u (%u expected)\n",
716 arg.obj_end, mp->elt_va_end,
717 arg.obj_num, mp->size);
721 #ifndef __INTEL_COMPILER
722 #pragma GCC diagnostic error "-Wcast-qual"
725 #define mempool_audit_cookies(mp) do {} while(0)
728 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
729 /* check cookies before and after objects */
731 mempool_audit_cache(const struct rte_mempool *mp)
733 /* check cache size consistency */
735 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
736 if (mp->local_cache[lcore_id].len > mp->cache_flushthresh) {
737 RTE_LOG(CRIT, MEMPOOL, "badness on cache[%u]\n",
739 rte_panic("MEMPOOL: invalid cache len\n");
744 #define mempool_audit_cache(mp) do {} while(0)
748 /* check the consistency of mempool (size, cookies, ...) */
750 rte_mempool_audit(const struct rte_mempool *mp)
752 mempool_audit_cache(mp);
753 mempool_audit_cookies(mp);
755 /* For case where mempool DEBUG is not set, and cache size is 0 */
759 /* dump the status of the mempool on the console */
761 rte_mempool_dump(FILE *f, const struct rte_mempool *mp)
763 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
764 struct rte_mempool_debug_stats sum;
767 unsigned common_count;
768 unsigned cache_count;
770 RTE_VERIFY(f != NULL);
771 RTE_VERIFY(mp != NULL);
773 fprintf(f, "mempool <%s>@%p\n", mp->name, mp);
774 fprintf(f, " flags=%x\n", mp->flags);
775 fprintf(f, " ring=<%s>@%p\n", mp->ring->name, mp->ring);
776 fprintf(f, " phys_addr=0x%" PRIx64 "\n", mp->phys_addr);
777 fprintf(f, " size=%"PRIu32"\n", mp->size);
778 fprintf(f, " header_size=%"PRIu32"\n", mp->header_size);
779 fprintf(f, " elt_size=%"PRIu32"\n", mp->elt_size);
780 fprintf(f, " trailer_size=%"PRIu32"\n", mp->trailer_size);
781 fprintf(f, " total_obj_size=%"PRIu32"\n",
782 mp->header_size + mp->elt_size + mp->trailer_size);
784 fprintf(f, " private_data_size=%"PRIu32"\n", mp->private_data_size);
785 fprintf(f, " pg_num=%"PRIu32"\n", mp->pg_num);
786 fprintf(f, " pg_shift=%"PRIu32"\n", mp->pg_shift);
787 fprintf(f, " pg_mask=%#tx\n", mp->pg_mask);
788 fprintf(f, " elt_va_start=%#tx\n", mp->elt_va_start);
789 fprintf(f, " elt_va_end=%#tx\n", mp->elt_va_end);
790 fprintf(f, " elt_pa[0]=0x%" PRIx64 "\n", mp->elt_pa[0]);
793 fprintf(f, " avg bytes/object=%#Lf\n",
794 (long double)(mp->elt_va_end - mp->elt_va_start) /
797 cache_count = rte_mempool_dump_cache(f, mp);
798 common_count = rte_ring_count(mp->ring);
799 if ((cache_count + common_count) > mp->size)
800 common_count = mp->size - cache_count;
801 fprintf(f, " common_pool_count=%u\n", common_count);
803 /* sum and dump statistics */
804 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
805 memset(&sum, 0, sizeof(sum));
806 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
807 sum.put_bulk += mp->stats[lcore_id].put_bulk;
808 sum.put_objs += mp->stats[lcore_id].put_objs;
809 sum.get_success_bulk += mp->stats[lcore_id].get_success_bulk;
810 sum.get_success_objs += mp->stats[lcore_id].get_success_objs;
811 sum.get_fail_bulk += mp->stats[lcore_id].get_fail_bulk;
812 sum.get_fail_objs += mp->stats[lcore_id].get_fail_objs;
814 fprintf(f, " stats:\n");
815 fprintf(f, " put_bulk=%"PRIu64"\n", sum.put_bulk);
816 fprintf(f, " put_objs=%"PRIu64"\n", sum.put_objs);
817 fprintf(f, " get_success_bulk=%"PRIu64"\n", sum.get_success_bulk);
818 fprintf(f, " get_success_objs=%"PRIu64"\n", sum.get_success_objs);
819 fprintf(f, " get_fail_bulk=%"PRIu64"\n", sum.get_fail_bulk);
820 fprintf(f, " get_fail_objs=%"PRIu64"\n", sum.get_fail_objs);
822 fprintf(f, " no statistics available\n");
825 rte_mempool_audit(mp);
828 /* dump the status of all mempools on the console */
830 rte_mempool_list_dump(FILE *f)
832 const struct rte_mempool *mp = NULL;
833 struct rte_tailq_entry *te;
834 struct rte_mempool_list *mempool_list;
836 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
838 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
840 TAILQ_FOREACH(te, mempool_list, next) {
841 mp = (struct rte_mempool *) te->data;
842 rte_mempool_dump(f, mp);
845 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
848 /* search a mempool from its name */
850 rte_mempool_lookup(const char *name)
852 struct rte_mempool *mp = NULL;
853 struct rte_tailq_entry *te;
854 struct rte_mempool_list *mempool_list;
856 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
858 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
860 TAILQ_FOREACH(te, mempool_list, next) {
861 mp = (struct rte_mempool *) te->data;
862 if (strncmp(name, mp->name, RTE_MEMPOOL_NAMESIZE) == 0)
866 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
876 void rte_mempool_walk(void (*func)(const struct rte_mempool *, void *),
879 struct rte_tailq_entry *te = NULL;
880 struct rte_mempool_list *mempool_list;
882 mempool_list = RTE_TAILQ_CAST(rte_mempool_tailq.head, rte_mempool_list);
884 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
886 TAILQ_FOREACH(te, mempool_list, next) {
887 (*func)((struct rte_mempool *) te->data, arg);
890 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);