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_atomic.h>
49 #include <rte_launch.h>
50 #include <rte_tailq.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_mempool);
65 #define CACHE_FLUSHTHRESH_MULTIPLIER 1.5
68 * return the greatest common divisor between a and b (fast algorithm)
71 static unsigned get_gcd(unsigned a, unsigned b)
96 * Depending on memory configuration, objects addresses are spreaded
97 * between channels and ranks in RAM: the pool allocator will add
98 * padding between objects. This function return the new size of the
101 static unsigned optimize_object_size(unsigned obj_size)
103 unsigned nrank, nchan;
104 unsigned new_obj_size;
106 /* get number of channels */
107 nchan = rte_memory_get_nchannel();
111 nrank = rte_memory_get_nrank();
115 /* process new object size */
116 new_obj_size = (obj_size + CACHE_LINE_MASK) / CACHE_LINE_SIZE;
117 while (get_gcd(new_obj_size, nrank * nchan) != 1 ||
118 get_gcd(nchan, new_obj_size) != 1)
120 return new_obj_size * CACHE_LINE_SIZE;
124 mempool_add_elem(struct rte_mempool *mp, void *obj, uint32_t obj_idx,
125 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
127 struct rte_mempool **mpp;
129 obj = (char *)obj + mp->header_size;
131 /* set mempool ptr in header */
132 mpp = __mempool_from_obj(obj);
135 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
136 __mempool_write_header_cookie(obj, 1);
137 __mempool_write_trailer_cookie(obj);
139 /* call the initializer */
141 obj_init(mp, obj_init_arg, obj, obj_idx);
143 /* enqueue in ring */
144 rte_ring_sp_enqueue(mp->ring, obj);
148 rte_mempool_obj_iter(void *vaddr, uint32_t elt_num, size_t elt_sz, size_t align,
149 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift,
150 rte_mempool_obj_iter_t obj_iter, void *obj_iter_arg)
154 uintptr_t end, start, va;
157 pg_sz = (uintptr_t)1 << pg_shift;
158 va = (uintptr_t)vaddr;
163 while (i != elt_num && j != pg_num) {
165 start = RTE_ALIGN_CEIL(va, align);
166 end = start + elt_sz;
168 pgn = (end >> pg_shift) - (start >> pg_shift);
171 /* do we have enough space left for the next element. */
177 paddr[k] + pg_sz == paddr[k + 1];
182 * if next pgn chunks of memory physically continuous,
183 * use it to create next element.
184 * otherwise, just skip that chunk unused.
187 if (obj_iter != NULL)
188 obj_iter(obj_iter_arg, (void *)start,
194 va = RTE_ALIGN_CEIL((va + 1), pg_sz);
203 * Populate mempool with the objects.
206 struct mempool_populate_arg {
207 struct rte_mempool *mp;
208 rte_mempool_obj_ctor_t *obj_init;
213 mempool_obj_populate(void *arg, void *start, void *end, uint32_t idx)
215 struct mempool_populate_arg *pa = arg;
217 mempool_add_elem(pa->mp, start, idx, pa->obj_init, pa->obj_init_arg);
218 pa->mp->elt_va_end = (uintptr_t)end;
222 mempool_populate(struct rte_mempool *mp, size_t num, size_t align,
223 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
226 struct mempool_populate_arg arg;
228 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
230 arg.obj_init = obj_init;
231 arg.obj_init_arg = obj_init_arg;
233 mp->size = rte_mempool_obj_iter((void *)mp->elt_va_start,
235 mp->elt_pa, mp->pg_num, mp->pg_shift,
236 mempool_obj_populate, &arg);
240 rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
241 struct rte_mempool_objsz *sz)
243 struct rte_mempool_objsz lsz;
245 sz = (sz != NULL) ? sz : &lsz;
248 * In header, we have at least the pointer to the pool, and
249 * optionaly a 64 bits cookie.
252 sz->header_size += sizeof(struct rte_mempool *); /* ptr to pool */
253 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
254 sz->header_size += sizeof(uint64_t); /* cookie */
256 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0)
257 sz->header_size = RTE_ALIGN_CEIL(sz->header_size,
260 /* trailer contains the cookie in debug mode */
261 sz->trailer_size = 0;
262 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
263 sz->trailer_size += sizeof(uint64_t); /* cookie */
265 /* element size is 8 bytes-aligned at least */
266 sz->elt_size = RTE_ALIGN_CEIL(elt_size, sizeof(uint64_t));
268 /* expand trailer to next cache line */
269 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0) {
270 sz->total_size = sz->header_size + sz->elt_size +
272 sz->trailer_size += ((CACHE_LINE_SIZE -
273 (sz->total_size & CACHE_LINE_MASK)) &
278 * increase trailer to add padding between objects in order to
279 * spread them accross memory channels/ranks
281 if ((flags & MEMPOOL_F_NO_SPREAD) == 0) {
283 new_size = optimize_object_size(sz->header_size + sz->elt_size +
285 sz->trailer_size = new_size - sz->header_size - sz->elt_size;
288 if (! rte_eal_has_hugepages()) {
290 * compute trailer size so that pool elements fit exactly in
293 int page_size = getpagesize();
294 int new_size = page_size - sz->header_size - sz->elt_size;
295 if (new_size < 0 || (unsigned int)new_size < sz->trailer_size) {
296 printf("When hugepages are disabled, pool objects "
297 "can't exceed PAGE_SIZE: %d + %d + %d > %d\n",
298 sz->header_size, sz->elt_size, sz->trailer_size,
302 sz->trailer_size = new_size;
305 /* this is the size of an object, including header and trailer */
306 sz->total_size = sz->header_size + sz->elt_size + sz->trailer_size;
308 return (sz->total_size);
313 * Calculate maximum amount of memory required to store given number of objects.
316 rte_mempool_xmem_size(uint32_t elt_num, size_t elt_sz, uint32_t pg_shift)
318 size_t n, pg_num, pg_sz, sz;
320 pg_sz = (size_t)1 << pg_shift;
322 if ((n = pg_sz / elt_sz) > 0) {
323 pg_num = (elt_num + n - 1) / n;
324 sz = pg_num << pg_shift;
326 sz = RTE_ALIGN_CEIL(elt_sz, pg_sz) * elt_num;
333 * Calculate how much memory would be actually required with the
334 * given memory footprint to store required number of elements.
337 mempool_lelem_iter(void *arg, __rte_unused void *start, void *end,
338 __rte_unused uint32_t idx)
340 *(uintptr_t *)arg = (uintptr_t)end;
344 rte_mempool_xmem_usage(void *vaddr, uint32_t elt_num, size_t elt_sz,
345 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
351 pg_sz = (size_t)1 << pg_shift;
352 va = (uintptr_t)vaddr;
355 if ((n = rte_mempool_obj_iter(vaddr, elt_num, elt_sz, 1,
356 paddr, pg_num, pg_shift, mempool_lelem_iter,
361 uv = RTE_ALIGN_CEIL(uv, pg_sz);
366 /* create the mempool */
368 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
369 unsigned cache_size, unsigned private_data_size,
370 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
371 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
372 int socket_id, unsigned flags)
374 #ifdef RTE_LIBRTE_XEN_DOM0
375 return (rte_dom0_mempool_create(name, n, elt_size,
376 cache_size, private_data_size,
377 mp_init, mp_init_arg,
378 obj_init, obj_init_arg,
381 return (rte_mempool_xmem_create(name, n, elt_size,
382 cache_size, private_data_size,
383 mp_init, mp_init_arg,
384 obj_init, obj_init_arg,
386 NULL, NULL, MEMPOOL_PG_NUM_DEFAULT, MEMPOOL_PG_SHIFT_MAX));
391 * Create the mempool over already allocated chunk of memory.
392 * That external memory buffer can consists of physically disjoint pages.
393 * Setting vaddr to NULL, makes mempool to fallback to original behaviour
394 * and allocate space for mempool and it's elements as one big chunk of
395 * physically continuos memory.
398 rte_mempool_xmem_create(const char *name, unsigned n, unsigned elt_size,
399 unsigned cache_size, unsigned private_data_size,
400 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
401 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
402 int socket_id, unsigned flags, void *vaddr,
403 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
405 char mz_name[RTE_MEMZONE_NAMESIZE];
406 char rg_name[RTE_RING_NAMESIZE];
407 struct rte_mempool *mp = NULL;
409 const struct rte_memzone *mz;
411 int mz_flags = RTE_MEMZONE_1GB|RTE_MEMZONE_SIZE_HINT_ONLY;
414 struct rte_mempool_objsz objsz;
416 int page_size = getpagesize();
418 /* compilation-time checks */
419 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool) &
420 CACHE_LINE_MASK) != 0);
421 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
422 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_cache) &
423 CACHE_LINE_MASK) != 0);
424 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, local_cache) &
425 CACHE_LINE_MASK) != 0);
427 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
428 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_debug_stats) &
429 CACHE_LINE_MASK) != 0);
430 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, stats) &
431 CACHE_LINE_MASK) != 0);
434 /* check that we have an initialised tail queue */
435 if (RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_MEMPOOL,
436 rte_mempool_list) == NULL) {
437 rte_errno = E_RTE_NO_TAILQ;
441 /* asked cache too big */
442 if (cache_size > RTE_MEMPOOL_CACHE_MAX_SIZE) {
447 /* check that we have both VA and PA */
448 if (vaddr != NULL && paddr == NULL) {
453 /* Check that pg_num and pg_shift parameters are valid. */
454 if (pg_num < RTE_DIM(mp->elt_pa) || pg_shift > MEMPOOL_PG_SHIFT_MAX) {
459 /* "no cache align" imply "no spread" */
460 if (flags & MEMPOOL_F_NO_CACHE_ALIGN)
461 flags |= MEMPOOL_F_NO_SPREAD;
464 if (flags & MEMPOOL_F_SP_PUT)
465 rg_flags |= RING_F_SP_ENQ;
466 if (flags & MEMPOOL_F_SC_GET)
467 rg_flags |= RING_F_SC_DEQ;
469 /* calculate mempool object sizes. */
470 if (!rte_mempool_calc_obj_size(elt_size, flags, &objsz)) {
475 rte_rwlock_write_lock(RTE_EAL_MEMPOOL_RWLOCK);
477 /* allocate the ring that will be used to store objects */
478 /* Ring functions will return appropriate errors if we are
479 * running as a secondary process etc., so no checks made
480 * in this function for that condition */
481 rte_snprintf(rg_name, sizeof(rg_name), RTE_MEMPOOL_MZ_FORMAT, name);
482 r = rte_ring_create(rg_name, rte_align32pow2(n+1), socket_id, rg_flags);
487 * reserve a memory zone for this mempool: private data is
490 private_data_size = (private_data_size +
491 CACHE_LINE_MASK) & (~CACHE_LINE_MASK);
493 if (! rte_eal_has_hugepages()) {
495 * expand private data size to a whole page, so that the
496 * first pool element will start on a new standard page
498 int head = sizeof(struct rte_mempool);
499 int new_size = (private_data_size + head) % page_size;
501 private_data_size += page_size - new_size;
506 * If user provided an external memory buffer, then use it to
507 * store mempool objects. Otherwise reserve memzone big enough to
508 * hold mempool header and metadata plus mempool objects.
510 mempool_size = MEMPOOL_HEADER_SIZE(mp, pg_num) + private_data_size;
512 mempool_size += (size_t)objsz.total_size * n;
514 if (! rte_eal_has_hugepages()) {
516 * we want the memory pool to start on a page boundary,
517 * because pool elements crossing page boundaries would
518 * result in discontiguous physical addresses
520 mempool_size += page_size;
523 rte_snprintf(mz_name, sizeof(mz_name), RTE_MEMPOOL_MZ_FORMAT, name);
525 mz = rte_memzone_reserve(mz_name, mempool_size, socket_id, mz_flags);
528 * no more memory: in this case we loose previously reserved
529 * space for the as we cannot free it
534 if (rte_eal_has_hugepages()) {
535 startaddr = (void*)mz->addr;
537 /* align memory pool start address on a page boundary */
538 unsigned long addr = (unsigned long)mz->addr;
539 if (addr & (page_size - 1)) {
541 addr &= ~(page_size - 1);
543 startaddr = (void*)addr;
546 /* init the mempool structure */
548 memset(mp, 0, sizeof(*mp));
549 rte_snprintf(mp->name, sizeof(mp->name), "%s", name);
550 mp->phys_addr = mz->phys_addr;
554 mp->elt_size = objsz.elt_size;
555 mp->header_size = objsz.header_size;
556 mp->trailer_size = objsz.trailer_size;
557 mp->cache_size = cache_size;
558 mp->cache_flushthresh = (uint32_t)
559 (cache_size * CACHE_FLUSHTHRESH_MULTIPLIER);
560 mp->private_data_size = private_data_size;
562 /* calculate address of the first element for continuous mempool. */
563 obj = (char *)mp + MEMPOOL_HEADER_SIZE(mp, pg_num) +
566 /* populate address translation fields. */
568 mp->pg_shift = pg_shift;
569 mp->pg_mask = RTE_LEN2MASK(mp->pg_shift, typeof(mp->pg_mask));
571 /* mempool elements allocated together with mempool */
573 mp->elt_va_start = (uintptr_t)obj;
574 mp->elt_pa[0] = mp->phys_addr +
575 (mp->elt_va_start - (uintptr_t)mp);
577 /* mempool elements in a separate chunk of memory. */
579 mp->elt_va_start = (uintptr_t)vaddr;
580 memcpy(mp->elt_pa, paddr, sizeof (mp->elt_pa[0]) * pg_num);
583 mp->elt_va_end = mp->elt_va_start;
585 /* call the initializer */
587 mp_init(mp, mp_init_arg);
589 mempool_populate(mp, n, 1, obj_init, obj_init_arg);
591 RTE_EAL_TAILQ_INSERT_TAIL(RTE_TAILQ_MEMPOOL, rte_mempool_list, mp);
594 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
599 /* Return the number of entries in the mempool */
601 rte_mempool_count(const struct rte_mempool *mp)
605 count = rte_ring_count(mp->ring);
607 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
610 if (mp->cache_size == 0)
613 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
614 count += mp->local_cache[lcore_id].len;
619 * due to race condition (access to len is not locked), the
620 * total can be greater than size... so fix the result
622 if (count > mp->size)
627 /* dump the cache status */
629 rte_mempool_dump_cache(const struct rte_mempool *mp)
631 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
634 unsigned cache_count;
636 printf(" cache infos:\n");
637 printf(" cache_size=%"PRIu32"\n", mp->cache_size);
638 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
639 cache_count = mp->local_cache[lcore_id].len;
640 printf(" cache_count[%u]=%u\n", lcore_id, cache_count);
641 count += cache_count;
643 printf(" total_cache_count=%u\n", count);
647 printf(" cache disabled\n");
652 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
653 /* check cookies before and after objects */
654 #ifndef __INTEL_COMPILER
655 #pragma GCC diagnostic ignored "-Wcast-qual"
658 struct mempool_audit_arg {
659 const struct rte_mempool *mp;
665 mempool_obj_audit(void *arg, void *start, void *end, uint32_t idx)
667 struct mempool_audit_arg *pa = arg;
670 obj = (char *)start + pa->mp->header_size;
671 pa->obj_end = (uintptr_t)end;
672 pa->obj_num = idx + 1;
673 __mempool_check_cookies(pa->mp, &obj, 1, 2);
677 mempool_audit_cookies(const struct rte_mempool *mp)
679 uint32_t elt_sz, num;
680 struct mempool_audit_arg arg;
682 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
685 arg.obj_end = mp->elt_va_start;
688 num = rte_mempool_obj_iter((void *)mp->elt_va_start,
690 mp->elt_pa, mp->pg_num, mp->pg_shift,
691 mempool_obj_audit, &arg);
693 if (num != mp->size) {
694 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
695 "iterated only over %u elements\n",
697 } else if (arg.obj_end != mp->elt_va_end || arg.obj_num != mp->size) {
698 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
699 "last callback va_end: %#tx (%#tx expeceted), "
700 "num of objects: %u (%u expected)\n",
702 arg.obj_end, mp->elt_va_end,
703 arg.obj_num, mp->size);
707 #ifndef __INTEL_COMPILER
708 #pragma GCC diagnostic error "-Wcast-qual"
711 #define mempool_audit_cookies(mp) do {} while(0)
714 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
715 /* check cookies before and after objects */
717 mempool_audit_cache(const struct rte_mempool *mp)
719 /* check cache size consistency */
721 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
722 if (mp->local_cache[lcore_id].len > mp->cache_flushthresh) {
723 RTE_LOG(CRIT, MEMPOOL, "badness on cache[%u]\n",
725 rte_panic("MEMPOOL: invalid cache len\n");
730 #define mempool_audit_cache(mp) do {} while(0)
734 /* check the consistency of mempool (size, cookies, ...) */
736 rte_mempool_audit(const struct rte_mempool *mp)
738 mempool_audit_cache(mp);
739 mempool_audit_cookies(mp);
741 /* For case where mempool DEBUG is not set, and cache size is 0 */
745 /* dump the status of the mempool on the console */
747 rte_mempool_dump(const struct rte_mempool *mp)
749 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
750 struct rte_mempool_debug_stats sum;
753 unsigned common_count;
754 unsigned cache_count;
756 printf("mempool <%s>@%p\n", mp->name, mp);
757 printf(" flags=%x\n", mp->flags);
758 printf(" ring=<%s>@%p\n", mp->ring->name, mp->ring);
759 printf(" phys_addr=0x%" PRIx64 "\n", mp->phys_addr);
760 printf(" size=%"PRIu32"\n", mp->size);
761 printf(" header_size=%"PRIu32"\n", mp->header_size);
762 printf(" elt_size=%"PRIu32"\n", mp->elt_size);
763 printf(" trailer_size=%"PRIu32"\n", mp->trailer_size);
764 printf(" total_obj_size=%"PRIu32"\n",
765 mp->header_size + mp->elt_size + mp->trailer_size);
767 printf(" private_data_size=%"PRIu32"\n", mp->private_data_size);
768 printf(" pg_num=%"PRIu32"\n", mp->pg_num);
769 printf(" pg_shift=%"PRIu32"\n", mp->pg_shift);
770 printf(" pg_mask=%#tx\n", mp->pg_mask);
771 printf(" elt_va_start=%#tx\n", mp->elt_va_start);
772 printf(" elt_va_end=%#tx\n", mp->elt_va_end);
773 printf(" elt_pa[0]=0x%" PRIx64 "\n", mp->elt_pa[0]);
776 printf(" avg bytes/object=%#Lf\n",
777 (long double)(mp->elt_va_end - mp->elt_va_start) /
780 cache_count = rte_mempool_dump_cache(mp);
781 common_count = rte_ring_count(mp->ring);
782 if ((cache_count + common_count) > mp->size)
783 common_count = mp->size - cache_count;
784 printf(" common_pool_count=%u\n", common_count);
786 /* sum and dump statistics */
787 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
788 memset(&sum, 0, sizeof(sum));
789 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
790 sum.put_bulk += mp->stats[lcore_id].put_bulk;
791 sum.put_objs += mp->stats[lcore_id].put_objs;
792 sum.get_success_bulk += mp->stats[lcore_id].get_success_bulk;
793 sum.get_success_objs += mp->stats[lcore_id].get_success_objs;
794 sum.get_fail_bulk += mp->stats[lcore_id].get_fail_bulk;
795 sum.get_fail_objs += mp->stats[lcore_id].get_fail_objs;
798 printf(" put_bulk=%"PRIu64"\n", sum.put_bulk);
799 printf(" put_objs=%"PRIu64"\n", sum.put_objs);
800 printf(" get_success_bulk=%"PRIu64"\n", sum.get_success_bulk);
801 printf(" get_success_objs=%"PRIu64"\n", sum.get_success_objs);
802 printf(" get_fail_bulk=%"PRIu64"\n", sum.get_fail_bulk);
803 printf(" get_fail_objs=%"PRIu64"\n", sum.get_fail_objs);
805 printf(" no statistics available\n");
808 rte_mempool_audit(mp);
811 /* dump the status of all mempools on the console */
813 rte_mempool_list_dump(void)
815 const struct rte_mempool *mp = NULL;
816 struct rte_mempool_list *mempool_list;
819 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_MEMPOOL, rte_mempool_list)) == NULL) {
820 rte_errno = E_RTE_NO_TAILQ;
824 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
826 TAILQ_FOREACH(mp, mempool_list, next) {
827 rte_mempool_dump(mp);
830 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
833 /* search a mempool from its name */
835 rte_mempool_lookup(const char *name)
837 struct rte_mempool *mp = NULL;
838 struct rte_mempool_list *mempool_list;
841 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_MEMPOOL, rte_mempool_list)) == NULL) {
842 rte_errno = E_RTE_NO_TAILQ;
846 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
848 TAILQ_FOREACH(mp, mempool_list, next) {
849 if (strncmp(name, mp->name, RTE_MEMPOOL_NAMESIZE) == 0)
853 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);