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 #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 spread
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 + RTE_CACHE_LINE_MASK) / RTE_CACHE_LINE_SIZE;
117 while (get_gcd(new_obj_size, nrank * nchan) != 1)
119 return new_obj_size * RTE_CACHE_LINE_SIZE;
123 mempool_add_elem(struct rte_mempool *mp, void *obj, uint32_t obj_idx,
124 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
126 struct rte_mempool **mpp;
128 obj = (char *)obj + mp->header_size;
130 /* set mempool ptr in header */
131 mpp = __mempool_from_obj(obj);
134 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
135 __mempool_write_header_cookie(obj, 1);
136 __mempool_write_trailer_cookie(obj);
138 /* call the initializer */
140 obj_init(mp, obj_init_arg, obj, obj_idx);
142 /* enqueue in ring */
143 rte_ring_sp_enqueue(mp->ring, obj);
147 rte_mempool_obj_iter(void *vaddr, uint32_t elt_num, size_t elt_sz, size_t align,
148 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift,
149 rte_mempool_obj_iter_t obj_iter, void *obj_iter_arg)
153 uintptr_t end, start, va;
156 pg_sz = (uintptr_t)1 << pg_shift;
157 va = (uintptr_t)vaddr;
162 while (i != elt_num && j != pg_num) {
164 start = RTE_ALIGN_CEIL(va, align);
165 end = start + elt_sz;
167 pgn = (end >> pg_shift) - (start >> pg_shift);
170 /* do we have enough space left for the next element. */
176 paddr[k] + pg_sz == paddr[k + 1];
181 * if next pgn chunks of memory physically continuous,
182 * use it to create next element.
183 * otherwise, just skip that chunk unused.
186 if (obj_iter != NULL)
187 obj_iter(obj_iter_arg, (void *)start,
193 va = RTE_ALIGN_CEIL((va + 1), pg_sz);
202 * Populate mempool with the objects.
205 struct mempool_populate_arg {
206 struct rte_mempool *mp;
207 rte_mempool_obj_ctor_t *obj_init;
212 mempool_obj_populate(void *arg, void *start, void *end, uint32_t idx)
214 struct mempool_populate_arg *pa = arg;
216 mempool_add_elem(pa->mp, start, idx, pa->obj_init, pa->obj_init_arg);
217 pa->mp->elt_va_end = (uintptr_t)end;
221 mempool_populate(struct rte_mempool *mp, size_t num, size_t align,
222 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg)
225 struct mempool_populate_arg arg;
227 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
229 arg.obj_init = obj_init;
230 arg.obj_init_arg = obj_init_arg;
232 mp->size = rte_mempool_obj_iter((void *)mp->elt_va_start,
234 mp->elt_pa, mp->pg_num, mp->pg_shift,
235 mempool_obj_populate, &arg);
239 rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
240 struct rte_mempool_objsz *sz)
242 struct rte_mempool_objsz lsz;
244 sz = (sz != NULL) ? sz : &lsz;
247 * In header, we have at least the pointer to the pool, and
248 * optionaly a 64 bits cookie.
251 sz->header_size += sizeof(struct rte_mempool *); /* ptr to pool */
252 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
253 sz->header_size += sizeof(uint64_t); /* cookie */
255 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0)
256 sz->header_size = RTE_ALIGN_CEIL(sz->header_size,
257 RTE_CACHE_LINE_SIZE);
259 /* trailer contains the cookie in debug mode */
260 sz->trailer_size = 0;
261 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
262 sz->trailer_size += sizeof(uint64_t); /* cookie */
264 /* element size is 8 bytes-aligned at least */
265 sz->elt_size = RTE_ALIGN_CEIL(elt_size, sizeof(uint64_t));
267 /* expand trailer to next cache line */
268 if ((flags & MEMPOOL_F_NO_CACHE_ALIGN) == 0) {
269 sz->total_size = sz->header_size + sz->elt_size +
271 sz->trailer_size += ((RTE_CACHE_LINE_SIZE -
272 (sz->total_size & RTE_CACHE_LINE_MASK)) &
273 RTE_CACHE_LINE_MASK);
277 * increase trailer to add padding between objects in order to
278 * spread them across memory channels/ranks
280 if ((flags & MEMPOOL_F_NO_SPREAD) == 0) {
282 new_size = optimize_object_size(sz->header_size + sz->elt_size +
284 sz->trailer_size = new_size - sz->header_size - sz->elt_size;
287 if (! rte_eal_has_hugepages()) {
289 * compute trailer size so that pool elements fit exactly in
292 int page_size = getpagesize();
293 int new_size = page_size - sz->header_size - sz->elt_size;
294 if (new_size < 0 || (unsigned int)new_size < sz->trailer_size) {
295 printf("When hugepages are disabled, pool objects "
296 "can't exceed PAGE_SIZE: %d + %d + %d > %d\n",
297 sz->header_size, sz->elt_size, sz->trailer_size,
301 sz->trailer_size = new_size;
304 /* this is the size of an object, including header and trailer */
305 sz->total_size = sz->header_size + sz->elt_size + sz->trailer_size;
307 return (sz->total_size);
312 * Calculate maximum amount of memory required to store given number of objects.
315 rte_mempool_xmem_size(uint32_t elt_num, size_t elt_sz, uint32_t pg_shift)
317 size_t n, pg_num, pg_sz, sz;
319 pg_sz = (size_t)1 << pg_shift;
321 if ((n = pg_sz / elt_sz) > 0) {
322 pg_num = (elt_num + n - 1) / n;
323 sz = pg_num << pg_shift;
325 sz = RTE_ALIGN_CEIL(elt_sz, pg_sz) * elt_num;
332 * Calculate how much memory would be actually required with the
333 * given memory footprint to store required number of elements.
336 mempool_lelem_iter(void *arg, __rte_unused void *start, void *end,
337 __rte_unused uint32_t idx)
339 *(uintptr_t *)arg = (uintptr_t)end;
343 rte_mempool_xmem_usage(void *vaddr, uint32_t elt_num, size_t elt_sz,
344 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
350 pg_sz = (size_t)1 << pg_shift;
351 va = (uintptr_t)vaddr;
354 if ((n = rte_mempool_obj_iter(vaddr, elt_num, elt_sz, 1,
355 paddr, pg_num, pg_shift, mempool_lelem_iter,
360 uv = RTE_ALIGN_CEIL(uv, pg_sz);
365 /* create the mempool */
367 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
368 unsigned cache_size, unsigned private_data_size,
369 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
370 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
371 int socket_id, unsigned flags)
373 #ifdef RTE_LIBRTE_XEN_DOM0
374 return (rte_dom0_mempool_create(name, n, elt_size,
375 cache_size, private_data_size,
376 mp_init, mp_init_arg,
377 obj_init, obj_init_arg,
380 return (rte_mempool_xmem_create(name, n, elt_size,
381 cache_size, private_data_size,
382 mp_init, mp_init_arg,
383 obj_init, obj_init_arg,
385 NULL, NULL, MEMPOOL_PG_NUM_DEFAULT, MEMPOOL_PG_SHIFT_MAX));
390 * Create the mempool over already allocated chunk of memory.
391 * That external memory buffer can consists of physically disjoint pages.
392 * Setting vaddr to NULL, makes mempool to fallback to original behaviour
393 * and allocate space for mempool and it's elements as one big chunk of
394 * physically continuos memory.
397 rte_mempool_xmem_create(const char *name, unsigned n, unsigned elt_size,
398 unsigned cache_size, unsigned private_data_size,
399 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
400 rte_mempool_obj_ctor_t *obj_init, void *obj_init_arg,
401 int socket_id, unsigned flags, void *vaddr,
402 const phys_addr_t paddr[], uint32_t pg_num, uint32_t pg_shift)
404 char mz_name[RTE_MEMZONE_NAMESIZE];
405 char rg_name[RTE_RING_NAMESIZE];
406 struct rte_mempool *mp = NULL;
407 struct rte_tailq_entry *te;
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 RTE_CACHE_LINE_MASK) != 0);
421 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
422 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_cache) &
423 RTE_CACHE_LINE_MASK) != 0);
424 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, local_cache) &
425 RTE_CACHE_LINE_MASK) != 0);
427 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
428 RTE_BUILD_BUG_ON((sizeof(struct rte_mempool_debug_stats) &
429 RTE_CACHE_LINE_MASK) != 0);
430 RTE_BUILD_BUG_ON((offsetof(struct rte_mempool, stats) &
431 RTE_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 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 RTE_CACHE_LINE_MASK) & (~RTE_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;
505 /* try to allocate tailq entry */
506 te = rte_zmalloc("MEMPOOL_TAILQ_ENTRY", sizeof(*te), 0);
508 RTE_LOG(ERR, MEMPOOL, "Cannot allocate tailq entry!\n");
513 * If user provided an external memory buffer, then use it to
514 * store mempool objects. Otherwise reserve memzone big enough to
515 * hold mempool header and metadata plus mempool objects.
517 mempool_size = MEMPOOL_HEADER_SIZE(mp, pg_num) + private_data_size;
519 mempool_size += (size_t)objsz.total_size * n;
521 if (! rte_eal_has_hugepages()) {
523 * we want the memory pool to start on a page boundary,
524 * because pool elements crossing page boundaries would
525 * result in discontiguous physical addresses
527 mempool_size += page_size;
530 snprintf(mz_name, sizeof(mz_name), RTE_MEMPOOL_MZ_FORMAT, name);
532 mz = rte_memzone_reserve(mz_name, mempool_size, socket_id, mz_flags);
535 * no more memory: in this case we loose previously reserved
536 * space for the as we cannot free it
543 if (rte_eal_has_hugepages()) {
544 startaddr = (void*)mz->addr;
546 /* align memory pool start address on a page boundary */
547 unsigned long addr = (unsigned long)mz->addr;
548 if (addr & (page_size - 1)) {
550 addr &= ~(page_size - 1);
552 startaddr = (void*)addr;
555 /* init the mempool structure */
557 memset(mp, 0, sizeof(*mp));
558 snprintf(mp->name, sizeof(mp->name), "%s", name);
559 mp->phys_addr = mz->phys_addr;
563 mp->elt_size = objsz.elt_size;
564 mp->header_size = objsz.header_size;
565 mp->trailer_size = objsz.trailer_size;
566 mp->cache_size = cache_size;
567 mp->cache_flushthresh = (uint32_t)
568 (cache_size * CACHE_FLUSHTHRESH_MULTIPLIER);
569 mp->private_data_size = private_data_size;
571 /* calculate address of the first element for continuous mempool. */
572 obj = (char *)mp + MEMPOOL_HEADER_SIZE(mp, pg_num) +
575 /* populate address translation fields. */
577 mp->pg_shift = pg_shift;
578 mp->pg_mask = RTE_LEN2MASK(mp->pg_shift, typeof(mp->pg_mask));
580 /* mempool elements allocated together with mempool */
582 mp->elt_va_start = (uintptr_t)obj;
583 mp->elt_pa[0] = mp->phys_addr +
584 (mp->elt_va_start - (uintptr_t)mp);
586 /* mempool elements in a separate chunk of memory. */
588 mp->elt_va_start = (uintptr_t)vaddr;
589 memcpy(mp->elt_pa, paddr, sizeof (mp->elt_pa[0]) * pg_num);
592 mp->elt_va_end = mp->elt_va_start;
594 /* call the initializer */
596 mp_init(mp, mp_init_arg);
598 mempool_populate(mp, n, 1, obj_init, obj_init_arg);
600 te->data = (void *) mp;
602 RTE_EAL_TAILQ_INSERT_TAIL(RTE_TAILQ_MEMPOOL, rte_mempool_list, te);
605 rte_rwlock_write_unlock(RTE_EAL_MEMPOOL_RWLOCK);
610 /* Return the number of entries in the mempool */
612 rte_mempool_count(const struct rte_mempool *mp)
616 count = rte_ring_count(mp->ring);
618 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
621 if (mp->cache_size == 0)
624 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++)
625 count += mp->local_cache[lcore_id].len;
630 * due to race condition (access to len is not locked), the
631 * total can be greater than size... so fix the result
633 if (count > mp->size)
638 /* dump the cache status */
640 rte_mempool_dump_cache(FILE *f, const struct rte_mempool *mp)
642 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
645 unsigned cache_count;
647 fprintf(f, " cache infos:\n");
648 fprintf(f, " cache_size=%"PRIu32"\n", mp->cache_size);
649 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
650 cache_count = mp->local_cache[lcore_id].len;
651 fprintf(f, " cache_count[%u]=%u\n", lcore_id, cache_count);
652 count += cache_count;
654 fprintf(f, " total_cache_count=%u\n", count);
658 fprintf(f, " cache disabled\n");
663 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
664 /* check cookies before and after objects */
665 #ifndef __INTEL_COMPILER
666 #pragma GCC diagnostic ignored "-Wcast-qual"
669 struct mempool_audit_arg {
670 const struct rte_mempool *mp;
676 mempool_obj_audit(void *arg, void *start, void *end, uint32_t idx)
678 struct mempool_audit_arg *pa = arg;
681 obj = (char *)start + pa->mp->header_size;
682 pa->obj_end = (uintptr_t)end;
683 pa->obj_num = idx + 1;
684 __mempool_check_cookies(pa->mp, &obj, 1, 2);
688 mempool_audit_cookies(const struct rte_mempool *mp)
690 uint32_t elt_sz, num;
691 struct mempool_audit_arg arg;
693 elt_sz = mp->elt_size + mp->header_size + mp->trailer_size;
696 arg.obj_end = mp->elt_va_start;
699 num = rte_mempool_obj_iter((void *)mp->elt_va_start,
701 mp->elt_pa, mp->pg_num, mp->pg_shift,
702 mempool_obj_audit, &arg);
704 if (num != mp->size) {
705 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
706 "iterated only over %u elements\n",
708 } else if (arg.obj_end != mp->elt_va_end || arg.obj_num != mp->size) {
709 rte_panic("rte_mempool_obj_iter(mempool=%p, size=%u) "
710 "last callback va_end: %#tx (%#tx expeceted), "
711 "num of objects: %u (%u expected)\n",
713 arg.obj_end, mp->elt_va_end,
714 arg.obj_num, mp->size);
718 #ifndef __INTEL_COMPILER
719 #pragma GCC diagnostic error "-Wcast-qual"
722 #define mempool_audit_cookies(mp) do {} while(0)
725 #if RTE_MEMPOOL_CACHE_MAX_SIZE > 0
726 /* check cookies before and after objects */
728 mempool_audit_cache(const struct rte_mempool *mp)
730 /* check cache size consistency */
732 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
733 if (mp->local_cache[lcore_id].len > mp->cache_flushthresh) {
734 RTE_LOG(CRIT, MEMPOOL, "badness on cache[%u]\n",
736 rte_panic("MEMPOOL: invalid cache len\n");
741 #define mempool_audit_cache(mp) do {} while(0)
745 /* check the consistency of mempool (size, cookies, ...) */
747 rte_mempool_audit(const struct rte_mempool *mp)
749 mempool_audit_cache(mp);
750 mempool_audit_cookies(mp);
752 /* For case where mempool DEBUG is not set, and cache size is 0 */
756 /* dump the status of the mempool on the console */
758 rte_mempool_dump(FILE *f, const struct rte_mempool *mp)
760 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
761 struct rte_mempool_debug_stats sum;
764 unsigned common_count;
765 unsigned cache_count;
767 RTE_VERIFY(f != NULL);
768 RTE_VERIFY(mp != NULL);
770 fprintf(f, "mempool <%s>@%p\n", mp->name, mp);
771 fprintf(f, " flags=%x\n", mp->flags);
772 fprintf(f, " ring=<%s>@%p\n", mp->ring->name, mp->ring);
773 fprintf(f, " phys_addr=0x%" PRIx64 "\n", mp->phys_addr);
774 fprintf(f, " size=%"PRIu32"\n", mp->size);
775 fprintf(f, " header_size=%"PRIu32"\n", mp->header_size);
776 fprintf(f, " elt_size=%"PRIu32"\n", mp->elt_size);
777 fprintf(f, " trailer_size=%"PRIu32"\n", mp->trailer_size);
778 fprintf(f, " total_obj_size=%"PRIu32"\n",
779 mp->header_size + mp->elt_size + mp->trailer_size);
781 fprintf(f, " private_data_size=%"PRIu32"\n", mp->private_data_size);
782 fprintf(f, " pg_num=%"PRIu32"\n", mp->pg_num);
783 fprintf(f, " pg_shift=%"PRIu32"\n", mp->pg_shift);
784 fprintf(f, " pg_mask=%#tx\n", mp->pg_mask);
785 fprintf(f, " elt_va_start=%#tx\n", mp->elt_va_start);
786 fprintf(f, " elt_va_end=%#tx\n", mp->elt_va_end);
787 fprintf(f, " elt_pa[0]=0x%" PRIx64 "\n", mp->elt_pa[0]);
790 fprintf(f, " avg bytes/object=%#Lf\n",
791 (long double)(mp->elt_va_end - mp->elt_va_start) /
794 cache_count = rte_mempool_dump_cache(f, mp);
795 common_count = rte_ring_count(mp->ring);
796 if ((cache_count + common_count) > mp->size)
797 common_count = mp->size - cache_count;
798 fprintf(f, " common_pool_count=%u\n", common_count);
800 /* sum and dump statistics */
801 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
802 memset(&sum, 0, sizeof(sum));
803 for (lcore_id = 0; lcore_id < RTE_MAX_LCORE; lcore_id++) {
804 sum.put_bulk += mp->stats[lcore_id].put_bulk;
805 sum.put_objs += mp->stats[lcore_id].put_objs;
806 sum.get_success_bulk += mp->stats[lcore_id].get_success_bulk;
807 sum.get_success_objs += mp->stats[lcore_id].get_success_objs;
808 sum.get_fail_bulk += mp->stats[lcore_id].get_fail_bulk;
809 sum.get_fail_objs += mp->stats[lcore_id].get_fail_objs;
811 fprintf(f, " stats:\n");
812 fprintf(f, " put_bulk=%"PRIu64"\n", sum.put_bulk);
813 fprintf(f, " put_objs=%"PRIu64"\n", sum.put_objs);
814 fprintf(f, " get_success_bulk=%"PRIu64"\n", sum.get_success_bulk);
815 fprintf(f, " get_success_objs=%"PRIu64"\n", sum.get_success_objs);
816 fprintf(f, " get_fail_bulk=%"PRIu64"\n", sum.get_fail_bulk);
817 fprintf(f, " get_fail_objs=%"PRIu64"\n", sum.get_fail_objs);
819 fprintf(f, " no statistics available\n");
822 rte_mempool_audit(mp);
825 /* dump the status of all mempools on the console */
827 rte_mempool_list_dump(FILE *f)
829 const struct rte_mempool *mp = NULL;
830 struct rte_tailq_entry *te;
831 struct rte_mempool_list *mempool_list;
834 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_MEMPOOL, rte_mempool_list)) == NULL) {
835 rte_errno = E_RTE_NO_TAILQ;
839 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
841 TAILQ_FOREACH(te, mempool_list, next) {
842 mp = (struct rte_mempool *) te->data;
843 rte_mempool_dump(f, mp);
846 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
849 /* search a mempool from its name */
851 rte_mempool_lookup(const char *name)
853 struct rte_mempool *mp = NULL;
854 struct rte_tailq_entry *te;
855 struct rte_mempool_list *mempool_list;
858 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_MEMPOOL, rte_mempool_list)) == NULL) {
859 rte_errno = E_RTE_NO_TAILQ;
863 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
865 TAILQ_FOREACH(te, mempool_list, next) {
866 mp = (struct rte_mempool *) te->data;
867 if (strncmp(name, mp->name, RTE_MEMPOOL_NAMESIZE) == 0)
871 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);
881 void rte_mempool_walk(void (*func)(const struct rte_mempool *, void *),
884 struct rte_tailq_entry *te = NULL;
885 struct rte_mempool_list *mempool_list;
888 RTE_TAILQ_LOOKUP_BY_IDX(RTE_TAILQ_MEMPOOL, rte_mempool_list)) == NULL) {
889 rte_errno = E_RTE_NO_TAILQ;
893 rte_rwlock_read_lock(RTE_EAL_MEMPOOL_RWLOCK);
895 TAILQ_FOREACH(te, mempool_list, next) {
896 (*func)((struct rte_mempool *) te->data, arg);
899 rte_rwlock_read_unlock(RTE_EAL_MEMPOOL_RWLOCK);